Novel Lanthanide Complexes of Ciprofloxacin: Synthesis,Characterization, Crystal Structure and in vitro Antibacterial Activity Studies

Novel lanthanide coordination compounds with ciprofloxacin (CPFX), including eleven complexes Ln(CPFX)₂Cl(H₂O), (Ln=Pr, Nd, Sm, Eu, Gd, Tb, Dy, Ho, Er, Tm, Yb; n = 7, 8, 9) and crystalline [Ce(CPFX)₂ (H₂O)₄] Cl (H₂O)_3.25 (C₂H₅‐OH)_0.25, were synthesized. The crystal is of triclinic space group Pi with a= 1.3865(2) nm, b = 1.3899(3) nm, c = 1.6505(2) nm, a = 92.73(1)°, β= 114.39(1)°, γ=115.55 (1)°, Z = 2 and R = 0.0449. FT‐IR, electronic spectroscopy and X‐ray diffraction were employed to show that the lanthanide ion, which displays an eight‐coordinate structure, is chelated by 3‐carboxyl and 4‐keto oxygen donors of CPFX and two six‐membered chelate rings are formed. Test of in vitro antibacterial activity against E. coli, P. aeruginosa and S. aureus indicated that the in vitro antibacterial activity of the ligand can be improved by complexation with Ce(III).     

Synthesis of axially chiral C10-BridgePHOS oxides and their use as organocatalysts in enantioselective allylations of aldehydes

A series of C₁₀-BridgePHOS oxides possessing different substituted groups on the diphenyl phosphine system were synthesized and tested as organocatalysts in the allylation of aldehydes with allyltrichlorosilane, providing chiral homoallylic alcohols. These types of organocatalysts showed high catalytic activity and only 2 mol% catalyst loading was required to induce short reaction times. Under optimal reaction conditions, excellent product yields and up to 92% ee were obtained for a variety of substrates.     

Improved algorithm about NSFOT

For the purpose of further saving computing time, an improved algorithm about NSFOT is provided in this paper. That is, by introducing the simple operations such as preprocessing or after-processing, Haar and Walsh transforms are performed conveniently on the multiprocessor. As a result, one large size problem is divided into several small size sub-problems, load on every processor not only decreases greatly but also gets so uniform that much time is saved. Both the theoretical analysis and experimental results demonstrate the effectiveness of the proposed approach.     

Conjugate Addition of Indole to α,β‐Unsaturated Ketones Catalyzed by Lewis Acid Immobilized on a Biorenewable Support

Sulfonated carbonaceous solid acid was prepared straightforwardly from household granulated sucrose through a one‐pot carbonization—sulfonation process. The performance of this solid Brønsted acid was tested by the 1,1‐diacylation of aldehydes. Lewis acid, such as indium chloride, was supported on sucrose‐derived carbonaceous solid acid through anion metathesis and successfully applied to the conjugate addition of indole to α,β‐unsaturated ketones.     

Tissue engineering and peripheral nerve regeneration (III)

The biodegradation rate and biocompatibility of poly (d, / -lactide) (PDLLA)in vivo were evaluated. The aim of this study was to establish a nerve guide constructed by the PDLLA with 3-D microenvironment and to repair a 10 mm of sciatic nerve gap in rats. The process of the nerve regeneration was investigated by histological assessment, electrophysiological examination, and determination of wet weight recovery rate of the gastrocnemius muscle. After 3 weeks, the nerve guide had changed from a transparent to an opaque status. The conduit was degraded and absorbed partly and had lost their strength with breakage at the 9th week of postoperation. At the conclusion of 12 weeks, proximal and distal end of nerves were anastomosed by nerve regeneration and the conduit vanished completely. The results suggest that PDLLA conduits may serve for peripheral nerve regeneration and PDLLA is a sort of hopeful candidate for tissue engineering.     

Improving multicut in directed trees by upgrading nodes

In this paper, we consider the network improvement problem for multicut by upgrading nodes in a directed tree T = (V, E) with multiple sources and multiple terminals. In a node based upgrading model, a node v can be upgraded at the expense of c(v) and such an upgrade reduces weights on all edges incident to v. The objective is to upgrade a minimum cost subset S ⊆ V of nodes such that the resulting network has a multicut in which no edge has weight larger than a given value D. We first obtain a minimum cardinality node multicut V_c for tree T, then find the minimum cost upgrading set based on the upgrading sets for the subtrees rooted at the nodes in V_c. We show that our algorithm is polynomial when the number of source–terminal pairs is upper bounded by a given value.     

LMS估计与岩性反演

该文介绍一类岩性反演问题．从理论上分析LMS估计的结构。在空间齐次假设下，得到不变矩阵α＝（αij）的递推计算关系．同时，建立一种计算机模拟岩性的算法，该算法被实践证明是有效的．