• Journal of Soil and Groundwater Environment
• /
• v.19 no.1
• /
• pp.26-33
• /
• 2014

Uncertainty associated with a sampling method is very high in evaluating the degree of site contamination; therefore, such uncertainty affects the reliability of precise investigation and remediation verification. In particular, in evaluating a site for a small-sized filling station, underground utilities, such as connection pipes and oil storage tanks, make grid-unit sampling impossible and the resulting increase in uncertainty is inevitable. Accordingly, this study quantified the uncertainty related to the evaluation of the degree of contamination by total petroleum hydrocarbon and by benzene, toluene, ethylene, and xylene. When planning a grid aimed at detecting a hot spot, major factors that influence the increase in uncertainty include grid interval and the size and shape of the hot spot. The current guideline for soil sampling prescribes that the grid interval increase in proportion to the area of the evaluated site, but this heightens the possibility that a hot spot will not be detected. In evaluating a site, therefore, it is crucial to estimate the size and shape of the hot spot in advance and to establish a sampling plan considering a diversity of scenarios.

• The KIPS Transactions:PartA
• /
• v.14A no.2
• /
• pp.99-106
• /
• 2007

Grid computing, a mechanism which uses heterogeneous systems that are geographically distributed, draws attention as a new paradigm for the next generation operation of parallel and distributed computing. The importance of grid computing concerning communication cost is very huge because grid computing furnishes uses with integrated virtual computing service, in which a number of computer systems are connected by a high-speed network. Therefore, to reduce the execution time, the scheduling algorithm in grid environment should take communication cost into consideration as well as computing ability of resources. However, most scheduling algorithms have not only ignored the communication cost by assuming that all tasks were dealt in one cluster, but also did not consider the overhead of communication cost when the tasks were processed in a number of clusters. In this paper, the functions of original scheduling algorithms are analyzed. More importantly, the functions of algorithms are compared and analyzed with consideration of communication cost within the co allocation environment, in which a task is performed separately in many clusters.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.450-456
• /
• 2006

Monte Carlo localization is known to be one of the most reliable methods for pose estimation of a mobile robot. Although MCL is capable of estimating the robot pose even for a completely unknown initial pose in the known environment, it takes considerable time to give an initial pose estimate because the number of random samples is usually very large especially for a large-scale environment. For practical implementation of MCL, therefore, a reduction in sample size is desirable. This paper presents a novel approach to reducing the number of samples used in the particle filter for efficient implementation of MCL. To this end, the topological information generated through the thinning technique, which is commonly used in image processing, is employed. The global topological map is first created from the given grid map for the environment. The robot then scans the local environment using a laser rangefinder and generates a local topological map. The robot then navigates only on this local topological edge, which is likely to be similar to the one obtained off-line from the given grid map. Random samples are drawn near the topological edge instead of being taken with uniform distribution all over the environment, since the robot traverses along the edge. Experimental results using the proposed method show that the number of samples can be reduced considerably, and the time required for robot pose estimation can also be substantially decreased without adverse effects on the performance of MCL.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.45 no.3
• /
• pp.1-6
• /
• 2008

Data grid shares distributed large data via wide-band network. Such grid environment consumes much time for large data transmission. Because it is implemented on internet as physical network. Many replication strategies were proposed for solving this problem, but they are not optimal in real Data grid environments. Because they were proposed that based on logical topology without consideration of real internet architecture. Grid data access time is largely influenced by internet architecture as physical network of Data grid. In this paper, we propose a new data replication strategy RSIA(Replication Strategy based on Internet Architecture) based on internet architecture. The RSIA places replicas considering structural hierarchy in each element of internet, and avoid the performance bottlenecks to reduce system performance degradation when a data transfer. Through simulation, we show that the proposed RSIA data replication strategy improves the performance of Data Grid environment compared with previous strategies.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.3
• /
• pp.440-448
• /
• 2021

This paper presents problems of network technology in smart grid and implements a blockchain-based LoRa multi-hop network to solve them. Since some smart grid applications are operated in harsh environments, it is difficult to establish communication infrastructure. We propose a LoRa network with multi-hop using the Flooding routing protocol. Smart grid environment composes an independent network using various power grid protocols depending on the application. Since this has a problem that an independent infrastructure must be established for each network, a single gateway device supports multiple power grid protocols to implement a method for network integration. Lastly, the author applied Hyperledger-based blockchain to the LoRa network to ensure the integrity of data in a smart grid environment, and strengthened security by physically distributing it. After constructing the three suggestions on the actual test bed, we confirmed that the network operates normally through experiments.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.47 no.2
• /
• pp.147-154
• /
• 2024

