Capillary Electrophoresis Chiral Separation for Enantiomeric Purity Determination of a Basic Drug in Pharmaceutical Formulations

Capillary electrophoresis using a running buffer composed of β-cyclodextrin as the chiral selector and ethanolamine mesylate at pH 9.6 is being used to monitor the stereochemical stability of a hydrophobic drug, containing two chiral centers, in two different formulated self-emulsifying drug delivery system (SEDDS) products. The separation takes place in less than 25 min. Strategies for enhancing the method reproducibility and detection sensitivity in the lower potency formulation are presented. The results demonstrating the specificity, assay precision, recovery, linearity and range achieved during the method validation experiments are presented in this paper.Presented at: CE in the Biotechnology and Pharmaceutical Industries: 7th Symposium on the Practical Applications for the Analysis of Proteins, Nucleotides and Small Molecules, Montreal, Canada, August 12–16, 2005.     

On the critical exponents of random k‐SAT

There has been much recent interest in the satisfiability of random Boolean formulas. A random k‐SAT formula is the conjunction of m random clauses, each of which is the disjunction of k literals (a variable or its negation). It is known that when the number of variables n is large, there is a sharp transition from satisfiability to unsatisfiability; in the case of 2‐SAT this happens when m/n → 1, for 3‐SAT the critical ratio is thought to be m/n ≈ 4.2. The sharpness of this transition is characterized by a critical exponent, sometimes called ν = ν_k (the smaller the value of ν the sharper the transition). Experiments have suggested that ν₃ = 1.5 ± 0.1. ν₄ = 1.25 ± 0.05, ν₅ = 1.1 ± 0.05, ν₆ = 1.05 ± 0.05, and heuristics have suggested that ν_k → 1 as k → ∞. We give here a simple proof that each of these exponents is at least 2 (provided the exponent is well defined). This result holds for each of the three standard ensembles of random k‐SAT formulas: m clauses selected uniformly at random without replacement, m clauses selected uniformly at random with replacement, and each clause selected with probability p independent of the other clauses. We also obtain similar results for q‐colorability and the appearance of a q‐core in a random graph. © 2002 Wiley Periodicals, Inc. Random Struct. Alg., 21: 182–195, 2002     

Time Evolution of Vibration-Induced Excited State Decay

A simple model consisting of two electronic levels and one vibrational mode (phonon) was theoretically studied. The electronic-vibrational interaction was linear in the vibrational displacement. The vibrational mode was taken in the harmonic approximation and was attached to the thermal bath formed by the ambient environment. The kinetic constants of the vibrational dissipation were of the second order in the vibrational-bath coupling and were taken in the Markovian limit. Although, depending on the parameters of the model, different curves of the non-radiative vibration-induced excited state decay were obtained, in general, three time intervals, corresponding to different physical behaviour, were found. In the short-time interval, small oscillations superimposed on the excited state decay were observed. They were determined by the vibrational frequency and influenced by electronic-vibrational coupling. In the middle-time interval, almost quasi-exponential decay was detected; its rate constant increased with stronger electronic-vibrational interaction and speed of vibrational relaxation. In the long-time interval, the decay was very slow and, under special conditions, even an asymptotic non-zero excited state population was observed. Its value increased with the strength of the off-diagonal electron-vibrational coupling. Links of the parameters of the model with quantum chemical terms were estimated.     

The plus construction, Postnikov towers and universal central module extensions

Given a connected spaceX, we consider the effect of Quillen’s plus construction on the homotopy groups ofX in terms of its Postnikov decomposition. Specifically, using universal properties of the fibration sequenceAX→X→X ⁺, we explain the contribution of π _n X to π _n X ⁺, π _n+1 X ⁺ and π _n AX, π _n+1 AX explicitly in terms of the low dimensional homology of π _n X regarded as a module over π₁ X. Key ingredients developed here for this purpose are universal II-central fibrations and a theory of universal central extensions of modules, analogous to universal central extensions of perfect groups. Research partially supported by NSERC of Canada.     

