17,753 research outputs found
Pseudo-random generators and structure of complete degrees
It is shown that, if there exist sets in E (the exponential complexity class) that require 2Ω(n)-sized circuits, then sets that are hard for class P (the polynomial complexity class) and above, under 1-1 reductions, are also hard under 1-1 size-increasing reductions. Under the assumption of the hardness of solving the RSA (Rivest-Shamir-Adleman, 1978) problem or the discrete log problem, it is shown that sets that are hard for class NP (nondeterministic polynomial) and above, under many-1 reductions, are also hard under (non-uniform) 1-1 and size-increasing reductions
Supersymmetric Many-particle Quantum Systems with Inverse-square Interactions
The development in the study of supersymmetric many-particle quantum systems
with inverse-square interactions is reviewed. The main emphasis is on quantum
systems with dynamical OSp(2|2) supersymmetry. Several results related to
exactly solved supersymmetric rational Calogero model, including shape
invariance, equivalence to a system of free superoscillators and non-uniqueness
in the construction of the Hamiltonian, are presented in some detail. This
review also includes a formulation of pseudo-hermitian supersymmetric quantum
systems with a special emphasis on rational Calogero model. There are quite a
few number of many-particle quantum systems with inverse-square interactions
which are not exactly solved for a complete set of states in spite of the
construction of infinitely many exact eigen functions and eigenvalues. The
Calogero-Marchioro model with dynamical SU(1,1|2) supersymmetry and a quantum
system related to short-range Dyson model belong to this class and certain
aspects of these models are reviewed. Several other related and important
developments are briefly summarized.Comment: LateX, 65 pages, Added Acknowledgment, Discussions and References,
Version to appear in Jouranl of Physics A: Mathematical and Theoretical
(Commissioned Topical Review Article
Pseudo Random Coins Show More Heads Than Tails
Tossing a coin is the most elementary Monte Carlo experiment. In a computer
the coin is replaced by a pseudo random number generator. It can be shown
analytically and by exact enumerations that popular random number generators
are not capable of imitating a fair coin: pseudo random coins show more heads
than tails. This bias explains the empirically observed failure of some random
number generators in random walk experiments. It can be traced down to the
special role of the value zero in the algebra of finite fields.Comment: 10 pages, 12 figure
Measuring sets in infinite groups
We are now witnessing a rapid growth of a new part of group theory which has
become known as "statistical group theory". A typical result in this area would
say something like ``a random element (or a tuple of elements) of a group G has
a property P with probability p". The validity of a statement like that does,
of course, heavily depend on how one defines probability on groups, or,
equivalently, how one measures sets in a group (in particular, in a free
group). We hope that new approaches to defining probabilities on groups
outlined in this paper create, among other things, an appropriate framework for
the study of the "average case" complexity of algorithms on groups.Comment: 22 page
Mixing multi-core CPUs and GPUs for scientific simulation software
Recent technological and economic developments have led to widespread availability of
multi-core CPUs and specialist accelerator processors such as graphical processing units
(GPUs). The accelerated computational performance possible from these devices can be very
high for some applications paradigms. Software languages and systems such as NVIDIA's
CUDA and Khronos consortium's open compute language (OpenCL) support a number of
individual parallel application programming paradigms. To scale up the performance of some
complex systems simulations, a hybrid of multi-core CPUs for coarse-grained parallelism and
very many core GPUs for data parallelism is necessary. We describe our use of hybrid applica-
tions using threading approaches and multi-core CPUs to control independent GPU devices.
We present speed-up data and discuss multi-threading software issues for the applications
level programmer and o er some suggested areas for language development and integration
between coarse-grained and ne-grained multi-thread systems. We discuss results from three
common simulation algorithmic areas including: partial di erential equations; graph cluster
metric calculations and random number generation. We report on programming experiences
and selected performance for these algorithms on: single and multiple GPUs; multi-core CPUs;
a CellBE; and using OpenCL. We discuss programmer usability issues and the outlook and
trends in multi-core programming for scienti c applications developers
Neural Connectivity with Hidden Gaussian Graphical State-Model
The noninvasive procedures for neural connectivity are under questioning.
Theoretical models sustain that the electromagnetic field registered at
external sensors is elicited by currents at neural space. Nevertheless, what we
observe at the sensor space is a superposition of projected fields, from the
whole gray-matter. This is the reason for a major pitfall of noninvasive
Electrophysiology methods: distorted reconstruction of neural activity and its
connectivity or leakage. It has been proven that current methods produce
incorrect connectomes. Somewhat related to the incorrect connectivity
modelling, they disregard either Systems Theory and Bayesian Information
Theory. We introduce a new formalism that attains for it, Hidden Gaussian
Graphical State-Model (HIGGS). A neural Gaussian Graphical Model (GGM) hidden
by the observation equation of Magneto-encephalographic (MEEG) signals. HIGGS
is equivalent to a frequency domain Linear State Space Model (LSSM) but with
sparse connectivity prior. The mathematical contribution here is the theory for
high-dimensional and frequency-domain HIGGS solvers. We demonstrate that HIGGS
can attenuate the leakage effect in the most critical case: the distortion EEG
signal due to head volume conduction heterogeneities. Its application in EEG is
illustrated with retrieved connectivity patterns from human Steady State Visual
Evoked Potentials (SSVEP). We provide for the first time confirmatory evidence
for noninvasive procedures of neural connectivity: concurrent EEG and
Electrocorticography (ECoG) recordings on monkey. Open source packages are
freely available online, to reproduce the results presented in this paper and
to analyze external MEEG databases
Geometric auxetics
We formulate a mathematical theory of auxetic behavior based on one-parameter
deformations of periodic frameworks. Our approach is purely geometric, relies
on the evolution of the periodicity lattice and works in any dimension. We
demonstrate its usefulness by predicting or recognizing, without experiment,
computer simulations or numerical approximations, the auxetic capabilities of
several well-known structures available in the literature. We propose new
principles of auxetic design and rely on the stronger notion of expansive
behavior to provide an infinite supply of planar auxetic mechanisms and several
new three-dimensional structures
- …