A Perspective to Adopt Continuous Dynamic Cognition for Malicious Node Detection in Heterogeneous Networks

The current day networks use Proactive networks for adaption to the dynamic scenarios. The use of cognition technique based on the Observe, Orient, Decide and Act loop (OODA) is proposed to construct proactive networks. The network performance degradation in knowledge acquisition and malicious node presence is a problem that exists. The use of continuous time dynamic neural network is considered to achieve cognition. The variance in service rates of user nodes is used to detect malicious activity in heterogeneous networks. The improved malicious node detection rates are proved through the experimental results presented in this paper. (C) 2015 The Authors. Published by Elsevier B.V.

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.

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.

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.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

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 view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) 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 f(s) and f(g) 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. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under 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. 2010 Elsevier B.V. All rights reserved.

Intruder detection over sensor placement in a hexagonal lattice

The problem of intrusion detection and location identification in the presence of clutter is considered for a hexagonal sensor-node geometry. It is noted that in any practical application,for a given fixed intruder or clutter location, only a small number of neighboring sensor nodes will register a significant reading. Thus sensing may be regarded as a local phenomenon and performance is strongly dependent on the local geometry of the sensor nodes. We focus on the case when the sensor nodes form a hexagonal lattice. The optimality of the hexagonal lattice with respect to density of packing and covering and largeness of the kissing number suggest that this is the best possible arrangement from a sensor network viewpoint. The results presented here are clearly relevant when the particular sensing application permits a deterministic placement of sensors. The results also serve as a performance benchmark for the case of a random deployment of sensors. A novel feature of our analysis of the hexagonal sensor grid is a signal-space viewpoint which sheds light on achievable performance.Under this viewpoint, the problem of intruder detection is reduced to one of determining in a distributed manner, the optimal decision boundary that separates the signal spaces SI and SC associated to intruder and clutter respectively. Given the difficulty of implementing the optimal detector, we present a low-complexity distributive algorithm under which the surfaces SI and SC are separated by a wellchosen hyperplane. The algorithm is designed to be efficient in terms of communication cost by minimizing the expected number of bits transmitted by a sensor.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Enabling node repair in any erasure code for distributed storage

Erasure codes are an efficient means of storing data across a network in comparison to data replication, as they tend to reduce the amount of data stored in the network and offer increased resilience in the presence of node failures. The codes perform poorly though, when repair of a failed node is called for, as they typically require the entire file to be downloaded to repair a failed node. A new class of erasure codes, termed as regenerating codes were recently introduced, that do much better in this respect. However, given the variety of efficient erasure codes available in the literature, there is considerable interest in the construction of coding schemes that would enable traditional erasure codes to be used, while retaining the feature that only a fraction of the data need be downloaded for node repair. In this paper, we present a simple, yet powerful, framework that does precisely this. Under this framework, the nodes are partitioned into two types and encoded using two codes in a manner that reduces the problem of node-repair to that of erasure-decoding of the constituent codes. Depending upon the choice of the two codes, the framework can be used to avail one or more of the following advantages: simultaneous minimization of storage space and repair-bandwidth, low complexity of operation, fewer disk reads at helper nodes during repair, and error detection and correction.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

ELISA for the detection of venoms from four medically important snakes of India

A double antibody sandwich enzyme linked immunosorbent assay (ELISA) was developed to detect Echis carinatus venom in various organs (brain, heart, lungs, liver, spleen and kidneys) as well as tissue at the site of injection of mice, at various time intervals (1, 6, 12, 18, 24 h and 12 h intervals up to 72 h) after death. The assay could detect E. carinatus venom levels up to 2.5 ng/ml of tissue homogenate and the venom was detected up to 72 h after death. A highly sensitive and species-specific avidin-biotin microtitre ELISA was also developed to detect venoms of four medically important Indian snakes (Bungarus caeruleus, Naja naja, E. carinatus and Daboia russelli russelli) in autopsy specimens of human victims of snake bite. The assay could detect venom levels as low as 100 pg/ml of tissue homogenate. Venoms were detected in brain, heart, lungs, liver, spleen, kidneys, tissue at the bite area and postmortem blood. In all 12 human victim cadavers tested the culprit species were identified. As observed in mice, tissue at the site of bite area showed the highest concentration of venom and the brain showed the least. Moderate amounts of venoms were found in liver, spleen, kidneys, heart and lungs. Development of a simple, rapid and species-specific diagnostic kit based on this ELISA technique useful to clinicians is discussed.

Enhanced sensitivity in detection of Kerr rotation by double modulation and time averaging based on Allan variance

Experiments in spintronics necessarily involve the detection of spin polarization. The sensitivity of this detection becomes an important factor to consider when extending the low temperature studies on semiconductor spintronic devices to room temperature, where the spin signal is weaker. In pump-probe experiments, which optically inject and detect spins, the sensitivity is often improved by using a photoelastic modulator (PEM) for lock-in detection. However, spurious signals can arise if diode lasers are used as optical sources in such experiments, along with a PEM. In this work, we eliminated the spurious electromagnetic coupling of the PEM onto the probe diode laser, by the double modulation technique. We also developed a test for spurious modulated interference in the pump-probe signal, due to the PEM. Besides, an order of magnitude enhancement in the sensitivity of detection of spin polarization by Kerr rotation, to 3x10(-8) rad was obtained by using the concept of Allan variance to optimally average the time series data over a period of 416 s. With these improvements, we are able to experimentally demonstrate at room temperature, photoinduced steady-state spin polarization in bulk GaAs. Thus, the advances reported here facilitate the use of diode lasers with a PEM for sensitive pump-probe experiments. They also constitute a step toward detection of spin-injection in Si at room temperature.

