bluuebunny/crossref_metadata_2025_split huggingface dataset:
Evaluation of parallel ray tracing algorithm using screen space subdivision for image generation system MAGG
Authors: Kawai Toshiyuki , Ohnishi Mitsuhisa , Abeki Junichi , Ohnishi Hironobu 
Published: July 2007

AbstractTo produce a realistic image at a fast speed, a parallel graphic generator MAGG using transputers and a graphic generation software using a parallel ray tracing algorithm have been developed. A screen space subdivision is sued for the parallel processing. To avoid the limitation of a local memory due to the object data, a necessary part of the data alone is transmitted to the local memory.To avoid the reduction of the effect of the parallel processing due to the increase of the interprocessor communication, the overall object data are stored in the shared memory so that they are transmitted to the local memory at a high speed using a DMA. The load balancing is carried out by dividing the screen into many small sections, which are called subscreens and are sufficiently larger than that of the processors, and by allocating the load dynamically. This method requires an estimation of the appropriate number of subscreens before the execution. To avoid this difficulty, already allocated subscreens are redivided and reallocated.The control of the reallocation is carried out adaptively by a message exchange. The proposed method makes the distribution of the load uniform even though there are only a few small screens and the method improves both the image generation time and the parallel processing efficiency.
Restoration of shift variant blurred image estimating the parameter distribution of point‐spread function
Authors: Hashimoto Shoichi , Saito Hideo 
Published: July 2007

AbstractThis paper describes a method of restoring a position‐dependent (shift variant) blurred image by estimating the size of the blurred part and by adjusting the restoration proportionally to it. In this method, it is assumed that all blurred images are due to a defocussing of a lens system or accidental camera motion. If the point‐spread function (PSF) of the blurred point is known, the estimation of the PSF can be replaced by the estimation of its parameter distribution (consisting of the diameter of a defocussed circle and the width of the motion caused by the accidental camera motions). Then a blind deconvolution of a shift‐variant blurred image can be realized by locally applying a Wiener filter to the estimated distribution. The method was tested using computer simulated images and actual images taken by a CCD camera, both with blurred parts. The results confirm the effectiveness of the method.
Automatic process design from nonprocedural specification
Authors: Harada Minoru , Nishimurae Junichi , Nakamura Yoshiyuki 
Published: July 2007

AbstractThere are very few systems for automatic process designing despite its importance in the middle software development phase. A theory for designing a process flow depending on the functional dependency between a data item and the structure of the data was postulated and an automatic process design system ECS/P was then developed. EOS/P inputs a nonprocedural specification of business data processing, wherein the relationship between attributes of entities and associations are represented as a set of equations. These attributes are modified here by identifiers of entities and associations. These modifications may be single‐step or multistep by way of associations. The purpose of EOS/P is to generate specifications, each of which can perform the required process without storing the intermediate results in outer files. Therefore, the first EOS/P creates for each multistep modification merged files that include both the modifier entity and the modified entity; then by using these files a series of single‐step modified process specifications equivalent to the given multistep modified specification are generated. Furthermore, in this transformation, appropriate intermediate files are created when order‐clash and structure‐clash are detected in files. The finally generated specifications can be transformed automatically into COBOL programs by our previously proposed automatic module design system EOS/M and automatic programming system SPACE.
A polynomial‐time algorithm for computing characteristic strings under a set of strings
Authors: Ito Minoru , Shimizu Kuniyasu , Nakanishi Michio , Hashimoto Akihiro 
Published: July 2007

AbstractA substring of a string a1a2…an has the form ai+1ai+2…aj. The difference between two strings is the minimum number of editing steps (insertions, deletions, changes) that transform one string into the other. Let S be a finite set of strings, let T be a subset of S, and let δ be a positive integer. A δ‐characteristic string of T under S is a string that is a common substring of T and that has at least δ‐differences from any substring of any string in S ‐ T.In this paper, the following result is presented. It can be decided in O(l2 · S) time whether or not there exists a δ‐characteristic string of T under S, where l is the length of a shortest string in T, and S is the size of S. If such a string exists, then all the shortest δ‐characteristic strings of T under S can also be obtained in that time.
Optical model for motion image analysis
Authors: Mukawa Naoki 
Published: July 2007

