1726106
Defaults in Domain Theory
Abstract This paper uses ideas from artificial intelligence to show how default notions can be defined over Scott domains. We combine these ideas with ideas arising in domain theory to shed some light on the properties of nonmonotonicity in a general model-theoretic setting. We consider in particular a notion of default nonmonotonic entailment between prime open sets in the Scott topology of a domain. We investigate in what ways this notion obeys the so-called laws of cautious monotony and cautious cut , proposed by Gabbay, Kraus, Lehmann, and Magidor. Our notion of nonmonotonic entailment does not necessarily satisfy cautious monotony, but does satisfy cautious cut. In fact, we show that any reasonable notion of nonmonotonic entailment on prime opens over a Scott domain, satisfying in particular the law of cautious cut, can be concretely represented using our notion of default entailment. We also give a variety of sufficient conditions for defaults to induce cumulative entailments, those satisfying cautious monotony. In particular, we show that defaults with unique extensions are a representation of cumulative nonmonotonic entailment. Furthermore, a simple characterization is given for those default sets which determine unique extensions in coherent domains. Finally, a characterization is given for Scott domains in which default entailment must be cumulative. This is the class of daisy domains ; it is shown to be cartesian closed, a purely domain-theoretic result.
39256502
Bifinite Chu Spaces
This paper studies colimits of sequences of finite Chu spaces and their ramifications. We consider three base categories of Chu spaces: the generic Chu spaces (C), the extensional Chu spaces (E), and the biextensional Chu spaces (B). The main results are: (1) a characterization of monics in each of the three categories; (2) existence (or the lack thereof) of colimits and a characterization of finite objects in each of the corresponding categories using monomorphisms/injections (denoted as iC, iE, and iB, respectively); (3) a formulation of bifinite Chu spaces with respect to iC; (4) the existence of universal, homogeneous Chu spaces in this category. Unanticipated results driving this development include the fact that: (a) in C, a morphism (f, g) is monic iff f is injective and g is surjective while for E and B, (f, g) is monic iff f is injective (but g is not necessarily surjective); (b) while colimits always exist in iE, it is not the case for iC and iB; (c) not all finite Chu spaces (considered set-theoretically) are finite objects in their categories. This study opens up opportunities for further investigations into recursively defined Chu spaces, as well as constructive models of linear logic.
2346481
The End of Pumping?
15122247
Some Monoidal Closed Categories of Stable Domains and Event Structures
This paper introduces the following new constructions on stable domains and event structures: the tensor product; the linear function space; and the exponential. These give rise to a monoidal closed category of dI-domains and to stable event structures, which can be used to interpret intuitionistic linear logic. Finally, the usefulness of the category of stable event structures for modeling concurrency and its relation to other models are discussed.
7914535
Stereoscopic Video Synthesis from a Monocular Video
This paper presents an automatic and robust approach to synthesize stereoscopic videos from ordinary monocular videos acquired by commodity video cameras. Instead of recovering the depth map, the proposed method synthesizes the binocular parallax in stereoscopic video directly from the motion parallax in monocular video, The synthesis is formulated as an optimization problem via introducing a cost function of the stereoscopic effects, the similarity, and the smoothness constraints. The optimization selects the most suitable frames in the input video for generating the stereoscopic video frames. With the optimized selection, convincing and smooth stereoscopic video can be synthesized even by simple constant-depth warping. No user interaction is required. We demonstrate the visually plausible results obtained given the input clips acquired by ordinary handheld video camera.
7172030
Information-theoretic inequalities for contoured probability distributions
We show that for a special class of probability distributions that we call contoured distributions, information-theoretic invariants and inequalities are equivalent to geometric invariants and inequalities of bodies in Euclidean space associated with the distributions. Using this, we obtain characterizations of contoured distributions with extremal Shannon and Renyi entropy. We also obtain a new reverse information-theoretic inequality for contoured distributions.
42909091
Combining path relinking and genetic algorithms for the multiple-level warehouse layout problem
Path relinking is a method to generate new solution by exploring trajectories that connect high quality solutions. In this paper, a class of new hybrid heuristics are proposed by combining a genetic algorithm and path relinking and applying these to a multiple-level warehouse layout problem. Parallel and series combinations to integrate crossover and mutation operations of a genetic algorithm with path relinking are investigated. We proposed position and sequence based path relinking methods to connect two solutions, which are either elites or ones selected randomly. Extensive experiments are carried out to compare the performance of the new heuristics.
36095353
Extremal Regular Graphs with Prescribed Odd Girth
The odd girth of a graph G gives the length of a shortest odd cycle in G. Let ?(k, g) denote the smallest n such that there exists a k-regular graph of order n and odd girth g. It is known that ?(k, g) ? kg/2 and that ?(k, g) = kg/2 if k is even. The exact values of ?(k, g) are also known if k = 3 or g = 5. Let ?x?e denote the smallest even integer no less than x, ?(g) = (?1)g ? 1/2, and s(k) = min {p + q | k = pq, where p and q are both positive integers}. It is proved that if k ? 5 and g ? 7 are both odd, then formula] with the exception that ?(5, 7) = 20.
38503566
Pseudo-one-factorizations of regular graphs of odd order - II. products of graphs
Abstract We study the pseudo-one-factorization of regular graphs of odd order. It is shown that some classes of products (including composition and cartesian product) of graphs are pseudo-one- factorizable. In particular, we prove that a complete regular t -partite graph of odd order has this property.