bluuebunny/crossref_metadata_2025_split huggingface dataset:
Forecasting industrial production using non‐linear methods
Authors: Byers J. D. , Peel D. A. 
Published: July 2007

AbstractNumerous theoretical models suggests that business cycles involve nonlinear processes. In this paper we examine whether two parametric, nonlinear time‐series models—the bilinear and threshold models—can exploit apparent non‐linearity in industrial production to provide forecasts superior to those derived from the standard autoregressive models.
Visual features of yarn‐dyed fabric design: An analysis in terms of visibility
Authors: Ohta Ken'Ichi , Sakaue Katuhiko , Kosako Hideo 
Published: July 2007

AbstractThe visibility and spatial‐frequency components of a design are discussed as visual features of yarn‐dyed fabric design. The aim is to introduce objective visual features that can be used for classification in a database of yarn‐dyed fabric designs. First, the visually effective distances are measured for yarn‐dyed fabric design elements that have also been subjectively evaluated. The visually effective distance expresses the perceived differences between designs in terms of visibility at different viewing distances. Next, low‐pass filtered images of the yarn‐dyed fabric designs are correlated with the original images in terms of the measurement of the yarn‐dyed fabric's identification distance. The spatial frequency components are a visual feature of yarn‐dyed fabric design related to visibility and expressed by the visually effective distance. In addition, the cross‐correlations between the original image and low‐pass filtered images at successively greater low‐pass spatial frequency ranges are investigated. Then the characteristics of the reconstructed images are compared for different designs. The results confirm the effectiveness of using spatial‐frequency components as visual features. This method uses the visually effective distance to capture the subjective visual features of a yarn‐dyed fabric design. By virtue of its correspondence with objective spatial frequency components, this method provides feature evaluation capabilities and objectivity not found in earlier methods.
A study of modifying pruning strategies for dp beam search at a preset input frame
Authors: Kohda Masaki 
Published: July 2007

AbstractIn a conventional dynamic programming beam search, the parameters of the threshold function for pruning grid points in the dynamic programming region are assumed to be set to the same values throughout the speech input. In this paper, I describe a method designed to improve the effectiveness of decreasing the computation amount in the dynamic programming beam search by changing the parameters during speech input. An accumulated distance is defined that is not easily influenced by the quality of matching at the beginning of speech input. When this accumulated distance is used in the grid point pruning decision, the parameters of the threshold function can be changed to smaller values, at an early point in time of several frames from the beginning of the speech input, without missing grid points on the optimum dynamic programming path for the reference pattern. It was demonstrated through word recognition tests that the computation amount when the proposed threshold function is used can be decreased to about 1/5 of that in the conventional, simple grid point pruning method, and decreased by at least 1/2 compared to the threshold function of [11] because of the effectiveness of changing the threshold function's parameters at an early point during speech input.
Removal of redundancy in combinational circuits under classification of undetectable faults
Authors: Kajihara Seiji , Kinoshita Kozo , Shiba Haruko 
Published: July 2007

AbstractThis paper proposes a method for efficiently removing redundant elements using properties of undetectable faults obtained by test pattern generation. Lines of redundant elements have undetectable single stuck‐at faults. We classify undetectable faults into three categories according to the test pattern generation process, and then assume that some redundant elements can be removed concurrently. Our method produces a nonredundant circuit efficiently by using these properties and generates test patterns with high fault coverage. Some experimental results for ISCAS '85 benchmark circuits are also shown.
A contour tracking method using an elastic contour model and an energy‐minimization approach
Authors: Ueda Naonori , Mase Kenji , Suenaga Yasuhito 
Published: July 2007

AbstractThis paper proposes a method for tracking an object contour in a sequence of images. In this method, a contour model is defined by elastics. The contour tracking problem is formulated as an optimization problem to find the position that minimizes both the elastic energy of its model and the potential energy derived from the edge potential image that includes a target object contour. The contour model is updated sequentially according to the tracking result in the previous frame.In the proposed approach, the contour model not only moves toward the object contour in the current frame, but also preserves the shape of the tracked contour in the previous frame. Therefore, the proposed method makes it possible to establish object tracking even when complex texture and occluding edges exist in or near the target object. Moreover, in this method, since smooth potential fields extending over a long distance are generated by distance transformation, unlike conventional methods, long‐range motion tracking can be performed.An algorithm is newly presented which efficiently solves energy minimization problems. The validity and usefulness of the proposed method is shown with some experimental results.
MARC: A multiagent robot control system
Authors: Osato Nobuyasu 
Published: July 2007

