bluuebunny/crossref_metadata_2025 huggingface dataset:
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

This 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

Ferromagnetic 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

With 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

It 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

The 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

This 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

Since 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.
Rough classification of handwritten characters by divide‐and‐unify method
Authors: Ejima Toshiaki , Katsuyama Yutaka , Kimura Masayuki
Published: July 2007

A new method is proposed in which all the characteristic vectors are classified into subvectors. Then a rough classification of handwritten characters is performed by unifying classification information obtained in each subvector all over again. In rough classification, “soundness” of classification and “quickness” of processing are required. To perform rough classification effectively, it is necessary to store considerable classification information in a dictionary. On the other hand, to implement processing quickly, it is necessary to decrease the amount of computation by condensing the classification information.

The method herein not only realizes efficient rough classification through decreased redundancy by condensing classification information independently for each subvector of the characteristic vector, but also realizes a sounder rough classification by unifying classification information obtained in each subvector all over again. In the classification experiments, the amount of processing could be reduced to one‐fourth or one‐fifth that in the previous method to examine all the character classes without reducing a successful classification rate; this demonstrates the effectiveness of the method.
Method of extracting car number plates by image processing
Authors: Agui Takeshi , Choi Hyung Jin , Nakajima Masayuki
Published: July 2007

This paper proposes a method of extracting regions of car number plates using a parameter‐restricted Hough transformation (PRH). The PRH algorithm, in which the range of the parameter plane is restricted, reduces the computation time and the storage capacity more effectively than the usual Hough transformation. In this method, some features of car number plates are used.
Computational complexity of the file allocation problem in distributed database systems
Authors: Yamasaki Hiroshi , Hirata Tomio , Imai Masaharu , Ibaraki Toshihide
Published: July 2007

In most studies of the optimum allocation problem of the data file in the distributed database system, access to individual files is considered independent, ignoring the relation among files. This assumption may not be appropriate in actual cases. In this paper, the expression for the query cost is simplified as long as the essential aspect of the problem is maintained. A formulation is made based on a clear distinction between the part of the file which can be considered as independent in the individual access, and the part which is not. Then for each formulation, the computational complexity in the optimum file allocation is discussed. It is shown that the problem for the former can be answered in a polynomial time, while the latter is NP‐hard.
Speed‐up algorithm of color image quantization
Authors: Agui Takeshi , Shimizu Masatomo , Nakajima Masayuki
Published: July 2007

This paper discusses the speeding‐up of the color image quantization procedure. The color image quantization aims at the most faithful representation of the original image using a limited number of colors. The color image quantization is composed of two processings which are the construction of the color table and the construction of the quantized image. In the construction of the quantized image. a method is usually employed in which the color of each pixel is compared with all colors in the color table. However, this method requires a long processing time, occupying more than 90 percent of the total processing time. From such a viewpoint, this paper aims at the speeding‐up of the color image quantization, by reducing the processing time for construction of the quantized image. A method is proposed for speeding up, where the pixel and the color table are connected indirectly using the look‐up cube composed of 32 × 32 × 32 equipartitioned RGB space. By this method, the number of comparisons between the pixel and the color table is reduced.
Fast direct interpolation for computer graphics applications
Authors: Akamatsu Norio , Sakou Nobuaki , Craigin Robert
Published: July 2007

Interpolation by the widely used spline function method requires excessive computation time because floating point arithmetic is used whenever a polynomial coefficient is determined. This paper presents a direct interpolation method (Fast Direct Interpolation) which attains sufficient precision with fixed point arithmetic. The processing speed and accuracy of the FDI method are also investigated. Since the FDI method can easily be implemented in hardware and adapted to parallel processing, it is suitable for the high‐speed processing demands of computer graphics. An optimum FDI interpolation parameter is determined by considering various practical applications. Finally, continuity is proved for results obtained from fast direct interpolation.
A pressure—sensitive graphic tablet enabling detection of input—pen—contact area and its application to electronic blackboard system
Authors: Sato Yuichi
Published: July 2007

