bluuebunny/crossref_metadata_2025_split huggingface dataset:
Discriminative efficiency methodology for validating software quality classification models
Authors: Takahashi Ryouei , Wakayama Hirofumi 
Published: July 2007

AbstractThe use of discriminant analysis for controlling software quality using complexity metrics is explored. One of the main problems in discriminant analysis involves selecting the principal components among complexity metrics that affect the classification of software modules into several groups based on quality.This paper focuses on the use of Akaike information criterion (AIC) procedures for selecting these principal components. These procedures are based on the residual sum of squares obtained from the maximum likelihood estimation and the number of complexity metrics. The validity of using AIC procedures is confirmed by Wilks A ‐criterion procedures, taking the discriminant efficiencies (i.e., F‐test values) of models and those of complexity measures into account. Experiments show that AIC procedures can identify the model that has the highest discriminant efficiency with a low misclassification ratio and that the maximum F‐test value model is an approximate solution of the minimum AIC estimated model.
Data‐driven segmentation of textured images using hierarchical markov random fields
Authors: Noda Hideki , Shirazi Mehdi N. 
Published: July 2007

AbstractThis paper proposes an algorithm for a data‐driven segmentation of an image consisting of multiple textures. The method uses hierarchical Markov random fields (MRF) consisting of two layers: the first layer MRF representing invisible regional images; and the second layer MRF representing a different texture in each region. This method is based on the EM algorithm for estimating the maximum likelihood of incomplete data, to treat invisible regional processes. The algorithm repeats an estimation of the MRF parameters and a segmentation (estimation of region processes). The former is carried out by maximizing a pseu‐dolikelihood function; the latter is carried out by applying [the deterministic iterative relaxation algorithm] (developed by the authors) to the textured images. The proposed algorithm has been confirmed successfully by computer simulations using artificially composed textures.
Analysis of the error back‐propagation learning algorithms with gain
Authors: Jia Qi , Hagiwara Katsuyuki , Usui Shiro , Toda Naohiro 
Published: July 2007

AbstractAs the method to accelerate the learning by error back‐propagation, several studies have been proposed in which the parameter called gain is introduced. In those studies, however, the acceleration effect is evaluated only numerically, and there is no theoretical analysis of the effect of the gain on the learning process.This paper points out that those studies can also be realized by methods without introducing the gain, and presents a detailed analysis of the effect of the gain from a unified viewpoint. The following properties are revealed as a result. The error back‐propagation method, in which a constant gain is introduced, can be reduced to the ordinary error back‐propagation method without introducing the gain. When the dynamic gain is introduced, the method cannot be reduced to the steepest descent method, as well as the momentum method, without introducing the gain. Furthermore, it is shown that there exists a characteristic superellipse that determines the behavior of the gain.By analyzing the characteristic superellipse, a theoretical basis is provided for the instability of the method introducing the dynamic gain. This paper presents a unified treatment of the method introducing the gain and the method not introducing the gain from a unified viewpoint which have been considered independently. The effect of the gain on the learning process is analyzed, which will help in developing a new learning method in the future.
A method of motion analysis using spatiotemporal image‐directional temporal plane transform
Authors: Taniguchi Hiroyasu , Seki Akinobu , Kuroda Shin‐Ichi , Ikebata Shigeki , Furusawa Haruki 
Published: July 2007

AbstractSome of the recent image processing methods proposed for detecting object moving in 3‐D space form a spatiotemporal image by placing consecutive camera images side by side in temporal order. This paper presents one such method, the directional temporal plane transform method (DTT), an image processing method that is not influenced by environmental changes. Assuming that the objects are moving on a nearly constant path, DTT first extracts significant data about these objects from each image, and then makes a 1‐D data stream by projecting the data long a directional axis parallel to the moving loci. After that, by placing the 1‐D data from individual frames side by side in temporal order, the spatiotemporal image is transformed into a 2‐D image on a directional temporal plane. Since the object motion is represented by regions of this 2‐D image, moving objects can be detected by simple 2‐D image processing. This method was used on an experimental basis to detect vehicles running along a road. Experimental results show the effectiveness of the method. An advantage of this method is its ability to detect vehicles using the same processing during both daytime and nighttime—a feature that has not been achieved with conventional methods.
Evaluation of a causal order protocol in broadcast channel
Authors: Fujii Akihiro , Nemoto Yoshiaki 
Published: July 2007

