检索结果-内蒙古大学图书馆

Secure quantum communication in the presence of phase- and polarization-dependent loss

学校读者我要写书评

暂无评论

arXiv 2018年

作者： Li, Chenyang Curty, Marcos Xu, Feihu Bedroya, Olinka Lo, Hoi-Kwong Center for Quantum Information and Quantum Control Department of Electrical & Computer Engineering Department of Physics University of Toronto TorontoONM5S 3G4 Canada Escuela de Ingeniería de Telecomunicación Department of Signal Theory and Communications University of Vigo VigoE-36310 Spain Shanghai Branch Hefei National Laboratory for Physical Sciences at the Microscale University of Science and Technology of China Shanghai201315 China

Silicon photonics holds the promise of the miniaturization of quantum communication devices. Recently, silicon chip optical transmitters for quantum key distribution (QKD) have been built and demonstrated experimentally. Nonetheless, these silicon chips suffer substantial phase- and polarization-dependent loss (PDL) which, if unchecked, could compromise the security of QKD systems because of overestimating the secret key rate. Here, we first restore the security by regarding the single photons without phase and polarization dependence as untagged and secure qubits. Next, by using a post-selection technique, one could implement a secure QKD protocol that provides a high key generation rate even in the presence of severe phase and polarization dependent loss. Our solution is simple to realize in a practical experiment as it does not require any hardware modification. Copyright © 2018, The Authors. All rights reserved.

关键词： Quantum cryptography

Where Does AlphaGo Go: From Church-Turing Thesis to AlphaGo Thesis and Beyond

学校读者我要写书评

暂无评论

IEEE/CAA Journal of Automatica Sinica 2016年第2期3卷 113-120页

作者： Fei-Yue Wang Jun Jason Zhang Xinhu Zheng Xiao Wang Yong Yuan Xiaoxiao Dai Jie Zhang Liuqing Yang IEEE the State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences (SKL-MCCS CASIA) Research Center of Computational Experiments and Parallel Systems The National University of Defense Technology the Department of Electrical and Computer Engineering Ritchie School of Engineering and Computer Science University of Denver the Department of Computer Science and Engineering University of Minnesota the Qingdao Academy of Intelligent Industries (QAII) Qingdao Shandong China and SKL-MCCS CASIA the Department of Electrical and Computer Engineering Colorado State University

An investigation on the impact and significance of the AlphaGo vs. Lee Sedol Go match is conducted, and concludes with a conjecture of the AlphaGo Thesis and its extension in accordance with the Church-Turing Thesis in the history of computing. It is postulated that the architecture and method utilized by the AlphaGo program provide an engineering solution for tackling issues in complexity and intelligence. Specifically, the AlphaGo Thesis implies that any effective procedure for hard decision problems such as NP-hard can be implemented with AlphaGo-like approach. Deep rule-based networks are proposed in attempt to establish an understandable structure for deep neural networks in deep learning. The success of AlphaGo and corresponding thesis ensure the technical soundness of the parallel intelligence approach for intelligent control and management of complex systems and knowledge automation. © 2014 Chinese Association of Automation.

关键词： Religious buildings

A distributed dynamic programming-based solution for load management in smart grids

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Zhang, Wei Xu, Yinliang Li, Sisi Zhou, MengChu Liu, Wenxin Xu, Ying Department of Electrical Engineering Harbin Institute of Technology Harbin150001 China Sun Yat-sen University Carnegie Mellon University Joint Institute of Engineering Sun Yat-Sen University Guangzhou510275 China Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States Department of Electrical and Computer Engineering New Jersey Institute of Technology NewarkNJ07102-1982 United States Department of Electrical and Computer Engineering King Abdulaziz University Jeddah Saudi Arabia Department of Electrical and Computer Engineering Lehigh University BethlehemPA18015 United States Power Dispatch and Control Center North China Branch of State Grid Corporation Beijing100053 China

—Load management is being recognized as an important ption for active user participation in the energy market. Traditional oad management methods usually require a centralized powerful ontrol center and a two-way communication network between he system operators and energy end-users. The increasing user articipation in smart grids may limit their applications. In this aper, a distributed solution for load management in emerging smart rids is proposed. The load management problem is formulated as a onstrained optimization problem aiming at maximizing the overall tility of users while meeting the requirement for load reduction equested by the system operator, and is solved by using a distributed ynamic programming algorithm. The algorithm is implemented ia a distributed framework and thus can deliver a highly desired istributed solution. It avoids the required use of a centralized oordinator or control center, and can achieve satisfactory outcomes or load management. Simulation results with various test systems emonstrate its effectiveness. Copyright © 2017, The Authors. All rights reserved.

关键词： Electric load management

