A Legendre spectral element model for sloshing and acoustic analysis in nearly incompressible fluids

A new spectral finite element formulation is presented for modeling the sloshing and the acoustic waves in nearly incompressible fluids. The formulation makes use of the Legendre polynomials in deriving the finite element interpolation shape functions in the Lagrangian frame of reference. The formulated element uses Gauss-Lobatto-Legendre quadrature scheme for integrating the volumetric stiffness and the mass matrices while the conventional Gauss-Legendre quadrature scheme is used on the rotational stiffness matrix to completely eliminate the zero energy modes, which are normally associated with the Lagrangian FE formulation. The numerical performance of the spectral element formulated here is examined by doing the inf-sup test oil a standard rectangular rigid tank partially filled with liquid The eigenvalues obtained from the formulated spectral element are compared with the conventional equally spaced node locations of the h-type Lagrangian finite element and the predicted results show that these spectral elements are more accurate and give superior convergence The efficiency and robustness of the formulated elements are demonstrated by solving few standard problems involving free vibration and dynamic response analysis with undistorted and distorted spectral elements. and the obtained results are compared with available results in the published literature (C) 2009 Elsevier Inc All rights reserved

Jointly optimal power control and routing for a single cell, dense, ad hoc wireless network

We consider a dense, ad hoc wireless network confined to a small region, such that direct communication is possible between any pair of nodes. The physical communication model is that a receiver decodes the signal from a single transmitter, while treating all other signals as interference. Data packets are sent between source-destination pairs by multihop relaying. We assume that nodes self-organise into a multihop network such that all hops are of length d meters, where d is a design parameter. There is a contention based multiaccess scheme, and it is assumed that every node always has data to send, either originated from it or a transit packet (saturation assumption). In this scenario, we seek to maximize a measure of the transport capacity of the network (measured in bit-meters per second) over power controls (in a fading environment) and over the hop distance d, subject to an average power constraint. We first argue that for a dense collection of nodes confined to a small region, single cell operation is efficient for single user decoding transceivers. Then, operating the dense ad hoc network (described above) as a single cell, we study the optimal hop length and power control that maximizes the transport capacity for a given network power constraint. More specifically, for a fading channel and for a fixed transmission time strategy (akin to the IEEE 802.11 TXOP), we find that there exists an intrinsic aggregate bit rate (Theta(opt) bits per second, depending on the contention mechanism and the channel fading characteristics) carried by the network, when operating at the optimal hop length and power control. The optimal transport capacity is of the form d(opt)((P) over bar (t)) x Theta(opt) with d(opt) scaling as (P) over bar (1/eta)(t), where (P) over bar (t) is the available time average transmit power and eta is the path loss exponent. Under certain conditions on the fading distribution, we then provide a simple characterisation of the optimal operating point.

