bluuebunny/crossref_metadata_2025_split huggingface dataset:
High‐speed multioperand addition and subtraction using a p‐ary representation with necessary and minimum redundancy
Authors: Tamesada Takeomi 
Published: July 2007

AbstractIn 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

AbstractThe 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

AbstractRecently, 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

AbstractThis 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

AbstractIn 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

AbstractFor 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

AbstractGeometric 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

AbstractThis 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

AbstractIt 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

AbstractMAN‐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

AbstractThis 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

AbstractIn 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.
The “pattern associative memory” and its use in logic programming language processors
Authors: Yasuda Takuya , Igarashi Satoshi , Atoda Oichi , Saito Nobuo 
Published: July 2007

AbstractThe traditional speed improvement of the logic language processing system has been based on the parallelism of clauses, and aimed at speeding up of the unification. However, there can be another approach. By introducing a specific function to the memory hardware, the database can be managed independently of the host CPU. Then the speed is improved by minimizing the data traffic through the von Neumann bottleneck in the retrieval of candidate clauses. This paper proposes a pattern associative memory (PAM) which maintains the clauses by the structural representation in it and retrieves them by pattern matching with a high speed. To make use of argument parallelism of clauses, parallel hashing is adopted in PAM. The individual hash table employs some local search algorithms in combination with the open addressing scheme of hashing to improve the efficiency of managing records within clusters. It was verified by simulation that the compound hash algorithm is sufficiently useful for the load factor of 60 percent or less. A PAM hardware is implemented and applied in Prolog processing to demonstrate the feasibility and usefulness of the proposed method.
Determining the viewing points for 3—D objects in a dynamic retrieval system
Authors: Hamano Teruo , Ishibashi Satoshi , Ogura Kenji 
Published: July 2007

AbstractThe dynamic retrieval system is considered as a means to construct a database for actual three‐dimensional (3—D) objects, such as commercial goods, art works, animals and plants. In the dynamic retrieval system, the image data are given as the input continuously along the virtual semisphere covering the object. Since a large amount of image data is produced in this way, only N representative image data are extracted and stored. Apart from those representative image data, dynamical image data are prepared for rotation and display of the object in the partial area of the terminal screen. The user rotates the object displayed on the partial screen in an interactive way using a joy stick or other device.The outline of the object is examined and the next viewpoint to observe the object is determined. Then the representative image data corresponding to that viewpoint is displayed on the terminal. A problem in this dynamic retrieval is how to select the N representative image data from the continuously observed image data.For this problem, this paper proposes the following algorithm. Two images are taken by viewing the object from two different viewpoints. The variety of object sampling points is defined as an objective measure to represent the difference of information as sensed substantially by the human observer. Then, using that variety of object sampling points, the viewpoint for the representative image data is determined. A result of experiment is presented where the proposed method is applied to determine the representative viewpoint.
A transmission delay analysis of multilink hdlc procedure
Authors: Zhang Ai‐Ying , Saito Tadao 
Published: July 2007

AbstractThis paper proposes a performance evaluation model to analyze the transmission delay time in the multilink HDLC procedure, which is a standard data link layer protocol in the OSI reference model to realize an effective and reliable transmission protocol on standard HDLC procedure. This paper proposes a delay time model consisting of three submodels, i.e., the send station model, the transmission line model, and the receive station model. In an asynchronous balance mode over a point‐to‐point configuration, the total delay time of the system is composed of delay time from departure time of an information frame at the send station to arrival at the receive station and time consumed for frame sequence number rearrangement at the receive station. Characteristics of the multilink HDLC procedure are evaluated in numerical examples.
Time‐event driven scheme for distributed simulation with advance processing
Authors: Takashi  , Hizuka Sadao , Hidehiko  , Yoshikazu  
Published: July 2007

AbstractAs a method of fast simulation of queueing networks by parallel processing there is D‐SSQ which uses the limited‐advance processing scheme. The processing capability of the limited‐advance processing scheme has been shown to increase linearly as the concurrency of the model increases. However, on the other hand, if the updating of the maximum logical time requires considerable time after which no processor backtracks (confirmed time), its performance is degraded considerably. Also, the optimal limit of advance must be estimated from the simulation model. In this paper, to improve on these shortcomings, a time‐event driven scheme is proposed. In this scheme the system clock is managed by a central processor and each processor performs the limited‐advance processing within a certain logical time (clock) of the system time. Second, an adaptive time‐event driven method is presented. In this scheme the optimal limit need not be estimated prior to execution and the global clock is changed dynamically to achieve the maximum performance. The processing capabilities of these two methods are measured by experiments and simulations on a main frame.
Construction of a protocol synthesis environment and its implementation
Authors: Norio  , Yao‐Xue Zhang,  , Kaoru  , Noguchi Shoichi 
Published: July 2007

AbstractA software environment for interactively synthesizing communication protocols without logical errors has been developed. It contains a synthesis algorithm which eliminates the logical errors, and a human interface which has a multiwindow environment, a graphical interface, colors and texts utilities. Moreover, it not only expresses the synthesized protocol as labeled directed graphs, but also provides advices on how to give the input for the protocol designer by using the colors and the texts utilities. Consequently, the protocol design has been facilitated. As an example, a call‐establish phase of X.25 has been synthesized by using the software environment.
Optimum feature selection for decision functions
Authors: Manabu  
Published: July 2007

AbstractFeature selection is one of the most important processes in the design of pattern classifiers. This paper presents an optimum feature selection method which is applicable to arbitrary (nonlinear) decision functions. It is assumed that a finite number of training samples (training set) is given for each pattern class, and the decision function is designed based on the training sets. The training sets are edited by removing the samples which are classified incorrectly by the decision function. Then the feature selection problem is transformed to a modified zero‐one integer program. In this method, under a chosen permissible error, a minimum feature subset can be found which is combinationally optimum. Numerical examples of feature selection for a linear and a quadratic decision function are presented.
Identity‐based conference key distribution systems
Authors: Kenji  , Kazuo  
Published: July 2007

AbstractThis paper proposes identity‐based key distribution systems for generating a common secret conference key for two or more users. Users are connected in a ring, a complete graph, or a star network. Messages among them are authenticated using each user's identification information. The security of the proposed systems is based on the difficulty of both factoring large numbers and computing discrete logarithms over large finite fields.