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.
16966520
Algorithm and performance evaluation of adaptive multidimensional clustering technique
This paper proposes the multldlmenslonal cluster lng technique called GKD-tree method which IS fully adaptive to both of tuple and query dlstrlbutlons The method 1s bdsed on the theoretical analysis of the performance of multldlmensional clustermg Its algorithm and perIormance are described It IS shown that GKD tree method can largely reduce the average number of page acccs~cs bar scvc~al dlstrrbullons Its behavior IS analyzed and the modlhcatlon to the algorithm IS suggested to further improve the performance GKD tree method was frst developed as the physical database or ganlzatlon of the relatIona database machine GRACE Ihe lmplementatron Issues of GKD-tree method m the database machine are also discussed
8980471
Compilation of dictionaries for semantic attribute analysis of television news captions
With the increase in the amount of video that is broadcast daily, there is an increasing need for storage of video in a systematic way for future reuse and retrieval. In particular, from the viewpoint of importance and usability, it is desirable to index news videos. For adequate automatic indexing based on the text information in the video, it is not sufficient to apply the simple index extraction and annotation methods which have been widely used in conventional methods. It is important to select index candidates with reference to semantic attributes. The purpose of this study is to compile dictionaries which are needed for analyzing the semantic attributes of captions (noun phrases) in TV news videos. We describe the process by which words are extracted from text corpora and a thesaurus for storage on the basis of specified conditions. The quality of the dictionaries is examined by analysis of the semantic attributes of the words appearing in actual news videos, and the results are presented. In evaluation experiments in which an existing proper noun dictionary and temporal noun dictionary were combined and used, a recall of 79 to 93% and a precision of 41 to 71% were obtained. Although the precision is low in this result, it is concluded that the compiled dictionaries are of practical use for indexing since the recall is more important in that case. © 2003 Wiley Periodicals, Inc. Syst Comp Jpn, 34(12): 32–44, 2003; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.10417
53244865
Plantio: an interactive pot to augment plants' expressions
This paper introduces an interactive pot called "Plantio" which realizes hybridization between plants and electronic computing system. The goal for this research is to create an intimate relationship between human and plants. Plantio represents plants' biopotentials changed by surroundings, and it makes various expressions according to daily interactions with human. Plantios' representation begins to have individuality as it interacts with users and environments.
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.
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.
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.
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.