Universal Stability and Temperature Dependent Phase Transformation in Group VIIIB-IB Transition Metal FCC Nanowires

Atomistic simulation of Ag, Al, Au, Cu, Ni, Pd, and Pt FCC metallic nanowires show a universal FCC -> HCP phase transformation below a critical cross-sectional size, which is reported for the first time in this paper. The newly observed HCP structure is also confirmed from previous experimental results. Above the critical cross-sectional size, initial < 100 >/{100} FCC metallic nanowires are found to be metastable. External thermal heating shows the transformation of metastable < 100 >/{100} FCC nanowires into < 110 >/{111} stable configuration. Size dependent metastability/instability is also correlated with initial residual stresses of the nanowire by use of molecular static simulation using the conjugant gradient method at a temperature of 0 K. It is found that a smaller cross-sectional dimension of an initial FCC nanowire shows instability due to higher initial residual stresses, and the nanowire is transformed into the novel HCP structure. The initial residual stress shows reduction with an increase in the cross-sectional size of the nanowires. A size dependent critical temperature is also reported for metastable FCC nanowires using molecular dynamic, to capture the < 110 >/{111} to < 100 >/{100} shape memory and pseudoelasticity.

On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers

Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.

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.

Context based service discovery for ubiquitous applications

Service discovery is vital in ubiquitous applications, where a large number of devices and software components collaborate unobtrusively and provide numerous services without user intervention. Existing service discovery schemes use a service matching process in order to offer services of interest to the users. Potentially, the context information of the users and surrounding environment can be used to improve the quality of service matching. To make use of context information in service matching, a service discovery technique needs to address certain challenges. Firstly, it is required that the context information shall have unambiguous representation. Secondly, the devices in the environment shall be able to disseminate high level and low level context information seamlessly in the different networks. And thirdly, dynamic nature of the context information be taken into account. We propose a C-IOB(Context-Information, Observation and Belief) based service discovery model which deals with the above challenges by processing the context information and by formulating the beliefs based on the observations. With these formulated beliefs the required services will be provided to the users. The method has been tested with a typical ubiquitous museum guide application over different cases. The simulation results are time efficient and quite encouraging.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

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).

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.

Multipath routing to provide quality of service in mobile ad hoc networks

Because of frequent topology changes and node failures, providing quality of service routing in mobile ad hoc networks becomes a very critical issue. The quality of service can be provided by routing the data along multiple paths. Such selection of multiple paths helps to improve reliability and load balancing, reduce delay introduced due to route rediscovery in presence of path failures. There are basically two issues in such a multipath routing Firstly, the sender node needs to obtain the exact topology information. Since the nodes are continuously roaming, obtaining the exact topology information is a tough task. Here, we propose an algorithm which constructs highly accurate network topology with minimum overhead. The second issue is that the paths in the path set should offer best reliability and network throughput. This is achieved in two ways 1) by choice of a proper metric which is a function of residual power, traffic load on the node and in the surrounding medium 2) by allowing the reliable links to be shared between different paths.

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.

Efficient Algorithms for Combinatorial Auctions with Volume Discounts Arising in Web Service Composition

Web services are now a key ingredient of software services offered by software enterprises. Many standardized web services are now available as commodity offerings from web service providers. An important problem for a web service requester is the web service composition problem which involves selecting the right mix of web service offerings to execute an end-to-end business process. Web service offerings are now available in bundled form as composite web services and more recently, volume discounts are also on offer, based on the number of executions of web services requested. In this paper, we develop efficient algorithms for the web service composition problem in the presence of composite web service offerings and volume discounts. We model this problem as a combinatorial auction with volume discounts. We first develop efficient polynomial time algorithms when the end-to-end service involves a linear workflow of web services. Next we develop efficient polynomial time algorithms when the end-to-end service involves a tree workflow of web services.