Related papers: Extrinsic faulting in $3C$ close packed crystal st…
Implicit computational complexity, which aims at characterizing complexity classes by machine-independent means, has traditionally been based, on the one hand, on programs and deductive formalisms for free algebras, and on the other hand on…
We study deterministic discrete time exclusion type spatially heterogeneous particle processes in continuum. A typical example of this sort is a traffic flow model with obstacles: traffic lights, speed bumps, spatially varying local…
The effect of the correlations in the diluteness pattern in the systems with non-integral dimensionality, on $\nu=\frac{4}{5}$ superdiffusion process is considered in this paper. These spatial correlations have proved to be very effective…
We introduce a general Bayesian framework for graph matching grounded in a new theory of exchangeable random permutations. Leveraging the cycle representation of permutations and the literature on exchangeable random partitions, we define,…
Large deviations for additive path functionals of stochastic processes have attracted significant research interest, in particular in the context of stochastic particle systems and statistical physics. Efficient numerical `cloning'…
Starting from a semi-empirical potential designed for Cu, we developed a series of potentials that provide essentially constant values of all significant (calculated) materials properties except for the intrinsic stacking fault energy,…
A broad class of blocked or jammed configurations of particles on the one-dimensional lattice can be characterized in terms of local rules involving only the lengths of clusters of particles (occupied sites) and of holes (empty sites).…
To counter man-at-the-end attacks such as reverse engineering and tampering, software is often protected with techniques that require support modules to be linked into the application. It is well-known, however, that attackers can exploit…
Exotic behaviour of mechanical metamaterials often relies on an internal transformation of the underlying microstructure triggered by its local instabilities, rearrangements, and rotations. Depending on the presence and magnitude of such a…
The inside-outside probabilities are typically used for reestimating Probabilistic Context Free Grammars (PCFGs), just as the forward-backward probabilities are typically used for reestimating HMMs. I show several novel uses, including…
Computers are deterministic dynamical systems (CHAOS 19:033124, 2009). Among other things, that implies that one should be able to use deterministic forecast rules to predict their behavior. That statement is sometimes-but not always-true.…
Fracture processes in heterogeneous materials comprise a large number of disordered spatial degrees of freedom, representing the dynamical state of a sample over the entire domain of interest. This complexity is usually modeled directly,…
A model for quantum tunnelling of a cluster comprising A identical particles, coupled by oscillator-type potential, through short-range repulsive potential barriers is introduced for the first time in the new symmetrized-coordinate…
Physical systems behave according to their underlying dynamical equations which, in turn, can be identified from experimental data. Explaining data requires selecting mathematical models that best capture the data regularities. Identifying…
Bounded model checking of pointer programs is a debugging technique for programs that manipulate dynamically allocated pointer structures on the heap. It is based on the following four observations. First, error conditions like dereference…
This paper develops a computational model of paraphrase under which text modification is carried out reluctantly; that is, there are external constraints, such as length or readability, on an otherwise ideal text, and modifications to the…
We use the martingale-theoretic approach of game-theoretic probability to incorporate imprecision into the study of randomness. In particular, we define a notion of computable randomness associated with interval, rather than precise,…
Separation logic is a substructural logic which has proved to have numerous and fruitful applications to the verification of programs working on dynamic data structures. Recently, Barthe, Hsu and Liao have proposed a new way of giving…
Recent advances in programming languages study and design have established a standard way of grounding computational systems representation in category theory. These formal results led to a better understanding of issues of control and…
Complexity measures are essential to understand complex systems and there are numerous definitions to analyze one-dimensional data. However, extensions of these approaches to two or higher-dimensional data, such as images, are much less…