English
Related papers

Related papers: A semi-quantitative equivalence for abstracting fr…

200 papers

The syntactic nature and compositionality characteristic of stochastic process algebras make models to be easily understood by human beings, but not convenient for machines as well as people to directly carry out mathematical analysis and…

Logic in Computer Science · Computer Science 2010-12-15 Jie Ding , Jane Hillston

We consider the efficient estimation of the semiparametric additive transformation model with current status data. A wide range of survival models and econometric models can be incorporated into this general transformation framework. We…

Statistics Theory · Mathematics 2011-05-09 Guang Cheng , Xiao Wang

In this paper we introduced an algebraic semantics for process algebra in form of abstract data types. For that purpose, we developed a particular type of algebra, the seed algebra, which describes exactly the behavior of a process within a…

Programming Languages · Computer Science 2010-01-08 Ruqian Lu , Lixing Li , Yun Shang , Xiaoyu Li

In this letter we give a systematic derivation and justification of the semiclassical model for the slow degrees of freedom in adiabatic slow-fast systems first found by Littlejohn and Flynn [5]. The classical Hamiltonian obtains a…

Quantum Physics · Physics 2015-06-04 Stefan Teufel

The Bayesian approach to feature extraction, known as factor analysis (FA), has been widely studied in machine learning to obtain a latent representation of the data. An adequate selection of the probabilities and priors of these bayesian…

Machine Learning · Statistics 2020-01-27 Carlos Sevilla-Salcedo , Vanessa Gómez-Verdejo , Pablo M. Olmos

The quasi likelihood analysis is generalized to the partial quasi likelihood analysis. Limit theorems for the quasi likelihood estimators, especially the quasi Bayesian estimator, are derived in the situation where existence of a slow…

Statistics Theory · Mathematics 2018-01-03 Nakahiro Yoshida

We discuss a method to describe the qualitative dynamics of chemical reaction networks in terms of symbolic dynamics. The method, that can be applied to mass-action reaction networks with separated timescales, uses solutions of the partial…

Molecular Networks · Quantitative Biology 2022-05-17 Aurélien Desoeuvres , Peter Szmolyan , Ovidiu Radulescu

A bialgebra is a structure which is simultaneously an algebra and a coalgebra, such that the algebraic and coalgebraic parts are "compatible". Bialgebras are normally studied over a field or commutative ring. In this paper, we show how to…

Rings and Algebras · Mathematics 2009-10-30 James Worthington

Semiclassical techniques have proven to be a very powerful method to extract physical effects from different quantum theories. Therefore, it is expected that in the near future they will play a very prominent role in the context of quantum…

General Relativity and Quantum Cosmology · Physics 2014-12-17 David Brizuela

Semiclassical instanton theory is a form of quantum transition-state theory which can be applied to computing thermal reaction rates for complex molecular systems including quantum tunneling effects. There have been a number of attempts to…

Chemical Physics · Physics 2020-10-28 Wei Fang , Pierre Winter , Jeremy O. Richardson

In the setting of stochastic dynamical systems that eventually go extinct, the quasi-stationary distributions are useful to understand the long-term behavior of a system before evanescence. For a broad class of applicable continuous-time…

Probability · Mathematics 2018-08-22 Mads Christian Hansen , Carsten Wiuf

Using the semiclassical neutral atom theory, we extend to fourth order the modified gradient expansion of the exchange energy of density functional theory. This expansion can be applied both to large atoms and solid-state problems.…

Other Condensed Matter · Physics 2016-01-26 L. A. Constantin , A. Terentjevs , F. Della Sala , P. Cortona , E. Fabiano

The modelling, specification and study of the semantics of concurrent reactive systems have been interesting research topics for many years now. The aim of this thesis is to exploit the strengths of the (co)algebraic framework in modelling…

Logic in Computer Science · Computer Science 2015-02-11 Georgiana Caltais

Weighted automata are a generalization of nondeterministic automata that associate a weight drawn from a semiring $K$ with every transition and every state. Their behaviours can be formalized either as weighted language equivalence or…

Formal Languages and Automata Theory · Computer Science 2023-06-22 Purandar Bhaduri

We consider abstract semilinear evolution equations with a time delay feedback. We show that, if the $C_0$-semigroup describing the linear part of the model is exponentially stable, then the whole system retains this good property when a…

Analysis of PDEs · Mathematics 2014-07-18 Serge Nicaise , Cristina Pignotti

Discovering pragmatic and efficient approaches to construct $\varepsilon$-approximations of quantum operators such as real (imaginary) time-evolution propagators in terms of the basic quantum operations (gates) is challenging. Prior…

Quantum Physics · Physics 2024-10-31 Yan Wang , Sarah Chehade , Eugene Dumitrescu

We propose a novel estimation approach for a general class of semi-parametric time series models where the conditional expectation is modeled through a parametric function. The proposed class of estimators is based on a Gaussian…

Methodology · Statistics 2025-07-21 Mirko Armillotta , Paolo Gorgi

We introduce semiframes (an algebraic structure) and investigate their duality with semitopologies (a topological one). Both semitopologies and semiframes are relatively recent developments, arising from a novel application of topological…

Logic in Computer Science · Computer Science 2026-02-18 Murdoch J. Gabbay

We have recently defined a weak Markovian bisimulation equivalence in an integrated-time setting, which reduces sequences of exponentially timed internal actions to individual exponentially timed internal actions having the same average…

Logic in Computer Science · Computer Science 2012-07-05 Marco Bernardo

The operational semantics of interactive systems is usually described by labeled transition systems. Abstract semantics (that is defined in terms of bisimilarity) is characterized by the final morphism in some category of coalgebras. Since…

Logic in Computer Science · Computer Science 2015-07-01 Filippo Bonchi , Ugo Montanari