bluuebunny/crossref_metadata_2025_split huggingface dataset:
Guessing shape of a complete line drawing of a polyhedron using an heuristic tree search
Authors: Ishikawa Seiji 
Published: July 2007

AbstractThis paper describes a technique for guessing a complete line drawing of a polyhedron from an incomplete line drawing by an heuristic tree search. The heuristic tree search employs two indices which represent structural unity of shape: the ratio of the number of parallel sides to the number of all sides on a line drawing of a polyhedron; and the difference between the minimum and the maximum inner angle on a loop (a closed link of sides). A line drawing obtained from preprocessing of a picture usually contains several polyhedra. It is segmented to each line drawing which corresponds to a single polyhedron, and it is generally an incomplete line drawing. The line drawing is expressed by a set of loops, and labelling on each side of the loops refers to the position and gradient of the side. An incomplete junction is searched on the line drawing by referring to the labels. Then a complete line drawing is guessed by adding sides to the incomplete junctions so that the values of the indices increase. One might expect that the present method gives aid to the recognition of an object given by an incomplete line drawing. An experimental result is given and some problems are discussed.
High‐resolution algorithm for fan beam‐CT system
Authors: Horiba Isao , Yanaka Shigenobu , Iwata Akira , Suzumura Nobuo 
Published: July 2007

AbstractThe X‐ray CT has a high resolution with respect to the absorption coefficient, while its spatial resolution is inferior to other X‐ray imaging techniques. Consequently, the improvement of its spatial resolution is strongly desired. This paper theoretically analyzes the frequency component of the projection data, obtained by the third‐generation CT system using a wide‐angle fan beam. It is shown that the projection data contain the effective frequency component above the Nyquist frequency determined by the spacing between detectors. Then a new algorithm is proposed which utilizes that effective frequency component. The usefulness of the algorithm is examined by an experiment using a phantom and the human body. It is shown as a result that the new algorithm can realize spatial resolution corresponding to approximately twice the Nyquist frequency determined by the detector spacing. Using this algorithm, the spatial resolution of the CT image can be improved without decreasing the detector spacing.
Architectural evaluation of a universal host computer munap
Authors: Yamazaki Katsuhiro , Kanai Hiroyuki , Baba Takanobu , Okuda Kenzo 
Published: July 2007

AbstractThis paper describes the architectural evaluation of a universal host computer MUNAP in terms of: (1) nonnumerical capability; (ii) multiprocessor parallelism; and (iii) flexibility of the two‐level microprogramming scheme, based on the experimental results.The findings of the dynamic evaluation are summarized as follows.(i) The divide and concatenate unit is especially useful for decoding machine instructions and manipulating tags in high‐level language machines so that the number of execution steps is decreased 30–40 percent. The bit operation unit is useful for numerical processing which frequently utilizes priority encoding. This provides a reduction in execution steps of 15 percent. In the shuffle exchange network, 16, 32, and 48‐bit circular shifts and broadcasts are used effectively for data transfers between processor units and serial operations.(ii) The average numbers of active processor units are 3.6 ‐ 3.8 for such numerical computations as Fast Fourier Transform, and 2.1 to 2.5 for emulations of a wide variety of high‐level languages.(iii) In the two‐level microprogramming scheme, the allocation ratio of the nanoprogram memory increases due to word size optimization of nanoprogram memory so that 80 ‐ 90 percent of it is used for large‐scale microprograms.
Realization method of totally shelf—Checking error checking and correcting circuits for main memory systems
Authors: Shinmori Shuichi , Hoda Masaaki , Koga Yoshiaki 
Published: July 2007

AbstractThis paper proposes a realization method for totally self‐checking ECC (Error Correcting and Checking) circuits using SEC‐DED (Single‐Error‐Correcting and Double‐Errors‐Detecting) codes. The methods of constructing self‐checking ECC circuits are divided into two categories: the method of constructing them as a whole; and the method of adding a redundant circuit for each functional circuit. Up to now, the former conventional method has had such problems as the number of gates being too large and the fault‐detectability being insufficient. These problems can be solved by adding one checker circuit for the ECC circuits in this paper. First, we design the new odd‐weight‐column H‐matrix which has the ability of SEC‐DED codes. Then the syndrome generator, the syndrome decoder, and one parity tree checker circuit are constructed based on this H‐matrix. Furthermore, this proposed method can distinguish a stuck‐at fault in ECC circuits from errors in the main memory. The increasing rate of gates to realize totally self‐checking ECC circuits is about 37 to 56% for the information‐bit length k = 16‐64 bits. This is smaller by about 5% than the best method of adding redundant circuit for each functional circuit.
D‐SSQ: A queueing network simulator with parallel execution control
Authors: Sato Kei , Nakanishi Hikaru , Sanada Hidehiko , Tezuka Yoshikazu 
Published: July 2007

