Quantifying Timing Leaks and Cost Optimisation

We develop a new notion of security against timing attacks where the attacker is able to simultaneously observe the execution time of a program and the probability of the values of low variables. We then show how to measure the security of a program with respect to this notion via a computable estimate of the timing leakage and use this estimate for cost optimisation.Comment: 16 pages, 2 figures, 4 tables. A shorter version is included in the proceedings of ICICS'08 - 10th International Conference on Information and Communications Security, 20-22 October, 2008 Birmingham, U

Probabilistic abstract interpretation: From trace semantics to DTMC’s and linear regression

In order to perform probabilistic program analysis we need to consider probabilistic languages or languages with a probabilistic semantics, as well as a corresponding framework for the analysis which is able to accommodate probabilistic properties and properties of probabilistic computations. To this purpose we investigate the relationship between three different types of probabilistic semantics for a core imperative language, namely Kozen’s Fixpoint Semantics, our Linear Operator Semantics and probabilistic versions of Maximal Trace Semantics. We also discuss the relationship between Probabilistic Abstract Interpretation (PAI) and statistical or linear regression analysis. While classical Abstract Interpretation, based on Galois connection, allows only for worst-case analyses, the use of the Moore-Penrose pseudo inverse in PAI opens the possibility of exploiting statistical and noisy observations in order to analyse and identify various system properties

The second moment of the pion's distribution amplitude

We present preliminary results for the second moment of the pion's distribution amplitude. The lattice formulation and the phenomenological implications are briefly reviewed, with special emphasis on some subtleties that arise when the Lorentz group is replaced by the hypercubic group. Having analysed more than half of the available configurations, the result obtained is \xi^2_L = 0.06 \pm 0.02.Comment: Lattice 99 (matrix elements), 3 page

Information Security as Strategic (In)effectivity

Security of information flow is commonly understood as preventing any information leakage, regardless of how grave or harmless consequences the leakage can have. In this work, we suggest that information security is not a goal in itself, but rather a means of preventing potential attackers from compromising the correct behavior of the system. To formalize this, we first show how two information flows can be compared by looking at the adversary's ability to harm the system. Then, we propose that the information flow in a system is effectively information-secure if it does not allow for more harm than its idealized variant based on the classical notion of noninterference

Mode Confinement in Photonic Quasi-Crystal Point-Defect Cavities for Particle Accelerators

In this Letter, we present a study of the confinement properties of point-defect resonators in finite-size photonic-bandgap structures composed of aperiodic arrangements of dielectric rods, with special emphasis on their use for the design of cavities for particle accelerators. Specifically, for representative geometries, we study the properties of the fundamental mode (as a function of the filling fraction, structure size, and losses) via 2-D and 3-D full-wave numerical simulations, as well as microwave measurements at room temperature. Results indicate that, for reduced-size structures, aperiodic geometries exhibit superior confinement properties by comparison with periodic ones.Comment: 4 pages, 4 figures, accepted for publication in Applied Physics Letter

Linear Superiorization for Infeasible Linear Programming

Linear superiorization (abbreviated: LinSup) considers linear programming (LP) problems wherein the constraints as well as the objective function are linear. It allows to steer the iterates of a feasibility-seeking iterative process toward feasible points that have lower (not necessarily minimal) values of the objective function than points that would have been reached by the same feasiblity-seeking iterative process without superiorization. Using a feasibility-seeking iterative process that converges even if the linear feasible set is empty, LinSup generates an iterative sequence that converges to a point that minimizes a proximity function which measures the linear constraints violation. In addition, due to LinSup's repeated objective function reduction steps such a point will most probably have a reduced objective function value. We present an exploratory experimental result that illustrates the behavior of LinSup on an infeasible LP problem.Comment: arXiv admin note: substantial text overlap with arXiv:1612.0653

An Algorithmic Approach to Quantum Field Theory

The lattice formulation provides a way to regularize, define and compute the Path Integral in a Quantum Field Theory. In this paper we review the theoretical foundations and the most basic algorithms required to implement a typical lattice computation, including the Metropolis, the Gibbs sampling, the Minimal Residual, and the Stabilized Biconjugate inverters. The main emphasis is on gauge theories with fermions such as QCD. We also provide examples of typical results from lattice QCD computations for quantities of phenomenological interest.Comment: 44 pages, to be published in IJMP

One size doesn’t fit all: the influence of supervisors’ power tactics and subordinates’ need for cognitive closure on burnout and stress

The present research investigated the notion of fit between supervisors’ power tactics and subordinates’ need for cognitive closure (NFCC) on subordinates’ burnout and stress. Subordinates who tend to avoid ambiguity (high NFCC) were expected to experience relatively less burnout (Study 1) and stress (Study 2) if their supervisors utilize harsh (controlling and unequivocal) power tactics and more burnout and stress if their supervisors utilize soft (autonomy-supportive and equivocal) power tactics. In contrast, it was expected that subordinates who avoid firm and binding conclusions (low NFCC) would experience relatively less burnout and stress if their supervisors use soft power tactics and more burnout and stress if they use harsh power tactics. Two studies conducted in diverse organizational settings supported these hypotheses. Collectively, these results support the conclusion that soft (vs. harsh) power tactics are not always associated with better (vs. worse) organizational outcomes. Theoretical and practical implications for organizations are discussed