Universal behaviour in erosive burning of solid propellants

This paper considers the extensive data and correlations on the erosive burning of solid propellants. A relatively simple nondimensional relationship between the ratio of the actual to nonerosive burn rate (eta) and a quantity g, which is the product of g(0)-the ratio of free stream mass flux to the mass flux from the surface for nonerosive condition-and Re-0(m), where Re-0 is the Reynolds number based on the nonerosive mass flux of the propellant and port diameter, is shown to correlate most data within the accuracies of the experiments with m = -0.125. This shows the above relationship to account for the effects of pressure, aluminum, even up to a proportion of 17%, burn rate catalysts, and motor size. It is concluded that the suggested correlation between eta and g may be adopted universally for most practical propellants. (C) 1997 by The Combustion Institute.

On approximately universal schemes for two-hop networks

Full-duplex and half-duplex two-hop networks are considered. Explicit coding schemes which are approximately universal over a class of fading distributions are identified, for the case when the network has either one or two relays.

Insights into the Regulatory Characteristics of the Mycobacterial Dephosphocoenzyme A Kinase: Implications for the Universal CoA Biosynthesis Pathway

Being vastly different from the human counterpart, we suggest that the last enzyme of the Mycobacterium tuberculosis Coenzyme A biosynthetic pathway, dephosphocoenzyme A kinase (CoaE) could be a good anti-tubercular target. Here we describe detailed investigations into the regulatory features of the enzyme, affected via two mechanisms. Enzymatic activity is regulated by CTP which strongly binds the enzyme at a site overlapping that of the leading substrate, dephosphocoenzyme A (DCoA), thereby obscuring the binding site and limiting catalysis. The organism has evolved a second layer of regulation by employing a dynamic equilibrium between the trimeric and monomeric forms of CoaE as a means of regulating the effective concentration of active enzyme. We show that the monomer is the active form of the enzyme and the interplay between the regulator, CTP and the substrate, DCoA, affects enzymatic activity. Detailed kinetic data have been corroborated by size exclusion chromatography, dynamic light scattering, glutaraldehyde crosslinking, limited proteolysis and fluorescence investigations on the enzyme all of which corroborate the effects of the ligands on the enzyme oligomeric status and activity. Cysteine mutagenesis and the effects of reducing agents on mycobacterial CoaE oligomerization further validate that the latter is not cysteine-mediated or reduction-sensitive. These studies thus shed light on the novel regulatory features employed to regulate metabolite flow through the last step of a critical biosynthetic pathway by keeping the latter catalytically dormant till the need arises, the transition to the active form affected by a delicate crosstalk between an essential cellular metabolite (CTP) and the precursor to the pathway end-product (DCoA).

Effect of two-level systems on the spectral density of universal conductance fluctuations in doped Si

