Effects of target gas in collision-induced dissociation using a double quadrupole mass spectrometer and radiofrequency

Collision-induced dissociation (CID) of polyatomic ions sampled from an rf-powered glow discharge is examined by using three target gases including atomic (Ar and Xe) and molecular species (N2). Collisions with these targets in the first quadrupole of the double quadrupole system result in the loss of discharge species by dissociation, symmetric and asymmetric charge exchange, and scattering, each to varying degrees. These processes are seen to be a function of the relative mass, size... and ionization potentials of the target species, as well as the collision center-of-mass energies. In light of the comparisons, xenon appears to be the best collision target for both CID and charge exchange because of its relatively low ionization potential and high dissociation efficiency of polyatornic species. Evidence for both symmetric and asymmetric charge exchange is presented for Ar and Xe target gases.     

Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings

Probabilistic algorithms are developed for a basic problem in distributed computation, assuming anonymous, asynchronous, unidirectional rings of processors. The problem, known as Solitude Detection, requires that a nonempty subset of the processors, calledcontenders, determine whether or not there is exactly one contender. Monte Carlo algorithms are developed that err with probability bounded by a specified parameter and exhibit either message or processor termination. The algorithms transmit an optimal expected number of bits, to within a constant factor. Their bit complexities display a surprisingly rich dependence on the kind of termination exhibited and on the processors' knowledge of the size of the ring. Two probabilistic tools are isolated and then combined in various ways to achieve all our algorithms.     

Size,chromatic number,and connectivity

We consider the minimum number of edges in ak-edge-connected graph of ordern with chromatic number at leastc, obtaining the optimal bounds in most cases.     

The entropies of renewal systems

Renewal systems are symbolic dynamical systems originally introduced by Adler. IfW is a finite set of words over a finite alphabetA, then the renewal system generated byW is the subshiftX _W ⊂A ^Z formed by bi-infinite concatenations of words fromW. Motivated by Adler’s question of whether every irreducible shift of finite type is conjugate to a renewal system, we prove that for every shift of finite type there is a renewal system having the same entropy. We also show that every shift of finite type can be approximated from above by renewal systems, and that by placing finite-type constraints on possible concatenations, we obtain all sofic systems. The authors were supported in part by NFS grants DMS-8706284, DMS-8814159 and DMS-8820716.     

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.     

Young's inequality in trace-class operators

 If a and b are trace-class operators, and if u is a partial isometry, then , where ∥⋅∥₁ denotes the norm in the trace class. The present paper characterises the cases of equality in this Young inequality, and the characterisation is examined in the context of both the operator and the Hilbert–Schmidt forms of Young's inequality. Received: 20 December 2001 / Revised version: 11 July 2002 / Published online: 10 February 2003 Mathematics Subject Classification (2000): 47A63, 15A60