Design and performance analysis of a signal detector based on suprathreshold stochastic resonance

This paper presents the design and performance analysis of a detector based on suprathreshold stochastic resonance (SSR) for the detection of deterministic signals in heavy-tailed non-Gaussian noise. The detector consists of a matched filter preceded by an SSR system which acts as a preprocessor. The SSR system is composed of an array of 2-level quantizers with independent and identically distributed (i.i.d) noise added to the input of each quantizer. The standard deviation sigma of quantizer noise is chosen to maximize the detection probability for a given false alarm probability. In the case of a weak signal, the optimum sigma also minimizes the mean-square difference between the output of the quantizer array and the output of the nonlinear transformation of the locally optimum detector. The optimum sigma depends only on the probability density functions (pdfs) of input noise and quantizer noise for weak signals, and also on the signal amplitude and the false alarm probability for non-weak signals. Improvement in detector performance stems primarily from quantization and to a lesser extent from the optimization of quantizer noise. For most input noise pdfs, the performance of the SSR detector is very close to that of the optimum detector. (C) 2012 Elsevier B.V. All rights reserved.

Low cost calibrated mechanical noisemaker for hearing screening of neonates in resource constrained settings

Background & objectives: There is a need to develop an affordable and reliable tool for hearing screening of neonates in resource constrained, medically underserved areas of developing nations. This study valuates a strategy of health worker based screening of neonates using a low cost mechanical calibrated noisemaker followed up with parental monitoring of age appropriate auditory milestones for detecting severe-profound hearing impairment in infants by 6 months of age. Methods: A trained health worker under the supervision of a qualified audiologist screened 425 neonates of whom 20 had confirmed severe-profound hearing impairment. Mechanical calibrated noisemakers of 50, 60, 70 and 80 dB (A) were used to elicit the behavioural responses. The parents of screened neonates were instructed to monitor the normal language and auditory milestones till 6 months of age. This strategy was validated against the reference standard consisting of a battery of tests - namely, auditory brain stem response (ABR), otoacoustic emissions (OAE) and behavioural assessment at 2 years of age. Bayesian prevalence weighted measures of screening were calculated. Results: The sensitivity and specificity was high with least false positive referrals for. 70 and 80 dB (A) noisemakers. All the noisemakers had 100 per cent negative predictive value. 70 and 80 dB (A) noisemakers had high positive likelihood ratios of 19 and 34, respectively. The probability differences for pre- and post- test positive was 43 and 58 for 70 and 80 dB (A) noisemakers, respectively. Interpretation & conclusions: In a controlled setting, health workers with primary education can be trained to use a mechanical calibrated noisemaker made of locally available material to reliably screen for severe-profound hearing loss in neonates. The monitoring of auditory responses could be done by informed parents. Multi-centre field trials of this strategy need to be carried out to examine the feasibility of community health care workers using it in resource constrained settings of developing nations to implement an effective national neonatal hearing screening programme.

A scalable network port scan detection system on FPGA

With ever increasing network speed, scalable and reliable detection of network port scans has become a major challenge. In this paper, we present a scalable and flexible architecture and a novel algorithm, to detect and block port scans in real time. The proposed architecture detects fast scanners as well as stealth scanners having large inter-probe periods. FPGA implementation of the proposed system gives an average throughput of 2 Gbps with a system clock frequency of 100 MHz on Xilinx Virtex-II Pro FPGA. Experimental results on real network trace show the effectiveness of the proposed system in detecting and blocking network scans with very low false positives and false negatives.

Predictability and chaotic nature of daily streamflow

The predictability of a chaotic series is limited to a few future time steps due to its sensitivity to initial conditions and the exponential divergence of the trajectories. Over the years, streamflow has been considered as a stochastic system in many approaches. In this study, the chaotic nature of daily streamflow is investigated using autocorrelation function, Fourier spectrum, correlation dimension method (Grassberger-Procaccia algorithm) and false nearest neighbor method. Embedding dimensions of 6-7 obtained indicates the possible presence of low-dimensional chaotic behavior. The predictability of the system is estimated by calculating the system’s Lyapunov exponent. A positive maximum Lyapunov exponent of 0.167 indicates that the system is chaotic and unstable with a maximum predictability of only 6 days. These results give a positive indication towards considering streamflow as a low dimensional chaotic system than as a stochastic system.

