• 정보처리학회논문지D
• /
• 제18D권4호
• /
• pp.309-312
• /
• 2011

스마트폰의 음성 검색에서 퍼지 쿼리를 처리하는 것은 가장 어려운 문제 중의 하나이다. 이는 자연어에 내재된 자유도와 복잡성에 주로 기인한다. 스마트폰의 음성 검색에서 퍼지 쿼리의 자유도와 복잡성을 줄이기 위해 속성값에 기반을 둔 방법이 제안된다. 또한, 퍼지 쿼리 처리를 위한 속성값에 기반을 둔 새로운 페이지 등급 알고리즘이 제안된다. 이는 사용자의 검색 의도에 기반을 둔 위치기반의 개인화된 페이지 등급을 스마트폰 사용자에게 제공할 수 있다. 제안된 방법은 스마트폰 사용자를 위한 위치기반의 개인화된 웹 검색의 진일보한 방법이라고 할 수 있다. 본 논문에서는 스마트폰의 음성 검색에서 퍼지 쿼리 처리를 위한 프로토타입 모델을 설계하고, 기존 스마트폰과 비교하여 제안된 방법의 성능 실험 결과를 제시한다.

• 한국멀티미디어학회논문지
• /
• 제18권5호
• /
• pp.682-690
• /
• 2015

Among location-based systems, a route search service is very highly utilized as a representative technique, but it provides relatively low accuracy when we find a route path on foot in our real environment. In this paper, we design and implement an optimized route search technique based on user experience utilizing open APIs as location-based services. Finally, we develop an Android-based application to provide this feature. In our experiment, we found that our technique enhanced performance by about 14-36% compared to previous solutions, such as route path searches using map APIs. In addition, the performance of our technique can be further enhanced, as the number of users who find such optimized route path is increasing.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2004년도 Proceedings of ISRS 2004
• /
• pp.256-259
• /
• 2004

Recently, Location-based services(LBS) allow consumers to receive services based on their geographic location data. Users want to take services based location information with portable devices. And Point of Interest(POI) information's usage is increasing with mobile device's development and user's interest. And this paper shows that we connect the multimedia POI database(DB), provide the multimedia services through the portable devices and search POI using location and direction information. The multimedia POI is consisted of sound, image, moving image and animation with location information. When we search POI, we find POI in DB using the area zone and direction information.[l]

• 한국GIS학회:학술대회논문집
• /
• 한국GIS학회 2003년도 추계학술대회논문집
• /
• pp.65-69
• /
• 2003

The Location Based Services comprised GIS and Telecommunication allow users to receive various services based on their geographic location. It is need to legislation to encourage the provision and use of location information by providing privacy protection to users. But the contents of the legislation proposed by Korean government have problems conflicted between protection of a person's location information and invigoration of location-based services. The purpose of this study is to search complementary measures for privacy protection of location information from From a viewpoint of effective management strategy for geographic information.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권10호
• /
• pp.1217-1224
• /
• 1999

이동 호스트들의 위치 정보를 관리하는 것은 이동 컴퓨터 시스템에서 중요한 문제이다. 이동 호스트가 이동할 때 위치 수정과 위치 탐색간에는 상반관계가 존재한다. 본 논문에서는 위치 서버를 이용한 간단한 quorum 기반 분산 동적 위치 관리 방법을 제안한다. 이 방법에서는 이동 호스트들의 위치 정보가 모든 위치 레지스터가 아닌 위치 레지스터들의 부분집합에서 효율적으로 관리되기 때문에 위치 수정 비용과 위치 탐색 비용이 감소된다. 그리고 위치 레지스터들의 부분집합은 동적으로 변하고, 각 위치 서버의 부하는 이동 호스트에 대한 질의율을 고려하므로 균등해진다. 제안된 알고리즘의 성능은 위치 수정비용과 위치 탐색비용의 전체비용으로 평가되었고, Prakash의 알고리즘과 비교되었다.Abstract Managing location information of mobile hosts is an important issue in mobile computing systems. There is a trade-off between location update and search, when a mobile host moves. This paper proposes a simple quorum-based distributed dynamic location management method using location registers. The cost of location updates and searches is reduced by our method because the location information of mobile hosts is managed efficiently in a subset of location registers instead of in all location registers. In our method, the subset of location registers is dynamically changed, and the load of each location register is balanced by considering query rate for mobile hosts. The performance of proposed algorithm is evaluated in terms of the total cost of a location update and a location search, and is compared with Prakash's algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2468-2487
• /
• 2015

