Influence of clofibrate administration on the rate of synthesis of macromolecules in regenerating rat liver

Administration of the antihypercholesterolaemic drug clofibrate stimulates the rates of synthesis of nucleic acids and proteins in rat liver. The biosynthesis of mitochondrial proteins also is enhanced by the drug. In drug-fed animals, the rates of incorporation in vivo of radioactive precursors into DNA, RNA and proteins are stimulated even when the liver undergoes regeneration following partial hepatectomy. The rate of synthesis of mitochondrial proteins in the regenerative phase is higher in clofibrate-fed animals. These effects are consistent with the hepatomegalic and mitochondria-proliferating property of the drug.

Influence of Lithium Fluoride on the Burning Rate of AP-Polyester Propellant

THE addition of catalysts normally serves the purpose of imparting a desired burning rate change in a composite propellant. These may either retard or enhance the burning rate. Some often quoted catalysts are oxides, chromites and chromates of metals. A lot of work has been done on rinding the effect of the addition of some of these catalysts on the burning rate; however, none seems to have appeared on the influence of lithium fluoride (LiF). Only qualitative reduction in the burning rate of composite propellants with the addition of LiF was reported by Williams et al.1 Dickinson and Jackson2 reported a slight decrease in the specific impulse of composite propellant with the addition of LiF; however, they made no mention of the effect of its addition on the burning rate. We have studied the effect of the addition of varying amounts of LiF on the burning rate of Ammonium Perchlorate (AP)-Polyester propellant.

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.

The effect of lecithin on the burning rate of AP-Al---polyester propellant

Abstract is not available.

On the maximal rate of non-square STBCs from complex orthogonal designs

A Linear Processing Complex Orthogonal Design (LPCOD) is a p x n matrix epsilon, (p >= n) in k complex indeterminates x(1), x(2),..., x(k) such that (i) the entries of epsilon are complex linear combinations of 0, +/- x(i), i = 1,..., k and their conjugates, (ii) epsilon(H)epsilon = D, where epsilon(H) is the Hermitian (conjugate transpose) of epsilon and D is a diagonal matrix with the (i, i)-th diagonal element of the form l(1)((i))vertical bar x(1)vertical bar(2) + l(2)((i))vertical bar x(2)vertical bar(2)+...+ l(k)((i))vertical bar x(k)vertical bar(2) where l(j)((i)), i = 1, 2,..., n, j = 1, 2,...,k are strictly positive real numbers and the condition l(1)((i)) = l(2)((i)) = ... = l(k)((i)), called the equal-weights condition, holds for all values of i. For square designs it is known. that whenever a LPCOD exists without the equal-weights condition satisfied then there exists another LPCOD with identical parameters with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1. This implies that the maximum possible rate for square LPCODs without the equal-weights condition is the same as that or square LPCODs with equal-weights condition. In this paper, this result is extended to a subclass of non-square LPCODs. It is shown that, a set of sufficient conditions is identified such that whenever a non-square (p > n) LPCOD satisfies these sufficient conditions and do not satisfy the equal-weights condition, then there exists another LPCOD with the same parameters n, k and p in the same complex indeterminates with l(1)((i)) = l(2)((i)) = ... = l(k)((i)) = 1.

On the maximal rate of (n+1) x n and (n+2) x n complex orthogonal designs

For p x n complex orthogonal designs in k variables, where p is the number of channels uses and n is the number of transmit antennas, the maximal rate L of the design is asymptotically half as n increases. But, for such maximal rate codes, the decoding delay p increases exponentially. To control the delay, if we put the restriction that p = n, i.e., consider only the square designs, then, the rate decreases exponentially as n increases. This necessitates the study of the maximal rate of the designs with restrictions of the form p = n+1, p = n+2, p = n+3 etc. In this paper, we study the maximal rate of complex orthogonal designs with the restrictions p = n+1 and p = n+2. We derive upper and lower bounds for the maximal rate for p = n+1 and p = n+2. Also for the case of p = n+1, we show that if the orthogonal design admit only the variables, their negatives and multiples of these by root-1 and zeros as the entries of the matrix (other complex linear combinations are not allowed), then the maximal rate always equals the lower bound.

