bluuebunny/crossref_metadata_2025_split huggingface dataset:
Fault‐tolerant processor interconnection networks
Authors: Imase Makoto , Soneoka Terunao , Okada Keiji 
Published: July 2007

AbstractAs suitable topology for interconnection networks of multiprocessors, De Bruijn graphs have been proposed and a number of investigations have been conducted on their fault tolerance. A De Bruijn graph is a directed graph with maximum degree d (the maximum number of links that can be connected to one processor), diameter k (maximum number of repeaters between two processors) and number of nodes dk (number of processors). A Kautz graph is a directed graph with maximum degree d, diameter k and number of nodes dk + dk‐1. Both have the smallest diameter among the graphs with maximum degree d. This paper proves the following: (1) If d ‐2 nodes in a De Bruijn graph are removed (if d ‐2 processors are faulty), its diameter becomes d + 1, which is only 1 larger than the original diameter. (2) If d ‐3 nodes in a Kautz graph are removed, its diameter becomes k + 1 and if d ‐1 nodes are removed, the diameter is k + 2 or less, which is at most 2 larger than the original diameter. (3) The values of (1) and (2) are at most 1 larger than the lower bound under the limitation of degree d, (4) A fault‐tolerant routing algorithm can be realized easily. This algorithm is better than any existing algorithm because of its short routes.
A new line data management structure suitable for geometrical retrievals based on spatial relations
Authors: Ohsawa Yutaka , Sakauchi Masao 
Published: July 2007

AbstractWith the recent widespread application of computer graphics, a management system for graphic data is required which is suited to interactive processing. This paper discusses the management structure for the line data, which can realize a retrieval in an efficient way according to the spatial relations. The dynamic data management structure called the BD time, which was developed by the authors for the multidimensional point data management, is employed. In the proposed system, the BD tree is modified into a form (nonpacket type) suited to high‐speed processing, and is extended to suit the line data. In this system, the segment is managed by its centroid and the circumscribed quadrilateral. The BD tree is composed of a set of centroids, where each node has information concerning the circumscribed quadrilaterals for all segments in the subtree. The retrieval is made efficient by the information concerning the circumscribed quadrilateral. In this paper, the data structure for the line data management is discussed first. Then various retrieval algorithms which depend on the spatial relations according to each application are discussed in detail. Finally, the usefulness of the proposed data structure is demonstrated by a retrieval experiment of actual geographical data.
Reconfiguration of a fault‐tolerant rectangular systolic array
Authors: Suzuki Yoshinao , Hirata Tomio , Imai Masaharu , Yamashita Masafumi , Ibaraki Toshihide 
Published: July 2007

AbstractFault‐tolerant designs which incorporate redundancy to improve the yields of VLSI chips are well known. In such designs flaws in a chip are excluded by reconfiguration. This paper discusses the reconfiguration problem of a rectangular systolic array: Given a rectangular systolic array, construct a flawless array of maximum size. Three levels of constraints on reconfiguration are considered, and for each constraint the problem is proved to be NP‐complete and an approximation algorithm is proposed.
Signal processing approach to optimum preprocessing for on‐line recognition of handwritten japanese characters
Authors: Aizawa Tadashi , Nakagawa Masaki , Takahashi Nobumasa 
Published: July 2007

AbstractWith the recent tendency toward miniaturization and price‐down of tablet digitizers, they are expected to be used as the input device for handwritten characters and drawings. As the preprocessing for the point coordinate sequence read from a tablet, only empirical methods have been applied. This paper discusses the preprocessing from the viewpoint of signal processing, and a quantitative evaluation was made for the following two points: (1) directional stability of the preprocessed coordinate sequence; and (2) follow‐up (fidelity) of the preprocessed point sequence to the original point sequence. As a result, a performance superior to the traditional methods was obtained by the following four phases: 1 Adaptive sampling, where sharp corners are stressed, while the sampling points are set uniformly for slow pen movement; 2 interpolation, where the point interval is made uniform for fast pen movement; 3 smoothing by the moving‐average filter; and 4 thinning to eliminate redundant points. The point sequence after the proposed preprocessing has the following features: (1) The original point sequence is followed, being little affected by the pen speed; (2) the directional stability is achieved even for 32 directional quantizations in the straight‐line segmentation used by the authors; and (3) features such as sharp corners are preserved.
Coordinate rotation invariance of image characteristics for 3d shape and motion recovery
Authors: Kanatani Ken‐Ichi 
Published: July 2007

