Efficient Probabilistic Group Testing Based on Traitor Tracing

Inspired by recent results from collusion-resistant traitor tracing, we provide a framework for constructing efficient probabilistic group testing schemes. In the traditional group testing model, our scheme asymptotically requires T ~ 2 K ln N tests to find (with high probability) the correct set of K defectives out of N items. The framework is also applied to several noisy group testing and threshold group testing models, often leading to improvements over previously known results, but we emphasize that this framework can be applied to other variants of the classical model as well, both in adaptive and in non-adaptive settings.Comment: 8 pages, 3 figures, 1 tabl

An exact solution method for binary equilibrium problems with compensation and the power market uplift problem

We propose a novel method to find Nash equilibria in games with binary decision variables by including compensation payments and incentive-compatibility constraints from non-cooperative game theory directly into an optimization framework in lieu of using first order conditions of a linearization, or relaxation of integrality conditions. The reformulation offers a new approach to obtain and interpret dual variables to binary constraints using the benefit or loss from deviation rather than marginal relaxations. The method endogenizes the trade-off between overall (societal) efficiency and compensation payments necessary to align incentives of individual players. We provide existence results and conditions under which this problem can be solved as a mixed-binary linear program. We apply the solution approach to a stylized nodal power-market equilibrium problem with binary on-off decisions. This illustrative example shows that our approach yields an exact solution to the binary Nash game with compensation. We compare different implementations of actual market rules within our model, in particular constraints ensuring non-negative profits (no-loss rule) and restrictions on the compensation payments to non-dispatched generators. We discuss the resulting equilibria in terms of overall welfare, efficiency, and allocational equity

Optimal Nested Test Plan for Combinatorial Quantitative Group Testing

We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the population. Under the quantitative group testing model, the result of each test reveals the number of defective items in the tested group. The minimum number of tests achievable by nested test plans was established by Aigner and Schughart in 1985 within a minimax framework. The optimal nested test plan offering this performance, however, was not obtained. In this work, we establish the optimal nested test plan in closed form. This optimal nested test plan is also order optimal among all test plans as the population size approaches infinity. Using heavy-hitter detection as a case study, we show via simulation examples orders of magnitude improvement of the group testing approach over two prevailing sampling-based approaches in detection accuracy and counter consumption. Other applications include anomaly detection and wideband spectrum sensing in cognitive radio systems

Managed information gathering and fusion for transient transport problems

This paper deals with vehicular traffic management by communication technologies from Traffic Control Center point of view in road networks. The global goal is to manage the urban traffic by road traffic operations, controlling and interventional possibilities in order to minimize the traffic delays and stops and to improve traffic safety on the roads. This paper focuses on transient transport, when the controlling management is crucial. The aim was to detect the beginning time of the transient traffic on the roads, to gather the most appropriate data and to get reliable information for interventional suggestions. More reliable information can be created by information fusion, several fusion techniques are expounded in this paper. A half-automatic solution with Decision Support System has been developed to help with engineers in suggestions of interventions based on real time traffic data. The information fusion has benefits for Decision Support System: the complementary sensors may fill the gaps of one another, the system is able to detect the changing of the percentage of different vehicle types in traffic. An example of detection and interventional suggestion about transient traffic on transport networks of a little town is presented at the end of the paper. The novelty of this paper is the gathering of information - triggered by the state changing from stationer to transient - from ad hoc channels and combining them with information from developed regular channels. --information gathering,information fusion,Kalman filter,transient traffic,Decision Support System

Stabilization of Networked Control Systems with Sparse Observer-Controller Networks

In this paper we provide a set of stability conditions for linear time-invariant networked control systems with arbitrary topology, using a Lyapunov direct approach. We then use these stability conditions to provide a novel low-complexity algorithm for the design of a sparse observer-based control network. We employ distributed observers by employing the output of other nodes to improve the stability of each observer dynamics. To avoid unbounded growth of controller and observer gains, we impose bounds on their norms. The effects of relaxation of these bounds is discussed when trying to find the complete decentralization conditions