Structure of the active site of sulfite dehydrogenase from Starkeya novella

In this paper, we report the results of molybdenum K-edge X-ray absorption studies performed on the oxidized and reduced active sites of the sulfite dehydrogenase from Starkeya novella. Our results provide the first direct structural information on the active site of the oxidized form of this enzyme and confirm the conclusions derived from protein crystallography that the molybdenum coordination is analogous to that of the sulfite oxidases. The molybdenum atom of the oxidized enzyme is bound by two Mo=O ligands at 1.73 angstrom and three thiolate Mo-S ligands at 2.42 angstrom, whereas the reduced enzyme has one oxo at 1.74 angstrom, one long oxygen at 2.19 angstrom (characteristic of Mo-OH2), and three Mo-S ligands at 2.40 angstrom.

Local structures around Y and Ce cations in 10 mol% Y2O3 doped ceria ceramics by EXAFS spectroscopy

Local structures around host Ce and dopant Y cations in 10 mol% Y2O3 doped ceria solid solutions have been investigated by room and high temperature EXAFS spectroscopy. The results show that the local structures around the Cc cation in doped ceria samples are similar to that in the fluorite CeO2 structure though the coordination numbers of Ce-O tend to be smaller than 8. The local structures around Y cation, however, are significantly different from those around Ce cation, and show more resemblance to that around Y cation in the C-type Y2O3 Structure. A more accurate description of the local structures around Y cation in doped ceria was given by analyzing Y-K edge EXAFS spectra based on the C-type Y2O3 structure. (c) 2006 Elsevier B.V. All rights reserved.

Decompositions of complete tripartite graphs into triangles with an edge attached

Let K(r, s, t) denote the complete tripartite graph with partite sets of size r, s and t, where r less than or equal to s less than or equal to t. Let D be the graph consisting of a triangle with an edge attached. We show that K(r, s, t) may be decomposed into copies of D if and only if 4 divides rs + st + rt and t less than or equal to 3rs/(r + s).

Superplasticity and superplastic forming ability of a Zr-Ti-Ni-Cu-Be bulk metallic glass in the supercooled liquid recgion

The superplastic deformation behavior and superplastic forming ability of the Zr41.25Ti13.75Ni10Cu12.5Be22.5 (at.%) bulk metallic glass (BMG) in the supercooled liquid region were investigated. The isothermal tensile results indicate (hat the BMG exhibits a Newtonian behavior at low strain rates but a non-Newtonian behavior at hiqh-strain rates in the initial deformation stage. The maximum elongation reaches as high as 1624% at 656 K. and nanocrystallization was found to occur during the deformation process. Based cm the analysis on tensile deformation. a gear-like micropart is successfully die-forged via a superplastic forgings process. demonstrating that the BMG has excellent workability in the supercooled liquid region. (C) 2004 Elsevier B.V. All rights reserved.

Edge-to-edge matching and its applications - Part II. Application to Mg-Al, Mg-Y and Mg-Mn alloys

A model for the crystallography and morphology of diffusion-controlled phase transformations - edge-to-edge matching - has been used to predict the orientation relationships (OR) and habit planes of precipitates Mg17Al12 in Mg-Al alloy, Mg24Y5 in Mg-Y alloy and alpha-Mn in Mg-Mn alloy. Based on the crystal structures and lattice parameters only, the model predicts that the possible ORs between Mg17Al12 and Mg matrix are the near Burgers OR, the Potter OR, the Gjonnes-Ostmoe OR and the Crawley OR. In the Mg-Y alloy, the OR between Mg24Y5 precipitates and the Mg matrix is predicted to be the Burgers OR only. The model also predicts that there are no reproducible ORs between alpha-Mn and Mg in the Mg-Mn alloy. Combining the edge-to-edge matching model and W. Zhang's Deltag approach, the habit plane and side facets of the precipitate for each OR can be determined. All the predicted ORs and the corresponding habit planes in Mg-Al and Mg-Y alloys agree very well with the experimental results. (C) 2004 Acta Materialia Inc. Published by Elsevier Ltd. All rights reserved.

Cutting edge: Species-specific TLR9-mediated recognition of CpG and non-CpG phosphorothioate-modified ohgonucleotides

Different DNA motifs are required for optimal stimulation Of mouse and human immune cells by CpG oligode-oxynucleotides (ODN). These species differences presumably reflect sequence differences in TLR9, the CPG DNA receptor. In this study, we show that this sequence specificity is restricted to phosphorothioate (PS)-modified ODN and is not observed when a natural phosphodiester backbone is used. Thus, human and mouse cells have not evolved to recognize different CpG motifs in natural DNA. Nonoptimal PS-ODN (i.e., mouse CpG motif on human cells and vice versa) gave delayed and less sustained phosphorylation of p38 AWK than optimal motifs. When the CpG dinucleotide was inverted to GC In each ODN some residual activity of the PS-ODN was retained in a species-specific, TLR-9-dependent manner. Thus, TLR9 may he responsible for mediating many published CpG-independent responses to PS-ODN.

Models of adding relations to an organization structure of a complete K-ary tree

This paper proposes three models of adding relations to an organization structure which is a complete K-ary tree of height H: (i) a model of adding an edge between two nodes with the same depth N, (ii) a model of adding edges between every pair of nodes with the same depth N and (iii) a model of adding edges between every pair of siblings with the same depth N. For each of the three models, an optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes. (c) 2005 Elsevier B.V. All rights reserved.

Edge-coloured cube decompositions

An edge-colored graph is a graph H together with a function f:E(H) → C where C is a set of colors. Given an edge-colored graph H, the graph induced by the edges of color c C is denoted by H(c). Let G, H, and J be graphs and let μ be a positive integer. A (J, H, G, μ) edge-colored graph decomposition is a set S = {H 1,H 2,...,H t} of edge-colored graphs with color set C = {c 1, c 2,..., c k} such that Hi ≅ H for 1 ≤ i ≤ t; Hi (cj) ≅ G for 1 ≤ i ≤ t and ≤ j ≤ k; and for j = 1, 2,..., k, each edge of J occurs in exactly μ of the graphs H 1(c j ), H 2(c j ),..., H t (c j ). Let Q 3 denote the 3-dimensional cube. In this paper, we find necessary and sufficient conditions on n, μ and G for the existence of a (K n ,Q 3,G, μ) edge-colored graph decomposition. © Birkhäuser Verlag, Basel 2007.