• Journal of Korean Society for Geospatial Information Science
• /
• 제20권3호
• /
• pp.91-99
• /
• 2012

Jinju city is operating by selecting 8 places as the flood inundation risk area and by designating shelters on this area targeting districts damaged by typhoon and heavy rain, in the past. This study selected the research area as Nabul district and Sangpyeong district where are located in the town and that has high population density out of districts with inundation risk. The network analysis of GIS was applied to the suitability assessment on location of shelter by calculating the moving speed and the arriving time after dividing it into children, general adults, and aged people in consideration of the evacuation condition in inundation disaster. As a result, it was indicated that optimal evacuation plan time for children and aged people exceeded in getting to the shelter because of evacuation time excess and that even general adults outrun the prescribed evacuation time in some districts. Accordingly, a problem for evacuation time was improved by additionally designating 1-2 shelters to existing shelters in Nabul and Sangpyeong districts. A countermeasure is needed to reduce life and property damage in disaster occurrence by implementing the evacuation warning and the age-based evacuation plan more specifically in the future.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제27권12C호
• /
• pp.1215-1227
• /
• 2002

This paper presents a genetic algorithmic approach to shortest path (SP) routing problem. Variable-length chromosomes (strings) and their genes (parameters) have been used for encoding the problem. The crossover operation that exchanges partial chromosomes (partial-routes) at positionally independent crossing sites and the mutation operation maintain the genetic diversity of the population. The proposed algorithm can cure all the infeasible chromosomes with a simple repair function. Crossover and mutation together provide a search capability that results in improved quality of solution and enhanced rate of convergence. Computer simulations show that the proposed algorithm exhibits a much better quality of solution (route optimality) and a much higher rate of convergence than other algorithms. The results are relatively independent of problem types (network sizes and topologies) for almost all source-destination pairs.

• Journal of KIISE
• /
• 제42권2호
• /
• pp.190-202
• /
• 2015

Much research has been conducted on location-based intelligent personal assistants that can understand a user's intention by learning the user's route model and then inferring the user's destinations and routes using data of GPS and other sensors in a smartphone. The intelligence of the location-based personal assistant is contingent on the accuracy and efficiency of the real-time predictions of the user's intended destinations and routes by processing movement information based on uncertain sensor data. We propose a robust particle filter based on Dynamic Bayesian Network model to infer the user's routes. The proposed robust particle filter includes a particle generator to supplement the incorrect and incomplete sensor information, an efficient switching function and an weight function to reduce the computation complexity as well as a resampler to enhance the accuracy of the particles. The proposed method improves the accuracy and efficiency of determining a user's routes and destinations.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 한국정보통신학회 2013년도 추계학술대회
• /
• pp.324-327
• /
• 2013

Recently, due to evolving cloud computing technology, we can easily and transparently utilize both local computing resource and remote computing resource in real life. Especially, enhancing smart device technologies and network infrastructures promote an increase of needs to share files between local smart devices and cloud storages. However, since smart devices have a limited storage space, storing files on cloud storage causes a starvation problem of local storage. It means that users can face a storage-lack problem even a cloud storage service provide a huge file storing space. In this research, we propose a method to manage files between smart devices and cloud storages. Our approach calculate file usage pattern based on recently used date, and then this approach determines local files being migrated. As a result, our approach is sufficient for handling data synchronization between big data storage farm and local thin client which contains limited storage space.

• The Journal of the Korea Contents Association
• /
• 제16권12호
• /
• pp.373-382
• /
• 2016

Carbon dioxide Capture and Storage/Sequestration (CCS) technology has attracted attention as an ideal method for most carbon dioxide reduction needs. When the collected carbon dioxide is transported to storage via pipelines, the direct transport is made if the storage is close, otherwise it can also be transported via an intermediate storage hub. Determining the number and the location of the intermediate storage hubs is an important problem. A decision-making algorithm using a mathematical model for solving the problem requires considerably more variables and constraints to describe the multi-objective decision, but the computational complexity of the problem increases and it also does not guarantee the optimality. This research proposes an algorithm to determine the location and the number of the intermediate storage hub and develop a simulator for the connection network of the carbon dioxide emission site. The simulator also provides the course of transportation of the carbon dioxide. As a case study, this model is applied to Korea.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• 제18권4호
• /
• pp.183-189
• /
• 2018