AbstractGroup and multicast communication provide basic functions for many applications in distributed computing. In such a communication, the causal ordering property among messages should hold throughout distributed sites. Several communication protocols for this purpose have been designed so far. They are designed mostly under the strong assumptions: there is no loss of messages in the communication channel or the order of the messages is preserved or both.However, in WAN environment, it is desirable to design such a protocol without assuming these conditions from the efficiency point of view.In this paper, a protocol which provides the causal ordered broadcast in a non‐FIFO network is investigated. The non‐FIFO network is defined as the network in which there exists possibilities of loss and disorder of messages. The purpose of this paper is to perform experimental evaluations to a causal ordering protocol which is specially designed for a non‐FIFO network.The protocol is implemented as a software system, and the performance evaluation of the system is done by experiments. In addition, a simple approximation of the queue length of the system is proposed. The applicability of the approximation also is investigated.
Three‐dimensional object recognition from appearance—Parametric eigenspace method
Authors: Murase Hiroshi , Nayar Shree K. 
Published: July 2007

AbstractTechnology of recognizing a 3‐dimensional object and finding its direction from a 2‐dimensional image is important in practical applications such as classification of industrial products. A typical conventional method for this purpose uses the 3‐dimensional structure of the object such as its edges and surface shapes. However, extraction of a 3‐dimensional structure with a high accuracy, notably that of an arbitrary shaped object, is difficult.This paper proposes a method of recognizing a 3‐dimensional object by using a 2‐dimensional collation. A 2‐dimensional collation which requires no 3‐dimensional feature has never seriously been examined, because it has been considered that the amounts of computation and a memory for learning the 2‐dimensional image data (which are very complex due to the variations of viewing and lighting angles) are not acceptable. The proposed method can learn a 3‐dimensional object as a set of 2‐dimensional images by using a new parametric eigenspace approach with a small memory capacity. The proposed method can easily learn a 3‐dimensional object from its 2‐dimensional image, and can recognize the object and estimate its pose. This paper includes experimental comparisons between the proposed method and other 2‐dimensional collation methods.
Competitive and selective learning method for vector quantizer design—Equidistortion principle and its algorithm
Authors: Ueda Naonori , Nakano Ryohei 
Published: July 2007

AbstractA new competitive learning approach for optimal vector quantizer is presented. First, it is shown that the original Competitive Learning (CL) algorithm can be derived from the two necessary conditions forming the basis of the traditional nonconnectionist vector quantizer (VQ) design algorithm called the LBG algorithm. It is then shown that the conventional conscience principle or equiprobable principle is not optimal from the standpoint of the minimization of the expected dis‐tortion. Next, a basic principle is introduced. Called the equidistortion principle (a necessary condition for optimal vector quantizers) it is derived by using Gersho's asymptotic theory. It is shown to be applicable to distributions consisting of disjoint clusters. Then a new competitive learning algorithm with a selection mechanism, called the competitive and selective learning (CSL) algorithm and based on the equidistortion principle, is proposed here. Since the selection mechanism enables the system to escape from local minima, the proposed algorithm can obtain better performance without a particular initialization procedure even when the input data clusters in a number of regions in the input vector space. In a synthetic one‐dimensional quantizer problem in which the optimum quantizer can be numerically obtained, less than 2% of the minimum distortion has been found which had not been obtained previously by con‐ventional algorithms.
A learning method for recurrent networks based on minimization of states of finite state machines
Authors: Noda Itsuki 
Published: July 2007

AbstractA new learning method for simple recurrent networks (SRN) is proposed. The correspondence between SRNs and finite stage machines (FSM) is examined and then a learning method for FSMs is constructed based on the state‐minimization technique of FSMs. This method comprises three stages: (1) generating states according to input histories; (2) grouping states according to outputs and next states; and (3) combining states within the same groups and reconstructing state transitions. Then, three networks, each behaving in the same manner as each stage through learning, are considered. A unified model of these networks and its learning method are proposed. The effectiveness of the proposed model and the learning method are verified by experimental results.
The extended C language NCX for data‐parallel programming
Authors: Yuasa Taiichi , Kijima Toshiro , Konishi Yutaka 
Published: July 2007

