29360261
Towards Abstracting Complex Database Objects: Generalization, Reduction and Unification of Set-type Objects (Extended Abstract)
Representing and manipulating complex (database) objects are important issues in the semantic database models and object-oriented database models, most of which have a rich expressive power for complex objects. In this paper, we will focus on the manipulation of complex objects, and introduce the notions and the operations for abstracting complex objects. We introduce the notion of "element-based" generalization relationships between complex objects, and two new abstraction operators: reduction and unification. Their algebraic properties are then formally investigated especially for "set-type" complex objects.
22236580
OVID: Design and Implementation of a Video-Object Database System
A video-object data model and the design and implementation of a prototype video-object database system named OVID based on the model are described. Notable features of the video-object data model are a mechanism to share common descriptional data among video-objects, called interval-inclusion based inheritance, and operations to composite video-objects. The OVID system offers a browsing/inspection tool called VideoChart, and adhoc query facility called VideoSQL, and a video-object definition tool. >
46335278
Tree-Structured Data Organization with Consecutive Retrieval Property
COMP2011 Aleksandar Ignjatovic 2005 c 2 Figure 1: A medieval copy of arguably the most influential textbook ever written, Eu-clid's Elements (Στoι χε´ια), from about 300 BC. It contains the oldest known algorithm recorded, Euclid's algorithm for computing the Greatest Common Divisor (GCD) of two natural numbers. Figure 2: First data structures: a Mesopotamian cuneiform tablet from about 3000 BC with an inventory list. Preface This booklet is not meant to be a textbook, but only a companion to the textbook that we use in this course, Cormen, Leiserson, Rivest and Stein's Introduction to Algorithms, the second edition. Its purpose is to help you read the appropriate sections of the textbook, and integrate it better with the rest of the course. It also adds a number of exercises not present in the textbook. Please read the textbook and do not rely on this supplement only.
18193868
Interval Queries on Object Histories: Extended Abstract
This extended abstract introduces the notion of ’ interval queries ’ on historical data for objects (here, called ‘object histories’) and explores a certain closure property. As for describing historical data for objects, we use our mathematical model introduced in our earlier paper. The major construct in the model is a ‘computation-tuple sequence scheme’ (abbreviated CSS), which specifies the set of all possible ‘valid’ object histories for the same type of object. Interval queries are those queries which return an interval (history) from a given object history. We provide conditions under which an interval query applied to object histories described by one CSS yields, as its answers. the set of all object histories which can be described by another CSS.
32965529
Interval Queries on Object Histories
Abstract The present paper introduces the notion of “interval queries” on object histories and explores a certain closure property. In particular, conditions are provided under which an interval query applied to object histories described by one “computational-tuple sequence scheme” (CSS) yields, as its answer, the set of all object histories which can be described by another CSS.
5408151
Alternative Objects in Object-oriented Databases
26636790
TWISTER: an immersive autostereoscopic display
This paper describes in detail the design, development, and evaluation of the TWISTER III (Telexistence Wide-angle Immersive STEReoscope) and demonstrates how this system can display immersive three-dimensional full-color and live motion pictures without the need for special eye-wear. The device works as a cylindrical display by rotating 30 display units around an observer and presenting time-varying patterns, while immersive autostereoscopic vision is achieved by employing a "rotating parallax barrier" method. After explaining the principle, we discuss the designs and implementations for maximum performance in various aspects of the display. We also evaluate the display.
28024409
The Concept of Memory-Based Thread Execution by Highly Functional Memory Controller
3247078
Individual Level Analysis Using Decision Making Features in Multiagent Based Simulation
We introduce a set of evaluation tools in the framework of individual level analysis for multiagent based simulations. These tools are intended to overcome the weak points of multiagent systems: that it is difficult to avoid mistakes in description and arbitrary modeling; and to find reliable explanations of causal relationships between the model and its result. We analyze some artificial market models using an evaluation process that consists of the evaluation of initial learning maturity, discrimination between models, and the visualization of attention tendency in a group. We conclude that these analytical methods are useful for the evaluation of multiagent based simulations in terms of validation and finding causal relations.
18847598
A method for panoramic stereo image acquisition
One of the key technologies for one-to-many visual communication is panoramic stereo, in which stereoscopic images for arbitrary horizontal directions are presented to multiple users, according to their positions and postures. In this paper, one of the methods for capturing panoramic stereo motion pictures is proposed and evaluated, along with an experimentation. Through preliminary experimentation, we have confirmed the effectiveness of methods using a curved mirror.
35660731
Some Properties of Fuzzy Sets of Type 2
The concept of fuzzy sets of type 2 has been defined by L. A. Zadeh as an extension of ordinary fuzzy sets. The fuzzy set of type 2 can be characterized by a fuzzy membership function the grade (or fuzzy grade) of which is a fuzzy set in the unit interval [0, 1] rather than a point in [0, 1]. This paper investigates the algebraic structures of fuzzy grades under the operations of join ⊔, meet ⊔, and negation ┐ which are defined by using the extension principle, and shows that convex fuzzy grades form a commutative semiring and normal convex fuzzy grades form a distributive lattice under ⊔ and ⊓. Moreover, the algebraic properties of fuzzy grades under the operations and which are slightly different from ⊔ and ⊓, respectively, are briefly discussed.