Link route pricing for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under multiple service classes. Our work draws upon [1] and [2] in various ways. We use the Tirupati pricing scheme in conjunction with the stochastic approximation based adaptive pricing methodology for queue control (proposed in [1]) for minimizing network congestion. However, unlike the methodology of [1] where pricing for entire routes is directly considered, we consider prices for individual link-service grade tuples. Further, we adapt the methodology proposed in [21 for a single-node scenario to the case of a network of nodes, for evaluating performance in terms of price, revenue rate and disutility. We obtain considerable performance improvements using our approach over that in [1]. In particular, our approach exhibits a throughput improvement in the range of 54 to 80 percent in all cases studied (over all routes) while exhibiting a lower packet delay in the range of 26 to 38 percent over the scheme in [1].

Decentralized sequential change detection using physical layer fusion

We study the problem of decentralized sequential change detection with conditionally independent observations. The sensors form a star topology with a central node called fusion center as the hub. The sensors transmit a simple function of their observations in an analog fashion over a wireless Gaussian multiple access channel and operate under either a power constraint or an energy constraint. Simulations demonstrate that the proposed techniques have lower detection delays when compared with existing schemes. Moreover we demonstrate that the energy-constrained formulation enables better use of the total available energy than a power-constrained formulation.

Expression profiling of lymph nodes in tuberculosis patients reveal inflammatory milieu at site of infection

Extrapulmonary manifestations constitute 15 to 20% of tuberculosis cases, with lymph node tuberculosis (LNTB) as the most common form of infection. However, diagnosis and treatment advances are hindered by lack of understanding of LNTB biology. To identify host response, Mycobacterium tuberculosis infected lymph nodes from LNTB patients were studied by means of transcriptomics and quantitative proteomics analyses. The selected targets obtained by comparative analyses were validated by quantitative PCR and immunohistochemistry. This approach provided expression data for 8,728 transcripts and 102 proteins, differentially regulated in the infected human lymph node. Enhanced inflammation with upregulation of T-helper1-related genes, combined with marked dysregulation of matrix metalloproteinases, indicates tissue damage due to high immunoactivity at infected niche. This expression signature was accompanied by significant upregulation of an immunoregulatory gene, leukotriene A4 hydrolase, at both transcript and protein levels. Comparative transcriptional analyses revealed LNTB-specific perturbations. In contrast to pulmonary TB-associated increase in lipid metabolism, genes involved in fatty-acid metabolism were found to be downregulated in LNTB suggesting differential lipid metabolic signature. This study investigates the tissue molecular signature of LNTB patients for the first time and presents findings that indicate the possible mechanism of disease pathology through dysregulation of inflammatory and tissue-repair processes.

OFDM Based Distributed Space Time Coding for Asynchronous Relay Networks

Recently Li and Xia have proposed a transmission scheme for wireless relay networks based on the Alamouti space time code and orthogonal frequency division multiplexing to combat the effect of timing errors at the relay nodes. This transmission scheme is amazingly simple and achieves a diversity order of two for any number of relays. Motivated by its simplicity, this scheme is extended to a more general transmission scheme that can achieve full cooperative diversity for any number of relays. The conditions on the distributed space time block code (DSTBC) structure that admit its application in the proposed transmission scheme are identified and it is pointed out that the recently proposed full diversity four group decodable DST-BCs from precoded co-ordinate interleaved orthogonal designs and extended Clifford algebras satisfy these conditions. It is then shown how differential encoding at the source can be combined with the proposed transmission scheme to arrive at a new transmission scheme that can achieve full cooperative diversity in asynchronous wireless relay networks with no channel information and also no timing error knowledge at the destination node. Finally, four group decodable distributed differential space time block codes applicable in this new transmission scheme for power of two number of relays are also provided.

On the Average Case Communication Complexity for Detection in Sensor Networks

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space viewpoint is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces $\mathcal{S_I}$ and $\mathcal{S_C}$ and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating $\mathcal{S_I}$ and $\mathcal{S_C}$ is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. The average case CC of the relevant greater-than (GT) function is characterized within two bits. In the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm.

PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks

Optimization in energy consumption of the existing synchronization mechanisms can lead to substantial gains in terms of network life in Wireless Sensor Networks (WSNs). In this paper, we analyze ERBS and TPSN, two existing synchronization algorithms for WSNs which use widely different approach, and compare their performance in large scale WSNs each of which consists of different type of platform and has varying node density. We, then, propose a novel algorithm, PROBESYNC, which takes advantage of differences in power required to transmit and receive a message on ERBS and TPSN and leverages the shortcomings of each of these algorithms. This leads to considerable improvement in energy conservation and enhanced life of large scale WSNs.

Simulation blocks for TOSSIM-T2

We develop several hardware and software simulation blocks for the TinyOS-2 (TOSSIM-T2) simulator. The choice of simulated hardware platform is the popular MICA2 mote. While the hardware simulation elements comprise of radio and external flash memory, the software blocks include an environment noise model, packet delivery model and an energy estimator block for the complete system. The hardware radio block uses the software environment noise model to sample the noise floor. The packet delivery model is built by establishing the SNR-PRR curve for the MICA2 system. The energy estimator block models energy consumption by Micro Controller Unit(MCU), Radio, LEDs, and external flash memory. Using the manufacturerpsilas data sheets we provide an estimate of the energy consumed by the hardware during transmission, reception and also track several of the MCUs states with the associated energy consumption. To study the effectiveness of this work, we take a case study of a paper presented in [1]. We obtain three sets of results for energy consumption through mathematical analysis, simulation using the blocks built into PowerTossim-T2 and finally laboratory measurements. Since there is a significant match between these result sets, we propose our blocks for T2 community to effectively test their application energy requirements and node life times.

Performance of RT-PCR-ELISA for the detection of peste des petits ruminants virus

A highly sensitive and specific reverse transcription polymerase chain reaction enzyme linked immunosorbent assay (RT-PCR-ELISA) was developed for the objective detection of nucleoprotein (N) gene of peste des petits ruminants (PPR) virus from field outbreaks or experimentally infected sheep. Two primers (IndF and Np4) and one probe (Sp3) available or designed for the amplification/probing of the 'N' gene of PPR virus, were chosen for labeling and use in RT-PCR-ELISA based on highest analytical sensitivity of detection of infective virus or N-gene containing recombinant plasmid, higher nucleotide homology at the primer binding sites of the 'N' gene sequences available and the ability to amplify PPR viral genome from different sources of samples. RT-PCR was performed with unlabeled IndF and Np4 digoxigenin labeled primers followed by a microplate hybridization probe reaction with biotin labeled Sp3 probe. RT-PCR-ELISA was found to be 10-fold more sensitive than the conventional RT-PCR followed by agarose gel based detection of PCR product. Based on the Mean (mean +/- 3S.D.) optical density (OD) values of 47 RT-PCR negative samples, OD values above 0.306 were considered positive in RT-PCR-ELISA. A total of 82 oculo-nasal swabs and tissue samples from suspected PPR cases were analyzed by RT-PCR and RT-PCR-ELISA, which revealed 54.87 and 58.54% positivity, respectively. From an experimentally infected sheep, both RT-PCR and RT-PCR-ELISA could detect the virus from 6 days post-infection up to 9 days in oculo-nasal swabs. On post-mortem, PPR viral genome was detected in spleen, lymph node, lung, heart and liver. The correlation co-efficient between RT-PCR-ELISA OD values and either TCID50 of virus or molecules of DNA was 0.622 and 0.657, respectively. The advantages of RT-PCR-ELISA over the conventional agarose gel based detection of RT-PCR products are discussed. (c) 2006 Elsevier B.V. All rights reserved.

Splitting Algorithms for Fast Relay Selection: Generalizations, Analysis, and a Unified View

Relay selection for cooperative communications promises significant performance improvements, and is, therefore, attracting considerable attention. While several criteria have been proposed for selecting one or more relays, distributed mechanisms that perform the selection have received relatively less attention. In this paper, we develop a novel, yet simple, asymptotic analysis of a splitting-based multiple access selection algorithm to find the single best relay. The analysis leads to simpler and alternate expressions for the average number of slots required to find the best user. By introducing a new contention load' parameter, the analysis shows that the parameter settings used in the existing literature can be improved upon. New and simple bounds are also derived. Furthermore, we propose a new algorithm that addresses the general problem of selecting the best Q >= 1 relays, and analyze and optimize it. Even for a large number of relays, the scalable algorithm selects the best two relays within 4.406 slots and the best three within 6.491 slots, on average. We also propose a new and simple scheme for the practically relevant case of discrete metrics. Altogether, our results develop a unifying perspective about the general problem of distributed selection in cooperative systems and several other multi-node systems.

A network representation of protein structures: Implications for protein stability

This study views each protein structure as a network of noncovalent connections between amino acid side chains. Each amino acid in a protein structure is a node, and the strength of the noncovalent interactions between two amino acids is evaluated for edge determination. The protein structure graphs (PSGs) for 232 proteins have been constructed as a function of the cutoff of the amino acid interaction strength at a few carefully chosen values. Analysis of such PSGs constructed on the basis of edge weights has shown the following: 1), The PSGs exhibit a complex topological network behavior, which is dependent on the interaction cutoff chosen for PSG construction. 2), A transition is observed at a critical interaction cutoff, in all the proteins, as monitored by the size of the largest cluster (giant component) in the graph. Amazingly, this transition occurs within a narrow range of interaction cutoff for all the proteins, irrespective of the size or the fold topology. And 3), the amino acid preferences to be highly connected (hub frequency) have been evaluated as a function of the interaction cutoff. We observe that the aromatic residues along with arginine, histidine, and methionine act as strong hubs at high interaction cutoffs, whereas the hydrophobic leucine and isoleucine residues get added to these hubs at low interaction cutoffs, forming weak hubs. The hubs identified are found to play a role in bringing together different secondary structural elements in the tertiary structure of the proteins. They are also found to contribute to the additional stability of the thermophilic proteins when compared to their mesophilic counterparts and hence could be crucial for the folding and stability of the unique three-dimensional structure of proteins. Based on these results, we also predict a few residues in the thermophilic and mesophilic proteins that can be mutated to alter their thermal stability.