AbstractIn order to determine the shape and the motion of the object from its projection, it suffices to derive and solve the equation relating the parameters specifying the shape and the motion of the object with the features measured on the image. The equation is usually nonlinear, and is difficult to solve in the analytic way. This paper notes that there is no inherent coordinate system on the image, and any two coordinate systems are equivalent. By combining the features of the image, coordinate‐rotation‐invariant parameters (invariances) are derived. By this scheme, the geometrical meaning of the image characteristics is made clear, and the analytic solution is obtained in a natural way. The idea is demonstrated for the cases of the optical flow analysis and the surface recovery by texture, as examples.
Application of df/ihs to minimum total weighted flow time multiprocessor scheduling problems
Authors: Kasahara Hironori , Kai Munenori , Narita Seinosuke , Wada Hidehiko 
Published: July 2007

AbstractIn most cases, the scheduling problem for the multiprocessor system is NP‐ or strong NP‐hard. For this problem, we have already proposed a practical optimization algorithm DF/IHS (Depth First/Implicit Heuristic Search), which combines the list‐scheduling algorithm and the depth‐first search, for the minimum parallel processing time multiprocessors scheduling problem. This paper presents a result of application of DF/IHS to the minimum total weighted flow time problem, which is used in the optimization of memory utilization. The problem of allocating tasks to m processors is considered with or without precedence constraints among the tasks. It was verified that the DF/IHS can be applied to this kind of problem very effectively, where the optimal or highly accurate approximate solution is obtained for the large‐scale problem with several hundreds of tasks.
IMPRESS: A system for image processing procedure construction based on sample‐figure presentation
Authors: Hasegawa Jun‐Ichi , Kubota Hiroaki , Toriwaki Jun‐Ichiro 
Published: July 2007

AbstractAs a method of dialog with users, earlier image processing systems used a combination of linear information and words, a number or a phrase for description. However, these systems were limited in providing actual detailed descriptions of the extraction of image border and border lines.Thus a new Image Processing Expert System, IMPRESS, is proposed in this paper. This system accepts sample figure presentations which include an automatic process for selecting a figure that most closely identifies the sample figure without reading a description of the processing purpose. In addition, this system can be realized by using actual cases of construction.This paper explains the basic concept of this system and the automatic construction method of the line pattern extraction procedure. The method is then applied to the problem of major outline extraction of chest X‐ray images, and its effectiveness is shown.
A video tape production system with digital captions in a code format for the deaf
Authors: Nishikawa Satoshi , Takahashi Hidechika , Kobayashi Masayuki , Kabe Katsuhiro , Takiguchi Tsutomu 
Published: July 2007

AbstractThe authors have been involved for 8 years on R&D as well as improvement of the production system for videotapes with digital captions for the deaf, using Japanese word processors. A prototype was developed in July 1982, and a pattern information synthesizer VIP (video information processor)‐2000 was developed in April 1983. Captions which are almost faithful to the speech of the performer were synthesized into the scene of the program, and the results were almost satisfactory. However, a certain time was needed to synthesize the caption with the video scene, which produced a delay between the caption and the mouth movement. Sometimes, the captions were difficult to read depending on the background, since no vertical edge was provided. To solve these problems, the VIP‐4000, which is a coded information synthesizer, was developed. As a result, the time for caption synthesis is reduced drastically and the vertical edge is provided. Furthermore, coloring of the characters and inhibition rules can be applied, which helps the visual sensation. This paper describes the hardware, software, features, and performances of the VIP‐4000.
Filtered back projection method for cone‐beam X‐ray CT
Authors: Matsuo Hiroshi , Horiba Isao , Iwata Akira , Suzumura Nobuo 
Published: July 2007

AbstractThis paper investigates filtered back‐projected algorithms for come‐beam X‐ray CT reconstruction. A two‐dimensional detector array and a cone‐beam X‐ray source mounted on opposite sides of a cylindrical frame rotate 360 degrees about the object under observation to derive the projection data as a function of the absorption coefficient of the object. A modified ρ filter is proposed for enhancing the incomplete projection data before three‐dimensional reconstruction. The modified ρ filter provides two major enhancement functions: (1) It compensates for error in CT value (due to oblique components of X‐ray beam) by filtering the data in both the rotation direction and the direction of the axis of the rotation; and (2) recognizing the incompleteness of projection data in the frequency domain, the filter controls the spatial resolution along the axis of the rotation to reduce the amount of artifact in the reconstructed image. The applications and effectiveness of the modified ρ filter were estimated by computer simulation.
Compound decision theory and adaptive classification for multispectral image data
Authors: Watanabe Takashi , Suzuki Hitoshi 
Published: July 2007

