Metabolism of Plasmodium bergheistar, open: III. Carbon dioxide fixation and role of pyruvate and dicarboxylic acids

Formation of C4 dicarboxylic acids in Plasmodium berghei by carbon dioxide fixation reaction has been demonstrated by the use of labeled NaH14CO3. The reactions require glucose, which may be required not only as an energy source but also to contribute to the formation of pyruvate in the process of carbon dioxide fixation. Intracellular concentration of pyruvate may play an important role in the metabolism of P. berghei; an increased intracellular level of pyruvate seems to be a prerequisite before some of these reactions could be detected. The distribution of the label indicates extensive randomization of amino acids and suggests an extensive cycling of the amino acid and organic acid pools of the parasites. This investigation formed part of the thesis submitted in 1965 for the doctoral degree at the Indian Institute of Science, Bangalore 12, India, and was supported in part by the Council of Scientific and Industrial Research, India.

Experimental Test of the Quantum No-Hiding Theorem

The no-hiding theorem says that if any physical process leads to bleaching of quantum information from the original system, then it must reside in the rest of the Universe with no information being hidden in the correlation between these two subsystems. Here, we report an experimental test of the no-hiding theorem with the technique of nuclear magnetic resonance. We use the quantum state randomization of a qubit as one example of the bleaching process and show that the missing information can be fully recovered up to local unitary transformations in the ancilla qubits.

Performability Analysis of Fork-Join Queueing Systems

Fork-join queueing systems offer a natural modelling paradigm for parallel processing systems and for assembly operations in automated manufacturing. The analysis of fork-join queueing systems has been an important subject of research in recent years. Existing analysis methodologies-both exact and approximate-assume that the servers are failure-free. In this study, we consider fork-join queueing systems in the presence of server failures and compute the cumulative distribution of performability with respect to the response time of such systems. For this, we employ a computational methodology that uses a recent technique based on randomization. We compare the performability of three different fork-join queueing models proposed in the literature: the distributed model, the centralized splitting model, and the split-merge model. The numerical results show that the centralized splitting model offers the highest levels of performability, followed by the distributed splitting and split-merge models.

Comparison of the ultrafast to slow time scale dynamics of three liquid crystals in the isotropic phase

The dynamics of three liquid crystals, 4'(pentyloxy)-4-biphenylcarbonitrile (5-OCB), 4'-pentyl-4-biphenylcarbonitrile (5-CB), and 1-isothiocyanato-(4-propylcyclohexyl)benzene (3-CHBT), are investigated from very short time (similar to1 ps) to very long time (>100 ns) as a function of temperature using optical heterodyne detected optical Kerr effect experiments. For all three liquid crystals, the data decay exponentially only on the longest time scale (> several ns). The temperature dependence of the long time scale exponential decays is described well by the Landau-de Gennes theory of the randomization of pseudonematic domains that exist in the isotropic phase of liquid crystals near the isotropic to nematic phase transition. At short time, all three liquid crystals display power law decays. Over the full range of times, the data for all three liquid crystals are fit with a model function that contains a short time power law. The power law exponents for the three liquid crystals range between 0.63 and 0.76, and the power law exponents are temperature independent over a wide range of temperatures. Integration of the fitting function gives the empirical polarizability-polarizability (orientational) correlation function. A preliminary theoretical treatment of collective motions yields a correlation function that indicates that the data can decay as a power law at short times. The power law component of the decay reflects intradomain dynamics. (C) 2002 American Institute of Physics.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.

Correlations between structure and thermodynamic properties of spinels and their applications in technology

