• 환경생물
• /
• 제36권2호
• /
• pp.190-198
• /
• 2018

The petroleum industry is an important part of the world economy. However, the massive exposure of petroleum in nature is a major cause of environmental pollution. Therefore, the microbial mediated biodegradation of petroleum residues is an emerging scientific approach used to resolve these problem. Through the screening of diesel contaminated soil we isolated a rapid phenanthrene and a diesel degrading bacterium identified as Enterobacter cancerogenus DA1 strain through 16S rRNA gene sequence analysis. The strain was registered in NCBI with an accession number MG270576. The optimal growth condition of the DA1 strain was determined at pH 8 and $35^{\circ}C$, and the highest degradation rate of the diesel was achieved at this condition. At the optimal condition, growth of the strain on the medium containing 0.05% phenanthrene and 0.1% of diesel-fuel was highest at 45 h and 60 h respectively after the incubation period. Biofilm formation was found significantly higher at $35^{\circ}C$ as compared to $30^{\circ}C$ and $40^{\circ}C$. Likewise, the lipase activity was found significantly higher at 48 h after the incubation compared to 24 h and 72 h. These results suggest that the Enterobacter cancerogenus DA1 could be an efficient candidate, for application through ecofriendly scientific approach, for the biodegradation of petroleum products like diesel.

• International Journal of Railway
• /
• 제4권4호
• /
• pp.109-115
• /
• 2011

An analysis and design method for reducing aerodynamic noise in high-speed trains based on biomimetics of noiseless flight of owl is proposed. Five factors related to the morphology of the flight feather have been selected, and the candidate optimal shape of the flight feather is determined. The turbulent flow field analysis demonstrates that the optimal shape leads to diminished vortex formation by causing separation of the flow as well as allowing the fluid to climb up along the surface of the flight feather. To determine the effect of scaling of the owl's flight feather on the noise reduction, a two-fold and a four-fold scaled up model of the feather are constructed, and the numerical simulations are carried out to obtain the aerodynamic noise levels for each scale. Original model is found to reduce the noise level by 10 dBA, while two-fold increase in length dimensions reduces the noise by 12 dBA. Validation of numerical solution using wind tunnel experimental measurements is presented as well.

• 한국컴퓨터정보학회논문지
• /
• 제23권10호
• /
• pp.57-63
• /
• 2018

The operating system for an isolated microgrid, which is completely disconnected from the central power system, aims at preventing blackouts and minimizing power generation costs of diesel generators through efficient operation of the energy storage system (ESS) that stores energy produced by renewable energy generators and diesel generators. In this paper, we predict the amount of renewable energy generation using the weather forecast and build an optimal diesel power generation plan using a genetic algorithm. In order to avoid inefficiency due to inaccurate prediction of renewable energy generation, our search algorithm imposes penalty on candidate diesel power generation plans that fail to maintain the SOC (state of charge) of ESS at an appropriate level. Simulation experiments show that our optimization method for maintaining an appropriate SOC balance can prevent the blackout better when compared with the previous method.

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

This paper is concerned with an application of Parallel Genetic Algorithms(PGA) to optimal econmic load dispatch(ELD) in power systems. The ELD problem is to minimize the total generation fuel cost of power outputs for all generating units while satisfying load balancing constraints. Genetic Algorithms(GA) is a good candidate for effective parallelization because of their inherent principle of evolving in parallel a population of individuals. Each individual of a population evaluates the fitness function without data exchanges between individuals. In application of the parallel processing to GA, it is possible to use Single Instruction stream, Multiple Data stream(SIMD), a kind of parallel system. The architecture of SIMD system need not data communications between processors assigned. The proposed ELD problem with C code is implemented by SIMSCRIPT language for parallel processing which is a powerfrul, free-from and versatile computer simulation programming language. The proposed algorithms has been tested for 38 units system and has been compared with Sequential Quadratic programming(SQP).

• 대한기계학회논문집
• /
• 제16권2호
• /
• pp.236-247
• /
• 1992

