bluuebunny/crossref_metadata_2025_split huggingface dataset:
A reducing method for set of clauses using matrices
Authors: Nishioka Hiroaki 
Published: July 2007

AbstractIn resolution theory, logical formulas of a theorem and axioms must be converted to a form of a clause set (a set of clauses).For more efficient proof, it is desirable that an original clause set is a Horn set. Renaming is one of the operations which can convert a given clause set to a logically equivalent Horn set.To perform the operation for a clause set, negation signs of all literals that have the same predicate symbol should be inverted simultaneously. However, it is difficult to perform the operation systematically and efficiently.In this paper, a symbolic matrix called “literal reverse matrix” is defined for each literal in a clause. Moreover, the definition of reverse matrix is extended for a clause.All renamings which convert a given clause to a Horn clause are derived from clause reverse matrix. Consequently, all renamings which convert a given clause set to a Horn set are synthesized from renamings for each clause in the set.
Isomorphisms of group‐matrix type automata
Authors: Katsura Masashi 
Published: July 2007

AbstractThis paper discusses the representation of the strongly connected automaton. Any strongly connected automaton is isomorphic to a regular group‐matrix type automaton on its automorphism group. This paper discusses the isomorphisms among strongly connected group‐matrix type automata. When a finite group G and a strongly connected automaton B are given, a set of representatives of isomorphism classes of strongly connected automata is constructed, in which the factor automaton by the automorphism group is isomorphic to B.
Faster recognition of languages for bounded cellular automata
Authors: Miyajima Hiromi 
Published: July 2007

AbstractAdvancement of VLSI technology accelerates studies in parallel computation. These are studies of such parallel algorithms as recognition of language, sorting, matrix calculations and graph processing, of one‐way cellular automata (systolic arrays), iterative arrays, tree structure cell automata, and bounded cellular automata, etc., the goal of which is to devise simpler and faster networks. So far, systolic arrays have attracted considerable attention from theoretical as well as practical viewpoints. On the other hand, bounded cellular automata seemingly have not stimulated much interest. This paper shows that bounded cellular automata process recognition of languages faster than one‐way automata.
Psychological validity of a model of human associative processor (hasp)
Authors: Hirai Yuzo , Kamijyo Ken‐Ichi 
Published: July 2007

AbstractThis paper discusses the psychological validity of the associative model HASP, which was propsoed by one of the authors. The fan effect and the priming effect are important properties of the retrieval process in human memory. The fan effect is a phenomenon that when the number of items associated with a concept is increased, a longer time is required to select an item from those items. In HASP, one of the multiply matched associative items is selected by the competitive circuit. The fan effect can be ascribed to the delay in the selection due to the increased number of competitions. The priming effect is a phenomenon where the preceding information processing affects the succeeding processing. Depending on the relation between the consecutive information, the effect can be accounted for by the activation of the preceding information left in HASP. It is also shown that the priming effect in the unconscious processing condition, where the cognition of the preceding information is prevented, can also be accounted for. Furthermore, it is shown that the processing in HASP is well matched to the two‐level theory in lexical retrieval, where the semantic selection process for the lexically ambiguous word is composed of the processes of activating all meanings and of selecting the one matched to the context.
A neural network model based on short‐term memories for the hierarchical recognition of temporal patterns
Authors: Futami Ryoko , Hoshimiya Nozomu 
Published: July 2007

AbstractA new self‐organizing neural network model is proposed and evaluated for the mechanism of temporal pattern recognition of the auditory system. The model is constructed based on the hypothesis that total recognition of temporal patterns approximately of the length of words, is carried out by hierarchical identification and integration of the temporal relations of the constituent features. The model has a hierarchical structure in which short‐term memories storing spatial patterns, the circuits extracting temporally transient components of the pattern, and the feature detection circuits to identify spatial patterns are iteratively cascaded. After the circuit is self‐organized by repetitive presentation of training patterns, the model can correctly identify the training patterns and their temporally compressed and stretched patterns. It is also indicated that the short‐term memory function at each layer of the model is essential to the acceptance of temporally deformed patterns. Studies to expand the model to top‐down processing are also discussed.
A neural network model extracting features from speech signals
Authors: Ito Takayuki , Fukushima Kunihiko 
Published: July 2007

