Rate of ribonucleic acid chain growth in Mycobacterium tuberculosis H37Rv.

Two methods were employed to measure the rate of ribonucleic acid (RNA) chain growth in vivo in Mycobacterium tuberculosis H37Rv cultures growing in Sauton medium at 37 degrees C, with a generation time of 10 h. In the first, the bacteria were allowed to assimilate [3H]uracil or [3H]guanine into their RNA for short time periods. The RNA was then extracted and hydrolyzed with alkali, and the radioactivity in the resulting nucleotides and nucleosides was measured. The data obtained by this method allowed the calculation of the individual nucleotide step times during the growth of RNA chains, from which the average rate of RNA chain elongation was estimated to be about 4 nucleotides per s. The second method employed the antibiotic rifampin, which specifically inhibits the initiation of RNA synthesis without interfering with the elongation and completion of nascent RNA chains. Usint this method, the transcription time of the 16S, 23S, and 5S ribosomal RNA genes was estimated to be 7.6 min, which corresponds to a ribosomal RNA chain growth rate of 10 nucleotides per s.

A Model of Anomalous Chain Translocation Dynamics

A model of polymer translocation based on the stochastic dynamics of the number of monomers on one side of a pore-containing surface is formulated in terms of a one-dimensional generalized Langevin equation, in which the random force is assumed to be characterized by long-ranged temporal correlations. The model is introduced to rationalize anomalies in measured and simulated values of the average time of passage through the pore, which in general cannot be satisfactorily accounted for by simple Brownian diffusion mechanisms. Calculations are presented of the mean first passage time for barrier crossing and of the mean square displacement of a monomeric segment, in the limits of strong and weak diffusive bias. The calculations produce estimates of the exponents in various scaling relations that are in satisfactory agreement with available data.

Modified density matrix renormalization group algorithm for the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange: Comparison with field theory at large J(2)/J(1)

A modified density matrix renormalization group (DMRG) algorithm is applied to the zigzag spin-1/2 chain with frustrated antiferromagnetic exchange J(1) and J(2) between first and second neighbors. The modified algorithm yields accurate results up to J(2)/J(1) approximate to 4 for the magnetic gap Delta to the lowest triplet state, the amplitude B of the bond order wave phase, the wavelength lambda of the spiral phase, and the spin correlation length xi. The J(2)/J(1) dependences of Delta, B, lambda, and xi provide multiple comparisons to field theories of the zigzag chain. The twist angle of the spiral phase and the spin structure factor yield additional comparisons between DMRG and field theory. Attention is given to the numerical accuracy required to obtain exponentially small gaps or exponentially long correlations near a quantum phase transition.

On Minimization of Test Application Time for RAS

Conventional Random access scan (RAS) for testing has lower test application time, low power dissipation, and low test data volume compared to standard serial scan chain based design In this paper, we present two cluster based techniques, namely, Serial Input Random Access Scan and Variable Word Length Random Access Scan to reduce test application time even further by exploiting the parallelism among the clusters and performing write operations on multiple bits Experimental results on benchmarks circuits show on an average 2-3 times speed up in test write time and average 60% reduction in write test data volume

Phonological Mean Length of Utterance as an indicator of typical and impaired phonological development in children acquiring Finnish

