• Transactions of the Korean Society of Mechanical Engineers
• /
• v.17 no.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
• /
• v.6 no.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.

• Food Science of Animal Resources
• /
• v.41 no.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.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2006.05a
• /
• pp.130-134
• /
• 2006

The injection uniformity of the fuel manifold in a liquid rocket engine has been analyzed with dividing plates to improve the cooling performance at the face plate. Three dimensional computational fluid dynamics analysis has been performed to compare the injection uniformity for 5 candidate designs and has been verified to compare with the measured data for the optimal manifold design. For the case I and II, the coolant mass flux increases as the whole working fluid is enforced to flow under the dividing plate. The injection uniformity decreases due to the variation of mass flux at the end of dividing plate and the concentration of mass flow rate at the center of manifold. However case III and IV have uniform injection performance due to reduced mass flux concentration as the coolant can flow along both upper passage and lower passage of the dividing plate. Among the candidate designs, case IV is thought to be the optimal dividing plate with regard to cooling performance and injection uniformity.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.6
• /
• pp.193-205
• /
• 2011

This paper suggests $p$-facility locations in $m$ candidate locations and $n$ areas in optimal cost side(population${\times}$shortest distance). This problem has been classified by NP-complete because there is not a polynomial time algorithm. In this paper, we suggests reverse-delete method that deletes a candidate facility one by one from $p=m$ until $p=2$. As a result of the proposed algorithm for the $5{\times}5$ and $7{\times}7$, the initial solution is obtained. For the Swain's 55-node network, we obtain the optimal solution through a solution improvement process with $p=4$ and it by using the initial solution with $p=5$.

• International Journal of Oral Biology
• /
• v.42 no.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.

• The Journal of Korea Robotics Society
• /
• v.18 no.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
• /
• v.5 no.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.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.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.

• Journal of Broadcast Engineering
• /
• v.16 no.1
• /
• pp.174-177
• /
• 2011

In this paper, we investigate a method for designing FIR filters with CSD coefficients. Firstly, the H/W complexity of a CSD FIR filter is estimated in terms of number of gates. Using the estimated complexity, an optimal filter that can meet the required performance with minimal H/W complexity can be designed. Next, based on the MILP problem solver called BonsaiG, we present a filter design program. From the two design examples, it is demonstrated that an optimal filter can be obtained by comparing the complexity of the candidate filters in terms of the gate counts, whose differences are estimated to be about 400-600 gates.