AbstractA feature‐extracting model for the auditory nervous system was constructed using neurons with nonlinear inhibitory mechanisms as the elements. The operation was verified by computer simulation. The model is composed of the bandpass filters corresponding to basilar membrane, the half‐wave rectifiers corresponding to the hair cells, and the feature‐extracting neurons. The feature detector is a multilayered network, where several neural layers composed of a one‐dimensional array of neurons of the same response are connected in cascade. Each neuron performs the spatio‐temporal addition for the excitatory and inhibitory inputs through spatial connections in the input‐side layer and the first‐order delay. Then, the neuron produces an output through the nonlinear inhibitory mechanism (shunt inhibition) and the analog threshold characteristics. Considering the physiological knowledge and characters of the speech, three kinds of feature‐detecting neural groups were constructed. These are: CF group to detect the interval where the frequency is kept constant; FM group to detect the interval where the frequency is varying; and the fricative noise group to detect the fricative noise. These three correspond to the features of the vowel formant, the transition from consonant to vowel or the contracted sound, and the features of most of the consonants, respectively. Computer simulation was performed with actual speech input, and it was verified that the proposed model correctly extracts the various features contained in the speech.
Simulation language based on logic for queueing network using time object
Authors: Watanabe Takashi , Nakanishi Hikaru , Sanada Hidehiko , Tezuka Yoshikazu 
Published: July 2007

AbstractQueueing network simulation (QNS) has recently been considered as one of the important means for performance evaluation of the network‐structured system. Presently, FORTRAN, simulation language GPSS and other languages are used to describe QNS softwares, but their describability is not very high. This paper notes that the simulation condition defining the QNS model can be described primarily by conditional form, and the logical language PROLOG has a high describability. A QNS‐dedicated logical language SILQ (Simulation Language based on Logic for Queueing network), is proposed where QNS model is defined by Prolog form. The language has a feature that the program can be constructed without considering a Prolog algorithm, while it has the disadvantage that the time‐scale, which is indispensable in a simulation, cannot be represented. As a means to introduce the time‐scale without degrading the describability, a time object is proposed which provides a parameter representation for the state transition in the system. Then the programming primitives are prepared to describe the operation and other events for each time object in Prolog form. Programming examples by SILQ are presented, and the result is compared with other languages, indicating the high describability of the proposed language. A sequential processing system is constructed for SILQ, and a parallel processing system is discussed, aiming at the improvement of the processing speed.
A distributed load‐balancing system and its application to list‐processing oriented data‐flow machine dfm
Authors: Takesue Masaru 
Published: July 2007

AbstractThis paper proposes a group load‐balancing system (GLB) for the multiprocessor system which can manage and allocate the load in parallel and in a distributed way. In GLB, the resources are grouped hierarchically and the request for the resource allocated to a group is assigned to the subgroup with the minimum load in that group. Consequently, the group load data are updated at each allocation time, maintaining the accurate value, leading to a high load‐balancing ability. GLB is applied to the data‐flow machine DFM II and the evaluation was made by RT level simulator. The following result was obtained: (1) The performance is improved by 20 to 30 percent compared with the random allocation; (2) the maximum performance is obtained when the processor load is set equal to the number of active state processes; (3) the load balancing can be achieved within the difference of 5 processes on the average.
Real‐time blood‐flow imaging system using ultrasonic doppler techniques
Authors: Kasai Chihiro , Harada Akimitsu , Namekawa Kouroku 
Published: July 2007

AbstractBlood flow information has been available without negatively affecting human tissues since ultrasonic Doppler techniques were introduced in medical diagnosis. But difficulties with conventional techniques include the acquisition and display of two‐dimensional data in real‐time. To overcome such difficulties, we developed a real‐time two‐dimensional blood‐flow imaging system using a complex autocorrelation technique which could display flow direction, mean flow velocity, and flow variance. In this system, blood‐flow data are displayed in color and superimposed over a black/white tomographic image (tissue form image). This paper describes an outline of the principle, the configuration of the new system and relevant experimental results. It also discusses problems that arise in employing the technique. Clinical evaluation at hospitals which use the system has proven that the system is very useful for the diagnosis of various diseases.
Recognition of echocardiogram by dynamic programming matching method
Authors: Yamada Hiromitsu , Yamamoto Kazuhiko 
Published: July 2007

AbstractThis paper applies the dynamic programming (DP) matching to the border extraction from the dynamic echocardiogram of the heart along the short axis. The method is based on the DP matching for the two‐dimensional static image. The sampled values are stabilized by the integration by time, and the border features are emphasized by the differentiation in time. The matching is made using the spatial derivative intensity, the spatial derivative direction, and the time derivative intensity. The use of the continuity constraint along the time axis in the matching is discussed. Utilizing the property of the object that the motion is periodic within a certain range, the point of motion is determined from the sum of the time derivative over a pulsatile period, and the result is utilized in the matching constraint.
Explanation facilities for novice users based on deep knowledge
Authors: Yamaguchi Takahira , Mizoguchi Riichiro , Taoka Naoki , Kodaka Hiroshi , Nomura Yasuo , Kakusho Osamu 
Published: July 2007

