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.
37771428
Some New Bounds on Single-Change Covering Designs
A single-change covering design SCD(v, k, b) on a c-set V is a sequence of b k-sets (blocks) on V that together cover every pair of elements of V at least once, such that two successive blocks have k-1 elements in common. Let f(v,k) denote the smallest b for which there exists an SCD(v, k, b). Some new upper and lower bounds for f(v,k) are given.
205118584
dI-Domains as Prime Information Systems
Abstract This paper introduces prime information systems. Prime information systems determine dI-domains and stable approximable mappings give stable functions, and vice versa. The notion of rigid embedding is captured by a subsystem relation. Under this relation, prime information systems form a complete partial order (cpo). Constructions like lifting, sum, product, and function space are proposed which induce continuous functions on the cpo. In this way recursive prime information systems can be defined using fixed point theory.
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.
15029835
Quasi-Prime Algebraic Domains
Abstract The purpose of this paper is to introduce a new class of domains called quasi-prime algebraic domains. We show that this class is a good candidate for the purpose of denotational semantics of programming languages. This is achieved by exhibiting many constructions usually needed for denotational semantics on quasi-prime algebraic domains. In the first part we motivate the notion of quasi-primes and quasi-prime algebraic domains by studying the effect of linear functions on domains that are not prime algebraic. In the second part we study categories of quasi-prime algebraic domains by representing them as irreducible information systems. We introduce a symmetric monoidal closed category of quasi-prime algebraic domains with quasi-linear functions. We show further that with the usual Scott continuous functions as morphisms, quasi-prime algebraic domains are cartesian closed. In the third part we show the existence of a saturated quasi-prime algebraic domain, and introduce a framework for solving domain equations in quasi-prime algebraic domains. It is then possible to give, for example, a model for the un-typed lambda calculus with a reflexive quasi-prime algebraic domain.
29934128
A Representation of SFP
This chapter introduces a representation of the category of SFP domains. It uses structures similar to but more general than Scott’s information systems. Distilled from Gentzen’s sequent calculi, a basic structure called a sequent structure is produced. Sequent structures determine a major part of the axioms of information systems. A category of special kind of sequent structures called the strongly finite ones is shown to be equivalent to the category of SFP domains. Constructions like the Plotkin power domain and the function space are given, as well as a complete partial order of such structures to give solutions to recursively defined systems.
2928763
GeoGrid: A Scalable Location Service Network
This paper presents GeoGrid, a geographical location service overlay network system, for providing scalable location-based services to a large and growing number of mobile users. GeoGrid is designed as a decentralized and geographical location aware overlay network and provides system-level facilities and optimizations for balancing load in the presence of node heterogeneity, dynamically moving hot-spots (location queries), and unpredictable rate of node join, departure and failure. GeoGrid uses geographical mapping of nodes to regions and geographical proximity based routing to take advantage of the similarity between physical and network proximity. Furthermore, GeoGrid exploits multiple opportunities for dynamic workload adaptation in the presence of static hotspot queries and moving hotspot queries. Its dynamic load balancing algorithms can efficiently utilize the heterogeneous capacities of end systems and balance both the location query workload and the routing workload. Our initial prototype development and experimental study demonstrate that GeoGrid can effectively reduce the workload imbalance by an order of magnitude.