• 제목/요약/키워드: search method

검색결과 5,564건 처리시간 0.029초

병렬 타부 탐색법을 이용한 대규모의 발전기 기동정지계획 (Large Scale Unit Commitment Using Parallel Tabu Search)

  • 김형수;문경준;조덕환;황기현;박준호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제50권11호
    • /
    • pp.528-536
    • /
    • 2001
  • This paper proposes a method of solving a unit commitment problem using parallel tabu search(PTS) approach. Tabu search is a heuristic optimization method that has the tabu list to control the search process. To improve the searching ability of a global solution, we used a method of exchanging solutions among connected processors as a diversification strategy, and to reduce the computation time, a new evaluating method was proposed which evaluates only a changed par. To show the usefulness of the proposed method, we simulated for 10 units system and 110 units system. Numerical results show improvements in the generation costs and the computation time compared with other conventional methods.

  • PDF

DS-SS시스템에서 탐색과정과 확인과정을 통합하는 (ISV) 고속부호 포착 시스템 (A fast code acquisition using integrated search and verification (ISV) scheme in the DS-SS system)

  • 오성근;임종혁;성상헌;최태영
    • 전자공학회논문지A
    • /
    • 제33A권5호
    • /
    • pp.24-30
    • /
    • 1996
  • In this paper, we propose a fast code acquisition method that can reduce drastically the mean acquisition time of the direct sequence spread spectrum (DS-SS) system by using and integrated search and verification (ISV) scheme. The proposed method performs simultaneously the search and verification processes at every search cell, through storing sufficiently long signal samples enough to perform the verification process form the previously received samples. We analyze and acquisition performance in the case of Gaussian channel to evaluate theacquisition perfomrance of the proposed method. From the simple numericl analysis result, we have shown that the acquisition performance of the proposed method is better than that of the conventional serial search method, and the performance improvement becomes more prominent as the channel environment becomes degraded.

  • PDF

중요도 트리 구조를 이용한 MPEG-4 ER-BSAC 디코더의 복잡도 개선 (Complexity Reduction of MPEG-4 ER-BSAC Decoder Using Significance Tree Structure)

  • 안영욱;정규혁;김규진;이인성
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2006년도 하계종합학술대회
    • /
    • pp.355-356
    • /
    • 2006
  • MPEG-4 ER-BSAC decoder employes a full search method for maximum significance search and arithmetic decoding position search in spectral data decoding procedure. Then the search procedure have the most complexity. This paper proposes the new search method, the maximum significance tree structure, for the optimized implementation of BSAC decoder.

  • PDF

웹 검색 개인화를 위한 개념네트워크 프로파일 기반 순위 재조정 기법 (New Re-ranking Technique based on Concept-Network Profiles for Personalized Web Search)

  • 김한준;노준호;장재영
    • 한국인터넷방송통신학회논문지
    • /
    • 제12권2호
    • /
    • pp.69-76
    • /
    • 2012
  • 본 논문은 웹 검색 개인화를 실현하기 위해 개념네트워크 구조의 사용자 프로파일에 기반한 새로운 형태의 순위 재조정 기법을 제안한다. 기본적으로 개인화 검색은 개인 사용자의 검색 성향을 담고 있는 사용자 프로파일을 기반으로 이루어지며, 이를 활용하여 초기에 주어진 검색 질의어를 확장하거나 검색결과의 순위를 재조정하게 된다. 제안 기법은 순위 재조정 기법을 주축으로 질의어 확장 기법을 융합한 형태를 취한다. 기본 아이디어는 사용자 프로 파일에 의해 추천된 확장 질의어로부터 도출된 문서집합들에 공통적으로 출현하는 문서들의 중첩도를 평가하여, 그 결과값을 순위 재조정에 활용하는 것이다. 성향이 다른 다수의 실험자들이 검색 질의어 유형을 구분하여 실험을 수행함으로써 제안기법이 기존 기법에 비해 우수함을 보인다.

고도를 달리하는 드론들의 협력에 의한 확률기반 목표물 탐색 방법 (Probability-Based Target Search Method by Collaboration of Drones with Different Altitudes)

  • 하일규
    • 한국정보통신학회논문지
    • /
    • 제21권12호
    • /
    • pp.2371-2379
    • /
    • 2017
  • 넓은 탐색영역에서 활동하는 드론에서 신속한 처치를 요하는 응급환자의 탐색, 신속한 경보와 대응을 요하는 자연재해의 감시와 같은 응용 분야에서 목표물 파악의 시간(time), 즉 신속성의 문제는 매우 중요한 문제가 된다. 드론의 실제 운영에 있어서 목표물을 파악하는 시간은 탐색 영역을 효율적으로 탐색하기 위한 탐색 알고리즘 및 드론 간의 협업과 매우 연관성이 깊다. 따라서 본 연구에서는 드론을 이용한 목표물 탐색에 있어서 신속성의 문제를 해결하기 위하여, 고도를 달리하는 드론들의 협력에 의한 확률기반 목표물 탐색 방법을 제안한다. 특히 제안한 방법은 고(高)고도 드론이 우선 탐색을 실시하고, 탐색 결과를 저(低)고도 드론에 전달하여 보다 정밀한 탐색을 함으로써 탐색 시간을 줄이고 목표물 발견의 확률을 높이는 방법이다. 시뮬레이션을 통하여 제안된 방법의 성능을 분석한다.

