Set It and Forget It: Approximating the Set Once Strip Cover Problem

We consider the Set Once Strip Cover problem, in which n wireless sensors are deployed over a one-dimensional region. Each sensor has a fixed battery that drains in inverse proportion to a radius that can be set just once, but activated at any time. The problem is to find an assignment of radii and activation times that maximizes the length of time during which the entire region is covered. We show that this problem is NP-hard. Second, we show that RoundRobin, the algorithm in which the sensors simply take turns covering the entire region, has a tight approximation guarantee of 3/2 in both Set Once Strip Cover and the more general Strip Cover problem, in which each radius may be set finitely-many times. Moreover, we show that the more general class of duty cycle algorithms, in which groups of sensors take turns covering the entire region, can do no better. Finally, we give an optimal O(n^2 log n)-time algorithm for the related Set Radius Strip Cover problem, in which all sensors must be activated immediately.Comment: briefly announced at SPAA 201

How high frequency trading affects a market index

The relationship between a market index and its constituent stocks is complicated. While an index is a weighted average of its constituent stocks, when the investigated time scale is one day or longer the index has been found to have a stronger effect on the stocks than vice versa. We explore how this interaction changes in short time scales using high frequency data. Using a correlation-based analysis approach, we find that in short time scales stocks have a stronger influence on the index. These findings have implications for high frequency trading and suggest that the price of an index should be published on shorter time scales, as close as possible to those of the actual transaction time scale.We would like to thank Yoash Shapira, Idan Michaeli and Dustin Plotnick for all of their help. DYK and EBJ acknowledge support in part by the Tauber Family Foundation and the Maguy-Glass Chair in Physics of Complex Systems at Tel Aviv University. HES and DYK thank the support of the Office of Naval Research (ONR, Grant N00014-09-1-0380, Grant N00014-12-1-0548), Keck Foundation and the NSF (Grant CMMI 1125290) for support. This work was also supported by the Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center (DoI/NBC) contract number D12PC00285. The U.S. Government is authorized to reproduce and distribute reprints for Governmental purposes notwithstanding any copyright annotation thereon. Disclaimer: The views and conclusions contained herein are those of the authors and should not be interpreted as necessarily representing the official policies or endorsements, either expressed or implied, of IARPA, DoI/NBC, or the U.S. Government. (Tauber Family Foundation; Maguy-Glass Chair in Physics of Complex Systems at Tel Aviv University; N00014-09-1-0380 - Office of Naval Research (ONR); N00014-12-1-0548 - Office of Naval Research (ONR); Keck Foundation; CMMI 1125290 - NSF; D12PC00285 - Intelligence Advanced Research Projects Activity (IARPA) via Department of Interior National Business Center (DoI/NBC))Published versio

Practical uses of genetic profile assessment in athletic training – an illustrative case study

Recent studies suggested that several potential genes may explain athletic success. However, while genetic assessment will probably become part of future talent identification, at present, genetic testing predictive value is poor, mainly because athletic success depends on a combination of genetic, physiological, behavioral and environmental factors (including coaching, medical, nutritional, psychological, equipment, facilities and administrative aspects). However, one should consider genetic testing not only for talent identification or sport event selection, but also for possible assistance in the training process itself. In the present case study we show an example of potential practical use of genetic profile assessment for improving the athletic training process. We deliberately chose a case study of a national-level athlete to show that genetic aid should not be limited to top world-class athletes

Dynamics of Stock Market Correlations

We present a novel approach to the study the dynamics of stock market correlations. This is achieved through an innovative visualization tool that allows an investigation of the structure and dynamics of the market, through the study of correlations. This is based on the Stock Market Holography (SMH) method recently introduced. This qualitative measure is complemented by the use of the eigenvalue entropy measure, to quantify how the information in the market changes in time. Using this innovative approach, we analyzed data from the New York Stock Exchange (NYSE), and the Tel Aviv Stock Exchange (TASE), for daily trading data for the time period of 2000–2009. This paper covers these new concepts for the study of financial markets in terms of structure and information as reflected by the changes in correlations over time.Correlation, Stock Market Holography, eigenvalue entropy, sliding window

DEMOS-2:scalable E2E verifiable elections without random oracles

Recently, Kiayias, Zacharias and Zhang-proposed a new E2E verifiable e-voting system called 'DEMOS' that for the first time provides E2E verifiability without relying on external sources of randomness or the random oracle model; the main advantage of such system is in the fact that election auditors need only the election transcript and the feedback from the voters to pronounce the election process unequivocally valid. Unfortunately, DEMOS comes with a huge performance and storage penalty for the election authority (EA) compared to other e-voting systems such as Helios. The main reason is that due to the way the EA forms the proof of the tally result, it is required to {\em precompute} a number of ciphertexts for each voter and each possible choice of the voter. This approach clearly does not scale to elections that have a complex ballot and voters have an exponential number of ways to vote in the number of candidates. The performance penalty on the EA appears to be intrinsic to the approach: voters cannot compute an enciphered ballot themselves because there seems to be no way for them to prove that it is a valid ciphertext. In contrast to the above, in this work, we construct a new e-voting system that retains the strong E2E characteristics of DEMOS (but against computational adversaries) while completely eliminating the performance and storage penalty of the EA. We achieve this via a new cryptographic construction that has the EA produce and prove, using voters' coins, the security of a common reference string (CRS) that voters subsequently can use to affix non-interactive zero-knowledge (NIZK) proofs to their ciphertexts. The EA itself uses the CRS to prove via a NIZK the tally correctness at the end. Our construction has similar performance to Helios and is practical. The privacy of our construction relies on the SXDH assumption over bilinear groups via complexity leveraging

The use of context for word recognition : a comparison between college dyslexic students, college normal readers, and reading age control group.

EducationDoctor of Education (Ed.D.