We describe a heuristic control policy for a general finite-horizon stochastic control problem, which can be used when the current process disturbance is not conditionally independent of the previous disturbances, given the current state. At each time step, we approximate the distribution of future disturbances (conditioned on what has been observed) by a product distribution with the same marg...

In this paper, we further develop the coordination control framework for discrete-event systems with both complete and partial observation. A new weaker sufficient condition for the computation of the supremal conditionally controllable sublanguage is presented. This result is then used for the computation of the supremal conditionally controllable and conditionally normal sublanguage. The pape...

Classic epistemic logic focuses on propositional knowledge expressed by “knowing that” operators. However, there are various types of knowledge used in natural language, in terms of “knowing how”, “knowing whether”, “knowing what”, and so on. In [10], Plaza proposed an intuitive know-what operator which was generalized in [16] by introducing a condition. The latter know-what operator can expres...

In this paper we investigate the notion of conditional independence and prove several information inequalities for conditionally independent random variables. Keywords— Conditionally independent random variables, common information, rate region.

V eronique Maume-Deschamps Section de Math ematiques, Universit e de Gen eve 2-4 rue du Lievre CP 240 Suisse. Abstract Let T be a measurable map on a Polish space X, let Y be a non trivial subset of X. We give conditions ensuring existence of conditionally invariant probability measures (to non absorption in Y). We also supply suucient conditions for these probability measures to be absolutely ...

Abstract We discuss robust estimation of INARCH models for count time series, where each observation conditionally on its past follows a negative binomial distribution with constant scale parameter, and the conditional mean depends linearly previous observations. develop several estimators, some them being computationally fast modifications methods moments, rather efficient maximum likelihood. ...

Let M ⊂ [n] := {0, . . . , n} and A be a family of subsets of an n element set such that |A∩B| ∈M for every A,B ∈ A. Suppose that l is the maximum number of consecutive integers contained in M and n is sufficiently large. Then |A| < min{1.62210 , 2 log 2 }. The first bound complements the previous bound of roughly (1.99)n due to Frankl and the second author [9] proved under the assumption that ...