Colorimetric recognition of different enzymology-concerning transition metals based on a hybrid cluster complex.

A hybrid cluster complex, formed by chelating a chromogenic ligand to a [2Fe-2S] cluster, sensitively exhibited differential colorimetric responses towards Hg2+, Cd2+, Cr3+, Pb2, Sn2+, Cu2+, Zn2+, Fe3+ and Co2+ in water at physiological pH. Speciation of some of these metal elements, such as Cr(III) and Sn(IV), was also studied by UV/Vis absorption.     

光纤光栅选频掺Yb3+双包层光纤激光器

利用相位掩模法 ,在D形内包层掺Yb3 双包层光纤一端直接写制出Bragg光栅 ,用作双包层光纤激光器的输出腔镜 .试验得到了线宽为 0 196nm ,波长为 10 5 8 2nm ,最高输出功率为 5 70mW的稳定激光输出 ,解决了激光器中模式竞争造成的输出不稳定现象 .从速率方程出发 ,对激光器的输出功率与抽运功率、光栅反射率的关系以及最佳光纤长度进行了理论分析 ,结果与实验符合很好     

Synthesis of New 13-O-Acylavermectin Bl Aglycones

Six new 13-O-acylavermectin Bl aglycones(3-8) were synthesized from avermectin B1 aglycone and their bioactivities were evaluated against Spodoptera exigua, Spodoptera eridania, Tetranychus urticae and Aphis fabae.     

The First and Facile Synthesis of (±) Syringaresinol

The first and facile synthesis of (±)syringaresinol was described.     

Optimality Conditions and Geometric Properties of a Linear Multilevel Programming Problem with Dominated Objective Functions

In this paper, a model of a linear multilevel programming problem with dominated objective functions (LMPPD(l)) is proposed, where multiple reactions of the lower levels do not lead to any uncertainty in the upper-level decision making. Under the assumption that the constrained set is nonempty and bounded, a necessary optimality condition is obtained. Two types of geometric properties of the solution sets are studied. It is demonstrated that the feasible set of LMPPD(l) is neither necessarily composed of faces of the constrained set nor necessarily connected. These properties are different from the existing theoretical results for linear multilevel programming problems.     

New heuristics for over-constrained flight to gate assignments

We consider the over-constrained Airport Gate Assignment Problem where the number of flights exceed the number of gates available, and where the objectives are to minimize the number of ungated flights and the total walking distances. The problem is formulated as a binary quadratic programming problem. We design a greedy algorithm and use a Tabu Search meta-heuristic to solve the problem. The greedy algorithm minimizes ungated flights while we devise a new neighbourhood search technique, the Interval Exchange Move, which allows us flexibility in seeking good solutions, especially when flight schedules are dense in time. Experiments conducted give good results.     

A note on the necessary conditions for the algebraic Riccati equation

We derive some useful and easily computable necessary conditionsfor the existence of a positive semi-definite solution to thealgebraic Ricatti equation (ARE). A motivating example is givento highlight the usefulness of the conditions for controllerand observer designs for nonlinear systems. Further, an upperbound on the trace of the solution to the ARE is also derived.     

The Classification and Realization of Complete Lie Algebras with Commutative Nilpotent Radicals

in this paper, the classification and realization of complete Lie algebras withcommutative nilpotent radicals are given. From this, some results on the radicals of thesecomplete Lie algebras are obtained.     

OU型Markov过程的不变测度及弱对偶性

本文研究ＯＵ型Ｍａｒｋｏｖ过程的不变测度、参考测度和弱对偶半群的存在性问题，并得出了不变测度的唯一性。