bluuebunny/crossref_metadata_2025_split huggingface dataset:
Algebraic Specification of Parallel Systems Based on Binary Relations between Events
Authors: Teshima Shigeharu , Hiraishi Hiromi , Yajima Shuzo 
Published: November 2009

AbstractA new algebraic model is proposed for operational behavior of parallel systems and present syntax and formal semantics of a specification language based on it are presented. In our model, a parallel system is considered to generate events which we consider as primitive operations of the system, not only in a sequence, but also in parallel. To characterize a history of operational behavior formally, we introduce three types of binary relations between events: timing relation, causality relation; and value relation. The history of operational behavior is considered as a set of events which these three relations are given. In a specification of parallel systems, the characteristics are specified which it should satisfy in its history of operational behavior and they are described in a first‐order predicate logic by using the three binary relations. These descriptions can be considered as axioms on the relations. Formal semantics of the specification becomes a maximal set of events which can be deduced from the axioms given as specification and initial value and input patterns of the system. This is proved to be a fix point of the deduction step.
Parallel Processing of Robot Dynamics Simulation Using Optimal Multiprocessor Scheduling Algorithms
Authors: Kasahara Hironori , Iwata Masahiko , Narita Seinosuke , Fujii Hirofumi 
Published: November 2009

AbstractThis paper discusses the parallel processing of real‐time robot dynamics simulation. Real‐time robot dynamics simulation is an indispensable technique for a robot with a high‐level function. It is a computation procedure to determine the robot motion (joint position, speed, acceleration, etc.) for the given torque and driving force at each joint. In the proposed scheme, the optimal multiprocessor scheduling algorithms developed in this paper are employed, and the dynamics of the robot arm with arbitrary shape can be simulated with the minimum processing time on a multiprocessor system composed of an arbitrary number of parallel processors. The effectiveness and the practical usefulness of the proposed parallel processing scheme ire demonstrated on the robot motion simulator using a prototype multiprocessor system. This is the first report of the robot dynamics simulation being realized efficiently by the parallel processing on the real‐time multiprocessor system. Thus it is verified that the multiprocessor robot dynamics simulator with an excellent cost‐performance ratio can be realized.
Curved‐Solid‐Object Input‐System Using Conformal Projection Method
Authors: Nakajima Masayuki , Agui Takeshi , Hanyuda Chiharu 
Published: November 2009

AbstractOne of the important themes in computer graphics is the method of designing an easy data‐input system of 3D objects. The authors proposed, in a previous paper, a polyhedron input system using a projection plane based on a conformal projection method. This paper proposes a new input algorithm for a curved object using the projection plane. Some examples are included.
A High‐speed Optical Bus and Its Design
Authors: Tajima Hiroaki , Suzuki Motohiro , Hamazaki Youichi , Sanechika Noriaki , Okada Yoshikuni , Tamura Kouichirou 
Published: November 2009

AbstractOne of the problems in the construction of a large‐scale multiprocessor system is that a long time is required for the data exchange among such system elements as the processor unit and the memory unit, which degrades the efficiency of the whole system. If the data exchange in such a system is performed by electrical wiring, a limit is imposed on the transmission speed and the reliability. From such a viewpoint, we proposed an optical data exchange system suited to high‐speed large‐capacity communication. The broadcasting optical bus using the cylindrical mirror was developed, and its feasibility was demonstrated by the recently constructed experimental pilot model. This paper presents the design method for the broadcasting optical bus based on the cylindrical mirror and the optical transmitter receivers. Expressions are derived for the optical power distribution on the transmitter receivers and the efficiency of the optical bus. The actual design is shown by an example.
Design Methods for Cascaded Gaussian Filters
Authors: Sato Yoshinobu , Tamura Shinichi 
Published: November 2009

AbstractThis paper considers the multiresolution (in terms of standard deviation) Gaussian filter, which plays an important role in the visual information processing and the signal analysis. A high‐speed and highly accurate method is proposed for Gaussian filtering and calculation of its derivative, using the filter with a recursive structure utilizing the properties of Gaussian function. The earlier method, based on the iterative convolution of Gaussian function, is generalized. The problem is reformulated permitting the variation of the weight coefficient and the scale factor (expansion ratio of standard deviation), to achieve a sufficient accuracy. First, a formulation is made for the continuous system to realize a Gaussian filter and the sequence of its derivative filters for the specified scale factor. Then based on the result, a generation formula is derived for the filter sequence in the discrete system by iterative convolutions with the same weight coefficient. Furthermore, the factors for the error in discrete representation is analyzed, and the condition is derived for suppressing the error.
Mental Model on Telephone Operation
Authors: Matsui Hiroyuki , Yokota Hiroyuki , Tokunaga Yukio 
Published: November 2009

