• 전기학회논문지
• /
• 제57권3호
• /
• pp.518-526
• /
• 2008

The fuzzy self-tuning PID controller is a PID controller with a fuzzy logic mechanism for tuning its gains on-line. In this structure, the proportional, integral and derivative gains are tuned on-line with respect to the change of the output of system under control. This paper deals with two types of fuzzy self-tuning PID controllers, rule-based fuzzy PID controller and learning fuzzy PID controller. As a medical application of fuzzy PID controller, the proposed controllers were implemented and evaluated in a laparoscopic surgery robot system. The proposed fuzzy PID structures maintain similar performance as conventional PID controller, and enhance the position tracking performance over wide range of varying input. For precise approximation, the fuzzy PID controller was realized using the linear reasoning method, a type of product-sum-gravity method. The proposed controllers were compared with conventional PID controller without fuzzy gain tuning and was proved to have better performance in the experiment.

• 대한산업공학회지
• /
• 제36권2호
• /
• pp.125-137
• /
• 2010

This study focuses on the problem of scheduling wafer lots of several product families in the deposition workstation in a semiconductor wafer fabrication facility. There are multiple identical parallel machines in the deposition workstation, and two types of setups, record-dependent setup and family setup, may be required at the deposition machines. A record-dependent setup is needed to find optimal operational conditions for a wafer lot on a machine, and a family setup is needed between processings of different families. We suggest two-phase heuristic algorithms in which a priority-rule-based scheduling algorithm is used to generate an initial schedule in the first phase and the schedule is improved in the second phase. Results of computational tests on randomly generated test problems show that the suggested algorithms outperform a scheduling method used in a real manufacturing system in terms of the sum of weighted flowtimes of the wafer lots.

• Journal of Communications and Networks
• /
• 제15권2호
• /
• pp.217-221
• /
• 2013

Quantum low-density parity-check (LDPC) codes based on the Calderbank-Shor-Steane construction have low encoding and decoding complexity. The sum-product algorithm(SPA) can be used to decode quantum LDPC codes; however, the decoding performance may be significantly decreased by the many four-cycles required by this type of quantum codes. All four-cycles can be eliminated using the entanglement-assisted formalism with maximally entangled states (ebits). The proposed entanglement-assisted quantum error-correcting code based on Euclidean geometry outperform differently structured quantum codes. However, the large number of ebits required to construct the entanglement-assisted formalism is a substantial obstacle to practical application. In this paper, we propose a novel class of entanglement-assisted quantum LDPC codes constructed using classical Euclidean geometry LDPC codes. Notably, the new codes require one copy of the ebit. Furthermore, we propose a construction scheme for a corresponding zigzag matrix and show that the algebraic structure of the codes could easily be expanded. A large class of quantum codes with various code lengths and code rates can be constructed. Our methods significantly improve the possibility of practical implementation of quantum error-correcting codes. Simulation results show that the entanglement-assisted quantum LDPC codes described in this study perform very well over a depolarizing channel with iterative decoding based on the SPA and that these codes outperform other quantum codes based on Euclidean geometries.

• Journal of Communications and Networks
• /
• 제15권1호
• /
• pp.71-76
• /
• 2013

A new class of quantum low-density parity-check (LDPC) codes whose parity-check matrices are dual-containing matrices constructed based on lines of Euclidean geometries (EGs) is presented. The parity-check matrices of our quantum codes contain one and only one 4-cycle in every two rows and have better distance properties. However, the classical parity-check matrix constructed from EGs does not satisfy the condition of dual-containing. In some parameter conditions, parts of the rows in the matrix maybe have not any nonzero element in common. Notably, we propose four families of fascinating structure according to changes in all the parameters, and the parity-check matrices are adopted to satisfy the requirement of dual-containing. Series of matrix properties are proved. Construction methods of the parity-check matrices with dual-containing property are given. The simulation results show that the quantum LDPC codes constructed by this method perform very well over the depolarizing channel when decoded with iterative decoding based on the sum-product algorithm. Also, the quantum codes constructed in this paper outperform other quantum codes based on EGs.

• Nuclear Engineering and Technology
• /
• 제53권2호
• /
• pp.399-413
• /
• 2021

