• Journal of the Korean Society for Railway
• /
• v.12 no.6
• /
• pp.1043-1048
• /
• 2009

PES (Programmable Electronic System) is used by software development for the train control system. PES has been widely used in real world and consists of hardware, firmware and application software. The PES are easily apply to many applications because its implementation has high flexibility. Many safety critical functions are realized through software in safety critical system. Normally, it is difficult to detect failures for PES system because the PES is too sophisticated to identify sources of the failure. So, the reliability analysis is needed by using software fault tolerance techniques. Currently, there are the recovery block, distributed recovery block, N-version programming, N self-checking programming in fault tolerance techniques. In this paper, the models of recovery block and N-version programming in software fault tolerance techniques are suggested by using the Markov model. Also, the reliability in the train control system is analyzed through changing time. The fault occupancy rates of the program, adjustment test and voter are stationary. So, the relation between time and reliability is presented by using Matlab program. In the result of reliability, the reliability of recovery block is more high than N-version programming in case of the same number of substitution block.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.3
• /
• pp.95-104
• /
• 2001

In this paper, we consider a maximin version of the linear programming knapsack problem with extended generalized upper bound (GUB) constraints. We solve the problem efficiently by exploiting its special structure without transforming it into a standard linear programming problem. We present an O(n$^3$) algorithm for deriving the optimal solution where n is the total number of problem variables. We illustrate a numerical example.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.2
• /
• pp.326-334
• /
• 1999

There are the fault tolerance technology and the fault avoidance technology to analyze and evaluate the performance of computer system. To improve the relibility of software The N-Version Programming (NVP) technology is known to be the most objective and quantitive. However, when discrete probability distribution is used as estimation model, the values of it's component reliability should be same. In this paper, to resolve this problem, we adapted the genetic algorithms to NVP technology and implement the optimized simulate. and the results were analyzed and estimated. Through this study, we could optimize the reliability of each component and estimate the optimum count in the system reliability.

• KSCI Review
• /
• v.8 no.2
• /
• pp.43-50
• /
• 2001

소프트웨어 신뢰성을 향상시키는 방법에는 소프트웨어 결함 허용기법 중에서 가장 객관적이고 정량적으로 평가받는 것이 NVP(N-Version Programming)기법이다. 이 기법에서 신뢰도를 추정하는 모델로 이항분포를 사용하는데 이 모델은 각 컴포넌트 신뢰도의 값들이 동일하다는 한계점이 있었다. 본 연구에서는 기존 모델의 한계점을 해결하기 위하여 NVP 신뢰도 분석을 위한 새로운 접근 방법으로 유전자 알고리즘(Genetic Algorithms)을 적용하였고. 또한 적용 모델과 기존 모델을 서로 비교 검토하였다. 그 결과 전체시스템 신뢰도를 일정 수준이상 유지하면서 각 컴포넌트 신뢰도의 값들을 최적화 할 수 있었고. 또한 비용을 최소로 하는 최적의 수를 추정할 수 있었다. 그리고 적용 모델과 기존 모델을 비교 및 평가하여 타당성을 증명하였다.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.649-659
• /
• 1999

This paper presents a parallel implementation of stiff-ness matrix calculation based on the processor farm model on a net-work of workstations running PVM programming environment. As the computational characteristics of stiffnes matrix exhibits good po-tentials for effective prallel computation the performance improve-ment is show to be almost linear with the number of sorkstations involved in the computation.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.305-312
• /
• 2007

Using a weaker version of the Newton-Kantorovich theorem [6] given by us in [3], we show how to refine the results given in [8] dealing with the analyzing of the effect of small perturbations in problem data on the solution. The new results are obtained under weaker hypotheses and the same computational cost as in [8].

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.3
• /
• pp.431-446
• /
• 1998

In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.54 no.2
• /
• pp.73-78
• /
• 2005

The management of technological systems will become increasingly complex. Safe and reliable software operation is a significant requirement for many types of system. So, with software fault tolerance, we want to prevent failures by tolerating faults whose occurrences are known when errors are detected. This paper presents a fault location algorithm for single-phase-to-ground faults on the teed circuit of a parallel transmission line using software fault tolerance technique. To find the fault location of transmission line, we have to solve the 3rd order transmission line equation. A significant improvement in the identification of the fault location was accomplished using the N-Version Programming (NVP) design paradigm. The delivered new algorithm has been tested with the simulation data obtained from the versatile EMTP simulator.

• Proceedings of the KIEE Conference
• /
• summer
• /
• pp.21-23
• /
• 2004

전력 에너지는 안정하고 신뢰할 수 있도록 고장에 대한 빠른 대처가 필요하다. 고장시 빠른 수리를 위해서는 보수 승무원에게 고장 위치를 정확하게 알려주어 올바른 위치에 도착할 수 있도록 고장점 표정 알고리즘의 정확도가 요구된다. 본 논문에서는 기존 1회선 분기점을 갖는 병행 2회선 송전선로의 고장점 표정 알고리즘을 이용하여 정확한 고장 위치를 찾는 방법으로 개선된 NVP(N-version programming) 모델을 적용한 새로운 계산 방법을 제안한다. 송전선로의 고장 데이터는 EMTP(Electro Magnetic Transients Program)을 사용하여 154[kV], 25[km] 분기된, 병행 2회선 송전선로에서 고장지진과 고장저항의 데이터존 이용하여 시뮬레이션했다.

• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.2
• /
• pp.67-74
• /
• 2013

Approximate string matching problems have been studied in diverse fields. Recently, fast approximate string matching algorithms are being used to reduce the time and costs for the next generation sequencing. To measure the amounts of errors between two strings, we use a distance function such as the edit distance. Given two strings X(|X| = m) and Y(|Y| = n) over an alphabet ${\Sigma}$, the edit distance between X and Y is the minimum number of edit operations to convert X into Y. The edit distance between X and Y can be computed using the well-known dynamic programming technique in O(mn) time and space. The edit distance also can be computed using the Four-Russians' algorithm whose preprocessing step runs in $O((3{\mid}{\Sigma}{\mid})^{2t}t^2)$ time and $O((3{\mid}{\Sigma}{\mid})^{2t}t)$ space and the computation step runs in O(mn/t) time and O(mn) space where t represents the size of the block. In this paper, we present a parallelized version of the computation step of the Four-Russians' algorithm. Our algorithm computes the edit distance between X and Y in O(m+n) time using m/t threads. Then we implemented both the sequential version and our parallelized version of the Four-Russians' algorithm using CUDA to compare the execution times. When t = 1 and t = 2, our algorithm runs about 10 times and 3 times faster than the sequential algorithm, respectively.