AbstractPreviously, we reported on the experimental evaluation of multispectral image classifiers utilizing local spatial information. It was shown that the two classifiers of compound decision and adaptive classification exhibit a good performance in terms of the discrimination rate and the processing time. This paper discusses the improvements of those two methods further to improve the discrimination rate, and presents the result of experiment to indicate the effectiveness. More precisely, the following improvements were made. For the compound decision, the improved method estimates the context distribution based on the dependency of three pixels. For the adaptive classification, an extended adaptive classification is newly proposed where the adaptibility is improved by extending the region for classification to shapes other than a square. Among those, the extended adaptive classification is shown to be a highly practical method, wherein the discrimination rate is much higher than in the pixelwise classification such as Bayes decision, and it is expected to be employed widely as the standard classification method.
Liquid crystal range finder—a high‐speed range‐imaging system using liquid crystal shutter
Authors: Sato Kosuke , Inokuchi Seiji 
Published: July 2007

AbstractThe range image measured by the structured light projection has a merit in that the high‐density three‐dimensional data of the object can be obtained with a high speed, in a stable way and without ambiguity, independently of the smoothness of the object. In this study, a high‐speed driven structured light projector is realized by applying a liquid crystal shutter to the projection system. By incorporating the technique with the Gray code pattern projection spatially coded three‐dimensional measurement system, a highspeed range‐imaging system (Liquid Crystal Range Finder) is constructed. For the liquid crystal range finder, several elaborations are presented, such as stabilization of the measurement and improvement of the accuracy. As to the stabilization, a projection pattern extraction method is developed which excludes the effect of the texture of the object surface or the effect of the environmental illumination, using two complementary projection patterns. As to the improvement of the accuracy, the following elaborations are made. A double‐precision pattern is generated by shifting the liquid crystal shutter by a half‐pitch, utilizing the feature of Gray code pattern. The projector coordinate is determined with a high accuracy by the interpolation of the spatial code and the interpolation of the projection pattern boundary based on the gray level of the pixel. The usefulness of those techniques is demonstrated by actual measurement.
Distributed database concurrency control by cautious schedulers with a central clock site
Authors: Nonmember Jigui Li, , Ibaraki Toshihide 
Published: July 2007

AbstractIn [5], a concurrency control of the distributed database system by the cautious scheduler was proposed where the time stamp also is issued by the distributed algorithm. By contrast, this paper proposes a new concurrency control, assuming a central clock site issuing the time stamp. Compared with the previous method, the features of the present method are that the communication requires fewer messages and is simple. For typical faults, methods of remedy are discussed.
Stability of neural networks and convergence of their sensitivity computation algorithms
Authors: Member Kiichi Urahama 
Published: July 2007

AbstractThis paper considers the continuous‐time model and the discrete‐time model for the neural network, and discusses the stability of the model and the convergence of the sensitivity computation algorithm. First, a sufficient condition is given for the global asymptotic stability of the model. Then the speed with which the solution approaches the equilibrium is evaluated. Based on the results obtained, the local asymptotic stability of the equilibrium solution of the multi‐stable circuit is discussed. The fault‐tolerant property of the model is discussed briefly. Finally, it is shown that under the same condition as the sufficient condition for the asymptotic stability of the model, a certain kind of general sensitivity computation converges in the global sense.
Syllable recognition using integrated neural networks
Authors: Matsuoka Tatsuo , Hamada Hiroshi , Nakatsu Ryohei 
Published: July 2007

AbstractThis paper describes a new syllable recognition method using the integrated neural network (INN). In this method, the recognition targets are partitioned into several groups. INN consists of a control network and several subnetworks. The control network identifies to which group the input speech belongs, and the subnetworks recognize the syllables within each group. Using INN, even if the recognition scope is large, or even if there are few training samples, the network can recognize syllables with higher recognition accuracy than conventional back‐propagation networks. Furthermore, new vocabulary entries can easily be added to an INN by adding new subnetworks corresponding to the new groups. Using the grouping method based on the manner of the articulation of consonants, the recognition accuracy is 96.2 percent for INN, compared with 95.8 percent for the conventional network architecture. This higher accuracy is obtained with 40 percent lower training costs. Using the grouping method based on the hidden layer activation patterns of a network which has learned to recognize all syllables, the accuracy is 96.0 percent.
A method of generating template patterns from a few sample patterns in character recognition
Authors: Suzuki Akihiro , Makino Shozo , Kido Ken‐Iti , Kanai Hiroshi , Kawazoe Yoshiyuki 
Published: July 2007

AbstractTo recognize a character using a pattern matching method, it is necessary to prepare sufficiently many sample patterns for a template pattern. However, it is difficult to collect a sufficient number of samples of some characters because they do not appear often. This paper proposes a new method of estimating a template pattern using the transfer function in a frequency range which is considered generally to be useful in such a case. The effectiveness of the method is demonstrated experimentally by using the printed Devanagari characters (in Buddhist literature) as an example.
Improved complex demodulation method for frequency analysis
Authors: Li Hao Ying , Ueda Yoshikazu , Ishii Naohiro 
Published: July 2007