Dynamics over signed networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Shi, Guodong Altafini, Claudio Baras, John S. Australian Center for Field Robotics School of Aerospace Mechanical and Mechatronic Engineering University of Sydney NSW Australia Division of Automatic Control Department of Electrical Engineering Linköping University LinköpingSE-58183 Sweden Institute for Systems Research Department of Electrical and Computer Engineering University of Maryland College ParkMD20742 United States

A signed network is a network with each link associated with a positive or negative sign. Models for nodes interacting over such signed networks, where two different types of interactions take place along the positive and negative links, respectively, arise from various biological, social, political, and economic systems. As modifications to the conventional DeGroot dynamics for positive links, two basic types of negative interactions along negative links, namely the opposing rule and the repelling rule, have been proposed and studied in the literature. This paper reviews a few fundamental convergence results for such dynamics over deterministic or random signed networks under a unified algebraic-graphical method. We show that a systematic tool of studying node state evolution over signed networks can be obtained utilizing generalized Perron-Frobenius theory, graph theory, and elementary algebraic recursions. Copyright © 2017, The Authors. All rights reserved.

关键词： Algebra

Learning policies for Markov decision processes from data

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Hanawal, Manjesh K. Liu, Hao Zhu, Henghui Paschalidis, Ioannis Ch. Industrial Engineering and Operations Research IIT-Bombay PowaiMH 400076 India Center for Information and Systems Engineering Boston University BostonMA02215 United States College of Control Science and Engineering Zhejiang University Hangzhou Zhejiang310027 China Department of Electrical and Computer Engineering Division of Systems Engineering Boston University BostonMA02215 United States

