bluuebunny/crossref_metadata_2025_split huggingface dataset:
Realization of computers using programmable logic units
Authors: Yamada Hidekazu , Nakamura Tadao , Shigei Yoshiharu , Murayama Takahiko , Yoshioka Yoshio 
Published: July 2007

AbstractA key to speeding up the processing is how to realize the programmable hardware using both a pipelined processing scheme and a multiprocessor processing scheme for such special hardware as the fast Fourier transform (FFT) unit and the digital filter. This paper proposes a structure for the programmable logic unit (PLU) based on such an idea, where the computing program is mapped on the hardware, and the processing is performed by write/read of the operand data. For the computer using the proposed PLU, three kinds of conceivable processing algorithms are presented. On the other hand, considering the number of pins, the regularity of the circuits, and the recent progress in three‐dimensional VLSI technology, it is highly conceivable that the proposed PLU is realized by VLSI. Thus, from the viewpoint of program execution in the computer using PLU, the program is constructed of the instructions computed by the PLU and the control instructions executed by the main CPU, and the processing mechanism is described using a program example. A discussion is made on the processing time, and it is shown that the computer using the PLU can utilize the parallelism of the computation by PLU to reduce the processing time, compared with the computer not using PLU. Thus, the effectiveness of the computer using PLU is demonstrated.
Performance evaluation of a computer using programmable logic units
Authors: Murayama Takahiko , Yamada Hidekazu , Nakamura Tadao , Shigei Yoshiharu , Yoshioka Yoshio 
Published: July 2007

AbstractThe programmable logic unit (PLU) has been proposed to realize a high‐speed operation. The idea is to perform computation obtained by a static data flow scheme using the stepwise arithmetic logics distributed in the memory. This paper describes the configuration of the prototype PLU, the basic concepts of the computation and the synchronization between the PLU and the main control unit (CU). Then theoretical discussions are made on the computation time for the arithmetic and the iterative programs. It is shown that the high‐speed processing is realized by the effects of the parallel computation and of the pipelined computation, mapping many templates of a loop program on the PLU. Furthermore, the multiprogramming for the computer with PLU is proposed to utilize effectively the waiting time for the computation in the PLU. The throughput improvement is indicated by theoertical analysis, comparing the computer using PLU with the traditional sequential computer. Finally, the usefulness of the PLU is demonstrated.
A method for extracting marked regions from document images
Authors: Hase Masahiko , Suzuki Gen , Itoh Hisayasu 
Published: July 2007

AbstractA method of document management in the electronic filing is considered, where the abstract is prepared, filed and retrieved for each document. This paper discusses a method of preparing an abstract from the document image. A method is proposed in which the region marked by the user with a felt‐tip color‐pen, etc., is extracted automatically and filed. The features of the method are as follows: (1) in the extraction of the marked region from the marked document image, the difference of reflectivities between the background (white) and the marked region in the document is utilized; (2) to determine the position of the mark, the algorithm based on the peripheral distribution using the integration of pixels is employed from the viewpoint of speed and accuracy; (3) in the compression to extract only the marked region, a processing to replace n n pixels by a pixel is applied, from the viewpoint of hardware implementation and speed.
Definition of gazing point for picture analysis and its applications
Authors: Yamada Mitsuho , Fukuda Tadahiko 
Published: July 2007

AbstractThe authors have been analyzing images by eye movement. For this purpose, it is necessary to decompose the eye movement into a component to accept information from a gazed object and a component to shift the gazing point. The point considered in the foregoing is called the gazing point, which is defined in this paper based on the property of the pursuit eye movement. Eye movement velocity of 5 deg/s is used as the threshold to separate the two components. As a result, it is made possible to separate clearly the eye movement into the gazing point component and the shift between the gazing point. A vision analyzer based on this definition of the gazing point was developed, which can analyze comprehensively the eye movement in real‐time. As an example of the application of the vision analyzer, the difference of the eye movement in watching the VDT image and the usual dynamic picture is analyzed. Furthermore, as an application to the analysis of art, an experiment was made as a reference material for the analysis of Sharaku's ukiyo‐e painting. The results of experiments are described, indicating that the definition of the gazing point is adequate.
A class of ambiguous linear term‐rewriting systems on which call‐by‐need is a normalizing reduction strategy
Authors: Naoi Tohru , Yamashita Masafumi , Ibaraki Toshihide , Honda Namio 
Published: July 2007