Measurements a/the Gibbs' energy enthalpy and entrupy vffarmation oj chromites, vanadites and alumlnat.:s 0/ F", Ni. Co'. Mn, Zn Mg and Cd, using solid oxide galvanic cells over a ternperature range extending approximately lOOO°C, have shown that the '~'Ilir"!,,, J'JrIl/iJ~ tion 0/ cubic 2-3 oxide spinel phases (MX!O,), from component oxide (MO) with rock-salt and X.Os whir c(1f'l/!ldwn st!'llt'lw,·. call b,' represented by a semi-empirical correlalion, ~S~ = --LiS + L'i,SM +~S~:"d(±O.3) cal.deg-1 mol-1 where /',.SM Is the entropy 0/calian mixing oillhe tetrahedral alld octahedral sites o/the spinel and Sr:~ is tlie enfropy associaf,'d Wifh Ih,' randomization a/the lahn-Telier distortions. A review a/the methods/or evaluating the cation distriblltion lfl spille!s suggeJ{j' l/r,l! Ihe most promising scheme is based Oil octahedral site preference energies from the crystal field theory for the Iral1silioll IIIl'f"! IlIIL';. For I/""-Irallsifioll melal cal ions site preference energies are derived relative /0 thol'lt fLI, [ransilion metal ions from measured high tClllP('ftJi ure Cal iUlI disll iiJuriol1 in spine! phases thar contail! one IransilioJl metal and another non-transition metal carion. For 2-3 srinds compulatiorrs b,IS"J Oil i.!c[J;' Temkin mixing on each catioll subialtice predici JistributionJ that are In fair agreement with X-ray and 1I1'IIIrOll ditTraction, /IIdg""!ic dll.! electrical propcrries, and spectroscopic measurements. In 2-4 spineis mixing vI ions do not foliow strictly ideal slllIistli:al Jaws, Th,' OIl/up) associated with the randomizalion 0/the Jllhn-Teller dislOriioll" appear to be significant, only ill spinels witll 3d'. 3d', 3d' (ifld~UI' iOtls in tetrahedral and 3d' and 3d9 ions in octahedral positions. Application 0/this structural model for predicting the thermodynamic proputies ofspinel solid .,olutiofl5 or,' illustrated. F,lr complex systems additional contributions arising from strain fields, redox equilibria and off-center ions have to be qllalllififti. The entropy correlation for spinels provides a method for evaluating structure tran:.jormafiofl entropies in silllple o.\id.-s, ["founlllion on the relative stabilities ofoxides in different crystallCtructures is USe/III for computer ea/culaliof! a/phase dfugrullls ofIlIrer,',,1 III (N.lll1ie5 by method, similar to thost: used by Kaufman and Bernstein for refractory alloy systems. Examples oftechnoiogical appliCation tnclude the predictioll ofdeoxidation equilibria in Fe-Mn-AI-O s),slelll at 1600°C duj ,'Ulllpltfalion 0/phase relutions in Fe-Ni-Cr-S system,

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Positive Relationships between Association Strength and Phenotypic Similarity Characterize the Assembly of Mixed-Species Bird Flocks Worldwide

Competition theory predicts that local communities should consist of species that are more dissimilar than expected by chance. We find a strikingly different pattern in a multicontinent data set (55 presence-absence matrices from 24 locations) on the composition of mixed-species bird flocks, which are important sub-units of local bird communities the world over. By using null models and randomization tests followed by meta-analysis, we find the association strengths of species in flocks to be strongly related to similarity in body size and foraging behavior and higher for congeneric compared with noncongeneric species pairs. Given the local spatial scales of our individual analyses, differences in the habitat preferences of species are unlikely to have caused these association patterns; the patterns observed are most likely the outcome of species interactions. Extending group-living and social-information-use theory to a heterospecific context, we discuss potential behavioral mechanisms that lead to positive interactions among similar species in flocks, as well as ways in which competition costs are reduced. Our findings highlight the need to consider positive interactions along with competition when seeking to explain community assembly.

Effect of nanoscale boron carbide particle addition on the microstructural evolution and mechanical response of pure magnesium

In this study, the effect of nano-B4C addition on the microstructural and the mechanical behavior of pure Mg are investigated. Pure Mg-metal reinforced with different amounts of nano-size B4C particulates were synthesized using the disintegrated melt deposition technique followed by hot extrusion. Microstructural characterization of the developed Mg/x-B4C composites revealed uniform distribution of nano-B4C particulates and significant grain refinement. Electron back scattered diffraction (EBSD) analyses showed presence of relatively more recrystallized grains and absence of fiber texture in Mg/B4C nanocomposites when compared to pure Mg. The evaluation of mechanical properties indicated a significant improvement in tensile properties of the composites. The significant improvement in tensile ductility (similar to 180% increase with respect to pure Mg) is among the highest observed when compared to the pure Mg based nanocomposites existing in the current literature. The superior mechanical properties of the Mg/B4C nanocomposites are attributed to the uniform distribution of the nanoparticles and the tendency for texture randomization (absence of fiber texture) achieved due to the nano-B4C addition. (C) 2013 Elsevier Ltd. All rights reserved.

Analogous Synaptic Plasticity Profiles Emerge from Disparate Channel Combinations

An open question within the Bienenstock-Cooper-Munro theory for synaptic modification concerns the specific mechanism that is responsible for regulating the sliding modification threshold (SMT). In this conductance-based modeling study on hippocampal pyramidal neurons, we quantitatively assessed the impact of seven ion channels (R- and T-type calcium, fast sodium, delayed rectifier, A-type, and small-conductance calcium-activated (SK) potassium and HCN) and two receptors (AMPAR and NMDAR) on a calcium-dependent Bienenstock-Cooper-Munro-like plasticity rule. Our analysis with R- and T-type calcium channels revealed that differences in their activation-inactivation profiles resulted in differential impacts on how they altered the SMT. Further, we found that the impact of SK channels on the SMT critically depended on the voltage dependence and kinetics of the calcium sources with which they interacted. Next, we considered interactions among all the seven channels and the two receptors through global sensitivity analysis on 11 model parameters. We constructed 20,000 models through uniform randomization of these parameters and found 360 valid models based on experimental constraints on their plasticity profiles. Analyzing these 360 models, we found that similar plasticity profiles could emerge with several nonunique parametric combinations and that parameters exhibited weak pairwise correlations. Finally, we used seven sets of virtual knock-outs on these 360 models and found that the impact of different channels on the SMT was variable and differential. These results suggest that there are several nonunique routes to regulate the SMT, and call for a systematic analysis of the variability and state dependence of the mechanisms underlying metaplasticity during behavior and pathology.

Secure Compute-and-Forward in a Bidirectional Relay

We consider the basic bidirectional relaying problem, in which two users in a wireless network wish to exchange messages through an intermediate relay node. In the compute-and-forward strategy, the relay computes a function of the two messages using the naturally occurring sum of symbols simultaneously transmitted by user nodes in a Gaussian multiple-access channel (MAC), and the computed function value is forwarded to the user nodes in an ensuing broadcast phase. In this paper, we study the problem under an additional security constraint, which requires that each user's message be kept secure from the relay. We consider two types of security constraints: 1) perfect secrecy, in which the MAC channel output seen by the relay is independent of each user's message and 2) strong secrecy, which is a form of asymptotic independence. We propose a coding scheme based on nested lattices, the main feature of which is that given a pair of nested lattices that satisfy certain goodness properties, we can explicitly specify probability distributions for randomization at the encoders to achieve the desired security criteria. In particular, our coding scheme guarantees perfect or strong secrecy even in the absence of channel noise. The noise in the channel only affects reliability of computation at the relay, and for Gaussian noise, we derive achievable rates for reliable and secure computation. We also present an application of our methods to the multihop line network in which a source needs to transmit messages to a destination through a series of intermediate relays.