• Title/Summary/Keyword: Search Function

Search Result 1,620, Processing Time 0.033 seconds

An Improved Harmony Search Algorithm and Its Application in Function Optimization

  • Tian, Zhongda;Zhang, Chao
    • Journal of Information Processing Systems
    • /
    • v.14 no.5
    • /
    • pp.1237-1253
    • /
    • 2018
  • Harmony search algorithm is an emerging meta-heuristic optimization algorithm, which is inspired by the music improvisation process and can solve different optimization problems. In order to further improve the performance of the algorithm, this paper proposes an improved harmony search algorithm. Key parameters including harmonic memory consideration (HMCR), pitch adjustment rate (PAR), and bandwidth (BW) are optimized as the number of iterations increases. Meanwhile, referring to the genetic algorithm, an improved method to generate a new crossover solutions rather than the traditional mechanism of improvisation. Four complex function optimization and pressure vessel optimization problems were simulated using the optimization algorithm of standard harmony search algorithm, improved harmony search algorithm and exploratory harmony search algorithm. The simulation results show that the algorithm improves the ability to find global search and evolutionary speed. Optimization effect simulation results are satisfactory.

Initialization of Cost Function for ML-Based DOA Estimation (ML 알고리즘 기반의 도래각 추정을 위한 비용 함수의 초기화 방법 비교)

  • Jo, Sang-Ho;Lee, Joon-Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.1C
    • /
    • pp.110-116
    • /
    • 2008
  • Maximum likelihood(ML) diretion-of-arrival(DOA) estimation is essentially optimization of multivariable nonlinear cost function. Since the final estimate is highly dependent on the initial estimate, an initialization is critical in nonlinear optimization. We propose a multi-dimensional(M-D) search scheme of uniform exhaustive search and improved exhaustive search. Improved exhaustive search is superior to uniform exhaustive search in terms of the computational complexity and the accuracy of the estimates.

The Optimization of Sizing and Topology Design for Drilling Machine by Genetic Algorithms (유전자 알고리즘에 의한 드릴싱 머신의 설계 최적화 연구)

  • Baek, Woon-Tae;Seong, Hwal-Gyeong
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.12
    • /
    • pp.24-29
    • /
    • 1997
  • Recently, Genetic Algorithm(GA), which is a stochastic direct search strategy that mimics the process of genetic evolution, is widely adapted into a search procedure for structural optimization. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA is very simple in their algorithms and there is no need of continuity of functions(or functionals) any more in GA. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher porbability of convergence to global optimum compared to traditional techniques which take one-point search method. The methods consist of three genetics opera- tions named selection, crossover and mutation. In this study, a method of finding the omtimum size and topology of drilling machine is proposed by using the GA, For rapid converge to optimum, elitist survival model,roulette wheel selection with limited candidates, and multi-point shuffle cross-over method are adapted. And pseudo object function, which is the combined form of object function and penalty function, is used to include constraints into fitness function. GA shows good results of weight reducing effect and convergency in optimal design of drilling machine.

  • PDF

Design and Implementation of Intelligent Web Search Agent using Case Based Reasoning (사례기반 추론을 이용한 지능형 웹 검색 에이전트의 설계 및 구현)

  • 하창승;류길수
    • Journal of the Korea Society of Computer and Information
    • /
    • v.8 no.1
    • /
    • pp.20-29
    • /
    • 2003
  • According as quantity of information is augmented rapidly in World Wide Web, users are investing more times finding correct information to on. Search function that a search agent is personalized according to user's preference degree or search objective to solve these problem should be offered. Therefore, a search agent accumulates experienced knowledge connected with user's past search in this research. When new query was given, search agent offered learning function of intelligence that decides category group through estimation method of similarity using this knowledge. So this paper showed that case based search can bring superior result in the correctness rate than other search method.

  • PDF

Embeded-type Search Function with Feedback for Smartphone Applications (스마트폰 애플리케이션을 위한 임베디드형 피드백 지원 검색체)

  • Kang, Moonjoong;Hwang, Mintae
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.5
    • /
    • pp.974-983
    • /
    • 2017
  • In this paper, we have discussed the search function that can be embedded and used on Android-based applications. We used BM25 to suppress insignificant and too frequent words such as postpositions, Pivoted Length Normalization technique used to resolve the search priority problem related to each item's length, and Rocchio's method to pull items inferred to be related to the query closer to the query vector on Vector Space Model to support implicit feedback function. The index operation is divided into two methods; simple index to support offline operation and complex index for online operation. The implementation uses query inference function to guess user's future input by collating given present input with indexed data and with it the function is able to handle and correct user's error. Thus the implementation could be easily adopted into smartphone applications to improve their search functions.

