http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
공진화 알고리듬을 이용한 최소걸침나무문제에서 k-치명호 결정 방법
정호연 전주대학교 공학기술종합연구소 2002 전주대학교 공학기술종합연구소 학술논문집 Vol.8 No.1
This study deals with the problem to develop a coevolutionary algorithm for determining the k most vital arcs(k-MVAs) in the minimum spanning tree problem(MSTP) In this problem, k-MVAs means a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of minimum spanning tree for the remaining network The problem of the k-MVAs in the MSTP is a kind of combinatorial optimization problem which has been generally known as NP-hard problem that has the limitation of the complexity and calculation time as the size of the problem get larger. Therefore, in order to deal with this problem of real world the heuristic algorithms are needed Considering regards we develop a coevolutionary algorithm in the type of the symbiosis in this study For this, the expression method of individuals compatible with the characteristics of the problem, the population constitution, evolutionary strategies, genetic operations and termination condition etc. are specified and then its performance IS to be compared, evaluated and analyzed through the computer experiments.
수정 유전알고리듬을 사용한 최대유통문제의 치명호 결정방법
정호연,김은영 전주대학교 공학기술종합연구소 1998 전주대학교 공학기술종합연구소 학술논문집 Vol.4 No.2
The purpose of this study is to present a method for determining the k most vital arcs in the maximum flow problem using genetic algorithms. Generally, the problem which determine the k most vital arcs in maximum flow problem has known as NP-hard. Therefore, in this study we propose a method for determining all the k most vital arcs in maximum flow problem using a genetic algorithm and a revised genetic algorithm. First, we propose genetic algorithm to find the k most vital arcs removed at the same time then present the expression and determination method of individuals compatible with the characteristics of the problem, and specify the genetic parameter values of constitution, population size, crossover rate, mutation rate and etc. of the initial population which makes detecting efficiency better. Finally, using the proposed algorithm, we analyzed the performance of searching optimal solution through computer experiment. The proposed algorithms found all alternatives within shorter time than other heuristic methods. The method presented in this study can determine all the alternatives when there exists other alternative solutions.
정호연 全州大學校 1992 論文集 Vol.21 No.-
A new approach to postoptimality analyses of the transportation problems has been developed using the dummy points. In contrast to the usual sensitivity analysis the proposed methods allow for simultaneous or independent change of the supplies or demands while preserving the current optimal basis. Therefore this method will enable resource allocation to be more economical.
A Predictive Model for Farmland Purchase/Rent Using Random Forests
정호연,김영준,임소영 한국농업경제학회 2022 農業經濟硏究 Vol.63 No.3
This study contributes to guidance for understanding farmland purchase and rent decisions in Korea via an analysis using a machine learning tool, Random Forests: A Supervised Machine Learning Algorithm. Farm Household Economy Survey is employed to predict the relationship between farmland acquisition and farm household economic characteristics. Our main findings are two folds. First, a farmland purchase decision is positively related to transfer incomes, the value of inventory & fixed assets, and the value of farmland that farmers owned. Second, a farmland rent decision is also positively associated with a rent paid in a prior year, revenue from field crops, inventory and agricultural assets, and transfer incomes.
정호연 전주대학교 1999 論文集 Vol.24 No.2
The purpose of this study is to propose an algorithm to find out the optimal path and cleaning schedule in a dynamic capacity network such as water, sewage or oil pipeline network where accumulation is occurred as time goes by. First of all, a method used to find out the optimal path in a dynamic capacity network considering accumulation begins with defining the transformed network by using the optimal solution of a given problem and then using the cycle of minimum cost, find out the optimal solution for changed capacity. Because accumulation is linearly occurred as time elapses, we can systematically establish the cleaning schedule for each arc through dynamically computing the expected accumulation for each arc.
반도체 제조시스템에서 설비의 생산 스케쥴링을 위한 진화알고리듬 개발
정호연 전주대학교 공학기술종합연구소 2002 전주대학교 공학기술종합연구소 학술논문집 Vol.8 No.1
The purpose of this study is to develop a co-evolutionary algorithm to deal with the multi-objective scheduling problem to minimize the due date and cycle time simultaneously for scheduling of the IC sort and final test in the ASIC(Application Specific Integrated Circuits) semiconductor manufacturing system. This problem has been known as NP-hard. Therefore, to deal with this problem heuristic algorithm is needed. In this study, we develop a co-evolutionary algorithms for the problem, and through computer experiment, we also evaluate the performance of this algorithm.
정호연,박선민,신범수,이지호,이석정,이명규,리원연,용석중,김상하 대한천식알레르기학회 2019 Allergy, Asthma & Immunology Research Vol.11 No.1
Purpose: Although there have been reported cases of drug reactions with eosinophilia and systemic symptoms (DRESS) syndrome caused by antituberculosis drugs, there has been no research to examine its prevalence. This study assessed the prevalence and clinical characteristics of DRESS syndrome caused by antituberculosis drugs. Methods: The electronic medical records of a cohort consisting of adult patients diagnosed with tuberculosis between July 2006 and June 2010 were reviewed and retrospectively inspected. We searched the surveillance system for adverse drug reactions and the electronic medical records to identify patients who reported severe cutaneous adverse reactions to antituberculosis drugs. These patients were then re-assessed using a European Registry of Severe Cutaneous Adverse Reactions to Drugs and Collection of Biological Samples (RegiSCAR) scoring system. Clinical characteristics, including the symptoms and latency of DRESS syndrome, the therapeutic dosage and period of steroids, and the final duration of tuberculosis therapy, were examined. Results: Of the 1,253 adult patients with tuberculosis receiving antituberculosis drugs, 15 were identified as potential cases of DRESS syndrome (prevalence of 1.2%). Ethambutol was the most frequently used drug (53.5%), followed by rifampicin (26.7%), pyrazinamide (20.0%), streptomycin (13.3%), and isoniazid (6.7%). The median latency after day 1 of antituberculosis medication was 42 days. The median daily dose of steroids, expressed in prednisone-equivalent units, was 33-mg/day, and the median dosing period was 14 days. The duration of tuberculosis treatment was 76 days longer than the standard treatment period of 180 days. There was a significant difference in the peak eosinophil counts of DRESS syndrome patients according to RegiSCAR scores. Moreover, there was a significant quantitative correlation between the RegiSCAR score and peak eosinophil count. A negative correlation was also found between the RegiSCAR score and latency. Conclusions: This study confirmed the prevalence of DRESS syndrome in a cohort of adult patients with tuberculosis.