3,894 research outputs found
Dagstuhl Reports : Volume 1, Issue 2, February 2011
Online Privacy: Towards Informational Self-Determination on the Internet (Dagstuhl Perspectives Workshop 11061) : Simone Fischer-Hübner, Chris Hoofnagle, Kai Rannenberg, Michael Waidner, Ioannis Krontiris and Michael Marhöfer Self-Repairing Programs (Dagstuhl Seminar 11062) : Mauro Pezzé, Martin C. Rinard, Westley Weimer and Andreas Zeller Theory and Applications of Graph Searching Problems (Dagstuhl Seminar 11071) : Fedor V. Fomin, Pierre Fraigniaud, Stephan Kreutzer and Dimitrios M. Thilikos Combinatorial and Algorithmic Aspects of Sequence Processing (Dagstuhl Seminar 11081) : Maxime Crochemore, Lila Kari, Mehryar Mohri and Dirk Nowotka Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091) Klaus Jansen, Claire Mathieu, Hadas Shachnai and Neal E. Youn
Quantum Hopfield neural network
Quantum computing allows for the potential of significant advancements in
both the speed and the capacity of widely used machine learning techniques.
Here we employ quantum algorithms for the Hopfield network, which can be used
for pattern recognition, reconstruction, and optimization as a realization of a
content-addressable memory system. We show that an exponentially large network
can be stored in a polynomial number of quantum bits by encoding the network
into the amplitudes of quantum states. By introducing a classical technique for
operating the Hopfield network, we can leverage quantum algorithms to obtain a
quantum computational complexity that is logarithmic in the dimension of the
data. We also present an application of our method as a genetic sequence
recognizer.Comment: 13 pages, 3 figures, final versio
The -operator and Invariant Subtraction Games
We study 2-player impartial games, so called \emph{invariant subtraction
games}, of the type, given a set of allowed moves the players take turn in
moving one single piece on a large Chess board towards the position
. Here, invariance means that each allowed move is available
inside the whole board. Then we define a new game, of the old game, by
taking the -positions, except , as moves in the new game. One
such game is \W^\star= (Wythoff Nim), where the moves are defined by
complementary Beatty sequences with irrational moduli. Here we give a
polynomial time algorithm for infinitely many -positions of \W^\star. A
repeated application of turns out to give especially nice properties
for a certain subfamily of the invariant subtraction games, the
\emph{permutation games}, which we introduce here. We also introduce the family
of \emph{ornament games}, whose -positions define complementary Beatty
sequences with rational moduli---hence related to A. S. Fraenkel's `variant'
Rat- and Mouse games---and give closed forms for the moves of such games. We
also prove that (-pile Nim) = -pile Nim.Comment: 30 pages, 5 figure
How many double squares can a string contain?
Counting the types of squares rather than their occurrences, we consider the
problem of bounding the number of distinct squares in a string. Fraenkel and
Simpson showed in 1998 that a string of length n contains at most 2n distinct
squares. Ilie presented in 2007 an asymptotic upper bound of 2n - Theta(log n).
We show that a string of length n contains at most 5n/3 distinct squares. This
new upper bound is obtained by investigating the combinatorial structure of
double squares and showing that a string of length n contains at most 2n/3
double squares. In addition, the established structural properties provide a
novel proof of Fraenkel and Simpson's result.Comment: 29 pages, 20 figure
Efficient String Matching on Coded Texts
The so called "four Russians technique'' is often used to speed up algorithms by encoding several data items in a single memory cell. Given a sequence of n symbols over a constant size alphabet, one can encode the sequence into O(n / lambda) memory cells in O(log(lambda) ) time using n / log(lambda) processors. This paper presents an efficient CRCW-PRAM string-matching algorithm for coded texts that takes O(log log(m/lambda)) time making only O(n / lambda ) operations, an improvement by a factor of lambda = O(log n) on the number of operations used in previous algorithms. Using this string-matching algorithm one can test if a string is square-free and find all palindromes in a string in O(log log n) time using n / log log n processors
Test Set Diameter: Quantifying the Diversity of Sets of Test Cases
A common and natural intuition among software testers is that test cases need
to differ if a software system is to be tested properly and its quality
ensured. Consequently, much research has gone into formulating distance
measures for how test cases, their inputs and/or their outputs differ. However,
common to these proposals is that they are data type specific and/or calculate
the diversity only between pairs of test inputs, traces or outputs.
We propose a new metric to measure the diversity of sets of tests: the test
set diameter (TSDm). It extends our earlier, pairwise test diversity metrics
based on recent advances in information theory regarding the calculation of the
normalized compression distance (NCD) for multisets. An advantage is that TSDm
can be applied regardless of data type and on any test-related information, not
only the test inputs. A downside is the increased computational time compared
to competing approaches.
Our experiments on four different systems show that the test set diameter can
help select test sets with higher structural and fault coverage than random
selection even when only applied to test inputs. This can enable early test
design and selection, prior to even having a software system to test, and
complement other types of test automation and analysis. We argue that this
quantification of test set diversity creates a number of opportunities to
better understand software quality and provides practical ways to increase it.Comment: In submissio
Repetitions in partial words
El objeto de esta tesis está representado por las repeticiones de palabras parciales, palabras que, además de las letras regulares, pueden tener un número de sÃmbolos desconocidos,llamados sÃmbolos "agujeros" o "no sé qué". Más concretamente, se presenta y se resuelve una extensión de la noción de repetición establecida por Axel Thue. Investigamos las palabras parciales con un número infinito de agujeros que cumplen estas propiedades y, también las palabras parciales que conservan las propiedades después de la inserción de un número arbitrario de agujeros, posiblemente infinito. Luego, hacemos un recuento del número máximo de 2-repeticiones distintas compatibles con los factores de una palabra parcial. Se demuestra que el problema en el caso general es difÃcil, y estudiamos el problema en el caso de un agujero. Al final, se estudian algunas propiedades de las palabras parciales sin fronteras y primitivas (palabras sin repeticiones) y se da una caracterización del lenguaje de palabras parciales con una factorización crÃtica
Observational constraints on modified gravity models and the Poincar\'e dodecahedral topology
We study the constraints that spatial topology may place on the parameters of
models that account for the accelerated expansion of the universe via infrared
modifications to general relativity, namely the Dvali-Gabadadze-Porrati
braneworld model as well as the Dvali-Turner and Cardassian models. By
considering the Poincar\'e dodecahedral space as the circles-in-the-sky
observable spatial topology, we examine the constraints that can be placed on
the parameters of each model using type Ia supernovae data together with the
baryon acoustic peak in the large scale correlation function of the Sloan
Digital Sky Survey of luminous red galaxies and the Cosmic Microwave Background
Radiation shift parameter data. We show that knowledge of spatial topology does
provide relevant constraints, particularly on the curvature parameter, for all
models.Comment: Revtex4, 10 pages, 1 table, 12 figures; version to match the one to
be published in Physical Review
- …