525,134 research outputs found
Status and Future Perspectives for Lattice Gauge Theory Calculations to the Exascale and Beyond
In this and a set of companion whitepapers, the USQCD Collaboration lays out
a program of science and computing for lattice gauge theory. These whitepapers
describe how calculation using lattice QCD (and other gauge theories) can aid
the interpretation of ongoing and upcoming experiments in particle and nuclear
physics, as well as inspire new ones.Comment: 44 pages. 1 of USQCD whitepapers
A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding
Set-membership estimation is usually formulated in the context of set-valued
calculus and no probabilistic calculations are necessary. In this paper, we
show that set-membership estimation can be equivalently formulated in the
probabilistic setting by employing sets of probability measures. Inference in
set-membership estimation is thus carried out by computing expectations with
respect to the updated set of probability measures P as in the probabilistic
case. In particular, it is shown that inference can be performed by solving a
particular semi-infinite linear programming problem, which is a special case of
the truncated moment problem in which only the zero-th order moment is known
(i.e., the support). By writing the dual of the above semi-infinite linear
programming problem, it is shown that, if the nonlinearities in the measurement
and process equations are polynomial and if the bounding sets for initial
state, process and measurement noises are described by polynomial inequalities,
then an approximation of this semi-infinite linear programming problem can
efficiently be obtained by using the theory of sum-of-squares polynomial
optimization. We then derive a smart greedy procedure to compute a polytopic
outer-approximation of the true membership-set, by computing the minimum-volume
polytope that outer-bounds the set that includes all the means computed with
respect to P
A guided tour of asynchronous cellular automata
Research on asynchronous cellular automata has received a great amount of
attention these last years and has turned to a thriving field. We survey the
recent research that has been carried out on this topic and present a wide
state of the art where computing and modelling issues are both represented.Comment: To appear in the Journal of Cellular Automat
Different Approaches to Proof Systems
The classical approach to proof complexity perceives proof systems as deterministic, uniform, surjective, polynomial-time computable functions that map strings to (propositional) tautologies. This approach has been intensively studied since the late 70’s and a lot of progress has been made. During the last years research was started investigating alternative notions of proof systems. There are interesting results stemming from dropping the uniformity requirement, allowing oracle access, using quantum computations, or employing probabilism. These lead to different notions of proof systems for which we survey recent results in this paper
- …