Detection of the protein dimers, multiple monomeric states and hydrated forms of Plasmodium falciparum triosephosphate isomerase in the gas phase

Dimeric and monomeric forms of the enzyme triosephosphate isomerase (TIM) from Plasmodium falciparum (Pf) have been detected under conditions of nanoflow by electrospray mass spectrometry. The dimer (M = 55 663 Da) exhibits a narrow charge state distribution with intense peaks limited to values of 18(+) to 21(+), maximal intensity being observed for charge states 19(+) and 20(+). A monomeric species with a charge state distribution ranging from 11(+) to 16(+) is also observed, which may be assigned to folded dissociated subunits. Complete dimer dissociation results under normal electrospray condition. The effects of solution pH and source temperature have been investigated. The observation of four distinct charge state distributions which may be assigned to a dimer, folded monomer, partially folded monomer and unfolded monomer is reported. Circular dichromism and fluorescence studies of Pf TIM at low pH support the retention of substantial secondary and tertiary structures. Satellite peaks in mass spectra corresponding to hydrated species are also observed and isotope shift upon deuteration is demonstrated. The analysis of all available independent crystal structures of Pf TIM and TIMs from other organisms permits identification of structurally conserved water molecules. Hydration observed in the dimer and folded monomeric forms in the gas phase may correspond to these conserved sites.

Efficient Hg and Ag ion detection with luminescent PbS quantum dots grown in poly vinyl alcohol and capped with mercaptoethanol

PbS quantum dots capped with mercaptoethanol (C2H5OSH) have been synthesized in poly vinyl alcohol and used to investigate their photoluminescence (PL) response to various ions such as zinc (Zn), cadmium (Cd), mercury (Hg), silver (Ag), copper (Cu), iron (Fe), manganese (Mn), cobalt (Co), chromium (Cr) and nickel (Ni). The enhancement in the PL intensity was observed with specific ions namely Zn, Cd, Hg and Ag. Among these four ions, the PL response to Hg and Ag even at sub-micro-molar concentrations was quite high, compared to that of Zn and Cd. It was observed that the change in Pb and S molar ratio has profound effect on the sensitivity of these ions. These results indicate that the sensitivity of these QDs could be fine-tuned by controlling the S concentration at the surface. Contrary to the above, Cu quenched the photoluminescence. In Cd based QDs related ion probing, Hg and Cu was found to have quenching properties, however, our PbS QDs have quenching property only for Cu ions. This was attributed to the formation HgS at the surface that has bandgap higher than PbS. Another interesting property of PbS in PVA observed is photo-brightening mechanism due to the curing of the polymer with laser. However, the presence of excess ions at the surface changes its property to photo-darkening/brightening that depends on the direction of carrier transfer mechanism (from QDs to the surface adsorbed metal ions or vice-versa). which is an interesting feature for metal ion detectivity.

Genetic analysis of foot-and-mouth disease virus serotype A of Indian origin and detection of positive selection and recombination in leader protease- and capsid-coding regions

The leader protease (L-pro) and capsid-coding sequences (P1) constitute approximately 3 kb of the foot-and-mouth disease virus (FMDV). We studied the phylogenetic relationship of 46 FMDV serotype A isolates of Indian origin collected during the period 1968-2005 and also eight vaccine strains using the neighbour-joining tree and Bayesian tree methods. The viruses were categorized under three major groups - Asian, Euro-South American and European. The Indian isolates formed a distinct genetic group among the Asian isolates. The Indian isolates were further classified into different genetic subgroups (<5% divergence). Post-1995 isolates were divided into two subgroups while a few isolates which originated in the year 2005 from Andhra Pradesh formed a separate group. These isolates were closely related to the isolates of the 1970s. The FMDV isolates seem to undergo reverse mutation or onvergent evolution wherein sequences identical to the ancestors are present in the isolates in circulation. The eight vaccine strains included in the study were not related to each other and belonged to different genetic groups. Recombination was detected in the L-pro region in one isolate (A IND 20/82) and in the VP1 coding 1D region in another isolate (A RAJ 21/96). Positive selection was identified at aa positions 23 in the L-pro (P<0.05; 0.046*) and at aa 171 in the capsid protein VP1 (P<0.01; 0.003**).

In quest of a reliable and efficient computational test for detection of isomorphism in kinematic chains

The test based on comparison of the characteristic coefficients of the adjancency matrices of the corresponding graphs for detection of isomorphism in kinematic chains has been shown to fail in the case of two pairs of ten-link, simple-jointed chains, one pair corresponding to single-freedom chains and the other pair corresponding to three-freedom chains. An assessment of the merits and demerits of available methods for detection of isomorphism in graphs and kinematic chains is presented, keeping in view the suitability of the methods for use in computerized structural synthesis of kinematic chains. A new test based on the characteristic coefficients of the “degree” matrix of the corresponding graph is proposed for detection of isomorphism in kinematic chains. The new test is found to be successful in the case of a number of examples of graphs where the test based on characteristic coefficients of adjancency matrix fails. It has also been found to be successful in distinguishing the structures of all known simple-jointed kinematic chains in the categories of (a) single-freedom chains with up to 10 links, (b) two-freedom chains with up to 9 links and (c) three-freedom chains with up to 10 links.