AbstractA system based on multiagents is proposed as an information processing model for robot programming. This model uses object‐oriented representation in which physical entities are described as logical objects. An agent is an active and independent logical entity which can control objects. Agents work cooperatively and concurrently, communicating with each other to perform the task assigned to the robot. An agent starts a new job or changes its behavior when a specific event occurs or when it receives a message from another agent. This multiagent system provides robot programmers with a useful mental model for dividing the task of a robot into several segments and distributing them to several personified processes which control subtasks.This paper presents an overview of an experimental system used for multiagent robot programming and describes its implementation on a Lisp machine which supports multiprogramming and object‐oriented programming. The Tower of Hanoi task is used to test the system. It demonstrates that the multiagent system, using function‐based and behavior‐based agents, provides a high‐level modular programming environment for robot control.
A fault‐tolerant multilayer neural network model and its properties
Authors: Tan Yasuo , Nanya Takashi 
Published: July 2007

AbstractAlthough it is pointed often that multilayer neural networks should have a certain degree of fault tolerance, very few discussions based on the rigorous definition of fault tolerance have been made so far. Also, there have been few discussions on the mechanisms that bring out the fault tolerance.This paper shows that a learning algorithm that directly reduces a measure of fault tolerance can be derived in a similar way to the conventional back‐propagation. By analyzing the resulting networks, the mechanism that realizes the fault tolerance and the properties of the fault‐tolerant networks are investigated.Simulation results show the effectiveness of the proposed learning algorithm. It also is revealed that the utilization of the redundant hidden units and the saturation property of the sigmoid function realizes the fault tolerance. Moreover, it is shown that a good influence on generalization ability can be expected from the learning algorithm for fault tolerance.
A parallel processing algorithm for speech recognition using markov random fields
Authors: Noda Hideki , Shirazi Mehdi N. , Zhang Bing 
Published: July 2007

AbstractThis paper proposes a new method in which the speech recognition processing is executed framewise on the time axis by local parallel operations using the Markov random fields (MRF). There have not been many studies presented concerning the parallel execution of the speech processing. On the hand, it is anticipated that parallel processing algorithms for the recognition process proposed in this paper will be very useful in high‐performance continuous speech recognition systems, for example, where a strong computational power is required.The essence of parallel execution is to estimate the optimal state sequence by a parallel process based on the iterated conditional modes (ICM) for the given model parameters and the sequence of observed values. The local probability for the state sequence is indispensable for this purpose. It is shown that the local probability can be derived by representing the generation probability of the state sequence in a HMM (hidden Markov model) as a Gibbs distribution and calculating its conditional distribution.The foregoing property implies that the one‐sided Markov chain used in HMM can be converted into a two‐sided Markov chain in the one‐dimensional MRF. Through the speaker‐independent digit speech recognition experiment, it is shown that the proposed parallel processing algorithm has recognition performance comparable to that of the Viterbi algorithm.
Multiple optical flow—fundamental constraint equations and a unified computational theory for detecting motion transparency and motion boundaries
Authors: Shizawa Masahiko , Mase Kenji 
Published: July 2007

AbstractConventional optical flow estimation algorithms were based on fundamental constraint equations that assume the existence of a single‐flow vector at each point in the image. However, since these fundamental constraint equations are not satisfied in certain regions, correct flow estimation can become impossible. Such regions include those where multiple flows arise due to objects with reflective surfaces and transparency or in regions where the flows become discontinuous at the boundaries of an object.This paper derives first extensions of the conventional fundamental constraint equations for optical flow in the real and frequency domains that are satisfied whennflow vectors exist at each point in the image. Algorithms are also given for solving the fundamental constraint equations in the generaln‐fold flow case. Then for the double‐flow case, an algorithm is derived by computing two sets of flow parameters in closed‐form equations from the time‐varying image Gabor expansion.Next, margin energy is defined as the index for representing how well the optimization problem is posed for each degree of multiplicity (“well‐posedness”), and a criterion is obtained to determine the number of flow vectors at each image point. Finally, the effectiveness of the algorithm is verified for synthesized images containing motion transparency and motion boundaries.This papers proposes fundamental constraint equations for multiple optical flow as the basic equations for extending the various conventional motion vision models and time‐varying image analysis algorithms so that they can handle multiple motion transparency, and motion boundaries.
Structure recognition of various kinds of table‐form documents
Authors: Luo Qin , Watanabe Toyohide , Sugie Noboru 
Published: July 2007

