Presence of nucleoside triphosphates and calcium associated with mycobacteriophage I3

The association of nucleoside triphosphate molecules and calcium ions with purified particles of mycobacteriophage I3 has been documented. The content of nucleoside triphosphate has been determined to be 118 molecules per phage particle by equilibrium dialysis against labelled ATP or 148 molecules per phage particle by the direct determination of labelled nucleoside triphosphate.The concentration of bound Ca2+ exhibited a high degree of variation between different batches, which may be due to the nonspecific binding of Ca2+ by the virus particles. However, the tightly bound Ca2+ not removable by dialysis against calciumspecific chelating agent, showed a constant value of 2985 atoms/phage particle.

Singlet and triplet molecular interaction in excimers

A perturbative approach is developed to determine, term by term, the contributions of the various forces to the excimer potentials of the singlet and triplet excimers. The results show that the singlet excimer of naphthalene is more stable than the corresponding triplet excimer primarily due to large contributions of the exciton-resonance and the dispersion energy terms. The variation of the various terms with the conformations of the excimers suggests that the singlet and triplet excimers of naphthalene cannot have identical structure.

Thermo-chemical interpretation of polymer degradation

A correlation has been established between the heat of depolymerization (DeltaH) of vinyl polymers for going from solid polymer state to gaseous monomer state and the activation energy (E) of degradation. On this basis it has been shown that the rate controlling step in the degradation lies in the initiation step. Attempt has been made to correlate theE and DeltaH with glass transition temperature (Tg) and melting temperature (Tm) of the polymers.[/ p]

Mechanistic studies on polymer flame retardancy Effect of Tribromoaniline

Abstract is not available.

Requirement for calcium ions in mycobacteriophage I3 DNA injection and propagation

Ca2+ ions are absolutely necessary for the propagation of mycobacteriophage I3 in synthetic medium. These ions are required for successful infection of the host and during the entire span of the intracellular development of the phage. A direct assay of the phage DNA injection using 32[P] labelled phage, showns that Ca2+ ions are necessary for the injection process. The injection itself is a slow process and takes 15 min to complete at 37°C. The bacteria infected in presence of Ca2+ tend to abort if the ions are subsequently withdrawn from the growth medium. The effect of calcium withdrawal is maximally felt during the early part of the latent period; however, later supplementation of Ca2+ ions salvage phage production and the mature phage progeny appear after a delayed interval, proportional to the time of addition of Ca2+.

Lipids of some thermophilic fungi

Total lipid content in the thermophilic fungi—Thermoascus aurantiacus, Humicola lanuginosa, Malbranchea pulchella var.sulfurea, andAbsidia ramosa—varied from 5.3 to 19.1% of mycelial dry weight. The neutral and polar lipid fractions accounted for 56.4 to 80.2% and 19.8 to 43.6%, respectively. All the fungi contained monoglycerides, diglycerides, triglycerides, free fatty acids, and sterols in variable amounts. Sterol ester was detected only inA. ramosa. Phosphatide composition was: phosphatidyl choline (15.9–47%), phosphatidyl ethanolamine (23.4–67%), phosphatidyl serine (9.3–17.6%), and phosphatidyl inositol (1.9–11.9%). Diphosphatidyl glycerol occurred in considerable quantity only inH. lanuginosa andM. pulchella var.sulfurea. Phosphatidic acid, detected as a minor component only inM. pulchella var.sulfurea andA. ramosa, does not appear to be a characteristic phosphatide of thermophilic fungi as suggested earlier. The 16∶0, 16∶1, 18∶0, 18∶1, and 18∶2 acids were the main fatty acid components. In addition,A. ramosa contained 18∶3 acid. Total lipids contained an average of 0.93 double bonds per mole of fatty acids, and neutral lipids tend to be more unsaturated than phospholipids.

Visual Analysis of Biomolecular Surfaces

Surface models of biomolecules have become crucially important for the study and understanding of interaction between biomolecules and their environment. We argue for the need for a detailed understanding of biomolecular surfaces by describing several applications in computational and structural biology. We review methods used to model, represent, characterize, and visualize biomolecular surfaces focusing on the role that geometry and topology play in identifying features on the surface. These methods enable the development of efficient computational and visualization tools for studying the function of biomolecules.

Confirmation of linkage and refinement of the RP28 locus for autosomal recessive retinitis pigmentosa on chromosome 2p14-p15 in an Indian family

