• The Journal of the Korea Contents Association
• /
• 제9권2호
• /
• pp.67-75
• /
• 2009

The growing need for the mobility supportable networks induces the IP-based mobility management protocols. Though HMIPv6 which manages the micro-mobility of mobile nodes using MAPs suggests an effective method for mobility-support for mobile nodes within the domain that is managed by MAP. There is a problem that traffic may be concentrated on MAPs. In this paper, therefore, we proposed a method that can effectively distribute the traffic which is concentrated on a MAP under phased Mobile IPv6. In our proposed method, two or more MAPs are required and classified as an 'Active MAP' or a 'Passive MAP'. In addition, we defined the state of transition events between Active MAP and Passive MAP and the operations among MAPs for load distribution when an overload condition is occurred at some MAPs by traffic congestion. We compared the performance of our proposed method with its phased Mobile IPv6 to prove the propriety of our proposed method. As a result, we showed that our proposed method can provide an enhanced performance by about 12 percentages in view of packet throughput at the node.

• IEMEK Journal of Embedded Systems and Applications
• /
• 제9권2호
• /
• pp.101-107
• /
• 2014

Mobile robots use an environment map of its workspace to complete the surveillance task. However grid-based maps that are commonly used map format for mobile robot navigation use a large size of memory for accurate representation of environment. In this reason, grid-based maps are not suitable for path planning of mobile robots using embedded board. In this paper, we present the path planning algorithm that produce a secure path rapidly. The proposed approach utilizes a hybrid map that uses less memory than grid map and has same efficiency of a topological map. Experimental results show that the fast path planning uses only 1.5% of the time that a grid map based path planning requires. And the results show a secure path for mobile robot.

• Proceedings of the Korean Association of Geographic Inforamtion Studies Conference
• /
• 한국GIS학회 2008년도 공동추계학술대회
• /
• pp.65-72
• /
• 2008