The aim of this study was to examine the applicability of the Phonological Mean Length of Utterance (pMLU) method to the data of children acquiring Finnish, for both typically developing children and children with a Specific Language Impairment (SLI). Study I examined typically developing children at the end of the one-word stage (N=17, mean age 1;8), and Study II analysed children s (N=5) productions in a follow-up study with four assessment points (ages 2;0, 2;6, 3;0, 3;6). Study III was carried out in the form of a review article that examined recent research on the phonological development of children acquiring Finnish and compared the results with general trends and cross-linguistic findings in phonological development. Study IV included children with SLI (N=4, mean age 4;10) and age-matched peers. The analyses in Studies I, II and IV were made using the quantitative pMLU method. In the pMLU method, pMLU values are counted for both the words that the children targeted (so-called target words) and the words produced by the children. When the child s average pMLU value was divided with the average target word pMLU value, it is possible to examine that child s accuracy in producing the words with the Whole-Word Proximity (PWP) value. In addition, the number of entirely correctly produced words is counted to obtain the Whole-Word Correctness (PWC) value. Qualitative analyses were carried out in order to examine how the children s phoneme inventories and deficiencies in phonotactics would explain the observed pMLU, PWP and PWC values. The results showed that the pMLU values for children acquiring Finnish were relatively high already at the end of the one-word stage (Study I). The values were found to reflect the characteristics of the ambient language. Typological features that lead to cross-linguistic differences in pMLU values were also observed in the review article (Study III), which noted that in the course of phonological acquisition there are a large number of language-specific phenomena and processes. Study II indicated that overall the children s phonological development during the follow-up period was reflected in the pMLU, PWP and PWC values, although the method showed limitations in detecting qualitative differences between the children. Correct vowels were not scored in the pMLU counts, which led to some misleadingly high pMLU and PWP results: vowel errors were only reflected in the PWC values. Typically developing children in Study II reached the highest possible pMLU results already around age 3;6. At the same time, the differences between the children with SLI and age-matched peers in the pMLU values were very prominent (Study IV). The values for the children with SLI were similar to the ones reported for two-year-old children. Qualitative analyses revealed that the phonologies of the children with SLI largely resembled the ones of younger, typically developing children. However, unusual errors were also witnessed (e.g., vowel errors, omissions of word-initial stops, consonants added to the initial position in words beginning with a vowel). This dissertation provides an application of a new tool for quantitative phonological assessment and analysis in children acquiring Finnish. The preliminary results suggest that, with some modifications, the pMLU method can be used to assess children s phonological development and that it has some advantages compared to the earlier, segment-oriented approaches. Qualitative analyses complemented the pMLU s observations on the children s phonologies. More research is needed in order to verify the levels of the pMLU, PWP and PWC values in children acquiring Finnish.

Average lattices and aperiodic structures

Statistically averaged lattices provide a common basis to understand the diffraction properties of structures displaying deviations from regular crystal structures. An average lattice is defined and examples are given in one and two dimensions along with their diffraction patterns. The absence of periodicity in reciprocal space corresponding to aperiodic structures is shown to arise out of different projected spacings that are irrationally related, when the grid points are projected along the chosen coordinate axes. It is shown that the projected length scales are important factors which determine the existence or absence of observable periodicity in the diffraction pattern more than the sequence of arrangement.

Role of length scales on microwave thawing dynamics in 2D cylinders

Microwave (MW) thawing of 2D frozen cylinders exposed to uniform plane waves from one face, is modeled using the effective heat capacity formulation with the MW power obtained from the electric field equations. Computations are illustrated for tylose (23% methyl cellulose gel) which melts over a range of temperatures giving rise to a mushy zone. Within the mushy region the dielectric properties are functions of the liquid volume fraction. The resulting coupled, time dependent non-linear equations are solved using the Galerkin finite element method with a fixed mesh. Our method efficiently captures the multiple connected thawed domains that arise due to the penetration of MWs in the sample. For a cylinder of diameter D, the two length scales that control the thawing dynamics are D/D-p and D/lambda(m), where D-p and lambda(m) are the penetration depth and wavelength of radiation in the sample respectively. For D/D-p, D/lambda(m) much less than 1 power absorption is uniform and thawing occurs almost simultaneously across the sample (Regime I). For D/D-p much greater than 1 thawing is seen to occur from the incident face, since the power decays exponentially into the sample (Regime III). At intermediate values, 0.2 < D/D-p, D/lambda(m) < 2.0 (Regime II) thawing occurs from the unexposed face at smaller diameters, from both faces at intermediate diameters and from the exposed and central regions at larger diameters. Average power absorption during thawing indicates a monotonic rise in Regime I and a monotonic decrease in Regime III. Local maxima in the average power observed for samples in Regime II are due to internal resonances within the sample. Thawing time increases monotonically with sample diameter and temperature gradients in the sample generally increase from Regime I to Regime III. (C) 2002 Elsevier Science Ltd. All rights reserved.