AbstractThe term‐rewriting system is of a recent concern, since there can be various applications, including the execution mechanism for the programming language based on the equality. However, in its application there must be a normalizing reduction strategy, which ensures that the normal form can always be reached if the given term has a normal form. Huet and Lévy proposed the call‐by‐need strategy as a normalizing reduction strategy for unambiguous linear term‐rewriting systems. This paper extends their result to the case containing ambiguity. A sufficient condition is shown first for the call‐by‐need in a linear term‐rewriting system containing ambiguity to be a normalizing reduction strategy. The condition properly includes the result of Huet and Lévy. Then considering an arbitrary linear term‐rewriting system, in which the call‐by‐need is a normalizing reduction strategy, a condition is presented under which a new rewriting rule can be added, while retaining the properties. Combining the result with the previous result, a wider class of ambiguous term‐rewriting system is obtained in which the call‐by‐need is a normalizing reduction strategy.
A method of constructing large‐scale program processor for 8‐bit system utilizing memory mapping feature
Authors: Tsuji Tatsuo , Kontani Kazuto , Watanabe Katsumasa , Sumiya Mitsuaki 
Published: July 2007

AbstractThere is a technique which executes efficiently multitask processing utilizing the memory‐mapping function of the memory management LSI (MMU). The technique is now being established even at the level of the 8‐bit processor. However, there exists a limitation on the size of the process in the 8‐bit processor. If a mid‐sized program is written by a high‐level language, this limit often is exceeded by the program size including the data area. To the best of the author's knowledge, there has not been presented a language processing system containing MMU, which can handle a large‐scale program without considering the limit for the address space, as far as the physical memory permits. The mapping function of MMU has been considered aiming largely at the mutual protection of the processes in the multitask processing. To utilize this function for the foregoing situation, a study is needed for new scheme both at the OS level and at the language processing level. This paper considers language C which has a high modularity among procedures (functions), and newly proposes a large‐scale program processing system overcoming the limitation of the address space. A measurement is made on the implemented system, and it is shown that the increase of the production code and the decrease of the execution speed is within the permissible range, compared with the usual processing system.
A generalized condition for designing a measuring system of color images and its application
Authors: Tominaga Shoji 
Published: July 2007

AbstractThis paper derives a general condition for image sensors in the design of color image measuring systems. An application example to a drum scanner is presented. Heretofore, the measurement of color image has been restricted to the three‐sensor system for R, G and B. However, it is difficult, to realize a highly accurate color measurement using only three sensors, for such actual color input devices as a drum scanner. From such a viewpoint, this paper proposes an improvement of the color measuring performance by increasing the number of sensors. First, a theoretical analysis is presented for the color measuring system using the vector analysis technique, and the basic conditions for the image sensor are derived. The discussion starts from the formulation of the basic property of the color‐matching in the visual system. The problem is formulated by requesting that the measuring system should realize the equivalent characteristics. This viewpoint leads to a natural condition. In other words, the spectral response curves of the visual system should be represented as linear combinations of the spectral response curves of the image sensors. Then, a practical condition is presented using the CIE color‐matching function. The computation method for the determination of the spectral response curves of the sensors is presented based on the least‐square technique. As an application example, a drum scanner with four sensors for B/W, R, G and B is discussed. The spectral response curves are determined by adjusting the color filter, and the performance of the system is examined experimentally on the color specification system.
A method of recognizing three‐dimensional position of a rigid body using its shape‐formulation of the problem and its solution by an iteration method
Authors: Hayashi Toyohiko , Iijima Taizo 
Published: July 2007

AbstractIn the problem of estimating three‐dimensional positions of a rigid body from projection data of marked points fixed set to it onto a two‐dimensional plane. We propose a method using positional relations among the marked points.To estimate the positions of the marked points by optical measurement, multiple projection data are generally used at each point. In measuring multiple points attached on a rigid body, it is possible to estimate three‐dimensional positions of the points from only a single projection datum at each point, if the position of each point on the rigid body is known. In this paper, the problem formulated is of three marked points (the least necessary number to estimate the position of a rigid body). The solution is given by an iterative approximation.Furthermore, the relation between the measurement method and the convergence of the iterative approximation is analyzed. Observation is best obtained from this point of view. An instrument to measure three‐dimensional movement of the human jaw is introduced.
A method for recognizing three‐dimensional position of a rigid body using its shape. error analysis and an optimization of observation system
Authors: Hayashi Toyohiko , Iijima Taizo 
Published: July 2007

AbstractIn the problem of measuring three‐dimensional positions and motion of a rigid body, methods to determine the three‐dimensional position from its optical projection data on a two‐dimensional plane have been widely used. We have proposed a method using positional relations among the marked points and applied it to three‐dimensional movement measurement of the human law.If the positions of three marked points on a rigid body are known, measuring these positions requires only one projection datum at each point to determine the three‐dimensional position of the points, since the degree of freedom of a rigid body is six. A previous paper presented formulation of the problem in general form, its solution and theoretical analysis of stability of solution, as well as observation method.This paper analyzes the effect of error associated with measurement on estimating the position of marked points at implementation. Error propagation equations are derived effective for design of measuring instruments. The optimum measuring method is obtained from the viewpoint of error propagation using the result.
A method of reconstructing 3D mountainous shapes from contours
Authors: Agui Takeshi , Miyata Kazunori , Nakajima Masayuki 
Published: July 2007