This study focuses on the path planning algorithm for large-scale autonomous delivery using drones and robots in urban environments. When generating delivery routes in urban environments, it is essential that avoid obstacles such as buildings, parking lots, or any other obstacles that could cause property damage. A commonly used method for obstacle avoidance is the grid-based A* algorithm. However, in large-scale urban environments, it is not feasible to set the resolution of the grid too high. If the grid cells are not sufficiently small during path planning, inefficient paths might be generated when avoiding obstacles, and smaller obstacles might be overlooked. To solve these issues, this study proposes a method that initially creates a low-resolution wide-area grid and then progressively reduces the grid cell size in areas containing registered obstacles to maintain real-time efficiency in generating paths. To implement this, obstacles in the operational area must first be registered on the map. When obstacle information is updated, the cells containing obstacles are processed as a primary subdivision, and cells closer to the obstacles are processed as a secondary subdivision. This approach is validated in a simulation environment and compared with the previous research according to the computing time and the path distance.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.7
• /
• pp.370-379
• /
• 2006

Computational grid provides the environment which integrates v 따 ious computing resources. Grid environment is more complex and various than traditional computing environment, and consists of various resources where various software packages are installed in different platforms. For more efficient usage of computational grid, therefore, some kind of integration is required to manage grid resources more effectively. In this paper, a global scheduler is suggested, which integrates grid resources at meta level with applying various scheduling policies. The global scheduler consists of a mechanical part and three policies. The mechanical part mainly search user queues and resource queues to select appropriate job and computing resource. An algorithm for the mechanical part is defined and optimized. Three policies are user selecting policy, resource selecting policy, and executing policy. These can be defined newly and replaced with new one freely while operation of computational grid is temporarily holding. User selecting policy, for example, can be defined to select a certain user with higher priority than other users, resource selecting policy is for selecting the computing resource which is matched well with user's requirements, and executing policy is to overcome communication overheads on grid middleware. Finally, various algorithms for user selecting policy are defined only in terms of user fairness, and their performances are compared.

• Journal of the military operations research society of Korea
• /
• v.34 no.3
• /
• pp.53-66
• /
• 2008

Information Grid that connects Sensor Grid and Shooter Grid with network is the core infrastructure to enable the NCW concept. The U.S. DoD(Department of Defense) has developed the GIG(Global Information Grid) as the Information Grid that connects all of the DoD mission areas. Then the U.S. DoD has incrementally constructed GIG. In this respect, the case of the U.S. DoD's GIG construction refers to materializing ROK Information Grid concept. Therefore we studied the U.S. DoD's GIG construction trend and analyzed ROK's GIG construction trend. In result this paper proposes the way to develop and construct ROK's GIG.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.6
• /
• pp.1455-1461
• /
• 2015

Micro Grid is a new concept of electrical grid to solve several problems of Mega-Grid and it is under research and development at the national level around the world. With this background, Micro Grid Common Platform has been developed for interoperability technology of devices-systems in Micro Grid and securing enabler for new market. For supporting business models, Micro Grid Common Platform provides electric power information to Third-Party licensee via Open API function. Licensee, who want to develop electric power application by connecting to Micro Grid Common Platform, needs IDE(Integrated Development Environment) for service development and distribution. The paper proposes a service development tool for developing applications of Micro Grid Common Platform as a PaaS (Platform as a Service).

• The Journal of the Korea Contents Association
• /
• v.10 no.7
• /
• pp.81-87
• /
• 2010

This paper proposes a G-BLAST(BLAST using Grid Computing) system, an integrated software package for BLAST searches operated in heterogeneous distributed environment. G-BLAST employed 'database splicing' method to improve the performance of BLAST searches using exists computing resources. G-BLAST is a basic local alignment search tool of DNA Sequence using grid computing in heterogeneous distributed environment. The G-BLAST improved the existing BLAST search performance in gene sequence analysis. Also G-BLAST implemented the pipeline and data management method for users to easily manage and analyze the BLAST search results. The proposed G-BLAST system has been confirmed the speed and efficiency of BLAST search performance in heterogeneous distributed computing.