bluuebunny/crossref_metadata_2025_split huggingface dataset:
Direct match algorithm for production systems
Authors: Kimura Haruhiko , Kobayashi Shin‐Ya , Takebe Tsuyoshi , Sumiyoshi Kazuyuki 
Published: July 2007

AbstractA production system is a typical tool for constructing an expert system. The Rete algorithm has been used as the condition match in the production system. The Rete algorithm features in that the condition match can executed efficiently by retaining the intermediate result of matching using the data‐flow graph (called Rete network). Efficiency is deteriorated, however, when most of the intermediate results are updated by a single recognition‐action cycle. Moreover, execution time for the condition match increases rapidly with an increase in the working memory elements. From such a viewpoint, this paper proposes a condition match algorithm wherein the intermediate result of matching is not retained, and the number of working memory tuples to be examined is reduced by connecting the common variables among the condition element. The proposed algorithm directly tries the condition match without using the Rete algorithm. The execution time does not increase so rapidly as in the Rete algorithm, but increases only slowly with the increase of the working memory elements. Consequently, the efficiency of the Rete algorithm is better when there are fewer working memory elements, and the efficiency of the proposed method is better when both the number of working memory elements and the computation cost for the condition match are increased. In other words, the proposed algorithm can handle high‐cost rules.
Application of fuzzy theory to handwritten character recognition
Authors: Kimachi Masatoshi , Teshigawara Masaki , Kanayama Kenji 
Published: July 2007

AbstractThere has been much research in recent decades on character recognition methods, and some methods have already been put into practical use. There are many unresolved problems, however, with respect to handwritten character recognition as composed with printed character recognition. The authors considered discriminant functions, which constitute the most important part of a character recognition method. As a result of considering problems of conventional statistical discriminant functions, the authors propose applying the fuzzy theory to discriminant functions. The so‐called fuzzy discriminant function is capable of representing a data distribution in a more flexible manner because it consists of membership functions on the principal axes of learning samples.The authors conducted recognition experiments for handwritten characters with two types of membership functions. In one type the membership values are directly tuned based on human experiences; in the other they are derived from histograms or statistical data. With the former membership function, the recognition rate of 99.0 percent is achieved for [numeric] characters from the handwritten alphanumeric data base ETL6, and with the latter, the rate of 96.0 percent for [hiragana] characters from handwritten educational [kanji] data base ETL8. This result proves the effectiveness of the fuzzy discriminant function. It also indicates that a dynamic combination of human experiences and statistical techniques is a key to practical systems.
Nonrigid motion tracking of image sequences based on smoothness constraints
Authors: Inagawa Jun , Maejima Tsukasa 
Published: July 2007

AbstractTo estimate the motion and deformation of nonrigid objects accurately from image sequences, this paper proposes a method for nonrigid motion tracking based on smoothness constraints, which have an effect on noise reduction in optical flow computation by a gradient‐based method. The motion of nonrigid objects generally is assumed to be smooth according to such physical properties as inertia and elasticity. Therefore, such smoothness constraints are defined in space (in frame) and time (between frames) as an active net model in formulating an energy functional and Lagrange equation, and the optical flow field derived from image sequences by shape preservation and natural deformation is modified. In addition, applying continuous Kalman filtering theory for long sequences of image frames, it is possible to estimate the temporal continuous deformation of elastic objects. The nonrigid motion tracking is demonstrated by experiments involving the modification of the shape distortion yielded by noise and the reconstruction of the real motion and deformation.
Neocognitron learning by backpropagation
Authors: Ohno Michihiro , Okada Masato , Fukushima Kunihiko 
Published: July 2007

AbstractIn the neural network for pattern recognition, when the selectivity of the feature‐extracting cell is lowered to enhance the generalizing power, a tendency is produced that patterns with similar shapes but belonging to different categories are confused. Because of this property, it has been difficult to en‐hance the discriminating power to separate patterns with similar shapes without deteriorating the generalizing power. If patterns are observed, however, focusing on the features which differ between similar patterns, it will be possible to discriminate similar patterns.In the earlier neocognitron, the feature‐extracting cell has uniform sensitivity within the receptive field. Then, it is impossible to discriminate patterns by emphasizing the local feature, which is located at a particular position in the receptive field.This paper proposes a method of learning, where the sensitivity of the feature‐extracting cell is made variable depending on the position in the receptive field, and the sensitivity is adjusted by the error backpropagation. After the learning, the feature‐extracting cell exhibits a high sensitivity at the position where similar patterns have different features. Thus it is made possible to classify similar patterns without deteriorating the generalizing power.
Efficiency of the conflict‐preserving serializable scheduler for object‐oriented databases
Authors: Taniguchi Shinichi , Nishio Shojiro , Kubo Nobuya 
Published: July 2007

