• 약학회지
• /
• 제38권4호
• /
• pp.366-371
• /
• 1994

To improve the identification power of TLC/HPTLC the in situ reflectance spectra obtained directly from plates with commercial scanner are used. The spectrum normalization should be carried out prior to comparing and searching the spectra from library for the identification of compounds. Because the reflectance does not obey the Lambert-Beer's law, there arise some problems in normalization. These problems could be solved to some extent by normalizing the spectra with regression methods. The spectra are manipulated with the regression function of a curve obtained from the correlation plot. When the parabola was used as the manipulating function, the spectra were identified with the accuracy of 97% and this result was better than that of conventionally used the point and area normalization method.

• Journal of applied mathematics & informatics
• /
• 제24권1_2호
• /
• pp.325-331
• /
• 2007

To the unconstrained programme of non-convex function, this article give a modified BFGS algorithm associated with the general line search model. The idea of the algorithm is to modify the approximate Hessian matrix for obtaining the descent direction and guaranteeing the efficacious of the new quasi-Newton iteration equation $B_{k+1}s_k=y^*_k,\;where\;y^*_k$ is the sum of $y_k\;and\;A_ks_k,\;and\;A_k$ is some matrix. The global convergence properties of the algorithm associating with the general form of line search is proved.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2000년도 추계학술대회논문집A
• /
• pp.671-675
• /
• 2000

In this study, an FRF-based structural damage identification method (SDIM) is proposed for plate structures. The present SDIM is derived from the partial differential equation of motion of the damaged plate, in which damage is characterized by damage distribution function. Various factors that might affect the accuracy of the damage identification are investigated. They include the number of modal data used in the analysis and the damage-induced modal coupling. In the present SDIM, an efficient iterative damage self-search method is introduced. The iterative damage search method efficiently reduces the size of problem by searching out and then by removing all damage-free zones at each iteration of damage identification analysis. The feasibility of the present SDIM is studied by some numerically simulated tests.

• 한국전자거래학회지
• /
• 제5권2호
• /
• pp.49-60
• /
• 2000

A major topic in the field of network and telecommunications is doing business on the Word Wide Web(WWW), which is called Electronic Commerce(EC). Another major topic is blending Artificial Intelligent techniques with the WWW. To provide customer with the information of goods in suit with a customer liking, we propose multi agent system which is consist of customer agent and search agent etc. Also we use case-based reasoning for customer liking searching the information of goods and training through the reuse. This reuse make efficient management of information and a process of operation. In the relation between customer and goods, if there are some goods which is not search from case-base reasoning, we calculate satisfaction function for customer purchase goods. And to provide customer with the information of goods in the first of satisfaction function, This EC system can always provide the information of goods which is satisfied to customer.

• 산업경영시스템학회지
• /
• 제18권36호
• /
• pp.143-152
• /
• 1995

This paper determines the allocation of computers and data files to minimize the sum of processing and communication costs which occur in processing jobs at each node. The problem of optimally configuring a distributed computer system belongs to the class of NP-Complete problems and the object function of this paper is nonlinear function and is hard to solve. This paper seeks the solution of distributed processing system by Tabu Search. Firstly, it presents the method of generating the starting solution proper to the distributed processing system. Secondly, it develops the method of searching neighborhood solutions. Finally, it determines the Tabu restriction appropriate to the distributed processing system. According to the experimental results, this algorithm solves a sized problems in reasonable time and is effective in the convergence of the solution. The algorithm developed in this paper is also applicable to the general allocation problems of the distributed processing system.

• Korean Journal of Acupuncture
• /
• 제27권3호
• /
• pp.119-127
• /
• 2010

Objectives : The aim of the study is to analyze various studies subjected to sachonghyeol (SCH; Four command points) including ST36, BL40, LU7, LI4 in Korean literature. Methods : To analyze the results of SCH studies, The search was made through OASIS database. The search terms used were "ST36 OR BL40 OR LU7 OR LI4". Of 147 papers, 2 irrelevant papers were excluded and finally 145 papers were analyzed. Results : Thirty two studies were associated with pain control in various conditions using SCH. The pain control study of SCH covered 22 % of total studies. The next study topic was digestive function of SCH. Conclusion : To expand the clinical usage of SCH, the studies based on regulating function of SCH on ascending and descending ki, and coming in and out of ki are required to be performed in the future.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2001년도 하계학술대회 논문집 D
• /
• pp.2405-2407
• /
• 2001

