Related papers: The Name-Passing Calculus
Computing modular coincidences can show whether a given substitution system, which is supported on a point lattice in R^d, consists of model sets or not. We prove the computatibility of this problem and determine an upper bound for the…
Comparative prime number theory is the study of the {\em{discrepancies}} of distributions when we compare the number of primes in different residue classes. This work presents a list of the problems being investigated in comparative prime…
Mobile communication has become a vigorous field of research in computer science, due to the wide spreading of mobile technologies, applications and services. The intertwining of communication, computation and mobility constantly poses new…
The proposed system of integer functions is logically fully independent from the traditional mathematical analysis of the real functions, but there is a well-defined mutual correspondence between the two disciplines. The system of integer…
Differential Calculus is a staple of the college mathematics major's diet. Eventually one becomes tired of the same routine, and wishes for a more diverse meal. The college math major may seek to generalize applications of the derivative…
Finite differences have been widely used in mathematical theory as well as in scientific and engineering computations. These concepts are constantly mentioned in calculus. Most frequently-used difference formulas provide excellent…
Spatial statistics is concerned with the analysis of data that have spatial locations associated with them, and those locations are used to model statistical dependence between the data. The spatial data are treated as a single realisation…
Quantum computing has been a fascinating research field in quantum physics. Recent progresses motivate us to study in depth the universal quantum computing models (UQCM), which lie at the foundation of quantum computing and have tight…
In most of the cases, the experimental study of Nanotechnology involves high cost for Laboratory set-up and the experimentation processes were also slow. So, one cannot rely on experimental nanotechnology alone. As such, the Computer-Based…
Modern scientific computational methods are undergoing a transformative change; big data and statistical learning methods now have the potential to outperform the classical first-principles modeling paradigm. This book bridges this…
System modeling is a classical approach to ensure their reliability since it is suitable both for a formal verification and for software testing techniques. In the context of model-based testing an approach combining random testing and…
Studies of strongly nonlinear dynamical systems such as turbulent flows call for superior computational prowess. With the advent of quantum computing, a plethora of quantum algorithms have demonstrated, both theoretically and…
Nearly all practical applications of the theory of characteristic modes (CMs) involve the use of computational tools. Here in Paper 2 of this Series on CMs, we review the general transformations that move CMs from a continuous theoretical…
We prove a general congruence result for bisimilarity in higher-order languages, which generalises previous work to languages specified by a labelled transition system in which programs may occur as labels, and which may rely on operations…
Adding a column of numbers produces "carries" along the way. We show that random digits produce a pattern of carries with a neat probabilistic description: the carries form a one-dependent determinantal point process. This makes it easy to…
This study deals with a fairly simply formulated problem -- how to estimate the number of people bearing the same full name in a large population. Estimation of name popularity can leverage personal name matching in databases and be of…
For each type of number, structures that differ by arbitrary scaling factors and are isomorphic to one another are described. The scaling of number values in one structure, relative to the values in another structure, must be compensated…
Computation models such as circuits describe sequences of computation steps that are carried out one after the other. In other words, algorithm design is traditionally subject to the restriction imposed by a fixed causal order. We address a…
Particle-style token machines are a way to interpret proofs and programs, when the latter are written following the principles of linear logic. In this paper, we show that token machines also make sense when the programs at hand are those…
This is an up-to-date introduction to, and overview of, marginal likelihood computation for model selection and hypothesis testing. Computing normalizing constants of probability models (or ratio of constants) is a fundamental issue in many…