• Title/Summary/Keyword: A* search

Search Result 14,894, Processing Time 0.038 seconds

Solving design optimization problems via hunting search algorithm with Levy flights

  • Dogan, Erkan
    • Structural Engineering and Mechanics
    • /
    • v.52 no.2
    • /
    • pp.351-368
    • /
    • 2014
  • This study presents a hunting search based optimum design algorithm for engineering optimization problems. Hunting search algorithm is an optimum design method inspired by group hunting of animals such as wolves, lions, and dolphins. Each of these hunters employs hunting in a different way. However, they are common in that all of them search for a prey in a group. Hunters encircle the prey and the ring of siege is tightened gradually until it is caught. Hunting search algorithm is employed for the automation of optimum design process, during which the design variables are selected for the minimum objective function value controlled by the design restrictions. Three different examples, namely welded beam, cellular beam and moment resisting steel frame are selected as numerical design problems and solved for the optimum solution. Each example differs in the following ways: Unlike welded beam design problem having continuous design variables, steel frame and cellular beam design problems include discrete design variables. Moreover, while the cellular beam is designed under the provisions of BS 5960, LRFD-AISC (Load and Resistant Factor Design-American Institute of Steel Construction) is considered for the formulation of moment resisting steel frame. Levy Flights is adapted to the simple hunting search algorithm for better search. For comparison, same design examples are also solved by using some other well-known search methods in the literature. Results reveal that hunting search shows good performance in finding optimum solutions for each design problem.

Development of Information Search Module by Integrating Regular Expression and Correlation Analysis Method (정규식 구문과 상관분석 기법을 통합한 정보 검색 모듈 개발)

  • Kim, Bong-Hyun
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.3
    • /
    • pp.634-640
    • /
    • 2013
  • Existing patterns and database search, string search unit search results for a lot of false positives, a simple search technique unreliable. In addition, the same conditions in addition to other search methods implemented due to wasted of resources and enforcement have been causing a waste of time. Therefore, regular expression and correlation analysis method by applying an integrated linkage information search module is to develop in this paper. From this, existing string search technique that has been noted as a problem by reducing the economic impact false positive and reliability to develop method that will information search secure.

A Study on the Shopping Life through Mobile Visual Search

  • Tungyun Liu;Sijun Sung;Heeju Chae
    • Asia-Pacific Journal of Business
    • /
    • v.15 no.1
    • /
    • pp.45-69
    • /
    • 2024
  • Purpose - To examine the influence of mobile visual search as a strategic technology service on consumer perceived economic value and customer commitments, which in turn affect consumer's usage intention of mobile visual search. This study also explores the moderating effect of different levels of consumer online shopping orientation. Design/methodology/approach - One-by-one open-ended in-depth interview was first undertaken to 15 Korean consumers to figure the features of mobile visual search. Then a conceptual model was built to verify the hypotheses that indicate the impact of mobile visual search on consumer perceived economic value and customer commitment, which further influence consumer's usage intention. Findings - The results show Convenience, Information quality, Personalization, Text-free search interface design and Visual communication of mobile visual search positively influence consumer perceived economic value and customer commitment and in turn positively affect consumer's usage intention. Moreover, the different levels of consumer online shopping orientation also found to have different effects on consumers' perception and behavior of using mobile visual search in online fashion shopping. Research implications or Originality - The present study verified that mobile visual search is a service tool that consumers want to use in the online fashion shopping journey since it provides economic benefits.

A Study on the Impact of TV ad Exposure on Search Volumes on App-based Service Brands: Focusing on the Moderating Effect of Industry Type and Search Language Type (앱기반 서비스 브랜드의 TV 광고 노출량이 검색량에 미치는 영향: 업종유형 및 검색언어 유형의 조절효과를 중심으로)

  • Kim, Donna;Moon, Yoon Taek
    • The Journal of the Korea Contents Association
    • /
    • v.21 no.9
    • /
    • pp.284-298
    • /
    • 2021
  • In addition to awareness building, TV media creates search behavior for the brand and the search result may link to a brand homepage and/or an e-commerce site. This study analyzed the impact of TV advertisements on a search volume at NAVER, a leading Korean search platform, in order to verify the impact of TV advertisements on brand-related search behavior. Results are as follows. TV advertisement exposure was significantly related to the amount of Korean search, English search, and total search. In addition, changes in TV advertising exposure also had a significant static influence on changes in search volume. The increase in the number of brand search was different by industries that carried out TV advertisements, and it was verified that the frequency of English searches increased faster than the frequency of Korean search as the exposure of TV advertisements increased. Therefore, domestic TV advertising volume has been verified to affect NAVER search volume, and the advertising industry and brand search language that conducted TV advertisements have been verified to be moderating variables. TV advertisements can be interpreted to cause brand search behavior in English even though it is not a native language for Koreans.

Shopping Motives, Information Search and Behavioral Intentions of Internet Fashion Consumers (인터넷 패션 소비자의 쇼핑동기, 정보탐색 및 행동의도에 관한 연구)

  • Suk, Hyo-Jung;Park, Sung-Hee;Lee, Eun-Jin
    • Journal of the Korean Society of Clothing and Textiles
    • /
    • v.35 no.8
    • /
    • pp.918-932
    • /
    • 2011
  • This research examines shopping motives, information search of e-fashion consumers and their behavioral intentions (word of mouth, repurchase and site switching intentions). The survey was conducted from December $17^{th}$ 2010 to January $5^{th}$ 2011 and all respondents had previous experiences with on-line purchase of fashion items. The study finds that an information search has three dimensions, recreational search, informative search, and rational search. The effects of both hedonic and utilitarian shopping motives on information search and behavioral intentions are significant. In addition, recreational and informative search have a positive impact on word of mouth and site switching intentions, while repurchase intention is influenced by an informative search. Rational search has a positive effect on switching intention only. Finally, there are significant differences by gender in shopping motives, information search and behavioral intentions.

