Power laws, Pareto distributions and Zipf's law

When the probability of measuring a particular value of some quantity varies inversely as a power of that value, the quantity is said to follow a power law, also known variously as Zipf's law or the Pareto distribution. Power laws appear widely in physics, biology, earth and planetary sciences, economics and finance, computer science, demography and the social sciences. For instance, the distributions of the sizes of cities, earthquakes, solar flares, moon craters, wars and people's personal fortunes all appear to follow power laws. The origin of power-law behaviour has been a topic of debate in the scientific community for more than a century. Here we review some of the empirical evidence for the existence of power-law forms and the theories proposed to explain them.Comment: 28 pages, 16 figures, minor corrections and additions in this versio

Deep Random based Key Exchange protocol resisting unlimited MITM

We present a protocol enabling two legitimate partners sharing an initial secret to mutually authenticate and to exchange an encryption session key. The opponent is an active Man In The Middle (MITM) with unlimited computation and storage capacities. The resistance to unlimited MITM is obtained through the combined use of Deep Random secrecy, formerly introduced and proved as unconditionally secure against passive opponent for key exchange, and universal hashing techniques. We prove the resistance to MITM interception attacks, and show that (i) upon successful completion, the protocol leaks no residual information about the current value of the shared secret to the opponent, and (ii) that any unsuccessful completion is detectable by the legitimate partners. We also discuss implementation techniques.Comment: 14 pages. V2: Updated reminder in the formalism of Deep Random assumption. arXiv admin note: text overlap with arXiv:1611.01683, arXiv:1507.0825

Shannon entropies of atomic structure factors, off-diagonal order and electron correlation

Shannon entropies of one- and two-electron atomic structure factors in the position and momentum representations are used to examine the behavior of the off-diagonal elements of density matrices with respect to the uncertainty principle and to analyze the effects of electron correlation on off-diagonal order. We show that electron correlation induces off-diagonal order in position space which is characterized by larger entropic values. Electron correlation in momentum space is characterized by smaller entropic values as information is forced into regions closer to the diagonal. Related off-diagonal correlation functions are also discussed

A note on entropic uncertainty relations of position and momentum

We consider two entropic uncertainty relations of position and momentum recently discussed in literature. By a suitable rescaling of one of them, we obtain a smooth interpolation of both for high-resolution and low-resolution measurements respectively. Because our interpolation has never been mentioned in literature before, we propose it as a candidate for an improved entropic uncertainty relation of position and momentum. Up to now, the author has neither been able to falsify nor prove the new inequality. In our opinion it is a challenge to do either one.Comment: 2 pages, 2 figures, 2 references adde

Fast Hands-free Writing by Gaze Direction

We describe a method for text entry based on inverse arithmetic coding that relies on gaze direction and which is faster and more accurate than using an on-screen keyboard. These benefits are derived from two innovations: the writing task is matched to the capabilities of the eye, and a language model is used to make predictable words and phrases easier to write.Comment: 3 pages. Final versio

Information Leakage Games

We consider a game-theoretic setting to model the interplay between attacker and defender in the context of information flow, and to reason about their optimal strategies. In contrast with standard game theory, in our games the utility of a mixed strategy is a convex function of the distribution on the defender's pure actions, rather than the expected value of their utilities. Nevertheless, the important properties of game theory, notably the existence of a Nash equilibrium, still hold for our (zero-sum) leakage games, and we provide algorithms to compute the corresponding optimal strategies. As typical in (simultaneous) game theory, the optimal strategy is usually mixed, i.e., probabilistic, for both the attacker and the defender. From the point of view of information flow, this was to be expected in the case of the defender, since it is well known that randomization at the level of the system design may help to reduce information leaks. Regarding the attacker, however, this seems the first work (w.r.t. the literature in information flow) proving formally that in certain cases the optimal attack strategy is necessarily probabilistic

Distance Properties of Short LDPC Codes and their Impact on the BP, ML and Near-ML Decoding Performance

