This paper analyzes the faults and their mechanism of CMOS ICs using IDDQ testing technique and evalutes the reliability of the chips that fail this test. It is implemented by the three testing phases, initial test, burn-in and life test. Each testing phase includes the parametric test, functional test, IDDQ test and propagation delay test. It is shown that the short faults such as gate-oxide short, bridging can be only detected by IDDQ testing technique and the number of test patterns for this test technique is very few. After first burn-in, the IDDQ of some test chips is decreased, which is increased in conventional studies and in subsequent burn-in, the IDDQ of all test chips is stabilized. It is verified that the resistive short faults exist in the test chips and it is deteriorated with time and causes the logic fault. Also, the new testing technique which can easily detect the rsistive short fault is proposed.

Query-by-Example(QBE) is high-level display-oriented databased manipulation language that provides a convenient and unified style for querying, updating, defining, and controling a relational database. QBE is relationally complete. However, lack of aubquery constructs limits th usability of QBE significantly. In particular, certain queries cannot be represented in one window. In this paper, we define a subquery box and extend QBE for subquery construction. The Extended QBE makes it possible to represent the queries that the QBE cannot do in one window, reducing the overhead and complexity of composing those queries. We also define the grammar of the Extended QBE and present the parsing techniques. Finally, we present an algorithm to transform the queries in Exteded QBE to those in SQL. The result of the transformation can be executed using dynamic SQL features of any SQL system. The proposed language has been implemented on OS/2 using the OS/2 EE Database Manager.

In this paper a method of designing FIR filters without digital arithmetic operationsi is persented. The filter coefficients are represented by resistors combined with a differential amplifier. With this method an FIR filter can be simply impemented without refering to complex digital arithmetic operations. Furthermore, in this scheme, no additional D/A converter is needed for D/A conversion. Spectral response response of a pulse shaping filter of 17 coefficients is shown as an illustration.

It is known that a unified phase I-phase II semi-infinite optimization algorithm with a steerign parameter performs better than the original unified phase I-phase II algorithm. In this paper, the effect of the steering parameter is analized and a new algorithm is presented based on the facts that when the point x is far away from the feasible region, reaching to the feasible region is more important than minimizing the cost functio and that when the point x is near the region, it is more efficient to try to reach the feasible region and to minimize the cost function concurrently. It is also important to consider the relationship between the feasible direction and the gradient of the cost function. Even though changing the steering parameter does not change the rate of convergence of the algorithm, it is shown from examples that given new algorithm is more efficient than the previous ones.

A analog disturbance observer, which is suitable for servo motor drive, was employed to suppressi control of the impact drop disturbance. The main advantage of the observer is that a fast response disturbance estimation is obtained using the detected motor cuttent and speed. And the new M/T method for motor speed detection is proposed. The method should be able to reduce the detection dead time compared with the Ohmae's M/T method. Also, the low speed control of a servo motor using instantaneous speed detection method is described. To estimate the instantaneous speed from the average speed, the speed estimator of the first order is proposed. Actually we confirmed that these methods improve the speed control performance of the servo system with experiments.

In this paper, we demonstrate how to design a redundant robot which is suitable for the multiple task execution without any constraints on the work space. The implementation is possible by the rigid connection of a cacro-robot and a micro-robot. A 5 d.o.f. articulated robor designed for commercial purpose is utilized as a micro-robot which can perform a general task with the appropriate adjustment of its base location. The base of a micro-robot is located at a suitable position by the macro-robot designed and implemented through this research. A task assigned to this redundant robot is performed mainly by the micro-robot. However, when the micro-robot cannot perform the task by itself or when the micro-robot has difficulties in performing the task, the coordination of the macro-robot is requited. To monitor the task execution efficiency of the micro-robot, we used the 'Manipulability Measure' as a cost function. The coordination between the two robots are verified both by the simulation and the experiment.

In this paper, we present an iterative learning method of compensating for position sensor error. The previously known compensation algorithms need a special perfect position sensor or a priori information about error sources, while ours does not. to our best knowledge, any iterative learning approach has not been taken for sensor error compensation. Furthermore, our iterativelearning algorithm does not have the drawbacks of the existing interativelearning control theories. To be more specivic, our algorithm learns an uncertain function itself rather than its special time-trajectory and does not reuquest the derivatives of measurement signals. Moreover, it does not require the learning system to start with the same initial condition for all iterations. To illuminate the generality and practical use of our algorithm, we give the rigorous proof for its convergence and some experimental results.