PURPOSE: To report the linkage analysis of retinitis pigmentosa (RP) in an Indian family. METHODS: Individuals were examined for symptoms of retinitis pigmentosa and their blood samples were withdrawn for genetic analysis. The disorder was tested for linkage to known 14 adRP and 22 arRP loci using microsatellite markers. RESULTS: Seventeen individuals including seven affecteds participated in the study. All affected individuals had typical RP. The age of onset of the disease ranged from 8-18 years. The disorder in this family segregated either as an autosomal recessive trait with pseudodominance or an autosomal dominant trait. Linkage to an autosomal recessive locus RP28 on chromosome 2p14-p15 was positive with a maximum two-point lod score of 3.96 at theta=0 for D2S380. All affected individuals were homozygous for alleles at D2S2320, D2S2397, D2S380, and D2S136. Recombination events placed the minimum critical region (MCR) for the RP28 gene in a 1.06 cM region between D2S2225 and D2S296. CONCLUSIONS : The present data confirmed linkage of arRP to the RP28 locus in a second Indian family. The RP28 locus was previously mapped to a 16 cM region between D2S1337 and D2S286 in a single Indian family. Haplotype analysis in this family has further narrowed the MCR for the RP28 locus to a 1.06 cM region between D2S2225 and D2S296. Of 15 genes reported in the MCR, 14 genes (KIAA0903, OTX1, MDH1, UGP2, VPS54, PELI1, HSPC159, FLJ20080, TRIP-Br2, SLC1A4, KIAA0582, RAB1A, ACTR2, and SPRED2) are either expressed in the eye or retina. Further study needs to be done to test which of these genes is mutated in patients with RP linked to the RP28 locus.

Nonlinear intrinsic instability of solid propellant combustion including gas-phase thermal inertia

The problem of homogeneous solid propellant combustion instability is studied with a one-dimensional flame model, including the effects of gas-phase thermal inertia and nonlinearity. Computational results presented in this paper show nonlinear instabilities inherent in the equations, due to which periodic burning is found even under steady ambient conditions such as pressure. The stability boundary is obtained in terms of Denison-Baum parameters. It is found that inclusion of gas-phase thermal inertia stabilizes the combustion. Also, the effect of a distributed heat release in the gas phase, compared to the flame sheet model, is to destabilize the burning. Direct calculations for finite amplitude pressure disturbances show that two distinct resonant modes exist, the first one near the natural frequency as obtained from intrinsic instability analysis and a second mode occurring at a much higher driving frequency. It is found that er rn in the low frequency region, the response of the propellant is significantly affected by the specific type of gas-phase chemical heat-release model employed. Examination of frequency response function reveals that the role of gas-phase thermal inertia is to stabilize the burning near the first resonant mode. Calculations made for different amplitudes of driving pressure show that the mean burning rate decreases with increasing amplitude. Also, with an increase in the driving amplitude, higher harmonics are generated in the burning rate.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.

Improving Performance of Result Caches in Network Processors

Digest caches have been proposed as an effective method tospeed up packet classification in network processors. In this paper, weshow that the presence of a large number of small flows and a few largeflows in the Internet has an adverse impact on the performance of thesedigest caches. In the Internet, a few large flows transfer a majority ofthe packets whereas the contribution of several small flows to the totalnumber of packets transferred is small. In such a scenario, the LRUcache replacement policy, which gives maximum priority to the mostrecently accessed digest, tends to evict digests belonging to the few largeflows. We propose a new cache management algorithm called SaturatingPriority (SP) which aims at improving the performance of digest cachesin network processors by exploiting the disparity between the number offlows and the number of packets transferred. Our experimental resultsdemonstrate that SP performs better than the widely used LRU cachereplacement policy in size constrained caches. Further, we characterizethe misses experienced by flow identifiers in digest caches.

Performance analysis of a fluid queue with random service rate in discrete time

We consider a fluid queue in discrete time with random service rate. Such a queue has been used in several recent studies on wireless networks where the packets can be arbitrarily fragmented. We provide conditions on finiteness of moments of stationary delay, its Laplace-Stieltjes transform and various approximations under heavy traffic. Results are extended to the case where the wireless link can transmit in only a few slots during a frame.

Opportunistic scheduling of wireless links

We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue has its own link (transmission) rate. The link rate of a queue can vary randomly from slot to slot. The queue lengths and channel states of all users are known at the beginning of each slot. We show the existence of an optimal policy that minimizes the long term (discounted) average sum of queue lengths. The optimal policy, in general needs to be computed numerically. Then we identify a greedy (one step optimal) policy, MAX-TRANS which is easy to implement and does not require the channel and traffic statistics. The cost of this policy is close to optimal and better than other well-known policies (when stable) although it is not throughput optimal for asymmetric systems. We (approximately) identify its stability region and obtain approximations for its mean queue lengths and mean delays. We also modify this policy to make it throughput optimal while retaining good performance.

A decidable temporal logic with repeating values

Various logical formalisms with the freeze quantifier have been recently considered to model computer systems even though this is a powerful mechanism that often leads to undecidability. In this paper, we study a linear-time temporal logic with past-time operators such that the freeze operator is only used to express that some value from an infinite set is repeated in the future or in the past. Such a restriction has been inspired by a recent work on spatio-temporal logics. We show decidability of finitary and infinitary satisfiability by reduction into the verification of temporal properties in Petri nets. This is a surprising result since the logic is closed under negation, contains future-time and past-time temporal operators and can express the nonce property and its negation. These ingredients are known to lead to undecidability with a more liberal use of the freeze quantifier.