Many kinds of digitizers for inputting handwritten letters and drawings into a computer have been used in practice. These digitizers cannot detect the size of an input pen contact area, although it can detect its position. This paper offers a new system which can detect both the position and size of a point. The system consists of an input coordinates‐detector and point‐size detector. The former consists of two groups of flat electrodes (top and bottom) for detecting the position of an input point, resistor, a constant‐current source, and operational amplifiers. The latter consists of size‐detection electrodes (buried in either the top or bottom position‐detection flat‐electrodes, with regular intervals), a voltage source, operational amplifiers, and analog switches. The detection of the position or size of an input is carried out by using a time‐division procedure. This paper describes the structure of the input surface, the principle of input detection, and that of input‐point‐size detection. As an example of application, a prototype electronic blackboard is described, and with its characteristics are measured, e.g., its input and display characteristics, size‐discriminated characteristic, and linearity.
Optimization algorithm for parallel demand—driven computation of functional programs
Authors: Ono Satoshi , Takahashi Naohisa
Published: July 2007

This paper proposes a new optimization algorithm for the demand‐driven computation suited to the parallel processing of the functional program. The optimization is performed for three points: the preevaluation of requisite parameters; the efficiency of demand propagation; and the analysis of the partialvalue dependent attribute set. To reduce the computation required in the optimization, a hierarchical approach is employed, which is composed of the interfunctional analysis to process the whole program in parallel, and the intrafunctional analysis for each function definition as a separate phase. Using the proposed method, the successive function in the discrete domain can be calculated efficiently based on the fixed‐point computation rule, by providing a certain extension of the data‐flow machine executing in parallel the data‐driven computation.
A method of license plate extraction using a fast pyramid hierarchical hough transformation
Authors: Agui Takeshi , Choi Hyung Jin , Nakajima Masayuki
Published: July 2007

Previously, the authors proposed a method of extracting the region of a vehicle number‐plate using the Hough transformation with a restricted parameter plane. The method offers a significant reduction of the amounts of memories and their processing time which are required for storing the parameter plane in a conventional Hough transformation.

This paper describes a further improvement of the method in its processing speed. In the processing, first, a pyramid hierarchy is applied to the original image; second, some preliminarily selected straight lines are extracted from the image with a pyramid hierarchy; finally, the region of the original image corresponding to each straight line is obtained. This method restricts the computation of the plane‐region‐distracted Hough transformation into the region of the straight lines already obtained so that calculation points and the processing time are reduced. As an example of application of the method, extraction of license plates is described.
A neural network model composed of multioscillators to generate low—frequency biological rhythms
Authors: Endo Shuji , Kinouchi Yohsuke , Ushita Tomiyuki
Published: July 2007

The biological system has low‐frequency rhythms, such as a circadian rhythm. In general, it is considered that the source of the circadian rhythm is mostly the neural system, such as optic lobe and suprachiasmatic nucleus. This paper proposes a neural network model which can generate the low‐frequency biological rhythm, and discusses its characteristics. The model is composed of the set of neural oscillators composed of excitatory‐inhibitory neuron pairs, together with a neuron taking the sum of the oscillator activities. By feeding back the activity of the summing neuron to the oscillators by a suitable magnitude, the proper frequency of the whole model is decreased, realizing the low‐frequency rhythm. The generation condition for the low‐frequency rhythm is derived through the approximate analysis of the model and the computer simulation. The properties of the generated rhythm are discussed.
A method of generating facial expressions using a database‐driven animation system
Authors: Noguchi Norimasa , Agui Takeshi , Nakajima Masayuki
Published: July 2007

Previously, numerous methods of computer animation have been proposed. However, most of those methods are based on the key frame, which requires human specifications, necessitating a certain amount of skill on the part of the operator. This paper proposes a system based on database‐driven animation construction. The system has two databases: one for the figures data, from which the motion is considered; and another for registering the motion data. Since the motion data are stored in the database in a figure independent form, a large amount of animation data can easily be constructed from a small amount of data. This paper describes a system which constructs the human facial expressions by the database‐driven animation construction. The representation of the facial figure and expressions required in the construction, together with its data structure, are described. Finally, the result of experiment is presented.
Transfer movement control of mobile robot using two circular arcs
Authors: Ohuchi Takao , Ohtomo Teruhiko , Satoh Nobuhiro , Yamada Narihide
Published: July 2007