AbstractAccording to the recent research results on the user interface, the user forms a certain mental model in the operation of an unknown function. However, it is not known, when the function is not satisfactory in the first trial, by what process the mental model is constructed. From such a viewpoint, the authors investigated experimentally the formation of the mental model in the advanced dialing function called directory dialing.The following observations were made as a result.

The mental model is constructed only from the operation knowledge already acquired by the user.
When the mental model constructed in the first trial is not acknowledged, the mental model is reconstructed by the following order:

repeat of the same operation;
change operation speed; and
change the operation procedure.

Using these observations, the formation of the mental model in the directory dialing is represented in a flowchart.
Protocol Implementation Support System and Its User Interface
Authors: Takahashi Kaoru , Shiratori Norio , Noguchi Shoichi 
Published: November 2009

AbstractTo increase the productivity of communication software development for information networks, it is necessary to establish the techniques of automatic implementation and verification of protocols. This paper presents a user‐friendly interactive protocol implementation support system which produces software corresponding to a given protocol specification. In this system, when specification is given using a protocol specification language NESDEL, a corresponding program is generated interactively by obtaining necessary information from the user. The programs are written in IDL, a communication software oriented programming language. One of the most important problems in designing this system is how to represent and acquire information necessary to generate software from a protocol. We show that the concept of frame in knowledge engineering is effective in constructing a user‐friendly interface to represent such information and to obtain necessary information from the user.
Brain Control of Voluntary Muscular Activities
Authors: Taguchi Hideo , Munakata Koichi , Kiriyama Koichi , Fujii Katsuhiko 
Published: November 2009

AbstractThe purpose of this paper is to give a clear description of the control scheme for the voluntary muscular activities by the brain. To describe the mechanism of muscular control by the complex central nervous system including the brain, it will be useful to adopt a synthetic approach in which a hypothesis is set for the functional structure of the entire motor center based on the physiological and anatomical findings, and to verify the hypothesis by referring to the observation of the muscular activities. From such a viewpoint, this paper considers first the target tracking by the forearm horizontal flection and extension. The muscular activities of the head of the biceps brachii and the head of the triceps brachii, which play major roles in the flexor and extensor muscles, were examined. It is assumed that a wide range of central mechanisms, from the visual to motor systems, is involved with the tracking forearm movement. From the viewpoint of their functional roles, the central mechanism is divided as follows from the top level: the brain reflex mechanism; the cerebrum‐cerebellum mechanism; reciprocal neural control mechanism and stretch reflex mechanisms; and the activity adjustment mechanism for the motor units, which are the final basic units for motor output. For each of these levels, the physiological findings are arranged with the interpretations from control theory. The model for the central nervous system is thus constructed. Finally, using the constructed model for the central nervous system, the tracking forearm movement is reconstructed. The behavior of the model was verified by simulating the muscular activities.
Recovery of 3D Shape Based on Generalized Symmetry
Authors: Tanaka Toshimitsu , Naito Seiichiro , Takahashi Tokiichiro , Masuda Isao 
Published: November 2009

AbstractWith the widening range of applications of computer graphics, simple methods of feeding graphic information into computers which matches the human senses are demanded. This paper proposes a method of reconstructing a 3D (three‐dimensional) shape from a line drawing by using generalized symmetry. Generalized symmetry is an extended concept of skewed symmetry and represents the synmetrical characteristics of an object in terms of its curvilinear symmetrical axes. First, this paper defines generalized symmetry and describes its property; then it describes an algorithm which reconstructs the 30 shape of an object satisfying the generalized symmetry from an orthographically projected image of the object and such additional information as auxiliary lines. This algorithm produces a description of a 3D shape by using a line drawing and a small amount of additional information. This paper also demonstrates a computer simulation of the reconstruction of a complex 3D shape (such as one described by the generalized cylinder) drawn by using a data tablet.
An Automatic Recognition System for Piping and Instrument Diagrams
Authors: Ishii Mitsuo , Ito Yoshikazu , Yamamoto Masanari , Harada Hiroaki , Iwasaki Michiko 
Published: November 2009

AbstractThis paper describes an automatic diagram input system which reads the handwritten piping and instrument diagram and recognizes the symbol, character, and line drawn on the diagram. The object is a handwritten diagram which is easily understandable by the knowledge of the designer under a very mild constraint. The symbols which are the object of recognition are of more than 200 kinds of various sizes. In addition, a large symbol with unspecified shape may be drawn, and there can be various kinds of lines. To cope with such complex diagrams containing a large amount of handwriting distortions, various diagram processing techniques are proposed. Examples are vector representation with a high accuracy, shaping of various distortions, and the two‐stage segmentation, where line, symbol and character are separated hierarchically from the vectorized figure. Other examples are the symbol recognition combining a decision tree and pattern matching, and recognition dictionary based on automatic generation of distorted patterns. The developed diagram input system is a flexible system, in which new symbols can be additionally registered, and complex handwritten diagrams can be recognized. A test was made for the system using the actually written design diagrams. The result indicated a practically satisfactory performance, where the processing time is 3 to 8 min for an A3 sized diagram by a large‐scale computer and the recognition rate is above 95 percent.
Image Segmentation Based on Distribution of a Measure of Centrality
Authors: Oh Weon Geun , Tsuji Saburo 
Published: November 2009