AbstractIn previous analysis of the motion image, the existence of the light source has not particularly been considered. In this paper, the optical model describing the relations among the light source, the object and the view point is introduced. The optical flow estimation problem is discussed based on the gradient method, using the constructed model. First, the relation between the light source and the object model is described as an optical model, and the constraint inherent in the considered scene is derived. As a result, it is shown that the optical flow can be estimated with a high precision also for the scene containing a light source.It is shown that the parameter, which has been considered as a correction term for improving the precision of the optical flow, is a physical parameter indicating the geometrical relation between the light source and the object, from the standpoint of the optical model. Then, not only can the optical flow be estimated with a high precision, but also the information concerning the incident direction from the light source and the reflection coefficients of the object can be newly restored. If the scene is of a simple structure, all parameters that describe the scene, i.e., the information concerning the location of the light source, the object and the camera, as well as the information concerning the shape of the object, and the reflection coefficient of the surface of the object can be estimated. The feasibility of the scene reconstruction is investigated using the CG techniques.
Code scheduling on a superscalar processor: SARCH
Authors: Nakanishi Chikako , Ando Hideki , Machida Hirohisa , Nakaya Masao 
Published: July 2007

AbstractThis paper proposes a superscalar architecture SARCH. An efficient mechanism for exploiting instruction‐level parallelism (ILP) is required to achieve high performance on nonnumerical applications. SARCH employs boosting for speculative execution to exploit large ILP, and a branch scheme to reduce branch penalty. Although these mechanisms are realized by simple hardware, code motion beyond basic blocks by compilers is necessary. A code scheduler is developed which performs global scheduling for the boosting and the delayed branch. The performance evaluation shows that the scheduled code achieves 1.52 time performance improvement over the original code, and 1.75x speed‐up over the scalar processor.
Adaptive load balancing with bidirectional piggybacking
Authors: Watanabe Takashi , Ohta Tsuyoshi , Mizuno Tadanori , Nakanishi Hikaru 
Published: July 2007

AbstractComputer network technology is no longer experimental. Having come of age, this technology is now both practical and necessary. Downsizing of computers and open and high‐speed networks have required multimedia processing as well as traditional data processing on a networked system connected by various types of computers. However, in current network systems, users are responsible for job submission, while simultaneously considering what and where the necessary and available resources are. This will create a heavier burden in the future. A framework of load balancing with distributed dispatchers that uses an analysis of network delay and job characteristics is proposed here. Examining an adaptive load balancing scheme with bidirectional piggybacking permits basic study of this framework. First a bidirectional piggybacking is proposed that uses the results of a job as an information carrier for a remote server and that uses the request of a job as an information carrier for a local server. We also propose a load balancing scheme using bidirectional piggybacking. This scheme is then compared with other schemes on homogeneous and heterogeneous environments with and without communication delay. Finally, the reliability of piggybacked information on the arrival rate of local/remote job, communication delay, etc. are discussed. The effects of this scheme based on bidirectional piggybacking are also discussed.
Extraction of three‐dimensional structure from images of multiple viewpoints by two‐step voting
Authors: Kawato Shinjiro 
Published: July 2007

AbstractThis paper proposes a method to extract 3‐D information from images of multiple viewpoints, avoiding the problem of feature point matching which is common in stereo techniques. A straight line connecting a characteristic point in an image and the lens center (a backprojection line) goes through a real point on the object. Thus, the object space is divided into small voxels. For each backprojection line of all images, give a vote to each voxel which intersects with it and extract voxels with high score. Then they are expected to be common to many images and represent characteristic points of the object in 3‐D space.However, in actual calculation, it is not so simple. For example, there are problems of: (1) voxel size selection; (2) interference of very near points; and (3) difference of the scores caused by occlusion. (Details are mentioned later.) Problem (1) will be solved by introducing a concept that voxels are supported by images instead of backprojection lines. Problems (2) and (3) will be solved by two‐step voting: the first vote is done uniformly along the backprojection lines, and the second is done selectively based on the result of the first vote. Since the proposed voting method is not affected by the voxel size, it is possible to adopt an algorithm to begin with large voxels and divide only necessary voxels into smaller ones recursively until necessary resolution is gained. Experiments with synthesized images and actual images show validation of the method.
Logic circuit design for testability using orthonormal expansions
Authors: Takahashi Ryuichi , Nanya Takashi 
Published: July 2007

