448,148 research outputs found
Tracking Data-Flow with Open Closure Types
Type systems hide data that is captured by function closures in function
types. In most cases this is a beneficial design that favors simplicity and
compositionality. However, some applications require explicit information about
the data that is captured in closures. This paper introduces open closure
types, that is, function types that are decorated with type contexts. They are
used to track data-flow from the environment into the function closure. A
simply-typed lambda calculus is used to study the properties of the type theory
of open closure types. A distinctive feature of this type theory is that an
open closure type of a function can vary in different type contexts. To present
an application of the type theory, it is shown that a type derivation
establishes a simple non-interference property in the sense of information-flow
theory. A publicly available prototype implementation of the system can be used
to experiment with type derivations for example programs.Comment: Logic for Programming Artificial Intelligence and Reasoning (2013
Complexity Information Flow in a Multi-threaded Imperative Language
We propose a type system to analyze the time consumed by multi-threaded
imperative programs with a shared global memory, which delineates a class of
safe multi-threaded programs. We demonstrate that a safe multi-threaded program
runs in polynomial time if (i) it is strongly terminating wrt a
non-deterministic scheduling policy or (ii) it terminates wrt a deterministic
and quiet scheduling policy. As a consequence, we also characterize the set of
polynomial time functions. The type system presented is based on the
fundamental notion of data tiering, which is central in implicit computational
complexity. It regulates the information flow in a computation. This aspect is
interesting in that the type system bears a resemblance to typed based
information flow analysis and notions of non-interference. As far as we know,
this is the first characterization by a type system of polynomial time
multi-threaded programs
Resonance capture of neutrons in infinite homogeneous media
In a previous paper, a variational principle was introduced for 1 - p, the capture probability for neutrons slowing down in a homogeneous medium of infinite extent. In the present paper, the variational principle is used together with simple but accurate trial functions to obtain expressions for (i) corrections to the commonly used 'narrow resonance' formula for capture and (ii) interference effects in the capture of neutrons by closely spaced resonances
The Quantum as an Emergent System
Double slit interference is explained with the aid of what we call
"21stcentury classical physics". We model a particle as an oscillator
("bouncer") in a thermal context, which is given by some assumed "zero-point"
field of the vacuum. In this way, the quantum is understood as an emergent
system, i.e., a steady-state system maintained by a constant throughput of
(vacuum) energy. To account for the particle's thermal environment, we
introduce a "path excitation field", which derives from the thermodynamics of
the zero-point vacuum and which represents all possible paths a particle can
take via thermal path fluctuations. The intensity distribution on a screen
behind a double slit is calculated, as well as the corresponding trajectories
and the probability density current. Further, particular features of the
relative phase are shown to be responsible for nonlocal effects not only in
ordinary quantum theory, but also in our classical approach.Comment: 24 pages, 2 figures, based on a talk given at "Emergent Quantum
Mechanics (Heinz von Foerster Conference 2011)",
http://www.univie.ac.at/hvf11/congress/EmerQuM.htm
Receivers for Diffusion-Based Molecular Communication: Exploiting Memory and Sampling Rate
In this paper, a diffusion-based molecular communication channel between two
nano-machines is considered. The effect of the amount of memory on performance
is characterized, and a simple memory-limited decoder is proposed and its
performance is shown to be close to that of the best possible imaginable
decoder (without any restriction on the computational complexity or its
functional form), using Genie-aided upper bounds. This effect is specialized
for the case of Molecular Concentration Shift Keying; it is shown that a
four-bits memory achieved nearly the same performance as infinite memory. Then
a general class of threshold decoders is considered and shown not to be optimal
for Poisson channel with memory, unless SNR is higher than a value specified in
the paper. Another contribution is to show that receiver sampling at a rate
higher than the transmission rate, i.e., a multi-read system, can significantly
improve the performance. The associated decision rule for this system is shown
to be a weighted sum of the samples during each symbol interval. The
performance of the system is analyzed using the saddle point approximation. The
best performance gains are achieved for an oversampling factor of three.Comment: Submitted to JSA
- …