{"title":"Augmented Index and Quantum Streaming Algorithms for DYCK(2)","authors":"A. Nayak, D. Touchette","doi":"10.4230/LIPIcs.CCC.2017.23","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2017.23","url":null,"abstract":"We show how two recently developed quantum information theoretic tools can be applied to obtain lower bounds on quantum information complexity. We also develop new tools with potential for broader applicability, and use them to establish a lower bound on the quantum information complexity for the Augmented Index function on an easy distribution. This approach allows us to handle superpositions rather than distributions over inputs, the main technical challenge faced previously. By providing a quantum generalization of the argument of Jain and Nayak [IEEE TIT'14], we leverage this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the DYCK(2) language.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132848074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Xiaoyun Liu, Chunshi Fan, Ziyang Meng, Xiaochu Wang, N. Zhang
{"title":"Consensus-based quaternion estimation for aggregated spacecraft system with multiple sensors","authors":"Xiaoyun Liu, Chunshi Fan, Ziyang Meng, Xiaochu Wang, N. Zhang","doi":"10.1109/CHICC.2016.7554668","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7554668","url":null,"abstract":"In this paper, we consider the consensus-based quaternion estimation problem of aggregated spacecraft with multiple sensors. It is known that the quaternion has an inherent unit-norm constraint and a subtle ambiguity since the mapping from the rotation matrix to the quaternion is two-to-one. These facts imply that the updates for the quaternion should be multiplicative instead of additive and make it nontrivial to extend the classical Kalman consensus filter (based on the additive update) for quaternion estimation problem. In order to solve this problem, we propose a novel multiplicative quaternion Kalman consensus filter (MQK-CF) in this paper. We compare the proposed MQK-CF with an additive consensus-based quaternion filter. It turns out that the additive consensus-based quaternion filter suffers from erroneous fusion of datum due to its sensitivity to numerical errors. The validity of the proposed multiplicative quaternion Kalman consensus filter is verified by numerical simulations for a static attitude estimation scenario.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131274755","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Research and application of process industry alarm management system","authors":"Xuejun Zong, Mingming Zhang, Kan He","doi":"10.1109/CHICC.2016.7553768","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7553768","url":null,"abstract":"In this paper, starting from the present problems of the alarm system, designed an alarm management system based on standard EEMUA by using matter element analysis is combined with fuzzy clustering method to deal with alarm data. In combination with the actual industrial field data, this method has been used to rationalize the alarm, the alarm rate is significantly reduced, and the real-time and effectiveness of this method is proved.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130381226","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"From Weak to Strong LP Gaps for All CSPs","authors":"Mrinalkanti Ghosh, Madhur Tulsiani","doi":"10.4230/LIPIcs.CCC.2017.11","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2017.11","url":null,"abstract":"We study the approximability of constraint satisfaction problems (CSPs) by linear programming (LP) relaxations. We show that for every CSP, the approximation obtained by a basic LP relaxation, is no weaker than the approximation obtained using relaxations given by $Omegaleft(frac{log n}{log log n}right)$ levels of the Sherali-Adams hierarchy on instances of size $n$. \u0000It was proved by Chan et al. [FOCS 2013] that any polynomial size LP extended formulation is no stronger than relaxations obtained by a super-constant levels of the Sherali-Adams hierarchy.. Combining this with our result also implies that any polynomial size LP extended formulation is no stronger than the basic LP. \u0000Using our techniques, we also simplify and strengthen the result by Khot et al. [STOC 2014] on (strong) approximation resistance for LPs. They provided a necessary and sufficient condition under which $Omega(log log n)$ levels of the Sherali-Adams hierarchy cannot achieve an approximation better than a random assignment. We simplify their proof and strengthen the bound to $Omegaleft(frac{log n}{log log n}right)$ levels.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"19 21","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121006345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BOF steelmaking endpoint real-time recognition based on flame multi-scale color difference histogram features weighted fusion method","authors":"Hui Liu, Qiaoshun Wu, Bin Wang, Xin Xiong","doi":"10.1109/CHICC.2016.7553922","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7553922","url":null,"abstract":"BOF (Basic Oxygen Furnace, BOF) steelmaking endpoint prediction is one of the most important steps in the blowing process. The flame recognition has proven as a useful method for endpoint prediction. But the previous methods are not suitable to extract the flame characteristic because of flame randomness and multi-scales problems. A multi-scale color difference histogram features weighted fusion method is proposed to describe the flame changes during the blowing process. The segmented images are converted into the L*a*b* space; the color difference histogram is built based on the defined calculation model and the features are calculated to describe the histogram; in order to fuse multi scales characteristics as a whole feature vector and contains each scale features in a reasonable level, a multi-scale features weighted function is defined; finally, the GRNN (General Regression Neural Network, GRNN) recognition model is built to realize the blowing stage prediction according to the flame features. The experimental and comparisons results show that the proposed method has a better recognition rate and high calculation speed, and have a bright practical value in the BOF endpoint control.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115570653","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Vulnerability analysis and critical components identification of Power Networks under cascading failures","authors":"Shuliang Wang, Jianhua Zhang, Liangzhi Gan","doi":"10.1109/CHICC.2016.7554390","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7554390","url":null,"abstract":"Power network safety has become an important subject in safety science because power networks are basic support to modern infrastructures. This paper takes Central China Power Network (CCPN) as an example to study vulnerability and identify critical components under cascading failures induced by both node overload breakdowns and edge overload failures. As for cascading failures induced by edge overload failures, testing the response of power networks, it is concluded that the effect of different attack for network performance has close relation with the tolerate parameter and the adjustable parameter, and power networks have the best performance when the adjustable parameter equal 1 for different tolerate parameter. Meanwhile, we also find that key elements are those with high load and connections. As for cascading failures induced by node overload breakdowns, it has the similar results. Our findings will be helpful to protect the key elements to avoid cascading failure induced disasters, and they may be useful in furthering study of designing critical infrastructure systems.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128359471","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A global line extraction algorithm for indoor robot mapping based on noise eliminating via similar triangles rule","authors":"Ming Jian, Cui-fang Zhang, Fei Yan, Monica Tang","doi":"10.1109/CHICC.2016.7554319","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7554319","url":null,"abstract":"Robot mapping from 2D laser rangefinder data is critical to indoor autonomous mobile localization and navigation. On the basis of Split algorithm, this paper presents a similar triangles rule, which is used to quantify the random characteristics of the space position of noise points. The direction of the real line is acquired by using the statistical method to analyze the quantified data, and the noise points can be eliminated based on the actual line direction as much as possible. Finally, we split the points after denoising again and then fit lines by least square method in each two adjacent split points. Experiments show that, compared with the conventional Split-and-Merge algorithm, the proposed technique performs better on both accuracy and correctness. The process of line segments merging is avoided, and the precision and robustness of environment modeling are enhanced in the proposed algorithm.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121417901","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Stabilization of linear systems via state-dependent intermittent control","authors":"Qingzhi Wang, Yong He, Guanzheng Tan, Min Wu","doi":"10.1109/CHICC.2016.7553312","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7553312","url":null,"abstract":"This paper mainly addresses the stabilization issue of linear systems via state-dependent intermittent control. Based on the concept of intermittent control, we initially propose the description of a state-dependent intermittent controller. Then, in this kind of framework, a state-dependent intermittent controller is designed to stabilize the given system by Lyapunov function method. It is worth pointing out that, compared with a continuous controller, the designed state-dependent intermittent controller is capable of shortening control task execution time while still retaining satisfactory performances or even realizing the better effects. Thirdly, to avoid the occurrence of chattering, the description of a state-dependent intermittent controller is further improved and a nicer stabilization criterion is provided. Finally, illustrative simulation examples are given to show the validity and superiority of the developed results.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126521779","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Networked iterative learning control for linear-time-invariant systems with random packet losses","authors":"Jian Liu, Xiaoe Ruan","doi":"10.1109/CHICC.2016.7553057","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7553057","url":null,"abstract":"This paper develops two proportional-type networked iterative learning control (NILC) schemes for a class of linear-time-invariant systems with stochastic packet dropout being subject to Bernoulli-type distribution. In the NILC schemes, we consider two types of compensation algorithms for dropped data: one of which is to replace the dropped data by that of the successfully captured at the concurrent sampling moment of the latest iteration, and the other is to utilize the desired output at the concurrent sampling moment to compensate for the missed data. In terms of the proposed NILC schemes, sufficient conditions for convergence are derived in the sense of expectation. Numerical experiments illustrate the effectiveness of the NILC schemes.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115232010","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimize motion energy of AUV based on LQR control strategy","authors":"Shi-Lei Wang, Hongzhang Jin, Li Meng, Guicang Li","doi":"10.1109/CHICC.2016.7554068","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7554068","url":null,"abstract":"When AUV moves near the sea surface, it always affected by surface wave disturbances and torques, and its resistance increases more heavily than calm water resistance. Because of carried energy of AUV is always limited, it is urgent to minimize the resistance caused by the AUV motion so as to diminish the energy consumption. On the traditional motion control strategy of AUV, most investigation focus on minimizing the pitch angle and heave motion, and ignoring the influence of the added resistance. In this paper a control method is proposed based on establishing longitudinal resistance model, combines the pitching angle, heaving displacement, driving energy with added resistance of AUV as its integrated indicators. In order to obtain the stabilized position and decrease the energy consumption, a LQR controller is designed with optimizing parameters by using the genetic algorithm. As a result, not only the pitch angle of the AUV and heave motion are decreased, but also the resistance caused by the pitch motion. Simulation analysis verifies the correctness of the dynamic resistance model and proposed control method.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126157603","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}