AbstractIn general, the shapes of mountains, shore lines, clouds and other natural features are irregular and difficult to define. Furthermore, the conventional (noncompressed) method of storing 3‐dimensional (3D) data of such natural features requires a very large storage space. There is a need to automatically extract key features of natural figures for data compression and accurate reconstruction of the figures.This paper proposes a reconstruction method for 3D mountainous shapes from feature points of contour lines. First, a method for extracting a model of mountainous shape will be described. Then a reconstruction method based on the model will be discussed. The proposed method is applicable for the generation of a database of background scene for computer animation.
Design of micropower CMOS quaternary memory circuits
Authors: Zukeran Chotei , Afuso Chushin , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractIn a previous paper the authors proposed a pass transistor network composed of PMOS and NMOS transistors with different threshold voltages, which were realized by a multilevel ion‐implant technique. As a result, any quaternary logic system could be implemented. In the quaternary CMOS make‐break operator circuit, which is the basic cell of the network, the steady‐state current is essentially zero and therefore micro‐power quaternary combinational circuits can be implemented.In this paper, a micropower quaternary D‐latch circuit is designed using quaternary CMOS make‐break operator circuits. Then using the D‐latch circuit as a unit, a quaternary master‐slave flip‐flop and an up‐down T‐flip‐flop circuit are designed. Computer simulation for these circuits with SPICE‐2 confirmed their correct operation with low power dissipation. The power dissipation during the transient increases in proportion to the operating frequency. Also, a quaternary maximal‐length sequence generator is designed as an application.
A limb‐function discrimination method using EMG signals for the control of multifunctional powered prostheses
Authors: Tsuji Toshio , Ito Koji , Nagamachi Mitsuo 
Published: July 2007

AbstractThis paper describes a method to estimate the motion intended by an amputee from his EMG symbols. This is one of the important abilities to be provided by the amputee‐prosthesis interface within the multifunctional powered prosthesis. To make the interface easy for the amputee to use, the measurement of EMG should be simplified as much as possible. Up to now, the function discrimination by the surface EMG has been employed, where a particular muscle must be specified for the EMG electrode. This imposes a restriction in the electrode placement, and restricts the function discrimination ability. From such a viewpoint, this study aims at the development of the discrimination method, where the electrode locations are made flexible by utilizing the cross‐information among the electrodes as well as the amplitude and frequency characteristics of the EMG. The method proposed is a combination of the multidimensional AR model and the discriminant function. It is shown by the experiment for 3 subjects and 4 electrode locations that the proposed method can discriminate, with the accuracy above 93 percent, 6 motions of forearm and hand, using 4 pairs of electrodes and EMG for 100 ms after motion generation. Thus, the discrimination proposed in this paper can simplify the electrode placement, and realize a high discriminating ability.
Numerical study for increasing high‐temperature regions in hyperthermia with ferromagnetic seed implants
Authors: Kobayashi Hiroaki , Amemiya Yoshifumi 
Published: July 2007

AbstractFerromagnetic seed implants can be used to produce hyperthermia in the treatment of tumors. Because high‐temperature regions are very limited with one ferromagnetic needle, it is necessary to implant many needles in order to obtain adequate regions for treatment. We will prove numerically that sufficient high‐temperature regions can be obtained with fewer implants by applying additional heat (e. g., increasing tissue and blood temperature by 3°C). As a scale of heated area, Matloubieh et al. used the standard deviation of temperature rise at each point in the tumor cross‐section (two‐dimensional) to compute temperature distributions. However, we computed them by using the ratio between a section of a tumor and that portion which had a temperature over °C [we call this the High‐temperature Area Ratio (H. A. R.)]. Subsequently, we obtained an H. A. R. of 94 percent with 3°C additional heat by using six implants spaced circularly 8 mm from the center of a 2‐cm‐diameter tumor; however, the ratio was only 16 percent without additional heat.
Reduction of the crosstalk noise with the guard‐shielding
Authors: Schibuya Noboru , Sakamoto Toshio , Takagi Haruo , Kumamoto Kayoko 
Published: July 2007