Optimization has been developed to minimize the cost function while satisfying constraints. Nonlinear Programming method is used as a tool for the optimization. Usually, cost and constraint function calculations are required in the engineering applications, but those calculations are extremely expensive. Especially, the function and sensitivity analyses cause a bottleneck in structural optimization which utilizes the Finite Element Method. Also, when the functions are quite noisy, the informations do not carry out proper role in the optimization process. An algorithm called "Second-order Approximation Method" has been proposed to overcome the difficulties recently. The cost and constraint functions are approximated by the second-order Taylor series expansion on a nominal points in the algorithm. An optimal design problem is defined with the approximated functions and the approximated problem is solved by a nonlinear programming numerical algorithm. The solution is included in a candidate point set which is evaluated for a new nominal point. Since the functions are approximated only by the function values, sensitivity informations are not needed. One-dimensional line search is unnecessary due to the fact that the nonlinear algorithm handles the approximated functions. In this research, the method is analyzed and the performance is evaluated. Several mathematical problems are created and some standard engineering problems are selected for the evaluation. Through numerical results, applicabilities of the algorithm to large scale and complex problems are presented.presented.

• Journal of Information Processing Systems
• /
• 제19권2호
• /
• pp.149-163
• /
• 2023

Affected by external factors, errors in time series data collected by sensors are common. Using the traditional method of constraining the speed change rate to clean the errors can get good performance. However, they are only limited to the data of stable changing speed because of fixed constraint rules. Actually, data with uneven changing speed is common in practice. To solve this problem, an online cleaning algorithm for time series data based on dynamic speed change rate constraints is proposed in this paper. Since time series data usually changes periodically, we use the extreme learning machine to learn the law of speed changes from past data and predict the speed ranges that change over time to detect the data. In order to realize online data repair, a dual-window mechanism is proposed to transform the global optimal into the local optimal, and the traditional minimum change principle and median theorem are applied in the selection of the repair strategy. Aiming at the problem that the repair method based on the minimum change principle cannot correct consecutive abnormal points, through quantitative analysis, it is believed that the repair strategy should be the boundary of the repair candidate set. The experimental results obtained on the dataset show that the method proposed in this paper can get a better repair effect.

• Journal of information and communication convergence engineering
• /
• 제21권2호
• /
• pp.117-129
• /
• 2023

High-utility itemset mining (HIUM) has emerged as a key data-mining paradigm for object-of-interest identification and recommendation systems that serve as frequent itemset identification tools, product or service recommendation systems, etc. Recently, it has gained widespread attention owing to its increasing role in business intelligence, top-N recommendation, and other enterprise solutions. Despite the increasing significance and the inability to provide swift and more accurate predictions, most at-hand solutions, including frequent itemset mining, HUIM, and high average- and fast high-utility itemset mining, are limited to coping with real-time enterprise demands. Moreover, complex computations and high memory exhaustion limit their scalability as enterprise solutions. To address these limitations, this study proposes a model to extract high-utility frequent closed itemsets based on an improved cumulative summary list structure (CSLFC-HUIM) to reduce an optimal set of candidate items in the search space. Moreover, it employs the lift score as the minimum threshold, called the cumulative utility threshold, to prune the search space optimal set of itemsets in a nested-list structure that improves computational time, costs, and memory exhaustion. Simulations over different datasets revealed that the proposed CSLFC-HUIM model outperforms other existing methods, such as closed- and frequent closed-HUIM variants, in terms of execution time and memory consumption, making it suitable for different mined items and allied intelligence of business goals.

• 한국산업정보학회논문지
• /
• 제24권5호
• /
• pp.115-120
• /
• 2019