Predicting the extremes of Indian summer monsoon rainfall with coupled ocean-atmosphere models

An analysis of the retrospective predictions by seven coupled ocean atmosphere models from major forecasting centres of Europe and USA, aimed at assessing their ability in predicting the interannual variation of the Indian summer monsoon rainfall (ISMR), particularly the extremes (i.e. droughts and excess rainfall seasons) is presented in this article. On the whole, the skill in prediction of extremes is not bad since most of the models are able to predict the sign of the ISMR anomaly for a majority of the extremes. There is a remarkable coherence between the models in successes and failures of the predictions, with all the models generating loud false alarms for the normal monsoon season of 1997 and the excess monsoon season of 1983. It is well known that the El Nino and Southern Oscillation (ENSO) and the Equatorial Indian Ocean Oscillation (EQUINOO) play an important role in the interannual variation of ISMR and particularly the extremes. The prediction of the phases of these modes and their link with the monsoon has also been assessed. It is found that models are able to simulate ENSO-monsoon link realistically, whereas the EQUINOO-ISMR link is simulated realistically by only one model the ECMWF model. Furthermore, it is found that in most models this link is opposite to the observed, with the predicted ISMR being negatively (instead of positively) correlated with the rainfall over the western equatorial Indian Ocean and positively (instead of negatively) correlated with the rainfall over the eastern equatorial Indian Ocean. Analysis of the seasons for which the predictions of almost all the models have large errors has suggested the facets of ENSO and EQUINOO and the links with the monsoon that need to be improved for improving monsoon predictions by these models.

Predictability and chaotic nature of daily streamflow

The predictability of a chaotic series is limited to a few future time steps due to its sensitivity to initial conditions and the exponential divergence of the trajectories. Over the years, streamflow has been considered as a stochastic system in many approaches. In this study, the chaotic nature of daily streamflow is investigated using autocorrelation function, Fourier spectrum, correlation dimension method (Grassberger-Procaccia algorithm) and false nearest neighbor method. Embedding dimensions of 6-7 obtained indicates the possible presence of low-dimensional chaotic behavior. The predictability of the system is estimated by calculating the system's Lyapunov exponent. A positive maximum Lyapunov exponent of 0.167 indicates that the system is chaotic and unstable with a maximum predictability of only 6 days. These results give a positive indication towards considering streamflow as a low dimensional chaotic system than as a stochastic system.

Narrowband signal detection techniques in shallow ocean by acoustic vector sensor array

This paper presents the formulation and performance analysis of four techniques for detection of a narrowband acoustic source in a shallow range-independent ocean using an acoustic vector sensor (AVS) array. The array signal vector is not known due to the unknown location of the source. Hence all detectors are based on a generalized likelihood ratio test (GLRT) which involves estimation of the array signal vector. One non-parametric and three parametric (model-based) signal estimators are presented. It is shown that there is a strong correlation between the detector performance and the mean-square signal estimation error. Theoretical expressions for probability of false alarm and probability of detection are derived for all the detectors, and the theoretical predictions are compared with simulation results. It is shown that the detection performance of an AVS array with a certain number of sensors is equal to or slightly better than that of a conventional acoustic pressure sensor array with thrice as many sensors.

TCP: thread contention predictor for parallel programs

With proliferation of chip multicores (CMPs) on desktops and embedded platforms, multi-threaded programs have become ubiquitous. Existence of multiple threads may cause resource contention, such as, in on-chip shared cache and interconnects, depending upon how they access resources. Hence, we propose a tool - Thread Contention Predictor (TCP) to help quantify the number of threads sharing data and their sharing pattern. We demonstrate its use to predict a more profitable shared, last level on-chip cache (LLC) access policy on CMPs. Our cache configuration predictor is 2.2 times faster compared to the cycle-accurate simulations. We also demonstrate its use for identifying hot data structures in a program which may cause performance degradation due to false data sharing. We fix layout of such data structures and show up-to 10% and 18% improvement in execution time and energy-delay product (EDP), respectively.

Divvying up an incubator: How parasitic and mutualistic fig wasps use space within their nursery microcosm

