In this paper, we further develop the coordination control scheme for discrete-event systems based on the Ramadge-Wonham framework. The notions of conditional decomposability, conditional controllability, and conditional closedness are revised and simplified, supremal conditionally controllable sublanguages of general non-prefix-closed languages are discussed, and a procedure for the computatio...

A general notion of algebraic conditional plausibility measures is deened. Probability measures, ranking functions, possibility measures, and (under the appropriate deenitions) sets of probability measures can all be viewed as deening algebraic conditional plausibility measures. It is shown that algebraic conditional plausibility measures can be represented using Bayesian networks.

A bstract Gluon amplitudes at most-subleading order in the 1 /N expansion share a remarkable simplicity with graviton amplitudes: collinear divergences are completely absent both and, as consequence, their full IR behavior arises from soft gluon/graviton exchange among external states. In this paper we study effect of all-loop celestial color gluon and similarities gravity case. particular, sim...

in this paper the conditional location problem is discussed. conditional location problems have a wide range of applications in location science. a new meta-heuristic algorithm for solving conditional p-median problems is proposed and results are compared to those of the previous studies. this algorithm produces much better results than the previous formulations.

A key question in conditional planning is: how many, and which of the possible execution failures should be planned for? One cannot, in general, plan for all the possible failures because the search space is too large. One cannot ignore all the possible failures, or one will fail to produce sufficiently flexible plans. In this paper, we describe an approach to conditional planning that attempts...

We present three attacks on the Prime Power RSA with modulus N = pq. In the first attack, we consider a public exponent e satisfying an equation ex − φ(N)y = z where φ(N) = pr−1(p − 1)(q − 1). We show that one can factor N if the parameters |x| and |z| satisfy |xz| < N r(r−1) (r+1)2 thereby extending the recent results of Sakar [16]. In the second attack, we consider two public exponents e1 and...