On Robustness in the Gap Metric and Coprime Factor Uncertainty for LTV Systems

In this paper, we study the problem of robust stabilization for linear time-varying (LTV) systems subject to time-varying normalized coprime factor uncertainty. Operator theoretic results which generalize similar results known to hold for linear time-invariant (infinite-dimensional) systems are developed. In particular, we compute an upper bound for the maximal achievable stability margin under TV normalized coprime factor uncertainty in terms of the norm of an operator with a time-varying Hankel structure. We point to a necessary and sufficient condition which guarantees compactness of the TV Hankel operator, and in which case singular values and vectors can be used to compute the time-varying stability margin and TV controller. A connection between robust stabilization for LTV systems and an Operator Corona Theorem is also pointed out.Comment: 20 page

Combating False Reports for Secure Networked Control in Smart Grid via Trustiness Evaluation

Smart grid, equipped with modern communication infrastructures, is subject to possible cyber attacks. Particularly, false report attacks which replace the sensor reports with fraud ones may cause the instability of the whole power grid or even result in a large area blackout. In this paper, a trustiness system is introduced to the controller, who computes the trustiness of different sensors by comparing its prediction, obtained from Kalman filtering, on the system state with the reports from sensor. The trustiness mechanism is discussed and analyzed for the Linear Quadratic Regulation (LQR) controller. Numerical simulations show that the trustiness system can effectively combat the cyber attacks to smart grid.Comment: It has been submitted to IEEE International Conference on Communications (ICC

A recursive approach for geometric quantifiers of quantum correlations in multiqubit Schr\"odinger cat states

A recursive approach to determine the Hilbert-Schmidt measure of pairwise quantum discord in a special class of symmetric states of $k$ qubits is presented. We especially focus on the reduced states of $k$ qubits obtained from a balanced superposition of symmetric $n$-qubit states (multiqubit Schr\"odinger cat states) by tracing out $n-k$ particles $(k=2,3, \cdots ,n-1)$. Two pairing schemes are considered. In the first one, the geometric discord measuring the correlation between one qubit and the party grouping $(k-1)$ qubits is explicitly derived. This uses recursive relations between the Fano-Bloch correlation matrices associated with subsystems comprising $k$, $k-1$, $\cdots$ and $2$ particles. A detailed analysis is given for two, three and four qubit systems. In the second scheme, the subsystem comprising the $(k-1)$ qubits is mapped into a system of two logical qubits. We show that these two bipartition schemes are equivalents in evaluating the pairwise correlation in multi-qubits systems. The explicit expressions of classical states presenting zero discord are derived.Comment: 26 page

Generalized Instantly Decodable Network Coding for Relay-Assisted Networks

In this paper, we investigate the problem of minimizing the frame completion delay for Instantly Decodable Network Coding (IDNC) in relay-assisted wireless multicast networks. We first propose a packet recovery algorithm in the single relay topology which employs generalized IDNC instead of strict IDNC previously proposed in the literature for the same relay-assisted topology. This use of generalized IDNC is supported by showing that it is a super-set of the strict IDNC scheme, and thus can generate coding combinations that are at least as efficient as strict IDNC in reducing the average completion delay. We then extend our study to the multiple relay topology and propose a joint generalized IDNC and relay selection algorithm. This proposed algorithm benefits from the reception diversity of the multiple relays to further reduce the average completion delay in the network. Simulation results show that our proposed solutions achieve much better performance compared to previous solutions in the literature.Comment: 5 pages, IEEE PIMRC 201