Cybersecurity and Cyberforensics Conference最新文献_第5页

A new hand shape positioning algorithm based on Voronoi diagram 一种新的基于Voronoi图的手形定位算法

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7553996

Shenghua Wang, Fu Liu, Huiying Liu, Shoukun Jiang

引用次数: 1

Real-time image-based driver fatigue detection and monitoring system for monitoring driver vigilance 基于实时图像的驾驶员疲劳检测与监控系统，用于监控驾驶员警惕性

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7554007

Xinxing Tang, Pengfei Zhou, Ping Wang

{"title":"Real-time image-based driver fatigue detection and monitoring system for monitoring driver vigilance","authors":"Xinxing Tang, Pengfei Zhou, Ping Wang","doi":"10.1109/CHICC.2016.7554007","DOIUrl":"https://doi.org/10.1109/CHICC.2016.7554007","url":null,"abstract":"In order to realize automatic on-line monitoring of driver fatigue state, an automatic driver fatigue state early warning system based on vision on-line real time detection is established by analyzing driver's eye and mouth states. Firstly, this system use VJ detector algorithm to detect the face, and then in the face region of interest (FROI), MB-LBP feature is used to find the eye region and locate eyes' area rapidly and accurately in the upper FROI. Then Kalman filter algorithm is adopted to track the eyes and mouth. After this feature enhancement and ellipse fitting for human eye image is adopted after the edge points of human eyes, and a threshold is set to match mouth feature such as open, close and yawning, which is used judging the mouth state. Finally, the threshold is set to determine the human eye state by calculating the ratio between short axis and the long axis of the ellipse. Experimental results indicate that the method used can detect the position and states of human eye and mouth accurately and rapidly in the case of different angle and shielding rotation, and the detection rate is higher than 95%. The established driver fatigue warning system can meet the real-time requirement of the driver fatigue state detection.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"80 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":"121052641","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}

引用次数: 7

Adaptive tracking control of a class of linear systems with constrained actuators 一类具有约束作动器的线性系统的自适应跟踪控制

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7553070

Xiaozheng Jin, Jiahu Qin, Yu Kang

引用次数: 0

Orbital flatness of a class of single-input control systems 一类单输入控制系统的轨道平坦度

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7553187

Shunjie Li, Chao Xu

引用次数: 0

Tracking control for a class of random Lagrange systems with colored noise 一类带有色噪声的随机拉格朗日系统的跟踪控制

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7553357

Mingyue Cui, Shitong Wang, Liangchao Geng

引用次数: 4

An experiment and research platform for DC micro-grid 直流微电网实验研究平台

Cybersecurity and Cyberforensics Conference Pub Date : 2016-07-27 DOI: 10.1109/CHICC.2016.7554727

Xiaofeng Lin, Yanhong Xue, Chunning Song, Shaojian Song, Liu Bin

引用次数: 4

New Hardness Results for Graph and Hypergraph Colorings 图和超图着色的新硬度结果

Cybersecurity and Cyberforensics Conference Pub Date : 2016-05-29 DOI: 10.4230/LIPIcs.CCC.2016.14

Joshua Brakensiek, V. Guruswami

