• Title/Summary/Keyword: Mobile Search

Search Result 765, Processing Time 0.025 seconds

A Region Search Algorithm and Improved Environment Map Building for Mobile Robot Navigation

  • Jin, Kwang-Sik;Jung, Suk-Yoon;Son, Jung-Su;Yoon, Tae-Sung
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.71.1-71
    • /
    • 2001
  • In this paper, an improved method of environment map building and a region search algorithm for mobile robot are presented. For the environment map building of mobile robot, measurement data of ultrasonic sensors and certainty grid representation is usually used. In this case, inaccuracies due to the uncertainty of ultrasonic data are included in the map. In order to solve this problem, an environment map building method using a Bayesian model was proposed previously[5]. In this study, we present an improved method of probability map building that uses infrared sensors and shift division Gaussian probability distribution with the existing Bayesian update method using ultrasonic sensors. Also, a region search algorithm for ...

  • PDF

A Study on the Development of School Library Mobile App Service Based on User Experience (사용자 경험을 기반으로 한 학교도서관 모바일 앱 서비스 개발에 관한 연구)

  • Park, Sora;Lee, Mihwa
    • Journal of the Korean BIBLIA Society for library and Information Science
    • /
    • v.32 no.2
    • /
    • pp.49-67
    • /
    • 2021
  • The school library provides a mobile web service that allows access to the library catalog system, and provides services that reflect the needs of search and consider the characteristics of mobile devices. Therefore, this study conducted a literature review, an analysis of the current status of school library mobile web services, and a survey of the mobile service user experience of students and teachers to find the contents and service plans for school library mobile app services that meet the school library mobile needs. Based on the survey, the contents and design plan of the school library DLS mobile service was prepared. First, the steps were reduced from step 4 to step 3. In the first step, solution of screen clipping errors in registering as a member and various login platforms for accessibility are needed. In the second step, integrated search and detailed search, provision of materials for use and reading education, post-booking activities, guides and announcements on the use of the affiliated school library, inter-loan, and e-books are provided as main menu. In the third step, it was proposed to provide related functions such as reservations as well as the display of the detailed screen of the search results of the collection. This study can be used not only to develop dedicated mobile app services, but also to change current web-based mobile services.

Design of Complex Retrieval User Interface for Multimedia Content based on Mobile TV (모바일 TV 기반의 멀티미디어 콘텐츠 복합 검색 인터페이스 설계)

  • Byeon, Jae-Hee;Moon, Nam-Mee
    • Journal of The Institute of Information and Telecommunication Facilities Engineering
    • /
    • v.9 no.3
    • /
    • pp.119-123
    • /
    • 2010
  • Since the two-way interactive broadcasting service began, remote controllers have been fitted with 4 color buttons, which enable interaction and convenience to grow between users and content. With Currently, diverse studies on IPTV are in progress. Particularly, as the mobile market rapidly grows, studies on mobile IPTV and on linkage with other media are constantly increasing. Yet, mobile IPTV has never been studied as of now. In that sense, the present study attempted to design a mobile-based IPTV UI that is fitted with more usability and functionality of 4 color buttons and multi-dimensional search based on consistent criteria for content search. The UI designed in this study was estimated using user interface design guideline. The guideline is comprised of consistency, user centered, ease of use, forgiveness, feedback, functionality, aesthetic integrity.

  • PDF

Forensic Evidence of Search and Seized Android and Windows Mobile Smart Phone (압수 수색된 안드로이드와 윈도우모바일 스마트폰의 포렌식 증거 자료)

  • Yoon, Kyung-Bae;Chun, Woo-Sung;Park, Dea-Woo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.2
    • /
    • pp.323-331
    • /
    • 2013
  • There are three ways how to extract forensic evidence from mobile phone, such as SYN, JTAG, Revolving. However, it should be a different way to extract forensic evidence due to the differences of their usage and technology between them(mobile phone and smart phone). Therefore, in this paper, I will come up with extraction method that forensics evidence by search and seizure of a smart phone. This study aims to analyze specifications and O.S., backup analysis, evidence in smart to analyze for search and seizure of a smart phone commonly used google android and windows mobile smart phone. This study also aim to extract forensics evidence related to google android and phone book, SMS, photos, video of window mobile smart phone to make legal evidence and forensics report. It is expected that this study on smart phone forensics technology will contribute to developing mobile forensics technology.

A Suitable Cell Search Algorithm Using Separated I/Q Channel Cell Specific Scrambling Codes for Systems with Coexisting Cellular and Hot-Spot Cells in Broadband OFCDM Systems (광대역 OFCDM 시스템에서 셀룰러와 핫-스팟 셀들이 공존할 때 분리 I/Q채널 CSSC를 이용한 셀 탐색 알고리즘)

  • Kim Dae-Yong;Kwon Hyeog-Soong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.8
    • /
    • pp.1649-1655
    • /
    • 2005
  • For systems with coexisting cellular and hot-spot cells in broadband orhogonal frequency and code division multiplexing (OFCDM) systems, a suitable cell search algorithm is proposed fur the common pilot channel (CPICH) in the forward link using separated I/Q channel cell specific codes(CSSC), in which the cellular cell specific scrambling code (CCSSC) is assigned to the in-phase (Q) pilot channel of all cellular cells, and the exclusive hot-spot cell specific scrambling code (HSCSSC) group is assigned to the quadrature (Q) pilot channel of all hot-spot cells. Therefore, the proposed algorithm enables a mobile station (MS) to search quickly for the most desirable hot-spot cell due to reducing the effect of CCSSC, when a MS wants to use a mobile internet. The computer simulation results show that the proposed cell search algorithm can achieve faster cell search time performance, compared to conventional cell search methods.

