• 대한기계학회논문집
• /
• 제17권12호
• /
• pp.3063-3072
• /
• 1993

The layout is an important and difficult problem in industrial applications like sheet metal manufacturing, garment making, circuit layout, plant layout, and land development. The module layout problem is known to be non-deterministic polynomial time complete(NP-complete). To efficiently find an optimal layout from a large number of candidate layout configuration a heuristic algorithm could be used. In recent years, a number of researchers have investigated the combinatorial optimization problems by using neural network principles such as traveling salesman problem, placement and routing in circuit design. This paper describes the application of Self-organizing Feature Maps(SOM) of the Kohonen network and Simulated Annealing Algorithm(SAA) to the layout problem of the two-dimensional rectangular shapes.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제6권3호
• /
• pp.598-625
• /
• 2014

To support the procedure for determining an optimal liquefaction cycle for FLNG FEED, an ontological modeling method which can automatically generate various alternative liquefaction cycles were carried out in this paper. General rules in combining equipment are extracted from existing onshore liquefaction cycles like C3MR and DMR cycle. A generic relational model which represents whole relations of the plant elements has all these rules, and it is expressed by using the system entity structure (SES), an ontological framework that hierarchically represents the elements of a system and their relationships. By using a process called pruning which reduces the SES to a candidate, various alternative relational models of the liquefaction cycles can be automatically generated. These alternatives were provided by XML-based formats, and they can be used for choosing an optimal liquefaction cycle on the basis of the assessments such as process simulation and reliability analysis.

• 한국축산식품학회지
• /
• 제41권1호
• /
• pp.164-171
• /
• 2021

Listeria monocytogenes is a representative foodborne pathogen and causes listeriosis. Enterococcus faecium CJNU 2524 was confirmed to produce a bacteriocin with anti-listerial activity. To establish optimal culture conditions for the production of the bacteriocin from E. faecium CJNU 2524, different media (MRS and BHI broth) and temperatures (25℃, 30℃, and 37℃) were investigated. The results showed that the optimal culture conditions were MRS broth and 25℃ or 30℃ temperatures. The crude bacteriocin was stable in a broad range of pH conditions (2.0-10.0), temperatures (60℃-100℃), and organic solvents (methanol, ethanol, acetone, acetonitrile, and chloroform). The bacteriocin activity was abolished when treated with protease but not α-amylase or lipase, indicating the proteinaceous nature of the bacteriocin. Finally, the bacteriocin showed a bactericidal mode of action against L. monocytogenes. Therefore, it can be a biopreservative candidate for controlling L. monocytogenes in dairy and meat products.

• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2006년도 제26회 춘계학술대회논문집
• /
• pp.130-134
• /
• 2006

분사면 냉각성능을 개선하기 위한 액체로켓 엔진 연료 매니폴드내의 분리판 설치에 따른 분사균일성 변화를 관찰하였다. 3차원 전산유동해석으로 5개 후보 설계에 대하여 분사균일성을 비교하였으며 최적설계에 대하여 측정결과와 비교함으로써 해석방법을 검증하였다. case I과 II는 매니폴드로 공급되는 유량 전체가 분리판 아래로만 흘러 유속이 크게 증가한다. 하지만 분리판이 끝나는 지점에서의 유속변화와 분사면 중심에서의 유량의 집중으로 분사균일성이 크게 저하된다. 이에 비해 분리판이 입구에서 떨어져 장착된 case III와 IV는 유동이 분리판 위, 아래로 흐를 수 있어 유량집중이 완화되므로 균일한 분사특성을 가진다. 비교한 5가지 설계 중 냉각성능과 분사균일성 측면에서 case IV가 최적으로 판단된다.

• 한국인터넷방송통신학회논문지
• /
• 제11권6호
• /
• pp.193-205
• /
• 2011

본 논문은 $m$개의 후보 시설과 $n$개의 거주지역이 존재하는 경우, 비용 (주민수 ${\times}$ 최단거리) 측면에서 $p$개의 최적의 시설 위치를 선정하는 알고리즘을 제안하였다. 이 문제는 다항시간 알고리즘이 제안되지 않아 NP-난제로 분류되어 있다. 본 논문에서는 각 지역에서의 최소 비용을 선택한 $p=m$의 시설로부터 각 지역을 다음 최소 비용 시설로 이동시킬 경우 최소비용합으로 삭제할 수 있는 후보 시설을 $p=2$가 될 때까지 한 번에 하나씩 제거하는 방법으로 역-삭제 방법이다. 제안된 알고리즘은 다양한 문제들에 적용한 결과 $m{\times}n$이 $5{\times}5$, $7{\times}7$인 경우에는 초기 해로 최적해를 구하였다. Swain의 55-노드 망에 대해서는 $p=4$인 경우 해 개선 과정을 수행하여 최적해를 구하였으며, $p=5$인 경우에는 초기해로 최적해를 구하였다.

• International Journal of Oral Biology
• /
• 제42권2호
• /
• pp.63-70
• /
• 2017