We consider the problem of learning a policy for a Markov decision process consistent with data captured on the state-actions pairs followed by the policy. We assume that the policy belongs to a class of parameterized policies which are defined using features associated with the state-action pairs. The features are known a priori, however, only an unknown subset of them could be relevant. The policy parameters that correspond to an observed target policy are recovered using `1-regularized logistic regression that best fits the observed state-action samples. We establish bounds on the difference between the average reward of the estimated and the original policy (regret) in terms of the generalization error and the ergodic coefficient of the underlying Markov chain. To that end, we combine sample complexity theory and sensitivity analysis of the stationary distribution of Markov chains. Our analysis suggests that to achieve regret within order O(√Ε), it suffices to use training sample size on the order of Ω(log n · poly(1/Ε)), where n is the number of the features. We demonstrate the effectiveness of our method on a synthetic robot navigation example.90C40 (Primary) 90C39, 93E35, 60J10 (Secondary) Copyright © 2017, The Authors. All rights reserved.

关键词： Markov processes

On stabilization and output tracking of a class of nonlinear systems via new backstepping-like methods

学校读者我要写书评

暂无评论

On stabilization and output tracking of a class of nonlinear...

IEEE Annual Conference on Decision and control

作者： M. Bahraini M.J. Yazdanpanah School of Electrical and Computer Engineering’ University of Tehran Tehran I. R. Iran Control & Intelligent Processing Center of Excellence University of Tehran Tehran I. R. Iran

In this article, controller design for a class of nonlinear systems is considered. The strict feedback form is a special case of this class and the proposed method is an extension to the backstepping method. In general form, the proposed method suggests a dynamical controller which has one state less than the system. However, the controller order is not fixed and it may be less than the general form. In a special case, the proposed controller reduces into a static function which is the original backstepping method. The proposed method can be used for stabilization and output tracking for this class which may be quite complicated or even impossible with regular methods. The proposed control strategy is based on the stability of the augmented states. In case that the assumption does not hold, another strategy is suggested to be used for stabilization.

关键词： Backstepping Robustness Mechanical systems Couplings Nonlinear systems

REAP: An efficient incentive mechanism for reconciling aggregation accuracy and individual privacy in crowdsensing

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Zhang, Zhikun He, Shibo Chen, Jiming Zhang, Junshan State Key Laboratory of Industrial Control Technology Zhejiang University Cyber Innovation Joint Research Center Hangzhou China School of Electrical Computer and Energy Engineering Arizona State University United States

Incentive mechanism plays a critical role in privacy aware crowdsensing. Most previous studies on co-design of incentive mechanism and privacy preservation assume a trustworthy fusion center (FC). Very recent work has taken steps to relax the assumption on trustworthy FC and allows participatory users (PUs) to add well calibrated noise to their raw sensing data before reporting them, whereas the focus is on the equilibrium behavior of data subjects with binary data. Making a paradigm shift, this paper aim to quantify the privacy compensation for continuous data sensing while allowing FC to directly control PUs. There are two conflicting objectives in such scenario: FC desires better quality data in order to achieve higher aggregation accuracy whereas PUs prefer adding larger noise for higher privacy preserving levels (PPLs). To achieve a good balance therein, we design an efficient incentive mechanism to REconcile FC's Aggregation accuracy and individual PU's data Privacy (REAP). Specifically, we adopt the celebrated notion of differential privacy to measure PUs' PPLs and quantify their impacts on FC's aggregation accuracy. Then, appealing to Contract Theory, we design an incentive mechanism to maximize FC's aggregation accuracy under a given budget. The proposed incentive mechanism offers different contracts to PUs with different privacy preferences, by which FC can directly control PUs. It can further overcome the information asymmetry, i.e., the FC typically does not know each PU's precise privacy preference. We derive closed-form solutions for the optimal contracts in both complete information and incomplete information scenarios. Further, the results are generalized to the continuous case where PUs' privacy preferences take values in a continuous domain. Extensive simulations are provided to validate the feasibility and advantages of our proposed incentive mechanism. Copyright © 2017, The Authors. All rights reserved.

关键词： Budget control

Non-linear feature extraction from HRV signal for mortality prediction of ICU cardiovascular patient

学校读者我要写书评

暂无评论

Journal of Medical engineering and Technology 2016年第3期40卷 87-98页

作者： Moridani, Mohammad Karimi Setarehdan, Seyed Kamaledin Motie Nasrabadi, Ali Hajinasrollah, Esmaeil Department of Biomedical Engineering Science and Research Branch Islamic Azad University Tehran Iran Control and Intelligent Processing Centre of Excellence School of Electrical and Computer Engineering College of Engineering University of Tehran Tehran Iran Departments of Biomedical Engineering Shahed University Tehran Iran Loghman Medical Center Shahid Beheshti University of Medical Sciences Tehran Iran

Intensive care unit (ICU) patients are at risk of in-ICU morbidities and mortality, making specific systems for identifying at-risk patients a necessity for improving clinical care. This study presents a new method for predicting in-hospital mortality using heart rate variability (HRV) collected from the times of a patients ICU stay. In this paper, a HRV time series processing based method is proposed for mortality prediction of ICU cardiovascular patients. HRV signals were obtained measuring R-R time intervals. A novel method, named return map, is then developed that reveals useful information from the HRV time series. This study also proposed several features that can be extracted from the return map, including the angle between two vectors, the area of triangles formed by successive points, shortest distance to 45° line and their various combinations. Finally, a thresholding technique is proposed to extract the risk period and to predict mortality. The data used to evaluate the proposed algorithm obtained from 80 cardiovascular ICU patients, from the first 48 h of the first ICU stay of 40 males and 40 females. This study showed that the angle feature has on average a sensitivity of 87.5% (with 12 false alarms), the area feature has on average a sensitivity of 89.58% (with 10 false alarms), the shortest distance feature has on average a sensitivity of 85.42% (with 14 false alarms) and, finally, the combined feature has on average a sensitivity of 92.71% (with seven false alarms). The results showed that the last half an hour before the patients death is very informative for diagnosing the patients condition and to save his/her life. These results confirm that it is possible to predict mortality based on the features introduced in this paper, relying on the variations of the HRV dynamic characteristics. © 2016 Taylor & Francis.

关键词： Forecasting

On the dynamics of deterministic epidemic propagation over networks

学校读者我要写书评

暂无评论

arXiv 2017年

作者： Mei, Wenjun Mohagheghi, Shadi Zampieri, Sandro Bullo, Francesco Department of Mechanical Engineering and Center for Control Dynamical Systems and Computation University of California Santa Barbara Santa BarbaraCA93106 United States Department of Electrical and Computer Engineering University of California at Santa Barbara Santa BarbaraCA93106 United States Department of Information Engineering University of Padova Italy

In this work we review a class of deterministic nonlinear models for the propagation of infectious diseases over contact networks with strongly-connected topologies. We consider network models for susceptible-infected (SI), susceptible-infected-susceptible (SIS), and susceptible-infected-recovered (SIR) settings. In each setting, we provide a comprehensive nonlinear analysis of equilibria, stability properties, convergence, monotonicity, positivity, and threshold conditions. For the network SI setting, specific contributions include establishing its equilibria, stability, and positivity properties. For the network SIS setting, we review a well-known deterministic model, provide novel results on the computation and characterization of the endemic state (when the system is above the epidemic threshold), and present alternative proofs for some of its properties. Finally, for the network SIR setting, we propose novel results for transient behavior, threshold conditions, stability properties, and asymptotic convergence. These results are analogous to those well-known for the scalar case. In addition, we provide a novel iterative algorithm to compute the asymptotic state of the network SIR system. Copyright © 2017, The Authors. All rights reserved.

关键词： Nonlinear dynamical systems