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.     

Synthesis of Novel Monomeric Dyes with Anthraquinone Residue

Two novel polymerizable dyes with anthraquinone residue have been prepared, and their structures were characterized by FTIR, ^1HNMR and EA.     

Synthesis of paramagnetic BODIPY dyes as new double (spin and fluorescence) sensors

Paramagnetic pyrroline and 1,2,3,6-tetrahydropyridine derivatives of BODIPY and their diamagnetic analogs have been synthesized and characterized as novel redox double sensor and cation sensitive reagents.     

DISTRIBUTIONS OF LIMIT CYCLES FOR POLYNOMIAL VECTOR FIELDS (P_2, Q_3)

The distributions of limit cycles of cubic vector fields (P2, Q3) are considered in this paper, where P2 and Q3 are polynomials of x and y of order two and three, respectively. It is possibly seven different distributions of limit cycles given in [1]. We now prove that in which three kinds of distributions are impossible and other four kinds all can be realized by concrete vector fields of (P2,Q3). Some related results are also given.     

非负矩阵与有向图的谱半径

本文给出非负矩阵的谱半径的上界、下界,由此给出有向图的谱半径的界.     

张 ■教授与我国的植物科学

张（１８８４—１９５０），植物学家和生物学教育家．中国近代植物学的先驱、现代实验性植物生理学和植物生态学的奠基人．最先自编我国第一套植物学、植物形态学、植物解剖学、种子植物分类学、植物生态学和植物生理学教科书．长期从事植物学科的教学和研究工作，为我国的生物科学和教育事业的建立和发展，贡献了自己的一切知识和力量．     

RANDOM EDGE can be exponential on abstract cubes

We prove that RANDOM EDGE, the simplex algorithm that always chooses a random improving edge to proceed on, can take a mildly exponential number of steps in the model of abstract objective functions (introduced by Williamson Hoke [Completely unimodal numberings of a simple polytope, Discrete Appl. Math. 20 (1988) 69-81.] and by Kalai [A simple way to tell a simple polytope from its graph, J. Combin. Theory Ser. A 49(2) (1988) 381-383.] under different names). We define an abstract objective function on the n-dimensional cube for which the algorithm, started at a random vertex, needs at least exp(const·n^1/3) steps with high probability. The best previous lower bound was quadratic. So in order for RANDOM EDGE to succeed in polynomial time, geometry must help.