AbstractThe explanation facility in the traditional expert system is only to reproduce faithfully the behavior of the system. Although it is useful to system designers who have specialized knowledge, it is not satisfactory for novice users. From such a viewpoint, this paper discusses the explanation facility from the standpoint of deep knowledge, so that the system can cope with four query types of the general user, as was pointed out by W. R. Swartout. In the constructed deep systematic knowledge, the task domain is restricted in the trouble diagnosis of the machine, but is more useful than the traditional deep knowledge, since the construction is easy and the task domain is partly generalized. Query example is considered for each type, and the following functions are shown to be useful in handling those queries. The simulation assumes a certain trouble and simulates the behavior of the machine, indicates the frequency of the trouble, and locates the origin of the trouble.
Automatic recognition system for color drawings of printed circuit board
Authors: Ishii Mitsuo , Ito Yoshikazu , Yamamoto Masanari , Harada Hiroaki , Kakimoto Masanori 
Published: July 2007

AbstractThis paper describes the automatic input system for color drawing, which reads the printed circuit board pattern written with different colors for lands, vias and signal line patterns, and recognizes the elements to construct the input data for CAD. The object is a color drawing based on the traditional expression, which is drawn rather fairly in detail using color pencils, for use in the design of the printed circuit board pattern. In the processing of the color drawing, the discrimination of the color implies the discrimination of the elements in the drawing. Consequently, an exact color separation method for the image data is proposed. By the proposed processing, the color separation is realized easily in spite of the color variation, by constructing interactively the color separation map using a small computer. As the recognition of the figure element for each color, a correction method for the figure is proposed, which may contain modifications such as the noise of color pencil or the line disconnection due to overlapping of different colors.In the proposed method, the properties inherent to the printed circuit board pattern are utilized as the knowledge, and an intelligent figure processing is executed such as connection of vectors or shaping. As a result of a test using the implementation design drawing, an exact color separation was realized for the drawings of the layers drawn using four colors: red, blue, orange and green. The recognition rate for the figure is above 99.7 percent. The processing time for A1 drawing was approximately 12 min using a large‐scale general‐purpose computer. These figures are sufficient for application.
Sequential‐type distance transformation by supercomputer
Authors: Kimura Fumitaka , Honjyo Yasumasa , Miyake Yasuji , Nakayama Akira 
Published: July 2007

AbstractSequential‐type image processing algorithms for distance transformation, thinning, labeling, etc., cannot be executed efficiently by supercomputers because of the recursive data dependency between the neighborhood operations for pixels. This paper proposes a diagonal scan to replace the conventional television‐type raster scan for the efficient execution of sequential‐type distance transformation algorithms by supercomputers.It is shown for four and eight neighborhood sequential distance transformation algorithms that by changing the direction of the raster scan, the recursive data dependencies between the neighborhood operations within the same scan are removed, that parallel processing by scan line is therefore possible, and that an image processing algorithm equivalent to the original one can be obtained for the new scanning method. To verify the effectiveness of the diagonal scanning a sequential‐type distance transformation algorithm was executed on a supercomputer, the VP100. The result is five to ten times faster than the conventional sequential‐type distance transformation algorithm executed on a general‐purpose computer, the M382. It is also five to ten times faster than conventional sequential‐type distance transformation algorithms executed on a supercomputer, which shows that the diagonal scan is effective.
A support system for the blind to recognize a diagram
Authors: Kawai Yoshihiro , Ohnishi Noboru , Sugie Noboru 
Published: July 2007

AbstractIt is difficult for the blind to understand a drawing using only the tactile sense. The authors developed a system to produce graphic information with a combination of tactile and vocal outputs using a personal computer through which a drawing is processed. The system recognizes a drawing by image processing, and displays the structure of the drawing on a tactile display so that a user understands the outline of the drawing by tactile search with his or her finger. The display system has a function of a digitizer which senses the location of a touched pin and produces detailed vocal information of a part of the drawing which is indicated by the usera's finger. The proposed system requires less labor from the user in understanding a drawing, since this method passes information more efficiently than other methods. The system was tested with electric circuit‐diagrams. The results show that there is no best tactile display method for all blind people, i. e., the best method depends on each user, and this kind of vocal information should be as simple as possible.
A Method for Rapid RSA Key Generation
Authors: Gotoh Yasuko , Takaragi Kazuo , Sasaki Ryoichi 
Published: July 2007