본 논문에서는 이동 구간 입자 군집 최적화 (Receding horizon particle swarm optimization; RHPSO) 알고리즘 기반 다개체 로봇 편대 제어 알고리즘의 통계적 성능 분석 결과를 제시한다. 다개체 로봇의 편대 제어 문제는 로봇 간 충돌 회피를 고려할 경우, 구속 조건이 있는 비선형 최적화 문제로 정의될 수 있다. 일반적으로 구속 조건이 있는 비선형 최적화 문제는 최적해를 찾는데 많은 시간이 걸리는 문제점이 있다. 이동 구간 입자 군집 최적화 알고리즘은 로봇 편대 제어의 최적화 문제에 대한 준최적해를 빠르게 찾기 위해 제안된 알고리즘이다. 이동 구간 입자 군집 최적화 알고리즘은 알고리즘에 사용되는 후보해의 개수와 세대 수가 증가함에 따라 계산 복잡도가 증가한다. 따라서 최소의 후보해와 세대 수만으로 실시간 제어에 사용될 수 있는 준최적해를 찾는 것이 중요하다. 본 논문에서는 이동 구간 입자 군집 최적화 알고리즘의 후보해의 수와 세대 수에 따른 제어 오차를 비교하였다. 다양한 조건의 시뮬레이션 실험을 통해서 통계적으로 결과를 분석하고, 허용 가능한 편대 오차 범위 내에서 이동 구간 입자 군집 최적화 알고리즘의 최소 후보해의 수와 세대 수를 도출한다.

• 한국환경과학회지
• /
• 제22권11호
• /
• pp.1457-1464
• /
• 2013

We investigated the optimal conditions for keratinase production by feather-degrading Pseudomonas geniculata H10 using one variable at a time (OVT) method. The optimal medium composition and cultural condition for keratinase production were determined to be glucose 0.15% (w/v), beef extract 0.08% (w/v), $KH_2PO_4$ 0.12% (w/v), $K_2HPO_4$ 0.02% (w/v), NaCl 0.07% (w/v), $MgSO_4{\cdot}7H_2O$ 0.03%, $MgCl_2{\cdot}6H_2O$ 0.04% along with initial pH 10 at 200 rpm and $25^{\circ}C$, respectively. The production yield of keratinase was 31.6 U/ml in an optimal condition, showing 4.6-fold higher than that in basal medium. The strain H10 also showed plant growth promoting activities. This strain had ammonification activity and produced indoleacetic acid (IAA), siderophore and a variety of hydrolytic enzymes such as protease, lipase and chitinase. Therefore, this study showed that P. geniculata H10 could be not only used to upgrade the nutritional value of feather wastes but also useful in situ biodegradation of feather wastes. Moreover, it is also a potential candidate for the development of biofertilizing agent applicable to crop plant soil.

• 한국인터넷방송통신학회논문지
• /
• 제15권4호
• /
• pp.249-257
• /
• 2015

본 논문은 지금까지 해결하지 못한 난제 중 하나인 외판원 문제의 최적 해를 구하는 발견적 알고리즘을 제안한다. 제안된 알고리즘은 초기 경로를 결정하기 위해 기존의 DNN을 변형한 SW-DNN, DW-DNN과 DC-DNN을 제안하였다. 초기 해는 DNN, SW-DNN, DW-DNN과 DC-DNN을 적용하여 최소 경로 길이를 가진 방법을 선택한다. 초기 해에 대해 최적 해를 구하기 위해 먼저 삭제 대상 간선을 선택하는 방법을 결정하였으며, 이들 간선들에 대해 지역 탐색 방법인 k-opt 중에서 2, 2.5, 3-opt를 먼저 적용하고, 삭제 대상 간선들 중 삭제되지 않은 간선들에 대해 4-opt를 적용하였다. 제안된 알고리즘을 대규모의 TSP인 26개의 유럽 도시들을 방문하는 TSP-1과 49개의 미국 도시들을 방문하는 TSP-2에 적용한 결과 모두 최적 해를 구하는데 성공하였다. 제안된 알고리즘은 지금까지 발견적 방법으로는 TSP의 최적 해를 구하지 못한다는 미신을 타파하였고, TSP의 알고리즘으로 적용할 수 있을 것이다.