{"title":"New Hardness Results for Graph and Hypergraph Colorings","authors":"Joshua Brakensiek, V. Guruswami","doi":"10.4230/LIPIcs.CCC.2016.14","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2016.14","url":null,"abstract":"Finding a proper coloring of a t-colorable graph G with t colors is a classic NP-hard problem when t ≥ 3. In this work, we investigate the approximate coloring problem in which the objective is to find a proper c-coloring of G where c ≥ t. We show that for all t ≥ 3, it is NP-hard to find a c-coloring when c ≤ 2t - 2. In the regime where t is small, this improves, via a unified approach, the previously best known hardness result of c ≤ max{2t - 5, t + 2⌊t/3⌋ - 1} [9, 21, 13]. For example, we show that 6-coloring a 4-colorable graph is NP-hard, improving on the NP-hardness of 5-coloring a 4-colorable graph. \u0000 \u0000We also generalize this to related problems on the strong coloring of hypergraphs. A k-uniform hypergraph H is t-strong colorable (where t ≥ k) if there is a t-coloring of the vertices such that no two vertices in each hyperedge of H have the same color. We show that if t = ⌈3k/2⌉, then it is NP-hard to find a 2-coloring of the vertices of H such that no hyperedge is monochromatic. We conjecture that a similar hardness holds for t = k + 1. \u0000 \u0000We establish the NP-hardness of these problems by reducing from the hardness of the Label Cover problem, via a \"dictatorship test\" gadget graph. By combinatorially classifying all possible colorings of this graph, we can infer labels to provide to the label cover problem. This approach generalizes the \"weak polymorphism\" framework of [3], though interestingly our results are \"PCP-free\" in that they do not require any approximation gap in the starting Label Cover instance.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128610825","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}

引用次数: 43

Tight Bounds for Communication-Assisted Agreement Distillation 通信辅助协议蒸馏的紧密边界

Cybersecurity and Cyberforensics Conference Pub Date : 2016-05-29 DOI: 10.4230/LIPIcs.CCC.2016.6

V. Guruswami, J. Radhakrishnan

{"title":"Tight Bounds for Communication-Assisted Agreement Distillation","authors":"V. Guruswami, J. Radhakrishnan","doi":"10.4230/LIPIcs.CCC.2016.6","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2016.6","url":null,"abstract":"Suppose Alice holds a uniformly random string X ∈ {0, 1}N and Bob holds a noisy version Y of X where each bit of X is flipped independently with probability e ∈ [0, 1/2]. Alice and Bob would like to extract a common random string of min-entropy at least k. In this work, we establish the communication versus success probability trade-off for this problem by giving a protocol and a matching lower bound (under the restriction that the string to be agreed upon is determined by Alice's input X). Specifically, we prove that in order for Alice and Bob to agree on a common string with probability 2-γk (γk ≥ 1), the optimal communication (up to o(k) terms, and achievable for large N) is precisely [EQUATION], where C:= 4e(1 - e). In particular, the optimal communication to achieve Ω(1) agreement probability approaches 4e(1 - e)k. \u0000 \u0000We also consider the case when Y is the output of the binary erasure channel on X, where each bit of Y equals the corresponding bit of X with probability 1 - e and is otherwise erased (that is, replaced by a '?'). In this case, the communication required becomes [EQUATION]. In particular, the optimal communication to achieve Ω(1) agreement probability approaches ek, and with no communication the optimal agreement probability approaches [EQUATION]. \u0000 \u0000Our protocols are based on covering codes and extend the approach of (Bogdanov and Mossel, 2011) for the zero-communication case. Our lower bounds rely on hypercontractive inequalities. For the model of bit-flips, our argument extends the approach of (Bogdanov and Mossel, 2011) by allowing communication; for the erasure model, to the best of our knowledge the needed hypercontractivity statement was not studied before, and it was established (given our application) by (Nair and Wang 2015). We also obtain information complexity lower bounds for these tasks, and together with our protocol, they shed light on the recently popular \"most informative Boolean function\" conjecture of Courtade and Kumar.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122406200","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}

引用次数: 14

Tight SoS-Degree Bounds for Approximate Nash Equilibria 近似纳什均衡的紧sos度界

Cybersecurity and Cyberforensics Conference Pub Date : 2016-05-29 DOI: 10.4230/LIPIcs.CCC.2016.22

A. Harrow, Anand Natarajan, Xiaodi Wu

{"title":"Tight SoS-Degree Bounds for Approximate Nash Equilibria","authors":"A. Harrow, Anand Natarajan, Xiaodi Wu","doi":"10.4230/LIPIcs.CCC.2016.22","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2016.22","url":null,"abstract":"Nash equilibria always exist, but are widely conjectured to require time to find that is exponential in the number of strategies, even for two-player games. By contrast, a simple quasi-polynomial time algorithm, due to Lipton, Markakis and Mehta (LMM), can find approximate Nash equilibria, in which no player can improve their utility by more than e by changing their strategy. The LMM algorithm can also be used to find an approximate Nash equilibrium with near-maximal total welfare. Matching hardness results for this optimization problem were found assuming the hardness of the planted-clique problem (by Hazan and Krauthgamer) and assuming the Exponential Time Hypothesis (by Braverman, Ko and Weinstein). \u0000 \u0000In this paper we consider the application of the sum-squares (SoS) algorithm from convex optimization to the problem of optimizing over Nash equilibria. We show the first unconditional lower bounds on the number of levels of SoS needed to achieve a constant factor approximation to this problem. While it may seem that Nash equilibria do not naturally lend themselves to convex optimization, we also describe a simple LP (linear programming) hierarchy that can find an approximate Nash equilibrium in time comparable to that of the LMM algorithm, although neither algorithm is obviously a generalization of the other. This LP can be viewed as arising from the SoS algorithm at log n levels -- matching our lower bounds. The lower bounds involve a modification of the Braverman-Ko-Weinstein embedding of CSPs into strategic games and techniques from sum-of-squares proof systems. The upper bound (i.e. analysis of the LP) uses information-theory techniques that have been recently applied to other linear- and semidefinite-programming hierarchies.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"56 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116638731","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}

引用次数: 4

Evolution and Computation (Invited Talk) 进化与计算(特邀演讲)

Cybersecurity and Cyberforensics Conference Pub Date : 2016-05-29 DOI: 10.4230/LIPIcs.CCC.2016.21

Nisheeth K. Vishnoi

引用次数: 0