We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and non–zero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP–hard. In addition, we examine transmissions along a single path, ...

This paper presents experimental results associated with the human factors aspects of using color contours to visualize electric power system bus voltage magnitude information. Participants were divided into three groups: the first group only one-line numeric data, the second only one-line contour data, while the third saw both. The purpose of the experiment was to determine how quickly partici...

Flows over time (also called dynamic flows) generalize standard network flows by introducing an element of time. They naturally model problems where travel and transmission are not instantaneous. Traditionally, flows over time are solved in time-expanded networks that contain one copy of the original network for each discrete time step. While this method makes available the whole algorithmic to...

Rapid detection of spatial events that propagate across a sensor network is wide interest in many modern applications. In particular, communications, radar, IoT, environmental monitoring, and biosurveillance, we may observe propagating fields or particles. this paper, propose Bayesian sequential single multiple change-point procedures for the rapid such phenomena. Using dynamic programming fram...

A decentralized formulation of the quickest change detection problem is studied, where the distributions of the observations at all of the sensors in the system change at the time of disruption, and the sensors communicate with a common fusion center. A Bayesian setting is considered in which a priori knowledge of the change time distribution is available. The observations are assumed to be ind...

The problem of detecting changes in the statistical properties of a stochastic system and time series arises in various branches of science and engineering. It has a wide spectrum of important applications ranging from machine monitoring to biomedical signal processing. In all of these applications the observations being monitored undergo a change in distribution in response to a change or anom...

We consider a finite difference scheme, called Quickest, introduced by Leonard in 1979, for the convection-diffusion equation. Quickest uses an explicit, Leith-type differencing and third-order upwinding on the convective derivatives yielding a four-point scheme. For that reason the method requires careful treatment on the inflow boundary considering the fact that we need to introduce numerical...

We examine the problem of transmitting in minimum time a given amount of data between a source and a destination in a network with finite channel capacities and nonzero propagation delays. In the absence of delays, the problem has been shown to be solvable in polynomial time. In this paper, we show that the general problem is NP-complete. In addition, we examine transmissions along a single pat...