Baker＇s Yeast Mediated Reduction of Optically Active Diketone

Baker‘s yeast mediated reduction of optically active diketone is described. The two keto groups are efficiently differentiated and the ee value of the recovered material is considerably raised. It affords highly optically active key intermediates efficiently for the synthesis of natural polyhydroxylated agarofuran products.     

An Unusual Reductive Ring-opening Reaction of Phthalimide with Sodium Hydride in DMF

An unusual reductive ring-opening reaction of phthalimide with sodium hydride in anhydrous DMF was observed for the first time. The presumed mechanism was described in detail.     

Dynamic Strategic Pricing and Speed of Diffusion

Defining speed of diffusion as the amount of time it takes to get from one penetration level to a higher one, we introduce a dynamic model in which we study the link between pricing policy, speed of diffusion, and number of competitors in the market. Our analysis shows that, in the case of strategic (oligopolistic) competition, the speed of diffusion has an important influence on the optimal pricing policy. In particular, we find that higher speeds of diffusion create an incentive to strategically interacting firms to lower their prices.     

基于粗糙集理论的知识约简及应用实例

在保持分类能力不变的前提下 ,通过利用粗糙集理论中的知识约简方法 ,在保护知识库分类不变的条件下 ,删除其中不相关或不重要的知识 ,从而导出问题的决策 .利用基于决策表的粗糙集模型算法 ,实例分析如何数字化表示决策表 ,并对其进行属性约简和属性值的约简 ,从而提取决策规则 .     

Karhunen–Loeve representations of turbulent channel flows using the method of snapshots

For three‐dimensional flows with one inhomogeneous spatial coordinate and two periodic directions, the Karhunen–Loeve procedure is typically formulated as a spatial eigenvalue problem. This is normally referred to as the direct method (DM). Here we derive an equivalent formulation in which the eigenvalue problem is formulated in the temporal coordinate. It is shown that this so‐called method of snapshots (MOS) has some numerical advantages when compared to the DM. In particular, the MOS can be formulated purely as a matrix composed of scalars, thus avoiding the need to construct a matrix of matrices as in the DM. In addition, the MOS avoids the need for so‐called weight functions, which emerge in the DM as a result of the non‐uniform grid typically employed in the inhomogeneous direction. The avoidance of such weight functions, which may exhibit singular behaviour, guarantees satisfaction of the boundary conditions. The MOS is applied to data sets recently obtained from the direct simulation of turbulence in a channel in which viscoelasticity is imparted to the fluid using a Giesekus model. The analysis reveals a steep drop in the dimensionality of the turbulence as viscoelasticity is increased. This is consistent with the results that have been obtained with other viscoelastic models, thus revealing an essential generic feature of polymer‐induced drag reduced turbulent flows. Published in 2006 by John Wiley & Sons, Ltd.     

空间有源消声的微机控制

本文讨论用通用微机控制空间有源消声．以修正的PID（比例、积分、微分）算法加上逻辑判断构成的控制软件，使得系统收敛迅速，跟踪速度快，消声效果令人满意，而且系统工作稳定可靠，     

High power CW solid-state multilaser system

A laser system containing four CW Nd:YAG double-rod lasers, transforming optics and a fibre with input-output optics has been designed and investigated. It is shown that reduction of the beam parameter product of the non-Gaussian beams in the image space of the lens has made it possible to collect the emission of four lasers to the same fibre. Independent laser operation has provided the output power control in the range of 10–900 W with a stable light spot size on the input end of the fibre.     

Decomposition Methods for Differentiable Optimization Problems over Cartesian Product Sets

This paper presents a unified analysis of decomposition algorithms for continuously differentiable optimization problems defined on Cartesian products of convex feasible sets. The decomposition algorithms are analyzed using the framework of cost approx imation algorithms. A convergence analysis is made for three decomposition algorithms: a sequential algorithm which extends the classical Gauss-Seidel scheme, a synchronized parallel algorithm which extends the Jacobi method, and a partially asynchronous parallel algorithm. The analysis validates inexact computations in both the subproblem and line search phases, and includes convergence rate results. The range of feasible step lengths within each algorithm is shown to have a direct correspondence to the increasing degree of parallelism and asynchronism, and the resulting usage of more outdated information in the algorithms.     

THE RADICALS OF HOPF MODULE ALGEBRAS

ＴＨＥＲＡＤＩＣＡＬＳＯＦＨＯＰＦＭＯＤＵＬＥＡＬＧＥＢＲＡＳＺＨＡＮＧＳＨＯＵＣＨＵＡＮ＊ＡｂｓｔｒａｃｔＴｈｅｃｈａｒａｃｔｅｒｉｚａｔｉｏｎｏｆＨ－ｐｒｉｍｅｒａｄｉｃａｌｉｓｇｉｖｅｎｉｎｍａｎｙｗａｙｓ．Ｍｅａｎｔｉｍｅ，ｔｈｅｒｅｌａｔｉ...     

Probability relations involving several subsystems

We consider the question of factorizability in tensor product spaces, and argue that the correlations associated with entangled states are even more problematic in the general case involving any tensor product of Hilbert spaces, than in the Einstein, Podolsky, and Rosen case with only two [1].