TGF-β1 induction of the adenine nucleotide translocator 1 in astrocytes occurs through Smads and Sp1 transcription factors

Background  

The adenine nucleotide translocator 1 (Ant1) is an inner mitochondrial membrane protein involved with energy mobilization during oxidative phosphorylation. We recently showed that rodent Ant1 is upregulated by transforming growth factor-beta (TGF-β) in reactive astrocytes following CNS injury. In the present study, we describe the molecular mechanisms by which TGF-β1 regulates Ant1 gene expression in cultured primary rodent astrocytes.     

A projection method for solving incompressible viscous flows on domains with moving boundaries

In this paper, a projection method is presented for solving the flow problems in domains with moving boundaries. In order to track the movement of the domain boundaries, arbitrary‐Lagrangian–Eulerian (ALE) co‐ordinates are used. The unsteady incompressible Navier–Stokes equations on the ALE co‐ordinates are solved by using a projection method developed in this paper. This projection method is based on the Bell's Godunov‐projection method. However, substantial changes are made so that this algorithm is capable of solving the ALE form of incompressible Navier–Stokes equations. Multi‐block structured grids are used to discretize the flow domains. The grid velocity is not explicitly computed; instead the volume change is used to account for the effect of grid movement. A new method is also proposed to compute the freestream capturing metrics so that the geometric conservation law (GCL) can be satisfied exactly in this algorithm. This projection method is also parallelized so that the state of the art high performance computers can be used to match the computation cost associated with the moving grid calculations. Several test cases are solved to verify the performance of this moving‐grid projection method. Copyright © 2004 John Wiley Sons, Ltd.     

The Hochschild class of the Chern character for semifinite spectral triples

We provide a proof of Connes’ formula for a representative of the Hochschild class of the Chern character for (p,∞)-summable spectral triples. Our proof is valid for all semifinite von Neumann algebras, and all integral p?1. We employ the minimum possible hypotheses on the spectral triples.     

The emergence of a giant component in random subgraphs of pseudo‐random graphs

Let G be a d‐regular graph G on n vertices. Suppose that the adjacency matrix of G is such that the eigenvalue λ which is second largest in absolute value satisfies λ = o(d). Let G_p with p = α/d be obtained from G by including each edge of G independently with probability p. We show that if α < 1, then whp the maximum component size of G_p is O(log n) and if α > 1, then G_p contains a unique giant component of size Ω(n), with all other components of size O(log n). © 2003 Wiley Periodicals, Inc. Random Struct. Alg., 2004     

Spectral Domain Analysis of Coaxial Cavities

Coaxial cavities are used in high power gyrotrons as the beam-wave interaction structure. Much research has been devoted to their mode selective properties. A coaxial cavity lacks a sharp boundary at its open end, so it has some physical features that can only be observed using a spectral model, such as frequency-dependent field profiles and mode overlapping effects. These properties are important since cold tests are usually conducted in the frequency domain. This study applies the incident/reflected wave boundary condition to the wave equation of a weakly irregular coaxial waveguide. The resistivity of the wall is considered in the analysis. Calculations reveal that the fixed-position spectrum yields an uncertain resonant frequency and quality factor. Although the maximum-field spectrum can uniquely determine the properties of the coaxial cavity, the resonant frequency obtained using the maximum-field spectral model is inconsistent with that obtained using the temporal model. The field-energy spectrum explains the low Q nature of the coaxial cavity. Moreover, resonant frequencies evaluated using the field-energy spectrum agree precisely with those evaluated using the temporal model.     

Synthesis and characterization of wholly aromatic poly(azomethine)s containing donor–acceptor triphenylamine moieties

N‐(4‐nitrophenyl)‐4′,4″‐bisformyl‐diphenylamine was synthesized from N‐(4‐nitrophenyl)‐diphenylamine by the Vilsmeier‐Haack reaction. Soluble aromatic poly(azomethine)s (PAMs) were prepared by the solution polycondensation of N‐(4‐nitrophenyl)‐4′,4″‐bisformyl‐diphenylamine and aromatic diamine in N‐methyl‐2‐pyrrolidone (NMP) at room temperature under reduced pressure. All the PAMs are highly soluble in various organic solvents, such as N,N‐dimethylacetamide (DMAc), chloroform (CHCl₃), and tetrahydrofuran (THF). Differential scanning calorimetry (DSC) indicated that these PAMs had glass‐transition temperatures (T_gs) in the range of 170–230 °C, and a 10% weight‐loss temperatures in excess of 490 °C with char yield at 800 °C in nitrogen higher than 60%. These PAMs in NMP solution showed UV‐Vis charge‐transfer (CT) absorption at 405–421 nm and photoluminescence peaks around 462–466 nm with fluorescence quantum efficiency (Φ_F) 0.10–0.99%. The highest occupied molecular orbital (HOMO) and lowest unoccupied molecular orbital (LUMO) energy levels of these PAMs can be determined from cyclic voltammograms as 4.86–5.43 and 3.31–3.34 eV, respectively. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 4921–4932, 2007     

Some New uniform frames with block size four and index one or three

In this paper, some new uniform frames with block size four and index one or three are obtained. The known existence results for (4,1)‐frames and (4,3)‐frames are both improved to the extent that only a finite number of possible exceptions remain. © 2003 Wiley Periodicals, Inc.     

An exponential lower bound to the size of bounded depth frege proofs of the pigeonhole principle

We prove lower bounds of the form exp(n^{ε d}), ε_d > 0, on the length of proofs of an explicit sequence of tautologies, based on the Pigeonhole Principle, in proof systems using formulas of depth d, for any constant d. This is the largest lower bound for the strongest proof system, for which any superpolynomial lower bounds are known.