A NONLINEAR CONJUGATE GRADIENT METHOD AND ITS GLOBAL CONVERGENCE ANALYSIS

  • CHU, AJIE;SU, YIXIAO;DU, SHOUQIANG
    • Journal of applied mathematics & informatics
    • /
    • 제34권1_2호
    • /
    • pp.157-165
    • /
    • 2016
  • In this paper, we develop a new hybridization conjugate gradient method for solving the unconstrained optimization problem. Under mild assumptions, we get the sufficient descent property of the given method. The global convergence of the given method is also presented under the Wolfe-type line search and the general Wolfe line search. The numerical results show that the method is also efficient.

Method of Improving Personal Name Search in Academic Information Service

  • Han, Heejun;Lee, Seok-Hyoung
    • International Journal of Knowledge Content Development & Technology
    • /
    • 제2권2호
    • /
    • pp.17-29
    • /
    • 2012
  • All academic information on the web or elsewhere has its creator, that is, a subject who has created the information. The subject can be an individual, a group, or an institution, and can be a nation depending on the nature of the relevant information. Most information is composed of a title, an author, and contents. An essay which is under the academic information category has metadata including a title, an author, keyword, abstract, data about publication, place of publication, ISSN, and the like. A patent has metadata including the title, an applicant, an inventor, an attorney, IPC, number of application, and claims of the invention. Most web-based academic information services enable users to search the information by processing the meta-information. An important element is to search information by using the author field which corresponds to a personal name. This study suggests a method of efficient indexing and using the adjacent operation result ranking algorithm to which phrase search-based boosting elements are applied, and thus improving the accuracy of the search results of personal names. It also describes a method for providing the results of searching co-authors and related researchers in searching personal names. This method can be effectively applied to providing accurate and additional search results in the academic information services.

자동화된 변전소의 이벤트 발생시 준최적 탐색법에 기반한 모선 재구성 전략의 개발 (Bus Reconfiguration Strategy Based on Local Minimum Tree Search for the Event Processing of Automated Distribution Substation)

  • 고윤석
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제53권10호
    • /
    • pp.565-572
    • /
    • 2004
  • This paper proposes an expert system which can enhance the accuracy of real-time bus reconfiguration strategy by adopting local minimum tree search method and minimize the spreading effect of the fault by considering totally the operating condition when a main transformer fault occurs in the automated substation. The local minimum tree search method to expand the best-first search method. This method has an advantage which can improve the performance of solution within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. And, second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules for the obtained switching candidate set. Also, this paper studies the generalized distribution substation modelling using graph theory and a substation database is designed based on the study result. The inference engine of the expert system and the substation database is implemented in MFC function of Visual C++. Finally, the performance and effectiveness of the proposed expert system is verified by comparing the best-first search solution and local minimum tree search solution based on diversity event simulations for typical distribution substation.

Subset selection in multiple linear regression: An improved Tabu search

  • Bae, Jaegug;Kim, Jung-Tae;Kim, Jae-Hwan
    • Journal of Advanced Marine Engineering and Technology
    • /
    • 제40권2호
    • /
    • pp.138-145
    • /
    • 2016
  • This paper proposes an improved tabu search method for subset selection in multiple linear regression models. Variable selection is a vital combinatorial optimization problem in multivariate statistics. The selection of the optimal subset of variables is necessary in order to reliably construct a multiple linear regression model. Its applications widely range from machine learning, timeseries prediction, and multi-class classification to noise detection. Since this problem has NP-complete nature, it becomes more difficult to find the optimal solution as the number of variables increases. Two typical metaheuristic methods have been developed to tackle the problem: the tabu search algorithm and hybrid genetic and simulated annealing algorithm. However, these two methods have shortcomings. The tabu search method requires a large amount of computing time, and the hybrid algorithm produces a less accurate solution. To overcome the shortcomings of these methods, we propose an improved tabu search algorithm to reduce moves of the neighborhood and to adopt an effective move search strategy. To evaluate the performance of the proposed method, comparative studies are performed on small literature data sets and on large simulation data sets. Computational results show that the proposed method outperforms two metaheuristic methods in terms of the computing time and solution quality.

교대형 유전자 알고리즘을 이용한 보강설계의 최적화 (Application of Genetic Algorithm-Based Relay Search Method for Structure Design - Strengthening Problems)

  • 정승인;김남희;장승필
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2001년도 봄 학술발표회 논문집
    • /
    • pp.223-232
    • /
    • 2001
  • This paper describes Genetic Algorithm-Based Relay Search Method, RS-GA, which is developed in this study to search the multiple design variables in the design space. The RS-GA based on Simple-GA consists of some functions to search many variables from some wide variable space. It repeats a Simple-GA, that is the convergence process of the Simple-GA, which makes many time reiteration itself. From the results of the numerical studies, it was actually found that RS-GA can search all peak-variable from the 2D functions including 5 peaks. Finally, RS-GA applied for design-strengthening problems in composite plate girder bridges using the external prestressing technique is also verified.

  • PDF