Jointly Optimal Power Control and Hop Length for a Single Cell, Dense, Ad hoc Wireless Network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Thetaopt bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form dopt(Pmacrt) x Thetaopt with dopt scaling as Pmacrt 1 /eta, where Pmacrt is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then pro- - vide a simple characterisation of the optimal operating point.

Distribution of transverse chain fluctuations in harmonically confined semiflexible polymers

Two different experimental studies of polymer dynamics based on single-molecule fluorescence imaging have recently found evidence of heterogeneities in the widths of the putative tubes that surround filaments of F-actin during their motion in concentrated solution. In one J. Glaser, D. Chakraborty, K. Kroy, I. Lauter, M. Degawa, N. Kirchesner, B. Hoffmann, R. Merkel, and M. Giesen, Phys. Rev. Lett. 105, 037801 (2010)], the observations were explained in terms of the statistics of a worm-like chain confined to a potential determined self-consistently by a binary collision approximation, and in the other B. Wang, J. Guan, S. M. Anthony, S. C. Bae, K. S. Schweizer, and S. Granick, Phys. Rev. Lett. 104, 118301 (2010)], they were explained in terms of the scaling properties of a random fluid of thin rods. In this paper, we show, using an exact path integral calculation, that the distribution of the length-averaged transverse fluctuations of a harmonically confined weakly bendable rod (one possible realization of a semiflexible chain in a tube), is in good qualitative agreement with the experimental data, although it is qualitatively different in analytic structure from the earlier theoretical predictions. We also show that similar path integral techniques can be used to obtain an exact expression for the time correlation function of fluctuations in the tube cross section. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4712306]

Confinement and viscoelastic effects on chain closure dynamics

Chemical reactions inside cells are typically subject to the effects both of the cell's confining surfaces and of the viscoelastic behavior of its contents. In this paper, we show how the outcome of one particular reaction of relevance to cellular biochemistry - the diffusion-limited cyclization of long chain polymers - is influenced by such confinement and crowding effects. More specifically, starting from the Rouse model of polymer dynamics, and invoking the Wilemski-Fixman approximation, we determine the scaling relationship between the mean closure time t(c) of a flexible chain (no excluded volume or hydrodynamic interactions) and the length N of its contour under the following separate conditions: (a) confinement of the chain to a sphere of radius d and (b) modulation of its dynamics by colored Gaussian noise. Among other results, we find that in case (a) when d is much smaller than the size of the chain, t(c) similar to Nd-2, and that in case (b), t(c) similar to N-2/(2 (2H)), H being a number between 1/2 and 1 that characterizes the decay of the noise correlations. H is not known a priori, but values of about 0.7 have been used in the successful characterization of protein conformational dynamics. At this value of H (selected for purposes of illustration), t(c) similar to N-3.4, the high scaling exponent reflecting the slow relaxation of the chain in a viscoelastic medium. (C) 2012 American Institute of Physics. http://dx.doi.org/10.1063/1.4729041]

Queueing delay - error probability tradeoff for point-to-point channels with fixed length block codes

We study the tradeoff between the average error probability and the average queueing delay of messages which randomly arrive to the transmitter of a point-to-point discrete memoryless channel that uses variable rate fixed codeword length random coding. Bounds to the exponential decay rate of the average error probability with average queueing delay in the regime of large average delay are obtained. Upper and lower bounds to the optimal average delay for a given average error probability constraint are presented. We then formulate a constrained Markov decision problem for characterizing the rate of transmission as a function of queue size given an average error probability constraint. Using a Lagrange multiplier the constrained Markov decision problem is then converted to a problem of minimizing the average cost for a Markov decision problem. A simple heuristic policy is proposed which approximately achieves the optimal average cost.

