Saprangsit MRUETUSATORN Hirotsugu KINOSHITA Yoshinori SAKAI
This paper discusses a new image resolution conversion method which converts not only spatial resolution but also amplitude resolution. This method involves considering impulse responses of image devices and human visual characteristics, and can preserve high image quality. This paper considers a system that digitizes the multilevel input image with high spatial resolution and low amplitude resolution using an image scanner, and outputs the image with low spatial resolution and high amplitude resolution on a CRT display. The algorithm thus reduces the number of pixels while increasing the number of brightness levels. Since a CRT display is chosen as the output device, the distribution of each spot in the display, which is modeled as a Gaussian function, is taken as the impulse response. The output image is then expressed as the summation of various amplitudes of the impulse response. Furthermore, human visual perception, which bears a nonlinear relationship to the spatial frequency component, is simplified and modeled with a cascade combination of low-pass and high-pass filters. The output amplitude is determined so that the error between the output image and the input image, after passing through the visual perception filter, is minimized. According to the results of a simulation, it is shown that image quality can be largely preserved by the proposed method, while significant image information is lost by conventional methods.
ADTs (Abstract Data Types) have been known as a promising feature for extending the database applications to CAD/CAM and other engineering areas. This extension has brought a new dimension to query optimization. Conventional query optimization methods, which considers only joins as the dominant cost factor, are based on the belief that the executions of selections and projections basically take no time. However, in databases that support ADTs, this may not be true since the execution of a selection involving ADT functions may be very time-cosuming. Thus selections with ADT functions should not be considered as inexpensive operations in queries, and the conventional optimization heuristics should be enhanced to correspond to the appearance of the queries of this kind. In this paper, we show the possibility that semijoins can be used as an effective means to reduce the number of evaluations of an ADT function and consequently optimize queries containing expensive ADT selections. We suggest the enhancement of an conventional optimization heuristics by adding a semijoins pre-stage which is an additional component corresponding to expensive ADT selections. By this way, the applicable range of the conventional heuristics are extended to hold the ability of handling queries with ADT functions. Several optimization algorithms are given and some simulation results show the effectiveness of our methods.
Distributed algorithms that entail successive rounds of message exchange are called decentralized consensus protocols. Several consensus protocols use a finite projective plane as a communication structure and require 4nn messages in two rounds, where n is the number of nodes. This paper presents an efficient communication structure that uses a finite projective plane with a duality of indices. The communication structure requires 2nn messages in two rounds, and can therefore halve the number of messages. It is shown that a finite projective plane with a duality can be constructed from a difference set, and that the presented communication structure has two kinds of symmetry.
C-V and I-V characteristics of an n-MOSFET with Si-implanted gate-SiO2 of 50 nm are analyzed by using a test device with large equal channel width and length of 100 µm, and discussed for realizing a large hysteresis window of threshold voltage. Interface trap densities change logarithmically from 31010 to 11012cm2eV1 as the Si-dose at 25 keV increases from zero to 31016cm2. Threshold-voltage changes caused by 25 keV implantaions are as high as 0.2 V. Effective mobilities (subthreshold swings) change from 600 (0.10) to 100 cm2/V
Hiroshi SAWADA Yasuhiko TAKENAGA Shuzo YAJIMA
Binary decision diagrams (BDD's) are graph representations of Boolean functions, and at the same time they can be regarded as a computational model. In this paper, we discuss relations between BDD's and other computational models and clarify the computational power of BDD's. BDD's have the property that each variable is examined only once according to a total order of the variables. We characterize families of BDD's by on-line deterministic Turing machines and families of permutations. To clarify the computational power of BDD's, we discuss the difference of the computational power with respect to the way of reading inputs. We also show that the language TADGAP (Topologically Arranged Deterministic Graph Accessibility Problem) is simultaneously complete for both of the class U-PolyBDD of languages accepted by uniform families of polynomial-size BDD's and the clas DL of languages accepted by log-space bounded deterministic Turing machines. From the results, we can see that the problem whether U-PolyBDD U-NC1 is equivalent to a famous open problem whether DL U-NC1, where U-NC1 is the class of languages accepted by uniform families of log-depth constant fan-in logic circuits.
Makoto ANDO Keiichi NATSUHARA Tsutomu MURASAKI Masayuki OODO Yoshio INASAWA Masahide SATO
The effects of finite ground plane upon the patterns of the GPS patch antennas are analyzed by EEC with modified edge representation (MER). The comparison with UTD and measurements shows that low elevation patterns including axial ratios are successfully predicted.
Hiroyuki SAWASA Hideki NAKANO Kohji KOSHIJI Eimei SHU
Transmission characteristics of CPW bends having various curvatures and a fixed bend angle were measured. It was found that the transmission level shows dips at some particular frequencies, and that the dips are less pronounced as the radius of curvature becomes larger.
This paper presents a mathematical formulation of a data path allocation and floorplanning problem using the mixed integer linear programming, and shows some experimental results. We assume that a data flow graph and the scheduled result are given in advance. The chip area and total wire length are used for the quality measures of the solution for the problem. This method is applied to some examples, and compared with the other method reported previously in the points of the solution and computation time.
Tatsuo WADA Yoshihiko MATSUOKA Motoyoshi SEKIYA Keisuke SASAKI Hiroyuki SASABE
The optical waveguides containing phthalocyanine as an optically active material were fabricated and transmission properties were investigated experimentally and numerically. The positive refractive index change was observed in the glass waveguide with a vanadyl phthalocyanine thin film as a top layer. The thermal influence on refractive index change was estimated by surface plasmon measurements.
This paper uses both network analysis and experiments to confirm that the neural network learning algorithm that minimizes output variation (BPV) provides much more robustness than back-propagation (BP) or BP with noise-modified training samples (BPN). Network analysis clarifies the relationship between sample displacement and what and how the network learns. Sample displacement generates variation in the output of the output units in the output layer. The output variation model introduces two types of deformation error, both of which modify the mean square error. We propose a new error which combines the two types of deformation error. The network analysis using this new error considers that BPV learns two types of training samples where the modification is either towards or away from the category mean, which is defined as the center of sample distribution. The magnitude of modification depends on the position of the training sample in the sample distribution and the degree of leaning completion. The conclusions is that BPV learns samples modified towards to the category mean more stronger than those modified away from the category mean, namely it achieves nonuniform learning. Another conclusion is that BPN learns from uniformly modified samples. The conjecture that BPV is much more robust than the other two algorithms is made. Experiments that evaluate robustness are performed from two kinds of viewpoints: overall robustness and specific robustness. Benchmark studies using distorted handprinted Kanji character patterns examine overall robustness and two specifically modified samples (noise-modified samples and directionally-modified samples) examine specific robustness. Both sets of studies confirm the superiority of BPV and the accuracy of the conjecture.
Shoichiro YAMADA Masahiro KASAI
This paper deals with the wire length expressions using differentiable nonlinear functions, as a result they can be used in analytical placement methods. These expressions can be applicable to clique, bipartite-graph, and half-perimeter net models, and quadratic and Manhattan metrics to estimate the wire lengths.
Kazunobu MAMENO Atsuhiro NISHIDA Hideharu NAGASAWA Hideaki FUJIWARA Koji SUZUKI Kiyoshi YONEDA
The dielectric breakdown characteristics of a thin gate oxide during high-current ion implantation with an electron shower have been investigated by controlling the energy distribution of the electrons. Degradation of the oxide has also been discussed with regard to the total charge injected into the oxide during ion implantation in comparison with that of the TDDB (time dependent dielectric breakdown). Experimental results show that the high-energy and high-density electrons which concentrated in the circumference of the ion beam due to the space charge effect cause the degradation of the thin oxide. It was confirmed that eliminating the high-energy electrons by applying magnetic and electric fields lowers the electron energy at the wafer surface, thereby effectively suppressing the negative charge-up.
Junko KOMORI Jun-ichi MITSUHASHI Shigenobu MAEDA
A new evaluation technique of hot carrier degradation is proposed and applied to practical evaluation of p-channel polycrystalline silicon thin film transistors (TFT). The proposed technique introduces emission microscopy which is particularly effective for evaluating TFT devices. We have developed an automatic measurement system in which measurement of the electrical characteristics and monitoring the photo emission are done simultaneously. Using this system, we have identified the dominant mechanism of hot carrier degradation in TFTs, and evaluated the effect of plasma hydrogenation on hot carrier degradation.
Yukiharu URAOKA Koji ERIGUCHI Tokuhiko TAMAKI Kazuhiko TSUJI
Plasma damage to gate oxide is studied using the test structures with various length antennas. It is shown that the plasma damage to gate oxide can be monitored quantitatively by measuring charge to breakdown (QBD). From the QBD measurements, it is confirmed that the degradation occurs in the duration of over-etching but not in the duration of main etching. The breakdown spots in gate oxide are detected by a photon emission method. The breakdown are caused by plasma damage at the LOCOS edge. A LOCOS structure plays an important role for the degradation by the plasma damage.
Hannes STIPPEL Siegfried SELBERHERR
A fully three-dimensional simulation tool for modeling the ion implantation in arbitrarily complex three-dimensional structures is described. The calculation is based on the Monte Carlo (MC) method. For MC simulations of realistic three-dimensional structures the key problem is the CPU-time consumption which is primarily caused by two facts. (1) A large number of ion trajectories (about 107) has to be simulated to get results with reasonable low statistical noise. (2) The point location problem is very complex in the three-dimensional space. Solutions for these problems are given in this paper. To reduce the CPU-time for calculating the numerous ion trajectories a superposition method is applied. For the point location (geometry checks) different possibilities are presented. Advantages and disadvantages of the conventional intersection method and a newly introduced octree method are discussed. The octree method was found to be suited best for three-dimensional simulation. Using the octree the CPU-time required for the simulation of one ion trajectory could be reduced so that it only needs approximately the same time as the intersection method in the two-dimensional case. Additionally, the data structure of the octree simplifies the coupling of this simulation tool with topography simulators based on a cellular method. Simulation results for a three-dimensional trench structure are presented.
In this paper, we present a unified model for dialogue understanding involving various sorts of ambiguities, such as lexical, syntactic, semantic, and plan ambiguities. This model is able to estimate and revise the most preferable interpretation of utterances as a dialogue progresses. The model's features successfully capture the dynamic nature of dialogue management. The model consists of two main portions: (1) an extension of first-order logic for maintaining multiple interpretations of ambiguous utterances in a dialogue; (2) a device which estimates and revises the most preferable interpretation from among these multiple interpretations. Since the model is logic-based, it provides a good basis for formulating a rational justification of its current interpretation, which is one of the most desirable aspects in generating helpful responses. These features (contained in our model) are extremely useful for interactive dialogue management.
Masashi ICHINOSE Hiroshi TOKUNAGA
From the viewpoint of customer's satisfaction, precise information and rapid action are very important when complaints about call connection failures or service quality deterioration come from customers. It is indispensable to the propose that operators are supported by an operation system which stores and processes each customer's information, their complaint's histories, network failure status and call connection detail data. This paper shows functions and Human Machine Interface (HMI) of Customer Complaint Handling System (CCHS). This system can handle a customer's complaint by an electric ticket and necessary information is automatically collected and shown on the ticket.
Akihiro KASHIHARA Koichi MATSUMURA Tsukasa HIRASHIMA Jun'ichi TOYODA
This paper discusses the design of an ITS to realize a load-oriented tutoring to enhance the student's explanation understanding. In the explanation understanding, it is to be hoped that a student not only memorizes the new information from an explanation, but also relates the acquired information with his/her own knowledge to recognize what it means. This relating process can be viewed as the one in which the student structures his/her knowledge with the explanation. In our ITS, we regard the knowledge-structuring activities as the explanation understanding. In this paper, we propose an explanation, called a load-oriented explanation, with the intention of applying a load to the student's knowledge-structuring activities purposefully. If the proper load is applied, the explanation can induce the student to think by himself/herself. Therefore he/she will have a chance of gaining the deeper understanding. The important point toward the load-oriented explanation generation is to control the load heaviness appropriately, which a student will bear in understanding the explanation. This requires to estimate how an explanation promotes the understanding activities and how much the load is applied to the activities. In order to provide ITS with the estimation, we have built an Explanation Effect Model, EEM for short. Our ITS consists of an explanation planner and a self-explanation environment. The planner generates the load-oriented explanation based on EEM. The system also makes a student explain the explanation understanding process to himself/herself. Such self-explanation is useful to let the student be conscious of the necessity of structuring his/her knowledge with the explanation. The self-explanation environment supports the student's self-explanation. Furthermore, if the student reaches an impasse in self-explaining, the planner can generate the supporting explanation for the impasse.
Michio HORIGOME Yoshito KAWASAKI Qin Qin CHEN
This letter deals with the reliability function in the case of periodic preventive replacement of items in order to increase MTBF, that is, two replacement policies; strictly periodic replacement (SPR) and randomly periodic replacement (RPR). We stress on simple introduction of the reliability theory under preventive replacement policies using the Laplace transform and obtain the theoretical results of SPR and RPR. Then these results are applied to the Weibull distribution and finally in order to show useful information of preventive replacement, the numerical results of SPR are provided.
Tadashi MATSUMOTO Kohkichi TSUJI
The structural necessary and sufficient condition for "the transition-liveness means the place-liveness and vice-versa" of a subclass NII of general Petri nets is given as "the place and transition live Petri net, or PTL net, ÑII". Furthermore, "the one-token-condition Petri net, or OTC net,