Proteomic identification of putative microRNA394 target genes in Arabidopsis thaliana identifies MLP family members critical for normal development

Expression of the F-Box protein Leaf Curling Responsiveness (LCR) is regulated by microRNA, miR394, and alterations to this interplay in Arabidopsis thaliana produce defects in leaf polarity and shoot apical meristem (SAM) organisation. Although the miR394-LCR node has been documented in Arabidopsis, the identification of proteins targeted by LCR F-box itself has proven problematic. Here, a proteomic analysis of shoot apices from plants with altered LCR levels identified a member of the Major Latex Protein (MLP) family gene as a potential LCR F-box target. Bioinformatic and molecular analyses also suggested that other MLP family members are likely to be targets for this post-translational regulation. Direct interaction between LCR F-Box and MLP423 was validated. Additional MLP members had reduction in protein accumulation, in varying degrees, mediated by LCR F-Box. Transgenic Arabidopsis lines, in which MLP28 expression was reduced through an artificial miRNA technology, displayed severe developmental defects, including changes in leaf patterning and morphology, shoot apex defects, and eventual premature death. These phenotypic characteristics resemble those of Arabidopsis plants modified to over-express LCR. Taken together, the results demonstrate that MLPs are driven to degradation by LCR, and indicate that MLP gene family is target of miR394-LCR regulatory node, representing potential targets for directly post-translational regulation mediated by LCR F-Box. In addition, MLP28 family member is associated with the LCR regulation that is critical for normal Arabidopsis development.