AbstractThis paper discusses a node‐distributed parallel‐processing event‐driven queueing network simulator, called D‐SSQ. It employs the advanced execution control, aiming at the effective utilization of the parallelism inherent in the queueing network. The advanced control works as follows. Each processor first works ignoring the restrictions from other processors. If a contradiction is detected by manifesting the effects of other processors through the interprocessor communication, the contradiction is dissolved by partially cancelling the results of the previous processing. The processing performance of D‐SSQ was examined by an experimental system and by the simulation using a large‐scale computer. It is observed that the processing capability increases linearly with the number of processors, but does not increase as rapidly as was expected because of the large overhead in the distribution and the ineffective processing by the excessive advance control. Consequently, a restricted advance control has been considered, aiming at the elimination of the excessive advanced operation. It is indicated that the processing performance can be improved and there exists an optimum value for the extent of advanced operation.
An adaptive routing method for computer networks by electric‐circuit modeling
Authors: Oba Nobuyuki , Nakamura Tadao , Shigei Yoshiharu 
Published: July 2007

AbstractThe computer network and multiprocessor system have been developed and studied. They are based on a network composed of nodes containing processors, aiming at the improvement of performance by distributed processing as well as the improvement of reliability by resource distribution. To realize high system performance, adequate routing and flow controls are required in the communication of information among nodes. This paper proposes a new routing control scheme to be used in the packet communication in the computer network or multiprocessor system. The scheme is called potential routing, which models the computer network by an electric circuit, and the packet routing from the source node to the destination node is performed to the potential difference between the adjacent nodes. The node potential is determined first by Kirchhoff's law and is modified dynamically according to the traffic situation during the routing procedure, providing an adequate criterion for the routing. The proposed scheme has a feature in that ping‐pong and loop phenomena, which cause traffic congestion, are not produced in principle. It was verified by simulation that the transmission delay is reduced when the traffic is high or unbalanced.
An identification method of closed regions between line drawings using motion analysis
Authors: Nagao Tomoharu , Agui Takeshi , Nakajima Masayuki 
Published: July 2007

AbstractIn the construction of the animation drawing of people and animals using a computer, a drastic reduction of human effort will be realized by automating the painting process. This paper describes an automatic painting method in which the closed region in two consecutive line drawings containing more than one closed region can be identified by motion analysis. For each point on the contour of the closed region in the line drawing, the deformation vector representing the deformation of the closed region and the motion vector representing the motion of the closed region, are defined. The sum of the products of the lengths of the formation vector and the motion vector over the whole closed region, is regarded as the magnitude of the motion of that closed region. A large number of different motions can be conceived of for the closed region from frame to frame, and the principle is set that the most probable motion among the possible motions is the one which minimizes the sum of the motions of the closed regions. Based on this principle, the closed region is identified by determining the motion of the closed region between the two line drawings. This paper describes the algorithm of the proposed method and the result of application to the actual animation.
A real‐time image processing algorithm for visual inspection of semiconductor wafer patterns
Authors: Sakou Hiroshi , Yoda Haruo , Ejiri Masakazu 
Published: July 2007

AbstractThe following general requirements are made in the visual inspection of the semiconductor wafer: (1) the candidates for the defect should automatically be detected from a complex multivalued pattern; and (2) only serious defects to the reliability of the element are extracted from those candidates. Such sophisticated decisions must be made with a high reliability and a high speed. This paper proposes a method for detecting serious defects as a means to cope with those requirements. The method is composed of the following two steps.
A Word Recognition System with Speaker Adaptation Based on Nonsupervised Learning
Authors: Mizoguchi Riichiro , Kakusho Osamu , Kitano Masaaki , Nishiyama Shizuo , Fujino Norio 
Published: July 2007

AbstractLearning is one of the most important problems in the speech recognition of unspecified speakers. The authors have already proposed a set of phoneme templates and non‐supervised learning. By that method, a satisfactory result was obtained for the recognition of five Japanese vowels and ten numerals. The learning is essentially a selection of templates, and there was no positive adaptation in the sense that the template matched to each speaker is constructed. To improve further the performance of the learning it is necessary to construct the template which pertinently represents the features of the speaker. The already‐reported scheme is pointed out as unsatisfactory in the adaptation from such a viewpoint. The authors then investigated a new nonsupervised learning algorithm where the traditional learning algorithm is improved to enhance the adaptability, and the phoneme templates are constructed automatically by the nonsupervised learning with a batch processing by storing speech data. This paper discusses the two nonsupervised learning algorithms and the word recognition system containing those algorithms.
Several serializable classes in database concurrency control
Authors: Kiniwa Jin , Nishio Shojiro , Hasegawa Toshiharu 
Published: July 2007

