• IE interfaces
• /
• v.23 no.2
• /
• pp.147-155
• /
• 2010

Reliability allocation is defined as a problem of determination of the reliability for subsystems and components to achieve target system reliability. The determination of both optimal component reliability and the number of component redundancy allowing mixed components to maximize the system reliability under resource constraints is called reliability-redundancy allocation problem(RAP). The main objective of this study is to suggest a mathematical programming model and a hybrid parallel genetic algorithm(HPGA) for reliability-redundancy allocation problem that decides both optimal component reliability and the number of component redundancy to maximize the system reliability under cost and weight constraints. The global optimal solutions of each example are obtained by using CPLEX 11.1. The component structure, reliability, cost, and weight were computed by using HPGA and compared the results of existing metaheuristic such as Genetic Algoritm(GA), Tabu Search(TS), Ant Colony Optimization(ACO), Immune Algorithm(IA) and also evaluated performance of HPGA. The result of suggested algorithm gives the same or better solutions when compared with existing algorithms, because the suggested algorithm could paratactically evolved by operating several sub-populations and improve solution through swap, 2-opt, and interchange processes. In order to calculate the improvement of reliability for existing studies and suggested algorithm, a maximum possible improvement(MPI) was applied in this study.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.589-594
• /
• 1991

Group Technology (GT) is a technique for identifying and bringing together related or similar components in a production process in order to take advantage of their similarities by making use of, for example, the inherent economies of flow production methods. The process of identification, from large variety and total of components, of the part families requiring similar manufacturing operations and forming the associated groups of machines is referred as 'machine-component grouping'. First part of this paper is devoted to describing a hierarchical divisive algorithm based on graph theory to find the natural part families. The objective is to form components into part families such that the degree of inter-relations is high among components within the same part family and low between components of different part families. Second part of this paper focuses on establishing cell design procedures. The aim is to create cells in which the most expensive and important machines-called key machine - have a reasonably high utilization and the machines should be allocated to minimize the intercell movement of machine loads. To fulfil the above objectives, 0-1 integer programming model is developed and the solution procedures are found. Next an attempt is made to test the feasibility of the proposed method. Several different problems appearing in the literature are chosen and the results air briefly showed.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.5
• /
• pp.95-102
• /
• 2013

In metabolomics, metabolic pathway is represented by well-displayed graph. Metabolic pathways, especially, have a complex binding structure, which makes the graphical representation hard to visualize. There is a problem that edge crossings exponentially increase as the number of nodes grows. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 2-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in upper layer. Then the remaining subgraphs except meaningful components are drawn in lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. This algorithm is the basis of flexible analysis for metabolic pathways.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.6
• /
• pp.71-79
• /
• 2013

Metabolic pathway, represented by well-displayed graph, have a complex binding structure, which makes the graphical representation hard to visualize. To apply automatic graph layout techniques to the genome-scale metabolic flow of metabolism domains, it is very important to reduce unnecessary edge crossing on a metabolic pathway layout. we proposed a metabolic pathway layout algorithm based on 3-layer layout. Our algorithm searches any meaningful component existing in a pathway, such as circular components, highly connected nodes, and the components are drawn in middle layer. Then the remaining subgraphs except meaningful components are drawn in upper and lower layer by utilizing a new radial layout algorithm. It reduces ultimately reduced the number of edge crossings. Our algorithm solve the problem that edge crossings exponentially increase as the number of nodes grows.

• Journal of Digital Convergence
• /
• v.20 no.3
• /
• pp.389-397
• /
• 2022

As increasing the growth of the Internet in medical area, a new technology to transmit effectively massive medical data is required. In optical internet, all OBS nodes have fiber delay lines, hardware components. These components are calculated under some optimal traffic conditions, and this means that if the conditions change, then the components should be altered. Therefore, in this article a new service differentiation algorithm using the previously installed components is proposed, which is used although the conditions vary. When traffic conditions change, the algorithm dynamically recalculates the threshold value used to decide the length of data bursts. By doing so, irrelevant to changes, the algorithm can maintain the service differentiation between classes without replacing any fiber delay lines. With the algorithm, loss sensitive medical data can be transferred well.

• Journal of Biomedical Engineering Research
• /
• v.29 no.6
• /
• pp.502-511
• /
• 2008

