• Communications for Statistical Applications and Methods
• /
• v.19 no.2
• /
• pp.219-224
• /
• 2012

This article considers the mean time to failure(MTTF) of a dependent parallel system. We study how the degree of dependency components influences the increase in the mean lifetime for this system. The results are illustrated by tables and figures.

• Journal of Korean Institute of Industrial Engineers
• /
• v.40 no.3
• /
• pp.305-312
• /
• 2014

This research deals with a problem that minimizes makespan in a non-identical parallel machine system with sequence and machine dependent setup times and machine dependent processing times. We first present a new mixed integer programming formulation for the problem, and using this formulation, one can easily find optimal solutions for small problems. However, since the problem is NP-hard and the size of a real problem is large, we propose four heuristic algorithms including genetic algorithm based heuristics to solve the practical big-size problems in a reasonable computational time. To assess the performance of the algorithms, we conduct a computational experiment, from which we found the heuristic algorithms show different performances as the problem characteristics are changed and the simple heuristics show better performances than genetic algorithm based heuristics for the case when the numbers of jobs and/or machines are large.

• Journal of Korean Institute of Industrial Engineers
• /
• v.35 no.4
• /
• pp.218-225
• /
• 2009

This paper considers a parallel-machine scheduling problem with job release times and sequence-dependent setup times. The objective of this problem is to determine the allocation policy of jobs and the scheduling policy of machines so as to minimize the weighted sum of setup times, delay times, and tardy times. A mathematical model for optimal solution is derived and a meta heuristic algorithm based on the improved ant colony system is proposed in this paper. The performance of the meta heuristic algorithm is evaluated through compare with optimal solutions using randomly generated several examples.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.2
• /
• pp.182-188
• /
• 2004

This paper presents a design method of delay-dependent control for T-S fuzzy systems with time delays. Based on parallel distributed compensation (PDC) and a descriptor model transformation of the system, a delay-dependent control is utilized. An appropriate Lyapunov-Krasovskii functional is chosen for delay-dependent stability analysis. A sufficient condition for delay-dependent control is represented in terms of linear matrix inequalities (LMIs).

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.25 no.12
• /
• pp.107-112
• /
• 2011

Multiple ground rods are commonly used to obtain the low ground impedance, but they will not reduce the ground impedance unless the spacings between the ground rods are sufficient. This paper presents the experimental results of frequency-dependent resultant ground impedance of two ground rods in parallel. The resultant ground impedance of two ground rods in parallel were measured as functions of the spacing and length of ground rods and the frequency of test currents and were discussed based on the potential interferences. As a consequence, the frequency-dependent ground impedance of single ground rod and two combined ground rods give capacitive. It was found that the effect of potential interference on the ground impedance is directly associated with the frequency-dependent ground impedance and is strong in low frequency. Also, in order to reduce the increasing rate of resultant ground impedance of two ground rods due to potential interference to within 10(%), two ground rods in parallel will be placed over one rod length apart.

• Honam Mathematical Journal
• /
• v.27 no.2
• /
• pp.301-315
• /
• 2005

Let $\{A_u,\;u=0,\;1,\;2,\;{\cdots}\}$ be a sequence of coefficient matrices such that ${\sum}_{u=0}^{\infty}{\parallel}A_u{\parallel}<{\infty}$ and ${\sum}_{u=0}^{\infty}\;A_u{\neq}O_{m{\times}m}$, where for any $m{\times}m(m{\geq}1)$, matrix $A=(a_{ij})$, ${\parallel}A{\parallel}={\sum}_{i=1}^m{\sum}_{j=1}^m{\mid}a_{ij}{\mid}$ and $O_{m{\times}m}$ denotes the $m{\times}m$ zero matrix. In this paper, a functional central limit theorem is derived for a stationary m-dimensional linear process ${\mathbb{X}}_t$ of the form ${\mathbb{X}_t}={\sum}_{u=0}^{\infty}A_u{\mathbb{Z}_{t-u}}$, where $\{\mathbb{Z}_t,\;t=0,\;{\pm}1,\;{\pm}2,\;{\cdots}\}$ is a stationary sequence of linearly positive quadrant dependent m-dimensional random vectors with $E({\mathbb{Z}_t})={{\mathbb{O}}$ and $E{\parallel}{\mathbb{Z}_t}{\parallel}^2<{\infty}$.

• Review of KIISC
• /
• v.5 no.2
• /
• pp.32-48
• /
• 1995

Our paper describes an Intrusion Detection Parallel System(IDPS) which detects an anomaly activity corresponding to the actions that interaction between near detection events. IDES uses parallel inductive approaches regarding the problem of real-time anomaly behavior detection on rule-based system. This approach uses sequential rule that describes user's behavior and characteristics dependent on time. and that audits user's activities by using rule base as data base to store user's behavior pattern. When user's activity deviates significantly from expected behavior described in rule base. anomaly behaviors are recorded. Observed behavior is flagged as a potential intrusion if it deviates significantly from the expected behavior or if it triggers a rule in the parallel inductive system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.94-100
• /
• 2003

In this paper, we study the estimation of reliability function for a parallel system with k dependent exponential components. We assume that the failure of one of the k components changes the life distribution of the remaining components. Also, we compare with Cramer-Rna lower bound for variances of the minimum variance unbiased estimator, and the mean square errors of the maximum likelihood estimator of reliability system with the through the Monte Carlo simulation.

• The Journal of the Acoustical Society of Korea
• /
• v.18 no.5
• /
• pp.44-51
• /
• 1999

This paper presents a massively parallel computational model for the efficient integration of speech and natural language understanding. The phoneme model is based on continuous Hidden Markov Model with context dependent phonemes, and the language model is based on a knowledge base approach. To construct the knowledge base, we adopt a hierarchically-structured semantic network and a memory-based parsing technique that employs parallel marker-passing as an inference mechanism. Our parallel speech recognition algorithm is implemented in a multi-Transputer system using distributed-memory MIMD multiprocessors. Experimental results show that the parallel speech recognition system performs better in recognition accuracy than a word network-based speech recognition system. The recognition accuracy is further improved by applying code-phoneme statistics. Besides, speedup experiments demonstrate the possibility of constructing a realtime parallel speech recognition system.

• The KIPS Transactions:PartA
• /
• v.11A no.1
• /
• pp.67-74
• /
• 2004

Most of today's parallel numerical schemes use synchronous algorithms, where some processors that have finished their tasks earlier than others must wait at synchronization points for correct computation. Hence overall performance of the system is dependent upon the speed of the slowest processor. In this paper, we det·ise a synchronous/asynchronous hybrid algorithm to accelerate convergence of the solution for finding the dominant eigenpair of a large matrix, by reducing the idle times of faster processors using MPMD programming methodology.