In this paper, we manufactured the continuum receiver system for observing the continuum waves emitted from the continuum sources with using the 14m radio-telescope. The receiving system measures the total power of the continuum sources and consists of DC-amplifier, beam-chopper system. Phase-Locked Loop(PLL) circuit, blanking circuit and its period selection circuit, V/F converter, and counter part which are capable of interfacing with the computer which is used for a data acquisition and making the radio-telescope track the source. We compared the obsevation results which use the existing DVM method with the observation results which use the continuum receiver to measure the total power of the sources. Moreover, by method of beam switching observation which uses newly installed beam chopper system. We can significantly improve the observational efficiency more than the existing position switching observation method.

This paper presents a new high-performance VLSI architecture and VLSI implementation for full-search block matching algorithm. The proposed VLSI architecture has the feature of two directional parallel and pipeline processing, thereby reducing the PE idle time at which the direction of block matching operation within the search area is changed. Therfore, the proposed architecture is faster than the existing architectures under the same clock frequency. Based on HSPICE circuit simulation, it is verified that the implemented procesing element is operated successfully within 13 ns for 75 MHz operation.

This paper proposes a recognition system of constrained handwritten Hangul and alphanumeric characters using discrete hidden Markov models (HMM). HMM process encodes the distortion and similarity among patterns of a class through a doubly stochastic approach. Characterizing the statistical properties of characters using selected features, a recognition system can be implemented by absorbing possible variations in the form. Hangul shapes are classified into six types by fuzzy inference, and their recognition is performed based on quantized features by optimally ordering features according to their effectiveness in each class. The constrained alphanumerics recognition is also performed using the same features used in Hangul recognition. The forward-backward, Viterbi, and Baum-Welch reestimation algorithms are used for training and recognition of handwritten Hangul and alphanumeric characters. Simulation result shows that the proposed method recognizes handwritten Korean characters and alphanumerics effectively.

The human face can provide a great deal of information in regard to his/her race, age, sex, personality, feeling, psychology, mental state, health condition and ect. If we pay a close attention to the aging process, we are able to find out that there are recognizable phenomena such as eyelid drooping, cheek drooping, forehead furrowing, hair falling-out, the hair becomes gray and etc. This paper proposes that the method to estimate the age by analyzing these feature components for the facial image. Ang we also introduce the method of facial image synthesis in accordance with the cange of age. The feature components according to the change of age can be obtainec by dividing the facial image into the 3-dimensional shape of a face and the texture of a face and then analyzing the principle component respectively using 3-dimensional model. We assume the age of the facial image by comparing the extracted feature component to the facial image and synthesize the resulted image by adding or subtracting the feature component to/from the facial image. As a resurt of this simulation, we have obtained the age changed ficial image of high quality.

In this paper, inspection and subpixed alignment algorithms of SMD's (Surface Mounting Devices) using fuzzy morphology are proposed. First, camera calibration is performed and then the inspection algorithm detects defects such as lead bending and breaking using the ruler generated by fuzy morphology. The SMD having no defects is tested whether it is mounted in the specified position or not. The proposed subpixel alignment algorithm detects accurately orientation and position using subpixel interpolation. It consists of two parts: preprocessing and main processing steps, in which corner points and coarse orientation of a SMD are detected, and interpolation is used to obtain final parameters with wubpixel accuracy. The computer simulation shows that the proposed algorithms give more accurate parameters, and they can be applied to fast and accurate automatic surface mounting systems.

An image data compression method for a digital VCR must satisfy special requirements such as high speed playback. various edting capabilities and error concealment to provide immunity to tape dropouts. Taking these requirements requirements into consideration, this paper proposes a new interframe subband coding algorithm for a digital VCR. In the proposed method, continuous input images are fist partitioned into four frequency bands. The lowest frequency subband is coded with 3-D block adaptive quantization that removes the level redundancy within each level. The other higher frequency subbands are coded by an intraframe coding method using the property of the human visual system. To keep reasonable image quality in high speed palyback, a segment forming method in the frequency domaing is also proposed Computer simulation results demonstrate that the proposed algorithm has the potential of achieving virtually lossless compression in normal play and produces an image with less mosaic errors in high speed play.