A TWO-DIMENSIONAL MAXIMUM SEARCH MEHHOD BY A GLOBAL PRIORITY STRATEGY WITH LOCAL PEAK ESTIMATION:ITS OPTIMAL SWITCHING CRITERION

  • Wakasugi, Yoshizumi;Yasuda, Genichi;Shin, Seiichi
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1995.10a
    • /
    • pp.488-491
    • /
    • 1995
  • The paper presents a new global maximum search method for multimodal unknown functions of two variables. The search method is composed of two stages and sequentially samples the candidate point in a subdomain selected using a priority function in each stage. The search domain is auto-similarly divided into triangular subdomains, or cells, during the search process. A measure of accuracy of local maximum search is introduced to check if a local search has converged to a specified accuracy or the maximum of a local peak cannot be the global maximum. A criterion for switching from the first to the second stage, is proposed using a ratio of the observed peak width to the largest cell in the domain. By numerical simulations, the required number of trials is evaluated for some function models with different peak parameters, and the switching criterion is optimally determined. The results show that the proposed method obtains global maximum points with certainty and saves largely computation time even for functions with extremely steep peaks.

  • PDF

Two-Phase Distributed Evolutionary algorithm with Inherited Age Concept

  • Kang, Young-Hoon;Z. Zenn Bien
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.101.4-101
    • /
    • 2001
  • Evolutionary algorithm has been receiving a remarkable attention due to the model-free and population-based parallel search attributes and much successful results are coming out. However, there are some problems in most of the evolutionary algorithms. The critical one is that it takes much time or large generations to search the global optimum in case of the objective function with multimodality. Another problem is that it usually cannot search all the local optima because it pays great attention to the search of the global optimum. In addition, if the objective function has several global optima, it may be very difficult to search all the global optima due to the global characteristics of the selection methods. To cope with these problems, at first we propose a preprocessing process, grid-filtering algorithm(GFA), and propose a new distributed evolutionary ...

  • PDF

FUNDAMENTAL PERFORMANCE OF IMAGE CODING SCHEMES BASED ON MULTIPULSE MODEL

  • Kashiwagi, Takashi;Kobayashi, Daisuke;Koda, Hiromu
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2009.01a
    • /
    • pp.825-829
    • /
    • 2009
  • In this paper, we examine the fundamental performance of image coding schemes based on multipulse model. First, we introduce several kinds of pulse search methods (i.e., correlation method, pulse overlap search method and pulse amplitude optimization method) for the model. These pulse search methods are derived from auto-correlation function of impulse responses and cross-correlation function between host signals and impulse responses. Next, we explain the basic procedure of multipulse image coding scheme, which uses the above pulse search methods in order to encode the high frequency component of an original image. Finally, by means of computer simulation for some test images, we examine the PSNR(Peak Signal-to-Noise Ratio) and computational complexity of these methods.

  • PDF

Mathematical modeling and performance analysis for the double-dwell serial search algorithm with a search window (탐색 창을 갖는 이중드웰 직렬 동기획득 방식에 대한 수학적 모델링 및 성능분석)

  • Lee, Seong-Joo;Kim, Jae-Seok
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.9
    • /
    • pp.9-17
    • /
    • 1999
  • In this paper, we present a mathematical modeling and perform a performance analysis of double-dwell serial search algorithm, which has a search window concept, for pilot channel in DS-CDMA(Direct Sequence Code Division Multiple Access). We derive a code detection function, a false alarm function, a code miss function, and a mean code acquisition time for the performance analysis. We calculate the mean code acquisition time of the mathematical model in IS-95 forward link and compare it with that of the conventional search methods. The performance of the code acquisition system is also evaluated to investigate the effect of dwell times and search window size. The JTC channel model, which is a PCS channel model in North America, is used for the analysis. The numerical result shows that the mean code acquisition time of the double-dwell serial search algorithm with a search window is reduced by about 17%~25% than those of the conventional ones.

  • PDF

The effects of virtual reality training on gait, balance, and upper extremity function in patients with stroke: A meta-analysis

  • Lee, Hyun soo;Kim, You Lim;Lee, Hae ji;Lee, Byounghee
    • Journal of Korean Physical Therapy Science
    • /
    • v.28 no.3
    • /
    • pp.11-29
    • /
    • 2021
  • Background: The purpose of this study is to investigate the effects of virtual reality on gait, balance, and upper extremity functions compared to other independent variables or no variables. Additionally, the possibility of virtual reality for stroke patients was discussed. Design: Meta-analysis. Methods: The search for this study was a search term that combined stroke, virtual reality, and training, and the electronic search was conducted through EMBASE, MEDLINE, and Cochrane Library. As a result of the search, 21 studies satisfying the selection criteria of the target study were confirmed as the final analysis target. This study consisted of 21 randomized experimental studies and 21 randomized controlled trials, and the total number of participants was 642. [Experimental group (n=314), control group (n=328); total 642]. As a result of the study, upper extremity function was assessed using a box and block test, a modified Ashworth scale, and a scale including range of motion. The balance was evaluated by the berg balance scale. Gait was a Timed Up and Go test (TUG), stride length, and gait function. Scales including a walking rate scale were evaluated. The effect size for the intervention of the analytical study was meta-analyzed with the RevMan 5.3.3 program of the Cochrane library. Results: The results of the study showed that the function of walking was statistically significant. Balance showed statistically significant results. The upper extremity function showed no statistically significant results. Conclusion: Through this rehabilitation treatment by applying virtual reality environment to the rehabilitation of stroke patients in the future can be proposed as an effective intervention method for the balance and gait function of stroke patients.