18924219
Computation-tuple sequences and object histories
A record-based, algebraically-oriented model is introduced for describing data for “object histories” (with computation), such as checking accounts, credit card accounts, taxes, schedules, and so on. The model consists of sequences of computation tuples defined by a computation-tuple sequence scheme (CSS). The CSS has three major features (in addition to input data): computation (involving previous computation tuples), “uniform” constraints (whose satisfaction by a computation-tuple sequence u implies satisfaction by every interval of u), and specific sequences with which to start the valid computation-tuple sequences. A special type of CSS, called “local,” is singled out for its relative simplicity in maintaining the validity of a computation-tuple sequence. A necessary and sufficient condition for a CSS to be equivalent to at least one local CSS is given. Finally, the notion of “local bisimulatability” is introduced for regarding two CSS as conveying the same information, and two results on local bisimulatability in connection with local CSS are established.
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
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.
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. >
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.
15731243
TORNADO: omnistereo video imaging with rotating optics
One of the key techniques for vision-based communication is omnidirectional stereo (omnistereo) imaging, in which stereoscopic images for an arbitrary horizontal direction are captured and presented according to the viewing direction of the observer. Although omnistereo models have been surveyed in several studies, few omnistereo sensors have actually been implemented. In this paper, a practical method for capturing omnistereo video sequences using rotating optics is proposed and evaluated. The rotating optics system consists of prism sheets, circular or linear polarizing films, and a hyperboloidal mirror. This system has two different modes of operation with regard to the separation of images for the left and right eyes. In the high-speed shutter mode, images are separated using postimage processing, while, in the low-speed shutter mode, the image separation is completed by optics. By capturing actual images, we confirmed the effectiveness of the methods.
120935286
Automatic hyperparameter estimation in probabilistic image restoration algorithm based on Gibbs microcanonical distribution
For an original image given as an 8-gray-level image, the framework for image restoration is composed of Bayes statistics for the a priori probability distribution based on the microcanonical distribution. In this process, the a priori probability distribution serving as the microcanonical distribution is formulated on the basis of the variables characterizing the spatial flatness and smoothness of the image in terms of the number of nearest pixel pairs with different gray levels and the number of nearest pixel pairs with gray levels differing by 1. In the present paper, we propose a new method of estimation, from a degraded image, of the number of nearest pixel pairs with different gray levels and the number of nearest pixel pairs with gray levels differing by 1 in the original image. Then, based on that formulation, an iterative computation algorithm for the restoration of a 256-gray-level image is presented from the viewpoint of statistical mechanics. Through some numerical experiments, we investigate how the proposed method can improve the quality of the restored image. © 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 36(1): 68–78, 2005; Published online in Wiley InterScience (). DOI 10.1002sscj.10365
7133208
Statistical Learning Procedure in Loopy Belief Propagation for Probabilistic Image Processing
We give a fast and practical algorithm for statistical learning hyperparameters from observable data in probabilistic image processing, which is based on Gaussian graphical model and maximum likelihood estimation. Although hyperparameters in the probabilistic model are determined so as to maximize a marginal likelihood, a practical algorithm is described for the EM algorithm with the loopy belief propagation which is one of approximate inference algorithms in artificial intelligence
7016005
Non standard Analysis in WKL0
Within a weak subsystem of second-order arithmetic WKL0, we develop basic part of non-standard analysis up to the Peano existence theorem.