AbstractThis paper discusses the concurrency control of the Object‐Oriented Database System (OODBS), and presents a simulation model for the following basic elements which should be considered from the viewpoint of the data structure: (1) the entity should be modeled, based on the concept of object; (2) the definition of the attribute and the method should be inherited based on the class hierarchy; and (3) the composite object should be realized. Based on this model, performance evaluations are conducted on Two‐Phase Locking protocol (2PL) and Conflict‐Preserving Serializable scheduler (CPS). From investigations, so far, on the flat structure, CPS has shown better performance than 2PL. As a result of this study, however, it is shown that in the prominent data structure of OODBS, there exist access conflicts where the optimistic concurrency control such as CPS works effectively, as well as access conflicts where the pessimistic concurrency control such as 2PL works effectively.Accordingly, this paper proposed a new scheduler called Delayed CPS (DCPS), which realizes an adequate control according to the type of access conflict. It is seen that CPS has good concurrency performance.
A method for measuring programmer debugging performance from key strokes
Authors: Takada Yoshihiro , Torii Koji 
Published: July 2007

AbstractIn software development management, a method is necessary that is capable of measuring programmer performance objectively, and easily. This paper presents a method to measure programmer debugging performance from key strokes. Debugging performance is defined as the efficiency of programmer activities from discovery of software failures to correction of their causes. In this method, programmer activity is first categorized into several classes by monitoring key strokes. Programmer property parameters are then extracted by applying model‐based analysis on monitored programmer activity sequences. The programmer model defined here is based on the assumption that a programmer activity sequence is a Markov process. Finally, several programmer performance values are computed from the extracted parameters. The major value is D, which is the estimated length of time required for debugging one fault. Experiments show that the method is effective enough in practical software development. One of these findings is that D shows strong correlation with a value that represents programmer productivity (the length of program development time for common specifications).
Reversible subband coding of images
Authors: Komatsu Kunitoshi , Sezaki Kaoru , Yasuda Yasuhiko 
Published: July 2007

AbstractIn conventional 1D filter banks used for reversible subband coding of gray‐level still images, the high‐band signals are extrapolative or interpolative prediction error signals, the former using one side of the pixels alone and the latter using two sides of the pixels but with levels four times that of the input signals.This paper proposes a reversible subband coding method which has a high compression efficiency by reducing the entropy of the high‐band signal. This method employs 1D filter banks which use interpolative prediction error signals having levels twice that of the input signal as the high‐band signals.This paper also describes the design of non‐separable filter banks which predict a pixel in question by using four pixels around the point. The compression efficiency of the proposed method has been compared with the conventional method by using real images. The results show the following: the entropy of the proposed method is smaller than the conventional method by 0.1 to 0.5 bits/pel; some samples processed by the proposed method show a higher compression efficiency than those in the reversible predictive coding; the separable filter banks have a higher compression efficiency than the nonseparable filter banks (both based on the proposed method); and the reduced images using the proposed separable method with a lowpass filter have many taps to suppress aliasing.
The α‐parameter of autoassociative neural networks—Analysis of equilibrium states and network dynamics
Authors: Morinaga Satoshi , Harada Daishi 
Published: July 2007

AbstractThe α‐parameter for autoassociative neural networks is introduced here. This parameter allows the memory capacity of such networks to be derived without use of techniques such as the replica method and signal‐to‐noise analysis. The results of the derivation explain those obtained from simulation experiments, with the derivation relying simply on asymptotic analysis. In particular, after coarse approximation a ratio of 0.13 is obtained as an estimate of network memory capacity.Additionally, by considering the dynamical equations governing the α‐parameter, the dynamics of the network's state are analyzed during recollection. Of particular note is the result showing how the α‐parameter makes it possible to analyze networks consisting of continuous‐time neurons. Finally, the theoretical results are validated by comparing them with empirical data gathered from network simulation experiments.
A method for estimating gap junctional conductance between the retinal horizontal cells
Authors: Ishii Hiroyuki , Usui Shiro , Yamamoto Masao , Suzuki Satoshi , Kamiyama Yoshimi 
Published: July 2007

AbstractGap junction between retinal horizontal cells plays an important role in generating the center‐surround antagonistic receptive field. However, there are technical difficulties involved in measurement of the gap junctional conductance from membrane potential of horizontal cells using the ionic current model. To evaluate the proposed method, the gap junctional conductance was estimated from test data generated by the horizontal cell layer model. Conductance can be estimated with high accuracy. This method is also applied to experimental data recorded from the L‐type cell of carp retina.
Implementation of multistep fuzzy reasoning shell
Authors: Hayashi Isao , Naito Eiichi , Nomura Hiroyoshi , Wakami Noboru , Umano Motohide 
Published: July 2007

