The problem of quickest anomaly detection in networks with unlabeled samples is studied. At some unknown time, an emerges the network and changes data-generating distribution sensor. data vector received by fusion center at each time step undergoes arbitrary permutation its entries (unlabeled samples). goal to detect minimal delay subject false alarm constraints. With samples, existing approach...

Given a set P of n point sites in the plane, the city Voronoi diagram subdivides the plane into the Voronoi regions of the sites, with respect to the city metric. This metric is induced by quickest paths according to the Manhattan metric and an accelerating transportation network that consists of c non-intersecting axis-parallel line segments. We describe an algorithm that constructs the city V...

ABSTRACT A program is developed that includes two hydrodynamic models, a 2D depth-averaged (2DH) and a Quasi-3D (Q3D), and a pollutant transport model that uses a 1 order upwinding and a 3 order QUICKEST numerical schemes. Several tests were performed in two test basins in order to examine the performance of the above models. The Q3D model is successfully applied to Lake Ontario, using a 4-km-s...

Consider the motion of a Brownian particle in two or more dimensions, whose coordinate processes are standard motions with zero drift initially, and then at some random/unobservable time, one gets (known) nonzero permanently. Given that position is being observed real problem to detect time which process as accurately possible. We solve this most uncertain scenario when (i) exponentially distri...

Online detection of changes in stochastic systems, referred to as sequential change or quickest detection, is an important research topic statistics, signal processing, and information theory, has a wide range applications. This survey starts with the basics then moves on generalizations extensions theory methods. We also discuss some new dimensions that emerge at intersection other areas, alon...

Klinz and Woeginger (1995) prove that the minimum cost quickest flow problem is NP-hard. On other hand, can be solved efficiently via a straightforward reduction to without costs. More generally, we show how transshipment reduced solvable problem, thus adding another mosaic tile rich complexity landscape of flows over time.

Sequential attack detection in a distributed sensor network is considered, where each successively produces one-bit quantized samples of desired deterministic scalar parameter corrupted by additive noise. The unknown parameters the pre-attack and post-attack models, namely to be estimated injected malicious data at attacked sensors pose significant challenge for designing computationally effici...