With the recent advancement of vehicle wireless communication technology, many vehicular clouds have been proposed. The existing research focused on cloud services through data collection based on vehicular networks of mobile V2V (Vehicle-to-Vehicle) and V2I (Vehicle-to-Infrastructure). In this paper, we present a vehicular datacenter model that utilizes the vehicle in the parking space as a resource for the datacenter. Also, we derive resource allocation strategy based on the expected execution time considering the leave rate of each vehicle in our vehicular datacenter model. Simulation results show that our proposed resource allocation strategies outperform the existing strategy in terms of mean execution time.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• 제38권7호
• /
• pp.503-512
• /
• 2001

The general DSP algorithm, like orthogonal transform or filter processing, needs efficient hardware architecture to compute inner product. The typical MAC architecture has high cost of silicon. Because of this reason, the distributed arithmetic without multiplier is widely used for implementing inner product. This paper presents the optimization to reduce required hardware in distributed arithmetic by using extraction method of adder sharing component. The optimization process uses Boltzmann-machine which is one of the neural network. This proposed method can solve problem that is increasing complexity depending on depth of inner product and compose optimal summation-network with the minimum FA and FF in a few time. The designed DCT by using Proposed method is more efficient than a ROM-based distributed arithmetic.

• Journal of the Korean BIBLIA Society for library and Information Science
• /
• 제22권4호
• /
• pp.361-379
• /
• 2011

This paper aims to propose the most appropriate method for calculating the journal PageRank in a domestic citation database. Korean journals show relatively high journal self-citation ratios and have many outgoing citations to external journals which are not included in the domestic citation database. Because the PageRank algorithm requires recursive calculation to converge, those two characteristics of domestic citation databases must be accounted for in order to measure the citation impact of Korean journals. Therefore, two PageRank calculation methods and four formulas for self-citation adjustment have been examined and tested for KSCD journals. The results of the correlation analysis and regression analysis show that the SCImago Journal Rank formula with the cr2 type self-citation adjustment method seems to be a more appropriate way to measure the relative impact of domestic journals in the Korean Science Citation Database.

• Journal of Korea Game Society
• /
• 제14권5호
• /
• pp.35-42
• /
• 2014

In the market of First Person Shooter (FPS) games, Massively Multi-player Online FPS games (MMOFPS) like 'PlanetSide 2' have been popular recently. Dead reckoning has been widely used in order to mitigate the network traffic overload for the game server with hundreds or thousands of people. This paper proposes the efficient analytical method to calculate the tolerable threshold angle of moving direction, which is one of the most important factors for character status updating when dead reckoning is used in MMOFPS games. The experimental results with game testers shows that the proposed method minimizes the position error for character moving and provides natural direction updates of characters.

• The KIPS Transactions:PartC
• /
• 제13C권1호
• /
• pp.113-120
• /
• 2006

A node of mobile IPv6 moving foreign networks needs authentication process to support right services against from security threat. AAA is a trust infrastructure that authenticates, authorizes, and accounts nodes receiving a network service. And Mobile IPv6 Working Group recommends use of AAA infrastructure to authenticate mobile nodes. Event though AAA infrastructure provides strong authentication functions, it should exchange a lot of messages to authenticate mobile nodes every movement. The exchange of lots of messages causes latency and it is interfered with realization of real-time communication. This paper proposes an authentication method of improved speed using hash value of mobile node to reduce authentication latency. Directly after movement, a mobile node applying a Proposed method uses extended existing security authentication for a while and deletes the establishment latency of new security authentication. Performance evaluation of a proposed method verifies the efficiency through the analysis of cost comparison with other methods. The conclusion of performance evaluation is that the proposed method gets more 25% performance improvement than a general method when a mobile node moves another subnet.