• The Journal of the Korea institute of electronic communication sciences
• /
• v.5 no.6
• /
• pp.651-656
• /
• 2010

In the homepage of 16 municipal provincial office of education, school information service displays text-based results through search step or presents the simple information of the selected area when an area is clicked on the static image map. And it has several problems such as server load and slow transfer speed by the search of the synchronous transfer. Thus, in this study, we used the open API of Google map to provide location-based school information and implemented the mash up service for school information with the Ajax program of asynchronous transfer to reduce server load and to increase transmission speed. This service gives the efficiency and convenience to students, teachers, parents and education family members of various levels because it includes the location with school information on a dynamic map.

• Nuclear Engineering and Technology
• /
• v.56 no.4
• /
• pp.1153-1164
• /
• 2024

In recent years, unmanned ground vehicles (UGVs) have been used to search for lost or stolen radioactive sources to avoid radiation exposure for operators. To achieve autonomous localization of radioactive sources, the UGVs must have the ability to automatically determine the next radiation measurement location instead of following a predefined path. Also, the radiation field of radioactive sources has to be reconstructed or inverted utilizing discrete measurements to obtain the radiation intensity distribution in the area of interest. In this study, we propose an effective source localization framework and method, in which UGVs are able to autonomously explore in the radiation area to determine the location of radioactive sources through an iterative process: path planning, radiation field reconstruction and estimation of source location. In the search process, the next radiation measurement point of the UGVs is fully predicted by the design path planning algorithm. After obtaining the measurement points and their radiation measurements, the radiation field of radioactive sources is reconstructed by the Gaussian process regression (GPR) model based on machine learning method. Based on the reconstructed radiation field, the locations of radioactive sources can be determined by the peak analysis method. The proposed method is verified through extensive simulation experiments, and the real source localization experiment on a Cs-137 point source shows that the proposed method can accurately locate the radioactive source with an error of approximately 0.30 m. The experimental results reveal the important practicality of our proposed method for source autonomous localization tasks.

• Journal of the Korea Society for Simulation
• /
• v.31 no.3
• /
• pp.55-61
• /
• 2022

Currently police and fire departments use a Network/Wifi/GPS based emergency location positioning system established by mobile carriers to directly link with the device of the people who request the rescue to accurately position the expected location in the call area. However in the case of mountain rescue it is difficult to rescue the victim in golden time because the location of the search area cannot be limited when the victim is located in a radio shadow area of the mountain or the device power is off and this situation become worse if victim fail to report 911 by himself due to the injury. In this paper, we are expected to solve the previous problem by propose the mobile telecommunication forensic simulator consist of time series of cell information, human mobility model which include some general and specific features (age, gender, behavioral characteristics of victim, etc.) and intelligent infer system. The results of analysis appear in heatmap of polygons on the map based on the probability of the expected location information of the victim. With this technology we are expected to contribute to rapid and accurate lifesaving by reducing the search area of rescue team.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.31 no.4
• /
• pp.259-267
• /
• 2013

GIS-based web map service is all the more accessible to the public. Among others, location query services are most frequently utilized, which are currently restricted to only one keyword search. Although there increases the demand for the service for querying multiple keywords corresponding to sequential activities(banking, having lunch, watching movie, and other activities) in various locations POI, such service is yet to be provided. The objective of the paper is to develop the k-IPS algorithm for quickly and accurately querying multiple POIs that internet users input and locating the search outcomes on a web map. The algorithm is developed by utilizing hierarchical tree structure of $R^*$-tree indexing technique to produce overlapped geometric regions. By using recursive $R^*$-tree index based spatial join process, the performance of the current spatial join operation was improved. The performance of the algorithm is tested by applying 2, 3, and 4 multiple POIs for spatial query selected from 159 keyword set. About 90% of the test outcomes are produced within 0.1 second. The algorithm proposed in this paper is expected to be utilized for providing a variety of location-based query services, of which demand increases to conveniently support for citizens' daily activities.

• Journal of Navigation and Port Research
• /
• v.47 no.6
• /
• pp.401-409
• /
• 2023