AbstractEdge detection can be executed by computer at a high speed and thus lends itself to region extraction. However, the edges detected from most images are imperfect due to noise and broken edges.This paper presented an edge‐based region segmentation algorithm using a global measurement called degree of centrality. Methods of computing the degree of centrality from the input image, analyzing its distribution and detecting gaps between edges will be described. The spatial relationship of disjoint boundaries and pseudoregions will be analyzed to determine region splitting and/or merging. The performance of the proposed algorithm is demonstrated via experiment using images of an indoor scene.Advantages of this algorithm include its simple work‐flow, and its ability to perform feature extraction while performing region segmentation.
Estimation of the Reciprocating Point of a Rigid Body Moving Periodically in a Two‐Dimensional Space—An Iterative Method Using a Correspondence between the Forward Path and the Backward Path
Authors: Hayashi Toyohiko , Ogawa Hidemitsu , Iijima Taizo 
Published: November 2009

AbstractThis paper provides a method of estimating a rotation center to analyze kinematically the movement of a rigid body moving periodically in a two‐dimensional (2‐D) space. The rotation center, which is derived from an axis point of the human jaw joint, is defined as a point which moves reciprocally in periodic movement. Accordingly, it is called the reciprocating point. Separating a path of the reciprocating point by its turning point, we can divide the path into two parts—the forward path and the backward path. Both paths are identical and hence it appears that any position in one path has its counterpart in the other path. We show that if we have a function corresponding to a pair of positions mentioned in the foregoing, we can estimate the reciprocating point. Then we derive an algorithm which approximates successively the function and the reciprocating point alternatively. This algorithm is proved to be effective for estimating an axis point of the jaw joint.
Improvement of Video Hardcopy Image Quality by Using Spline Interpolation
Authors: Toraichi Kazuo , Mori Ryoichi , Kamada Masaru , Ishiuchi Satomi , Yang Sai 
Published: November 2009

AbstractThis paper aims at realizing a video hardcopy of a quality required for photographs in an album. A method is proposed for digital image interpolation by which the subjective quality of the static image is improved to the same level as that of the original dynamic image. The goal of the improvement of the subjective quality was set as 1.5 times in terms of the improvement in the resolution in vertical and horizontal directions. The method is based on the bivariate quadratic spline interpolation. By calculating the corresponding impulse response, a digital filter with a high‐speed operation was designed. By simulation and psychovisual experiment, it was verified that the goal of the improvement was achieved.
Class of Queries Processed by Navigation in Network Databases
Authors: Furukawa Tetsuya , Kambayashi Yahiko 
Published: November 2009

AbstractQueries in network databases are usually processed by navigation. In this paper, queries are classified according to the network structures to be retrieved to process the queries (so‐called query schemas) and the correspondence of navigational capability, the classes of network queries, and the classes of relational queries are discussed. Simple queries are those whose answers are obtained by selection and projection of connections of records. They are divided into tree queries and cyclic queries according to the cyclicity of their query schemas. Simple queries are generalized to join queries whose answers are obtained from the Cartesian product of connections of records. Basic navigation, which produces only connections of records, can process almost all the tree simple queries and queries in some class of tree join queries. Navigation with facility to compare records can process all simple queries including cyclic queries and some class of join queries. If navigation can use variables to compare with the records' values, all simple and join queries can be processed. Natural join queries in the relational model which do not include lossy join are simple queries in the network model. Most queries including the class of relational complete ones can be processed by navigation.
High‐Efficiency Image‐Coding Method Using Vector Quantization and Block Coding
Authors: Nonomura Tomoyuki , Yamashita Kazumi , Satoh Kiyotsugu 
Published: November 2009

AbstractThis paper proposes a high‐efficiency image‐coding method which is a two‐step coding using a vector quantization and an adaptive block coding. This method is equivalent to separate quantizations of low‐ and high‐frequency components of an image signal, and was applied to the luminance signal and monochrome image obtained from a color image. The results show that this method is superior to conventional vector quantization and adaptive block‐coding method. The method was also applied successfully to a color image by converting its R, G and B signals to the Y, u and v signals, and by applying the two‐step coding method to its Y signal (luminance) and the u and v signals (chromatic ones).
Two‐Dimensional Array Processor AAP2 and Its Programming Language
Authors: Kondo Toshio , Sugiyama Yoshi , Nakashima Takayoshi 
Published: November 2009

