• Title/Summary/Keyword: searching strategy

Search Result 260, Processing Time 0.031 seconds

A Study on a New Function Optimization Method Using Probabilistic Tabu Search Strategy (확률적 타부 탐색 전략을 이용한 새로운 함수 최적화 방법에 관한 연구)

  • Kim, Hyung-Su;Hwang, Gi-Hyun;Park, June-Ho
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.50 no.11
    • /
    • pp.532-540
    • /
    • 2001
  • In this paper, we propose a probabilistic tabu search strategy for function optimization. It is composed of two procedures, one is Basic search procedure that plays a role in local search, and the other is Restarting procedure that enables to diversify search region. In basic search procedure, we use Belief space and Near region to create neighbors. Belief space is made of high-rank neighbors to effectively restrict searching space, so it can improve searching time and local or global searching capability. When a solution is converged in a local area, Restarting procedure works to search other regions. In this time, we use Probabilistic Tabu Strategy(PTS) to adjust parameters such as a reducing rate, initial searching region etc., which makes enhance the performance of searching ability in various problems. In order to show the usefulness of the proposed method, the PTS is applied to the minimization problems such as De Jong functions, Ackley function, and Griewank functions etc., the results are compared with those of GA or EP.

  • PDF

A Critical Review of Online Search Strategy Models (온라인 탐색전략에 관한 비판적 고찰)

  • 유재옥
    • Journal of the Korean Society for information Management
    • /
    • v.12 no.1
    • /
    • pp.143-161
    • /
    • 1995
  • This paper defines online search strategy as a global approach to the resolution of online searching. Five search strategy models including Brief Search. Building Blocks Strategies. Successive Facet Strategies, Successive Fractions Approach, and Citation Pearl Growing, are critically reviewed. Applicability and adaptability of each strategy are examined in the real concrete online searching environment.

  • PDF

A Study on Operational Method of a HMS (HMS 운용방안에 관한 연구)

  • Shin, Seoung Chul;Lee, Chul Mok
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.15 no.5
    • /
    • pp.586-593
    • /
    • 2012
  • The Navy is in the process of developing a sonar-operation strategy to increase the effectiveness of underwater target searching capability. HMS is the basic strategy to detect underwater targets. The advantages of HMS is that, it has a short preparation time to operate and can be always used regardless of sea conditions and weather. However, it is difficult to effectively detect underwater targets due to the interaction between marine environments and sonar-operations. During the research, the effectiveness of the HMS system's underwater target searching capability was analyzed by integrating various search and defense patterns, and environment conditions into the simulation. In the simulation the ship search an evasive target within a set region. The simulation presented results for an effective searching and defense methods of underwater targets. These research results can be used as foundation for advancing and improving the sonar operational tactics.

A Fast Index Search Algorithm for Codebook-based Equal Gain Transmission Beamforming System (코드북을 이용한 동 이득 전송 빔포밍 시스템에서 빠른 인덱스 탐색 기법)

  • Park, Noe-Yoon;Kim, Young-Ju;Li, Xun;Lee, Kwan-Seob
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.45 no.12
    • /
    • pp.83-89
    • /
    • 2008
  • Simple but effective fast codebook searching algorithms for quantized EGT(equal gain transmission) are presented. Using newly defined metric, rough searching selects a few candidate weight vectors. Using the conventional metric, accurate searching determines the optimal vector among the candidates. This strategy reduces the entire searching time. When the number of transmit antenna is two or three, the searching time reduces more than a half less than the conventional searching time. Moreover, the more the size of codebook increases, the more the searching time reduction also increases.

Macroscopic Recognition and Decision Making for the GO Game Moves

  • Nishino, Junji;Shirai, Haruhiko;Odka, Tomohiro;Ogura, Hisakazu
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 1998.06a
    • /
    • pp.674-679
    • /
    • 1998
  • In this paepr, we proposed a new way to make a pre-pruned searching tree for GO game moves from macroscopic strategy described in linguistic expression. The strategy was a consequence of macroscopic recognition of GO game situations. The definitions of fuzzy macroscopic strategy, fuzzy tactics and tactical sequences using fuzzy set are shown and its family, so called "multi level fuzzy set". Some examples are also shown.

  • PDF

A Study of Information Searching Behaviors Caused by Time pressure of Researchers (연구자의 시간압박감에 따른 정보탐색행태에 관한 연구)

  • Hong Ki-Churl
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.31 no.3
    • /
    • pp.209-237
    • /
    • 1997
  • The main purpose of this study is to find the difference of information searching behaviours consist of information pursuit cognition and searching character by time pressure of researchers. The majar findings and result by time pressure of researchers are summarized as follows : In terms of information retrieval systems, according to the time pressure, there is a significant difference in recall, precision and diversity. In terms of main used material, there is a significant difference in a book, a research report, and a Journal. In terms of resource types, there is a significant difference in both record and human resource. Also, in terms of searching behaviours, there is a difference to spend time for information collection and information searching strategy, and to decide information searching method and degree of searching.

  • PDF

A Study on the Impact on Management Performance of Hidden Champions Using Blue Ocean Strategy to Develop a New Product - Focusing on Food Manufacturers - (블루오션 전략을 활용한 강소기업의 신제품 개발이 경영성과에 미치는 영향에 관한 연구 - 식품제조업체를 중심으로 -)

  • Kim, Hyung-Il;Shin, Young-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.1
    • /
    • pp.42-49
    • /
    • 2020
  • This study is an empirical research to find out the effect on the management performance of hidden champions of food manufacturing companies when using blue ocean strategy for new product development. In order to achieve the purpose of this study, we conducted a questionnaire survey on hidden champions in the domestic food manufacturing industry and proceeded empirical analysis. When small and medium-sized enterprises in food manufacturing industries develop a new product, searching for non-customer, rebuilding the market boundary, and linking the external networks have a significant impact on their management performance. However, the fair procedure did not have a significant effect on the management performance. In terms of relative influence, rebuilding the market boundary was most affecting, followed by searching for non-customer and linking the external networks. On the other hand, this study implicated the management performance of hidden champions of food manufacturing industries when new products is developed by using the blue ocean strategy. Obtained results are as follows. If small and medium-sized enterprises of food manufacturing industries develop new products, it will be able to improve the management performance by utilizing strategies such as searching for non-customer, rebuilding the market boundary, and linking the external networks. In particular, the rebuilding the market boundary among the blue ocean strategies has a relatively high impact on management performance.

A Time-Segmented Storage Structure and Migration Strategies for Temporal Data (시간지원 데이터를 위한 분리 저장 구조와 데이터 이동 방법)

  • Yun, Hong-Won;Kim, Gyeong-Seok
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.4
    • /
    • pp.851-867
    • /
    • 1999
  • Numerous proposals for extending the relational data model as well as conceptual and object-oriented data models have been suggested. However, there has been relatively less research in the area of defining segmented storage structure and data migration strategies for temporal data. This paper presents the segmented storage structure in order to increment search performance and the two data migration strategies for segmented storage structure. this paper presents the two data migration strategies : the migration strategy by Time granularity, the migration strategy by LST-GET. In the migration strategy by Time Granularity, the dividing time point to assign the entity versions to the past segment, the current segment, and future segment is defined and the searching and moving process for data validity at a granularity level are described. In the migration strategy by LST-GET, we describe the process how to compute the value of dividing criterion. searching and moving processes are described for migration on the future segment and the current segment and entity versions 새 assign on each segment are defined. We simulate the search performance of the segmented storage structure in order to compare it with conventional storage structure in relational database system. And extensive simulation studies are performed in order to compare the search performance of the migration strategies with the segmented storage structure.

  • PDF