In web searching, trustable and precise results are greatly affected by the inherent uncertainty in the input queries. Queries submitted to search engines are by nature ambiguous and constitute a significant proportion of the instances given to web search engines. Ambiguous queries pose real challenges for the web search engines due to versatility of information. Temporal based approaches whereas somehow reduce the uncertainty in queries but still lack to provide results according to users aspirations. Web search science has created an interest for the researchers to incorporate contextual information for resolving the uncertainty in search results. In this paper, we propose an Adaptive Disambiguation Approach (ADA) of hybrid nature that makes use of both the temporal and contextual information to improve user experience. The proposed hybrid approach presents the search results to the users based on their location and temporal information. A Java based prototype of the systems is developed and evaluated using standard dataset to determine its efficacy in terms of precision, accuracy, recall, and F1-measure. Supported by experimental results, ADA demonstrates better results along all the axes as compared to temporal based approaches.

• Industrial Engineering and Management Systems
• /
• 제8권1호
• /
• pp.29-36
• /
• 2009

We present two local-search based metaheuristics for the multi-source capacitated facility location problem. In such a problem, each customer's demand can be supplied by one or more facilities. The problem is NP-hard and the number of locations in the optimal solution is unknown. To keep the search process effective, the proposed methods adopt the following features: (1) a multi-exchange neighborhood structure, (2) a tabu list that keeps track of recently visited solutions, and (3) a multi-start to enhance the diversified search paths. The transportation simplex method is applied in an efficient manner to obtain the optimal solutions to neighbors of the current solution under the algorithm framework. Two in-and-out selection rules are also proposed in the algorithms with the purpose of finding promising solutions in a short computational time. Our computational results for some of the benchmark instances, as well as some instances generated using a method in the literature, have demonstrated the effectiveness of this approach.

• 전기학회논문지
• /
• 제56권7호
• /
• pp.1309-1314
• /
• 2007

The assignment of cells to reporting or non-reporting cells is an NP-hard problem having an exponential complexity in the Reporting Cell Location Management (RCLM) system. Frequent location update may result in degradation of quality of service due to interference. Miss on the location of a mobile terminal will necessitate a search operation on the network when a call comes in. The number of reporting cells and which cell must be reporting cell should be determined to balance the registration (location update) and search (paging) operations to minimize the cost of RCLM system. T1is paper compares Max-Min ant system (MMAS), rank-based ant system (RAS) and hybrid method of MMAS and RAS that generally used to solve combinatorial optimization problems. Experimental results demonstrate that hybrid method of MMAS and RAS is an effective and competitive approach in fairly satisfactory results with respect to solution quality and execution time for the optimal design of location management system.

• International Journal of Internet, Broadcasting and Communication
• /
• 제16권3호
• /
• pp.253-261
• /
• 2024

The role of the library is as a public institution that provides academic information to a variety of people, including students, the general public, and researchers. These days, as the importance of lifelong education is emphasized, libraries are evolving beyond simply storing and lending materials to complex cultural spaces that share knowledge and information through various educational programs and cultural events. One of the problems library user's faces is locating books to borrow. This problem occurs because of errors in the location of borrowed books due to delays in updating library databases related to borrowed books, incorrect labeling, and books temporarily located in different locations. The biggest problem is that it takes a long time for users to search for the books they want to borrow. In this paper, we propose a system that visually displays the location of books in real time using an AI vision sensor and LED. The AI vision sensor-based book location guidance system generates a QR code containing the call number of the borrowed book. When the AI vision sensor recognizes this QR code, the exact location of the book is visually displayed through LED to guide users to find it easily. We believe that the AI vision sensor-based book location guidance system dramatically improves book search and management efficiency, and this technology is expected to have great potential for use not only in libraries and bookstores but also in a variety of other fields.

• 정보처리학회논문지D
• /
• 제18D권4호
• /
• pp.225-236
• /
• 2011

무선 통신 기술의 발달과 컴퓨터의 소형화에 힘입어 사용자의 위치에 따라 맞춤형 서비스를 제공하기 위하여 다양한 위치 기반 서비스 응용들이 개발되고 있다. 그리고 대용량의 차량 위치 데이터를 효과적으로 처리하기 위하여 차량 위치 감지 및 전송, 데이터의 삽입 및 검색과 사용자 질의 처리 기술이 요구된다. 이 논문에서는 대용량의 과거 차량 위치 정보를 빠르게 입력, 검색하는 과거 위치 색인을 설계하고 상황에 따라 입력과 검색 비용을 조절할 수 있는 가변 버퍼 노드인 기법을 제안한다. 설계된 색인은 GIP+와 같이 효과적인 입력을 위해 버퍼 노드를 사용하고 빠른 검색을 위해 프로젝션 스토리지를 사용한다. 그리고 사용자가 지정한 시간 간격에 따라 버퍼 노드에 저장되는 데이터의 개수를 조절하여 입력과 검색 비용을 조절할 수 있다. 실험에서는 버퍼 노드 크기에 따라 비단말 노드 수가 달라지며, 이로 인해 입력과 검색 성능이 달라짐을 확인할 수 있다. 제안된 가변 버퍼 노드 방식은 위치 기반 서비스 응용에 따라 과거 위치 색인의 성능을 조절하는데 효과적으로 사용 가능하다.