AbstractThe recognition of the structure of a document is to discriminate the layout structure, i.e., the two‐dimensional configuration and format, of the document, and to identify the individual item data. Most of the studies of this kind so far, however, are based on the paradigm for the document structure discrimination, where the information concerning the document structure is defined beforehand for a particular type of document and is utilized as the knowledge‐base. Such a paradigm is successful in recognizing the same document structure or document structure of the same kind, but is not applicable to the case where various kinds of document structures are mixed.This paper addresses table‐form documents as the objects of processing, and reports on a method which can recognize the document structures for various kinds of table‐form documents. Various classes of table‐form documents with various configurations and contents are available according to its use and adjacent relationship between item fields. To recognize exactly the document structure for various kinds of table‐form documents, it is essential to develop the processing method based on the information for each class of table‐form documents. For this purpose, the classification tree is used, which hierarchically manages the information for each case of table‐form documents.A structure recognition system for multiple kinds of table‐form documents, is realized with this framework, including the recognition of table‐form document class, the automatic acquisition of layout structure information and the recognition of document structure.
Wafer‐scale integration implementation of mesh‐connected multiprocessor systems
Authors: Numata Issei , Horiguchi Susumu 
Published: July 2007

AbstractWith recent advances in VLSI technology, Wafer‐Scale Integration implementation is becoming realistic, wherein massively parallel multiprocessors are implemented on a single wafer. As a result of this technique, the connections among VLSI become unnecessary and a high‐speed, high‐density system will be realized. This paper considers the mesh‐connected network, which is one of the configurations of the massively parallel multiprocessor system, and discusses the reconfiguration techniques in realizing the network on the wafer. The reconfiguration technique is necessary for composing a system on a wafer, and several techniques have been proposed to date. Most of these, however, are based on global information or can be applied only to special cases. Consequently, they are not suitable for the self‐reconfiguration scheme of a massively parallel system. From such a viewpoint, this paper proposes and evaluates an autonomic self‐reconfiguration scheme using only local information, wherein the nondeterministic algorithm is added to the conventional method. It is seen as a result that the proposed method can realize a higher yield than the conventional method, as the array size becomes larger and the portion of the redundant PE becomes less.
Human‐face search and location in a scene by multi‐pyramid architecture for personal identification
Authors: Kosugi Makoto 
Published: July 2007

AbstractTo realize fully automated face image recognition, there must be thorough processing from the detection of the face in a scene to recognition. It is very difficult, however, to apply the detection or recognition process based on the shape features as in the conventional method to the face which is a typical soft object.This paper aims at personal identification by the facial image. The face in a scene is sought by coarse‐to‐fine processing using only the gray‐level data, and the result is applied to the recognition.First, the human head is detected from the scene using the multiresolution mosaic. Then the central part of the face is detected from the head region using the mosaic, and the precise position is determined based on the histogram for the eye and the nose region. The search algorithm is applied to 100 personal images derived from the motion image. The detection and location succeeded in 97 percent of the cases, except for the face with eyes shielded by hair, for example. When the result of successful detection is applied to the recognition, the recognition rate of 99 percent is obtained. In this method, a facial image of any size at any position in a scene can be detected. Other features are that the background can be uniform, and the color data are not required, which greatly relaxes the past requirement for the input image.
Networked bubble propagation method as a polynomial‐time hypothetical reasoning for computing near‐optimal solution
Authors: Ohsawa Yukio , Ishizuka Mitsuru 
Published: July 2007