This report describes a method of controlling a robot vehicle to move smoothly on a visually natural path. In this method, discrete points which the robot passes, and directions toward which it moves, are provided on an arbitrary coordinate system given in a movement environment. The continuous curve required for the robot vehicle to move is represented by a total curvature function obtained by accumulating curvatures of curves. Using the function, an algorithm is obtained for generating the robot moving path from interpolation of two circular arcs containing both the lengths and curvatures of the two circular arcs. The position at which the robot is passing and the direction toward which it is moving are measured based on the principle of the triangle survey for three reference patterns set in the movement environment. This is possible by measuring the directions from the current position to the patterns with an ITV camera. This method produces a directional error caused by the roughness of the step angle (0.9) of the stepping motor driving the ITV camera. This paper proposes a method of compensating the directional error by taking into account the number of pixels in pictures taken per step. This system has the averaged position measurement error of 0.8 percent against the coordinate system including the reference patterns. From the result, it is proved that a comparatively simple method enables the moving path of a robot to be controlled accurately.
A geometrization of the discriminal process model on the sensory system with several inputs and a single output
Authors: Takiyama Ryuzo
Published: July 2007

This paper presents a geometrical version of Thurstone's discriminal process model for the multiinput single‐output sensory system. As the first step, the probability density function for the discriminant process is defined. The parameters of the probability density function is the mean and the variance of n stochastic variables. It is assumed that each of the variances is given as a linear function of the mean values. The space spanned by the parameters (n means) is defined and called the discriminal space. The fundamental metric is introduced into the discriminal space using Fisher's information matrix, and the resulting space is regarded as an n‐dimensional Riemannian space. The geometrical structure of the discriminal space is examined, and clear descriptions are made for the essential meaning of the response function, the relation between the discriminal process model and the psychophysical function, and a pertinent analogy between the concept of difference thresholds and the discriminal process model.
Space‐time theory GQOT and its application to concurrent processes
Authors: Tanabe Koichiro , Suzuki Atsuyuki
Published: July 2007

This paper discusses a logical verificational theory GQOT for concurrent processes which communicate and synchronize by asynchronous message passing. In concurrent processes, especially, in distributed systems, each process acts independently, and yet one operation is done as a whole by communicating and synchronizing. Thus, regarding each process as having its own local time, we formalize each by a temporal theory QOT. Then regarding all the concurrent processes as a complete graph with each process as a node, we formalize it as space G. GQOT is the merge of G and QOT. In this paper we define this GQOT and, moreover, to make it more suitable for concurrent processes, introduce a sort of action, concept of interval‐time and an operator “next.” Then, we show the description and verification of the concurrent processes and its properties.
High‐speed addition and subtraction using a minimum redundant p‐ary representation
Authors: Tamesada Takeomi
Published: July 2007

In redundant binary representation, 1, 0 and 1 are used in each digit. It is known that the representation can realize a parallel high‐speed addition where a carry propagation over two or more digits is not produced, which helps to execute various functional computations at a high speed. By further extending the idea of the redundant binary representation, the redundant P‐ary representation can be constructed with P (= 2, 3, 4, …) as the base. In the representation, K negative integers 0, 1, 2, …, P ‐ 1, can be used as the digit, in addition to the usual P positive integers 1, 2, 3, …, K (= ‐K). When K = 1, the redundant P‐ary representation is called the minimum redundant P‐ary representation. This paper considers the minimum redundant P‐ary representation, and shows that an addition algorithm exists where the carry propagation over more than two digits is not produced for arbitrary base P, as in the case of the redundant binary representation. By increasing P in the proposed algorithm, the digits of the data can be reduced which will lead to a high‐speed functional computation device with a simple structure.
A method of generating user‐desired service macro in an icon‐based environment
Authors: Takada Hisayasu , Suzuki Tatsuo , Kato Shuichi
Published: July 2007

It is desirable that office workstations be provided for each office worker with his/her own man‐machine interface and services. This paper describes a service environment in which the user can designate the desired value for each service parameter, and can generate new services by modifying and/or combining the primitive services. The workstation automatically generates the user's own interface and services according to his/her operation sequences on the display screen, where special icons, called item icons, as well as desktop icons are displayed. Item icons are passed among application programs.
Planning support system for craniofacial surgery using CT images
Authors: Yasuda Takami , Hashimoto Yasuhiro , Yokoi Shigeki , Toriwaki Jun‐Ichiro
Published: July 2007