AbstractThe RSA public key cryptosystem is one of the cryptosystems which can be applied not only to the security protection but also to the verifications of other users and messages. It is one of the most important techniques in ensuring the security of information. To construct a secure RSA public key cryptosystem, the key must be generated using primes which are robust against a “(p + 1) factorizing attack.” For this purpose, Gordon proposed a method of generating the key by sieving using known primes less than 8 bit and by employing the higher‐order exponential calculation. This paper is an extension of Gordon's approach. The range of known primes is defined optimally through an evaluation for the sieving primes less than 32 bit. The exponential calculation is simplified. The method is implemented on a program. Numerical experiment is made on a 32‐bit workstation, and the practical usefulness of the method is verified.
Pattern matching by neural networkxs
Authors: Member Yuzo Hirai 
Published: July 2007

AbstractThis paper proposes a neural network model, which performs deterministic, parallel pattern matching. The pattern is recognized by matching an input pattern containing noise and a template constructed through learning. In this paper, it is assumed that no feature detection has already been accomplished. We consider a circuit structure which merely compares a template with the noisy feature distribution pattern that appears at the output of the feature detector. This pattern matching method is based on our previous work using neural networks to determine the correspondence between stereo images. The input from the left eye, for example, corresponds to the feature distribution pattern, and the input from the right eye corresponds to the template. The difference in the positions of features in the template and the input pattern corresponds to the binocular parallax. The proposed model is composed of a pattern matching layer, a minimum distance detection layer (which selects the template close to the input feature distribution pattern, and feeds it back to the pattern matching layer for pattern matching) and the recognition layer which classifies the matched template. The results of our computer simulation indicated that perfect matching was achieved for inputs having feature distribution patterns corresponding to those used during learning. Since sequences of labels or character strings can be considered to be feature distribution patterns, the proposed network can be applied to a wide range of problems related to pattern matching.
A control method based on recognition of time sequential data transition–application to blood pressure control
Authors: Masuzawa Toru , Fukui Yasuhiro 
Published: July 2007

AbstractThe development of an automatic system which, as a means of treatment, can control the blood pressure of a patient by a continuous injection of vaso‐acting drugs is in great demand in the medical care field. However, the practical application of such a system has been postponed due to safety considerations. This paper attempts to realize the safe control of the physiological system, and a control method based on the recognition of the transition of the time‐series signal has been developed. The idea is applied to the automatic control of blood pressure. For the recognition of the time‐series signal transition, a dedicated IF‐THEN representation TMSTR (time‐sequential multiple state transition representation) is devised which includes the concepts of “state” and “time.” A method is proposed in which more than one “state” is defined for the time‐sequential data, and the transitions among states are represented by IF‐THEN rules. By this scheme, the time sequential data transition is recognized. Using the constructed representation, the physician's knowledge of the blood pressure control is represented and transplanted to the computer. Using a 16‐bit microcomputer, a closed‐loop control system is constructed. As a result of animal experiments, a blood pressure control close to that of the physician is realized, indicating the effectiveness of the proposed method in the control of the physiological system.
Learning boolean functions
Authors: Gu Qian Ping , Maruoka Akira 
Published: July 2007

AbstractAlthough various formal models of learning have been studied in the past, a realistic model taking into consideration the time required for learning has not been proposed. Recently, Valiant [8] proposed a general learning model based on the theory of computational complexity, gave a definition of learnability, and obtained various classes of learnable concepts. Based on this model, this paper investigates various objects of learning.
An equivalence in lotos and its decision method
Authors: Kaminaga Hiroaki , Takahashi Kaoru , Shiratori Norio , Noguchi Shoichi 
Published: July 2007

AbstractThis paper considers the specification described in LOTOS, which is the formal description language for the communication system. A decision method is proposed for the equivalence between two arbitrary systems (between definition of service and the protocol specifications, for example). In this paper, based on the definition of the weak bisimulation equivalence, which is the definition of equivalence in LOTOS, the concepts of the k‐weak bisimulation equivalence and the canonical 1‐weak bisimulation are introduced.It is shown that those concepts are mutually necessary and sufficient. Then, based on the canonical 1‐weak bisimulation equivalence, the decision algorithm is presented for the weak bisimulation equivalence between two LOTOS specifications with finite states by the same method as in the equivalence class partitioning of the equivalent states in a finite automaton.