Three-dimensional structure of Saccharomyces cerevisiae inorganic pyrophosphatase complexed with cobalt and phosphate ions

Crystals of Saccharomyces cerevisiae inorganic pyrophosphatase suitable for X-ray diffraction study were grown by cocrystallization of the enzyme with cobalt chloride and imidodiphosphate. Saccharomyces cerevisiae is a metal-dependent enzyme which catalyzes hydrolysis of inorganic pyrophosphate to orthophosphate. The three-dimensional structure of this enzyme was solved by the molecular-replacement method and refined at 1.8 Å resolution to an R factor of 19.5%. Cobalt and phosphate ions were revealed in the active centers of both identical subunits (A and B) of the pyrophosphatase molecule. In subunit B, a water molecule was found between two cobalt ions. It is believed that this water molecule acts as an attacking nucleophile in the enzymatic cleavage of the pyrophosphate bond. It was demonstrated that cobalt ions and a phosphate group occupy only part of the potential binding sites (two chemically identical and crystallographically independent subunits have different binding sites). The arrangement of ligands and the structure of the nucleophile-binding site are discussed in relation to the mechanism of action of the enzyme and the nature of the metal activator.     

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.     

Karhunen–Loeve representations of turbulent channel flows using the method of snapshots

For three‐dimensional flows with one inhomogeneous spatial coordinate and two periodic directions, the Karhunen–Loeve procedure is typically formulated as a spatial eigenvalue problem. This is normally referred to as the direct method (DM). Here we derive an equivalent formulation in which the eigenvalue problem is formulated in the temporal coordinate. It is shown that this so‐called method of snapshots (MOS) has some numerical advantages when compared to the DM. In particular, the MOS can be formulated purely as a matrix composed of scalars, thus avoiding the need to construct a matrix of matrices as in the DM. In addition, the MOS avoids the need for so‐called weight functions, which emerge in the DM as a result of the non‐uniform grid typically employed in the inhomogeneous direction. The avoidance of such weight functions, which may exhibit singular behaviour, guarantees satisfaction of the boundary conditions. The MOS is applied to data sets recently obtained from the direct simulation of turbulence in a channel in which viscoelasticity is imparted to the fluid using a Giesekus model. The analysis reveals a steep drop in the dimensionality of the turbulence as viscoelasticity is increased. This is consistent with the results that have been obtained with other viscoelastic models, thus revealing an essential generic feature of polymer‐induced drag reduced turbulent flows. Published in 2006 by John Wiley & Sons, Ltd.     

Kinetics of benzonitrile nitration with mixed acid under homogeneous conditions

Chemical kinetics of benzonitrile nitration with mixed acid is investigated in the temperature range 283–299 K. Pseudo-first-order rate constants are evaluated by means of rate experiments on homogeneous reacting mixtures having large stoichiometric excesses of nitric acid. The second-order kinetic constants for nitronium ion attack to the aromatic substrate are derived on the basis of the assessed nitration mechanism. An activation energy of 604 ± 37 kJ mol^?1 is calculated for this reaction step. © 1993 John Wiley & Sons, Inc.     

AN ALTERNATIVE SPECIFICATION FOR MODELING GROUNDWATER DYNAMICS

This research extends previous work with dynamic models to manage groundwater quality by using the consumptive nitrate use rate instead of the nitrate application rate. The analysis indicates that misspecification results in overestimation of economic benefits, and supra-optimum nitrogen fertilizer application rates and groundwater nitrate stocks at a steady state.     

Selective saturation and inversion of multiple resonances in high-resolution solid-state 13C experiments using slow spinning CP/MAS and tailored DANTE pulse sequences.

Taking advantage of the long 13C T1 values generally encountered in solids, selective saturation and inversion of more than one resonance in 13C CP/MAS experiments can be achieved by sequentially applying several DANTE pulse sequences centered at different transmitter frequency offsets. A new selective saturation pulse sequence is introduced composed of a series of 90 degrees DANTE sequences separated by interrupted decoupling periods during which the selected resonance is destroyed. Applications of this method, including the simplification of the measurement of the principal values of the 13C chemical shift tensor under slow MAS conditions, are described. The determination of the aromaticity of coal using a relatively slow MAS rate is also described.     

A Primitive Non-symmetric 3-Class Association Scheme on 36 Elements with p11 = 0 Exists and is Unique

In this paper we construct a primitive, non-symmetric 3-class association scheme with parameters v = 36, v₁ = 7, p¹₁₁ = 0 and p²₁₁ = 4 and show that such a scheme is determined by its parameters.     

A Faster Deterministic Maximum Flow Algorithm

Cheriyan and Hagerup developed a randomized algorithm to compute the maximum flow in a graph with n nodes and m edges in O(mn + n² log²n) expected time. The randomization is used to efficiently play a certain combinatorial game that arises during the computation. We give a version of their algorithm where a general version of their game arises. Then we give a strategy for the game that yields a deterministic algorithm for computing the maximum flow in a directed graph with n nodes and m edges that runs in time O(mn(log_{m/n log n}n)). Our algorithm gives an O(mn) deterministic algorithm for all m/n = Ω(n^ε) for any positive constant ε, and is currently the fastest deterministic algorithm for computing maximum flow as long as m/n = ω(log n).