Differential occupancy of space can lead to species coexistence. The fig-fig wasp pollination system hosts species-specific pollinating and parasitic wasps that develop within galls in a nursery comprising a closed inflorescence, the syconium. This microcosm affords excellent opportunities for investigating spatial partitioning since it harbours a closed community in which all wasp species are dependent on securing safe sites inside the syconium for their developing offspring while differing in life history, egg deposition strategies and oviposition times relative to nursery development. We determined ontogenetic changes in oviposition sites available to the seven-member fig wasp community of Ficus racemosa comprising pollinators, gallers and parasitoids. We used species distribution models (SDMs) for the first time at a microcosm scale to predict patterns of spatial occurrence of nursery occupants. SDMs gave high true-positive and low false-positive site occupancy rates for most occupants indicating species specificity in oviposition sites. The nursery microcosm itself changed with syconium development and sequential egg-laying by different wasp species. The number of sites occupied by offspring of the different wasp species was negatively related to the risk of syconium abortion by the plant host following oviposition. Since unpollinated syconia are usually aborted, parasitic wasps ovipositing into nurseries at the same time as the pollinator targeted many sites, suggesting response to lower risk of syconium abortion owing to reduced risk of pollination failure compared to those species ovipositing before pollination. Wasp life history and oviposition time relative to nursery development contributed to the co-existence of nursery occupants.

Race Detection for Android Applications

Programming environments for smartphones expose a concurrency model that combines multi-threading and asynchronous event-based dispatch. While this enables the development of efficient and feature-rich applications, unforeseen thread interleavings coupled with non-deterministic reorderings of asynchronous tasks can lead to subtle concurrency errors in the applications. In this paper, we formalize the concurrency semantics of the Android programming model. We further define the happens-before relation for Android applications, and develop a dynamic race detection technique based on this relation. Our relation generalizes the so far independently studied happens-before relations for multi-threaded programs and single-threaded event-driven programs. Additionally, our race detection technique uses a model of the Android runtime environment to reduce false positives. We have implemented a tool called DROIDRACER. It generates execution traces by systematically testing Android applications and detects data races by computing the happens-before relation on the traces. We analyzed 1 5 Android applications including popular applications such as Facebook, Twitter and K-9 Mail. Our results indicate that data races are prevalent in Android applications, and that DROIDRACER is an effective tool to identify data races.

Use of a structural alphabet to find compatible folds for amino acid sequences

The structural annotation of proteins with no detectable homologs of known 3D structure identified using sequence-search methods is a major challenge today. We propose an original method that computes the conditional probabilities for the amino-acid sequence of a protein to fit to known protein 3D structures using a structural alphabet, known as Protein Blocks (PBs). PBs constitute a library of 16 local structural prototypes that approximate every part of protein backbone structures. It is used to encode 3D protein structures into 1D PB sequences and to capture sequence to structure relationships. Our method relies on amino acid occurrence matrices, one for each PB, to score global and local threading of query amino acid sequences to protein folds encoded into PB sequences. It does not use any information from residue contacts or sequence-search methods or explicit incorporation of hydrophobic effect. The performance of the method was assessed with independent test datasets derived from SCOP 1.75A. With a Z-score cutoff that achieved 95% specificity (i.e., less than 5% false positives), global and local threading showed sensitivity of 64.1% and 34.2%, respectively. We further tested its performance on 57 difficult CASP10 targets that had no known homologs in PDB: 38 compatible templates were identified by our approach and 66% of these hits yielded correctly predicted structures. This method scales-up well and offers promising perspectives for structural annotations at genomic level. It has been implemented in the form of a web-server that is freely available at http://www.bo-protscience.fr/forsa.

From Workstations to Workbenches: Towards Predicting Physicochemically Viable Protein-Protein Interactions Across a Host and a Pathogen

