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.
16401137
Complexity Analysis of a Cache Controller for Speculative Multithreading Chip Multiprocessors
Although many performance studies of memory speculation mechanisms in speculative multithreading chip multiprocessors have been reported, it is still unclear whether the mechanisms are complexity effective and worth implementing. In this paper, we perform a complexity analysis of a cache controller designed by extending an MSI controller to support thread-level memory speculation. We model and estimate the delay of the control logic on critical paths and the area overhead to hold additional control bits in the cache directory. Our analysis shows that for many protocol operations, the directory access time occupies more than half of the total delay. The total overhead is however smaller than the delay for accessing the cache tags. Since the protocol operations can be performed in parallel with the tag access, the resulting critical path latency is only slightly increased.
15548810
Improving Conditional Branch Prediction on Speculative Multithreading Architectures
Dynamic conditional branch prediction is an indispensable technique for increasing performance in modern processors. However, currently proposed schemes suffer from loss of accuracy when applied to speculative multithreading CMP architectures. In this paper, we quantitatively investigate this problem and present a hardware scheme to improve the prediction accuracy. Evaluation results show that an improvement of 1.4% in average can be achieved in SPECint95.
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
53249502
Interactive beautification: a technique for rapid geometric design
13963012
Associating Cooking Video Segments with Preparation Steps
We are trying to integrate television cooking videos with corresponding cookbooks. The cookbook has the advantage of the capability to easily browse through a cooking procedure, but understanding of actual cooking operations through written explanation is difficult. On the other hand, a video contains visual information that text cannot express sufficiently, but it lacks the ease to randomly browse through the procedures. We expect that their integration in the form of linking preparation steps (text) in a cookbook and video segments should result in complementing the drawbacks in each media. In this work, we propose a method to associate video segments with preparation steps in a supplementary cookbook by combining video structure analysis and text-based keyword matching. The result of an experiment showed high accuracy in association per video segments, i.e. annotating the video.
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.
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.
16116114
Concept and prototype of protein-ligand docking simulator with force feedback technology
A novel concept for a protein-ligand docking simulator using Virtual Reality (VR) technologies, in particular the tactile sense technology, was designed and a prototype was developed. Most conventional docking simulators are based on numerical differential calculations of the total energy between a protein and a ligand. However, the basic concept of our method differs from that of conventional simulators. Our design utilizes the force between a ligand and a protein instead of the total energy. The most characteristic function of the system is its ability to enable the user to 'touch' and sense the electrostatic potential field of a protein molecule. The user can scan the surface of a protein using a globular probe, which is given an electrostatic charge, and is controlled by a force feedback device. The electrostatic force between the protein and the probe is calculated in real time and immediately fed back into the force feedback device. The user can easily search interactively for positions where the probe is strongly attracted to the force field. Such positions can be regarded as candidate sites where functional groups of ligands corresponding to the probe can bind to the target protein. Certain limitations remain; for example, only twenty protein atoms can be used to generate the electrostatic field. Furthermore, the system can only use globular probes, preventing drug molecules or small chemical groups from being simulated. These limitations are the result of our insufficient computer resources. However, our prototype system has the potential to become a novel application method as well as being applicable to conventional VR technologies, especially to force feedback technologies.
1697193
World-wide gallery 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.