The solution of the time-dependent neutron diffusion equation can be approximated using quasi-static methods that factorise the neutronic flux as the product of a time dependent function times a shape function that depends both on space and time. A generalization of this technique is the updated modal method. This strategy assumes that the neutron flux can be decomposed into a sum of amplitudes multiplied by some shape functions. These functions, known as modes, come from the solution of the eigenvalue problems associated with the static neutron diffusion equation that are being updated along the transient. In previous works, the time step used to update the modes is set to a fixed value and this implies the need of using small time-steps to obtain accurate results and, consequently, a high computational cost. In this work, we propose the use of an adaptive control time-step that reduces automatically the time-step when the algorithm detects large errors and increases this value when it is not necessary to use small steps. Several strategies to compute the modes updating time step are proposed and their performance is tested for different transients in benchmark reactors with rectangular and hexagonal geometry.

• 전자공학회논문지
• /
• 제50권11호
• /
• pp.78-89
• /
• 2013

본 논문은 전 병렬구조를 기반으로 고속으로 동작하며 다중 모드를 지원하는 quasi-cyclic (QC) low-density parity-check(LDPC) 복호기를 제안한다. 제안하는 QC-LDPC 복호기는 고속 throughput을 지원하기 위하여 전 병렬구조를 기반으로 설계되었다. 전 병렬구조를 사용함에 따라 발생하는 인터커넥션의 복잡도 문제는 broadcasting 기반의 sum-product 알고리즘의 사용과 저복잡도 순환 쉬프트 네트워크를 제안함으로써 해결하였다. 또한, 전 병렬구조에서 체크 노드 프로세서와 변수 노드 프로세서의 사용량이 많아 발생하는 복잡도 문제를 제안하는 결합된 체크 및 변수 노드 프로세서를 통하여 해결하였다. 제안하는 QC-LDPC 복호기는 라우팅 방식의 인터커넥션 네트워크, 다중 모드를 지원하는 결합된 체크 및 변수 노드 프로세서와 순환 쉬프트 네트워크를 통하여 다중 모드를 지원할 수 있다. 제안하는 QC-LDPC decoder는 100 MHz 클락 주파수로 동작하며, 다중 모드를 지원하고 (1944, 1620) QC-LDPC 부호에 대해서 8.1 Gbps의 throughput을 지원한다.

• 한국자동차공학회논문집
• /
• 제15권3호
• /
• pp.63-71
• /
• 2007

During the design phase of a product, reliability and design engineers are called upon to evaluate the reliability of the system, The question of how to meet target reliability for the system arises when estimated reliability or cost is inadequate. This then becomes a problem of reliability allocation and system structure design. This study proposes the optimization methodology to achieve target reliability with minimum cost through construction of the cost function of system. In cost function, total cost means the sum of initial cost, repair cost and maintenance cost. This study constructs optimization problem about system structure design and reliability allocation using cost function. This problem constructed is solved by Multi-island Genetic Algorithm(MIGA), and applies to urban transit brake system. Current brake system of the urban transit is series system. Series system is the simplest and perhaps one of the most common system, but it demands high reliability and maintenance cost because all components must be operating to ensure system operation. Thus this study makes a comparative study by applying k-out-of-n system to brake system. This methodology presented can be a great tool for aiding reliability and design engineers in their decision-makings.

• 한국농공학회논문집
• /
• 제49권3호
• /
• pp.79-88
• /
• 2007

This paper suggests a hierarchial method to select the target sites for the nonpoint source pollution management considering factors which reflect the interrelationships of significant outflow characteristics of nonpoint source pollution at given sites. The factors consist of land slope, delivery distance to the outlet, effective rainfall, impervious area ratio and soil loss. The weight of each factor was calculated by an analytic hierarchy process(AHP) algorithm and the resulting influencing index was defined from the sum of the product of each factor and its computed weight value. The higher index reflect the proposed target sites for nonpoint source pollution management. The proposed method was applied to the Baran HP#6 watershed, located southwest from Suwon city. The Agricultural Nonpoint Pollution Source(AGNPS) model was also applied to identify sites contributing significantly to the nonpoint source pollution loads from the watershed. The spatial correlation between the two results for sites was analyzed using Moran's I values. The I values were $0.38{\sim}0.45$ for total nitrogen(T-N), and $0.15{\sim}0.22$ for total phosphorus(T-P), respectively. The results showed that two independent estimates for sites within the test water-shed were highly correlated, and that the proposed hierarchial method may be applied to select the target sites for nonpoint source pollution management.

