Cybersecurity and Cyberforensics Conference最新文献

{"title":"Identifying an Honest EXP^NP Oracle Among Many","authors":"Shuichi Hirahara","doi":"10.4230/LIPIcs.CCC.2015.244","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.244","url":null,"abstract":"We provide a general framework to remove short advice by formulating the following computational task for a function f : given two oracles at least one of which is honest (i.e. correctly computes f on all inputs) as well as an input, the task is to compute f on the input with the help of the oracles by a probabilistic polynomial-time machine, which we shall call a selector. We characterize the languages for which short advice can be removed by the notion of selector: a paddable language has a selector if and only if short advice of a probabilistic machine that accepts the language can be removed under any relativized world. \u0000 \u0000Previously, instance checkers have served as a useful tool to remove short advice of probabilistic computation. We indicate that existence of instance checkers is a property stronger than that of removing short advice: although no instance checker for EXPNP-complete languages exists unless EXPNP = NEXP, we prove that there exists a selector for any EXPNP-complete language, by building on the proof of MIP = NEXP by Babai, Fortnow, and Lund (1991).","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127180421","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":"Non-Commutative Formulas and Frege Lower Bounds: a New Characterization of Propositional Proofs","authors":"Fu Li, Iddo Tzameret, Zhengyu Wang","doi":"10.4230/LIPIcs.CCC.2015.412","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.412","url":null,"abstract":"Does every Boolean tautology have a short propositional-calculus proof? Here, a propositional-calculus (i.e. Frege) proof is any proof starting from a set of axioms and deriving new Boolean formulas using a fixed set of sound derivation rules. Establishing any super-polynomial size lower bound on Frege proofs (in terms of the size of the formula proved) is a major open problem in proof complexity, and among a handful of fundamental hardness questions in complexity theory by and large. Non-commutative arithmetic formulas, on the other hand, constitute a quite weak computational model, for which exponential-size lower bounds were shown already back in 1991 by Nisan [20], using a particularly transparent argument. \u0000 \u0000In this work we show that Frege lower bounds in fact follow from corresponding size lower bounds on non-commutative formulas computing certain polynomials (and that such lower bounds on non-commutative formulas must exist, unless NP=coNP). More precisely, we demonstrate a natural association between tautologies T to non-commutative polynomials p, such that: \u0000 \u0000•if T has a polynomial-size Frege proof then p has a polynomial-size non-commutative arithmetic formula; and conversely, when T is a DNF, if p has a polynomial-size non-commutative arithmetic formula over GF(2) then T has a Frege proof of quasi-polynomial size. \u0000 \u0000The argument is a characterization of Frege proofs as non-commutative formulas: we show that the Frege system is (quasi-) polynomially equivalent to a non-commutative Ideal Proof System(IPS), following the recent work of Grochow and Pitassi [10] that introduced a propositional proof system in which proofs are arithmetic circuits, and the work in [35] that considered adding the commutator as an axiom in algebraic propositional proof systems. This gives a characterization of propositional Frege proofs in terms of (non-commutative) arithmetic formulas that is tighter than (the formula version of IPS) in Grochow and Pitassi [10], in the following sense: \u0000 \u0000(i) The non-commutative IPS is polynomial-time checkable -- whereas the original IPS was checkable in probabilistic polynomial-time; and \u0000 \u0000(ii) Frege proofs unconditionally quasi-polynomially simulate the non-commutative IPS -- whereas Frege was shown to efficiently simulate IPS only assuming that the decidability of PIT for (commutative) arithmetic formulas by polynomial-size circuits is efficiently provable in Frege.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115730161","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":"Parallel repetition for entangled k-player games via fast quantum search","authors":"Xiaodi Wu, Kai-Min Chung, H. Yuen","doi":"10.4230/LIPIcs.CCC.2015.512","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.512","url":null,"abstract":"We present two parallel repetition theorems for the entangled value of multi-player, one-round free games (games where the inputs come from a product distribution). Our first theorem shows that for a k-player free game G with entangled value val* (G) = 1 - e, the n-fold repetition of G has entangled value val* (G⊗n) at most (1 - e3/2)Ω(n/sk4), where s is the answer length of any player. In contrast, the best known parallel repetition theorem for the classical value of two-player free games is val(G⊗n) ≤ (1 - e2)Ω(n/s), due to Barak, et al. (RANDOM 2009). This suggests the possibility of a separation between the behavior of entangled and classical free games under parallel repetition. \u0000 \u0000Our second theorem handles the broader class of free games G where the players can output (possibly entangled) quantum states. For such games, the repeated entangled value is upper bounded by (1 - e2)Ω(n/sk2). We also show that the dependence of the exponent on k is necessary: we exhibit a k-player free game G and n ≥ 1 such that val*(G⊗n) ≥ val*(G)n/k. \u0000 \u0000Our analysis exploits the novel connection between communication protocols and quantum parallel repetition, first explored by Chailloux and Scarpa (ICALP 2014). We demonstrate that better communication protocols yield better parallel repetition theorems: in particular, our first theorem crucially uses a quantum search protocol by Aaronson and Ambainis, which gives a quadratic Grover speed-up for distributed search problems. Finally, our results apply to a broader class of games than were previously considered before; in particular, we obtain the first parallel repetition theorem for entangled games involving more than two players, and for games involving quantum outputs.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126789000","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":"Majority is Incompressible by AC^0[p] Circuits","authors":"I. Oliveira, R. Santhanam","doi":"10.4230/LIPIcs.CCC.2015.124","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.124","url":null,"abstract":"We consider C-compression games, a hybrid model between computational and communication complexity. A C-compression game for a function f : {0,1}n → {0,1} is a two-party communication game, where the first party Alice knows the entire input x but is restricted to use strategies computed by C-circuits, while the second party Bob initially has no information about the input, but is computationally unbounded. The parties implement an interactive communication protocol to decide the value of f (x), and the communication cost of the protocol is the maximum number of bits sent by Alice as a function of n = |x|. \u0000 \u0000We show that any AC0d[p]-compression protocol to compute Majorityn requires communication n/(log n)2d+O(1), where p is prime, and AC0d[p] denotes polynomial size unbounded fan-in depth-d Boolean circuits extended with modulo p gates. This bound is essentially optimal, and settles a question of Chattopadhyay and Santhanam (2012). This result has a number of consequences, and yields a tight lower bound on the total fan-in of oracle gates in constant-depth oracle circuits computing Majorityn. \u0000 \u0000We define multiparty compression games, where Alice interacts in parallel with a polynomial number of players that are not allowed to communicate with each other, and communication cost is defined as the sum of the lengths of the longest messages sent by Alice during each round. In this setting, we prove that the randomized r-round AC0[p]-compression cost of Majorityn is nΘ(1/r). This result implies almost tight lower bounds on the maximum individual fan-in of oracle gates in certain restricted bounded-depth oracle circuits computing Majorityn. Stronger lower bounds for functions in NP would separate NP from NC1. \u0000 \u0000Finally, we consider the round separation question for two-party AC0-compression games, and significantly improve known separations between r -round and (r + 1)-round protocols, for any constant r.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129531222","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 Characterization of Hard-to-cover CSPs","authors":"Amey Bhangale, P. Harsha, G. Varma","doi":"10.4230/LIPIcs.CCC.2015.280","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.280","url":null,"abstract":"We continue the study of covering complexity of constraint satisfaction problems (CSPs) initiated by Guruswami, Hastad and Sudan [9] and Dinur and Kol [7]. The covering number of a CSP instance Φ, denoted by ν (Φ) is the smallest number of assignments to the variables of Φ, such that each constraint of Φ is satisfied by at least one of the assignments. We show the following results regarding how well efficient algorithms can approximate the covering number of a given CSP instance. \u0000 \u00001. Assuming a covering unique games conjecture, introduced by Dinur and Kol, we show that for every non-odd predicate P over any constant sized alphabet and every integer K, it is NP-hard to distinguish between P-CSP instances (i.e., CSP instances where all the constraints are of type P) which are coverable by a constant number of assignments and those whose covering number is at least K. Previously, Dinur and Kol, using the same covering unique games conjecture, had shown a similar hardness result for every non-odd predicate over the Boolean alphabet that supports a pairwise independent distribution. Our generalization yields a complete characterization of CSPs over constant sized alphabet Σ that are hard to cover since CSPs over odd predicates are trivially coverable with |Σ| assignments. \u0000 \u00002. For a large class of predicates that are contained in the 2k-LIN predicate, we show that it is quasi-NP-hard to distinguish between instances which have covering number at most two and covering number at least Ω(log log n). This generalizes the 4-LIN result of Dinur and Kol that states it is quasi-NP-hard to distinguish between 4-LIN-CSP instances which have covering number at most two and covering number at least Ω(log log log n).","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114431977","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":"An Entropy Sumset Inequality and Polynomially Fast Convergence to Shannon Capacity Over All Alphabets","authors":"V. Guruswami, A. Velingker","doi":"10.4230/LIPIcs.CCC.2015.42","DOIUrl":"https://doi.org/10.4230/LIPIcs.CCC.2015.42","url":null,"abstract":"We prove a lower estimate on the increase in entropy when two copies of a conditional random variable X|Y, with X supported on Zq = {0,1,..., q − 1} for prime q, are summed modulo q. Specifically, given two i.i.d. copies (X1, Y1) and (X2, Y2) of a pair of random variables (X, Y), with X taking values in Zq, we show \u0000 \u0000H(X1 + X2 | Y1, Y2) - H(X|Y ) ≥ α(q) · H(X|Y)(1 - H(X|Y)) \u0000 \u0000for some α(q) > 0, where H (·) is the normalized (by factor log2q) entropy. In particular, if X|Y is not close to being fully random or fully deterministic and H(X|Y) ∈ (γ, 1-γ), then the entropy of the sum increases by Ωq (γ). Our motivation is an effective analysis of the finite-length behavior of polar codes, for which the linear dependence on γ is quantitatively important. The assumption of q being prime is necessary: for X supported uniformly on a proper subgroup of Zq we have H(X + X) = H(X). For X supported on infinite groups without a finite subgroup (the torsion-free case) and no conditioning, a sumset inequality for the absolute increase in (unnormalized) entropy was shown by Tao in [20]. \u0000 \u0000We use our sumset inequality to analyze Arikan's construction of polar codes and prove that for any q-ary source X, where q is any fixed prime, and any e > 0, polar codes allow efficient data compression of N i.i.d. copies of X into (H(X) + e)N q-ary symbols, as soon as N is polynomially large in 1/e. We can get capacity-achieving source codes with similar guarantees for composite alphabets, by factoring q into primes and combining different polar codes for each prime in factorization. \u0000 \u0000A consequence of our result for noisy channel coding is that for all discrete memoryless channels, there are explicit codes enabling reliable communication within e > 0 of the symmetric Shannon capacity for a block length and decoding complexity bounded by a polynomial in 1/e. The result was previously shown for the special case of binary-input channels [7, 9], and this work extends the result to channels over any alphabet.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127932542","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":"Estimate of finite-time domain of attraction for a class of nonlinear Hamiltonian systems with time delay","authors":"Renming Yang, Yuzhen Wang, Hairong Xiao, Fuguang Yang","doi":"10.1109/CHICC.2014.6897039","DOIUrl":"https://doi.org/10.1109/CHICC.2014.6897039","url":null,"abstract":"","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130538120","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":"Swing control of helicopter sling load by using command smoothing technique","authors":"Haining Wang, Jie Huang","doi":"10.1109/CHICC.2014.6896335","DOIUrl":"https://doi.org/10.1109/CHICC.2014.6896335","url":null,"abstract":"Motion-induced oscillations of helicopter sling load seriously degrade their effectiveness and safety. The modeling and dynamics of helicopter sling load are derived. A novel control scheme is designed for reducing the payload swing. Simulations of a large range of motions and various system parameters are used to analyze the dynamic behavior and the robustness of the control scheme. Experimental results obtained from a model helicopter sling load validate the simulated dynamic behavior and the effectiveness of the control scheme.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127755508","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 non-destructive estimation method for the soluble solids content of apples","authors":"Zixiao Guan, Lingguo Cui, Wenqian Huang, Baihai Zhang, S. Chai","doi":"10.1109/CHICC.2014.6896095","DOIUrl":"https://doi.org/10.1109/CHICC.2014.6896095","url":null,"abstract":"As a non-destructive measurement method, the near-infrared spectroscopy (NIRS) has been widely employed in the agriculture field for estimating soluble solids content (SSC) of the fruit, which is a key parameter for consumers. A rapid and non-destructive estimation method is proposed in this work to measure the SSC of apples by using NIRS. A modified genetic algorithm (GA) is used for the systematic optimization of characteristic wavelengths. Multiple linear regression (MLR) is also adopted to find the coefficient vector. In order to evaluate the performance of the algorithm, numerical simulation and practical implement have been carried out. The results which based on low standard error of prediction (LSEP) and relatively high ratio to prediction (RPD) have shown the effectiveness and efficiency of the proposed method.","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128990303","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":"MLP compensated pd power-level control for modulator high temperature gas-cooled reactors","authors":"Z. Dong","doi":"10.1109/CHICC.2014.6896142","DOIUrl":"https://doi.org/10.1109/CHICC.2014.6896142","url":null,"abstract":"","PeriodicalId":246506,"journal":{"name":"Cybersecurity and Cyberforensics Conference","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114661732","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}