Critical properties of the double-exchange ferromagnet Nd(0.6)Pb(0.4)MnO(3)

Results of a study of dc magnetization M(T,H), performed on a Nd(0.6)Pb(0.4)MnO(3) single crystal in the temperature range around T(C) (Curie temperature) which embraces the supposed critical region \epsilon\=\T-T(C)\/T(C)less than or equal to0.05 are reported. The magnetic data analyzed in the critical region using the Kouvel-Fisher method give the values for the T(C)=156.47+/-0.06 K and the critical exponents beta=0.374+/-0.006 (from the temperature dependence of magnetization) and gamma=1.329+/-0.003 (from the temperature dependence of initial susceptibility). The critical isotherm M(T(C),H) gives delta=4.54+/-0.10. Thus the scaling law gamma+beta=deltabeta is fulfilled. The critical exponents obey the single scaling equation of state M(H,epsilon)=epsilon(beta)f(+/-)(H/epsilon(beta+gamma)), where f(+) for T>T(C) and f(-) for T

Probing the mobility of lithium in LISICON: Li+/H+ exchange studies in Li2ZnGeO4 and Li2+2xZn1-xGeO4

We investigated Li+/H+ exchange in the lithium ion conductors (LISICONS) [ Li2+2xZn1-xGeO4; x = 0.5 ( I) and x = 0.75 (II)] and their parent, gamma-Li2ZnGeO4. Facile exchange of approximately 2x lithium ions per formula unit occurs with both the LISICONS in dilute acetic acid, while the parent material does not exhibit an obvious Li+/H+ exchange under the same conditions. The results can be understood in terms of lithium ion distribution in the crystal structures: the parent Li2ZnGeO4, where all the lithium ions form part of the tetrahedral framework structure, does not exhibit a ready Li+/H+ exchange; LISICONS, where lithium ions are distributed between framework ( tetrahedral) and nonframework sites, undergo a facile Li+/H+ exchange of the nonframework site lithium ions. Accordingly, Li+/H+ exchange in dilute aqueous acetic acid provides a convenient probe to distinguish between the mobile and the immobile lithium ions in lithium ion conductors.

Interference Alignment as a Tool in Network Coding as Applied to Distributed Storage

In this paper, we outline an approach to the task of designing network codes in a non-multicast setting. Our approach makes use of the concept of interference alignment. As an example, we consider the distributed storage problem where the data is stored across the network in n nodes and where a data collector can recover the data by connecting to any k of the n nodes and where furthermore, upon failure of a node, a new node can replicate the data stored in the failed node while minimizing the repair bandwidth.

Network Rhythms Influence the Relationship between Spike-Triggered Local Field Potential and Functional Connectivity

Characterizing the functional connectivity between neurons is key for understanding brain function. We recorded spikes and local field potentials (LFPs) from multielectrode arrays implanted in monkey visual cortex to test the hypotheses that spikes generated outward-traveling LFP waves and the strength of functional connectivity depended on stimulus contrast, as described recently. These hypotheses were proposed based on the observation that the latency of the peak negativity of the spike-triggered LFP average (STA) increased with distance between the spike and LFP electrodes, and the magnitude of the STA negativity and the distance over which it was observed decreased with increasing stimulus contrast. Detailed analysis of the shape of the STA, however, revealed contributions from two distinct sources-a transient negativity in the LFP locked to the spike (similar to 0 ms) that attenuated rapidly with distance, and a low-frequency rhythm with peak negativity similar to 25 ms after the spike that attenuated slowly with distance. The overall negative peak of the LFP, which combined both these components, shifted from similar to 0 to similar to 25 ms going from electrodes near the spike to electrodes far from the spike, giving an impression of a traveling wave, although the shift was fully explained by changing contributions from the two fixed components. The low-frequency rhythm was attenuated during stimulus presentations, decreasing the overall magnitude of the STA. These results highlight the importance of accounting for the network activity while using STAs to determine functional connectivity.

An analog MVUE for a wireless sensor network

An analog minimum-variance unbiased estimator(MVUE) over an asymmetric wireless sensor network is studied.Minimisation of variance is cast into a constrained non-convex optimisation problem. An explicit algorithm that solves the problem is provided. The solution is obtained by decomposing the original problem into a finite number of convex optimisation problems with explicit solutions. These solutions are then juxtaposed together by exploiting further structure in the objective function.

Network Coding for TCP Throughput Enhancement over a Multi-Hop wireless Network

The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance of TCP controlled bulk transfers over a chain topology multi-hop wireless network. The nodes use a CSMA/ CA mechanism, such as IEEE 802.11’s DCF, to perform distributed packet scheduling. The reverse flowing TCP ACKs are sought to be X-ORed with forward flowing TCP data packets. We find that, without any modification to theMAC protocol, the gain from network coding is negligible. The inherent coordination problem of carrier sensing based random access in multi-hop wireless networks dominates the performance. We provide a theoretical analysis that yields a throughput bound with network coding. We then propose a distributed modification of the IEEE 802.11 DCF, based on tuning the back-off mechanism using a feedback approach. Simulation studies show that the proposed mechanism when combined with network coding, improves the performance of a TCP session by more than 100%.

Realizing a flexible constraint length Viterbi decoder for software radio on a de Bruijn interconnection network

