All issues
Volume 114, Issue 9
Displaying 1-16 of 16 articles from this issue
- |<
- <
- 1
- >
- >|
-
Hisao Shiizuka1994 Volume 114 Issue 9 Pages 855-861
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSDownload PDF (1193K) -
Mikio Aoyama1994 Volume 114 Issue 9 Pages 862-868
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSDownload PDF (1211K) -
Koji Takahashi1994 Volume 114 Issue 9 Pages 869-875
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSDownload PDF (784K) -
Robert Valette, David Andreu, Janette Cardoso, Jean-Claude Pascal1994 Volume 114 Issue 9 Pages 876-880
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSDownload PDF (1357K) -
Toyoshiro Nakashima, Hirotaka Ito, Takayuki Nanri1994 Volume 114 Issue 9 Pages 881-887
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSThe wire-drawing plant system is composed of many wires for drawing, some wire-drawing machines, many devices (such as supplying-stands, waiting-stands and so on), a ceiling crane and some operators. The wires have some requirements for drawing and character such as their weight and size. So, the wire-drawing process is very complex because of the requirements, the characters and states of each device and each machine which are busy or not. But planning and estimating for this wire-drawing production system are depend on the experience of engineers and operators of the system. Therefore computer-aided analysis tool for the system is required.
In this paper, we give a wire-drawing plant system model based on Petri nets which have capability of precise and graphic description for discrete event systems and develop a software for analysing the model. We propose a tool for simulating general wire-drawing plant systems. Also we ascertain that this tool enables the wire-drawing plant system to be analysed with a high degree of accuracy according to estimations made for a real wire-drawing plant.View full abstractDownload PDF (1205K) -
Hisashi Tamaki, Susumu Mukumoto, Yoshikiyo Nishikawa, Mituhiko Araki1994 Volume 114 Issue 9 Pages 888-897
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSThis paper describes the outline of the package which gives “good” feasible schedules for production systems. Such schedules are produced by systematic search using the simulator incorporated in the package. In the simulator, production systems are modeled by generalized Petri nets, and both forward and backward simulations can be carried out. These two alternatives offer us an earliest start schedule and a latestt start schedule, respectively. As methods of making systematic search, a branch-and-bound method and heuristic methods using priority rules are incorporated at present, while the simulated annealing method and the genetic algorithm are left as future possibilities. It is assured by numerical experiments that the package can give reasonably good solutions for several problems of comparatively small size.View full abstractDownload PDF (1639K) -
Morikazu NAKAMURA, Kenji ONAGA, Seiki KYAN, Shoji SHINODA1994 Volume 114 Issue 9 Pages 898-906
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSAn autonomous distributed mutual exclusion protocol for multiple network resources is disscussed. This protocol is based on acyclic graph evolution model. This paper analyzes firing concurrency of acyclic graph evolution by graph theoretical terms. We show the network topology conditions and the scheme to control the concurrency for the mutual exclution of multiple network resources. A marked graph, a subclass of Petrinets, is often utilized as a proof tool in analysis.View full abstractDownload PDF (1129K) -
Jaegeol Yim, Peter C. Nelson, Tadao Murata1994 Volume 114 Issue 9 Pages 907-913
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSGiven two markings M0 and Mg on a predicate-transition (pr/t) net, finding a firing sequence which transforms M0 to Mg is called the reachability test problem. Once a problem in the real world has becn modeled as a pr/t net, a solution of the problem can be, in most cases, directly obtained from performing a reachability test on the pr/t net model. However, as a problem with exponential complexity, there does not exist an efficient algorithm to perform the reachability test. One method which might be used in solving such a problem is heuristic search. The efficiency and effectiveness of a heuristic search algorithm is dependent upon its heuristic function. We have found several admissible and monotonic heuristic functions which can be used to solve the reachability test problem. We have implemented an iterative deepening A* algorithm using our heuristic functions, and present the experimental results for our heuristics.View full abstractDownload PDF (1143K) -
Koji Wakimoto, Satoshi Tanaka, Jun'ichi Shibayama, Akira Maeda1994 Volume 114 Issue 9 Pages 914-921
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSWe are developing a drawing image database system that stores plant diagrams. The system scans, recognizes and stores plant diagrams. Users can then refer to any parts of the diagrams according to their needs.
Similarity retrieval, a retrieval where users show sample diagrams to describe what they want, is realized by defining a similarity measure between drawing images. The measure is based on graph representations of drawing images and it is effective for retrieval of drawing images that describe logical meaning by their structure.
In this paper, a fast retrieval method that features two-level matching between graph representations is proposed. By combining rough matching and detailed matching, the average response time is reduced to 2.8 seconds, which is about one sixth of the former method. It is confirmed that the response time is adequate for applications at plant control and maintenance.View full abstractDownload PDF (1843K) -
Yan Chen, Masakuni Narita, Takayoshi Yamada1994 Volume 114 Issue 9 Pages 922-929
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSSeveral nuclear reactor diagnostic systems using neural networks have been proposed in recent years. Neural networks trained by backpropagation, the standard training algorithm, have certain problems such as local minima and long training times. In this paper, neural networks trained by genetic algorithms were used in nuclear reactor diagnostic system to solve these problems. The system was tested by simulated data modeled on the experimental fast reactor JOYO, and two categories of abnormality (abnormal control rod vibration and abnormal coolant flow) were identified. The comparisons to networks trained by backpropagation were also discussed.View full abstractDownload PDF (1122K) -
Shogo Tanaka1994 Volume 114 Issue 9 Pages 930-937
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSIn excavating tunnels for subways and power cables, shield tunneling machines, which have many cutters, are used. The authors previously proposed an effective detection system, for the machines, which detected anomalous objects ahead, to prevent the cutters from getting damages and also to prevent the construction delay caused by the accident. The system has one sonic transmitting transducer and several sonic receiving transducers to get information on the anomalous objects. Not so many observations being available in the detection, optimal observation policy is of a practical importance. The paper discusses the optimal location of the transducers on the cutter plane of a shield tunneling machine and also the optimal observation policy which takes into account the rectlinear and revolving motions of the transducers caused by the movement of the tunneling machine.View full abstractDownload PDF (1423K) -
Kenji Misawa, Yoichiro Kojima, Goichi Saeki, Junji Arisawa, Goro Matsu ...1994 Volume 114 Issue 9 Pages 938-945
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSThis paper describes the electric conductivity and optical transmittance of a monoolein-poly (vinyl chloride) membrane. Since electric conductances of the membrane were increased with variant patterns in the taste solutions such as NaCl, Saccharose, Quinine Hydrochloride, the membrane had the electrical selectivity clearly. The conformation of the membrane changed from a turbid state to a transparent state in the taste solutions with increasing solution concentration when the membrane conductance increased. An optical transmittance of the membrane changed remarkably after the membrane was immersed in the taste solutions. By taking advantage of this optical characteristic, new usages, memory and so on, are expected in the field of ion sensor material.View full abstractDownload PDF (2104K) -
Osamu Yoshie, Ryuichi Hoshi, Junichi Aoki, Shigeki Yamagata1994 Volume 114 Issue 9 Pages 946-951
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSObject tracking simulation using neural network is described. Since control value for tracking should be determined in accordance with past state, such model is needed that can process time series. So a neuron model called “filtering neuron” is introduced. The idea is quite simple and natural: neuron with filtering synapse weight would deal with time-variant patterns well. Though this is not a new idea at all, back propagation algorithm for the network composed of filtering neurons is not introduced yet. The tracking simulation demonstrates the performance of the model, and smart tracking strategy is realized.View full abstractDownload PDF (1062K) -
Kiichiro Izumida, Katumi Sakata, Yuichiro Sato1994 Volume 114 Issue 9 Pages 952-959
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSThis paper presents a new approach to describe the shape of digtal line picutures.
The proposed method consists of the notation algorithm in distinguishing all vertexes and the equations to determine the discriminative lables of the shape for lines between a vertex and another vertex.
Each vertex of line picture is given as the peculiar designation consists of foure kinds of individualities based on ordinal relation of detection for vertex under the pixels tracking.
The discriminate lebels are determined by using equations as the function of pixels tracking vector and tracking step number.
It's verified through computational experiments, the description of a shape for unti-similar pictures belong to the same category is invariable.View full abstractDownload PDF (1096K) -
Masanori Sugisaka, Kyoichi Murakami, Fumio Ishikawa, Hiroshi Shibuya, ...1994 Volume 114 Issue 9 Pages 960-963
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSThe neural network system employed in this study has 3-layers structure which is composed of an input, a hidden, and an output layers. As a simulation example the calculation of electric power flow was considered. The results in this study show an idea how to construct the neural network system for fast calculation or simulation of the electric power equations.View full abstractDownload PDF (1232K) -
Masafumi Uchida, Hideto Ide1994 Volume 114 Issue 9 Pages 964-965
Published: August 20, 1994
Released on J-STAGE: December 19, 2008
JOURNAL FREE ACCESSDownload PDF (1001K)
- |<
- <
- 1
- >
- >|