Tradeoff of average power and average delay for a point-to-point link with fading

We consider a discrete time system with packets arriving randomly at rate lambda per slot to a fading point-to-point link, for which the transmitter can control the number of packets served in a slot by varying the transmit power. We provide an asymptotic characterization of the minimum average delay of the packets, when average transmitter power is a small positive quantity V more than the minimum average power required for queue stability. We show that the minimum average delay will grow either as log (1/V) or 1/V when V down arrow 0, for certain sets of values of lambda. These sets are determined by the distribution of fading gain, the maximum number of packets which can be transmitted in a slot, and the assumed transmit power function, as a function of the fading gain and the number of packets transmitted. We identify a case where the above behaviour of the tradeoff differs from that obtained from a previously considered model, in which the random queue length process is assumed to evolve on the non-negative real line.

Tradeoff of average service cost and average delay for the state dependent M/M/1 queue

The optimal tradeoff between average service cost rate and average delay, is addressed for a M/M/1 queueing model with queue-length dependent service rates, chosen from a finite set. We provide an asymptotic characterization of the minimum average delay, when the average service cost rate is a small positive quantity V more than the minimum average service cost rate required for stability. We show that depending on the value of the arrival rate, the assumed service cost rate function, and the possible values of the service rates, the minimum average delay either a) increases only to a finite value, b) increases without bound as log(1/V), or c) increases without bound as 1/V, when V down arrow 0. We apply the analysis to a flow-level resource allocation model for a wireless downlink. We also investigate the asymptotic tradeoff for a sequence of policies which are obtained from an approximate fluid model for the M/M/1 queue.

Dynamics of the reaction between the free end of a tethered self-avoiding polymer and a flat penetrable surface: A renormalization group study

The average time tau(r) for one end of a long, self-avoiding polymer to interact for the first time with a flat penetrable surface to which it is attached at the other end is shown here to scale essentially as the square of the chain's contour length N. This result is obtained within the framework of the Wilemski-Fixman approximation to diffusion-limited reactions, in which the reaction time is expressed as a time correlation function of a ``sink'' term. In the present work, this sink-sink correlation function is calculated using perturbation expansions in the excluded volume and the polymer-surface interactions, with renormalization group methods being used to resum the expansion into a power law form. The quadratic dependence of tau(r) on N mirrors the behavior of the average time tau(c) of a free random walk to cyclize, but contrasts with the cyclization time of a free self-avoiding walk (SAW), for which tau(r) similar to N-2.2. A simulation study by Cheng and Makarov J. Phys. Chem. B 114, 3321 (2010)] of the chain-end reaction time of an SAW on a flat impenetrable surface leads to the same N-2.2 behavior, which is surprising given the reduced conformational space a tethered polymer has to explore in order to react. (C) 2014 AIP Publishing LLC.

Asymptotic Bounds on the Power-Delay Tradeoff for Fading Point-to-Point Links From Geometric Bounds on the Stationary Distribution of the Queue Length

The optimal power-delay tradeoff is studied for a time-slotted independently and identically distributed fading point-to-point link, with perfect channel state information at both transmitter and receiver, and with random packet arrivals to the transmitter queue. It is assumed that the transmitter can control the number of packets served by controlling the transmit power in the slot. The optimal tradeoff between average power and average delay is analyzed for stationary and monotone transmitter policies. For such policies, an asymptotic lower bound on the minimum average delay of the packets is obtained, when average transmitter power approaches the minimum average power required for transmitter queue stability. The asymptotic lower bound on the minimum average delay is obtained from geometric upper bounds on the stationary distribution of the queue length. This approach, which uses geometric upper bounds, also leads to an intuitive explanation of the asymptotic behavior of average delay. The asymptotic lower bounds, along with previously known asymptotic upper bounds, are used to identify three new cases where the order of the asymptotic behavior differs from that obtained from a previously considered approximate model, in which the transmit power is a strictly convex function of real valued service batch size for every fade state.