Building flexible constraint length Viterbi decoders requires us to be able to realize de Bruijn networks of various sizes on the physically provided interconnection network. This paper considers the case when the physical network is itself a de Bruijn network and presents a scalable technique for realizing any n-node de Bruijn network on an N-node de Bruijn network, where n < N. The technique ensures that the length of the longest path realized on the network is minimized and that each physical connection is utilized to send only one data item, both of which are desirable in order to reduce the hardware complexity of the network and to obtain the best possible performance.

Improving Performance of Result Caches in Network Processors

Digest caches have been proposed as an effective method tospeed up packet classification in network processors. In this paper, weshow that the presence of a large number of small flows and a few largeflows in the Internet has an adverse impact on the performance of thesedigest caches. In the Internet, a few large flows transfer a majority ofthe packets whereas the contribution of several small flows to the totalnumber of packets transferred is small. In such a scenario, the LRUcache replacement policy, which gives maximum priority to the mostrecently accessed digest, tends to evict digests belonging to the few largeflows. We propose a new cache management algorithm called SaturatingPriority (SP) which aims at improving the performance of digest cachesin network processors by exploiting the disparity between the number offlows and the number of packets transferred. Our experimental resultsdemonstrate that SP performs better than the widely used LRU cachereplacement policy in size constrained caches. Further, we characterizethe misses experienced by flow identifiers in digest caches.

Synergy between the N-terminal and C-terminal domains of Mycobacterium tuberculosis HupB is essential for high-affinity binding, DNA supercoiling and inhibition of RecA-promoted strand exchange

The occurrence of DNA architectural proteins containing two functional domains derived from two different architectural proteins is an interesting emerging research theme in the field of nucleoid structure and function. Mycobacterium tuberculosis HupB, unlike Escherichia coli HU, is a two-domain protein that, in the N-terminal region, shows broad sequence homology with bacterial HU. The long C-terminal extension, on the other hand, contains seven PAKK/KAAK motifs, which are characteristic of the histone H1/H5 family of proteins. In this article, we describe several aspects of HupB function, in comparison with its truncated derivatives lacking either the C-terminus or N-terminus. We found that HupB binds a variety of DNA repair and replication intermediates with K(d) values in the nanomolar range. By contrast, the N-terminal fragment of M. tuberculosis HupB (HupB(MtbN)) showed diminished DNA-binding activity, with K(d) values in the micromolar range, and the C-terminal domain was completely devoid of DNA-binding activity. Unlike HupB(MtbN), HupB was able to constrain DNA in negative supercoils and introduce negative superhelical turns into relaxed DNA. Similarly, HupB exerted a robust inhibitory effect on DNA strand exchange promoted by cognate and noncognate RecA proteins, whereas HupB(MtbN), even at a 50-fold molar excess, had no inhibitory effect. Considered together, these results suggest that synergy between the N-terminal and C-terminal domains of HupB is essential for its DNA-binding ability, and to modulate the topological features of DNA, which has implications for processes such as DNA compaction, gene regulation, homologous recombination, and DNA repair.

NETGEM: Network Embedded Temporal GEnerative Model for gene expression data

Background: Temporal analysis of gene expression data has been limited to identifying genes whose expression varies with time and/or correlation between genes that have similar temporal profiles. Often, the methods do not consider the underlying network constraints that connect the genes. It is becoming increasingly evident that interactions change substantially with time. Thus far, there is no systematic method to relate the temporal changes in gene expression to the dynamics of interactions between them. Information on interaction dynamics would open up possibilities for discovering new mechanisms of regulation by providing valuable insight into identifying time-sensitive interactions as well as permit studies on the effect of a genetic perturbation. Results: We present NETGEM, a tractable model rooted in Markov dynamics, for analyzing the dynamics of the interactions between proteins based on the dynamics of the expression changes of the genes that encode them. The model treats the interaction strengths as random variables which are modulated by suitable priors. This approach is necessitated by the extremely small sample size of the datasets, relative to the number of interactions. The model is amenable to a linear time algorithm for efficient inference. Using temporal gene expression data, NETGEM was successful in identifying (i) temporal interactions and determining their strength, (ii) functional categories of the actively interacting partners and (iii) dynamics of interactions in perturbed networks. Conclusions: NETGEM represents an optimal trade-off between model complexity and data requirement. It was able to deduce actively interacting genes and functional categories from temporal gene expression data. It permits inference by incorporating the information available in perturbed networks. Given that the inputs to NETGEM are only the network and the temporal variation of the nodes, this algorithm promises to have widespread applications, beyond biological systems. The source code for NETGEM is available from https://github.com/vjethava/NETGEM

Continuous-time Single Network Adaptive Critic for Regulator Design of Nonlinear Control Affine Systems

An optimal control law for a general nonlinear system can be obtained by solving Hamilton-Jacobi-Bellman equation. However, it is difficult to obtain an analytical solution of this equation even for a moderately complex system. In this paper, we propose a continuoustime single network adaptive critic scheme for nonlinear control affine systems where the optimal cost-to-go function is approximated using a parametric positive semi-definite function. Unlike earlier approaches, a continuous-time weight update law is derived from the HJB equation. The stability of the system is analysed during the evolution of weights using Lyapunov theory. The effectiveness of the scheme is demonstrated through simulation examples.