AbstractThis paper considers several serializable classes in database concurrencey control, namely: Δ‐, τ‐, and σ‐serializable classes. It is shown that:
the DITS in a labeled directed graph (proposed by Ibaraki et al. for testing membership of σ‐serializable class) can be extended to both ϵ‐ and Δ‐serializable classes;
several proofs are given that the ϵ‐serializable class is a significant definition of concurrency control, especially in a cautious scheduler model;
the computational complexity of testing membership of ϵ‐ and Δ‐serializable classes is analyzed; and
the inclusion relationship of the preceding three serializable classes under restricted numbers of versions for several types of transaction models is investigated.
An analysis of human postural sway using differential information processing
Authors: Watanabe Yosaku , Yokoyama Kiyoko , Takata Kazuyuki 
Published: July 2007

AbstractThe upright standing posture of human beings is unstable because of the inverted pendulum characteristics of the body. The posture control function is explained in the physiology by the stretch reflexes. The functional properties of the posture control are reflected to the area of body away during standing. Such integrated information as area of body sway and length of locus of body sway is applied to the diagnosis of sensory disabilities affecting posture control and the physical education study, etc. However, there have been few reports on the differential information of body sway. The aim of this study is to propose an extraction method of differential information from the time series of the center of foot pressure (CFP) at standing using an autoregressive model. The differential information proposed here is the velocity, the acceleration, and the wave number of the time series of CFP. It describes the relation between the differential information and integrated information of body sway. The differential information is effective in evaluating the postural reflex during an upright standing task.
A method of analytic phase correction in magnetic resonance imaging and its application to blood‐flow imaging
Authors: Sano Koichi , Yokoyama Tetsuo , Sato Shinichi , Koizumi Hideaki 
Published: July 2007

AbstractThe blood‐flow measurements using nuclear magnetic resonance (NMR) signals are categorized roughly into three groups depending upon the nature of underlying information: intensity, frequency or phase. Among them, the method utilizing phase information is attracting particular attention. Since the phase is sensitive to the instrument imperfections, it has been customary to carry out image calculation with corrective image data measured separately. In this case, not only does multiple imaging require time, but image displacement due to the patient's movement comes into question. In this study, the quantitative relationship between the instrument imperfections and the phase shift of image was clarified, a corrective method was established, and the effect of a gradient magnetic field contained in the pulse sequence on a moving material was analyzed. Consequently, it has become possible to determine the velocity of blood flow perpendicular to the cross section with single scan. Finally, the experimental results of velocity measurement using the blood‐flow phantom was compared with the results of simulation.
A process of understanding sentences and use of knowledge
Authors: Itoh Yukihiro , Ohara Hiroyoshi , Shibata Shougo , Tachibana Hirofumi , Shimada You , Takagi Akira 
Published: July 2007

AbstractThe study of how sentences written in natural language are understood includes very important problems in examining human intelligence. At present, however, these problems have not been solved in detail. This paper defines the understanding of sentences as an extraction and organization of information requested for the next intelligent act from sentences.The act of question answering based on the input sentences is used and the basic process of sentence understanding, knowledge representation for sentence understanding, and the method of application for each of these, are examined.On the basis of this examination, an experimentally developed system is reported.In this system, sentences are input one by one. First, a sentence is transferred into the semantic representation in the form of a tree structure. This structure represents the dependency relationships between words. This semantic representation is read in sequential order by the basic processes of verb and noun phrases through matching the semantic representation with the definitive knowledge of the word and the general knowledge of the word in the form of a proposition.Finally, the proper meaning of polysemic words is identified and the meanings of omitted words and phrases are inferred. Also, some of the background information necessary to sentence understanding is identified.The results of these inferences are used to construct a frame. They are then connected to the other input sentences and organized to obtain the context information.After the input sentences have been analyzed, an interrogative sentence is input into the system, the system searches for an answer by referring to the context information, generates the semantic representation of the answer, and outputs its response in Japanese.
An attribute grammar with common attributes and its evaluator in prolog
Authors: Feng An , Sugiyama Yuji , Fujii Mamoru , Torii Koji 
Published: July 2007

