Size complementarity in anion recognition by neutral macrocyclic tetraamides

Comparison of the anion binding properties of a series of uncharged macrocyclic tetraamides reveal significant effects of the receptor's size on the strength of its anion complexes. This study allowed for estimation of the optimal size of a macroring for complexation of common anions.     

Recent advances in the analysis of steroid hormones and related drugs.

The development during the last 15 years and the state-of-the-art in the analysis of bulk steroid hormone drugs and hormone-like structures and pharmaceutical formulations made thereof are summarized. Other steroids (sterols, bile acids, cardiac glycosides, vitamins D) as well as biological-clinical aspects and pharmacokinetic and metabolic studies are excluded from this review. The state-of-the-art is summarized based on comparisons of monographs in the latest editions of the European Pharmacopoeia, United States Pharmacopoeia and the Japanese Pharmacopoeia. This is followed by sections dealing with new developments in the methodology for the fields of spectroscopic and spectrophotometric, chromatographic, electrophoretic and hyphenated techniques as well electroanalytical methods. The review is terminated by two problem-oriented sections: examples on impurity and degradation profiling as well as enantiomeric analysis.     

Electrochemical reduction of 1-([(4-halophenyl)imino]methyl)-2-naphthols in aprotic media.

The electrochemical reduction of 1-([(4-halophenyl)imino]methyl)-2-naphthols on graphite electrodes was studied using cyclic voltammetry, chronoamperometry, constant-potential coulometry and preparative constant-potential electrolysis techniques. The data revealed that the reduction on graphite was irreversible and followed an EC mechanism. The diffusion coefficients and the number of electrons transferred were determined using the chronoamperometric Cottrell slope and the ultramicro disc Pt-electrode steady-state current. The number of electrons was also determined by bulk electrolysis. The compounds were subjected to constant-potential preparative electrolysis and the electrolysis products were purified and identified by spectroscopic methods. Based on these findings, a mechanism for the electro-reduction process is proposed.     

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.     

A modular integer GCD algorithm

This paper describes the first algorithm to compute the greatest common divisor (GCD) of two n-bit integers using a modular representation for intermediate values U, V and also for the result. It is based on a reduction step, similar to one used in the accelerated algorithm [T. Jebelean, A generalization of the binary GCD algorithm, in: ISSAC '93: International Symposium on Symbolic and Algebraic Computation, Kiev, Ukraine, 1993, pp. 111–116; K. Weber, The accelerated integer GCD algorithm, ACM Trans. Math. Softw. 21 (1995) 111–122] when U and V are close to the same size, that replaces U by (U−bV)/p, where p is one of the prime moduli and b is the unique integer in the interval (−p/2,p/2) such that . When the algorithm is executed on a bit common CRCW PRAM with O(nlognlogloglogn) processors, it takes O(n) time in the worst case. A heuristic model of the average case yields O(n/logn) time on the same number of processors.     

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.     

The Matsumoto-Yor property and the structure of the Wishart distribution

This paper establishes a link between a generalized matrix Matsumoto-Yor (MY) property and the Wishart distribution. This link highlights certain conditional independence properties within blocks of the Wishart and leads to a new characterization of the Wishart distribution similar to the one recently obtained by Geiger and Heckerman but involving independences for only three pairs of block partitionings of the random matrix.In the process, we obtain two other main results. The first one is an extension of the MY independence property to random matrices of different dimensions. The second result is its converse. It extends previous characterizations of the matrix generalized inverse Gaussian and Wishart seen as a couple of distributions.We present two proofs for the generalized MY property. The first proof relies on a new version of Herz's identity for Bessel functions of matrix arguments. The second proof uses a representation of the MY property through the structure of the Wishart.