.................................................................................................................................. iii ACKNOWLEDGMENTS ............................................................................................................. iv TABLE OF CONTENTS................................................................................................................ v L...

This paper introduces the other papers in this issue, describing and arguing for the context in which they were written – a conference that was, unusually, based in conversation rather than reporting through the presentation of papers: and a refereeing process that continued after the initial presentation (at the conference) of the work reported, thus allowing responses to critical comments. Ma...

summing the Boltzmann factor over all spin configurations {si}. The enumeration of all configurations cannot be done for d ≥ 3, and although possible in d = 2 is extremely hard there as well (a problem solved by Onsager). We will use an approximate solution technique known as mean field theory. Last term we solved the problem of noninteracting spins in a magnetic field described by the Hamilton...

Results from analyzing the curvature of a surface can be used to improve the implementation, e ciency, and e ectiveness of manufacturing and visualization of sculptured surfaces. In this paper, we develop a robust method using hybrid symbolic and numeric operators to create trimmed surfaces each of which is solely convex, concave, or saddle and partitions the original surface. The same method i...

We introduce a new class of second-order cover inequalities whose members are generally stronger than the classical knapsack cover inequalities that are commonly used to enhance the performance of branch-and-cut methods for 0–1 integer programming problems. These inequalities result by focusing attention on a single knapsack constraint in addition to an inequality that bounds the sum of all var...

where F : T × R → CK(R) is a set-valued map and g : T × T → R is a single-valued continuous map (CK(R) denotes the set of nonempty, closed, and convex subsets of R). In Section 3 some general existence principles for inclusions (1.1) are derived by using fixed point theory discussed in [1]. In Section 4 we present a specific function g such that y is a solution of (1.1) if and only if y is a so...

Program synthesis is the automated construction of software from a specification. While program synthesis is undecidable in general, we show that synthesising finite-state programs is NEXPTIMEcomplete. We then present a fully automatic, sound and complete algorithm for synthesising C programs from a specification written in C. Our approach uses a combination of bounded model checking, explicit-...