Building upon a famous result due to Ajtai, we propose a sequence of lattice bases with growing dimension, which can be expected to be hard instances of the shortest vector problem (SVP) and which can therefore be used to benchmark lattice reduction algorithms. The SVP is the basis of security for potentially post-quantum cryptosystems. We use our sequence of lattice bases to create a challenge...

We study the constraints on a minimal supersymmetric seesaw model imposed by neutrino data, charged lepton flavor violation, thermal leptogenesis and perturbativity. We show that it is possible to constrain the three heavy Majorana neutrino masses as well as the complex Yukawa coupling matrix. Our results provide a first step towards a seesaw benchmark model for further phenomenological studies...

Reactive systems [1] need to be built in a certain way. Specific requirements that they have, call for certain kinds of programming techniques and frameworks. In this work we compare and benchmark two frameworks for building distributed concurrent applications from the Reactive Systems’ point of view. We discuss each of the frameworks in depth and later reason about their shortcomings and stron...

Building upon a famous result due to Ajtai, we propose a sequence of lattice bases with growing dimension, which can be expected to be hard instances of the shortest vector problem (SVP) and which can therefore be used to benchmark lattice reduction algorithms. The SVP is the basis of security for potentially post-quantum cryptosystems. We use our sequence of lattice bases to create a challenge...

This article describes a method to turn astronomical imaging into a random number generator by using the positions of incident cosmic rays and hot pixels to generate bit streams. We subject the resultant bit streams to a battery of standard benchmark statistical tests for randomness and show that these bit streams are statistically the same as a perfect random bit stream. Strategies for improvi...

Chord progressions are the building blocks from which tonal music is constructed. The choice of a particular representation for chords has a strong impact on statistical modeling of the dependence between chord symbols and the actual sequences of notes in polyphonic music. Melodic prediction is used in this paper as a benchmark task to evaluate the quality of four chord representations using tw...

data envelopment analysis (dea) with considering the best condition for each decision making unit (dmu) assesses the relative efficiency for it and divides a homogenous group of dmus in to two categories: efficient and inefficient, but traditional dea models can not rank efficient dmus. although some models were introduced for ranking efficient dmus, franklin lio & hsuan peng (2008), proposed a...

High order mutation analysis of a software engineering benchmark, including schema and local optima networks, suggests program improvements may not be as hard to find as is often assumed. 1) Bitwise genetic building blocks are not deceptive and can lead to all global optima. 2) There are many neutral networks, plateaux and local optima, nevertheless in most cases near the human written C source...

In this paper we present a novel approach to unsupervised clustering in building an efficient anomaly based network intrusion detection model. The method is based on a recently introduced sequential information bottleneck (sIB) principle. KDDCup 1999 intrusion detection benchmark dataset is used for the experimentation of our proposed technique. The experimental results demonstrate that the pro...