• 대한전자공학회논문지TC
• /
• 제48권5호
• /
• pp.25-32
• /
• 2011

본 논문에서는 MIMO 시스템에서 최적의 수신 성능을 제공하면서 낮은 복잡도를 요구하는 부분 검색 공간 기반의 검파 기법이 제안된다. 최적의 최대 우도 검파기는 신호의 전체 검색 공간을 활용하기 때문에 많은 복잡도를 요구하게 되는 데, 이에 대한 해결 방안으로 신호의 부분 검색 공간에 기반한 부분 후보 심볼 벡터 생성 기법이 제안된다. 또한, 최적의 수신 성능을 제공하기 위해서 전체 검색 공간에 기반한 전체 후보 심볼 벡터 생성 기법이 제안된다. 결론적으로 제안하는 부분 검색 공간 기반의 검파 기법은 MIMO 시스템에서 낮은 복잡도를 필요하면서 최적의 수신 성능을 제공하는 검파기법으로 사용될 수 있다.

• 전자공학회논문지
• /
• 제54권7호
• /
• pp.12-18
• /
• 2017

본 논문은 MIMO 통신 시스템을 위한 Dijkstra 탐색 기반의 제한된 연산량을 갖는 스피어 디코딩 (sphere decoding; SD) 알고리즘을 제안하고 이에 대한 성능을 평가한다. Dijkstra 탐색 기반의 SD는 MIMO 심볼 검파 과정에서 저 복잡도로 준 최적의 에러율 성능을 달성하는 효율적인 tree 탐색 알고리즘이다. 하지만 Dijkstra 탐색 기반의 SD는 채널 환경에 따라 연산량이 가변적이고, 최악의 경우 전역 탐색의 경우에 해당하는 높은 연산량을 갖는 심각한 문제가 있다. 본 논문에서는 이러한 문제를 해결하기 위해서 연산량을 제한시킨 새로운 Dijkstra 탐색 기반의 SD 알고리즘을 제시한다. 제안된 알고리즘은 연산량이 제한되었음에도 여전히 준 최적의 에러율 성능을 달성함을 모의 실험을 통해 검증하였다.

• 정보처리학회논문지B
• /
• 제10B권7호
• /
• pp.811-814
• /
• 2003

본 논문에서는 십자패턴과 육각패턴을 이용한 고속 블록 정합 동작 예측 기법을 제안한다. 블록 기반 탐색에서 전역 탐색방법이 가장 좋은 동작벡터를 찾지만, 탐색영역 내의 모든 전을 검색하기 때문에 많은 시간을 필요로 하게 된다. 본 방법은 대부분의 동영상에서 동작벡터가 블록의 중심 부근에 집중적으로 분포함을 착안하여 십자패턴으로 중앙을 우선 탐색한 다음 움직임이 큰 동작벡터를 육각패턴을 사용하여 찾는다. 실험결과, 본 방법은 기존의 탐색방법보다 화질과 탐색시간에서 대부분의 경우에 좋은 성능을 보임을 알 수 있다.

• Journal of Welding and Joining
• /
• 제28권6호
• /
• pp.76-83
• /
• 2010

The purpose of this study is to propose a method to decide near-optimal settings of the constant current fuzzy control parameters using a controlled random search. This method tries to find the near-optimal settings of the constant current fuzzy control parameters through experiments. It has an advantage of being able to carry out searches in the search domain which includes some irregular points. The method suggested in this study was used to determine the fuzzy control parameters by which the desired welding current were formed during inverter DC resistance spot welding. The output variable was the ITAE (integral of time multiplied by the absolute error). This output variable was determined according to the input variables, which are the GE, GDE, and GDU. This study described how to obtained near-optimal welding current condition over a wide search space conducting a relatively small number of experiments.

• Journal of Smart Tourism
• /
• 제3권3호
• /
• pp.29-40
• /
• 2023

