• 제목/요약/키워드: combinatorial

검색결과 695건 처리시간 0.028초

Screening for bioactive compounds from natural products by ELISA assay

  • Iwanami, Naoko
    • 한국응용약물학회:학술대회논문집
    • /
    • 한국응용약물학회 1998년도 Proceedings of UNESCO-internetwork Cooperative Regional Seminar and Workshop on Bioassay Guided Isolation of Bioactive Substances from Natural Products and Microbial Products
    • /
    • pp.34-37
    • /
    • 1998
  • Combinatorial chemistry is one of the most interested topics in the area of drug discovery. One of the most important points is how to find a lead compound that gives the seed structure for designing of a combinatorial library. Natural products is suitable for searching a new bioactive compound with new structure. We have carried out systematic screening works to find natural products possessing the effects on inter-and intra-cellular signaling. Two hundreds extracts of medical plants and two thousands microbial culture broth samples have been tested for the induction and inhibition of IL-2 or IL-6 production (Fig. 1). ELISA is an efficient method for screenings from such a large number of samples. Now, we apply this method to search prion- binding agents.

  • PDF

퍼지 조립라인밸런싱 문제 해결을 위한 주노드법에 기초한 휴리스틱 절차 개발 (The development of critical node method based heuristic procedure for Solving fuzzy assembly-line balancing problem)

  • 이상완;박병주
    • 산업경영시스템학회지
    • /
    • 제22권51호
    • /
    • pp.189-197
    • /
    • 1999
  • Assembly line balancing problem is known as one of difficult combinatorial optimization problems. This problem has been solved with linear programming, dynamic programming approaches. but unfortunately these approaches do not lead to efficient algorithms. Recently, genetic algorithm has been recognized as an efficient procedure for solving hard combinatorial optimization problems, but has a defect that requires long-run time and computational complexties to find the solution. For this reason, we adapt a new method called the Critical Node Method that is intuitive, easy to understand, simple for implementation. Fuzzy set theory is frequently used to represent uncertainty of information. In this paper, to treat the data of real world problems we use a fuzzy number to represent the duration and Critical Node Method based heuristic procedure is developed for solving fuzzy assembly line balancing problem.

  • PDF

신경회로망을 이용한 직사각형의 최적배치에 관한 연구 (A Study on Optimal Layout of Two-Dimensional Rectangular Shapes Using Neural Network)

  • 한국찬;나석주
    • 대한기계학회논문집
    • /
    • 제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.

단일 추가제약을 갖는 조합최적화문제를 위한 실용적 완화해법의 계산시간 분석 (A complexity analysis of a "pragmatic" relaxation method for the combinatorial optimization with a side constraint)

  • 홍성필
    • 한국경영과학회지
    • /
    • 제25권1호
    • /
    • pp.27-36
    • /
    • 2000
  • We perform a computational complexity analysis of a heuristic algotithm proposed in the literature for the combinatorial optimization problems extended with a single side-constraint. This algorithm, although such a view was not given in the original work, is a disguised version of an optimal Lagrangian dual solution technique. It also has been observed to be a very efficient heuristic producing near-optimal solutions for the primal problems in some experiments. Especially, the number of iterations grows sublinearly in terms of the network node size so that the heuristic seems to be particularly suitable for the applicatons such as routing with semi-real time requirements. The goal of this paper is to establish a polynomal worst-case complexity of the algorithm. In particular, the obtained complexity bound suports the sublinear growth of the required iterations.

  • PDF

Satellite Customer Assignment: A Comparative Study of Genetic Algorithm and Ant Colony Optimization

  • Kim, Sung-Soo;Kim, Hyoung-Joong;Mani, V.
    • Journal of Ubiquitous Convergence Technology
    • /
    • 제2권1호
    • /
    • pp.40-50
    • /
    • 2008
  • The problem of assigning customers to satellite channels is a difficult combinatorial optimization problem and is NP-complete. For this combinatorial optimization problem, standard optimization methods take a large computation time and so genetic algorithms (GA) and ant colony optimization (ACO) can be used to obtain the best and/or optimal assignment of customers to satellite channels. In this paper, we present a comparative study of GA and ACO to this problem. Various issues related to genetic algorithms approach to this problem, such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. We also discuss an ACO for this problem. In ACO methodology, three strategies, ACO with only ranking, ACO with only max-min ant system (MMAS), and ACO with both ranking and MMAS, are considered. A comparison of these two approaches (i,e., GA and ACO) with the standard optimization method is presented to show the advantages of these approaches in terms of computation time.

  • PDF