We have studied the power spectral density [S(f) = gamma/f(alpha)] of universal conductance fluctuations (UCF's) in heavily doped single crystals of Si, when the scatterers themselves act as the primary source of dephasing. We observed that the scatterers, with internal dynamics like two-level-systems, produce a significant, temperature-dependent reduction in the spectral slope alpha when T less than or similar to 10 K, as compared to the bare 1/f (alphaapproximate to1) spectrum at higher temperatures. It is further shown that an upper cutoff frequency (f(m)) in the UCF spectrum is necessary in order to restrict the magnitude of conductance fluctuations, [(deltaG(phi))(2)], per phase coherent region (L-phi(3)) to [(deltaGphi)(2)](1/2) less than or similar to e(2)/h. We find that f(m) approximate to tau(D)(-1), where tau(D) = L-2/D, is the time scale of the diffusive motion of the electron along the active length (L) of the sample (D is the electron diffusivity).

Acyclic Edge-Coloring of Planar Graphs

A proper edge-coloring with the property that every cycle contains edges of at least three distinct colors is called an acyclic edge-coloring. The acyclic chromatic index of a graph G, denoted. chi'(alpha)(G), is the minimum k such that G admits an acyclic edge-coloring with k colors. We conjecture that if G is planar and Delta(G) is large enough, then chi'(alpha) (G) = Delta (G). We settle this conjecture for planar graphs with girth at least 5. We also show that chi'(alpha) (G) <= Delta (G) + 12 for all planar G, which improves a previous result by Fiedorowicz, Haluszczak, and Narayan Inform. Process. Lett., 108 (2008), pp. 412-417].

Hydrogen-bond dynamics near a micellar surface: Origin of the universal slow relaxation at complex aqueous interfaces

The dynamics of hydrogen bonds among water molecules themselves and with the polar head groups (PHG) at a micellar surface have been investigated by long molecular dynamics simulations. The lifetime of the hydrogen bond between a PHG and a water molecule is found to be much longer than that between any two water molecules, and is likely to be a general feature of hydrophilic surfaces of organized assemblies. Analyses of individual water trajectories suggest that water molecules can remain bound to the micellar surface for more than 100 ps. The activation energy for such a transition from the bound to a free state for the water molecules is estimated to be about 3.5 kcal/mol.

Boxicity of Line Graphs

The boxicity of a graph H, denoted by View the MathML source, is the minimum integer k such that H is an intersection graph of axis-parallel k-dimensional boxes in View the MathML source. In this paper we show that for a line graph G of a multigraph, View the MathML source, where Δ(G) denotes the maximum degree of G. Since G is a line graph, Δ(G)≤2(χ(G)−1), where χ(G) denotes the chromatic number of G, and therefore, View the MathML source. For the d-dimensional hypercube Qd, we prove that View the MathML source. The question of finding a nontrivial lower bound for View the MathML source was left open by Chandran and Sivadasan in [L. Sunil Chandran, Naveen Sivadasan, The cubicity of Hypercube Graphs. Discrete Mathematics 308 (23) (2008) 5795–5800]. The above results are consequences of bounds that we obtain for the boxicity of a fully subdivided graph (a graph that can be obtained by subdividing every edge of a graph exactly once).

Percolation and Connectivity in AB Random Geometric Graphs

Given two independent Poisson point processes ©(1);©(2) in Rd, the AB Poisson Boolean model is the graph with points of ©(1) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centred at these points contains at least one point of ©(2). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d ¸ 2 and derive bounds for a critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and cn in the unit cube. The AB random geometric graph is de¯ned as above but with balls of radius r. We derive a weak law result for the largest nearest neighbour distance and almost sure asymptotic bounds for the connectivity threshold.

Hybrid LCI/VSI Power Circuit-A Universal High-Power Converter Solution for Wound Field Synchronous Motor Drives

Load commutated inverter (LCI)-fed wound field synchronous motor drives are used for medium-voltage high-power drive applications. This drive suffers from drawbacks such as complex starting procedure, sixth harmonic torque pulsations, quasi square wave motor current, notches in the terminal voltages, etc. In this paper, a hybrid converter circuit, consisting of an LCI and a voltage source inverter (VSI), is proposed, which can be a universal high-power converter solution for wound field synchronous motor drives. The proposed circuit, with the addition of a current-controlled VSI, overcomes nearly all of the shortcomings present in the conventional LCI-based system besides providing many additional advantages. In the proposed drive, the motor voltage and current are always sinusoidal even with the LCI switching at the fundamental frequency. The performance of the drive is demonstrated with detailed experimental waveforms from a 15.8-hp salient pole wound field synchronous machine. Finally, a brief description of the control scheme used for the proposed circuit is given.

Pruned Universal Symbol Sequences for LZW based Language identification

We present a improved language modeling technique for Lempel-Ziv-Welch (LZW) based LID scheme. The previous approach to LID using LZW algorithm prepares the language pattern table using LZW algorithm. Because of the sequential nature of the LZW algorithm, several language specific patterns of the language were missing in the pattern table. To overcome this, we build a universal pattern table, which contains all patterns of different length. For each language it's corresponding language specific pattern table is constructed by retaining the patterns of the universal table whose frequency of appearance in the training data is above the threshold.This approach reduces the classification score (Compression Ratio [LZW-CR] or the weighted discriminant score[LZW-WDS]) for non native languages and increases the LID performance considerably.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].