The introduction of randomization into efficient computation has been one of the most fertile and usefifl ide,'~q in computer science. In cryl)tography and ,~synchronous comlmting, randomization makes possil)le t.asks that are iml)ossilfle to l)erform detcrnfinistically. For fimction coml)utation , many examples are known in which randomization allows considerable savings in resources like spac...

With a growing number of new anticoagulant/antiplatelet agents being developed, it is likely that an increasing number of patients taking these drugs will present for surgery and other procedures. A familiarity with mechanisms of action and drug interactions helps to maintain optimal patient safety in the perioperative period. Furthermore, it is crucial for anesthesiologists to remain current o...

From 09.01.05 to 14.01.05, the Dagstuhl Seminar 05021 Mathematics, Algorithms, Proofs was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results an...

Pascal’s rhombus is a variation of Pascal’s triangle in which values are computed as the sum of four terms, rather than two. It is shown that the limiting ratio of the number of ones to the number of zeros in Pascal’s rhombus, taken modulo 2, approaches zero. An asymptotic formula for the number of ones in the rhombus is also shown. c © 1999 Elsevier Science B.V. All rights reserved

Do the partial order and ortholattice operations of a quantum logic correspond to the logical implication and connectives of classical logic? Rephrased , How far might a classical understanding of quantum mechanics be, in principle, possible? A celebrated result of Kochen and Specker answers the above question in the negative. However, this answer is just one among various possible ones, not al...

This paper surveys some new tools and methods for formally verifying time performance properties of systems that satisfy timing assumptions. The techniques are potentially of practical beneet in the validation of real-time process control and communication systems. The tools and methods include nondeterministic timed automaton models, invariant assertion and simulation techniques for proving wo...

Coherence relations have usually been taken to link clauses and larger units. After arguing that some phrases can be seen as discourse units, a computational account for such phrases is presented that integrates surface-based criteria with inferential ones. This approach can be generalized to treat intra-sentential cue-phrases. Since cue-phrases are not always present, referential relations bet...

In this paper, we study the problem of "learning new compositions of words from given ones with a specific syntactic structure, e.g., A-N or V-N structures. We first cluster words according to the given compositions, then construct a cluster-based compositional frame for each word cluster, which contains both new and given compositions relevant with the words in the cluster. In contrast to othe...

Assignment problem is an important subject discussed in real physical world. We endeavor in this paper to introduce a new approach to assignment problem namely, ones assignment method, for solving a wide rang of such problems. This method offers significant advantages over similar methods, in the process, first we define the assignment matrix, then by using determinant representation we obtain ...

In this paper we consider set covering problems with a coefficient matrix almost having the consecutive ones property, i.e., in many rows of the coefficient matrix, the ones appear consecutively. If this property holds for all rows it is well known that the set covering problem can be solved efficiently. For our case of almost consecutive ones we present a reformulation exploiting the consecuti...