Carbon based materials for low temperature detection

Resistance temperature detectors (RTDs) are being widely used to detect low temperature, while thermocouples (TCs) are being used to detect high temperature. The materials suitable for RTDs are platinum, germanium, carbon, carbon-glass, cernox, etc. Here, we have reported the possible application of another form of carbon i.e. carbon nanotubes in low temperature thermometry. It has been shown the resistance R and the sensitivity of carbon nanotube bundles can be tuned and made suitable for ultralow temperature detection. We report on the R-T measurement of carbon nanotube bundles from room temperature down to 1 K to felicitate the possible application of bundles in low temperature RTDs. ©2008 American Institute of Physics

Antigen detection assay with parasite specific monoclonal antibodies for diagnosis of lymphatic filariasis

Background: Lymphatic filariasis is a painful and profoundly disfiguring disease. Infection is usually acquired in childhood but its visible manifestations occur later in life, causing temporary or permanent disability. The importance of developing effective assays to diagnose, monitor and evaluate human lymphatic filariasis has been emphasized by the WHO. Methods: High-affinity monoclonal antibodies (mAbs) specific for recombinant filarial antigen WbSXP-1 were developed. An ELISA based capture assay using monoclonal and polyclonal antibodies for WbSXP-1 was used for detection of circulating filarial antigen. Results: High-affinity monoclonal antibodies (mAbs) were developed that specifically binds both W. bancrofti and B. malayi mf antigens. Two mAbs (1F6H3 and 2E12E3) of subclass IgG2a and IgM showed high affinity, avidity and reactivity to recombinant and mf native antigen. Both the mAbs were used in combination as capture antibodies and polyclonal as detection antibody to develop the assay. The assay showed very high sensitivity towards W. bancrofti mf positive samples compared to endemic normal samples (P<0.0001). Conclusion: A capture assay using high-affinity monoclonal antibodies for WbSXP-1 was developed for the detection of filarial circulating antigen in clinical samples from bancroftian infection. Besides, this would also help in epidemiological studies in endemic areas of filarial infections. (C) 2011 Elsevier B.V. All rights reserved.

CUSUM Based Distributed Detection in WSNs

We are concerned with the situation in which a wireless sensor network is deployed in a region, for the purpose of detecting an event occurring at a random time and at a random location. The sensor nodes periodically sample their environment (e.g., for acoustic energy),process the observations (in our case, using a CUSUM-based algorithm) and send a local decision (which is binary in nature) to the fusion centre. The fusion centre collects these local decisions and uses a fusion rule to process the sensors’ local decisions and infer the state of nature, i.e., if an event has occurred or not. Our main contribution is in analyzing two local detection rules in combination with a simple fusion rule. The local detection algorithms are based on the nonparametric CUSUMprocedure from sequential statistics. We also propose two ways to operate the local detectors after an alarm. These alternatives when combined in various ways yield several approaches. Our contribution is to provide analytical techniques to calculate false alarm measures, by the use of which the local detector thresholds can be set. Simulation results are provided to evaluate the accuracy of our analysis. As an illustration we provide a design example. We also use simulations to compare the detection delays incurred in these algorithms.

Optimal Sleep-Wake Scheduling for Quickest Intrusion Detection using wireless sensor Networks

We consider the problem of quickest detection of an intrusion using a sensor network, keeping only a minimal number of sensors active. By using a minimal number of sensor devices,we ensure that the energy expenditure for sensing, computation and communication is minimized (and the lifetime of the network is maximized). We model the intrusion detection (or change detection) problem as a Markov decision process (MDP). Based on the theory of MDP, we develop the following closed loop sleep/wake scheduling algorithms: 1) optimal control of Mk+1, the number of sensors in the wake state in time slot k + 1, 2) optimal control of qk+1, the probability of a sensor in the wake state in time slot k + 1, and an open loop sleep/wake scheduling algorithm which 3) computes q, the optimal probability of a sensor in the wake state (which does not vary with time),based on the sensor observations obtained until time slot k.Our results show that an optimum closed loop control onMk+1 significantly decreases the cost compared to keeping any number of sensors active all the time. Also, among the three algorithms described, we observe that the total cost is minimum for the optimum control on Mk+1 and is maximum for the optimum open loop control on q.

Fast edge splitting and Edmonds' arborescence construction for unweighted graphs

Given an unweighted undirected or directed graph with n vertices, m edges and edge connectivity c, we present a new deterministic algorithm for edge splitting. Our algorithm splits-off any specified subset S of vertices satisfying standard conditions (even degree for the undirected case and in-degree ≥ out-degree for the directed case) while maintaining connectivity c for vertices outside S in Õ(m+nc2) time for an undirected graph and Õ(mc) time for a directed graph. This improves the current best deterministic time bounds due to Gabow [8], who splits-off a single vertex in Õ(nc2+m) time for an undirected graph and Õ(mc) time for a directed graph. Further, for appropriate ranges of n, c, |S| it improves the current best randomized bounds due to Benczúr and Karger [2], who split-off a single vertex in an undirected graph in Õ(n2) Monte Carlo time. We give two applications of our edge splitting algorithms. Our first application is a sub-quadratic (in n) algorithm to construct Edmonds' arborescences. A classical result of Edmonds [5] shows that an unweighted directed graph with c edge-disjoint paths from any particular vertex r to every other vertex has exactly c edge-disjoint arborescences rooted at r. For a c edge connected unweighted undirected graph, the same theorem holds on the digraph obtained by replacing each undirected edge by two directed edges, one in each direction. The current fastest construction of these arborescences by Gabow [7] takes Õ(n2c2) time. Our algorithm takes Õ(nc3+m) time for the undirected case and Õ(nc4+mc) time for the directed case. The second application of our splitting algorithm is a new Steiner edge connectivity algorithm for undirected graphs which matches the best known bound of Õ(nc2 + m) time due to Bhalgat et al [3]. Finally, our algorithm can also be viewed as an alternative proof for existential edge splitting theorems due to Lovász [9] and Mader [11].

Mathematical Analysis of Sensor Fusion for Intrusion Detection Systems

Fusion of multiple intrusion detection systems results in a more reliable and accurate detection for a wider class of intrusions. The paper presented here introduces the mathematical basis for sensor fusion and provides enough support for the acceptability of sensor fusion in performance enhancement of intrusion detection systems. The sensor fusion system is characterized and modeled with no knowledge of the intrusion detection systems and the intrusion detection data. The theoretical analysis is supported with an experimental illustration with three of the available intrusion detection systems using the DARPA 1999 evaluation data set.