AbstractFor m‐variables logic functions, an orthonormal system of order n is defined as an n‐tuple of m‐vari‐ables logic functions where one and only one of the m‐variables logic function equals 1. Any given logic function can be expressed as a sum of products between these n‐tuple of functions and appropriate coefficients for these functions. This form is known as an orthonormal expansion. This paper deals with the fact that the orthonormal system of order n divides the input space into n disjoint subspaces. We show that this property, along with appropriate restrictions on the expansions, enables us to design four level circuits where all of the single stuck‐at faults are testable. Since the circuits based on the expansions include partial circuits for the orthonormal systems, these can be activated one by one. This is the key property that guarantees the testability of s‐a‐0 faults. On the other hand, when a test for a s‐a‐1 fault should make an element of the orthonormal system equal to 0, this input can make one and only one of the other elements equal to 1. This is key to guaranteeing the testability of s‐a‐1 faults. Expansions are carried out with appropriate restrictions considering these properties. Where there exists a coefficient that is covered by all of the other coefficients, a corresponding element is eliminated. This elimination, which can be regarded as a generalized absorption law for Boolean functions, guarantees the existence of the solution for any given set of logic functions. The number of tests for the circuit is proportional to the number of prime implicants in the expansions. These tests are generated as a byproduct during the expansions.
Generating a hierarchical aspect graph based on multiple range data
Authors: Morita Satoru , Kawashima Toshio 
Published: July 2007

AbstractThis paper proposes a method of producing an aspect graph from multiple range data. Generally, when an object is of complex shape, the search of its shape and posture become more difficult, since the number of aspects necessarily increases. To solve this problem, a hierarchical aspect graph (an expanded idea of the aspect graph) is introduced. After a projection range image has been divided into regions based on its differential geometrical features, the viewpoint space is also divided referring to the difference of topologies on the zero‐crossing surface of a scale space. Hierarchical events by which a viewpoint space is divided are obtained by analyzing changes of the topology of the differential geometrical features caused by a viewpoint and resolution at feature points. A reliable aspect graph is produced by interpolating unobserved events due to the limited data of viewpoints and resolutions. The viewpoint space is divided coarsely in its upper structure, and densely in its lower structure. This makes an efficient search of the shape, position and posture of an object based on the coarse‐to‐fine tactic. Three‐dimensional aspect graphs based on real range‐finder input data were processed. The results show the usefulness of the proposed method for identifying the shapes, positions and postures of objects and analyzing moving images.
Adaptive garbage collection and experiments for implementation
Authors: Tanaka Eiko , Tanaka Yoshio , Nakanishi Masakazu 
Published: July 2007

AbstractIn the list processing language, dynamic memory management is indispensable, and hence various methods have been proposed. In one such method, the object is discriminated according to its life, time and garbage collection (GC) is applied efficiently to the unnecessary object, based on a preset “threshold.” A problem is how the threshold should be set in order to realize the most efficient GC.This paper points out that the threshold that realizes the highest efficiency depends on the application to be executed, and proposes the technique of adaptive garbage collection (AGC). An experiment toward its implementation is reported. AGC is a kind of GC which adjusts the threshold dynamically according to memory use, so that efficient operation is realized for a variety of applications. Experiments aiming at the realization of AGC show that applications have their own pace in consuming the memory, and the optimal value of the threshold is related to that pace. It is seen also that the memory‐consuming pace of the application is related closely to the data in the interpreter, leading to the definition of the useful parameter for realizing the efficient AGC.
Model‐based object recognition using basic probability assignment
Authors: Yamane Sadaaki , Aoki Keiji , Izumi Masao , Fukunaga Kunio 
Published: July 2007

AbstractA method of object recognition is proposed based on Dempster‐Shafer theory (DS theory), which can treat the ambiguity of image data. A model based object recognition technique based on an aspect imaging method will also be proposed. The aspect imaging method recognizes a similar aspect object by comparing an input image with an aspect image of the model database.Our proposed method calculates the degree of similarity based on the DS theory instead of Bayes theory, represents an uncertainty factor of similarity as a basic probability of DS theory, and assigns a basic probability of information to be decided. The experimental results show that the proposed method is both more robust and more reliable.
Use of associative information to continuous speech recognition
Authors: Sekiguchi Yoshihiro , Shigenaga Minoru 
Published: July 2007

AbstractThe continuous speech frequently includes intervals where the utterer is “lazy” and does not exhibit a precise pronunciation. Sometimes the accurate recognition of auxiliaries, which are grammatically important, is prevented. Consequently, to recognize the continuous speech, it is necessary to make use of more intuitive information, i.e., the associative information as the human does, in addition to linguistic information such as syntax and semantics.First, this paper shows that the continuous speech contains ambiguously uttered intervals, for which the acoustic processing is difficult. Next, the human associations among the words are examined and investigated, aiming at the construction of the associative word dictionary to be utilized in the speech recognition. Using such an associative word dictionary, the association strength between words is determined, and the succeeding word is predicted. The associative information, not only the acoustic information, also is included in the recognition of the phrase.In the previous speech recognition system by the authors, the phoneme recognition rate of approximately 90 percent is required in order to achieve the sentence recognition rate of 75 percent, if the associative information is not utilized. The phoneme recognition rate of approximately 80 percent is sufficient to achieve the sentence recognition rate of 75 percent by utilizing the associative information. It is seen also in the system constructed by the authors that the acoustic information and the associative information should be utilized by the ratio of approximately 3:1, for scoring the information.
Organization of a file system using class name expressions based on a B‐tree
Authors: Hirade Motoichi , Tanaka Eiichi 
Published: July 2007