• 한국음향학회지
• /
• 제22권2호
• /
• pp.145-152
• /
• 2003

본 논문에서는 인식 단위로서의 개개의 은닉 마코프 모델 (HMM: Hidden Markvo Model)에 대응하는 가중치를 도입하여 HMM출력 스코어는 HMM출력 확률과 HMM 가중치의 곱으로 표현된다고 가정하고 기존의 최소 분류 오류 훈련 방법과 유사하게 HMM 가중치를 반복적으로 훈련하는 방법을 제안하였다. 제안된 방법은 오인식 척도에 대해 차분 (delta) 계수를 정의하고 이를 이용하여 HMM 가중치를 반복하여 훈련하는 방법이다. 이러한 방법은 HMM 가중치의 합을 HMM 개수의 총합으로 제한함으로써 기존의 파라미터 추정 방법과 비터비 (Viterbi) 알고리즘에 큰 변화 없이 음성 인식에 효과적으로 적용될 수 있다. 제안된 방법은 기존의 분할 (segmental) 최소 분류 오류훈련 방법과 비교하여 추정하는 파라미터의 개수가 감소되었으며 훈련 모델의 최적 상태열을 이용한 경도 계산 과정이 포함되지 않음으로써 계산량을 효과적으로 단축할 수 있다. HMM가중치를 이용한 HMM기반의 음성 인식기의 성능 평가를 위해서 단독 숫자음 인식 실험을 실시하였다. 실험적 결과들은 HMM 확률 보정을 이용한 음성 인식 시스템이 베이스라인 시스템보다 음성 인식 성능이 더 우수함을 보여준다. 제안된 방법은 기존의 최소 분류 오류 훈련 방법에 비하여 구현하기 간편한 반면에 더욱 우수한 음성 인식 성능 향상을 보여준다.

• 정보관리학회지
• /
• 제34권1호
• /
• pp.177-195
• /
• 2017

연구전선이란 연구논문들 간에 인용이 빈번하게 발생하며, 지속적으로 발전이 이루어지고 있는 연구영역을 의미한다. 연구행위가 집중되는 핵심 연구분야로 발전 가능성이 높은 연구전선을 조기에 예측해내는 것은 학계와 산업계, 정부기관, 나아가 국가의 과학기술 발전에 큰 유익을 가져다 줄 수 있는 유용한 사회적 자원이 된다. 본 연구는 복합자질을 활용하여 연구전선을 추론하는 모델을 제시하고자 시도하였다. 연구전선 추론은 핵심 연구영역으로 발전할 가능성이 높은 문헌들이 포함될 수 있도록 문헌을 복합자질로 표현하고, 그 자질들을 심층학습하여 새로 발행된 문헌들이 연구전선에 포함될 수 있는지 그 가능성을 예측하였다. 서지 자질, 네트워크 자질, 내용 자질 등 복합자질 세트를 사용하여 문헌을 표현하고 피인용을 많이 받을 가능성이 있는 문헌을 추론하기 위해서 확률기반 팩터그래프 모델을 적용하였다. 추출된 자질들은 팩터그래프의 변수로 표현되어 합-곱 알고리즘과 접합 트리 알고리즘을 적용하여 연구전선 추론이 이루어졌다. 팩터그래프 확률모델을 적용하여 연구전선을 추론 구축한 결과, 서지결합도 4 이상으로 구축된 베이스라인 연구전선과 큰 차이를 보였다. 팩터그래프 기반 연구전선그룹이 서지결합 기반 연구전선그룹보다 문헌 간의 직접 연결정도가 강하며 연결 관계에 있지 않은 두 개의 문헌을 연결시키는 매개정도 또한 강한 집단으로 나타났다.