An analytical approach to the study of cooperation in wireless ad hoc networks

In wireless ad hoc networks, nodes communicate with far off destinations using intermediate nodes as relays. Since wireless nodes are energy constrained, it may not be in the best interest of a node to always accept relay requests. On the other hand, if all nodes decide not to expend energy in relaying, then network throughput will drop dramatically. Both these extreme scenarios (complete cooperation and complete noncooperation) are inimical to the interests of a user. In this paper, we address the issue of user cooperation in ad hoc networks. We assume that nodes are rational, i.e., their actions are strictly determined by self interest, and that each node is associated with a minimum lifetime constraint. Given these lifetime constraints and the assumption of rational behavior, we are able to determine the optimal share of service that each node should receive. We define this to be the rational Pareto optimal operating point. We then propose a distributed and scalable acceptance algorithm called Generous TIT-FOR-TAT (GTFT). The acceptance algorithm is used by the nodes to decide whether to accept or reject a relay request. We show that GTFT results in a Nash equilibrium and prove that the system converges to the rational and optimal operating point.

Solution of MDPS using simulation-based value iteration

This article proposes a three-timescale simulation based algorithm for solution of infinite horizon Markov Decision Processes (MDPs). We assume a finite state space and discounted cost criterion and adopt the value iteration approach. An approximation of the Dynamic Programming operator T is applied to the value function iterates. This 'approximate' operator is implemented using three timescales, the slowest of which updates the value function iterates. On the middle timescale we perform a gradient search over the feasible action set of each state using Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates, thus finding the minimizing action in T. On the fastest timescale, the 'critic' estimates, over which the gradient search is performed, are obtained. A sketch of convergence explaining the dynamics of the algorithm using associated ODEs is also presented. Numerical experiments on rate based flow control on a bottleneck node using a continuous-time queueing model are performed using the proposed algorithm. The results obtained are verified against classical value iteration where the feasible set is suitably discretized. Over such a discretized setting, a variant of the algorithm of [12] is compared and the proposed algorithm is found to converge faster.