• Title/Summary/Keyword: Line search method

Search Result 259, Processing Time 0.028 seconds

Antioxidant Activity Analysis of Useful Compounds from Artemisiae Annuae Herba Using On-line Screening HPLC-ABTS+ Assay (On-line Screening HPLC-ABTS+ assay를 이용한 청호로부터 유용성분의 항산화 활성 분석)

  • Lee, Kwang Jin;Ma, Jin Yeul
    • Journal of Applied Biological Chemistry
    • /
    • v.57 no.4
    • /
    • pp.301-305
    • /
    • 2014
  • The Antioxidant activity screening identification of five kind compounds in Artemisiae annuae herba with the on-line screening high performance liquid chromatography (HPLC) $ABTS^+$ assay. The various experimental variables such as the extraction time (h) and extraction solvent composition (%) of dipping method were investigated efficiently extraction at the room temperature $25^{\circ}C$. The results, the highest yield of total extract amount (0.458 g, 15.250%) was obtained by dipping method with 100% water and extraction time to 3 h. And the on-line screening HPLC-$ABTS^+$ assay method was rapid and efficient to search for bioactivity from natural products.

Isolation and Bioactivity Analysis of Salidroside from Acer tegmentosum using On-line Screening HPLC-ABTS+ Assay (On-line Screening HPLC-ABTS+ Assay을 이용한 산청목으로부터 Salidroside의 분리 및 생물활성 분석)

  • Lee, Kwang Jin;Song, Na-Young;Ma, Jin Yeul
    • KSBB Journal
    • /
    • v.29 no.2
    • /
    • pp.124-130
    • /
    • 2014
  • Acer tegmentosum was a traditional Korean herbal medicine showing various pharmacological activities. In this work, A. tegmentosum were extracted with boiling water and then successively partitioned with dichloromethane, ethyl acetate, n-butyl alcohol (n-BuOH), and water. Salidoside, the target compound, was purified in n-BuOH phase using a chromatography method. For the analysis of salidoside, TLC and LC-MS were used as well as on-line screening $HPLC-ABTS^+$ assay with three different wavelength of 254, 280, and 320 nm. An amount of 1.34 g of salidoside were obtained in n-BuOH phase fromAcer tegmentosum was a traditional Korean herbal medicine showing various pharmacological activities. In this work, A. tegmentosum were extracted with boiling water and then successively partitioned with dichloromethane, ethyl acetate, n-butyl alcohol (n-BuOH), and water. Salidoside, the target compound, was purified in n-BuOH phase using a chromatography method. For the analysis of salidoside, TLC and LC-MS were used as well as online screening $HPLC-ABTS^+$ assay with three different wavelength of 254, 280, and 320 nm. An amount of 1.34 g of salidoside were obtained in n-BuOH phase from 3 kg of dry biomass. The on-line screening $HPLC-ABTS^+$ assay is rapid and efficient tool to search bioactivity from A. tegmentosum. 3 kg of dry biomass. The on-line screening $HPLC-ABTS^+$ assay is rapid and efficient tool to search bioactivity from A. tegmentosum.

Computational enhancement to the augmented lagrange multiplier method for the constrained nonlinear optimization problems (구속조건식이 있는 비선형 최적화 문제를 위한 ALM방법의 성능향상)

  • 김민수;김한성;최동훈
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.15 no.2
    • /
    • pp.544-556
    • /
    • 1991
  • The optimization of many engineering design problems requires a nonlinear programming algorithm that is robust and efficient. A general-purpose nonlinear optimization program IDOL (Interactive Design Optimization Library) is developed based on the Augmented Lagrange Mulitiplier (ALM) method. The ideas of selecting a good initial design point, using resonable initial values for Lagrange multipliers, constraints scaling, descent vector restarting, and dynamic stopping criterion are employed for computational enhancement to the ALM method. A descent vector is determined by using the Broydon-Fletcher-Goldfarb-Shanno (BFGS) method. For line search, the Incremental-Search method is first used to find bounds on the solution, then the bounds are reduced by the Golden Section method, and finally a cubic polynomial approximation technique is applied to locate the next design point. Seven typical test problems are solved to show IDOL efficient and robust.

Design of a line balancing algorithm for the PCB assembly line including multiple surface mounters (다수 표면실장기계를 포함하는 PCB 조립라인의 라인균형화 알고리즘 설계)

  • Kim, Jin-Cheol;Lee, Sung-Han;Kim, Dae-Won;Lee, Bum-Hee
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.3 no.4
    • /
    • pp.381-388
    • /
    • 1997
  • This paper proposes a heuristic algorithm to efficiently perform line balancing in the PCB assembly line including multiple surface mounters efficiently. Generally, the problems in line balancing are classified into two kinds. Firstly, is the determining of the minimum number of machines required for achieving the desired production rate. Secondly, is the assign of jobs to multiple machines in order to minimize the cycle time which is defined as a maximum among the working times of machines when the number of machines is fixed. In this paper, we deal with the latter. We consider a PCB assembly line, including the multiple surface mounters arranged serially as a target system. Also, the conveyor is assumed to move at a constant speed and have no buffer. Considering that the minimum number of machines required for the desired production rate is a discrete nonincreasing function which is inversely proportional to the cycle time, we propose an optimization algorithm for line balancing by using the binary search method. The algorithm is validated through computer simulation, the results of which show that their shapes coincide nearly with those of optimal line balancing efficiency graphs regardless of the number of components, the performance of surface mounters, and the structure of assembly line.

  • PDF