The understanding of protein-protein interactions is indispensable in comprehending most of the biological processes in a cell. Small-scale experiments as well as large-scale high-throughput techniques over the past few decades have facilitated identification and analysis of protein-protein interactions which form the basis of much of our knowledge on functional and regulatory aspects of proteins. However, such rich catalog of interaction data should be used with caution when establishing protein-protein interactions in silico, as the high-throughput datasets are prone to false positives. Numerous computational means developed to pursue genome-wide studies on protein-protein interactions at times overlook the mechanistic and molecular details, thus questioning the reliability of predicted protein-protein interactions. We review the development, advantages, and shortcomings of varied approaches and demonstrate that by providing a structural viewpoint in terms of shape complementarity and interaction energies at protein-protein interfaces coupled with information on expression and localization of proteins homologous to an interacting pair, it is possible to assess the credibility of predicted interactions in biological context. With a focus on human pathogen Mycobacterium tuberculosis H37Rv, we show that such scrupulous use of details at the molecular level can predict physicochemically viable protein-protein interactions across host and pathogen. Such predicted interactions have the potential to provide molecular basis of probable mechanisms of pathogenesis and hence open up ways to explore their usefulness as targets in the light of drug discovery. (c) 2014 IUBMB Life, 66(11):759-774, 2014

Trace Driven Dynamic Deadlock Detection and Reproduction

Dynamic analysis techniques have been proposed to detect potential deadlocks. Analyzing and comprehending each potential deadlock to determine whether the deadlock is feasible in a real execution requires significant programmer effort. Moreover, empirical evidence shows that existing analyses are quite imprecise. This imprecision of the analyses further void the manual effort invested in reasoning about non-existent defects. In this paper, we address the problems of imprecision of existing analyses and the subsequent manual effort necessary to reason about deadlocks. We propose a novel approach for deadlock detection by designing a dynamic analysis that intelligently leverages execution traces. To reduce the manual effort, we replay the program by making the execution follow a schedule derived based on the observed trace. For a real deadlock, its feasibility is automatically verified if the replay causes the execution to deadlock. We have implemented our approach as part of WOLF and have analyzed many large (upto 160KLoC) Java programs. Our experimental results show that we are able to identify 74% of the reported defects as true (or false) positives automatically leaving very few defects for manual analysis. The overhead of our approach is negligible making it a compelling tool for practical adoption.

Zero-Crossings Based Spectrum Sensing Under Noise Uncertainties

In this work, the hypothesis testing problem of spectrum sensing in a cognitive radio is formulated as a Goodness-of-fit test against the general class of noise distributions used in most communications-related applications. A simple, general, and powerful spectrum sensing technique based on the number of weighted zero-crossings in the observations is proposed. For the cases of uniform and exponential weights, an expression for computing the near-optimal detection threshold that meets a given false alarm probability constraint is obtained. The proposed detector is shown to be robust to two commonly encountered types of noise uncertainties, namely, the noise model uncertainty, where the PDF of the noise process is not completely known, and the noise parameter uncertainty, where the parameters associated with the noise PDF are either partially or completely unknown. Simulation results validate our analysis, and illustrate the performance benefits of the proposed technique relative to existing methods, especially in the low SNR regime and in the presence of noise uncertainties.

Do we see what we should see? Describing non-covalent interactions in protein structures including precision

The power of X-ray crystal structure analysis as a technique is to `see where the atoms are'. The results are extensively used by a wide variety of research communities. However, this `seeing where the atoms are' can give a false sense of security unless the precision of the placement of the atoms has been taken into account. Indeed, the presentation of bond distances and angles to a false precision (i.e. to too many decimal places) is commonplace. This article has three themes. Firstly, a basis for a proper representation of protein crystal structure results is detailed and demonstrated with respect to analyses of Protein Data Bank entries. The basis for establishing the precision of placement of each atom in a protein crystal structure is non-trivial. Secondly, a knowledge base harnessing such a descriptor of precision is presented. It is applied here to the case of salt bridges, i.e. ion pairs, in protein structures; this is the most fundamental place to start with such structure-precision representations since salt bridges are one of the tenets of protein structure stability. Ion pairs also play a central role in protein oligomerization, molecular recognition of ligands and substrates, allosteric regulation, domain motion and alpha-helix capping. A new knowledge base, SBPS (Salt Bridges in Protein Structures), takes these structural precisions into account and is the first of its kind. The third theme of the article is to indicate natural extensions of the need for such a description of precision, such as those involving metalloproteins and the determination of the protonation states of ionizable amino acids. Overall, it is also noted that this work and these examples are also relevant to protein three-dimensional structure molecular graphics software.