AbstractNCX is an extended C language for data‐parallelism, which is one of the most important computation models to support realistic applications of massively parallel computers. The design criteria of the language include easy shifting from C language, low‐cost implementation of efficient compilers, and high integrity as a programming language. The language is based on the concept of virtual processors, each being powerful enough to execute the full‐set C language. Several features for data‐parallel computation, such as interprocessor communication, are added to the language so that obey the design principles of the base language C. The language is intended to be used on various architectures and is now being implemented for some machines with different architectures. This paper overviews the major extended features of NCX, together with some programming examples, and shows that NCX provides sufficient expressive power for dataparallel computation while it is based on the simple and clear notion of virtual processors.
Test generation for sequential circuits using parallel fault simulation with random inputs
Authors: Takamatsu Yuzo , Higashi Isao , Kodama Tsuyoshi 
Published: July 2007

AbstractThis paper presents a simple test generation method for sequential circuits using a parallelesimulator with random inputs. The proposed test generation method generates sequences by simulating as many states as possible, without using a cost function for a target fault. To generate effective test sequences, dynamic switching is done between I‐Mode and S‐Mode parallel simulators. Here the I‐Mode simulates 32 patterns for one state in parallel and the S‐Mode simulates 32 patterns for 32 states in parallel. Experimental results for ISCAS'89 benchmark sequential circuits show that our method achieves test sequences with high coverage in acceptable CPU time.
Character recognition system with cooperation of pattern and symbolic processing
Authors: Niwa Hisao , Yamamoto Hiroshi , Kojima Yoshihiro , Shimeki Yasuharu , Maruno Susumu , Kayashima Kazuhiro 
Published: July 2007

AbstractA newly developed character recognition method is proposed that can be applied to low quality printed documents. In this method, the cooperation of pattern processing with neural networks and symbolic processing with knowledge of language is adopted. If errors occur at one part, another part detects it and sends the error information to all parts. After successive iterations until no error is detected, a recognition result is obtained. A character recognition of 98.4 percent is obtained with this method. This rate is 2.8 percent higher than the result of a conventional method with no information exchange among processing parts.
Detection of moving objects with three‐level continuous modules
Authors: Nakai Hiroaki , Fukui Kazuhiro , Kuno Yoshinori 
Published: July 2007

AbstractThis paper proposes a method of dynamic image processing which can automatically detect a moving object from the image of a walking human. The system is composed of the three‐level functional modules, which are the detection of the changing region, tracking of the moving object and the interpretation of the motion. Those modules employ simple processing, and the precision of the individual processing is not high. The system as a whole, however, can realize a high reliability because of the error‐recovery among the modules.The proposed method is implemented on the multiprocessor system, and a moving object detection system is constructed which can extract in real‐time the locus of the motion on the image. In the past moving object detection method, there must be imposed some constraints on the scene which is the object of processing. However, the proposed experimental system operates with stability in the general environment. An experiment was conducted using the experimental system to extract the loci of motion for the passersby in the general store, and the method is shown to be effective in the general environment.
Parallel database algorithms for solving planning problems on very large databases
Authors: Ohmori Tadashi , Matsumoto Yoshihiro 
Published: July 2007

AbstractThis paper discusses cooperative distributed planning problems using multiple agents that share a very large database. It is an important framework for planning by multiple agents with incomplete information, and for evaluating behavior strategies and negotiation manners. The specific issue involves distributed constraint‐satisfying problems on databases. The problem is described as concurrent execution and repetitive execution of transactions, where each agent is deemed as a transaction that operates on a very large database. Therefore, we propose a highly efficient parallel database processing algorithm for these two basic operations.
Automatic abstract generation based on document structure analysis and its evaluation as a document retrieval presentation function
Authors: Sumita Kazuo , Miike Seiji , Ono Kenji , Chino Tetsuro 
Published: July 2007

AbstractAn automatic abstract generation system including a document structure analyzer is described. From a document, the system extracts a text structure representing rhetorical relations among sentences and sentence chunks. The system evaluates sentence importance based on the analyzed structure and decides which sentence should be discarded from an abstract. It also attempts to generate an abstract consistent with the original text by replacing connective expressions.Generated abstracts were evaluated from two points of view: the cover rate of key sentences; and the quality as document presentation media. Both experimental results proved the generated abstracts to be valid.
Evaluation of the maximum number of switching gates for CMOS circuits
Authors: Ueda Hiroaki , Kinoshita Kozo 
Published: July 2007

