• Title/Summary/Keyword: Combinatorial method

Search Result 224, Processing Time 0.038 seconds

Genetic-Based Combinatorial Optimization Method for Design of Rolling Element Bearing (구름 베어링 설계를 위한 유전 알고리듬 기반 조합형 최적설계 방법)

  • 윤기찬;최동훈;박창남
    • Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
    • /
    • 2001.11a
    • /
    • pp.166-171
    • /
    • 2001
  • In order to improve the efficiency of the design process and the quality of the resulting design for the application-based exclusive rolling element bearings, this study propose design methodologies by using a genetic-based combinatorial optimization. By the presence of discrete variables such as the number of rolling element (standard component) and by the engineering point of views, the design problem of the rolling element bearing can be characterized by the combinatorial optimization problem as a fully discrete optimization. A genetic algorithm is used to efficiently find a set of the optimum discrete design values from the pre-defined variable sets. To effectively deal with the design constraints and the multi-objective problem, a ranking penalty method is suggested for constructing a fitness function in the genetic-based combinatorial optimization. To evaluate the proposed design method, a robust performance analyzer of ball bearing based on quasi-static analysis is developed and the computer program is applied to some design problems, 1) maximize fatigue life, 2) maximize stiffness, 3) maximize fatigue life and stiffness, of a angular contact ball bearing. Optimum design results are demonstrate the effectiveness of the design method suggested in this study. It believed that the proposed methodologies can be effectively applied to other multi-objective discrete optimization problems.

  • PDF

Case Study of a Deep-vein Thrombosis Patient Treated with Combinatorial Hyulbuchuko-tang (심부정맥혈전증에 대한 혈부축어탕의 치험 1례)

  • Lee, Myeong-hwa;Hur, Hee-soo;Kim, Kyoung-min;Kim, Young-kyun
    • The Journal of Internal Korean Medicine
    • /
    • v.37 no.2
    • /
    • pp.315-321
    • /
    • 2016
  • Objective: This study reports on the clinical effects of combinatorial Hyulbuchuko-tang on a deep-vein thrombosis patient.Method: The deep-vein thrombosis patient was treated using combinatorial Hyulbuchuko-tang and pharmacopuncture (water-soluble carthami flos, WCF) three times a day for 33 days. The effects of deep-vein thrombosis were measured using a 0-10 numerical rating scale (NRS) and external appearance.Result: Improvements in the NRS from 7 to 2 were observed after the combinatorial Hyulbuchuko-tang treatment.Conclusions: From these results, combinatorial Hyulbuchuko-tang may be considered to show improvement for patients with deep-vein thrombosis.

Combinatorial Synthesis of Organic Luminescent Materials (유기발광재료의 조합합성)

  • Kim, Chul-Bae;Jo, Hyun-Jong;Park, Kwang-Yong
    • Applied Chemistry for Engineering
    • /
    • v.21 no.4
    • /
    • pp.357-365
    • /
    • 2010
  • Combinatorial synthesis, which has been adopted as an efficient method for deriving a leading compound in pharmaceutical chemistry, is recently being applied in various fields along with the rapid development of analysis and examination technology. It is especially attracting much attention as an efficient strategy to secure various potent compounds rapidly in the areas of developing new materials where the relationship between the chemical structure and the property is not revealed. Several reports and reviews have already been published for the combinatorial chemistry and combinatorial synthesis. This report briefly introduces trends in the combinatorial development of new materials and discusses the cases of developing organic luminescent materials.

A Rapid Algorithm for Optimal Allocation in Combinatorial Auctions (조합 경매에서의 최적 분배를 위한 빠른 알고리즘)

  • 송진우;양성봉
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.9
    • /
    • pp.477-486
    • /
    • 2003
  • In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.

Combinatorial Solid Phase Peptide Synthesis and Bioassays

  • Shin, Dong-Sik;Kim, Do-Hyun;Chung, Woo-Jae;Lee, Yoon-Sik
    • BMB Reports
    • /
    • v.38 no.5
    • /
    • pp.517-525
    • /
    • 2005
  • Solid phase peptide synthesis method, which was introduced by Merrifield in 1963, has spawned the concept of combinatorial chemistry. In this review, we summarize the present technologies of solid phase peptide synthesis (SPPS) that are related to combinatorial chemistry. The conventional methods of peptide library synthesis on polymer support are parallel synthesis, split and mix synthesis and reagent mixture synthesis. Combining surface chemistry with the recent technology of microelectronic semiconductor fabrication system, the peptide microarray synthesis methods on a planar solid support are developed, which leads to spatially addressable peptide library. There are two kinds of peptide microarray synthesis methodologies: pre-synthesized peptide immobilization onto a glass or membrane substrate and in situ peptide synthesis by a photolithography or the SPOT method. This review also discusses the application of peptide libraries for high-throughput bioassays, for example, peptide ligand screening for antibody or cell signaling, enzyme substrate and inhibitor screening as well as other applications.