This paper describes the support system NUCSS (Nagoya University Craniofacial Surgical‐Planning System), which supports by computer the planning of craniofacial surgery using CT image. This is a total surgery planning‐assist system which plans the craniofacial surgery made traditionally by the surgeon by cutting and pasting pieces of paper on a two‐dimensional sketch of the skull image. Instead, the system displays the three‐dimensional image using computer graphics, and the planning is made interactively on the image. The major functions of the system are as follows. Generation and display of three‐dimensional image, three‐dimensional distance measurement on the skull, planning and execution of surgery on the side view of the skull, bone removal from arbitrary direction, and prediction of face after surgery. The features of the system are that the bone of arbitrary shape can be cut and shifted, and the face after surgery can roughly be predicted. This had been impossible in the traditional system.
Extended photometric stereo for an object with unknown reflectance property
Authors: Iwahori Yuji , Hiratsuka Noriharu , Kamei Hiroyuki , Yamaguchi Shoichiro
Published: July 2007

Conventional Photometric Stereo can obtain the surface gradients of an object when its reflectance property is known. This paper proposes a new method of accurately obtaining the surface gradients with three light source directions under the assumption that the reflectance property of the surface is unknown. Assuming that the reflectance property is uniform over the entire surface, surface gradients can be obtained by the following two steps: (1) reflectance property parameters and the gradients of the suitable surface elements that characterize the reflectance property by solving the nonlinear simultaneous equations for them, so that a pseudo‐reflectance map is obtained; and (2) the gradient of each surface element is determined by using parameters obtained by (1). The reliability for the values of the reflectance property parameters (i. e., those for the pseudo‐reflectance map) can be improved by applying the method of selecting the surface elements that are sensitive to the reflectance property; this is called the characterized surface elements selection method. In computer experiment with 8‐bits shading resolution using three parallel light sources, the values of the reflectance property parameters can be obtained in optimum, and the accurate surface gradients for a glossy object can be determined.

A mean square error in a depth measurement becomes an order of 10−2, confirming the usefulness of the proposed method.
Transformation rules for automated design of circuits by theorem‐proving techniques. Transformation from recursion equations to circuit descriptions
Authors: Harao Masateru , Iwanuma Kouji
Published: July 2007

One of the important aspects in the design of automation system is to establish some automatic transformation method from the specification by high‐level language, which is suitable for designer to the description at the circuit level. This paper formulates the circuit design as the transformation, from the recursion equation, which is a high‐level description, to the functional network FN, which is a circuit model based on the data‐flow operation. The purpose of this paper is to clarify the transformation rules for the automatic circuit design based on the theorem‐proving techniques. First, the recursion equation is formulated as the specification language, and the circuit description language for FN is designed. The theorem‐proving system for the automatic design of the circuit can be formulated as a logic system in which the axioms are the predicate expressions for the elements, and the inference rules are the transformation rules among elements. The transformation rules from the recursion equation to the circuit representation are constructed using the concept of schema corresponding to the type of the recursion equation. Since the transformation includes heuristic aspects, some transformation techniques from the schema to the circuit description (called schema transformation) as well as the decomposition‐synthesis rules in the circuit representation, are presented. A logic system based on the obtained result is presented, indicating that a theorem‐proving system for the automatic circuit design can be constructed.
Generating cartesian products of two sets on a shuffle‐exchange network
Authors: Kumagai Takeshi , Baba Takanobu , Saito Hideki
Published: July 2007

This paper describes a method which generates all elements of a Cartesian product of two sets, using the shuffle‐exchange network. Often, processing appears which requires all elements of the Cartesian product in various fields in computer science as well as set manipulations in mathematics. Consequently, this operation can be considered to be one of the most fundamental. In this paper, the Cartesian product of two sets with N/2 elements is generated by an N‐input, N/2‐stage shuffle‐exchange network by assigning the switching element to each element of the Cartesian product. The experimental derivation of the realization method and the result of the experiment are described. In the derivation of the realization method, some properties of the shuffle‐exchange network are discussed. In the realization of the Cartesian product by an N/2‐stage shuffle‐exchange network, no redundant switching element is used. Consequently, the method shown in this paper is optimal.
Inter‐layer operators of optically connected three‐dimensional VLSI and their application to image processing
Authors: Fujita Satoshi , Aibara Reiji , Yamashita Masafumi , Ae Tadashi
Published: July 2007

