This article rst argues that formalisations of the frame prob lem should have certain desirable logical features it then pro poses a treatment of the frame problem using linear logic to gether with modal operators which ful ls these desiderata and seems to be successful in other respects

The unit commitment prob lem in a power generation system com prising thermal and pumped storage hy dro units is addressed A large scale mixed integer optimization model for unit commitment in a real power system is de veloped and solved by primal and dual ap proaches Both solution methods employ state of the art algorithms and software Results of test runs are reported

The sites of insertion of the transposable kanamycin-neomycin resistance-determining element, Tn5, in the E. coli K-12 chromosome were assessed in a collection of over 300 auxotrophs. Although mutations in at least 45 different cistrons were obtained, the distribution of insertion sites was not completely random: proA or proB; cysG; and cysH, cysD or cysC mutants were found in excess.

With the growing importance of cloud computing, database encryption has become a critical technology to protect data against honest-but-curious attackers. Our goal is to encrypt the data in such a way that it remains protected against powerful attackers and at the same time achieve good performance by processing queries in the cloud without decrypting the data. Order-Preserving Encryption (OPE)...

Abstract We obtain series expansions of the q -scale functions arbitrary spectrally negative Lévy processes, including processes with infinite jump activity, and use these to derive various new examples explicit functions. Moreover, we study smoothness properties activity. This complements previous results Chan et al. ( Prob. Theory Relat. Fields 150 , 2011) for Gaussian component or bounded va...

We introduce a framework which is based on probabilistic Description logics (Prob-DL), to represent and solve multi-criteria discrete alternative problems by calculating expected utility. To our knowledge, this is the first ever approach for calculating expected utility using a Description logics based formalism.

We develop a clear connection between deFinetti’s theorem for exchangeable arrays (work of Aldous–Hoover–Kallenberg) and the emerging area of graph limits (work of Lovász and many coauthors). Along the way, we translate the graph theory into more classical prob-

This paper describes the synebronous clock dktrfbution prob Iem in VLSI and techniques for its solution. In particular, a bierarcbicat design technique for minimizing clock skew within a VLSI circuit and its relative advantages and disadvantages is discussed. In addition, a model for clock distribution networks which considers the effects of dktributed interconnect impedances on clock skew is d...

The least common subsumer (lcs) w.r.t general EL-TBoxes does not need to exists in general due to cyclic axioms. In this paper we present an algorithm for computing role-depth bounded EL-lcs based on the completion algorithm for EL. We extend this computation algorithm to a recently introduced probabilistic variant of EL: Prob-EL.