Control energy of complex networks towards distinct mixture states

Controlling complex networked systems is a real-world puzzle that remains largely unsolved. Despite recent progress in understanding the structural characteristics of network control energy, target state and system dynamics have not been explored. We examine how varying the final state mixture affects the control energy of canonical and conformity-incorporated dynamical systems. We find that the control energy required to drive a network to an identical final state is lower than that required to arrive a non-identical final state. We also demonstrate that it is easier to achieve full control in a conformity-based dynamical network. Finally we determine the optimal control strategy in terms of the network hierarchical structure. Our work offers a realistic understanding of the control energy within the final state mixture and sheds light on controlling complex systems.This work was funded by The National Natural Science Foundation of China (Grant Nos. 61763013, 61703159, 61403421), The Natural Science Foundation of Jiangxi Province (No. 20171BAB212017), The Measurement and Control of Aircraft at Sea Laboratory (No. FOM2016OF010), and China Scholarship Council (201708360048). The Boston University Center for Polymer Studies is supported by NSF Grants PHY-1505000, CMMI-1125290, and CHE-1213217, and by DTRA Grant HDTRA1-14-1-0017. (61763013 - National Natural Science Foundation of China; 61703159 - National Natural Science Foundation of China; 61403421 - National Natural Science Foundation of China; 20171BAB212017 - Natural Science Foundation of Jiangxi Province; FOM2016OF010 - Measurement and Control of Aircraft at Sea Laboratory; 201708360048 - China Scholarship Council; PHY-1505000 - NSF; CMMI-1125290 - NSF; CHE-1213217 - NSF; HDTRA1-14-1-0017 - DTRA)Published versio

Networked control system – an overview

Networked Control System (NCS) is fetching researchers’ interest from many decades. It’s been used in industry which range from manufacturing, automobile, aviation, aerospace to military. This paper gives the general architecture of NCS and its fundamental routes. It also touches to its advantages and disadvantages and some of the popular controller which include PID (Proportional-Integral-Derivative) and MPC (Model Predictive Control)

A Stochastic Hybrid Framework for Driver Behavior Modeling Based on Hierarchical Dirichlet Process

Scalability is one of the major issues for real-world Vehicle-to-Vehicle network realization. To tackle this challenge, a stochastic hybrid modeling framework based on a non-parametric Bayesian inference method, i.e., hierarchical Dirichlet process (HDP), is investigated in this paper. This framework is able to jointly model driver/vehicle behavior through forecasting the vehicle dynamical time-series. This modeling framework could be merged with the notion of model-based information networking, which is recently proposed in the vehicular literature, to overcome the scalability challenges in dense vehicular networks via broadcasting the behavioral models instead of raw information dissemination. This modeling approach has been applied on several scenarios from the realistic Safety Pilot Model Deployment (SPMD) driving data set and the results show a higher performance of this model in comparison with the zero-hold method as the baseline.Comment: This is the accepted version of the paper in 2018 IEEE 88th Vehicular Technology Conference (VTC2018-Fall) (references added, title and abstract modified

Self-repairing Homomorphic Codes for Distributed Storage Systems

Erasure codes provide a storage efficient alternative to replication based redundancy in (networked) storage systems. They however entail high communication overhead for maintenance, when some of the encoded fragments are lost and need to be replenished. Such overheads arise from the fundamental need to recreate (or keep separately) first a copy of the whole object before any individual encoded fragment can be generated and replenished. There has been recently intense interest to explore alternatives, most prominent ones being regenerating codes (RGC) and hierarchical codes (HC). We propose as an alternative a new family of codes to improve the maintenance process, which we call self-repairing codes (SRC), with the following salient features: (a) encoded fragments can be repaired directly from other subsets of encoded fragments without having to reconstruct first the original data, ensuring that (b) a fragment is repaired from a fixed number of encoded fragments, the number depending only on how many encoded blocks are missing and independent of which specific blocks are missing. These properties allow for not only low communication overhead to recreate a missing fragment, but also independent reconstruction of different missing fragments in parallel, possibly in different parts of the network. We analyze the static resilience of SRCs with respect to traditional erasure codes, and observe that SRCs incur marginally larger storage overhead in order to achieve the aforementioned properties. The salient SRC properties naturally translate to low communication overheads for reconstruction of lost fragments, and allow reconstruction with lower latency by facilitating repairs in parallel. These desirable properties make self-repairing codes a good and practical candidate for networked distributed storage systems