AbstractThis paper addresses the problem of evaluating the maximum number of switching gates. We propose both exact and approximate algorithms to evaluate the maximum or nearly maximum number of switching gates based on the branch‐and‐bound method. In these methods, iterations of partially exhaustive enumeration and information from circuit structure are used to prune the search space. These methods are implemented on Sun workstations and experiments for ISCAS'85 and ISCAS'89 benchmark circuits have been done. For small circuits, the maximum number of switching gates can be easily evaluated using the exact algorithm. For large circuits, results for the approximate algorithm are compared with results obtained by applying randomly generated vector pairs. It has been shown that the approximate method is better than the latter.
Architecture of a parallel machine: Cenju‐3
Authors: Maruyama Tsutomu , Kanoh Yasushi , Hirose Tetsuya , Muramatsu Kazuhiro , Nakata Toshiyuki , Asano Yoshihiro , Inamura Yu 
Published: July 2007

AbstractCenju‐3 is a parallel computer in which up to 256 processing elements (PEs) are connected by a highspeed multistage interconnection network. In designing the system, the architecture is tuned for up to a 256 processor system. A VR4400 with 1 MB of secondary cache memory is implemented on a multi‐chip‐module to realize a compact and high‐performance PE. The multistage network is implemented very compactly. The number of the cables is equal to the number of processors. The dedicated network interface hardware designed for the system achieves low latency and high throughput. This paper presents the machine architecture and its evaluation.
Application of verification method and a decomposition method to program modification
Authors: Ono Kouichi , Maruyama Katsuhisa , Fukuzawa Yoshiaki 
Published: July 2007

AbstractThis paper considers the case where the specification and the program are modified. A method is proposed that specifies the range which is affected by the modification using the verification method and decomposition technique. By the proposed technique, the points where the modification is required or the point which may contain an error can be estimated when the program is modified. The inductive assertion is used as the verification technique.It is assumed that the specification before modification as well as the program are already verified for the correctness. The object of verification is simplified by the comparison and validation of the verification history and the object of correctness verification. The part which is left without being simplified is the range affected by the modification before the comparison and after the correctness verification, the rage which is affected by the modification as well as the range for which the validation is not satisfies can be specified.
Stereo matching by the combination of genetic algorithm and active net
Authors: Sakaue Katsuhiko 
Published: July 2007

AbstractThere have been proposed a large number of methods to extract the three‐dimensional information in image understanding. Among those, stereo‐imaging is considered interesting as a passive method that does not affect the object. The problem of stereo imaging can be reduced to the corresponding point search problem. An attempt is made to use the following method to arrive at high‐density distance information. The energy functional is defined for the disparity considering the smoothness constraint. Then, pointwise stereo matching is realized by minimizing the functional over the whole image.The active net is one such approach. This technique often is combined with the iterative solution method based on the coarse‐to‐fine strategy using the multiple resolution, but it is not easy to achieve the matching for a wide range of disparity.This paper proposes a new stereo‐matching method, where the far‐search power of the genetic algorithm and the local optimization power of the active net are combined. It is a method in which a large number of partially corresponding patterns are prepared and calculated using the active net. Then, the genetic manipulation is applied to the set of patterns, and the optimal correspondence is sought in a stable way by iterating the change of generation. The procedure has the feature that the inadequate parameters are sorted out, and the optimal parameters are selected adaptively.
A method of communication route switching by a distributed algorithm
Authors: Kawahara Hiroto 
Published: July 2007

AbstractIn the field of computer‐network routing methods, there has been less research on fixed routing systems than on adaptive ones. However, there are a great many fixed routing systems in use on actual networks because they are simple. In fixed routing, a principal issue is which method should be used for switching to alternate routes in cases where damage to links or nodes blocks off primary routes. In the majority of cases, routing is changed by switching the links over which the packets are sent (called outgoing links). However, the methods have not yet been perfected—ping pong, looping, and other erroneous‐routing phenomena arise occasionally. This paper presents a distributed algorithm to solve these problems. An algorithm will be given for restoring the original routes after recovery from damage. Finally, it will be proved that erroneous routing will not arise even when multiple chains of operations based on the algorithms presented are in progress at the same time.
A 3.84 gips integrated memory array processor
Authors: Fujita Yoshihiro , Yamashita Nobuyuki , Kimura Tohru , Nakamura Kazuyuki , Okazaki Shin'Ichi 
Published: July 2007

AbstractAn integrated memory array processor (IMAP) ULSI with 64 processing elements and a 2 Mb SRAM has been developed to build a compact real‐time image processing system. The chip attains a 3.84 GIPS peak performance through the use of SIMD parallel processing and 1.28 GByte/s on‐chip processor‐memory bandwidth. The IMAP is capable of parallel indexed addressing, which increases applications for parallel algorithms. Created using 0.55 μm BiCMOS double layer metal process technology, the IMAP contains 11 million translators in a 15.1 × 15.6 mm2die area.