• 대한전기학회논문지:전력기술부문A
• /
• 제48권3호
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• Journal of Electrical Engineering and Technology
• /
• 제12권6호
• /
• pp.2118-2126
• /
• 2017

The large-scale power system blackouts have indicated that conventional protection relays that based on local signals cannot fit for modern power grids with complicated setting or heavily loaded-flow transfer. In order to accurately detect various faulted lines and improve the fault-tolerance of wide-area protection, a novel multi-section weighed fault matching and detecting algorithm is proposed. The real protection vector (RPV) and expected section protection vectors (ESPVs) for five fault sections are constructed respectively. The function of multi-section weighed fault matching is established to calculate the section fault matching degrees between RPV and five ESPVs. Then the fault degree of protected line based on five section fault degrees can be obtained. Two fault detecting criterions are given to support the higher accuracy rate of detecting fault. With the enumerating method, the simulation tests illustrate the correctness and fault-tolerance of proposed algorithm. It can reach the target of 100% accuracy rate under 5 bits error of wide-area protections. The influence factors of fault-tolerance are analyzed, which include the choosing of wide-area protections, as well as the topological structures of power grid and fault threshold.

• 한국생물정보학회:학술대회논문집
• /
• 한국생물정보시스템생물학회 2004년도 The 3rd Annual Conference for The Korean Society for Bioinformatics Association of Asian Societies for Bioinformatics 2004 Symposium
• /
• pp.250-261
• /
• 2004

A novel method for ab initio prediction of protein tertiary structures, PROFESY (PROFile Enumerating SYstem), is introduced. This method utilizes secondary structure prediction information and fragment assembly. The secondary structure prediction of proteins is performed with the PREDICT method which uses PSI-BLAST to generate profiles and a distance measure in the pattern space. In order to predict the tertiary structure of a protein sequence, we assemble fragments in the fragment library constructed as a byproduct of PREDICT. The tertiary structure is obtained by minimizing the potential energy using the conformational space annealing method which enables one to sample diverse low lying minima of the energy function. We apply PROFESY for prediction of some proteins with known structures, which shows good performances. We also participated in CASP5 and applied PROFESY to new fold targets for blind predictions. The results were quite promising, despite the fact that PROFESY was in its early stage of development. In particular, the PROFESY result is the best for the hardest target T0161.

• Asian-Australasian Journal of Animal Sciences
• /
• 제20권2호
• /
• pp.283-294
• /
• 2007

Conventional culture-based methods of enumerating rumen microorganisms (bacteria, archaea, protozoa, and fungi) are being rapidly replaced by nucleic acid-based techniques which can be used to characterise complex microbial communities without incubation. The foundation of these techniques is 16S/18S rDNA sequence analysis which has provided a phylogenetically based classification scheme for enumeration and identification of microbial community members. While these analyses are very informative for determining the composition of the microbial community and monitoring changes in population size, they can only infer function based on these observations. The next step in functional analysis of the ecosystem is to measure how specific and, or, predominant members of the ecosystem are operating and interacting with other groups. It is also apparent that techniques which optimise the analysis of complex microbial communities rather than the detection of single organisms will need to address the issues of high throughput analysis using many primers/probes in a single sample. Nearly all the molecular ecological techniques are dependant upon the efficient extraction of high quality DNA/RNA representing the diversity of ruminal microbial communities. Recent reviews and technical manuals written on the subject of molecular microbial ecology of animals provide a broad perspective of the variety of techniques available and their potential application in the field of animal science which is beyond the scope of this treatise. This paper will focus on nucleic acid based molecular methods which have recently been developed for studying major functional groups (cellulolytic bacteria, protozoa, fungi and methanogens) of microorganisms that are important in nutritional studies, as well as, novel methods for studying microbial diversity and function from a genomics perspective.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제8권2호
• /
• pp.195-205
• /
• 2002

승무일정계획이란 특정 기간동안 운행할 차량들을 대상으로 각 차량마다 필요로 하는 승무원을 배정하는 계획을 말한다. 최적 승무일정계획의 수립은 일반적으로 가능한 모든 종류의 개별 근무표들을 생성한 다음 이들을 대상으로 투입 승무원의 수가 최 소화 될 수 있는 최적조합을 선정하는 방식으로 이루어지고 있다. 근무표 최적조합의 선정을 위한 종래의 기법들은 주로 선형계획법에 기반을 두고 있으나, 목적함수에 선형식으로 표현하기 어려운 요소가 포함되어 있을 경우 적용이 어렵다는 문제가 있다. 본 논문은 선형식으로 표현하기 어려운 목적함수를 포함할 뿐만 아니라 동원 가능한 승무원의 수가 제한되어 있는 경우에도 계획 수립이 가능하도록, 기존의 정수계획법에 휴리스틱 탐색기법을 결합하는 방안을 제시한다. 휴리스틱 탐색은 정수계획법에 의해 일차로 도출된 계획의 불완전한 부분을 교정하기 위해 반복적 개선 탐색을 수행하는 방식으로 이루어진다. 기존의 방법으로 해결이 어려운 실제 현장의 승무일정계획 문제를 대상으로 한 실험 결과, 본 논문의 방법은 전문가의 수작업 결과보다 더 좋은 수준의 계획을 빠른 시간 내에 수립할 수 있음을 확인하였다.