Selecting an appropriate antigen with optimal immunogenicity and physicochemical properties is a pivotal factor to develop a protein based subunit vaccine. Despite rapid progress in modern molecular cloning and recombinant protein technology, there remains a huge challenge for purifying and using protein antigens rich in hydrophobic domains, such as membrane associated proteins. To overcome current limitations using hydrophobic proteins as vaccine antigens, we adopted in silico analyses which included bioinformatic prediction and sequence-based protein 3D structure modeling, to develop a novel periodontitis subunit vaccine against the outer membrane protein FomA of Fusobacterium nucleatum. To generate an optimal antigen candidate, we predicted hydrophilicity and B cell epitope parameter by querying to web-based databases, and designed a truncated FomA (tFomA) candidate with better solubility and preserved B cell epitopes. The truncated recombinant protein was engineered to expose epitopes on the surface through simulating amino acid sequence-based 3D folding in aqueous environment. The recombinant tFomA was further expressed and purified, and its immunological properties were evaluated. In the mice intranasal vaccination study, tFomA significantly induced antigen-specific IgG and sIgA responses in both systemic and oral-mucosal compartments, respectively. Our results testify that intelligent in silico designing of antigens provide amenable vaccine epitopes from hard-to-manufacture hydrophobic domain rich microbial antigens.

• 로봇학회논문지
• /
• 제18권1호
• /
• pp.1-9
• /
• 2023

This paper presents an optimal path planning strategy for aerial searching and surveying of a user-designated area using multiple Unmanned Aerial Vehicles (UAVs). The method is designed to deal with a single unseparated polygonal area, regardless of polygonal convexity. By defining the search area into a set of grids, the algorithm enables UAVs to completely search without leaving unsearched space. The presented strategy consists of two main algorithmic steps: cellular decomposition and path planning stages. The cellular decomposition method divides the area to designate a conflict-free subsearch-space to an individual UAV, while accounting the assigned flight velocity, take-off and landing positions. Then, the path planning strategy forms paths based on every point located in end of each grid row. The first waypoint is chosen as the closest point from the vehicle-starting position, and it recursively updates the nearest endpoint set to generate the shortest path. The path planning policy produces four path candidates by alternating the starting point (left or right edge), and the travel direction (vertical or horizontal). The optimal-selection policy is enforced to maximize the search efficiency, which is time dependent; the policy imposes the total path-length and turning number criteria per candidate. The results demonstrate that the proposed cellular decomposition method improves the search-time efficiency. In addition, the candidate selection enhances the algorithmic efficacy toward further mission time-duration reduction. The method shows robustness against both convex and non-convex shaped search area.

• Earthquakes and Structures
• /
• 제5권1호
• /
• pp.83-109
• /
• 2013

A simple damper optimization method is proposed to find optimal damper allocation for shear buildings under both target added damping ratio and interstorey drift ratio (IDR). The damping coefficients of added dampers are considered as design variables. The cost, which is defined as the sum of damping coefficient of added dampers, is minimized under a target added damping ratio and the upper and the lower constraint of the design variables. In the first stage of proposed algorithm, Simulated Annealing, Nelder Mead and Differential Evolution numerical algorithms are used to solve the proposed optimization problem. The candidate optimal design obtained in the first stage is tested in terms of the IDRs using linear time history analyses for a design earthquake in the second stage. If all IDRs are below the allowable level, iteration of the algorithm is stopped; otherwise, the iteration continues increasing the target damping ratio. By this way, a structural response IDR is also taken into consideration using a snap-back test. In this study, the effects of the selection of upper limit for added dampers, the storey mass distribution and the storey stiffness distribution are all investigated in terms of damper distributions, cost function, added damping ratio and IDRs for 6-storey shear building models. The results of the proposed method are compared with two existing methods in the literature. Optimal designs are also compared with uniform designs according to both IDRs and added damping ratios. The numerical results show that the proposed damper optimization method is easy to apply and is efficient to find optimal damper distribution for a target damping ratio and allowable IDR value.

• 한국경영과학회지
• /
• 제22권3호
• /
• pp.37-58
• /
• 1997

An AI approach with tabu search is designed to solve multi-level knapsack problems. The approach performs intelligent actions with memories of historic data and learning effect. These action are developed ont only by observing the attributes of the optimal solution, the solution space, and its corresponding path to the optimal, but also by applying human intelligence, experience, and intuition with respect to the search strategies. The approach intensifies, or diversifies the search process appropriately in time and space. In order to create a good neighborhood structure, this approach uses two powerful choice rules that emphasize the impact of candidate variables on the current solution with respect to their profit contribution. "Pseudo moves", similar to "aspirations", support these choice rules during the evaluation process. For the purpose of visiting as many relevant points as possible, strategic oscillation between feasible and infeasible solutions around the boundary is applied. To avoid redundant moves, short-term (tabu-lists), intemediate-term (cycle-detection), and long-term (recording frequency and significant solutions for diversfication) memories are used. Test results show that among the 45 generated problems (these problems pose significant or insurmountable challenges to exact methods) the approach produces the optimal solutions in 39 cases.lutions in 39 cases.

• 방송공학회논문지
• /
• 제16권1호
• /
• pp.174-177
• /
• 2011

본 논문에서는 CSD 계수로 표현되는 FIR 필터를 설계하는 방법에 관하여 고찰한다. 먼저, 게이트 수 측면에서 필터의 복잡도를 추정하는 방법을 제시한다. 이 방법을 통하여 최소의 복잡도를 가지면서 요구되는 성능을 만족시키는 필터를 설계할 수 있다. 다음으로 BonsaiG이라는 MILP 프로그램에 근거한 CSD 필터 설계 프로그램을 제시한다. 2가지 예제를 통해 설계된 필터의 게이트 수가 400-600 정도 차이를 나타내고, 이러한 비교를 통해 최적의 필터를 얻을 수 있음을 보인다.