Wireless Sensor Networks (WSNs) often suffer from disrupted connectivity caused by its numerous aspects such as limited battery power of a node and unattended operation vulnerable to hostile tampering. The disruption of connectivity, often referred to as network cut, leads to ill-informed routing decisions, data loss, and waste of energy. A number of protocols have been proposed to efficiently ...

OBJECTIVE One of the many challenges faced by epidemiologists is to adequately plan and optimize subject selection procedures in terms of effectiveness and efficiency. In the context of a case-control study involving severe acute malnutrition, a two-step subject selection procedure is used. The aim of the article is to establish an appropriate cut-off point for the screening phase and to achiev...

Let N be a closed submanifold of a complete smooth Riemannian manifold M and Uν the total space of the unit normal bundle of N . For each v ∈ Uν, let ρ(v) denote the distance from N to the cut point of N on the geodesic γv with the velocity vector γ̇v(0) = v. The continuity of the function ρ on Uν is well known. In this paper we prove that ρ is locally Lipschitz on which ρ is bounded; in particu...

We consider the volumetric cutting plane method for nding a point in a convex set C < n that is characterized by a separation oracle. We prove polynomiality of the algorithm with each added cut placed directly through the current point, and show that this \central cut" version of the method can be implemented using no more than 25n constraints at any time. with support from a CORE fellowship.

INTRODUCTION There has been extensive research on defining the appropriate body mass index (BMI) cut-off point for being overweight and obese in the Asian population since the World Health Organisation (WHO) Expert Consultation Meeting in 2002. MATERIALS AND METHODS We reviewed the literature on the optimal BMI cut-off points for Asian populations. We searched PubMed, EMBASE, National Institu...

We propose a new interior point based method to minimize a linear function of a matrix variable subject to linear equality and inequality constraints over the set of positive semidefinite matrices. We show that the approach is very efficient for graph bisection problems, such as max-cut. Other applications include max-min eigenvalue problems and relaxations for the stable set problem.

In this paper, we consider a special class of wireless networks, called wireless erasure networks. In these networks, each node is connected to a set of nodes by independent erasure channels. The network model incorporates the broadcast nature of the wireless environment in that each node sends out the same signal on its outgoing channels. However, we assume there is no interference in receptio...

SAT filters are a novel and compact data structure that can be used to quickly query a word for membership in a fixed set. They have the potential to store more information in a fixed storage limit than a Bloom filter. Constructing a SAT filter requires sampling diverse solutions to randomly constructed constraint satisfaction instances, but there is flexibility in the choice of constraint sati...

We investigate the succinctness of several kinds of unary automata by studying their state complexity in accepting the family {Lm} of cyclic languages, where Lm = {a | k ∈ N}. In particular, we show that, for any m, the number of states necessary and sufficient for accepting the unary language Lm with isolated cut point on one-way probabilistic finite automata is p1 1 +p α2 2 + · · ·+ps s , wit...