31763326
A file organization suitable for relational database operations
In this paper, a new access method called Relational Inverted Structure(RIS) supporting relational database operations efficiently is introduced.
5408151
Alternative Objects in Object-oriented Databases
205099974
Organization of quasi-consecutive retrieval files
Abstract In 1972, Ghosh introduced the consecutive retrieval (CR) file organization. It is an efficient file organization in which all records pertinent to a query are consecutively stored on linear storage locations. In this paper, we introduce the quasi-consecutive retrieval (QCR) file organization. The QCR file organization is an extension of Ghosh's CR file organization and normally offers less redundancy. In the QCR file, all the records pertinent to each query are not necessarily stored consecutively, but rather they are stored within an area of the buffer size. In this paper, we discuss graph theoretic properties of CR files and QCR files by using the properties of interval graphs well known in graph theory. We provide a basic condition for the existence of a QCR file without redundancy for a given buffer size. By introducing redundant queries, such a condition is simplified. Furthermore, a heuristic computer algorithm is given to organize a QCR file with less redundancy for a given buffer size.
1810071
Testing of Join Dependency Preserving by a Modified Chase Method
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.
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.
119404260
Probabilistic image processing based on the Q-Ising model by means of the mean-field method and loopy belief propagation
The framework is presented of Bayesian image restoration for multi-valued images by means of the Q-Ising model. Hyper parameters in the probabilistic model are determined so as to maximize the marginal likelihood. Practical algorithms are described based the conventional mean-field approximation and loopy belief propagation. We compare the results empirically with those provided by conventional filters and the new methods are found to be superior.
8895020
The strong soundness theorem for real closed fields and Hilbert’s Nullstellensatz in second order arithmetic
Abstract.By RCA0, we denote a subsystem of second order arithmetic based on Δ01 comprehension and Δ01 induction. We show within this system that the real number system R satisfies all the theorems (possibly with non-standard length) of the theory of real closed fields under an appropriate truth definition. This enables us to develop linear algebra and polynomial ring theory over real and complex numbers, so that we particularly obtain Hilbert’s Nullstellensatz in RCA0.
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.
16332479
Preferential Urn Model on a Random Network
A preferential urn model on a random network and a complete graph is studied. The preferential urn model is based on the concept "the rich get richer", and has simple dynamics of ball-transfers. The model is considered as a simple socio-economic system. From analytical treatments, it has been revealed that the preferential urn model on the complete graph gives a fat-tailed occupation distribution in the case with randomness for fitness parameters. In the present paper, using numerical experiments, we show that the model on the random network gives a fat-tailed occupation distribution in the case without randomness for fitness parameters; hence, we would consider that the local ball-transfer process on the random network includes effects corresponding to the randomness for fitness parameters. This simple game would give a valuable insight into various phenomena from socio-economic point of view
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.