• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.4
• /
• pp.11-20
• /
• 1998

Fault simulatior has been used to compute exact fault coverages of test vectors for digial circuits. But it is time consuming because execution time is proportional to square of circuit size. Recently, several algorithms for testability analysis have been published to cope with these problems. COP is very fast and accurate but cannot be used for sequential circuits, while STAFAN can be used for sequential circuits but needs vast amount of execution time due to good circuit simulation. We proposed EXTASEC which gave fast and accurate fault coverage. But it shows noticeable errors for a few sequential circuits. In this paper, it is shown that the inaccuracy is due to uninitializble flipflops, and we propose ITEM to improve the EXTASEC algorithm. ITEM is an improved evaluation method of fault coverage by analysis of backward lines and uninitializable flipflops. It is expected to perform efficiently for very large circuits where execution time is critical.

• Transactions of Materials Processing
• /
• v.11 no.2
• /
• pp.147-154
• /
• 2002

The tension levelling Process is Performed to elongate the strip plastically In combination of tensile and bending strain so that all longitudinal fibers In the strip have an approximately equal amount ofn length and undesirable strip shapes are corrected to the flat shape. Thus paper is concerned with a simulation of the tension levelling process based on the analysis of tile unit model for the tension leveller. Analysis technique such as the sequential analysis of the unit model is suggested and verified with the assembly analysis of the unit model for the effective arts economic analysis of the full set of the tension leveller. Analysis of the full tension levelling Process using sequential unit models Is carried out for steel strips with the shape defect and provides the effect of the intermesh and optimum amount of the intermesh in tension levelling process.

• Communications for Statistical Applications and Methods
• /
• v.23 no.4
• /
• pp.287-296
• /
• 2016

Subjects on one side of the covariate population can be allocated to the inferior treatment when there is interaction between the covariate and treatment along with a response-adaptive (RA) design without covariate adjustment. An RA design allows a newly entered subject to have a better chance so that the subject is treated by a superior treatment based on cumulative information from previous subjects. A covariate-adjusted response-adaptive (CARA) is the same as RA design and additionally adjusts the allocation based on individual covariate information. A comparison has been made for the sequential estimation procedure with and without covariate adjustment to see how ignoring significantly interactive covariate affects the correct treatment allocation. Using logistic models, we present simulation results regarding the coverage probability of treatment effect, correct allocation, and stopping time.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.35C no.2
• /
• pp.10-21
• /
• 1998

In this paper, we analyze the problems of conventional and previous mehtod on delay test method in IEEE 1149.1. To solve them, we propose two kinds of delay test architectures. One is called ARCH-C, is for combinatonal circuit, and the other is ARCH-S, for clocked sequential circuit. ARCH-C is able to detect delay defect of 0.5 $T_{tck}$ or 1 $T_{tck}$ size. And ARCH-C have a fixed and small amount of hardware overhead, on the contrary preious method has a hardware overhead on the dependent of CUT. This paper discusses weveral problems of Delay test on IEEE 1149.1 for clocked sequential circuit. We suggest the method called ARCH-S, is based on a clock counting technique to generate continuous clocked input of CUT. the simulation results ascertain the accurate operation and effectiveness of the proposed architectures.res.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.124-127
• /
• 1997

In this paper, we propose the new face detection and tracking angorithm in sequential images which have complex background. In order to apply face deteciton algorithm efficently, we convert the conventional RGB coordiantes into CIE coordonates and make the input images insensitive to luminace. And human face shapes and colors are learned using ueural network's backpropagation. For variable face size, we make mosaic size of input images vary and get the face location with various size through neural network. Besides, in sequential images, we suggest face motion tracking algorithm through image substraction processing and thresholding. At this time, for accurate face tracking, we use the face location of previous. image. Finally, we verify the real-time applicability of the proposed algorithm by the simple simulation.

• Journal of electromagnetic engineering and science
• /
• v.12 no.3
• /
• pp.196-202
• /
• 2012

Spectrum sensing is one of the most important functions in cognitive radio systems. In this paper, we focus on reducing the sensing time in a cooperative spectrum sensing paradigm. In the proposed scheme, a sequential detection technique is employed to provide a robust and quick detection system. Each of the secondary users measures the log-likelihood probability of the received signals and then sequentially reports to the base station. Here, the maximum ratio combining (MRC) technique is employed to reduce the average sample number (ASN) in order to reduce the sensing time. This proposed scheme is analyzed and simulated to illustrate the performance in comparison with the other given methods. Analysis and simulation are provided to validate the proposed method.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.183-190
• /
• 1997

We present competition protocols to speed up the execution of sequential programs on a network of shared workstations in the background by exploiting their wasted computing capacity, without interfering with processes of workstation owners. In order to argue that competition protocols are preferable to migration protocols in this situation, we derive the closed form solutions for the speedup of competition protocols and migration protocols, and simulate both of protocols under comparable overhead assumptions. Based on our analytic results and simulation results, we show that competitive execution is superior to process migration, and that competitive execution can finish sequential programs significantly faster than noncompetitive execution, especially when the foreground load is sufficiently high.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.68 no.1
• /
• pp.159-166
• /
• 2019

Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.10 no.2
• /
• pp.177-184
• /
• 2008

In this study, in order to reduce appeals regarding vibration and noise from blasts, the optimum delay-time of the electronic detonator, which can minimize blast vibration, is found through blast-waveform composition and blasting simulation, and we have developed the full-face Sequential Blasting Method based on the studies of damping properties of full-face section blasting. The optimum delay-time of the electronic detonator and Full-face Sequential Blasting Method using electronic detonator was applied to the Gyeongbu high-speed railway construction site to test the feasibility of this method.

• Smart Structures and Systems
• /
• v.17 no.4
• /
• pp.611-629
• /
• 2016

This study presents a new approach of surrogate modeling for time-consuming finite element analysis. A surrogate model is widely used to reduce the computational cost under an iterative computational analysis. Although a variety of the methods have been widely investigated, there are still difficulties in surrogate modeling from a practical point of view: (1) How to derive optimal design of experiments (i.e., the number of training samples and their locations); and (2) diagnostics of the surrogate model. To overcome these difficulties, we propose a sequential surrogate modeling based on Gaussian process model (GPM) with self-adaptive sampling. The proposed approach not only enables further sampling to make GPM more accurate, but also evaluates the model adequacy within a sequential framework. The applicability of the proposed approach is first demonstrated by using mathematical test functions. Then, it is applied as a substitute of the iterative finite element analysis to Monte Carlo simulation for a response uncertainty analysis under correlated input uncertainties. In all numerical studies, it is successful to build GPM automatically with the minimal user intervention. The proposed approach can be customized for the various response surfaces and help a less experienced user save his/her efforts.