This study compared and analyzed the performance of a distributed area search algorithm and a distributed probability search algorithm based on information exchange between ships. The distributed algorithm is a method that can search for an optimal avoidance route based on information exchange between ships. In the distributed area search algorithm, only a ship with the maximum cost reduction among neighboring ships has priority, so the next expected location can be changed. The distributed stochastic search algorithm allows a non-optimal value to be searched with a certain probability so that a new value can be searched. A circular-based ship collision avoidance model was used for the ship-to-ship collision avoidance experiment. The experimental method simulated the distributed area search algorithm and the distributed stochastic search algorithm while increasing the number of ships from 2 to 50 that were the same distance from the center of the circle. The calculation time required for each algorithm, sailing distance, and number of message exchanges were compared and analyzed. As a result of the experiment, the DSSA(Distributed Stochastic Search Algorithm) recorded a 25%calculation time, 88% navigation distance, and 84% of number of message exchange rate compared to DLSA.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.6
• /
• pp.63-68
• /
• 2022

Currently, there are a total of 68 emergency rooms based on Seoul, South Korea, and there is a portal site that allows you to inquire the location of the emergency room, but it is difficult to use in an actual emergency situation because it consists of selecting a gu and a self-governing dong. In addition, it may be more efficient to go to the emergency room directly because you may miss the golden time necessary for survival in a situation where you call 119 and wait for the rescue team. Therefore, in this paper, we propose a service that can quickly search the location of the emergency room based on a specific location through various functions supported by MongoDB. After downloading emergency room location data based on Seoul Metropolitan City, storing it in MongoDB, processing the data through various processing techniques, and applying a spatial index, you can query the emergency room based on distance from a specific location in real time.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.1-6
• /
• 2020

Fast service access involves keeping track of the location of mobile users, while they are moving around the mobile network for a satisfactory level of QoS (Quality of Service) in a cost-effective manner. The location databases are used to keep track of Mobile Terminals (MT) so that incoming calls can be directed to requested mobile terminals at all times. MT reporting cell system used in location management is to designate each cell in the network as a reporting cell or a non-reporting cell. Determination of an optimal number of reporting cells (or reporting cell configuration) for a given network is reporting cell planning (RCP) problem. This is a difficult combinatorial optimization problem which has an exponential complexity. We can see that a cell in a network is either a reporting cell or a non-reporting cell. Hence, for a given network with N cells, the number of possible solutions is 2^N. We propose a biogeography based optimization (BBO) for design of mobile station location management system in wireless communication network. The number and locations of reporting cells should be determined to balance the registration for location update and paging operations for search the mobile stations to minimize the cost of system. Experimental results show that our proposed BBO is a fairly effective and competitive approach with respect to solution quality for optimally designing location management system because BBO is suitable for combinatorial optimization and multi-functional problems.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2004.11a
• /
• pp.189-192
• /
• 2004

The present much information of internet has to exist for innumerable user so that couldn't satisfy there's a variety of demand. so they have a demerit that search unnecessary information. However Web service is different with other mass media because It is possible that enable Mass Customization for Personalization strategy. In The paper suggest reasoning system that detect user connection location by using indirect abstraction techniques a kind of Case-based reasoning techniques.

• Journal of Korean Society of Rural Planning
• /
• v.20 no.4
• /
• pp.277-284
• /
• 2014

Recently the use of smart phones and mobile devices is increasing rapidly, data search and retrieval in the mobile environments are generalized. There are only few mobile applications available in the area of agriculture while huge amount of new applications are developed and uploaded. The purpose of this study was to develop the android based mobile application for providing agricultural infrastructure and disaster information. The mobile application was designed through the database establishment and management system, server management system, and mobile application development. The database is composed of weather data, agricultural infrastructure data, and agricultural disaster data. By developing the mobile application which provides agricultural infrastructure information, it is expected to improve the accessibility to agricultural information and mitigate the agricultural disaster damages.

• International conference on construction engineering and project management
• /
• 2011.02a
• /
• pp.17-22
• /
• 2011

A considerable number of construction disasters occur on pathways. Safety management is usually performed on construction sites to prevent accidents in activity areas. This means that the safety management level of hazards on pathways is relatively minimized. Many researchers have noted that hazard identification is fundamental to safety management. Thus, algorithms for helping safety managers to identify hazardous areas are developed using automated data collection technology. These algorithms primarily search for potential hazardous areas by comparing workers' location logs based on a real-time location system and optimal routes based on BIM. Potential hazardous areas are filtered by identified hazardous areas and activity areas. After that, safety managers are provided with information about potential hazardous areas and can establish proper safety countermeasures. This can help to improve safety on construction sites.