AbstractHypothetical reasoning is important to knowledge system framework due to both its theoretical basis and its usefulness in solving practical problems including diagnosis, design, etc. One crucial problem with hypothetical reasoning is, however, its slow inference speed. To achieve practical or tractable speed, an approximate solution method of 0–1 integer programming named Pivot and Complement has been applied so far to a cost‐based hypothetical reasoning, in which a numerical weight is assigned to each possible element hypothesis and an optimal solution hypothesis‐set with the minimal sum of its element hypotheses' weights is searched. In this method, all described knowledge is regarded as constraints. Then, the restricted part of knowledge is transformed into inequalities to apply 0–1 integer programming. While the computational complexity of hypothetical reasoning is NP‐complete or NP‐hard, an approximate solution method of 0–1 integer programming allows polynomial inference time in the order ofN4for finding a near‐optimal solution hypothesis, whereNis the number of possible element hypotheses.In this paper, in order to understand the mechanism of the foregoing method from the viewpoint of knowledge processing, it is reformalized using a new type of knowledge network. Our new networked method, name Networked Bubble Propagation is shown to have a similar (or superior) performance to the aforementioned one, i.e., the solutions it obtains are as good as those found with the Pivot and Complement method and the inference time is in the order ofN2. This speed‐up is an advantage of considering the knowledge structure of a given problem, thanks to the network.
An algorithm for computing slices for recursive program
Authors: Ueda Ryoichi , Lian Lin , Inoue Katsuro , Torii Koji 
Published: July 2007

AbstractProgram slicing is a useful technique for debugging, testing and program integration. Intuitively, by the slice of a program P is meant, for a pointnand a variablevinP, the set of statements and expressions inPthat affect the value ofvatn. To determine a slice, there must be a precise analysis of the dependencies among the statements in the program. It is difficult, on the other hand, to analyze the program containing recursions.This paper presents a static analysis for the dependencies in the program containing recursion, as well as the algorithm to determine the slice based on the result of the analysis. To cope with the recursive definition of the procedure, the proposed algorithm assumes the interprocedure information needed in the computation. This information is modified to the correct direction, and the process is iterated until the result converges.The program dependence graph is extended to hold the interprocedure information. Compared to the conventional algorithm, the proposed algorithm can analyze efficiently the program containing recursions, and can be used in the system to provide interactively the slice information.
Proposal and evaluation of time critical communication protocol with two‐level data queues
Authors: Kusunoki Kazuhiro , Nakakawaji Tetsuo , Katsuyama Kotaro , Nakano Nobumasa 
Published: July 2007

AbstractFor some distributed control applications, a highly reliable, high‐speed time‐critical communication network is required. Time‐critical communication ensures completion of data transmission for an application, or that of transaction within a time specified by the application. A protocol has been presented for time critical communication that achieves highly effective traffic ratio of time critical data using two‐level data queues. Estimates of effective traffic ratio are derived for the authors' protocol. Estimation parameters are input traffic load, ratio of time critical data in offered load, and time width for completion of data transmission.
Node processor for a parallel object‐oriented total architecture A‐NET
Authors: Yoshinaga Tsutomu , Baba Takanobu 
Published: July 2007

AbstractA node processor for a highly parallel computer based on a parallel object‐oriented computational model has been developed. The node processor consists of a PE for the execution of methods and a router for the control of message communication. The prototype PE has a high‐level instruction set that includes message sending and receiving instructions. It also supports both tagged data structure as a synchronization mechanism and dynamic data typing. The special hardware unit for tag processing achieves a speed up of about 44 percent for an add instruction.The router has been designed as independent to network‐topology. It takes approximately 5.2 μs to transfer a 35‐byte message to an adjacent node. Message transfers over multiple nodes take approximately 1.0 μs per hop.
Modeling and evaluation of responsive multiprocessor systems
Authors: Tsuchiya Tatsuhiro , Kakuda Yoshiaki , Kikuno Tohru 
Published: July 2007

AbstractA responsive system, which serves to unify a fault‐tolerant system and real‐time system, must have flexible real‐time fault recovery capability. Of the multiprocessor systems in which the number of active processors changes dynamically due to failures and repairs of processors, those with the reconfiguration capability to isolate faulty processors from the system and reconnect repaired processors to the system, in addition to the ability to process tasks in real‐time, are examples of responsive systems. Normal task processing operations may be interrupted by reconfiguration and tasks requiring real‐time processing may miss their deadline as a result. A modeling method on a stochastic reward net is proposed in this paper to represent the failure‐repair behavior of a system and changes in external environments (including fluctuations in the task arrival rate). This method explicitly considers the possibility of missed deadlines. As a result of performance evaluation using the proposed model, it is shown that system performance can be improved by controlling the timing of the system reconfiguration, thus minimizing the effects of system reconfiguration.