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.

In the dominion of artefacts

Evolutionary biology is above all concerned with the way life on earth and its setting change over time. The problem posed by Daily and Ehrlich, of how humans, the myriads of organisms that humans carry around in their bodies and the stage on which they interact have been changing over time, may then be viewed as one of the concerns of this discipline.

In the dominion of artefacts

Evolutionary biology is above all concerned with the way life on earth and its setting change over time. The problem posed by Daily and Ehrlich, of how humans, the myriads of organisms that humans carry around in their bodies and the stage on which they interact have been changing over time, may then be viewed as one of the concerns of this discipline.

A Phase Transition for the Uniform Distribution in the Pattern Maximum Likelihood Problem

In this paper, we consider the setting of the pattern maximum likelihood (PML) problem studied by Orlitsky et al. We present a well-motivated heuristic algorithm for deciding the question of when the PML distribution of a given pattern is uniform. The algorithm is based on the concept of a ``uniform threshold''. This is a threshold at which the uniform distribution exhibits an interesting phase transition in the PML problem, going from being a local maximum to being a local minimum.

Imprints of Archean to Neoproterozoic crustal processes in the Madurai Block, Southern India

Madurai Block, the largest crustal block in the Southern Granulite Terrane (SGT) of Peninsular India, preserves the imprints of multistage tectonic evolution. Here, we present U-Pb and Hf isotope data on zircons from a charnockite-granite suite in the north-western part of this block. The oscillatory zoning, and the LREE to HREE enriched patterns of the zircons with positive Ce and negative Eu anomalies suggest that the zircon cores are of magmatic origin, with ages in the range of 2634-2435 Ma implying Neoarchean-Paleoproterozoic magmatism followed by subsequent metamorphism and protocontinent formation in the north-western part of the Madurai Block. A regional 550-500 Ma metamorphic overprint is also preserved in the zircons coinciding with the final amalgamation of the Gondwana supercontinent. The Hf isotopic data suggest that the granite and charnockite were derived from isotopically heterogeneous juvenile crustal domains and the charnockites show a significant contribution of mantle-derived components. Therefore, the Hf isotopic data reflect mixing of crustal and mantle-derived sources for the generation of Neoarchean crust in the north-western Madurai Block, possibly in a suprasubduction zone setting during continent building processes. (c) 2014 Elsevier Ltd. All rights reserved.

On the Communication Complexity of Secret Key Generation in the Multiterminal Source Model

Communication complexity refers to the minimum rate of public communication required for generating a maximal-rate secret key (SK) in the multiterminal source model of Csiszar and Narayan. Tyagi recently characterized this communication complexity for a two-terminal system. We extend the ideas in Tyagi's work to derive a lower bound on communication complexity in the general multiterminal setting. In the important special case of the complete graph pairwise independent network (PIN) model, our bound allows us to determine the exact linear communication complexity, i.e., the communication complexity when the communication and SK are restricted to be linear functions of the randomness available at the terminals.