Predicting gene ontology annotations of orphan GWAS genes using protein-protein interactions

Background: The number of genome-wide association studies (GWAS) has increased rapidly in the past couple of years, resulting in the identification of genes associated with different diseases. The next step in translating these findings into biomedically useful information is to find out the mechanism of the action of these genes. However, GWAS studies often implicate genes whose functions are currently unknown; for example, MYEOV, ANKLE1, TMEM45B and ORAOV1 are found to be associated with breast cancer, but their molecular function is unknown. Results: We carried out Bayesian inference of Gene Ontology (GO) term annotations of genes by employing the directed acyclic graph structure of GO and the network of protein-protein interactions (PPIs). The approach is designed based on the fact that two proteins that interact biophysically would be in physical proximity of each other, would possess complementary molecular function, and play role in related biological processes. Predicted GO terms were ranked according to their relative association scores and the approach was evaluated quantitatively by plotting the precision versus recall values and F-scores (the harmonic mean of precision and recall) versus varying thresholds. Precisions of similar to 58% and similar to 40% for localization and functions respectively of proteins were determined at a threshold of similar to 30 (top 30 GO terms in the ranked list). Comparison with function prediction based on semantic similarity among nodes in an ontology and incorporation of those similarities in a k nearest neighbor classifier confirmed that our results compared favorably. Conclusions: This approach was applied to predict the cellular component and molecular function GO terms of all human proteins that have interacting partners possessing at least one known GO annotation. The list of predictions is available at http://severus.dbmi.pitt.edu/engo/GOPRED.html. We present the algorithm, evaluations and the results of the computational predictions, especially for genes identified in GWAS studies to be associated with diseases, which are of translational interest.

Performance Analysis of a Cooperative MAC Protocol of Wireless Ad Hoc Networks

Different medium access control (MAC) layer protocols, for example, IEEE 802.11 series and others are used in wireless local area networks. They have limitation in handling bulk data transfer applications, like video-on-demand, videoconference, etc. To avoid this problem a cooperative MAC protocol environment has been introduced, which enables the MAC protocol of a node to use its nearby nodes MAC protocol as and when required. We have found on various occasions that specified cooperative MAC establishes cooperative transmissions to send the specified data to the destination. In this paper we propose cooperative MAC priority (CoopMACPri) protocol which exploits the advantages of priority value given by the upper layers for selection of different paths to nodes running heterogeneous applications in a wireless ad hoc network environment. The CoopMACPri protocol improves the system throughput and minimizes energy consumption. Using a Markov chain model, we developed a model to analyse the performance of CoopMACPri protocol; and also derived closed-form expression of saturated system throughput and energy consumption. Performance evaluations validate the accuracy of the theoretical analysis, and also show that the performance of CoopMACPri protocol varies with the number of nodes. We observed that the simulation results and analysis reflects the effectiveness of the proposed protocol as per the specifications.

Co-Evolution of Content Spread and Popularity in Mobile Opportunistic Networks

We consider a setting in which a single item of content is disseminated in a population of mobile nodes by opportunistic copying when pairs of nodes come in radio contact. The nodes in the population may either be interested in receiving the content (referred to as destinations) or not yet interested in receiving the content (referred to as relays). We consider a model for the evolution of popularity, the process by which relays get converted into destinations. A key contribution of our work is to model and study the joint evolution of content popularity and its spread in the population. Copying the content to relay nodes is beneficial since they can help spread the content to destinations, and could themselves be converted into destinations. We derive a fluid limit for the joint evolution model and obtain optimal policies for copying to relay nodes in order to deliver content to a desired fraction of destinations, while limiting the fraction of relay nodes that get the content but never turn into destinations. We prove that a time-threshold policy is optimal for controlling the copying to relays, i.e., there is an optimal time-threshold up to which all opportunities for copying to relays are exploited, and after which relays are not copied to. We then utilize simulations and numerical evaluations to provide insights into the effects of various system parameters on the optimally controlled co-evolution model.

Energy Efficient GPS Acquisition with Sparse-GPS

Following rising demands in positioning with GPS, low-cost receivers are becoming widely available; but their energy demands are still too high. For energy efficient GPS sensing in delay-tolerant applications, the possibility of offloading a few milliseconds of raw signal samples and leveraging the greater processing power of the cloud for obtaining a position fix is being actively investigated. In an attempt to reduce the energy cost of this data offloading operation, we propose Sparse-GPS(1): a new computing framework for GPS acquisition via sparse approximation. Within the framework, GPS signals can be efficiently compressed by random ensembles. The sparse acquisition information, pertaining to the visible satellites that are embedded within these limited measurements, can subsequently be recovered by our proposed representation dictionary. By extensive empirical evaluations, we demonstrate the acquisition quality and energy gains of Sparse-GPS. We show that it is twice as energy efficient than offloading uncompressed data, and has 5-10 times lower energy costs than standalone GPS; with a median positioning accuracy of 40 m.

Collective eigenstates of emission in an N-entity heterostructure and the evaluation of its Green tensors and self-energy components

