Quantum general relativity may be considered as generally covariant QFT on differentiable manifolds, without any a priori metric structure. The kinematically covariance group acts by general diffeomorphisms on the manifold and by automorphisms on the isotonic net of ∗-algebras encoding the QFT, while the algebra of observables is covariant under the dynamical subgroup of the general diffeomorph...

We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an arbitrary system, it converges for many practical examples, including pipelined processors. We give a new formal definition of convergence that generalizes previously stated criteria. We also give a sound semidecision pro...

We discuss how to describe the Markov chain underlying a generalized stochastic Petri net using Kronecker operators on smaller matrices. We extend previous approaches by allowing both an extensive type of marking-dependent behavior for the transitions and the presence of immediate synchronizations. The derivation of the results is thoroughly formalized, including the use of Kronecker operators ...

†We would like to thank Gurdip Bakshi, Nikunj Kapadia and Robert Tompkins for kindly sharing their data sets. We also thank seminar participants at Stanford University and Columbia University, and Steve Figlewski for comments on a previous version of this paper titled “Extending Figlewski’s option pricing formula”. The first author acknowledges partial support from the NSF via grant DMI 0447990...

Building text planning resources by hand is time-consuming and difficult. Certainly, a number of planning architectures and their accompanying plan libraries have been implemented, but while the architectures themselves may be reused in a new domain, the library of plans typically cannot. One way to address this problem is to use machine learning techniques to automate the derivation of plannin...

We study the heterotic string compactified on K3× T 2 near the line T = U , where the effective action becomes singular due to an SU(2) gauge symmetry enhancement. By ‘integrating in’ the light W± vector multiplets we derive a quantum corrected effective action which is manifestly SU(2) invariant and non-singular. This effective action is found to be consistent with a residual SL(2,Z) quantum s...

A scalable video compression algorithm was designed and implemented. Costs in efficiency and complexity currently associated with requiring scalability to be provided by a video compression algorithm are discussed. The method of Scalable Motion Compensation is presented as a means by which a more efficient scalable algorithm can be constructed at the cost of greater complexity. The design and p...

A research team made up of lecturers of the Faculty of Economics and Social Sciences of Rostock University and the Faculty of Business and Economics of Pécs University has been investigating the evolution of organisational competences needed for the economic development since 1998 with the financial support of DAAD/Hungarian Scholarship Commission (József Eötvös Public Funds) in the two countri...

The best known method for determining lower bounds on the vertex coloring number of a graph is the linear-programming column-generation technique first employed by Mehrotra and Trick in 1996. We present an implementation of the method that provides numerically safe results, independent of the floating-point accuracy of linearprogramming software. Our work includes an improved branch-and-bound a...

Under the auspices of a DAAD funded educational project, a subproject devoted to different aspects of teaching the Java programming language started several years ago. The initial intention of the subproject was to attract members of the subproject to prepare some teaching materials for teaching essentials of the Java programming language. During the last two years, some advanced Java topics ha...