AbstractAttribute grammars (AGs) have been championed in the literature as a potential basis for language‐analysis systems. However, there is a well‐known copy rule problem, that is, 50–70 percent of semantic rules within an AG are copy rules. In this paper, we introduce common attributes into AGs. Common attributes provide a solution to the copy rule problem, reducing copy rules to only about 10 percent. The semantics of common attributes are defined by translating them into synthesized attributes and inherited attributes. The value of these derived attributes are copied from left to right if not defined explicitly. Based on the extended attribute grammar, we have developed a specification language, named PANDA. A prototype system has been constructed to generate Prolog programs from PANDA programs automatically. Our current system is limited to process PANDA programs which belong to L‐attribute grammar (L‐AGs), a subclass of AGs. For a givn grammar G, a necessary and sufficient condition is used to determine whether or not G is an L‐AG. Some optimization strategies are applied to generate faster‐running Prolog programs.
Perspective angle transform—shape from angle
Authors: Shakunaga Takeshi , Kaneko Hiroshi 
Published: July 2007

AbstractThis paper derives the perspective angle transform as a relation between the angle in the three‐dimensional space and its perspective projection. The properties of the transform are discussed, together with its application to the scene interpretation. As the initial step, the first perspective moving coordinate is defined anew, and based on that coordinate, the primary form of the perspective angle transform is derived as a relation composed of three variables. Then the relation is arranged in the coordinate, which is determined only by the apparent angle, and the general form of the perspective angle transform is derived. It is shown that the transform is equivalent to determining the fourth‐order curve on the image. Finally, a problem is considered in which the gradient information should be recovered for three segments separated in the three‐dimensional space. An algebraic solution is shown. The solution is determined using the concept of virtual intersection and the perspective angle transform, based on the perspective moving coordinateMost of this work is based on the prediction at CVPR '86, provided that the perspective projection is discussedmore strictly.
.
Separation and storage method for the elements of map image and the experimental system
Authors: Kameyama Wataru , Oka Hideyuki , Tominaga Hideyoshi 
Published: July 2007

AbstractThis paper aims at a system which receives the image information of a commercially available map, separates the information according to their categories, and stores the information so that re‐editing is possible. Algorithms are proposed by which the map information given as the input image is separated with the least intervention of human operation, and only the incomplete points are indicated by the human observation. An evaluation of the algorithms is presented. In the past, various algorithms have been proposed for the image separation. In this work, an experimental system was constructed to demonstrate the feasibility of constructing the actual system. By the proposed algorithm, most of the characters, roads, coastlines, railways and boundary lines were separated from the black‐and‐white map. The information compression for storage and indexing for retrieval are also performed. The data storage method is discussed. Finally, the map output of the system is described, and several examples of output maps are presented.
PROFIER: A prolog‐based support system for developing picture recognition program
Authors: Endo Tsutomu 
Published: July 2007

AbstractThis paper introduces a Prolog‐based support system for use in developing a picture recognition program. Earlier, an image recognition program was introduced using such items as cigarette packages, tableware, etc. However, because of the disadvantages of that program, a new one was necessitated.Prolog and Lisp, languages designed for use in artificial intelligence, are more suitable for use in high‐level processing, e.g., image recognition and understanding. However, Prolog shows greater potential for use in writing routines in the recognition process. But Prolog is not very effective in handling numerical calculations involving large amounts of two‐dimensional images. As a result, Prolog systems are examined herein that have been developed using additional features that allow for implementation of other languages and databases.Here, the PROFIER (PROlog system with Fortran as Image analyzER) system is described. In this system, the knowledge and control structures are written in Prolog, and for raw data processing and image feature extraction, processes that are difficult to handle with Prolog, the system is expanded for programming in FORTRAN. The configuration and characteristics of PROFIER are described, and the performance is evaluated.
A prolog machine based on vlsi algorithms
Authors: Shobatake Yasuro , Aiso Hideo 
Published: July 2007

AbstractThis paper proposes a Prolog direct executer called PMV‐2. To alleviate the von Neumann bottleneck, PMV‐2 is provided with a number of processing elements, each of which stores a term symbol. Using the processing elements, the operations for terms can be executed in parallel. To simplify the algorithm for mapping the tree‐structured data onto processing elements, data are represented by a format called symbol‐line expression. Tree‐structured data with this expression are mapped onto an array which has straight‐line arrangement for processing elements. The configuration of the tree‐structured data on the processing element array can be modified using the methods called Partial Global Communication and Partial Shift. To implement a large number of processing elements, PMV‐2 is constructed based on the VLSI algorithms. A performance evaluation has been made, revealing that the processing speed of approximately 450 kLips is obtained by PMV‐2, which is nearly the same as that of a presently available high‐speed Prolog system with a compiler.