Sequencing in Mixed Model Assembly Lines with Setup Time : A Tabu Search Approach (준비시간이 있는 혼합모델 조립라인의 제품투입순서 결정 : Tabu Search 기법 적용)

  • 김여근;현철주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.1
    • /
    • pp.13-13
    • /
    • 1988
  • This paper considers the sequencing problem in mixed model assembly lines with hybrid workstation types and sequence-dependent setup times. Computation time is often a critical factor in choosing a method of determining the sequence. We develop a mathematical formulation of the problem to minimize the overall length of a line, and present a tabu search technique which can provide a near optimal solution in real time. The proposed technique is compared with a genetic algorithm and a branch-and-bound method. Experimental results are reported to demonstrate the efficiency of the technique.

Sweet spot search using Genetic Algorithm (Genetic Algorithm을 이용한 sweet spot search)

  • ;;;Sosuke Onodera;Yoichi Sato
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.274-277
    • /
    • 2003
  • Millimeter-wave networking is composed of narrow beam link. High directivity of the beam provides either advantage or disadvantage in comparison with conventional wide-lobe microwave communications. In such networks, it is very substantial that beam connecting point to point is fixed in right direction. It is major requirement in the beam network to keep the beam in best direction. In this paper, We propose the method to find a best suited direction of the antenna's beam using the Genetic Algorithm in point-to-point link. Proposed method presume that each station knows his direction $\theta$$_1$,$\theta$$_2$ at every step of Genetic Algorithm, then it can be expected that GA is possible to search the ideal solution. Intensity of the received signal is evaluated by the multiplication of lengths to the point which the lobe meets with the horizontal line.

  • PDF

Scheduling for a Two-Machine, M-Parallel Flow Shop to Minimize Makesan

  • Lee, Dong Hoon;Lee, Byung Gun;Joo, Cheol Min;Lee, Woon Sik
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.23 no.56
    • /
    • pp.9-18
    • /
    • 2000
  • This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

  • PDF

A Search-Result Clustering Method based on Word Clustering for Effective Browsing of the Paper Retrieval Results (논문 검색 결과의 효과적인 브라우징을 위한 단어 군집화 기반의 결과 내 군집화 기법)

  • Bae, Kyoung-Man;Hwang, Jae-Won;Ko, Young-Joong;Kim, Jong-Hoon
    • Journal of KIISE:Software and Applications
    • /
    • v.37 no.3
    • /
    • pp.214-221
    • /
    • 2010
  • The search-results clustering problem is defined as the automatic and on-line grouping of similar documents in search results returned from a search engine. In this paper, we propose a new search-results clustering algorithm specialized for a paper search service. Our system consists of two algorithmic phases: Category Hierarchy Generation System (CHGS) and Paper Clustering System (PCS). In CHGS, we first build up the category hierarchy, called the Field Thesaurus, for each research field using an existing research category hierarchy (KOSEF's research category hierarchy) and the keyword expansion of the field thesaurus by a word clustering method using the K-means algorithm. Then, in PCS, the proposed algorithm determines the category of each paper using top-down and bottom-up methods. The proposed system can be used in the application areas for retrieval services in a specialized field such as a paper search service.

MUSIC-based Diagnosis Algorithm for Identifying Broken Rotor Bar Faults in Induction Motors Using Flux Signal

  • Youn, Young-Woo;Yi, Sang-Hwa;Hwang, Don-Ha;Sun, Jong-Ho;Kang, Dong-Sik;Kim, Yong-Hwa
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.2
    • /
    • pp.288-294
    • /
    • 2013
  • The diagnosis of motor failures using an on-line method has been the aim of many researchers and studies. Several spectral analysis techniques have been developed and are used to facilitate on-line diagnosis methods in industry. This paper discusses the first application of a motor flux spectral analysis to the identification of broken rotor bar (BRB) faults in induction motors using a multiple signal classification (MUSIC) technique as an on-line diagnosis method. The proposed method measures the leakage flux in the radial direction using a radial flux sensor which is designed as a search coil and is installed between stator slots. The MUSIC technique, which requires fewer number of data samples and has a higher detection accuracy than the traditional fast Fourier transform (FFT) method, then calculates the motor load condition and extracts any abnormal signals related to motor failures in order to identify BRB faults. Experimental results clearly demonstrate that the proposed method is a promising candidate for an on-line diagnosis method to detect motor failures.

A Study of Optimization in the Queue, Finite Population (유한모집단 대열기법에 의한 최적화 연구)

  • 오충환
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.1 no.1
    • /
    • pp.37-44
    • /
    • 1978
  • The purpose of this study is to search for an efficient application method in solving delay-phenomenon problems which influence upon total production cost through case study. The method of this study is an experimental study based on cutting time data in lead cutting operations from "Lead Cutting Machine (Stripper)" and its service rate data from a large electronic products company which utilizes conveyor line system for the products "Car Stereo" The procedure of this experimental study is as follows; 1) Using loading(Man-Hour) analysis technique j,1 order to analyse and evaluate Production capacity, efficiency, operation and idle rate assembly charge, waiting and service cost -when its are controlled by stripper operator(server) 2) Establishing adequate waiting time model of finite population caused by the interference of 4 stripper machine which is drawn from mathematical statistics testing, that is, goodness of fit test in the waiting and service rate and to search for optimal solution by utilizing the above mentioned model The experimental result was that amount to 8,546,618won Per year was brought down, that is, by optimum point, it shows a decrease as compared with Present point. The major limitation of this experimental study is that the Queue in the Finite Population, so to speak. it comes from the interference of 4 stripper machine dealt with this case were limited only on the Car Stereo conveyor line. Further study of application of this application method to the areas such as material handling, personnel management marketing and transportation management is strong1y recommended.trong1y recommended.

  • PDF