Parameters of LDPC codes, such as minimum distance, stopping distance, stopping redundancy, girth of the Tanner graph, and their influence on the frame error rate performance of the BP, ML and near-ML decoding over a BEC and an AWGN channel are studied. Both random and structured LDPC codes are considered. In particular, the BP decoding is applied to the code parity-check matrices with an increasing number of redundant rows, and the convergence of the performance to that of the ML decoding is analyzed. A comparison of the simulated BP, ML, and near-ML performance with the improved theoretical bounds on the error probability based on the exact weight spectrum coefficients and the exact stopping size spectrum coefficients is presented. It is observed that decoding performance very close to the ML decoding performance can be achieved with a relatively small number of redundant rows for some codes, for both the BEC and the AWGN channels

Two remarks on generalized entropy power inequalities

This note contributes to the understanding of generalized entropy power inequalities. Our main goal is to construct a counter-example regarding monotonicity and entropy comparison of weighted sums of independent identically distributed log-concave random variables. We also present a complex analogue of a recent dependent entropy power inequality of Hao and Jog, and give a very simple proof.Comment: arXiv:1811.00345 is split into 2 papers, with this being on

Modulus Computational Entropy

The so-called {\em leakage-chain rule} is a very important tool used in many security proofs. It gives an upper bound on the entropy loss of a random variable $X$ in case the adversary who having already learned some random variables $Z_{1},\ldots,Z_{\ell}$ correlated with $X$, obtains some further information $Z_{\ell+1}$ about $X$. Analogously to the information-theoretic case, one might expect that also for the \emph{computational} variants of entropy the loss depends only on the actual leakage, i.e. on $Z_{\ell+1}$. Surprisingly, Krenn et al.\ have shown recently that for the most commonly used definitions of computational entropy this holds only if the computational quality of the entropy deteriorates exponentially in $|(Z_{1},\ldots,Z_{\ell})|$. This means that the current standard definitions of computational entropy do not allow to fully capture leakage that occurred "in the past", which severely limits the applicability of this notion. As a remedy for this problem we propose a slightly stronger definition of the computational entropy, which we call the \emph{modulus computational entropy}, and use it as a technical tool that allows us to prove a desired chain rule that depends only on the actual leakage and not on its history. Moreover, we show that the modulus computational entropy unifies other,sometimes seemingly unrelated, notions already studied in the literature in the context of information leakage and chain rules. Our results indicate that the modulus entropy is, up to now, the weakest restriction that guarantees that the chain rule for the computational entropy works. As an example of application we demonstrate a few interesting cases where our restricted definition is fulfilled and the chain rule holds.Comment: Accepted at ICTS 201

The effect of time constraint on anticipation, decision making, and option generation in complex and dynamic environments

Researchers interested in performance in complex and dynamic situations have focused on how individuals predict their opponent(s) potential courses of action (i.e., during assessment) and generate potential options about how to respond (i.e., during intervention). When generating predictive options, previous research supports the use of cognitive mechanisms that are consistent with long-term working memory (LTWM) theory (Ericsson and Kintsch in Phychol Rev 102(2):211–245, 1995; Ward et al. in J Cogn Eng Decis Mak 7:231–254, 2013). However, when generating options about how to respond, the extant research supports the use of the take-the-first (TTF) heuristic (Johnson and Raab in Organ Behav Hum Decis Process 91:215–229, 2003). While these models provide possible explanations about how options are generated in situ, often under time pressure, few researchers have tested the claims of these models experimentally by explicitly manipulating time pressure. The current research investigates the effect of time constraint on option-generation behavior during the assessment and intervention phases of decision making by employing a modified version of an established option-generation task in soccer. The results provide additional support for the use of LTWM mechanisms during assessment across both time conditions. During the intervention phase, option-generation behavior appeared consistent with TTF, but only in the non-time-constrained condition. Counter to our expectations, the implementation of time constraint resulted in a shift toward the use of LTWM-type mechanisms during the intervention phase. Modifications to the cognitive-process level descriptions of decision making during intervention are proposed, and implications for training during both phases of decision making are discussed