AbstractIn the search of data from a database using a key, it is desirable that, even if the input key or the key in the database is in error, and there is no exactly matched key, still the system lists similar keys or retrieve the closest key.This paper discusses the organization and manipulation of the file, where the keys similar to the input key are listed, or the closest key is retrieved. The basic idea is to combine the high efficiency of the B‐tree for the retrieve/insert/delete of the key, and the ability of the hierarchical file based on the class name expression for the similar key search. By such an elaboration, it is possible to realize the search of similar keys, which cannot be executed by the B‐tree, or insert/delete of the key, which is not considered in the hierarchical file based on the class name expression.An experiment is made by splitting the characters into two classes, i.e., a to m and n to z, and using 16,561 English words of length 6 to 10. The number of read‐outs from the secondary memory in the retrieve/insert/delete of the key is approximately 3, and the number of write‐ins into the secondary memory in insert/delete is approximately 1. The search for the similar keys requires approximately 7.3 to 8.5 times larger read‐ins compared to the search of the exact key. The retrieval rate is approximately 95 to 99 percent for a single error (substitution/insertion/missing). The efficiency of the use of the memory is approximately 70 percent.
The software on the VPP500 system
Authors: Okada Shin , Sakamoto Yoshinori , Asai Noboru 
Published: July 2007

AbstractThe VPP500 system is a commercial, distributed memory, parallel computer system based on vector parallel architecture. The software of the VPP500 system is described here. The OS is UNIX‐based, enhanced with distributed parallel features. A system that is easy to use and has high performance requires a (1) realized one‐system image; (2) pursued ultrahigh performance; and (3) enhanced operation of the system. To satisfy two fundamental requirements of a language processor system, (1) effective use of the existing program assets and (2) extraction of potential performance of hardware system, we have implemented VPP Fortran (the standard FORTRAN77 enhanced with the features of parallel processing). The various data on VPP Fortran show that the VPP500 system, which consists of hardware, OS and language processor system, has both high performance and high efficiency.
An Experiment on Shape Discrimination and Signal Detection in Octopus
Authors: Muntz W. R. A. 
Published: July 2007

Ten octopuses were trained to perform a successive discrimination between the two shapes shown in Figure I (a). After 7 days of training, when performance was significantly above chance, transfer tests were given with other shapes that were either rotations or parts of the original training shapes. At least six theories have been put forward to explain shape discrimination in the octopus, but none of these are capable of explaining the present results. The transfer tests suggest that the discrimination was performed in terms of component parts of the shapes (vertical bars projecting upwards or downwards), and their relationship to the shape as a whole (terminal or central). During successive discrimination training the general level of attack varies between animals, and fluctuates from day to day. As a result there are often more attacks on both the positive and negative shapes on some occasions than others, making it difficult to compare the levels of discrimination achieved. It is suggested that the concepts of signal detection theory can help overcome this difficulty. Attacks on the positive shape (“hits”) plotted against attacks on the negative shape (“false positives”) constitute an ROC curve from which a value of d′, independant of the general level of attack, can be obtained.
After Effect of Seen Movement: Evidence for Peripheral and Central Components
Authors: Anstis S. M. , Moulden B. P. 
Published: July 2007

Three experiments showed that the movement after-effect (MAE) contains both peripheral and central components. In Experiment I, the left eye viewed a sectored disc rotating to the left, and the right eye viewed a disc rotating to the right, on corresponding retinal areas. Result: when each eye in turn then viewed a stationary disc, the left eye saw a MAE to the right, and the right eye a MAE to the left. These MAEs must be peripheral. In Experiment II, it was arranged that the movement information was shared out between the eyes, using a ring of lights which were switched on and off to give rotating phi movement. It was arranged that each eye on its own saw a random flashing oscillation but the two eyes together saw rotation anticlockwise. Result: a clockwise MAE was seen, which must be central. In Experiment III, the switching programme was modified to arrange that now each eye on its own saw rotation clockwise, but the two eyes together saw rotation anticlockwise. Result: a clockwise MAE was seen, which must be central. (Peripheral MAEs from each eye on its own would have been anticlockwise.)