A k-means++ Algorithm for Internet Shopping Search Engine

  • Jian-Ji Ren;Jae-kee Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.75-77
    • /
    • 2008
  • Nowadays, as the indices of the major search engines grow to a tremendous proportion, vertical search services can help customers to find what they need. Search Engine is one of the reasons for Internet shopping success in today's world. The import one part of search engine is clustering data. The objective of this paper is to explore a k-means++ algorithm to calculate the clustering data which in the Internet shopping environment. The experiment results shows that the k-means++ algorithm is a faster algorithm to achieved a good clustering.

Development of the Meta-heuristic Optimization Algorithm: Exponential Bandwidth Harmony Search with Centralized Global Search (새로운 메타 휴리스틱 최적화 알고리즘의 개발: Exponential Bandwidth Harmony Search with Centralized Global Search)

  • Kim, Young Nam;Lee, Eui Hoon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.2
    • /
    • pp.8-18
    • /
    • 2020
  • An Exponential Bandwidth Harmony Search with Centralized Global Search (EBHS-CGS) was developed to enhance the performance of a Harmony Search (HS). EBHS-CGS added two methods to improve the performance of HS. The first method is an improvement of bandwidth (bw) that enhances the local search. This method replaces the existing bw with an exponential bw and reduces the bw value as the iteration proceeds. This form of bw allows for an accurate local search, which enables the algorithm to obtain more accurate values. The second method is to reduce the search range for an efficient global search. This method reduces the search space by considering the best decision variable in Harmony Memory (HM). This process is carried out separately from the global search of the HS by the new parameter, Centralized Global Search Rate (CGSR). The reduced search space enables an effective global search, which improves the performance of the algorithm. The proposed algorithm was applied to a representative optimization problem (math and engineering), and the results of the application were compared with the HS and better Improved Harmony Search (IHS).

Improving Diversity of Keyword Search on Graph-structured Data by Controlling Similarity of Content Nodes (콘텐트 노드의 유사성 제어를 통한 그래프 구조 데이터 검색의 다양성 향상)

  • Park, Chang-Sup
    • The Journal of the Korea Contents Association
    • /
    • v.20 no.3
    • /
    • pp.18-30
    • /
    • 2020
  • Recently, as graph-structured data is widely used in various fields such as social networks and semantic Webs, needs for an effective and efficient search on a large amount of graph data have been increasing. Previous keyword-based search methods often find results by considering only the relevance to a given query. However, they are likely to produce semantically similar results by selecting answers which have high query relevance but share the same content nodes. To improve the diversity of search results, we propose a top-k search method that finds a set of subtrees which are not only relevant but also diverse in terms of the content nodes by controlling their similarity. We define a criterion for a set of diverse answer trees and design two kinds of diversified top-k search algorithms which are based on incremental enumeration and A heuristic search, respectively. We also suggest an improvement on the A search algorithm to enhance its performance. We show by experiments using real data sets that the proposed heuristic search method can find relevant answers with diverse content nodes efficiently.

Integration of T-Search and Dynamic-Window Concept for Accelerated Searching Speed in Delaunay Triangulation (Delaunay Triangulation의 폴리건 검색속도 개선을 위한 T-Search와 Dynamic-Window 개념의 결합)

  • Kang, Hyun-Joo;Yoon, Sug-Joon;Kong, Ji-Young;Kim, Kang-Soo
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.27 no.5
    • /
    • pp.681-687
    • /
    • 2003
  • Terrain surfaces have to be modeled in very detail and wheel-surface contacting geometry must be well defined in order to obtain proper ground-reaction and friction forces fur realistic simulation of off-road vehicles. Delaunay triangulation is one of the most widely used methods in modeling 3-dimensional terrain surfaces, and the T-search is a relevant algorithm for searching resulting triangular polygons. The T-search method searches polygons in a successive order and may not allow real-time computation of off-road vehicle dynamics if the terrain is modeled with many polygons, depending on the computer performance used in the simulation. The dynamic T-search, which is proposed in this paper, combines conventional T-search and the concept of the dynmaic-window search which uses reduced searching windows or sets of triangular surface polygons at each frame by taking advantage of the information regarding dynamic charactereistics of a simulated vehicle. Numerical tests show improvement of searching speeds by about 5% for randomly distributed triangles. For continuous search following a vehicle path, which occurs in actual vehicle simulation, the searching speed becomes 4 times faster.

Interior Central Pole Search Coils for Initial Rotor Position Detection of a Toroidal SRM (토로이달 SRM의 초기 회전자 위치검출을 위한 돌극 관통 서치코일)

  • 양형열;임영철
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.53 no.7
    • /
    • pp.473-482
    • /
    • 2004
  • In this paper, a detection technique of initial rotor position at a standstill in Toroidal Switched Reluctance Motor(TSRM) with built-in interior central pole search coil is proposed. In case search coils are used as a position sensor, it has many advantages like low cost, decrease in the volume, high robust characteristics and wide applications. However, the initial rotor position detection is very difficult because the search coil's EMF is not exist at a standstill. In this paper, a new detection method of initial rotor position is suggested using interior central pole search coil. The simulation and experiment for the proposed method and their results support the validity of the proposed scheme by verifying the operation of a 6/4 TSRM using search coils.