A local proof of the Swiss Army formula of Palm calculus

1996 ◽  
Vol 33 (3) ◽  
pp. 909-914
Author(s):  
Takis Konstantopoulos

The so-called ‘Swiss Army formula', derived by Brémaud, seems to be a general purpose relation which includes all known relations of Palm calculus for stationary stochastic systems driven by point processes. The purpose of this article is to present a short, and rather intuitive, proof of the formula. The proof is based on the Ryll–Nardzewski definition of the Palm probability as a Radon-Nikodym derivative, which, in a stationary context, is equivalent to the Mecke definition.

1996 ◽  
Vol 33 (03) ◽  
pp. 909-914
Author(s):  
Takis Konstantopoulos

The so-called ‘Swiss Army formula', derived by Brémaud, seems to be a general purpose relation which includes all known relations of Palm calculus for stationary stochastic systems driven by point processes. The purpose of this article is to present a short, and rather intuitive, proof of the formula. The proof is based on the Ryll–Nardzewski definition of the Palm probability as a Radon-Nikodym derivative, which, in a stationary context, is equivalent to the Mecke definition.


2019 ◽  
Vol 36 (7) ◽  
pp. 2165-2172 ◽  
Author(s):  
F Maggioli ◽  
T Mancini ◽  
E Tronci

Abstract Motivation SBML is the most widespread language for the definition of biochemical models. Although dozens of SBML simulators are available, there is a general lack of support to the integration of SBML models within open-standard general-purpose simulation ecosystems. This hinders co-simulation and integration of SBML models within larger model networks, in order to, e.g. enable in silico clinical trials of drugs, pharmacological protocols, or engineering artefacts such as biomedical devices against Virtual Physiological Human models. Modelica is one of the most popular existing open-standard general-purpose simulation languages, supported by many simulators. Modelica models are especially suited for the definition of complex networks of heterogeneous models from virtually all application domains. Models written in Modelica (and in 100+ other languages) can be readily exported into black-box Functional Mock-Up Units (FMUs), and seamlessly co-simulated and integrated into larger model networks within open-standard language-independent simulation ecosystems. Results In order to enable SBML model integration within heterogeneous model networks, we present SBML2Modelica, a software system translating SBML models into well-structured, user-intelligible, easily modifiable Modelica models. SBML2Modelica is SBML Level 3 Version 2—compliant and succeeds on 96.47% of the SBML Test Suite Core (with a few rare, intricate and easily avoidable combinations of constructs unsupported and cleanly signalled to the user). Our experimental campaign on 613 models from the BioModels database (with up to 5438 variables) shows that the major open-source (general-purpose) Modelica and FMU simulators achieve performance comparable to state-of-the-art specialized SBML simulators. Availability and implementation SBML2Modelica is written in Java and is freely available for non-commercial use at https://bitbucket.org/mclab/sbml2modelica.


2003 ◽  
Vol 35 (02) ◽  
pp. 319-336 ◽  
Author(s):  
Ute Hahn ◽  
Eva B. Vedel Jensen ◽  
Marie-Colette van Lieshout ◽  
Linda Stougaard Nielsen

A new class of models for inhomogeneous spatial point processes is introduced. These locally scaled point processes are modifications of homogeneous template point processes, having the property that regions with different intensities differ only by a scale factor. This is achieved by replacing volume measures used in the density with locally scaled analogues defined by a location-dependent scaling function. The new approach is particularly appealing for modelling inhomogeneous Markov point processes. Distance-interaction and shot noise weighted Markov point processes are discussed in detail. It is shown that the locally scaled versions are again Markov and that locally the Papangelou conditional intensity of the new process behaves like that of a global scaling of the homogeneous process. Approximations are suggested that simplify calculation of the density, for example, in simulation. For sequential point processes, an alternative and simpler definition of local scaling is proposed.


1990 ◽  
Vol 27 (2) ◽  
pp. 376-384 ◽  
Author(s):  
Benjamin Melamed ◽  
Ward Whitt

This paper is a sequel to our previous paper investigating when arrivals see time averages (ASTA) in a stochastic model; i.e., when the steady-state distribution of an embedded sequence, obtained by observing a continuous-time stochastic process just prior to the points (arrivals) of an associated point process, coincides with the steady-state distribution of the observed process. The relation between the two distributions was also characterized when ASTA does not hold. These results were obtained using the conditional intensity of the point process given the present state of the observed process (assumed to be well defined) and basic properties of Riemann–Stieltjes integrals. Here similar results are obtained using the stochastic intensity associated with the martingale theory of point processes, as in Brémaud (1981). In the martingale framework, the ASTA result is almost an immediate consequence of the definition of a stochastic intensity. In a stationary framework, the results characterize the Palm distribution, but stationarity is not assumed here. Watanabe's (1964) martingale characterization of a Poisson process is also applied to establish a general version of anti–PASTA: if the points of the point process are appropriately generated by the observed process and the observed process is Markov with left-continuous sample paths, then ASTA implies that the point process must be Poisson.