Mobile Collaboration is an enabling technology that makes users share information between mobile devices and various Mobile P2P platforms have been designed and implemented for it. There are, however, few research papers on application of SIP protocol to spatial data sharing on mobile devices. In this paper, SIP based real time sharing framework is proposed to compose a mobile P2P platform on which spatial data can be trans(erred. A new protocol based on WKT and WKB is defined to send and receive spatial objects with SIP MESSAGE method. Base maps such as digital maps and parcel maps can be provided by a map server that is integrated with SIP server after a new SIP session established and client agents are registered. The framework proposed based onSIP enables users to transfer spatial data such as maps and satellite images directly between mobile devices during VoIP based voice call and therefore, mobile applications can be applied in various domains such asforest management and national defense.

• Journal of Digital Convergence
• /
• 제15권2호
• /
• pp.347-353
• /
• 2017

The aim of this paper is to improve the usability of Mobile Maps by allowing more people to use. To figure out better UX/UI, I evaluated usability for Mobile Applications from various materials such as literatures and blogs for qualitative methods and interviews and questionnaires about satisfaction of Naver and Daum for quantitative methods. So, We know that a map app is important and it is affected by force and profile on the portal site than its own features, because, not often in everyday life. Even though people do not use Mobile Map Applications frequently, we need to improve usability to make anybody use them easily by minimizing depth and button designs.

• Proceedings of the Korea Information Processing Society Conference
• /
• 한국정보처리학회 2012년도 춘계학술발표대회
• /
• pp.191-194
• /
• 2012

Rendering maps is an essential feature of the user interface component of a location based service (LBS) system. However, a developer may not too much worry about implementing the rendering maps part of his or her system because there are quite a few publicly available libraries that provide all kinds of functions of manipulating maps. Google Maps, Yahoo Map, Naver Map, Daum Map, and so on are example sites that provide those libraries. Rendering drawings is to indoor LBS as rendering maps is to LBS. However, there is no such thing as Google Maps that provides libraries for rendering drawings. This paper introduces a few web services and a library that is useful in developing user interfaces of indoor LBS systems.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
• /
• pp.159-162
• /
• 2002

This paper presents a modified localization scheme of a mobile robot. When it navigates, the position error of a robot is increased and doesn't go to a goal point where the robot intends to go at the beginning. The objective of localization is to estimate the position of a robot precisely. Many algorithms were developed and still are being researched for localization of a mobile robot at present. Among them, a localization algorithm named continuous localization proposed by Schultz has some merits on real-time navigation and is easy to be implemented compared to other localization schemes. Continuous Localization (CL) is based on map-matching algorithm with global and local maps using only ultrasonic sensors for making grid maps. However, CL has some problems in the process of searching the best-scored-map, when it is applied to a mobile robot. We here propose fast and powerful map-matching algorithm for localization of a mobile robot by experiments.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1993년도 한국자동제어학술회의논문집(국제학술편); Seoul National University, Seoul; 20-22 Oct. 1993
• /
• pp.491-495
• /
• 1993

In this paper, we present a methodology to model an indoor environment of a mobile robot using fuzzy numbers and to make a global map of the robot environment using graph theory. We describe any geometric primitive of robot environment as a parameter vector in parameter space and represent the ill-known values of the prameterized geometric primitive by means of fuzzy numbers restricted to appropriate membership functions. Also we describe the spatial relations between geometric prinitives using graph theory for local maps. For making the global map of the mobile robot environment, the correspondence problem between local maps is solved using a fuzzy similarity measure and a Bipartite graph matching technique.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제16권1호
• /
• pp.1-15
• /
• 2022

The MobileNetV3 is specially designed for mobile devices with limited memory and computing power. To reduce the network parameters and improve the network inference speed, a new lightweight network is proposed based on MobileNetV3. Firstly, to reduce the computation of residual blocks, a partial residual structure is designed by dividing the input feature maps into two parts. The designed partial residual structure is used to replace the residual block in MobileNetV3. Secondly, a dual-path feature extraction structure is designed to further reduce the computation of MobileNetV3. Different convolution kernel sizes are used in the two paths to extract feature maps with different sizes. Besides, a transition layer is also designed for fusing features to reduce the influence of the new structure on accuracy. The CIFAR-100 dataset and Image Net dataset are used to test the performance of the proposed partial residual structure. The ResNet based on the proposed partial residual structure has smaller parameters and FLOPs than the original ResNet. The performance of improved MobileNetV3 is tested on CIFAR-10, CIFAR-100 and ImageNet image classification task dataset. Comparing MobileNetV3, GhostNet and MobileNetV2, the improved MobileNetV3 has smaller parameters and FLOPs. Besides, the improved MobileNetV3 is also tested on CPU and Raspberry Pi. It is faster than other networks

• The KIPS Transactions:PartD
• /
• 제19D권3호
• /
• pp.229-236
• /
• 2012

The demand for map applications in both Web and mobile environments has been rapidly increased with the population of Web and smart phone usage. Web-based map applications are mostly developed on such environments as ArcGIS and MapServer and mobile map applications are developed on such API levels as Google Maps and Yahoo Maps. But many parts of map applications are still constructed by coding because these environments don't support high level of automation. Our MapAppGen that we have designed and implemented enhances the Web-based map application productivity by generating the map related modules that can be applied to the Drupal that is one of popular content management systems(CMS's). Comparing the applications that are constructed by the Drupal-supported GMap or NodeMap, the applications that are constructed by MapAppGen provide information on not only the interested geographical feature but also its related geographical features. MapAppGen uses Google Maps API and Drupal is a module-based system that supports the creation, composition and management of contents. We are now working on automatic generation of mobile map applications with MapAppGen.

• Journal of the Korea Institute of Military Science and Technology
• /
• 제19권4호
• /
• pp.508-516
• /
• 2016

When GPS signals are not available, a relative localization can be alternatively used to represent the topological relationship between mobile nodes. A relative location map of a network can be constructed by using the distance information between all the pairs of nodes in the network. If a network is large, a number of small local maps are individually constructed and are merged to obtain the whole map. However, this approach may result in a high computation and communication overhead. In this paper, we propose a reference-node selection scheme for relative localization map construction, which chooses a subset of nodes as a reference node that is supposed to construct local maps. The scheme is a greedy algorithm that iteratively chooses nodes with high degree as a reference node until the chosen local maps are successfully merged with a sufficient number of common nodes between nearby local maps. The simulation results indicate that the proposed scheme achieves higher localization accuracy with a reduced computational overhead.