AbstractWith the recent trends of high‐density packing of electronic circuits and higher‐degree of integration, cross talks between signal lines have become a problem. This paper describes the effect of guard‐shielding on the reduction of crosstalk noises. In relation to the development of our noise evaluation system for printed circuit boards NESSY, the effect of the guard‐shielding was examined by dividing the circuit substrate so that capacitance and inductance of each division is calculated, and by simulating them with a partial element equivalent network. The results were compared with the results of experiments carried out under the same conditions. The experiments and simulations show that: the effect of the guard‐shield depends greatly on the condition of the termination resistances and the termination conditions of the shield; the guard‐shield is effective in reducing the crosstalk noises (e.g., the noise reduces to half even with a thin shield line of the order of 0.1 mm set between the signal lines); it is necessary to ground the shield line at more than two points, since a guard‐line with a single grounding point sometimes even increases the noise.
A real‐time measurement system to evaluate image sharpness for CRT display
Authors: Isono Haruo 
Published: July 2007

AbstractIt is necessary to display clearly characters and figures in addition to ordinary pictures, for CRT displays of computer terminals and high‐definition televisions (HDTV). Among the factors constituting image quality of CRTs, image sharpness is important. This paper proposes a method of objective evaluation of the image sharpness of CRT displays, and describes a real‐time image‐sharpness evaluation system based on this method. In the system, the spatial‐frequency characteristics of the whole CRT display are measured quickly using a microprocessor. Then the value of the sharpness under given objective conditions is calculated using both the data observed and a mathematical model of a human‐visual system. It was confirmed that the image‐sharpness of TV‐receivers measured by this evaluation system agrees well with subjective evaluations. The proposed system provides a practical method of evaluating or predicting the image‐sharpness of CRT displays.
A synthesis method of systolic algorithms for nested loop programs
Authors: Miura Daisuke , Aso Hirotomo , Inagaki Yasuyoshi 
Published: July 2007

AbstractThe development of VLSI technology makes possible the implementation of systolic algorithms as silicon chips are placed in many operational cells arranged in an array. This paper describes a synthesis method of systolic algorithms for problems whose solving procedures are described by a certain kind of nested loop program. A systolic algorithm is specified by a geometry of systolic array, function of processing cells, and timing of data streams flowing among the cells. The synthesis method provides a systematic function of cells and timing of data streams for a given geometry of systolic arrays so that computation procedures of a loop program are executed in parallel. The algorithm obtained is represented not by a heuristic expression, but by a procedure description language. The nested loop programs to be designed by the synthesis method include such matrix manipulations as multiplication, addition and LU decomposition, and also such basic operations in the relational algebra as selection, join, and sorting, all of which are demonstrated.
Dynamic scene analysis for a mobile robot in a man‐machine environment
Authors: Yagi Yasushi , Asada Minoru , Yachida Masahiko , Tsuji Saburo 
Published: July 2007

AbstractThis paper describes a method by which a moving robot with vision can recognize the environment and behave in a proper way by analyzing the consecutive images taken during movement in an artificial environment such as a building or plant. In this paper, the environment is assumed as a corridor in a building. The following two general features of the corridor are used as the premises for the image analysis: (1) the wall of the corridor is planar and is perpendicular to the floor; (2) the floor is flat. Since it is difficult to determine simultaneously the five three‐dimensional motion parameters, a method proposed in this paper determines successively the parameters by partitioning them into the rotation and translation components. The rotation is determined based on such points in the image as vanishing point and infinity point, which are not affected by the translation. Then the translation is determined from the optical flow and the rotation. The position information in the corridor is determined further. The proposed method features versatility since it does not employ the geometrical model represented by numerical values, utilizing only the properties valid in most of the artificial environment. An experiment is made in the corridor of a building.
Fast processing of an object‐oriented language by a low‐level parallel computer munap
Authors: Doi Hideru , Yamazaki Katsuhiro , Ookawa Shousaku , Baba Takanobu , Okuda Kenzo 
Published: July 2007

AbstractSince bytecodes in Smalltalk‐80 are designed for stack machines, stack operations occupy half the total operations so that it is difficult to find low‐level parallelism. To perform fast processing with low‐level parallelism, we not only designed high‐level intermediate codes (I‐codes) which correspond to message passings on a one‐to‐one basis, but also introduced routines for determining multiple‐object pointers in parallel. We have developed both an I‐codes interpreter and a bytecodes interpreter on a low‐level parallel computer MUNAP and evaluated them.The results show that:
the static number of I‐codes is close to that of bytecodes, but I‐codes halved the number of dynamic execution steps of bytecodes;
the number of dynamic execution steps for basic cycles decreased from 30 percent for bytecodes to 17 percent for I‐codes so that the number of total execution steps was decreased 19 percent;
the number of execution steps for determining object pointers was decreased 12 percent because 69 percent of the object pointers were determined in parallel; and
compared with a single processor using bytecodes, the number of execution steps was 0.56 for bytecodes and 0.47 for I‐codes on MUNAP.