Related papers: Bit flipping and time to recover
In this paper, we consider the problem of attack-resilient state estimation, that is to reliably estimate the true system states despite two classes of attacks: (i) attacks on the switching mechanisms and (ii) false data injection attacks…
Coin-flipping is a fundamental task in two-party cryptography where two remote mistrustful parties wish to generate a shared uniformly random bit. While quantum protocols promising near-perfect security exist for weak coin-flipping -- when…
We develop a computation model for solving Boolean networks that implements wires through quantum ground-state computation and implements gates through identities following from angular momentum algebra and statistics. The gates are static…
A realistic continuous-time dynamics for fiber bundles is introduced and studied both analytically and numerically. The equation of motion reproduces known stationary-state results in the deterministic limit while the system under…
Entangled systems in experiments may be lost or offline in distributed quantum information processing. This inspires a general problem to characterize quantum operations which result in breaking of entanglement or not. Our goal in this work…
This paper studies the resilient control of networked systems in the presence of cyber attacks. In particular, we consider the state feedback stabilization problem for nonlinear systems when the state measurement is sent to the controller…
We present BIEBER (Byte-IdEntical Binary parsER), the first system to model and regenerate a full working parser from instrumented program executions. To achieve this, BIEBER exploits the regularity (e.g., header fields and array-like data…
To effectively test parts of the Internet of Things (IoT) systems with a state machine character, Model-based Testing (MBT) approach can be taken. In MBT, a system model is created, and test cases are generated automatically from the model,…
We discuss the cases where local decoherence selectively degrades one type of entanglement more than other types. A typical case is called state ordering change, in which two input states with different amounts of entanglement undergoes a…
Random selection, leader election, and collective coin flipping are fundamental tasks in fault-tolerant distributed computing. We study these problems in the full-information model where despite decades of study, key gaps remain in our…
We study the phase transition in a class of fiber bundle models in which the fiber strengths are distributed randomly within a finite interval and global load sharing is assumed. The dynamics is expressed as recursion relations for the…
A partially parallel dynamical noisy binary choice (Ising) game in discrete time of $N$ players on complete graphs with $k$ players having a possibility of changing their strategies at each time moment called $k$-flip Ising game is…
Algorithms, data structures, coding techniques, and other methods that reduce bit-flips are being sought to best utilize hardware where flipping bits is the dominating cost. Write efficient memories were introduced by Ahlswede and Zhang as…
We investigate a type of bistability where noise not only causes transitions between stable states, but also constructs the states themselves. We focus on the experimentally well-studied system of ants choosing between two food sources to…
Stochastic point processes with refractoriness appear frequently in the quantitative analysis of physical and biological systems, such as the generation of action potentials by nerve cells, the release and reuptake of vesicles at a synapse,…
Robustness is a measure of functional reliability of a system against perturbations. To achieve a good and robust performance, a system must filter out external perturbations by its internal priors. These priors are usually distilled in the…
Experiments are conducted in a two-dimensional mono-layer vibrofluidized bed of glass beads, with a goal to understand the transition scenario and the underlying microstructure and dynamics in different patterned-states. At small shaking…
We study two-dimensional Ising spins, evolving through reinforcement learning using their state, action, and reward. The state of a spin is defined as whether it is in the majority or minority with its nearest neighbours. The spin updates…
We study the states of one and two atoms in a rotating ring lattice in a Hubbard type tight-binding model. The model is developed carefully from basic principles in order to properly identify the physical observables. The one-particle…
The frog model is an interacting particle system on a graph. Active particles perform independent simple random walks, while sleeping particles remain inert until visited by an active particle. Some number of sleeping particles are placed…