사물인터넷환경에서 조합론을 이용한 무선센서 네트워크 스케줄링 기법에 대한 연구 (A Study of Scheduling Method for Wireless Sensor Network using the Combinatorial Theory under IoT Environment)

  • 송특섭
    • 한국정보통신학회:학술대회논문집
    • /
    • 한국정보통신학회 2015년도 추계학술대회
    • /
    • pp.165-166
    • /
    • 2015
  • 모든 사물을 인터넷과 연결하기 위한 사물인터넷환경이 새로운 산업분야로 자리 잡고 있다. 사물인터넷에서 기기간 통신을 하기 위해서 무선센서가 중요한 역할을 하고 있다. 무선센서의 경우 초소형의 디바이스로 구성되고 있어 배터리의 성능을 향상시키기 위한 많은 연구를 하고 있다. 본 연구에서는 조합론의 블록디자인 방법을 주기를 갖는 무선 센서네트워크의 스케줄링 방법에 적용하기 위한 방법을 연구한다.

  • PDF

Dynamic Collaborative Cloud Service Platform: Opportunities and Challenges

  • Yoon, Chang-Woo;Hassan, Mohammad Mehedi;Lee, Hyun-Woo;Ryu, Won;Huh, Eui-Nam
    • ETRI Journal
    • /
    • 제32권4호
    • /
    • pp.634-637
    • /
    • 2010
  • This letter presents a model for a dynamic collaboration (DC) platform among cloud providers (CPs) that prevents adverse business impacts, cloud vendor lock-in and violation of service level agreements with consumers, and also offers collaborative cloud services to consumers. We consider two major challenges. The first challenge is to find an appropriate market model in order to enable the DC platform. The second is to select suitable collaborative partners to provide services. We propose a novel combinatorial auction-based cloud market model that enables a DC platform among CPs. We also propose a new promising multi-objective optimization model to quantitatively evaluate the partners. Simulation experiments were conducted to verify both of the proposed models.

Substrate Temperature Dependence of Microcrystalline Silicon Thin Films by Combinatorial CVD Deposition

  • Kim, Yeonwon
    • 한국표면공학회지
    • /
    • 제48권3호
    • /
    • pp.126-130
    • /
    • 2015
  • A high-pressure depletion method using plasma chemical vapor deposition (CVD) is often used to deposit hydrogenated microcrystalline silicon (${\mu}c-Si:H$) films of a low defect density at a high deposition rate. To understand proper deposition conditions of ${\mu}c-Si:H$ films for a high-pressure depletion method, Si films were deposited in a combinatorial way using a multi-hollow discharge plasma CVD method. In this paper the substrate temperature dependence of ${\mu}c-Si:H$ film properties are demonstrated. The higher substrate temperature brings about the higher deposition rate, and the process window of device quality ${\mu}c-Si:H$ films becomes wider until $200^{\circ}C$. This is attributed to competitive reactions between Si etching by H atoms and Si deposition.

준정부호 스펙트럼의 군집화 (Semidefinite Spectral Clustering)

  • 김재환;최승진
    • 한국정보과학회:학술대회논문집
    • /
    • 한국정보과학회 2005년도 한국컴퓨터종합학술대회 논문집 Vol.32 No.1 (A)
    • /
    • pp.892-894
    • /
    • 2005
  • Graph partitioning provides an important tool for data clustering, but is an NP-hard combinatorial optimization problem. Spectral clustering where the clustering is performed by the eigen-decomposition of an affinity matrix [1,2]. This is a popular way of solving the graph partitioning problem. On the other hand, semidefinite relaxation, is an alternative way of relaxing combinatorial optimization. issuing to a convex optimization[4]. In this paper we present a semidefinite programming (SDP) approach to graph equi-partitioning for clustering and then we use eigen-decomposition to obtain an optimal partition set. Therefore, the method is referred to as semidefinite spectral clustering (SSC). Numerical experiments with several artificial and real data sets, demonstrate the useful behavior of our SSC. compared to existing spectral clustering methods.

  • PDF

High-throughput Preparation and Characterization of Powder and Thin-film Library for Electrode Materials

  • Fujimoto, Kenjiro;Onoda, Kazuhiro;Ito, Shigeru
    • 한국분말야금학회:학술대회논문집
    • /
    • 한국분말야금학회 2006년도 Extended Abstracts of 2006 POWDER METALLURGY World Congress Part 1
    • /
    • pp.254-255
    • /
    • 2006
  • Powder library of pseudo four components Li-Ni-Co-Ti compounds were prepared for exploring the composition region with the single phase of the layer-type structure by using combinatorial high-throuput preparation system "M-ist Combi" based on electrostatic spray deposition method. The new layer-type compounds were found wider composition region than the previous report. This process is promising way to find multi component functional materials.

  • PDF