AbstractSleep spindle brain waves have an important role in the sleeping mechanism. Recently, computer‐aided automatic analysis methods have been introduced in the form of numerical analysis of frequency, duration, etc., and their rapid progress has been noted. However, the spindle waves are transient nonstationary “phasic events,” and therefore their accurate frequency analysis has caused serious difficulties.Aiming at the accurate frequency analysis of the spindle waves, the authors have already proposed an analysis algorithm based on complex demodulation (CD) in the time domain, but the long processing time required for the analysis has remained a problem.This paper proposes a new analysis algorithm which combines the advantages of frequency domain CD and Hilbert transformation. This method applies Hilbert transformation mainly to speed up the measurement of instantaneous amplitude and, in the case of measuring the instantaneous frequency, the advantage of the CD method using interpolation is exploited to improve the accuracy. Here, the proposed method is explained concretely and the analysis results are investigated in comparison with the time domain CD method published earlier.
Design of a robust fault‐tolerant multiplier
Authors: Kasuga Takeshi , Kameyama Michitaka , Higuchi Tatsuo 
Published: July 2007

AbstractThis paper presents a construction of a robust fault‐tolerant multiplier aiming at high safety, where the output does not differ much from the normal value, even if a temporary fault is produced in the operation unit. For this purpose, a robust fault‐tolerant divider circuit by a fixed positive constant is devised, which is called divider. The multiplier is constructed by arranging such dividers in parallel. The proposed robust fault‐tolerant multiplier is based on the distributed coding, where the input/output information is always represented by the number of pulses. Consequently, a system‐down is not produced even if more than one temporary error is generated, which is different from the majority redundant circuit. Another feature is that there is no hardware core, such as the majority‐decision circuit for the output signal selection, and a temporary error does not produce a system‐down.
A compression algorithm for medical images and a display with the decoding function
Authors: Gotoh Toshiyuki , Nakagawa Yukihiro , Shiohara Morito , Yoshida Masumi 
Published: July 2007

AbstractThis paper describes an efficient compression method for medical images and a high‐speed display with a decoding function. An image is divided into blocks first and then whether each block has sharp edges is examined. The discrete‐cosine‐transform coding (DCT), which is efficient for a part having small gray‐level variation, is applied to a block having no sharp edge. The block‐truncation coding (BTC) which preserves sharp edges is applied to a block having edges, and then the DCT is applied to their error images.This combined procedure makes a reconstruction of the whole image in a high quality. The display developed by the authors receives the compressed data from a host computer and reconstructs images of good quality at high speed using four pipeline‐based microprocessors based on their method. Experimental results show that the image quality of parts without sharp edges is as high as the DCT method; and that of parts with edges is better than the DCT and BTC methods.The whole process, which includes transferring data from the host computer to the display, reconstruction, and display of the data, took less than 5 s for a 1/10 compressed image. This demonstrates an excellent performance of the proposed reconstruction display.
Optimizing universal queries in relational databases
Authors: Ito Minoru , Kasami Tadao 
Published: July 2007

AbstractIn a relational database system based on the universal relation interface, users do not have to specify access paths when constructing universal queries. Moreover, users cannot control how to evaluate the queries efficiently (though they can construct usual queries, such as relational algebraic expressions, considering their processing costs). Thus, it is important for the system to evaluate given universal queries efficiently. This paper considers the representative instance of a database as a universal relation, and presents an optimization algorithm for evaluating a universal query for computing specified components of the tuples in the universal relation which satisfies a specified condition.
A high‐speed labeling algorithm for raster‐scanned type
Authors: Okuyama Yoshiyuki , Kobayashi Yoshiki , Takenaga Hiroshi , Asada Kazuyoshi , Fujiwara Kazunori 
Published: July 2007

AbstractLabeling is a procedure by which labels are assigned separately to a number of connected components, and it is also one of the important functions in the image processing system. In the conventional raster‐scanned labeling, labels are assigned temporarily in a small local area. Then a large number of temporary labels (pairs of connected labels) is generated for the same connected component, and a long processing time is required to unify and transform them into the final label.From such a viewpoint, this paper discusses the reduction of processing time for the unification of pairs of connected labels. As a result, it is concluded that the following two approaches are effective:

Simplify the table structure for storing the pairs of connected labels
Reduce the generation of the pairs of connected labels.

The following MIN‐MAX method is devised as a means to realize (1). In the table storing the pairs of connected labels, MAX of the two temporary labels forming the pair of connected labels is adopted as the address, and MIN is used as the content data. To realize (2), it is noted that the concave and indented connected components often produce the pair of connected labels. The pixel‐embedding and the forward pixel referring methods are devised for such situations. This paper presents the algorithms for those methods, and reports on the result of evaluation.