• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.50 no.1
• /
• pp.45-50
• /
• 2001

With increasing complexity of digital logic circuits, fast and accurate verification of functional behaviour becomes most critical bottleneck in meeting time-to-market requirement. This paper presents several techniques for accelerating a cycle-based logic simulation. The acceleration techniques include parallel pattern logic evaluation, circuit size reduction, and the partition of feedback loops in sequential circuits. Among all, the circuit size reduction plays a critical role in maximizing logic simulation speedup by reducing 50% of entire circuit nodes on the average. These techniques are incorporated into a levelized table-driven logic simulation system rather than a compiled-code simulation algorithm. Finally, experimental results are given to demonstrate the effectiveness of the proposed acceleration techniques. Experimental results show more than 27 times performance improvement over single pattern levelized logic simulation.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.10a
• /
• pp.265-266
• /
• 2006

• Proceedings of the Korean Society of Soil and Groundwater Environment Conference
• /
• 2001.09a
• /
• pp.204-207
• /
• 2001

An optimization process for the design of groundwater remediation is developed by simultaneously considering the well location and the pumping rate. This process uses two independent models: simulation and optimization model. Groundwater flow and contaminant transport are simulated with MODFLOW and MT3D in simulation model. In optimization model, the location and pumping rate of each well are determined and evaluated by the genetic algorithm. In a homogeneous and symmetric domain, the developed model is tested using sequential pairs for pumping rate of each well, and the model gives more improved result than the model using sequential pairs. In application cases, the suggested optimal design shows that the main location of wells is on the centerline of contaminate distribution. The resulting optimal design also shows that the well with maximum pumping rate is replaced with the further one from the contaminant source along flow direction and that the optimal pumping rate declines when more cleanup time is given. But the optimal pumping rate is not linearly proportional to the cleanup time and the minimum total pumping volume does not coincide with the optimal pumping rate.

• Bulletin of the Korean Chemical Society
• /
• v.29 no.2
• /
• pp.363-371
• /
• 2008

As a computational method for the discovery of the effective agonists for PPARd, we address the usefulness of molecular dynamics free energy (MDFE) simulation with explicit solvent in terms of the accuracy and the computing cost. For this purpose, we establish an efficient computational protocol of thermodynamic integration (TI) that is superior to free energy perturbation (FEP) method in parallel computing environment. Using this protocol, the relative binding affinities of GW501516 and its derivatives for PPARd are calculated. The accuracy of our protocol was evaluated in two steps. First, we devise a thermodynamic cycle to calculate the absolute and relative hydration free energies of test molecules. This allows a self-consistent check for the accuracy of the calculation protocol. Second, the calculated relative binding affinities of the selected ligands are compared with experimental IC50 values. The average deviation of the calculated binding free energies from the experimental results amounts at the most to 1 kcal/mol. The computational efficiency of current protocol is also assessed by comparing its execution times with those of the sequential version of the TI protocol. The results show that the calculation can be accelerated by 4 times when compared to the sequential run. Based on the calculations with the parallel computational protocol, a new potential agonist of GW501516 derivative is proposed.

• Journal of the Korea Society for Simulation
• /
• v.9 no.1
• /
• pp.1-9
• /
• 2000

When a new manufacturing line is constructed, its production capacity can be substantially affected in its design stage. Computer simulation often provides better design by evaluating feasible alternatives. In this paper we study an automobile engine manufacturing line which is under construction. Three alternatives are considered in the design; (1) to use machining tools of longer life; (2) to reassign the buffer space to each sequential processes while maintaining the same total buffer length; and (3) to reduce the machine repair time to 30 minutes using TPM and maintenance team. Simulation results using AutoMod indicates that employing the three alternatives will save about 1.5 million dollars per year.

• Journal of the Korea Society for Simulation
• /
• v.1 no.1
• /
• pp.64-76
• /
• 1992

The DEVS(discrete event system specificaition) formalism specifies a discrete event system in a hierarchical, modular form. DEVSIM++ is a C++based general purpose DEVS abstract simulator which can simulate systems modeled by the DEVS formalism in a sequential environment. This paper describes P-DEVSIM++which is a parallel version of DEVSIM++ . In P-DEVSIM++, the external and internal event of DEVS models can by processed in parallel. For such processing, we propose a parallel, distributed optimistic simulation algorithm based on the Time Warp approach. However, the proposed algorithm localizes the rollback of a model within itself, not possible in the standard Time Warp approach. An advantage of such localization is that the simulation time may be reduced. To evaluate its performance, we simulate a single bus multiprocessor architecture system with an external common memory. Simulation result shows that significant speedup is made possible with our algorithm in a parallel environment.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.519-522
• /
• 1997

In this study, the collision free path planning method of the articulated manipulator using sequential search is proposed. This method is to find the joint path of the manipulator with many degrees of freedom from the distal joint to the proximal one. To do this, the initial work space of the gantry manipulator, which is a remote maintenance equipment of the radioactive environment, is defined from the condition that the distal joint configuration is determined by the posture of maintenance. Then, 2-dimensional configuration space with the obstacle area is represented and the collision free path of manipulator is searched in the configuration space. And, this method is verified using the graphic simulation in virtual workcell for the spent fuel disassembling processes. The result of this study can be effectively used in implementing the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management.

• Communications for Statistical Applications and Methods
• /
• v.23 no.2
• /
• pp.131-146
• /
• 2016

In research on behavioral studies, significant attention has been paid to the stage-sequential process for longitudinal data. Latent class profile analysis (LCPA) is an useful method to study sequential patterns of the behavioral development by the two-step identification process: identifying a small number of latent classes at each measurement occasion and two or more homogeneous subgroups in which individuals exhibit a similar sequence of latent class membership over time. Maximum likelihood (ML) estimates for LCPA are easily obtained by expectation-maximization (EM) algorithm, and Bayesian inference can be implemented via Markov chain Monte Carlo (MCMC). However, unusual properties in the likelihood of LCPA can cause difficulties in ML and Bayesian inference as well as estimation in small samples. This article describes and addresses erratic problems that involve conventional ML and Bayesian estimates for LCPA with small samples. We argue that these problems can be alleviated with a small amount of prior input. This study evaluates the performance of likelihood and MCMC-based estimates with the proposed prior in drawing inference over repeated sampling. Our simulation shows that estimates from the proposed methods perform better than those from the conventional ML and Bayesian method.

• The Korean Journal of Applied Statistics
• /
• v.22 no.5
• /
• pp.1033-1046
• /
• 2009

In new drug development studies or clinical trials, zero-dose control is needed in general to determine the lowest dose level for a new drug which can act with our bodies. When the lowest dose level compared with zero-dose control has significant difference in effect, it is referred as minimum effective dose(MED). We propose, in this paper, parametric sequential test using updated control to identify the minimum effective dose(MED) level. Monte Carlo Simulation is adapted to examine the power and experimental significance levels of the proposed method with other methods.

• The Korean Journal of Applied Statistics
• /
• v.26 no.6
• /
• pp.1009-1018
• /
• 2013

Regression analysis is useful to understand the relationship of variables; however, we need to test if the slope of each regression lines is the same when comparing several populations. This paper suggests a new parallelism test for several linear regression lines. We use F-test of ANOVA and Kruskal-Wallis (1952) tests after obtaining slope estimator from a sequential slope. In addition, a Monte Carlo simulation study is adapted to compare the power of the proposed methods with those of Park and Kim (2009).