In this paper, we apply and evolutionary computation(EC), probabilistic optimization algorithm, to active contour. A number of problems exist associated with such as algorithm initialization, existence of local minima, non-convex search space, and the selection of model parameters in conventional models. We propose an adequate fitness function for these problems. The determination of fitness function adequate to active contour using EC is important in search capability. As a result of applying the proposed method to non-convex object shape, we improve the unstability and contraction phenomena, in nature, of snake generated in deformable contour optimization.

• Journal of Electrical Engineering and Technology
• /
• 제12권2호
• /
• pp.911-917
• /
• 2017

There are generally three folds when developing neural network classifiers. They are as follows: 1) discriminant function; 2) lots of parameters in the design of classifier; and 3) high dimensional training data. Along with this viewpoint, we propose space search optimized polynomial neural network classifier (PNNC) with the aid of data preprocessing technique and simultaneous tuning strategy, which is a balance optimization strategy used in the design of PNNC when running space search optimization. Unlike the conventional probabilistic neural network classifier, the proposed neural network classifier adopts two type of polynomials for developing discriminant functions. The overall optimization of PNNC is realized with the aid of so-called structure optimization and parameter optimization with the use of simultaneous tuning strategy. Space search optimization algorithm is considered as a optimize vehicle to help the implement both structure and parameter optimization in the construction of PNNC. Furthermore, principal component analysis and linear discriminate analysis are selected as the data preprocessing techniques for PNNC. Experimental results show that the proposed neural network classifier obtains better performance in comparison with some other well-known classifiers in terms of accuracy classification rate.

• 한국생산제조학회지
• /
• 제23권3호
• /
• pp.279-283
• /
• 2014

Recently, a topology algorithm based on the artificial bee colony algorithm (ABCA) has been proposed for static and dynamic topology optimization. From the results, the convergence rate of the algorithm was determined to be slightly slow. Therefore, we propose a new search method to improve the convergence rate of the algorithm using a chaotic map. We investigate the effect of the chaotic map on the convergence rate of the algorithm in static and dynamic topology optimization. The chaotic map has been applied to three cases, namely, employ bee search, onlooker bee search, and both employ bee as well as onlooker bee search steps. It is verified that the case in which the logistic function of the chaotic map is applied to both employ bee as well as onlooker bee search steps shows the best dynamic topology optimization, improved by 5.89% compared to ABCA. Therefore, it is expected that the proposed algorithm can effectively be applied to dynamic topology optimization to improve the convergence rate.

• 한국통신학회논문지
• /
• 제29권7A호
• /
• pp.828-835
• /
• 2004

본 논문에서는 일반적인 비디오 압축에 사용되는 블록 움직임 예측 방법을 위한 육각형 탐색 형태를 이용한 적응형 블록 정합 탐색 알고리즘(Adaptive hexagon based search : AHBS)을 제안한다. 제한하는 알고리즘은 다이아몬드 형태를 이용한 초기 탐색 과정과 제안한 두개의 육각 형태를 이용하여 적응적으로 탐색하는 과정으로 이루어져 있으며, 육각형 탐색 형태의 중앙값에 블록 정합을 위한 목적 함수의 최소간이 발생할 때 그 과정을 종료하는 것으로 구성되어 있다. 또한, 탐색 과정에 있어 적용할 육각형 탐색 형태의 결정은 이전 탐색 과정에서 발생한 최소 값의 위치에 따라 이루어진다. 제안한 알고리즘의 성능측정은 전역탐색 방법을 포함 기존의 다양한 고속 탐색 방법들과 전역 탐색 방법의 결과와의 비교를 통하여 이루어졌다. 기존의 고속 탐색 방법에 비하여 본 논문에서 제안한 방법의 성능이 우수하고 그 수행 속도 또한 개선된 것을 실험 결과 알 수 있다.