We present an exact and efficient algorithm for reaction-diffusion-nucleation processes on a 2D lattice. The algorithm makes use of first-passage time (FPT) to replace the computationally intensive simulation of diffusion hops in KMC by larger jumps when particles are far away from step-edges or other particles. Our approach computes exact probability distributions of jump times and target loca...

The problems of the first-passage time (FPT) [1, 2] and the residence time (RT) [3] are very important issues in random walk theory. Moreover, several properties of diffusion and transport in disordered systems are based in this concepts. Here, we do not want to present a survey of the enormous literature in the field of mean firstpassage time (MFPT) and mean residence time (MRT) of random walk...

We build on Danvy and Nielsen’s first-order program transformation into continuation-passing style (CPS) to present a new correctness proof of the converse transformation, i.e., a one-pass transformation from CPS back to direct style. Previously published proofs were based on CPS transformations that were either higher-order, noncompositional, or operating in two passes, and were correspondingl...

The discovery, representation and reconstruction of (technical) integration networks from Network Mining (NM) raw data is a difficult problem for enterprises. This is due to large and complex IT landscapes within and across enterprise boundaries, heterogeneous technology stacks, and fragmented data. To remain competitive, visibility into the enterprise and partner IT networks on different, inte...

By adopting natural generalizations of relational frame and relational model we showed in [2] that the deontic law D, Dp -» Op, is not universally first-order definable. In effect, we showed there that for n > 2, there is no n-adic first-order sentence p such that for every n-ary frame F,F ^D iff F ^(3 in the first-order sense. The notion of n-ary frame and model employed there may be summarize...

The formalizations of periods of time inside a linear model of Time are usually based on the notion of intervals, that may contain or may not their endpoints. This is not enough when the periods are written in terms of coarse granularities with respect to the event taken into account. For instance, how to express the inter-war period in terms of a years interval? This paper presents a new type ...

Lin and Zhao’s theorem on loop formulas states that in the propositional case the stable model semantics of a logic program can be completely characterized by propositional loop formulas, but this result does not fully carry over to the first-order case. We investigate the precise relationship between the first-order stable model semantics and first-order loop formulas, and study conditions und...

Much research in Bayesian modeling has been done to elicit a prior distribution that incorporates domain knowledge. We present a novel and more direct approach by imposing First-Order Logic (FOL) rules on the posterior distribution. Our approach unifies FOL and Bayesian modeling under the regularized Bayesian framework. In addition, our approach automatically estimates the uncertainty of FOL ru...