The three‐dimensional (3‐D) integrated circuit has recently been attracting interest as a new structure for device implementation, and numerous studies are being made also from the viewpoint of the system design. This paper considers the 3‐D integrated circuit, where the layers are connected through light transmission (called 3‐D optically connected integrated circuit). It is suggested that operational processings unique to the 3‐D structure can be realized. The function is formulated algebraically as the image processing operation, and an application example to the template matching is presented. The improvement ratio of the matching processing speed by the proposed algorithm is evaluated by simulation. A discussion is made on the pipeline processing utilizing the 3‐D structure.
High‐speed multioperand addition and subtraction using a p‐ary representation with necessary and minimum redundancy
Authors: Tamesada Takeomi
Published: July 2007

In the usual P‐ary number digit for the addition and subtraction of two numbers (operands), 0, 1, 2, …, P ‐ 1 are employed. In the minimum redundant P‐ary representation, 1 is further used, and the addition or subtraction can be performed in a constant time independent of the number of operand digits (Pϵ{2, 3, 4, …}). This paper extends this property. First, a high‐speed addition‐subtraction algorithm is discussed. It can execute the addition and subtraction of L(ϵ {2, 3, …, P}) operands in a constant time independent of n and L. The following property is shown as the result. Using the redundant P‐ary representation (called K‐redundant P‐ary representation), where K,…, 2, 1, 0, 1, 2, …, P‐l can be used as the digit, the minimum necessary value for K is L ‐ 1, and the desired algorithm can be found if L‐1K(ϵP—1). The presented algorithm can easily be extended to an algorithm which can execute the addition and subtraction of L operands in a constant time independent of n, where L is an arbitrary number such that P+IL. It is shown that if f(x) = [logpx]+1 ([y] is the minimum integer not less than y), the computation time T is O(loga), where α is the minimum number of operations for the function f( ) satisfying f(f(f(F))))P; α increases stepwise with L. When P is increased, T decreases, and the range of L, for which T is constant, increases exponentially. Using the proposed algorithm, one can expect that a multi‐input high‐speed adder‐subtractor can be constructed. Various kinds of high‐speed data processings can be realized, including the multiplication, where the shifted partial products are added.
Simulation processor “SP”
Authors: Yamada Hiroshi , Hirose Fumiyasu , Niitsuma Junichi , Shindo Tatsuya
Published: July 2007

The continuing development of large‐scale and complicated computer systems has created an increasing demand for fast logic simulation which can locate errors in the logic design. The authors have devised a new scheme which makes use of memory instead of registers in controlling the pipeline system. This idea formed the basis for developing a new simulation processor, the “SP”. The SP is a system dedicated for simulation which performs parallel processing using up to 64 gate processors (GP). Using a newly devised pipeline control for each processor delivers high‐speed and inexpensive simulation. By combining processors with a high‐speed switch called ET, the degradation of processing speed due to the delay of information transmission in parallel processing can be prevented. The desired goal was achieved with the construction of the SP, a logic circuit with 4 million gates in which 32 Mbytes of memory could be simulated at high speed.
Presumption of gating system by sodium activation gating model
Authors: Sekine Yoshifumi , Narumi Kenji , Suyama Masatoshi , Noguchi Masayoshi
Published: July 2007

Recently, many studies have been reported on hardware neuron models for analyses of physiological nerve phenomena and for engineering applications of biological nerves. The ∧‐shaped transistor‐type hardware neuron model, reported by the authors earlier, simulates well the characteristics of neurons. Hence, the output pulse frequency is proportional to the input level above the threshold and the model is suitable also for engineering applications. Compared with the Hodgkin‐Huxley model which represents a phenomenal formula for the electrical phenomena of nervous excitation, however, the model reported here differs in saturation characteristics and time constants. For closer analyses of physiological nerve phenomena, a model which simulates more closely the characteristics of biological nerves is needed.

This paper discusses the characteristics of sodium activation gates of nerve axon membranes and sets forth assumptions on the biological gate structure. For the discussion the authors divided the Na activation gate structure into a potential receptor and a channel gate, respective hardware models are tested with FETs, capacitors and resistors, and it was verified that the models closely simulate the electrical characteristics of the Na activation gate. Based on the results of the experiment, the following presumptions were made:

(1) membrane potential is fed to the potential receptor through a high resistance and a capacitance exists between the membrane and the outside of the axon;

(2) there are capacitances at both the open and closed positions of the potential receptor, and conductances are connected in parallel to them, thereby controlling the transition velocity by controlling transition of charged gate particles;

