• Journal of the Korea Society for Simulation
• /
• v.6 no.1
• /
• pp.1-13
• /
• 1997

In this paper, we present a partitioning algorithm for distributed simulation of DEVS (Discrete Event System Specification) models. To preserve concurrency inherent in models, the proposed algorithm utilizes the structural information of models. Through benchmark simulation experiments, we show that the proposed algorithm can generate good partitions.

• Journal of the Korea society of information convergence
• /
• v.7 no.2
• /
• pp.49-57
• /
• 2014

Recently, opinion mining is introduced to extract useful information from SNS data and to evaluate the true intention of users. Opinion mining are required several efficient techniques to collect and analyze a large amount of SNS data and extract meaningful data from them. Therefore in this paper, we propose a parallel HDFS(Hadoop Distributed File System) and emotion functions based on Mapreduce to extract some emotional information of users from various unstructured big data on social networks. The experiment results have verified that the proposed system and functions perform faster than O(n) for data gathering time and loading time, and maintain stable load balancing for memory and CPU resources.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.3
• /
• pp.324-329
• /
• 2005

In this paper, a robust $H\infty$ stabilization problem to a uncertain discrete-time nonlinear systems with time-delay via fuzzy static output feedback is investigated. The Takagj-Sugeno (T-S) fuzzy model is employed to represent an uncertain nonlinear system with time-delayed state. Then, the parallel distributed compensation technique is used for designing of the robust fuzzy controller. Using a single Lyapunov function, the globally asymptotic stability and disturbance attenuation of the closed-loop fuzzy control system are discussed. Sufficient conditions for the existence of robust $H\infty$ controllers are given in terms of linear matrix inequalities via similarity transform and congruence transform technique. We have shown the effectiveness and feasibility of the proposed method through the simulation.

• The Journal of the Korea Contents Association
• /
• v.8 no.12
• /
• pp.441-448
• /
• 2008

The molecular docking system needs a large amount of computation and requires super-computing power. Since the experiment requires a large amount of time, the experiment is conducted in the distributed environment or in the grid environment. Recently, researches on using parallel GPU of far higher performance than that of CPU in scientific computing have been very actively conducted. CUDA is an open technique by which a parallel GPU programming is made possible. This study proposes the molecular docking system using CUDA. It also proposes algorithm that parallels energy-minimizing-computation. To verify such experiments, this study conducted a comparative analysis on the time required for experimenting molecular docking in general CPU and the time and performance of the parallel GPU-based molecular docking which is proposed in this study.

• Journal of Industrial Technology
• /
• v.10
• /
• pp.15-20
• /
• 1990

A parallel processing algorithm for discrete Kalman filter, which is one of the most commonly used filtering technique in modern control, signal processing, and communication, is proposed. Previously proposed parallel algorithms to decrease the number of computations needed in the Kalman filter are the hierachical structures by distributed processing of measurements, or the systolic structures to disperse the computational burden. In this paper, a new parallel Kalman filter employing a structure similar to recursive doubling is proposed. Estimated values of state variables by the new algorithm converge with two times faster data processing speed than that of the conventional Kalman filter. Moreover it maintains the optimality of the conventional Kalman filter.

• 한국전산유체공학회:학술대회논문집
• /
• 2005.10a
• /
• pp.157-162
• /
• 2005

Parallel implementation and performance assessment of the grid assembly in a structured chimera grid approach is studied. The grid assembly process, involving hole cutting and searching donor, is parallelized on the PC cluster. A message passing programming model based on the MPI library is implemented using the single program multiple data(SPMD) paradigm. The coarse-grained communication is optimized with the minimized memory allocation because that the parallel grid assembly can access the decomposed geometry data in other processors by only message passing in the distributed memory system such as a PC cluster. The grid assembly workload is based on the static load balancing tied to flow solver. A goal of this work is a development of parallelized grid assembly that is suited for handling multiple moving body problems with large grid size.

• Proceedings of the KIEE Conference
• /
• 1990.07a
• /
• pp.64-67
• /
• 1990

A parallel processing algorithm for discrete Kalman filter, which is one of the most commonly used filtering technique in modern control, signal processing, and communication. is proposed. Previously proposed parallel algorithms to decrease the number of computations needed in the Kalman filter are the hierachical structures by distributed processing of measurements, or the systolic structures to disperse the computational burden. In this paper, a new parallel Kalman filter employing a structure similar to recursive doubling is proposed. Estimated values of state variables by the new algorithm converge with two times faster data processing speed than that of the conventional Kalman filter. Moreover it maintains the optimality of the conventional Kalman filter.

• Structural Engineering and Mechanics
• /
• v.32 no.6
• /
• pp.787-809
• /
• 2009

Recent interest in the use of wireless sensor networks for structural health monitoring (SHM) is mainly due to their low implementation costs and potential to measure the responses of a structure at unprecedented spatial resolution. Approaches capable of detecting damage using distributed processing must be developed in parallel with this technology to significantly reduce the power consumption and communication bandwidth requirements of the sensor platforms. In this investigation, a damage detection system based on a distributed processing approach is proposed and experimentally validated using a wireless sensor network deployed on two laboratory structures. In this distributed approach, on-board processing capabilities of the wireless sensor are exploited to significantly reduce the communication load and power consumption. The Damage Location Assurance Criterion (DLAC) is used for localizing damage. Processing of the raw data is conducted at the sensor level, and a reduced data set is transmitted to the base station for decision-making. The results indicate that this distributed implementation can be used to successfully detect and localize regions of damage in a structure. To further support the experimental results obtained, the capabilities of the proposed system were tested through a series of numerical simulations with an expanded set of damage scenarios.

• International Journal of Reliability and Applications
• /
• v.14 no.1
• /
• pp.11-26
• /
• 2013

The availability equivalence factors of a general repairable series-parallel system is discussed in this paper based on the availability function of the system. The system components are assumed to be repairable and independent but not identical. The life and repair times of the system components are exponentially distributed with different parameters. Two types of availability equivalent factors of the system are derived. The results derived in this paper generalizes those given in the literature. A case study is introduced to illustrate how the idea of this work can be applied.

• International Journal of Reliability and Applications
• /
• v.16 no.1
• /
• pp.1-13
• /
• 2015

In this paper, we investigate reliability and availability of repairable systems with two types of failure. The first one is to one unit and the second one is to M units in parallel structure. Let failure rate and repair rate of [type1, type2] components are assumed to be exponentially distributed. The expressions of availability and reliability characteristics such as the system reliability and the mean time to failure are derived for two systems. We used several cases to analyze graphically the effect of various system parameters on the reliability system and availability system.