Gy Bum KIM Gang Soo LEE Jung Mo YOON
In this paper, we show that Petri nets can be applied practically to design and analysis of concurrent, parallel and embedded mode systems such as a lift system that is familiar to our daily life. Modeling behavioral characteristics of the lift, we extend a standard Petri net by constant timed transition, faultable transition, stochastic transition and condition transition concepts. Likewise, we prsesnt some results of design and analysis of the system. This method can be applied to design and analysis of another concurrent systems.
This article discusses on PDM (Petri net based Development Methodology) which integrates approaches, modeling methods, design methods and analysis methods in a coherent manner. Although various development techniques based on Petri nets have demonstrated advantages over conventional techniques, those techniques are rather ad hoc and lack an overall picture on entire development process. PDM anticipates to provide a refernce process model to develop distributed systems with various Petri net based development methods. Behavioral properties of distrbuted systems can be an appropriate application domain of PDM.
Alauddin Y. ALOMARY Masaharu IMAI Nobuyuki HIKICHI
One of the most interesting and most analyzed aspects of the CPU design is the instruction set design. How many and which operations to be provided by hardware is one of the most fundamental issues relaing to the instruction set design. This paper describes a novel method that formulates the instruction set design of ASIP (an Application Specific Integrated Processor) using a combinatorial appoach. Starting with the whole set of all possible candidata instructions that represesnt a given application domain, this approach selects a subset that maximizes the performance under the constraints of chip area, power consumption, and functional module sharing relation among operations. This leads to the efficient implementation of the selected instructions. A branch-and-bound algorithm is used to solve this combinatorial optimization problem. This approach selects the most important instructions for a given application as well as optimizing the hardware resources that implement the selected instructions. This approach also enables designers to predict the perfomance of their design before implementing them, which is a quite important feature for producing a quality design in reasonable time.
Tsuneki YAMASAKI Hirotaka TANAKA
The scattering of electromagnetic waves by a dielectric grating with planar slanted-fringe is analyzed using the improved Fourier series expansion method. In the analysis, the slanted grating region is divided into layers to make an assembly of stratified thin modulated index layers. This method can be applied to a wide range of periodic structures and is especially effective in the case of planar slanted grating, because the electromagnetic fields in the each layer can easily be obtained by shifting the solution in the first layer. In this paper, the numerical results are given for grating with rectangular and sinusoidal dielectric profiles, and for TM and TE cases of arbitrary incident angle. The diffraction efficiencies obtained by the presented method are compared with the results by the coupled-wave approach; the influences of the slant angle on the diffraction efficiencies at the Wood's anomaly and at the coupling resonance frequency are also discussed.
Hsiao-Jing CHEN Yoshiaki SHIRAI Minoru ASADA
A method for detecting multiple rigid motions in images from an optical flow field obtained with multi-scale, multi-orientation filters is proposed. Convolving consecutive gray scale images with a set of eight orientation-selective spatial Gaussian filters yields eight gradient constraint equations for the two components of a flow vector at every location. The flow vector and an uncertainty measure are obtained from these equations. In the neighborhood of motion boundary, the uncertainty of the flow vectors increase. By using multiple sets of filters of different scales, multiple flow vectors are obtained at every location, from which the one with minimal uncertainty measure is selected. The obtained flow field is then segmented in order to solve the aperture problem and to remove noise without blurring discontinuity in the flow field. Discontinuities are first detected as those locations where flow vectors have relatively larger uncertainty measures. Then similar flow vectors are gouped into regions. By modeling flow vectors, regions are merged to form segments each of which belongs to a planar patch of a rigid object in the scene.
Mario G. FROMOW RANGEL Akira NOGUCHI
The inverse problem we consider in this paper seeks, based on the equivalent source method, to determine the shape of perfectly conducting cylinders from the scattered farfield data obtained by using several incident waves. When incident waves of different frequencies are used, the shape of the scatterer can be reconstructed by employing only a few number of observation points. In the reconstruction problem, to determine the shape of the scatterer, the conjugate gradients method is applied. The general approach is applicable to cylindrical scatterers of arbitrary shape. Results of numerical simulations are presented to support the suggested approach.
Hiroaki YAMAMOTO Takashi MIYAZAKI
There have been several studies related to a reduction of the amount of computational resources used by Turing machines. As consequences, linear speed-up theorem" tape compression theorem", and reversal reduction theorem" have been obtained. In this paper, we consider reversal- and leaf-bounded alternating Turing machines, and then show that the number of leaves can be reduced by a constant factor without increasing the number of reversals. Thus our results say that a constant factor on the leaf complexity does not affect the power of reversal- and leaf-bounded alternating Turing machines
A technique for reducing fiber four-wave mixing (FWM) in multichannel transmissions is proposed. Birefringent elements are inserted on the way of transmission lines. Due to the effect of birefringent elements on the polarization states, the effective crosstalk due to FWM is expected to be 3/16 of that in the worst case in conventional systems.
This paper first proposes a fast fingerprint identification method based on a weighted-mean of binary image, and further investigates optimization of the weights. The proposed method uses less computer memory than the conventional pattern matching method, and takes less computation time than both the feature extraction method and the pattern matching method. It is particularly effective on the fingerprints with a small angle of inclination. In order to improve the identification precision of the proposed basic method, three schemes of modifying the proposed basic method are also proposed. The performance of the proposed basic method and its modified schemes is evaluated by theoretical analysis and computer experiment using the fingerprint images recorded from a fingerprint read-in device. The numerical results showed that the proposed method using the modified schemes can improve both the true acceptance rate and the false rejection rate with less memory and complexity in comparison with the conventional pattern matching method and the feature extraction method.
Shinichiro KOBA Moriaki UCHIYA Akio NAKAO Satoru HIGO Iwazo KAWANO Tetsuya OGUSHI
The barrier-layer was successfully fabricated for a preparation of tunneling junction using high Tc oxidesuperconductor such as Bi-Sr-Ca-Cu-O system. Bi2Sr2Ca2Cu3Ox films were used for both superconducting electrodes and the barrier was mainly Bi2Sr2CaCu2O and the rest that was formed by effects of de-calcium from the first sputtered (2223) film. The reaction of de-calcium occurred immersing it in carbonated water. The change of (2223) phase of BSCCO was confirmed with a comparison of the intensity of X-ray diffraction. The superconductive transition temperature of the junction is different from that of the single film (2223) which had no treatment with carbonated water. Zero-bias-currents through fabricated barrier are observed and the critical currents depend on temperature so far as measured temperature region of 79 K-72 K.
Kazuo SAKAI Shinji MIGITA Hiroyuki OTA Hiroshi OTERA Ryozo AOKI
Bi2Sr2CuOx (Bi(2201)) thin films have been fabricated by atomic layer-by-layer deposition using ion beam sputtering (IBS) method. During the deposition, 14 wt%-ozone/oxygen mixture gas of typical pressure of 5.010-5 Torr is supplied with ultraviolet light irradiation for oxidation. XRD and RHEED investigations reveal that a buffer layer with compositions different from Bi(2201) is formed at the early deposition stage of less than 10 units cell and then Bi(2201) oriented along the c-axis is grown.
Ryozo AOKI Hironaru MURAKAMI Tetsuro NAKAMURA
The Cooper pairing interaction in high Tc oxide superconductor is discussed in terms of an empirical expression; TcDexp[1/g], gc
Akio KAWABATA Tadayuki KOBAYASHI Kouichi USAMI Toshinari GOTO
A sputtering system using dc hollow cathode discharge was developed for the propose of high Tc superconducting devices. Using this system, as-grown superconducting thin films of YBCO have been formed on MgO and SrTiO3 substrates. Influence of the sputtering conditions such as the substrate temperature and discharge gas pressure on the Tc and lattice parameter was investigated. It was found that superconducting films on MgO with Tc
Masanari TANIGUCHI Junichi FUKUDA Tasuku TAKAGI Isamu AKASAKI
The authors developed new measuring system (Holographic Pattern Measuring System [HPMS]), which is composed of both techniques of holography and graphic image processing, was used to measure the vibrations of a printed circuit board (PCB) due to operation of a mounted electromagnetic relay on it. The clear vibration patterns were obtained. By using pattern analysis processor, quantitative vibration patterns of the PCB surface were observed. Both the vibration patterns and displacements were changed by edge fixing way of the PCB.
Yoshikazu MIYANAGA Koji TOCHINAI
This paper proposes a multi-layer cellular network in which a self-organizing method is implemented. The network is developed for the purpose of data clustering and recognition. A multi-layer structure is presented to realize the sophisticated combination of several sub-spaces which are spanned by given input characteristic data. A self-organizing method is useful for evaluating the set of clusters for input data without a supervisor. Thus, using these techniques this network can provide good clustering ability as an example for image/pattern data which have complicated and structured characteristics. In addition to the development of this algorithm, this paper also presents a parallel VLSI architecture for realizing the mechanism with high efficiency. Since the locality can be kept among all processing elements on every layer, the system is easily designed without large global data communication.
Kazuhiko HAMAMOTO Tsuyoshi SHIINA
Reflection mode diffraction tomography is expected to reconstruct a higher resolution image than transmission mode. Its image reconstruction problem, however, in the many cases of practical uses becomes ill-posed one. In this paper, a new reconstruction method of limited angle reflection mode diffraction tomography using maximum entropy method is proposed. Results of simulation showed that the method was able to reconstruct the better quality images than IR method poposed by Kak, et al.
Wataru CHUJO Masayuki FUJISE Hiroyuki ARAI Naohisa GOTO
In a two-layer self-diplexing antenna fed at two ports, theoretical analysis has already shown that the isolation characteristics can be improved by adjusting the angle between the feed locations of the transmitting and receiving antennas. In this letter, we experimentally investigate the isolation characteristics of the self-diplexing array antenna. First, calculated and experimental results for each feed location of the element antenna are compared and good agreement is found. Second, experimental results with a 19-element planar array indicate that a self-diplexing antenna with suitably chosen feed configuration is effective in improving the isolation in a phased array antenna.
This paper proposes a compact high-speed ATM switching architecture that employs a novel arbitration method. The NN matrix shaped crosspoint switch is realized with D small switch blocks (SSBs). The number of crosspoints and address comparators is reduced from N2 to (N/D)2. Each block contains N/D input lines and N/D output lines. The association between output lines and output ports is logically changed each cell period. This arrangement permits each input port to be connected to N/D output ports in each cell period. Output-line contention control is realized block-by-block so high-speed operation is realized. The traffic characteristics of the proposed switch architecture are analyzed using computer simulations. According to the simulation results, the cell loss rate of 10-8 is achieved with only 100-cell input and output-buffers under the heavy random load of 0.9 for any size switch. The proposed ATM switching architecture can construct the Gbit/s high-speed ATM switch fabric needed for B-ISDN.
Hiroyuki YABUKI Morikazu SAGAWA Mitsuo MAKIMOTO
This paper describes the fundamental principle of novel push-push oscillators using hairpin-shaped split-ring resonators and their application to voltage controlled and injection locked oscillators for frequency synthesizers. The experimental results make it clear that the synthesizer systems discussed here have the advantages of high frequency operation, compact size and low power consumption. Experimental work has been carried out in the L band, but these systems can be applied to much higher frequencies.
Young Pyo JUN Hyunsoo YOON Jung Wan CHO
The self-organizing feature map is one of the most widely used neural network paradigm based on unsupervised competitive learning. However, the learning algorithm introduced by Kohonen is very slow when the size of the map is large. The slowness is caused by the search for large map in each training steps of the learning. In this paper, a fast learning algorithm based on incremental ordering is proposed. The new learning starts with only a few units evenly distributed on a large topological feature map, and gradually increases the number of units until it covers the entire map. In middle phases of the learning, some units are well-ordered and others are not, while all units are weekly-ordered in Kohonen learning. The ordered units, during the learning, help to accelerate the search speed of the algorithm and accelerate the movements of the remaining unordered units to their topological locations. It is shown by theoretical analysis as well as experimental analysis that the proposed learning algorithm reduces the training time from O(M2) to O(log M) for M by M map without any additional working space, while preserving the ordering properties of the Kohonen learning algorithm.