22552433
Relational Algebra Machine GRACE
Most of the data base machines proposed so far which adopts a filter processor as their basic unit show poor performance for the heavy load operation such as join and projection etc., while they can process the light load operations such as selection and update for which a full scan of a file suffices. These machines which incorporates n processors takes it O(N*M/n) time to execute join of two relations whose cardinalities are N and M respectively.
45986079
An object-oriented distributed system integrating multimedia resources
A distributed system is introduced which provides extensible as well as integrated environments for users and applications programs to access and combine distributed resources conveniently. The system is based on the concept of object-oriented service bases. Distributed resources are abstracted as objects containing the metainformation of the resources. A service base in each node is constructed to manage these objects. There are three layered views (external, conceptual, and internal) of objects. A service base can be seen as a software package built on an existing operating system to provide mapping from the external view of objects to the internal view to realize transparency and to absorb heterogeneity and different media types. The modeling and an implementation of this distributed system are presented.<<ETX>>
1022632
Compiler-Assisted Thread Level Control Speculation
This paper proposes two compiler-assisted techniques to improve thread level control speculation in speculative multithreading executions. The first technique is to increase the overall speculation accuracy by identifying threads which have exactly one successor whose address is statically determinable. The successors of these threads are then predicted using a small full associative buffer, reducing the requirement for entry in the original path-based thread predictor. The second technique is to insert information to enable early validation of thread level control speculation and to reduce the mispeculation penalty. The combination of the two techniques achieved 5.8% performance improvement on average for SPEC95int benchmark.
17734187
Multimedia Integration for Cooking Video Indexing
We have been working on the integration of video with supplementary documents, such as cooking programs. We propose an integration system that performs semantic segmentations of video and text and associates them together. This association is realized using the ordinal restriction of the recipe, cooccurrences of words in the text and the audio in the video, and the relation between the background in a video and words which describe the situation in a text. In this paper, we will introduce the result of an evaluation experiment and show the effectiveness of the proposed integration method. Through our method, many applications should become possible, such as a cooking navigation software.
11871042
Automatic Video Indexing Based on Shot Classification
Automatic indexing to video data is in strong demand to cope with the increasing amount. We propose an automatic indexing method for television news video, which indexes to shots considering the correspondence of image contents and semantic attributes of keywords. This is realized by first, (1) classifying shots by graphical feature, and (2) analyzing semantic attributes of accompanying captions. Next, keywords are selectively indexed to shots according to appropriate correspondence of typical shot classes and semantic attributes of keywords. The method was applied to 75 minutes of actual news video, and resulted in indexing successfully to approximately 50% of the typical shots (60% of the shots were classified as typical), and 80% of the typical shots where captions existed.
12308968
A Static Load Partitioning Method based on Execution Profile for Committed Choice Languages
18242995
Design patterns for pseudo-3D photo collage
"Pseudo-3D Photo Collage", one of new wed3D techniques, is based on multiple photographs and Spatial-Hyperlinks. A user can design various patterns of HyperPhoto-Networks, for example, linear, loop, tree, grid, rhizome and so on. It is similar to design a website based on HyperText-Networks. We propose several design patterns and those applications to create highly-designed virtual sequences.
15764303
Improving Back-Transliteration by Combining Information Sources
Transliterating words and names from one language to another is a frequent and highly productive phenomenon. Transliteration is information loosing since important distinctions are not preserved in the process. Hence, automatically converting transliterated words back into their original form is a real challenge. However, due to wide applicability in MT and CLIR, it is a computationally interesting problem. Previously proposed back-transliteration methods are based either on phoneme modeling or grapheme modeling across languages. In this paper, we propose a new method, combining the two models in order to enhance the back–transliterations of words transliterated in Japanese. Our experiments show that the resulting system outperforms single-model systems.
1841722
A New Algorithm for Analysis of Within-Host HIV-1 Evolution
A new algorithm for inferring the evolution of within-host viral sequences is presented. A sequential-linking approach is developed so that a longitudinal phylogenetic tree can be reconstructed from sequential molecular data that are obtained at different time points from the same host. The algorithm employs a codon-based model, which uses a Markov process to describe substitutions between codons, to calculate nonsynonymous and synonymous substitution rates and to distinguish positive selection and neutral evolution. The algorithm is applied to a data set of the V3 region of the HIV-1 envelope genes sequenced at different years after the infection of a single patient. The results suggest that this algorithm may provide a more realistic description of viral evolution than traditional evolutionary models, because it accounts for both neutral and adaptive evolution, and reconstructs a longitudinal phylogenetic tree that describes the dynamic process of viral evolution.
31805728
Interval priorities in AHP by interval regression analysis
Abstract This paper proposes an interval approach for obtaining interval weights of priorities in the analytic hierarchy process (AHP) reflecting inconsistency of pairwise comparison ratios given by a decision maker. Even if pairwise comparison values with respect to preference are given as crisp values, the priority weights should be estimated as intervals because of a decision maker's uncertainty of judgments. We deal with two types of comparison matrices represented as crisp and interval elements. This allows some uncertainty of estimations made by a decision maker. The proposed approach can obtain the estimated interval priorities. Since interval regression analysis is based on the concept of possibility, the interval weights obtained by the proposed method can be interpreted as the possible ranges estimated from the given data. The sum of widths of the obtained intervals can be regarded as the degree of inconsistency included in the given data. It is emphasized that interval data of preference can obtain the lower and upper models for the estimated weight intervals.
13465014
Topology Selection in Unrooted Molecular Phylogenetic Tree By Minimum Model-Based Complexity Method
In reconstruction of phylogenetic trees from molecular data, it has been pointed out that multifurcate phylogenetic trees are difficult to be correctly reconstructed by the conventional methods like maximum likelihood method(ML). In order to resolve this problem, we have been engaged in developing a new phylogenetic tree reconstruction method, based on the minimum complexity principle widely used in the inductive inference. Our method, which we call "minimum model-based complexity (MBC) method", has been proved so far to be efficient in estimating multifurcate branching when the tree is described in the form of rooted one. In this study, we make further investigations about the efficiency of MBC method in estimating the multifurcation in unrooted phylogenetic trees. To do so, we conduct computer simulation in which the estimations by MBC method are compared with those by ML, AIC and statistical test approach. The results show that MBC method also provides good estimations even in the case of multifurcate unrooted trees and suggest that it could be generally used for reconstruction of phylogenetic tree having arbitrary multifurcations.