Conventional competitive learning algorithms compute the Euclidien distance to determine the winner neuron out of all predetermined output neurons. In such cases, there is a drawback that the performence of the learning algorithm depends on the initial reference(=weight) vectors. In this paper, we propose a new competitive learning algorithm that dynamically generates output neurons. The proposed method generates output neurons by dynamically changing the class thresholds for all output neurons. We compute the similarity between the input vector and the reference vector of each output neuron generated. If the two are similar, the reference vector is adjusted to make it still more like the input vector. Otherwise, the input vector is designated as the reference vector of a new outputneuron. Since the reference vectors of output neurons are dynamically assigned according to input pattern distribution, the proposed method gets around the phenomenon that learning is early determined due to redundant output neurons. Experiments using speech data have shown the proposed method to be superior to existint methods.

Hangul is expressed by the basic elements, twenty-four characters. Because these characters are composed of a circle and lines, Hough transform(HT), which has a powerful performance on the noise in extracting lines, is introduced. Many difficulties often occur when the original HT is used to extract strokes and it's direction, position and length from handwritten Hangul characters. Original HT has eight direction selected as samples in the transformed image should be calculated for these eight directions. In this paper, the generalized sampling rule is suggested. According to the rule, those directions which are possible to a line are the only thing to be calculated. The experoment result turned out to be higher than the method that Chen suggested in sampling rate. Anogher experiment result is done on the 1800 handwritten Hangul characters that 10 persons wrote. By feature extracting the oritinal HT and sampling HT. And as a result of six type classification, the suggested method came out higher than original HT.

In this paepr, Fuzzy Constraint Line Clustering (FCLC) method for optical flow estimation is proposed. FCLC represents the spatical and temporal gradients as fuzzy sets. Based on these sets, several constraint lines with different membership values are generated for the poxed whose velocity is to be estimated. We describe the process for obtaining the membership values of the spatial and temporal gradients and that of the corresponding constraint line. We also show the process for deciding the tightest cluster of point formalated by intersection between constraint lines. For the synthetic and real images, the results of FCLC are compared with of CLC.

In this paper, we propose a multi-layer associative neural network structure suitable for hardware implementaion with the function of performance refinement and improved robutst capability. Unlike other methods which reduce network complexity by putting restrictions on synaptic weithts, we are imposing a requirement of hidden layer neurons for the function. The proposed network has synaptic weights obtainted by Hebbian rule between adjacent layer's memory patterns such as Kosko's BAM. This network can be extended to arbitary multi-layer network trainable with Genetic algorithm for getting hidden layer memory patterns starting with initial random binary patterns. Learning is done to minimize newly defined network error. The newly defined error is composed of the errors at input, hidden, and output layers. After learning, we have bidirectional recall process for performance improvement of the network with one-shot recall. Experimental results carried out on pattern recognition problems demonstrate its performace according to the parameter which represets relative significance of the hidden layer error over the sum of input and output layer errors, show that the proposed model has much better performance than that of Kosko's bidirectional associative memory (BAM), and show the performance increment due to the bidirectionality in recall process.

In this paper, an implemenation of on-line continuous recognizer for cursive Hangul handwriting is explained. For the Hangul recognition system, we propose a high speed string matching. The editing process in our proposed string matching is accomplished by single editing path. And the matching results are stored in a heap structure and we decide the user comfortibility of unceasing writing during recognition owing to the high speed matching. In the experimental result, a recongition rate of 86.36% at 1.75 second/character over 21,076 characters collected from 50 persons are abtained. And it is shown that the proposed recognition system is operated properly for the on-line recognition for cursive handwring between graphemes.

This study describes a software-based conrol methodology eliminating low-frequency harmonics from a 3.phi. phase-controlled converter. The converter topology used in the study is capable of the phase current lagging and dealying with respect to the phase voltage. Low order harmonics are eliminated in the dc output voltage by introducing notches. The good agreements between the simulation and experimental resuls show the validity of the proposed scheme. The use of the software-based control scheme results in a simple and flexible realization of the system.