AbstractAn SIMD cellular array processor “AAP2” and its programming language AAPL have been developed. This array processor is packed into as little as 0.2 m volume in spite of its massive processor array being composed of 256 × 256 single‐bit processing elements [PEs], each of which has 8‐kbit local memory. The compact size is due to the simple and regular array structure for dense packing and a custom CMOS LSI with 8 × 8 PEs developed for the processor array.The massive processor array offers outstanding operation power together with the following functions: (1) modified SIMD control which is able to select a different operation function or different direction of inter‐PE transfer in each PE; (2) propagation transfer operation capable of propagating data through 15 PEs within one clock cycle (330 ns).The AAPL enables a simple and efficient program to be designed due to its APL‐like scanning statements and its primitive operation statements for unique AAP functions.The high performance of the AAP2 has been shown to be equivalent in simulation capability to the very high‐speed hardware logic simul.ator or routing capability of over 1000 MIPS in the automatic chip layout design.
Service Base System: Its Concepts and Design
Authors: Ogino Tadashi , Tanaka Hidehiko , Fukazawa Tomoo 
Published: November 2009

AbstractThe service base system (SBS) has been developed as a framework for efficient utilization of computer resources in the network, including LAN and WAN. SBS is a system which provides a network environment which is easy to use by utilizing the existing network and OS.This paper presents the basic concept, fundamental configuration and prospect of SBS. The major features of this system are as follows: (1) The functions offered by the computer are modeled at the abstract level—i.e. service—and the user can utilize the functions of the computer without considering the detailed differences in the use of the computer; (2) the distributed services are managed by a three‐layered view, and the expansion of functions such as addition and combination of services can easily be performed at each node.Thus, the basic concept of SBS and the construction of each node is presented. To demonstrate the usefulness of the system, a simple experimental system was constructed by combining M680H and VAX. It was verified by the experimental system that distributed services can be utilized in a fairly flexible way. A problem left for further study is the description of the resources.
A 1‐Version Cautious Transaction Scheduler with Dynamic Version Selection
Authors: Kiniwa Jun , Katoh Naoki 
Published: November 2009

AbstractThis paper presents a one‐version cautious scheduler with version selection control CS1(WRW1±) which is an extension of a recently proposed single‐version cautious scheduler CS(WRW). The set of schedules that our scheduler CS1(WRW1±) accepts without delay properly includes the one that CS(WRW) does without delay. It is shown also that our CS1 (WRW1±) is free from cancellation anomaly and runs in polynomial time.
Anomaly Detection of Functional Programs Based on Global Dataflow Analysis
Authors: Ogawa Mizuhlto , Ono Satoshi 
Published: November 2009

AbstractThis paper proposes a new anomaly detection algorithm based on the global dataflow analysis, considering the first‐order functional program. The anomaly detection is made concerning two points: the irrelevant object which does not affect the result by evaluation; and the diverged object which will fall in an infinite loop without being terminated if an evaluation is made. The detection algorithm is based on the global functional analysis technique which determines the computation path arriving at the result of computation. Because of this property, the algorithm has a higher detection ability than the cross‐reference analysis, which simply traces the syntactic definition and reference relation. Using the proposed algorithm, the bug which may diverge the computation is detected effectively automatically, and is often produced in the program using a stream which is conceptually an infinite list.
Stereo Matching Using Segment Shape as Constraint
Authors: Seki Yasuo 
Published: November 2009

AbstractThis paper describes the stereo matching algorithm using the shape information of the edge segment as the constraint. The authors have been studying 3‐D information reconstruction by stereo vision from the viewpoints of the accuracy of correspondence and the versatility of the algorithm. A method was proposed in the course of study where the edge segment is used as the basic unit of the correspondence, and the composite edge segment is used as the real unit of correspondence to cope with the incomplete image processing.Promising results were obtained by the proposed method, but the following problems remained: (1) a heuristic method is employed for the case of more than one candidate, where the candidate with the depth closest to the average depth of the scene (called average‐depth‐oriented heuristics), which results in the restricted range of applications; (2) for simplicity, the correspondence is determined based on the adjustment only among partial contradictory candidates with the result not always being adequate. This paper aims at solution of those problems with the following points.(a) Instead of the forementioned heuristics, a method employing the shape information of the segment as the constraint is proposed which is made possible by the segment method. The direction vector sequence difference is considered as a stable measure for the difference of shapes in the left and the right frames.(b) The hierarchical clique method is proposed as the method of correspondence, where the contradictory relation between candidates is considered globally.(c) The effectiveness of the algorithm is demonstrated by a simulation experiment.