AbstractRecently, there have been many trials conducted to develop fuzzy inference systems that can handle the subjective decision of the expert. A problem in the fuzzy control system is that it is an inference composed of only a single step, and cannot be applied to the decision‐making assist or diagnosis, where the inference is made in multisteps. Another point is that the rules of the inference cannot be described for each knowledge source, which has been the conventional inference shell (deterministic inference shell).This paper proposes a fuzzy inference shell which can realize the multistep inference using the blackboard model. The proposed shell uses its own rule description language to represent the knowledge, and the description can be made by combining the new method with the conventional deterministic inference.Using the divided knowledge blocks, the multi‐step fuzzy inference can be realized using the blackboard model. The search function also is provided that can track the inference path in the multistep inference. This paper describes the basic configuration of such a shell.
A compiling technique for dataflow machines — new algorithm for optimum translation from control flow graph into dataflow graph
Authors: Yasue Toshiaki , Muraoka Yoichi 
Published: July 2007

AbstractIn this paper an optimum algorithm to translate control flow graphs to dataflow graphs is proposed for dataflow execution of sequential programs. Some of the existing analysis methods restrict the specification of a program to be processed while others require a very high analysis cost. The algorithm proposed in this paper (CD translation algorithm), (1) with a very low cost, and (2) for any control structure that can be described by a control flow graph, (3) can generate dataflow programs that give an optimum dataflow execution. Furthermore, this proposed analysis algorithm is designed to handle task level control flow graphs as well as instruction level control flow graphs, which are accepted by the existing methods, so that optimum control is possible for task level dataflow execution.
VLSI implementation and evaluation of a real‐time operating system
Authors: Nakano Takumi , Utama Andy , Shiomi Akichika , Imai Masaharu , Itabashi Mitsuyoshi 
Published: July 2007

AbstractThis paper proposed a new approach to create a very high performance real‐time operating system (OS) using VLSI technology. In this method, a quick and steady response can be guaranteed by implementing basic operations of a real‐time OS as a peripheral chip (Silicon TRON) to be connected to general purpose microprocessors. To confirm the effectiveness of this method, most basic system calls of μITRON have been designed using an HDL. Synthesis results using a 0.8 μm CMOS technology show that the most important part of the system calls can be realized as a VLSI chip. According to the evaluation results based on an FPGA implementation, the hardware portion of these functionalities can be executed within 250 ns and task scheduling can be performed with 750 ns simultaneously, both of which are approximately 6 to 50 times faster than software implementation. Accordingly, very high performance real‐time systems can be created by the proposed method.
High‐speed threshold selection algorithm for each connected region of a gray‐level image
Authors: Yamada Kouichi , Gotoh Toshiyuki , Sekiguchi Takashi 
Published: July 2007

AbstractThis paper proposes a high‐speed algorithm to extract regions for gray‐scale image based on the evaluation of the features of each connected component in each gray level. In the proposed method, first, the input gray‐scale image is divided into region components having the same gray level, and the image is represented using an adjacent and a gray‐level depth which symbolizes the connective relations between the detected region elements. Then, by searching this graph, the relationship between connected regions of different gray‐levels, and the features of each region in each gray level are detected and represented by a tree. Using this representation, the optimal thresholds to extract regions which maximize evaluations of their features can be determined individually, with the amount of computation proportional only to the number of initial components.
Performance analysis of parallel garbage collection using partial marking
Authors: Tanaka Yoshio , Maeda Atsushi , Nakanishi Masakazu , Matsui Shogo 
Published: July 2007

AbstractParallel garbage collection, which executes list processing and garbage collection (GC) in parallel, has a great potential for real‐time GC. Parallel GC, however, requires special processes that degrade collection performance. Consequently, a disruption of list processing frequently occurs since the GC process cannot keep up with consumption of cells. This paper proposes Partial Marking GC (PMGC), reports on its effect and analyzes its efficiency. The goal is to make parallel GC practicable. PMGC is a variant of generational GC incorporated in parallel mark and sweep GC algorithm. The PMGC improves its collection efficiency by limiting objects of marking, reducing time of marking and shortening average GC time. The author implemented PMGC obtained various experimental results, and confirmed that PMGC significantly improved its collection efficiency and performance of real‐time processing. The results of the experiments are in good agreement with the value obtained by analysis. PMGC is an effective way of using parallel GC for practical use.
A registration method for rigid objects using repulsive force
Authors: Kita Yasuyo 
Published: July 2007