(3) the channel gate is comprised of two conductances corresponding to the open status and closed status, and the conductances vary depending on respective voltages which vary in response to status change of the potential receptor.
Verification of safeness and mutual exclusion properties of algebraically specified token ring LAN protocol
Authors: Higashino Teruo , Fujii Mamoru , Taniguchi Ken'Ichi , Kasami Tadao , Mori Masaaki
Published: July 2007

This paper describes the algebraic specification with a high degree of abstraction for the token ring LAN protocol provided in IEEE standard 802.5. Then the anticipated properties are verified by an algebraic method, the specification satisfies the safeness property (any frame transmitted from the active station either has been received by all stations or received by consecutive stations in the downstream without an error) and the mutual exclusion property (there exists one and only one token on the ring). The verification is carried out interactively using the verification support system. The process of selecting the lemmas to be introduced, the process of verification, CPU time used for the verification and the number of days needed in the verification are discussed.
Rotated checker‐pattern projection and its cross‐point extraction and tracking for 3‐D object profilometry
Authors: Yuba Yoshiharu , Hirai Hiroshi , Tsutsumi Kiyoshi , Watari Kazuo
Published: July 2007

In the measurement of 3‐D shape by projecting a regular pattern on the object surface, it is required to extract feature points with a high accuracy and to determine their mutual relations. In this paper, 45‐deg rotated checker‐pattern projection is proposed, and a method for extracting and tracking the crossing point is presented in which the geometrical properties of the rotated checker pattern are utilized. If the pattern projector and the camera are on the same horizontal plane, a large brightness difference is produced between the horizontal and nonhorizontal (vertical and slant directions) neighbors of the crossing‐point pixel. By utilizing this property, crossing points are extracted. The projection profile of the brightness pattern along the vertical direction has a triangular form, and the location of the extremum of the profile gives the vertical coordinate of the crossing point. By utilizing this profile, the crossing points are classified (segmentation). On the basis of the result of segmentation, the crossing points are successively tracked and their mutual relations are determined. To demonstrate the usefulness of the method, the experiment of 3‐D shape measurement was made. The error of the measurement was less than 2 mm, which is due to the error in extracting the crossing point (i.e., 1 pixel at the maximum). In the measurement of a cylinder, the measurement was made along the circumference. It is shown that the measurement of the position of the crossing point on the reference plane is not required if the rotation of the object is utilized.
Optimum color masking matrix determination for digital color platemaking, using virtual color samples
Authors: Tajima Johji
Published: July 2007

For high‐fidelity color reproduction with digital color platemaking systems, it is the most important to determine the color masking matrix which converts the red, green and blue intensities of the monitor to cyan, magenta, yellow and black inks halftone dot area rates. With regard to this determination process, the author previously developed a color difference least square method by which the optimum matrix is determined, using a simulation with the Neugebauer equation and virtual color samples. First, this paper evaluates the method with actual images. Next, the method is extended for adaptive masking matrix optimization. By adapting the matrix to each color image using black ink, it was shown that the average color differences of reproduced images could be reduced to below six when black ink is used as much as possible, i.e., in the case of achromatic printing. This masking matrix adaption is a new concept which was impossible by conventional color scanner processing, but became possible by using virtual color samples.
Automatic correcting method of geometric distortion in meteorological satellite noaa image
Authors: Takagi Mikio , Hiyama Takamichi , Sone Mitsuo , Onoe Morio
Published: July 2007

Geometric distortions contained in images of the meteorological satellite NOAA have been corrected using the calculated orbit values alone. Since the calculated orbit values usually contain errors, their precise corrections have been carried out using many ground control points (GCPs). If a position in the NOAA‐image coordinate corresponding to a GCP is covered by clouds, however, the correction is carried out manually by choosing another position which is not covered by clouds, since the displacement of the position is not certain. If there are many positions to correct manually, however, the time of manual operations increases, in addition to the occurrence of different values in the displacement of the position. This paper proposes an automatic correcting method of the geometric distortion. The method employs the sequential similarity detection algorithm for template matching using coastal‐line data including GCPs. For this operation, the pyramid structure is efficiently employed to increase the processing speed. A success or failure of template matching is determined automatically by using a correlation coefficient. From this result, the affine transformation coefficient is calculated so that the geometric distortion is corrected automatically. Transformations between the map coordinates, the ground‐surface coordinates, and the NOAA‐image coordinates are carried out by using the four‐point interpolation method so that their processing time is shortened. The effectiveness of this method is demonstrated.
Design theory of three‐dimensional memory system for image processing
Authors: Tayama Norio , Otawara Isao , Sun Weidong
Published: July 2007

