Synthesis of New Schiff Bases and Assessment of Their in vitro Biological Effects on Acetylcholinesterase and Carbonic Anhydrase Isoenzymes Activities

Russian Journal of Organic Chemistry - In this study, three new Schiff bases have been synthesized by the reactions of commercially available phenylglycinol, phenylalaninol, and leuicinol with...     

Axonal sodium and potassium conductance density determines spiking dynamical properties of regular- and fast-spiking neurons

Nonlinear Dynamics - Compared with regular-spiking (RS) neurons, the action potentials (APs) of fast-spiking (FS) neurons are characterized by narrow spike durations and unusually fast decay...     

[Cs6Cl][Fe24Se26]: A Host–Guest Compound with Unique Fe–Se Topology

The novel host–guest compound [Cs₆Cl][Fe₂₄Se₂₆] (I4/mmm; a=11.0991(9), c=22.143(2) Å) was obtained by reacting Cs₂Se, CsCl, Fe, and Se in closed ampoules. This is the first member of a family of compounds with unique Fe–Se topology, which consists of edge‐sharing, extended fused cubane [Fe₈Se₆Se_8/3] blocks that host a guest complex ion, [Cs₆Cl]⁵⁺. Thus Fe is tetrahedrally coordinated and divalent with strong exchange couplings, which results in an ordered antiferromagnetic state below T_N=221 K. At low temperatures, a distribution of hyperfine fields in the Mössbauer spectra suggests a structural distortion or a complex spin structure. With its strong Fe–Se covalency, the compound is close to electronic itinerancy and is, therefore, prone to exhibit tunable properties.     

On the polyhedral lift-and-project methods and the fractional stable set polytope

We study two polyhedral lift-and-project operators (originally proposed by Lovász and Schrijver in 1991) applied to the fractional stable set polytopes. First, we provide characterizations of all valid inequalities generated by these operators. Then, we present some seven-node graphs on which the operator enforcing the symmetry of the matrix variable is strictly stronger on the odd-cycle polytope of these graphs than the operator without this symmetry requirement. This disproves a conjecture of Lipták and Tunçel from 2003.     

Two new furostanol saponins from Tribulus terrestris L.

<正>Two new furostanol glycoside,26-O-β-D-glucopyranosyl-(25S)-5α-furost-3β,22α,26-triol-3-O-β-D-rhamnopyranosyl-(1→2)-[β-D-glucopyranosyl-(1→4)]-β-D-galactopyranoside(1) and 26-O-β-D-glucopyranosyl-(25S)-5α-furost-20(22)-en-2α,3β,26-triol-3-O-β-D-glucopyranosyl-(1→2)-O-β-D-glucopyranosyl-(1→4)-β-D-galactopyranoside(2) were isolated fromthe fruits of Tribulus terrestris L.The structures of two new furostanol saponins were elucidated by spectroscopic methods.     

模糊传感器概念生成方法的研究

本文在简要介绍了模糊传感器概念生成基本原理的基础上,结合作者的研究工作,详细论述了概念生成的各种方法,对于开展模糊传感器的研究具有重要的理论意义和较大的实用价值     

Nucleosides XIII. Facile Synthesis of 4‐Amino‐1‐(2‐deoxy‐β‐D‐ribofuranosyl)quinazolin‐2‐one as a 2′‐Deoxycytidine Analog for Oligonucleotide Synthesis

4‐Amino‐1‐(2‐deoxy‐β‐D‐ribofuranosyl)quinazolin‐2‐one (4) was prepared by Barton deoxygenation from 4‐amino‐1‐(β‐D‐ribofuranosyl)quinazolin‐2‐one (3) as a 2′‐deoxycytidine analog.     

一类非自治四阶微分方程解的一致有界性

对一类非自治四阶微分方程的一切解,给出了有界和一致有界的充分条件     

Approximating the complexity measure of Vavasis-Ye algorithm is NP-hard

Given an m×n integer matrix A of full row rank, we consider the problem of computing the maximum of ∥B ^-1 A∥₂ where B varies over all bases of A. This quantity appears in various places in the mathematical programming literature. More recently, logarithm of this number was the determining factor in the complexity bound of Vavasis and Ye’s primal-dual interior-point algorithm. We prove that the problem of approximating this maximum norm, even within an exponential (in the dimension of A) factor, is NP-hard. Our proof is based on a closely related result of L. Khachiyan [1]. Received November 13, 1998 / Revised version received January 20, 1999? Published online May 12, 1999     

Invariance and efficiency of convex representations

We consider two notions for the representations of convex cones G-representation and lifted-G-representation. The former represents a convex cone as a slice of another; the latter allows in addition, the usage of auxiliary variables in the representation. We first study the basic properties of these representations. We show that some basic properties of convex cones are invariant under one notion of representation but not the other. In particular, we prove that lifted-G-representation is closed under duality when the representing cone is self-dual. We also prove that strict complementarity of a convex optimization problem in conic form is preserved under G-representations. Then we move to study efficiency measures for representations. We evaluate the representations of homogeneous convex cones based on the “smoothness” of the transformations mapping the central path of the representation to the central path of the represented optimization problem. Research of the first author was supported in part by a grant from the Faculty of Mathematics, University of Waterloo and by a Discovery Grant from NSERC. Research of the second author was supported in part by a Discovery Grant from NSERC and a PREA from Ontario, Canada.