A Novel Cardiac Glycoside from Parepigynum funingesis

From the dried aerial part ofParepigynumfuningesis Tsiang et P. T. Li (Apocynaceae),a new cardiac glucoside, named parefuningoside (1) had been isolated. Its structure was determined by means of hydrolysis and spectral analysis.     

Synthesis and Photocytotoxicity of Mono-functionalised Porphyrin with Valine Moiety

A mono-funtionalised tetraphenylporphyrin (TPP) bearing valine moiety at the phenyl ring was synthesized for photocytotoxicity examination in four steps, starting from regiospecific mono-nitration of TPP at the phenyl ring. The in vitro photocytotoxicitic effect against SPC-Al adenocarcinona cell line was tested.     

Crystal Structures of Two Potential Tumor Imaging Agents and Therapeutic Agents Copper（Ⅱ） Ternary Complexes with Salicylidene-tyrosinato Schiff Base and Nitrogen-donor Chelating Lewis Base

The crystal structures of two potential tumor imaging agents and therapeutic agents -copper(Ⅱ) complexes with salicylidene-tyrosinato Schiff base and nitrogen-donor chelating Lewis base, [Cu(sal-tyr)(bipy)] 1 and [Cu(sal-tyr)(phen)]2CH3OH 2 are presented. Our work is helpful to get deep understanding of novel 64Cu tumor imaging agents and therapeutic agents.     

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.     

全景图像几何畸变校正的算法研究及其软件实现

对于360°视场的全景图像,本文提出了分别对其进行切向和径向畸变校正的处理算法,并用插值处理提高处理精度。达到了将全景图像恢复为常规视场平面像的目的。它是进一步图像分析的前期工作。     

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.     

Nowhere zero 4‐flow in regular matroids

Jensen and Toft 8 conjectured that every 2‐edge‐connected graph without a K₅‐minor has a nowhere zero 4‐flow. Walton and Welsh 19 proved that if a coloopless regular matroid M does not have a minor in {M(K_3,3), M*(K₅)}, then M admits a nowhere zero 4‐flow. In this note, we prove that if a coloopless regular matroid M does not have a minor in {M(K₅), M*(K₅)}, then M admits a nowhere zero 4‐flow. Our result implies the Jensen and Toft conjecture. © 2005 Wiley Periodicals, Inc. J Graph Theory