Related papers: A consistent formalism for the Thomas-Ehrman Level…
Logically constrained term rewriting systems (LCTRSs) are a program analyzing formalism with native support for data types which are not (co)inductively defined. As a first-order formalism, LCTRSs have accommodated only analysis of…
We classify (up to quasi-isomorphism) the free differential modules whose homology is equal to a given module $M$ by developing a theory for deforming an arbitrary free complex into a differential module. We use an iterative approach to…
The solution to empirical risk minimization with $f$-divergence regularization (ERM-$f$DR) is extended to constrained optimization problems, establishing conditions for equivalence between the solution and constraints. A dual formulation of…
A new totally algebraic formalism based on general, abstract ladder operators has been proposed. This approach heavily grounds in the superoperator formalism of Primas. However it is necessary to introduce many improvements in his…
Fault Tree (FT) is a standard failure modeling technique that has been extensively used to predict reliability, availability and safety of many complex engineering systems. In order to facilitate the formal analysis of FT based analyses, a…
We present a general formalism with the aim of describing the situation of an entity, how it is, how it reacts to experiments, how we can make statistics with it, and how it changes under the influence of the rest of the universe. Therefore…
Latent variable models are a fundamental modeling tool in machine learning applications, but they present significant computational and analytical challenges. The popular EM algorithm and its variants, is a much used algorithmic tool; yet…
The formalism of the particle dynamics in the space-time, where motion of free particles is primordially stochastic, is considered. The conventional dynamic formalism, obtained for the space-time, where the motion of free particles is…
We formally specified a program logic for higher-order procedural variables and non-local jumps with Ott and Twelf. Moreover, the dependent type systems and the translation are both executable specifications thanks to Twelf's logic…
In this paper, we present a novel framework for deriving the evolution equation of the level set function in topology optimization, departing from conventional Hamilton-Jacobi based formulations. The key idea is the introduction of an…
In this thesis we extend the formalism of tensor network algorithms to incorporate global internal symmetries. We describe how to both numerically protect the symmetry and exploit it for computational gain in tensor network simulations. Our…
We analyse the convergence of numerical schemes in the GDM-ELLAM (Gradient Discretisation Method-Eulerian Lagrangian Localised Adjoint Method) framework for a strongly coupled elliptic-parabolic PDE which models miscible displacement in…
Transport through nanosystems is treated within the second order von Neumann approach. This approach bridges the gap between rate equations which neglect level broadening and cotunneling, and the transmission formalism, which is essentially…
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…
In this paper, for iterated function systems, we define the classic concept of the dynamical systems: topological conjugacy of diffeomorphisms. We generalize the Hartman-Grobman theorem for one dimensional iterated function systems on R.…
Logically constrained term rewriting is a relatively new rewriting formalism that naturally supports built-in data structures, such as integers and bit vectors. In the analysis of logically constrained term rewrite systems (LCTRSs),…
The worldline formalism allows one to obtain compact integral representations combining the information of large numbers of Feynman diagrams. However, their analytic calculation leads to a non-standard integration problem for which existing…
Exponential tilting is a technique commonly used in fields such as statistics, probability, information theory, and optimization to create parametric distribution shifts. Despite its prevalence in related fields, tilting has not seen…
We present a discrete total variation calculus in Hamiltonian formalism in this paper. Using this discrete variation calculus and generating functions for the flows of Hamiltonian systems, we derive two-step symplectic-energy integrators of…
In this paper we characterize foams and tetrahedral structures in a unified way, by a simplified representation of both that conserves the system topology. The paper presents a workflow for an automated characterization of the topology of…