AbstractA method to register the position and posture of a rigid object which moves in three‐dimensional space, without points and/or vector matching between before and after the movement is described. In the method, a group of coordinates of representative points of the object in the initial state, Pi(xṗ yṗ zi) (i = 1 to n), and those after the movement Pj(xj̇ yj̇ zj) (j = 1 to n), are used for the input data without knowing their point correspondences. Firstly, the object is translated from the initial position so that its centroid coincides with one of the goal positions. The difference in posture of the object is corrected by rotating round the centroid by the torque which attracts it to the goal posture. It is demonstrated that repulsive forces to each point of the object from all points at the goal posture, whose magnitude is the square of the distance between the points, satisfactorily produce such torque. The practical procedures for determining the position and posture using this principle are described, together with their characteristics and examples of applications to actual data.
An object‐oriented data model for multiple representation of object semantics
Authors: Ishimaru Tomoyuki , Uemura Shunsuki 
Published: July 2007

AbstractThis paper proposes the “poly‐aspect data model,” which is an extension of the object‐oriented data model. The purpose of the poly‐aspect data model is to represent in a natural way the multimedia data in the database. One of the features of the multimedia data is the diversified representation of the entities of the real world. In the poly‐aspect data model, the entity is interpreted as an object, and a model is provided so that multiple complete representations are given to the object. Such an object is called the poly‐aspect object. In the poly‐aspect data model, an object may have more than one instance as its representation. The class defines the format of the instance. The multiple instance of the same object are distinguished by the class names. When the attributes of multiple instances are defined by the same superclass, those attributes are interpreted to have the same semantics. The same value is shared among the instances, and the consistency is retained.As a realization example of the poly‐aspect object, the architecture of the “Sarah” database management system, which is currently being constructed experimentally is described.
On Generalization of Attribute Grammars
Authors: Kikuchi Yutaka , Katayama Takuya 
Published: July 2007

AbstractAn attribute grammar is a formal system consisting of a context‐free grammar together with semantic rules, which enables us to describe not only the syntax but also the semantics of language. The limited framework of attribute grammar, however, is not conducive to expansion of the system and the many ambiguous definitions of attribute grammar make it difficult to examine its formal nature.We propose a generalized attribute grammar based on the following two grammatical viewpoints:
the use of type‐0 grammars in place of the basic, context‐free grammars.
relaxation of the restrictions of semantic rules.
The generalization is a formal system that allows us to define computation derived from the attribute grammars. We can also use the generalization as a framework for discussing abstract characteristics of the attribute grammars.This paper provides a formal definition and classification of general attribute grammars. We define the semantics of general attribute grammars by using semantic functions whose inputs are structures derived from the underlying grammar and whose outputs are attributed structures. We provide classifications of general attribute grammars based on the abstract properties of semantic functions.We regard general attribute grammars as constraint satisfaction systems. Traditional attribute grammars are restricted in that underlying grammars are context free and semantic rules are solved by unidirectional local propagation.
A method of shortening metastable operation duration time by the use of feedback
Authors: Sato Yoichiro , Okamoto Takuji , Sugiyama Yuji , Kawai Masahiro , Kobayashi Toshifumi 
Published: July 2007

AbstractIf metastable operation (MS operation) occurs in conflict‐resolving circuits, propagation delay time of flip‐flop (FF) increases by the amount of its duration time and a malfunction may occur. This paper proposes a method of shortening duration time of MS operation that occurs when two inputs of RSFF consisting of CMOS NAND gates are switched from logic 0 to 1 approximately at the same instant. The MS operation is detected and fed back to inputs so that it is forced to terminate. A configuration of RSFF that has feedback based on this idea is first presented, and then a principle of shortening MS operation duration time follows. Then, considering implementation of RSFF by n‐well process, feedback connection and MOSFET parameters are optimized. Although hardware increases slightly by addition of feedback, the result shows the MS operation duration time increase rate against input phase difference (switching time difference of two inputs of RSFF), and the range of input phase difference for MS operation incidence are reduced by approximately 1/4 and 1/3, respectively, compared with conventional methods.
Error description on algebraic specification and its automatic addition
Authors: Hamaguchi Takeshi , Yamamoto Shinichirou , Agusa Kiyshi , Sakai Masahiko 
Published: July 2007

AbstractWe define an algebraic specification having a framework for error handling and give an algorithm for automatically appending error description. Generally, error description in algebraic specification is so complicated that it is difficult to comprehend and inconsistencies arise if handwritten. Therefore, it is effective to add error description automatically to algebraic specification that has no error description and without creating any inconsistency. Error constructors are introduced that represent error values as a framework for error handling. When there exists a term which is not equal to any constructor term, an equation to equalize the term and an error constructor are appended. To avoid inconsistency, i.e., normal value and error value become equal, we distinguish three kinds of variables. Some variables can be substituted for only by normal terms, some variables can be replaced only by error terms and some variables can be replaced by any term. Moreover, we show correctness of automatic error description addition; i.e., partitioning of terms in the normal part of sort is preserved before and after error description addition.