Optical emission from emitters strongly interacting among themselves and also with other polarizable matter in close proximity has been approximated by emission from independent emitters. This is primarily due to our inability to evaluate the self-energy matrices and radiative properties of the collective eigenstates of emitters in heterogeneous ensembles. A method to evaluate self-energy matrices that is not limited by the geometry and material composition is presented to understand and exploit such collective excitations. Numerical evaluations using this method are used to highlight the significant differences between independent and the collective modes of emission in nanoscale heterostructures. A set of N Lorentz emitters and other polarizable entities is used to represent the coupled system of a generalized geometry in a volume integral approach. Closed form relations between the Green tensors of entity pairs in free space and their correspondents in a heterostructure are derived concisely. This is made possible for general geometries because the global matrices consisting of all free-space Green dyads are subject to conservation laws. The self-energy matrix can then be assembled using the evaluated Green tensors of the heterostructure, but a decomposition of its components into their radiative and nonradiative decay contributions is nontrivial. The relations to compute the observables of the eigenstates (such as quantum efficiency, power/energy of emission, radiative and nonradiative decay rates) are presented. A note on extension of this method to collective excitations, which also includes strong interactions with a surface in the near-field, is added. (C) 2014 Optical Society of America

Secure Transmission in Cooperative Networks with Weak Eavesdroppers

In this letter, we propose a scheme to improve the secrecy rate of cooperative networks using Analog Network Coding (ANC). ANC mixes the signals in the air; the desired signal is then separated out, from the mixed signals, at the legitimate receiver using techniques like self interference subtraction and signal nulling, thereby achieving better secrecy rates. Assuming global channel state information, memoryless adversaries and the decode-and-forward strategy, we seek to maximize the average secrecy rate between the source and the destination, subject to an overall power budget. Then, exploiting the structure of the optimization problem, we compute its optimal solution. Finally, we use numerical evaluations to compare our scheme with the conventional approaches.

Phase space path integral approach to harmonic oscillator with a time-dependent force constant

The quantum statistical mechanical propagator for a harmonic oscillator with a time-dependent force constant, m omega(2)(t), has been investigated in the past and was found to have only a formal solution in terms of the solutions of certain ordinary differential equations. Such path integrals are frequently encountered in semiclassical path integral evaluations and having exact analytical expressions for such path integrals is of great interest. In a previous work, we had obtained the exact propagator for motion in an arbitrary time-dependent harmonic potential in the overdamped limit of friction using phase space path integrals in the context of Levy flights - a result that can be easily extended to Brownian motion. In this paper, we make a connection between the overdamped Brownian motion and the imaginary time propagator of quantum mechanics and thereby get yet another way to evaluate the latter exactly. We find that explicit analytic solution for the quantum statistical mechanical propagator can be written when the time-dependent force constant has the form omega(2)(t) = lambda(2)(t) - d lambda(t)/dt where lambda(t) is any arbitrary function of t and use it to evaluate path integrals which have not been evaluated previously. We also employ this method to arrive at a formal solution of the propagator for both Levy flights and Brownian subjected to a time-dependent harmonic potential in the underdamped limit of friction. (C) 2015 Elsevier B.V. All rights reserved.

Accurate Indoor Positioning of Firefighters using Dual Foot-mounted Inertial Sensors and Inter-agent Ranging

A real-time cooperative localization system, utilizing dual foot-mounted low-cost inertial sensors and RF-based inter-agent ranging, has been developed. Scenario-based tests have been performed, using fully-equipped firefighters mimicking a search operation in a partly smoke-filled environment, to evaluate the performance of the TOR (Tactical lOcatoR) system. The performed tests included realistic firefighter movements and inter-agent distances, factors that are crucial in order to provide realistic evaluations of the expected performance in real-world operations. The tests indicate that the TOR system may be able to provide a position accuracy of approximately two to three meters during realistic firefighter operations, with only two smoke diving firefighters and one supervising firefighter within range.

CheepSync: A Time Synchronization Service for Resource Constrained Bluetooth LE Advertisers

Clock synchronization is highly desirable in distributed systems, including many applications in the Internet of Things and Humans. It improves the efficiency, modularity, and scalability of the system, and optimizes use of event triggers. For IoTH, BLE - a subset of the recent Bluetooth v4.0 stack - provides a low-power and loosely coupled mechanism for sensor data collection with ubiquitous units (e.g., smartphones and tablets) carried by humans. This fundamental design paradigm of BLE is enabled by a range of broadcast advertising modes. While its operational benefits are numerous, the lack of a common time reference in the broadcast mode of BLE has been a fundamental limitation. This article presents and describes CheepSync, a time synchronization service for BLE advertisers, especially tailored for applications requiring high time precision on resource constrained BLE platforms. Designed on top of the existing Bluetooth v4.0 standard, the CheepSync framework utilizes low-level time-stamping and comprehensive error compensation mechanisms for overcoming uncertainties in message transmission, clock drift, and other system-specific constraints. CheepSync was implemented on custom designed nRF24Cheep beacon platforms (as broadcasters) and commercial off-the-shelf Android ported smartphones (as passive listeners). We demonstrate the efficacy of CheepSync by numerous empirical evaluations in a variety of experimental setups, and show that its average (single-hop) time synchronization accuracy is in the 10 mu s range.

Dictionary-Learning-Based Post-Filter for HMM-Based Speech Synthesis

Oversmoothing of speech parameter trajectories is one of the causes for quality degradation of HMM-based speech synthesis. Various methods have been proposed to overcome this effect, the most recent ones being global variance (GV) and modulation-spectrum-based post-filter (MSPF). However, there is still a significant quality gap between natural and synthesized speech. In this paper, we propose a two-fold post-filtering technique to alleviate to a certain extent the oversmoothing of spectral and excitation parameter trajectories of HMM-based speech synthesis. For the spectral parameters, we propose a sparse coding-based post-filter to match the trajectories of synthetic speech to that of natural speech, and for the excitation trajectory, we introduce a perceptually motivated post-filter. Experimental evaluations show quality improvement compared with existing methods.