Criticality of the exponential rate of decay for the largest nearest-neighbor link in random geometric graphs

Let n points be placed independently in d-dimensional space according to the density f(x) = A(d)e(-lambda parallel to x parallel to alpha), lambda, alpha > 0, x is an element of R-d, d >= 2. Let d(n) be the longest edge length of the nearest-neighbor graph on these points. We show that (lambda(-1) log n)(1-1/alpha) d(n) - b(n) converges weakly to the Gumbel distribution, where b(n) similar to ((d - 1)/lambda alpha) log log n. We also prove the following strong law for the normalized nearest-neighbor distance (d) over tilde (n) = (lambda(-1) log n)(1-1/alpha) d(n)/log log n: (d - 1)/alpha lambda <= lim inf(n ->infinity) (d) over tilde (n) <= lim sup(n ->infinity) (d) over tilde (n) <= d/alpha lambda almost surely. Thus, the exponential rate of decay alpha = 1 is critical, in the sense that, for alpha > 1, d(n) -> 0, whereas, for alpha <= 1, d(n) -> infinity almost surely as n -> infinity.

Measurement of the corrosion rate of aluminium in sodium hydroxide using holographic interferometry

The application of holographic interferometry to the measurement of the corrosion rate of aluminium in sodium hydroxide is investigated. Details of the fabrication of the corrosion cell and the experimental procedure are given. Thickness loss of aluminium was found for different dissolution times and compared with the conventional weight-loss method using a microbalance.

Effects of Ultrafast Solvation on the Rate of Adiabatic Outer-Sphere Electron Transfer Reactions

Recent studies have demonstrated that solvation dynamics in many common dipolar liquids contain an initial, ultrafast Gaussian component which may contribute even more than 60% to the total solvation energy. It is also known that adiabatic electron transfer reactions often probe the high-frequency components of the relevant solvent friction (Hynes, J. T. J. Phys. Chem. 1986, 90, 3701). In this paper, we present a theoretical study of the effects of the ultrafast solvent polar modes on the adiabatic electron transfer reactions by using the formalism of Hynes. Calculations have been carried out for a model system and also for water and acetonitrile. It is found that, in general, the ultrafast modes can greatly enhance the rate of electron transfer, even by more than an order of magnitude, over the rate obtained by using only the slow overdamped modes usually considered. For water, this acceleration of the rate can be attributed to the high-frequency intermolecular vibrational and librational modes. For a weakly adiabatic reaction, the rate is virtually indistinguishable from the rate predicted by the Marcus transition state theory. Another important result is that even in this case of ultrafast underdamped solvation, energy diffusion appears to be efficient so that electron transfer reaction in water is controlled essentially by the barrier crossing dynamics. This is because the reactant well frequency is-directly proportional to the rate of the initial Gaussian decay of the solvation time correlation function. As a result, the value of the friction at the reactant well frequency rarely falls below the value required for the Kramers turnover except when the polarizability of the water molecules may be neglected. On the other hand, in acetonitrile, the rate of electron transfer reaction is found to be controlled by the energy diffusion dynamics, although a significant contribution to the rate comes also from the barrier crossing rate. Therefore, the present study calls for a need to understand the relaxation of the high-frequency modes in dipolar liquids.

Improving the convergence rate of the inverse iteration method

Solution of generalized eigenproblem, K phi = lambda M phi, by the classical inverse iteration method exhibits slow convergence for some eigenproblems. In this paper, a modified inverse iteration algorithm is presented for improving the convergence rate. At every iteration, an optimal linear combination of the latest and the preceding iteration vectors is used as the input vector for the next iteration. The effectiveness of the proposed algorithm is demonstrated for three typical eigenproblems, i.e. eigenproblems with distinct, close and repeated eigenvalues. The algorithm yields 29, 96 and 23% savings in computational time, respectively, for these problems. The algorithm is simple and easy to implement, and this renders the algorithm even more attractive.