Search results for "PROBA"

Rejoinder on: Natural Induction: An Objective Bayesian Approach

2009

Giron and Moreno. We certainly agree with Professors Giron and Moreno on the interest in sensitivity of any Bayesian result to changes in the prior. That said, we also consider of considerable pragmatic importance to be able to single out a unique, particular prior which may reasonably be proposed as the reference prior for the problem under study, in the sense that the corresponding posterior of the quantity of interest could be routinely used in practice when no useful prior information is available or acceptable. This is precisely what we have tried to do for the twin problems of the rule of succession and the law of natural induction. The discussants consider the limiting binomial versi…

Nonstochastic languages as projections of 2-tape quasideterministic languages

1998

A language L (n) of n-tuples of words which is recognized by a n-tape rational finite-probabilistic automaton with probability 1-e, for arbitrary e > 0, is called quasideterministic. It is proved in [Fr 81], that each rational stochastic language is a projection of a quasideterministic language L (n) of n-tuples of words. Had projections of quasideterministic languages on one tape always been rational stochastic languages, we would have a good characterization of the class of the rational stochastic languages. However we prove the opposite in this paper. A two-tape quasideterministic language exists, the projection of which on the first tape is a nonstochastic language.

Multi-letter reversible and quantum finite automata

2007

The regular language (a+b)*a (the words in alphabet {a, b} having a as the last letter) is at the moment a classical example of a language not recognizable by a one-way quantum finite automaton (QFA). Up to now, there have been introduced many different models of QFAs, with increasing capabilities, but none of them can cope with this language. We introduce a new, quite simple modification of the QFA model (actually even a deterministic reversible FA model) which is able to recognize this language. We also completely characterise the set of languages recognizable by the new model FAs, by finding a "forbidden construction" whose presence or absence in the minimal deterministic (not necessaril…

A note on quarkonial systems and multilevel partition of unity methods

2013

We discuss the connection between the theory of quarkonial decompositions for function spaces developed by Hans Triebel, and the multilevel partition of unity method. The central result is an alternative approach to the stability of quarkonial decompositions in Besov spaces , s > n(1/p − 1)+, which leads to relaxed decay assumptions on the elements of a quarkonial system as the monomial degree grows.

A probabilistic Weitzenböck formula on Riemannian path space

2000

Notes on certain p-valent functions

2019

Abstract Let Ap be the class of functions f(z) which are analytic in the open unit disk U. Applying some subordinations for functions, some interesting properties for f(z) ∈Ap are showed. Our results are generalizations for results given before.

Basic Measure Theory

2020

In this chapter, we lay the measure theoretic foundations of probability theory. We introduce the classes of sets (semirings, rings, algebras, σ-algebras) that allow for a systematic treatment of events and random observations. Using the measure extension theorem, we construct measures, in particular probability measures on σ-algebras. Finally, we define random variables as measurable maps and study the σ-algebras generated by certain maps.

The Dynamical Problem for a Non Self-adjoint Hamiltonian

2012

After a compact overview of the standard mathematical presentations of the formalism of quantum mechanics using the language of C*- algebras and/or the language of Hilbert spaces we turn attention to the possible use of the language of Krein spaces.I n the context of the so-called three-Hilbert-space scenario involving the so-called PT-symmetric or quasi- Hermitian quantum models a few recent results are reviewed from this point of view, with particular focus on the quantum dynamics in the Schrodinger and Heisenberg representations.

Elementary Action Systems

2015

This chapter expounds basic notions. An elementary action system is a triple consisting of the set of states, the transition relation between states, and a family of binary relations defined on the set of states. The elements of this family are called atomic actions. Each pair of states belonging to an atomic action is a possible performance of this action. This purely extensional understanding of atomic actions is close to dynamic logic. Compound actions are defined as sets of finite sequences of atomic actions. Thus compound actions are regarded as languages over the alphabet whose elements are atomic actions. This chapter is concerned with the problem of performability of actions and the…

Analysis of a database to predict the result of allergy testing in vivo in patients with chronic nasal symptoms and the development of the software A…

2014

Background. This thesis consist of parts(i)Introduction in wich we present the clinical problem of rhinitis;(ii)the methods to evaluate the diagnostic choises;(iii)the rational errors in Allergy,(iv)the experimental part of thesis with wich we developed the software ARTSTAT,wich is the application of the analysis reported.Objective: We studied the ability of the logistic regression model obtained by the evaluaqtion of a database, to detect patients with positive allergy skin prick test(SPT)and patients with negative SPT. The model developed was valitated using the data set obtained from another medical institution. Methods: The analysis was carried out using a database obtained from a quest…