Towards the Evaluation of the Relevant Degrees of Freedom in Nonlinear Partial Differential Equations

We investigate an operator renormalization group method to extract and describe the relevant degrees of freedom in the evolution of partial differential equations. The proposed renormalization group approach is formulated as an analytical method providing the fundamental concepts of a numerical algorithm applicable to various dynamical systems. We examine dynamical scaling characteristics in the short-time and the long-time evolution regime providing only a reduced number of degrees of freedom to the evolution process.     

Une nouvelle méthode de raffinement de maillage spatio-temporel pour l'équation des ondes

In the present Note we introduce an extension of the conservative space–time mesh refinement method presented by Fouquet et al. We also propose a post-treatment of the solution that reduces the spurious phenomena due to the non-conformity between the time meshes. A reinterpretation of the equations in terms of new unknowns leads to a new scheme with second order consistent coupling equations. Numerical experiments in 2D and a plane wave analysis for the 1D model show that the method is second order accurate for an arbitrary refinement. To cite this article: J. Rodríguez, C. R. Acad. Sci. Paris, Ser. I 339 (2004).     

Extraction-ability and -selectivity of tetra-aza-crown ethers for transition metal cations

In order to investigate the relative effects of the differences between the structures and lipophilicities of 1, 10-dioxa-4, 7, 13, 16-tetra-azacyclo-octadecane (TA-18-crown-6) and the tetrabenzyl derivative of 1,10-dioxa-4, 7, 13, 16-tetra-azacyclo-octadecane (TBTA-18-crown-6) on their extraction-abilities and -selectivities for transition metal cations, constants of the overall extraction (logK _ex) of 1:1 (M:L) complexes, the distribution (K _D) for two diluents (CH₂Cl₂ and CHCl₃) with different dielectric constants have been determined at 25 ± 0.1 °C. The magnitude of logK _ex is largely determined by that of K _D. The equilibrium constants of TA-18-crown-6 have been compared with those of TBTA-18-crown-6. It is found that:(i) logK _ex sequences of TA-18-crown-6 and TBTA-18-crown-6 for transition metals in CH₂Cl₂ lie in order: Fe³⁺ > Cu²⁺ > Mn²⁺ > Co²⁺ > Cd²⁺ > Ni²⁺ > Zn²⁺ and Fe³⁺ > Cu²⁺ > Co²⁺ > Mn²⁺ > Ni²⁺ > Cd²⁺ > Zn²⁺ respectively; (ii) the stability sequences of two types of tetra-aza-crown ethers with the transition metal cations in CHCl₃ are the same as follows: Fe³⁺ > Ni²⁺ > Cu²⁺ > Co²⁺ > Zn²⁺ > Cd²⁺ > Mn²⁺, and (iii) unusual selectivities are observed for transition metal-tetra-aza-crowns, e.g. the high Fe³⁺/M ⁿ⁺ selectivity factors (S_f) of TA-18-crown-6, except for the competitive-extractions for the special case in CHCl₃ of TBTA-18-crown-6, it was found that the Mn²⁺/M ⁿ⁺ values were relatively higher according to the other transition metal cations. A systematic sequence in these two types of solvents is not found for a given transition metal cation in terms of the variation of selectivity with the tetra-aza-crown ethers. The results provide alternatives for the rational design of other specific ligands on the transition metal cations.     

The auction algorithm for the transportation problem

The auction algorithm is a parallel relaxation method for solving the classical assignment problem. It resembles a competitive bidding process whereby unassigned persons bid simultaneously for objects, thereby raising their prices. Once all bids are in, objects are awarded to the highest bidder. This paper generalizes the auction algorithm to solve linear transportation problems. The idea is to convert the transportation problem into an assignment problem, and then to modify the auction algorithm to exploit the special structure of this problem. Computational results show that this modified version of the auction algorithm is very efficient for certain types of transportation problems.