Implementation of autonomous driving algorithm and monitoring application for terrain navigation (지형 탐색 자율주행 알고리즘과 모니터링 애플리케이션 구현)

  • Kang, Jongwon;Jeon, Il-Soo;Kim, Myung-Sik;Lim, Wansu
    • Journal of IKEEE
    • /
    • v.25 no.3
    • /
    • pp.437-444
    • /
    • 2021
  • In this paper, we propose an autonomous driving algorithm that allows a robot to explore various terrains, and implement an application that can monitor the robot's movement path during terrain search. The implemented application consists of a status unit that indicates the position, direction, speed, and motion of the mobile robot, a map unit that displays terrain information obtained through terrain search, and a control unit that controls the movement of the mobile robot. In order to control the movement of the robot, only the start and stop of the search/return is commanded by the application, and all driving for the search is performed autonomously. The basic algorithm for terrain search uses an infrared sensor to check for obstacles in the order of left, front, right, and rear, and if there is no obstacle and the path traveled is a dead end, it returns to the previous position and moves in the other direction to continue the search. Repeat the process to explore the terrain.

Data Dissemination Method for Efficient Contents Search in Mobile P2P Networks (모바일 P2P 네트워크에서 효율적인 콘텐츠 검색을 위한 데이터 배포 기법)

  • Bok, Kyoung-Soo;Cho, Mi-Rim;Yoo, Jae-Soo
    • The Journal of the Korea Contents Association
    • /
    • v.12 no.8
    • /
    • pp.37-46
    • /
    • 2012
  • In the existing data dissemination methods for mobile P2P networks, the search performance of content that matches the peer profile is very excellent. However, in the search for content that does not match the their profile, additional consideration about case that contents does not match the profile is needed because costs for the query processing will be incurred. To solve these problems, we propose a new data dissemination method for efficient contents search in mobile P2P networks. In the proposed method, peers determine whether they experienced communications by using a timestamp message and then perform data dissemination. We also propose a ranking algorithm to efficiently store dissemination data in a limited memory. The proposed ranking method can reduce query messages by considering the profile matches, the distribution range, and the connectivity to the data distribution peer.

Image Retrieval using Multiple Features on Mobile Platform (모바일 플랫폼에서 다중 특징 기반의 이미지 검색)

  • Lee, Yong-Hwan;Cho, Han-Jin;Lee, June-Hwan
    • Journal of Digital Convergence
    • /
    • v.12 no.6
    • /
    • pp.237-243
    • /
    • 2014
  • In this paper, we propose a mobile image retrieval system which utilizes the mobile device's sensor information and enables running in a variety of the environments, and implement the system on Android platform. The proposed system deals with a new image descriptor using combination of the visual feature with EXIF attributes in the target of JPEG image, and image matching algorithm which is optimized to the mobile environments. Experiments are performed on the Android platform, and the experimental results revealed that the proposed algorithm exhibits a significant improved results with large image database.

A hybrid tabu search algorithm for Task Allocation in Mobile Crowd-sensing

  • Akter, Shathee;Yoon, Seokhoon
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.12 no.4
    • /
    • pp.102-108
    • /
    • 2020
  • One of the key features of a mobile crowd-sensing (MCS) system is task allocation, which aims to recruit workers efficiently to carry out the tasks. Due to various constraints of the tasks (such as specific sensor requirement and a probabilistic guarantee of task completion) and workers heterogeneity, the task allocation become challenging. This assignment problem becomes more intractable because of the deadline of the tasks and a lot of possible task completion order or moving path of workers since a worker may perform multiple tasks and need to physically visit the tasks venues to complete the tasks. Therefore, in this paper, a hybrid search algorithm for task allocation called HST is proposed to address the problem, which employ a traveling salesman problem heuristic to find the task completion order. HST is developed based on the tabu search algorithm and exploits the premature convergence avoiding concepts from the genetic algorithm and simulated annealing. The experimental results verify that our proposed scheme outperforms the existing methods while satisfying given constraints.

Development of a Navigation Control Algorithm for Mobile Robots Using D* Search and Fuzzy Algorithm (D* 서치와 퍼지 알고리즘을 이용한 모바일 로봇의 충돌회피 주행제어 알고리즘 설계)

  • Jung, Yun-Ha;Park, Hyo-Woon;Lee, Sang-Jin;Won, Moon-Cheol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.34 no.8
    • /
    • pp.971-980
    • /
    • 2010
  • In this paper, we present a navigation control algorithm for mobile robots that move in environments having static and moving obstacles. The algorithm includes a global and a local path-planning algorithm that uses $D^*$ search algorithm, a fuzzy logic for determining the immediate level of danger due to collision, and a fuzzy logic for evaluating the required wheel velocities of the mobile robot. To apply the $D^*$ search algorithm, the two-dimensional space that the robot moves in is decomposed into small rectangular cells. The algorithm is verified by performing simulations using the Python programming language as well as by using the dynamic equations for a two-wheeled mobile robot. The simulation results show that the algorithm can be used to move the robot successfully to reach the goal position, while avoiding moving and unknown static obstacles.