This study was designed to develop a new algorithm to extract the voluntary EMG and the evoked EMG from a mixed EMG generated when the muscle is stimulated both voluntarily and by electrical stimulation in the FES system. The proposed parallel filter algorithm consists of three phases: (1) Fourier transform of the mixed EMG, (2) multiplication of the transformed signal to two frequency functions, and (3) inverse Fourier transform. Four incomplete spinal cord injured patients participated in the experiments to evaluate the algorithm by measuring the knee extensor torque and the EMG signals from the quadriceps. Two functions of the algorithms were evaluated: (1) extraction of the evoked EMG and (2) the voluntary EMG from the mixed EMG. The results showed that the algorithm enabled us to separate the two EMG components in real time from the mixed EMG. The algorithm can and will be used for estimating the voluntary torque and the evoked torque independently through an artificial neural network based on the two EMG components, and also for generating a trigger signal to control the on/off time of the FES system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.10
• /
• pp.495-501
• /
• 2002

A difference based current transformer (CT) saturation detection algorithm uses the third difference of a secondary current to detect the instants of the beginning/end of saturation. The third difference of a secondary current contains high frequency components when a CT is saturated. Thus, an effect of an anti-aliasing lowpass filter implemented in digital protection relays on the detection algorithm should be studied. This paper describes performance analysis of a lowpass filter on the CT saturation detection algorithm. The cutoff frequency of the lowpass filter is normally set to be half of a sampling frequency. In this Paper, two sampling frequencies of 3,840 (Hz) corresponding to 64 sample/cycle (s/c) and 1,920 (Hz) corresponding to 32 (s/c) are studied; the cutoff frequencies of the lowpass filters are set to be 1,920 (Hz), 960 (Hz) and 960(Hz), 480(Hz), respectively. And the proposed algorithm is verified by experiment. A 2nd order Butterworth filter is designed as a lowpass filter. The test results and experiment results clearly indicate that the saturation detection algorithm successfully detects the instants of the beginning/end of saturation even though a secondary current is filtered by the designed lowpass filters.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.6
• /
• pp.1361-1369
• /
• 1996

Motion estimation is one of the key components for high quality video coding. In this paper, a new motion estimation scheme for MPEG-like video coder is suggested. The proposed temporally adaptive motion estimation scheme consists of five functional blocks: Temporal subband analysis (TSBA), extraction of temporal information, scene change detection (SCD), picture type replacement (PTR), and temporally adapted block matching algorithm (TABMA). Here all the functional components are based on the temporal subband analysis. In this papre, we applied the analysis part of subband decompostion to the temporal axis of moving picture sequence, newly defined the temporal activity distribution (TAD) and average TAD, and proposed the temporally adapted block matching algorithm, the scene change detection algorithm and picture type replacement algorithm which employed the results of the temporal subband analysis. A new block matching algorithm TABMA is capable of controlling the block matching area. According to the temporal activity distribution of objects, it allocates the search areas nonuniformly. The proposed SCD and PTR can prevent unavailable motion prediction for abrupt scene changes. Computer simulation results show that the proposed motion estimation scheme improve the quality of reconstructed sequence and reduces the number of block matching trials to 40% of the numbers of trials in conventional methods. The TSBA based scene change detection algorithm can detect the abruptly changed scenes in the intentionally combined sequence of this experiment without additional computations.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.11
• /
• pp.217-225
• /
• 2021

In this paper, we designed and implemented the integrated system to prevent adverse drug reactions of polypharmacy components in medicine by supporting component-component information and disease-component information, through data queuing algorithm and vast amounts of pharmaceutical big data. In addition, by providing information for drugs, drug components, prohibited drugs, as well as suppliers and distributors, it could help ease anxiety about taking drugs not only for health-care professionals but also for general users. The representative information provided were side effects between two drugs, main components and effectiveness of particular drugs, drugs manufactured by the same pharmaceutical company, and drug component information for patients with chronic diseases. The future work is to update the database by collecting information on rare & new diseases and new drugs.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.373-373
• /
• 2000

In this paper, we propose a fuzzy modeling algorithm which divides the input space more efficiently than convention methods by taking into consideration correlations between components of sample data. The proposed fuzzy modeling algorithm consists of two steps: coarse tuning, which determines consequent parameters approximately using FCRM clustering method, and fine tuning, which adjusts the premise and consequent parameters more precisely by gradient descent algorithm. To evaluate the performance of the proposed fuzzy mode, we use the numerical data of nonlinear function.