This research aims to understand the role of online reviews in the local search context by examining the effects of reviews on the representation of tourism businesses on local search platforms (LSPs). By simulating tourists' local searches for restaurants on three LSPs, namely Google, Bing, and Yelp, this study examines how different ranking results are generated across the platforms and how online reviews contribute to the differences. The findings suggest that online reviews are incorporated into LSPs as ranking factors and, thus, affect tourists' decision-making by influencing the information search results in the local search context. As one of the earliest studies on local search, this study discusses how the existing knowledge about the role of online reviews in tourists' decision-making needs to be reevaluated in mobile and more dynamic environments, and offers practical implications for tourism businesses' search engine marketing.

• 한국경영과학회지
• /
• 제30권2호
• /
• pp.157-167
• /
• 2005

This paper presents a new perturbation technique for developing efficient iterated local search procedures for the asymmetric traveling salesman problem(ATSP). This perturbation technique uses global information on ATSP instances to speed-up computation and to improve the quality of the tours found by heuristic method. The main idea is to escape from a local optima by introducing perturbations on the out-of-kilter arcs in the problem instance. For a local search heuristic, we use the Kwon which finds optimum or near-optimum solutions by applying the out-of-kilter algorithm to the ATSP. The performance of our algorithm has been tested and compared with known method perturbing on randomly chosen arcs. A number of experiments has been executed both on the well-known TSPLIB instances for which the optimal tour length is known, and on randomly generated Instances. for 27 TSPLIB instances, the presented algorithm has found optimal tours on all instances. And it has effectively found tours near AP lower bound on randomly generated instances.

• 산업공학
• /
• 제18권4호
• /
• pp.504-511
• /
• 2005

The NP-hard channel assignment problem becomes more and more important to use channels as efficiently as possible because there is a rapidly growing demand and the number of usable channel is very limited. The hybrid genetic and local search (HGLS) method in this paper is a hybrid method of genetic algorithm with no interference channel assignment (NICA) in clustering stage for diversified search and local search in tuning stage when the step of search is near convergence for minimizing blocking calls. The new representation of solution is also proposed for effective search and computation for channel assignment.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.135-138
• /
• 1996

In solving the Travel Salesman Problem(TSP), we easily reach local optimal solutions with the existing methods such as TWO-OPT, THREE-OPT, and Lin-Kernighen. Tabu search, as a meta heuristic, is a good mechanism to get an optimal or a near optimal solution escaping from the local optimal. By utilizing AI concepts, tabu search continues to search for improved solutions. In this study, we focus on developing a new neighborhood structure that maintains the feasibility of the tours created by exchange operations in TSP. Intelligent methods are discussed, which keeps feasible tour routes even after exchanging several edges continuously. An extended tabu search model, performing cycle detection and diversification with memory structure, is applied to TSP. The model uses effectively the information gathered during the search process. Finally, the results of tabu search and simulated annealing are compared based on the TSP problems in the prior literatures.

• Journal of information and communication convergence engineering
• /
• 제18권1호
• /
• pp.33-38
• /
• 2020

Elasticsearch is an open source search and analytics engine that can search petabytes of data in near real time. It is designed as a distributed system horizontally scalable and highly available. It provides RESTful APIs, thereby making it programming-language agnostic. Full text search of multilingual text requires language-specific analyzers and field mappings appropriate for indexing and searching multilingual text. Additionally, a language detector can be used in conjunction with the analyzers to improve the multilingual text search. Elasticsearch provides more than 40 language analysis plugins that can process text and extract language-specific tokens and language detector plugins that can determine the language of the given text. This study investigates three different approaches to index and search Chinese, Japanese, and Korean (CJK) text (single analyzer, multi-fields, and language detector-based), and identifies the advantages of the language detector-based approach compared to the other two.

• 대한임베디드공학회논문지
• /
• 제8권2호
• /
• pp.121-128
• /
• 2013

There have been various research efforts for pedestrian recognition in embedded imaging systems. However, many suffer from their heavy computational complexities. SVM classification method has been widely used for pedestrian recognition. The reduction of candidate region is crucial for low-complexity scheme. In this paper, We propose a real time HOG based pedestrian detection system on GPU which images are captured by a pair of cameras. To speed up humans on road detection, the proposed method reduces a number of detection windows with disparity-search and near-search algorithm and uses the GPU and the NVIDIA CUDA framework. This method can be achieved speedups of 20% or more compared to the recent GPU implementations. The effectiveness of our algorithm is demonstrated in terms of the processing time and the detection performance.