This paper considers the parallel processing system for a three‐dimensional (3‐D) image, and presents a theory for constructing the 3‐D image memory system with a parallel access function. Until now, studies have been made on the condition for the feasibility of parallel access for the assignment function (parallel access function) of the individual module. In the view of the authors, the traditional parallel access function cannot be used in the general theory of the memory module assignment. A new concept called “memory module assignment permutation” is proposed. This paper considers the following problem based on the proposed concept. A 3‐D image memory system with seven kinds of parallel access functions is to be realized, and the problem is to clarify the mathematical condition for the memory module assignment permutation. The problem is formulated and the design condition is stated. In other words, the necessary and sufficient condition is derived for the memory module assignment permutation so that the parallel access can be made for the three kinds of line‐mode (X, Y, and Z axis), three kinds of plane‐mode (perpendicular to the axis), and the cubic‐mode.
Incremental structuring of knowledge base—incremental construction method of rete network
Authors: Araya Shinji , Momohara Taketoshi , Tamati Tuneo
Published: July 2007

It is useful in improving the efficiency of the inference execution in production systems to structure the rule set. With the increase of the scale of the rule base, however, the structuring processing itself is a great burden, thus decreasing the efficiency in development. When the knowledge base is to be developed in the sequential and trial‐and‐error programming style, the knowledge is frequently added or removed, which is a serious problem. From such a viewpoint, a function is provided in OPS5 and in other systems whereby the existing Rete network is modified incrementally when the rule is to be added or removed. There has been no detailed report, however, on such a function. This paper proposes a new structuring method by applying Rete algorithm and discussing its relation to the existing techniques. In the proposed method, the information needed for the modification of the network is derived by feeding the condition pattern composing the condition part of the rule to the current Rete network as a token. The information concerning the consistency between the added rule and the existing rules can also be obtained.
MAN‐YO: Mixed level parallel logic simulation engine
Authors: Koike Nobuhiko , Nakata Toshiyuki , Kajihara Nobuki
Published: July 2007

MAN‐YO is a special‐purpose parallel computing machine being developed for logic circuit design and simulation. It uses dedicated hardware to increase the speed of gate‐level simulation, and a combination of dedicated microprograms and processors for functional level simulation. Furthermore, a multiprocessor architecture, interconnected by a loop‐network, is used to provide concurrent processing capability for high performance, multilevel logic simulation. Experiments were conducted to assess the performance of the functional level simulation.
Scheduling jobs on a multiprocessor system with a common memory
Authors: Kawaguchi Tsuyoshi , Taniguchi Yuji , Kyan Seiki
Published: July 2007

This paper studies the problem of scheduling jobs on a multiprocessor system with a common memory to minimize \documentclass{article}\pagestyle{empty}\begin{document}$ \sum\limits_{i = 1}^n {w_i \left({f_i } \right)} $\end{document}, where fi denotes flow‐times of jobs i, and wi(fi) denotes monotonically nondecreasing functions of fi. Arriving jobs are assigned to available processors according to an appropriate scheduling rule. Once a job is placed on a processor, it retains the processor during its processing and repeats local computations and accesses to the common memory. First, the scheduling problem is formulated into a zero‐one integer programming problem. Next, a procedure is presented for computing a lower bound on the optimal cost. Finally, the performance of the proposed procedure is evaluated using simulation experiments for the problem of minimizing mean flow‐time.
A method for reconstructing the shape of an object from two images taken under point light source illumination
Authors: Kamei Hiroyuki , Yamaguchi Shoichiro
Published: July 2007

In this paper, an attempt is made to develop a new photometric method to reconstruct the 3‐D shape of an object. The method proposed here is called point source illumination stereo (PSIS) and is used to reconstruct the shapes of objects from two images obtained under point light source illumination and perspective projection.

It is assumed that the surface of the object is uniform, perfectly diffuse, convex and smooth. In a small‐sized optical system in which both a camera and a light source are near an object, the method is applied to reconstruct the shape of an egg from images taken with a fiberscope.