• 공업화학
• /
• 제21권4호
• /
• pp.357-365
• /
• 2010

신약개발 과정에서 선도물질을 도출하기 위한 유용한 방법으로 적용되어온 조합합성은 최근 분석과 검사 기술의 빠른 발전과 더불어 다양한 분야에서 응용되고 있다. 특히 분자구조와 특성 간의 상관관계를 예측하기 어려운 신물질 개발 분야에서 다양한 후보 물질들을 빠른 시간 내에 확보하기 위한 효율적인 전략으로 주목받고 있다. 그 동안 조합화학 및 조합합성 기법에 관하여 많은 수의 보고서와 총설들이 발표되었다. 본 총설에서는 조합합성을 이용한 신소재 개발 동향을 간략히 소개하고, 이를 응용한 유기발광재료 개발 사례들을 논의하고자 한다.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2008년도 하계학술대회 논문집 Vol.9
• /
• pp.28-28
• /
• 2008

We have demonstrated the combinatorial synthesis of a variety of transparent conducting oxides using a combinatorial sputter system. The effects of a wide range of Nb or Zn doping rate on the optical and electrical properties of Indium-tin oxides (ITO) films were investigated. The Nb or Zn doped ITO films were fabricated on glass substrates, using combinatorial sputtering system which yields a linear composition spread of Nb or Zn concentration in ITO films in a controlled manner by co-sputtering two targets of ITO and $Nb_2O_5$ or ITO and ZnO. We have examined the work-function, resistivity, and optical properties of the Nb or Zn-doped ITO films. Furthermore, the effects of Hz plasma treatment on the physical properties of Ga or Zn doped ITO films synthesized by combinatorial sputter system were investigated.

• 한국윤활학회:학술대회논문집
• /
• 한국윤활학회 2001년도 제34회 추계학술대회 개최
• /
• 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.

• 호남수학학술지
• /
• 제38권2호
• /
• pp.367-373
• /
• 2016

Adiga and Anitha [1] investigated the Ramanujan's continued fraction (18) to present many interesting identities. Motivated by this work, by using known formulas, we also investigate the Ramanujan's continued fraction (18) to give certain relationships between the Ramanujan's continued fraction and the combinatorial partition identities given by Andrews et al. [3].

• 호남수학학술지
• /
• 제39권3호
• /
• pp.379-399
• /
• 2017

The objective of this research article is to establish two relationships between q-product identities, theta function identities and combinatorial partition identities, using elementary results.

• Journal of applied mathematics & informatics
• /
• 제26권1_2호
• /
• pp.283-290
• /
• 2008

This paper is motivated by the problem of fitting a group of cuboids into a simplified rotating vessel of the artificial satellite. Here we introduce a combinatorial optimization model which reduces the three-dimensional layout problem with behavioral constraints to a finite enumeration scheme. Moreover, a global combinatorial optimization algorithm is described in detail, which is an improved graph-theoretic heuristic.

• Management Science and Financial Engineering
• /
• 제3권1호
• /
• pp.75-88
• /
• 1997

Tabu search (TS) has been successfully applied for solving many complex combinatorial optimization problems in the areas of operations research and production control. However, TS is for single-objective problems in its present form. In this article, a TS-based heuristic is developed to determine Pareto-efficient solutions to a multi-objective combinatorial optimization problem. The developed algorithm is then applied to the discrete optimal design problem in statistics to demonstrate its usefulness.

• 대한수학회논문집
• /
• 제11권3호
• /
• pp.575-584
• /
• 1996

We investigate how the code automorphism groups can be used to study such combinatorial objects as codes, finite projective planes and Hadamard matrices. For this purpose, we write down a computer program for computing code automorphisms in PASCAL language. Then we study the combinatorial properties using those code automorphism group algorithms and the relationship between combinatorial objects and codes.

• 호남수학학술지
• /
• 제39권2호
• /
• pp.267-273
• /
• 2017

The objective of this note is to establish three results between q-products and combinatorial partition identities in a elementary way. Several closely related q-product identities such as (for example)continued fraction identities and Jacobis triple product identities are also considered.

• Management Science and Financial Engineering
• /
• 제13권1호
• /
• pp.115-119
• /
• 2007

In [1], robust combinatorial optimization problem is introduced, where a positive integer $\Gamma$ is used to control the degree of robustness. The proposed algorithm needs solutions of n+1 nominal problems. In this paper, we show that the number of problems needed reduces to $n+1-\Gamma$.