Professor Hartree in his paper has recalled that all the essential ideas of the general-purpose calculating machines now being made are to be found in Babbage’s plans for his analytical engine. In modern times the idea of a universal calculating machine was independently introduced by Turing (1938) in connexion with a logical problem, which there is unfortunately no time to mention, and the construction of actual machines was begun independently in America, towards the end of the late war. A ‘universal’ machine is one which, when given suitable instructions, will carry out automatically any well-defined series of computations of certain specified kinds, say additions, subtractions, multiplications and divisions of integers or finite decimals. This is a rather doubtful definition, since it depends on what is meant by a ‘welldefined’ series of computations; and undoubtedly the best definition of this is ‘one that can be done by a machine ’. However, this description is not quite so circular as it may seem; for most people have a fairly clear idea of w hat processes can be done by machines specially constructed for each separate purpose. There are, for example, machines for solving sets of linear algebraic equations, for finding the prim e factors of large integers, for solving ordinary differential equations of certain types, and so on. A universal machine is a single machine which, when provided with suitable instructions, will perform any calculation that could be done by a specially constructed machine. No real machine can be truly universal because its size is limited—for example, no machine will work out π to lO 1000 places of decimals, because there is no room in the world for the working or the answer; but subject to this limitation of size, the machines now being made in America and in this country will be ‘ universal ’ —if they work a t all; that is, they will do every kind of job that can be done by special machines.


1996 ◽  
Vol 9 (4) ◽  
pp. 469-488 ◽  
Author(s):  
Marcel F. Neuts

This paper is part of a broader investigation of properties of a point process that can be identified by imagining that the process is involved in a competition for the generation of runs of events. The general purpose of that methodology is to quantify the prevalence of gaps and bursts in realizations of the process. The Markovian arrival process (MAP) is highly versatile in qualitative behavior and its analysis is numerically tractable by matrix-analytic methods. It can therefore serve well as a benchmark process in that investigation. In this paper, we consider the MAP and a regular grid competing for runs of lengths at least r1 and r2, respectively. A run of length r in one of the processes is defined as a string of r successive events occurring without an intervening event in the other process.This article is dedicated to the memory of Roland L. Dobrushin.


2012 ◽  
Vol 241-244 ◽  
pp. 284-287 ◽  
Author(s):  
Bo Xu ◽  
Li Wei Guo ◽  
Jin Song Yu

This paper centers on the software reuses of Automatic Test Systems (ATS) and the integration of test and diagnosis to reduce maintenance costs. Based on the research into the basic framework, data services, packages and definition of interfaces, we present an integrated software platform for test and diagnosis system. The platform achieves the separation between the user interface and test logic, the combination of fault modeling and diagnostic reasoning, and the integration of test and diagnosis.


2016 ◽  
Author(s):  
Tiago Rocha-Pereira ◽  
Jose A Lopes-Santos ◽  
Antonio Constantion L Martins

The need of an approach for the definition of a platform-independent medical digital library, using only open-source tools, will be described. To test the need and the success of such an approach, a library will be created, which can later be used in a larger scale as a general purpose digital medical tool, when comes the need to evaluate an image. As a first test, the library will be used in the development of a tool aimed to aid doctors in otoplasty candidates’ evaluation. This tool shall be developed and tested first on a mobile platform, so the potential of the developed library can be tested on the most adverse situation. Also, the resulting library will be license free, making easier the collaboration of others in development and integration with other software, translating in a better spread of the library in medical practice


2020 ◽  
Vol 6 (1) ◽  
pp. 20-30
Author(s):  
Natalya Bashlueva ◽  
Mariya Bashlueva

the article deals with the directions in the methodology of teaching foreign language to students of secondary schools and cadets and students of educational organizations of the Ministry of internal Affairs. The issue of the General educational role of teaching foreign languages is discussed. Attention is paid to the discussion of the point of view of some Methodists about the place and role of the theoretical and descriptive aspect of teaching. Proponents of this theory believe that this aspect is the essence of the General educational function of language teaching, and sometimes argue that it should be considered as the main content of learning and its main purpose. In the existing methodological concepts, two points deserve the sharpest criticism: the wrong understanding of the General educational meaning of foreign languages and the resulting erroneous definition of the content and essence of teaching. Ready-made signs of a language, its systems of elements and structures can and should be studied separately as the sum of phenomena and facts of language in the corresponding theoretical courses; but specific types of communicative activity are always mastered, where the "lexical", "grammatical" and "phonetic" aspects appear in an indissoluble organic unity, because not only in any act of language communication, but also in any sign of a sound language, there are both "vocabulary", "grammar", and "phonetics". From the General purpose of teaching a foreign language at school, it follows that it cannot be reduced to the development of any one type of communication activity (for example, reading or speaking), since this would unacceptably narrow the practical value of learning; the school should lay the Foundation for using all four main types: speaking, listening, reading to oneself and writing.


2021 ◽  
Vol 18 (48) ◽  
pp. 37-51
Author(s):  
Ana Halas Popović ◽  

The focus of this paper is the treatment of homonymy in selected monolingual general-purpose dictionaries of English. The aim of the analysis presented in this paper is to reveal the perception of homonymy and its lexicographic significance in the analyzed dictionaries, which involves the answer to the question whether these dictionaries mark homonymy at all, and then, if yes, the determination of the criterion used for the identification of homonymy, as well as the definition of the overall lexicographic strategy adopted by the given dictionaries in their treatment of homonymy. The results of the analysis have shown that the analyzed dictionaries do use homonymy as an organizational principle in their macrostructure. Furthermore, all these dictionaries use the semantic criterion based on mutual relatedness of senses in their identification of homonymy. However, the application of this criterion does not always produce the same outcome in the given dictionaries due to the gradient nature of semantic relatedness and various interpretations it is subject to. It has also been observed that the analyzed dictionaries do not consistently mark semantic homonymy at any cost since their gen- eral strategy in the treatment of homonymy can be defined as balancing between adequate language description and user-friendliness.


Sign in / Sign up

Export Citation Format

Share Document