A Survey: SDP, its Duality, Complexity and Applications (SDP의 개관: 쌍대성, 계산복잡성 및 응용)

  • 류춘호;명영수;홍성필
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.26 no.2
    • /
    • pp.13-46
    • /
    • 2001
  • SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

  • PDF

Synthesis of Barium Hexaaluminate Phosphros Using Combinatorial Chemistry (조합화학을 이용한 망간(2+)과 유로피움)2+)이 첨가된 Barium Hexaaluminate 형광체의 합성 및 광특성 분석)

  • 박응석;최윤영;손기선;김창해;박희동
    • Journal of the Korean Ceramic Society
    • /
    • v.37 no.2
    • /
    • pp.134-139
    • /
    • 2000
  • The main objective of the present investigation is to show the feasibility of combinatorial chemistry by applying this method to phosphor syntehses. In this respect barium hexaaluminate phosphor was prepared by the split-pool combinatorial method, which enabled much more rapid search of optimum compositions of target phosphors than conventional synthetic methods. Barium hexaaluminate phosphors doped with Eu2+ exhibit blue emission while those co-doped with Mn2+ and Eu2+ exhibit green emission. Basically, the phosphor doped with 1.3 mole of Ba and 0.06~0.15 mole of Eu2+ exhibit the maximum value of emission intensity at 435${\mu}{\textrm}{m}$. Under the UV and VUV extitations, the barium hexaaluminate phosphor co-doped with Mn2+ and Eu2+ shows strong green emission.

  • PDF

Design and Combonatorial Synthesis of Selenoflavonoids and Indole Compounds for Neuroprotective Drug

  • Jeong, Jin-Hyun
    • Proceedings of the PSK Conference
    • /
    • 2003.04a
    • /
    • pp.69-71
    • /
    • 2003
  • As recent as 10 years ago, a method of developing new medicine was developed by a new compounding method moving away from an existing one. Combinatorial chemistry made it easier to combine various kinds of compounds in a very short time and with little effort from existing methods. Through combinatorial chemistry, a number of compounds were synthesized using HTS(High Throughput Screening), with many reports reaching a clinical stage in search of new candidate material. (omitted)

  • PDF

Software Product Line Test Cases Derivation Using Combinatorial Test Design (조합 시험 설계를 이용한 소프트웨어 제품라인 시험항목 생성 방법)

  • Haeun, Baek;Sungwon, Kang;Jihyun, Lee
    • Journal of KIISE:Software and Applications
    • /
    • v.41 no.7
    • /
    • pp.469-480
    • /
    • 2014
  • Software Product Line (SPL) is a software development paradigm that guarantees high productivity, reduced cost, and shorter time-to-market by systematically planning and reusing commonality and variability. In order to maximize the benefits of SPL engineering, testing should be integrated into the SPL engineering lifecycle processes that consist of domain engineering and application engineering and should be performed with as little test efforts as possible. This paper proposes a systematic software product line test cases derivation method using combinatorial test design. By applying combinatorial test design to product line test cases derivation and exploiting commonality between products at the same time, the number of generated test cases is dramatically reduced with the result that they can be effectively reused by the products of the given product line. Case studies conducted in this paper show the efficacy of our method compared with other methods that use only commonality or combinatorial design or neither of them in terms of the number of derived test cases.

Economic Dispatch Algorithm as Combinatorial Optimization Problems (조합최적화문제로 접근한 경제급전 알고리즘 개발)

  • Min, Kyung-Il;Lee, Su-Won;Choi, In-Kyu;Moon, Young-Hyun
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.8
    • /
    • pp.1485-1495
    • /
    • 2009
  • This paper presents a novel approach to economic dispatch (ED) with nonconvex fuel cost function as combinatorial optimization problems (COP) while most of the conventional researches have been developed as function optimization problems (FOP). One nonconvex fuel cost function can be divided into several convex fuel cost functions, and each convex function can be regarded as a generation type (G-type). In that case, ED with nonconvex fuel cost function can be considered as COP finding the best case among all feasible combinations of G-types. In this paper, a genetic algorithm is applied to solve the COP, and the ${\lambda}-P$ function method is used to calculate ED for the fitness function of GA. The ${\lambda}-P$ function method is reviewed briefly and the GA procedure for COP is explained in detail. This paper deals with two kinds of ED problems, namely ED with multiple fuel units (EDMF) and ED with prohibited operating zones (EDPOZ). The proposed method is tested for all the ED problems, and the test results show an improvement in solution cost compared to the results obtained from conventional algorithms.