• Spatial Information Research
• /
• v.20 no.4
• /
• pp.93-101
• /
• 2012

Due to complexity of indoor space, the demand of Location Based Services (LBS) in indoor space is increasing as well as outdoor. However, it includes privacy problems of exposing personal location. Location K-anonymity technology is a method to solve the privacy problems with cloaking their locations by Anonymized Spatial Region(ASR). It guarantees K users within a region containing the location of a given user. However previous researches have dealt the problems based on Euclidean distance in outdoor space, and cannot be applied in indoor space where there are constraints of movement such as walls. For this reason, we propose in this paper a K-anonymity for cloaking indoor location in consideration of structures and representation of indoor space. The basic concept of our approach is to introduce a hierarchical structure as ASR for including K-1 users for cloaking their locations. We also proposed a cost model by K and attributes of hierarchical structure to analyze the performance of the method.

• Journal of Computing Science and Engineering
• /
• v.4 no.2
• /
• pp.173-187
• /
• 2010

Recent technological advances in mobile communication systems have made explosive growth in the number of mobile device users worldwide. One of the most important issues in designing a mobile computing system is location management of users. The hierarchical systems had been proposed to solve the scalability problem in location management. The scalability problem occurs when there are too many users for a mobile system to handle, as the system is likely to react slow or even get down due to late updates of the location databases. In this paper, we propose a top-down clustering algorithm for hierarchical location database systems in a wireless network. A hierarchical location database system employs a tree structure. The proposed algorithm uses a top-down approach and utilizes the number of visits to each cell made by the users along with the movement information between a pair of adjacent cells. We then present a modified algorithm by incorporating the exhaustive method when there remain a few levels of the tree to be processed. We also propose a capacity constraint top-down clustering algorithm for more realistic environments where a database has a capacity limit. By the capacity of a database we mean the maximum number of mobile device users in the cells that can be handled by the database. This algorithm reduces a number of databases used for the system and improves the update performance. The experimental results show that the proposed, top-down, modified top-down, and capacity constraint top-down clustering algorithms reduce the update cost by 17.0%, 18.0%, 24.1%, the update time by about 43.0%, 39.0%, 42.3%, respectively. The capacity constraint algorithm reduces the average number of databases used for the system by 23.9% over other algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.6A
• /
• pp.361-370
• /
• 2003

This paper attempts to improve the existing architecture of location register for location management in Private Network to Network Interface(PNNI)-based wireless ATM networks. Our approach enhances the hierarchical architecture of location registers based on a PNNI hierarchical architecture, which is referred to as the logical hierarchy architecture of location registers. This paper introduces a logical hierarchy architecture for location registers to reduce the cost of their location management. This logical hierarchy architecture of location registers begins with the lowest level physical location registers that are organized into clusters called logical groups. These logical groups are then represented in higher layers by logical nodes. These logical nodes are again grouped into clusters that are treated as single nodes by the next higher layer. In this way, all location registers are included in this tree-type logical hierarchy architecture. Compared with the existing physical hierarchy architecture of location registers, the analysis results show that the proposed logical hierarchy architecture can reduce the number of databases and thereby the average total location management cost.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.80-89
• /
• 2001

The development in the mobile computing systems have arisen new and previously unforeseen problems, such as problems in information management of mobile host, disconnection of mobile host and low bandwidths of wireless communications. Especially, location information management strategy of mobile host results in an increased overhead in mobile computing systems. Due to the mobility of the mobiles host, the changes in the mobile host's address depends on the mobile host's location, and is maintained by mapping physical address on virtual address, Since previously suggested several strategies for mapping method between physical address and virtual address did not tackle the increase of mobile host and distribution of location information, it was not able to support the scalability in mobile computing systems. Thus, to distribute the location inrormation, we propose an advanced n-depth LiST (Location information Search Tree) and the parallel location search and update strategy based on the advanced n-depth LiST. The advanced n-depth LiST is logically a hierarchical structure that clusters the location information server by ring structure and reduces the location information search and update cost by parallel seatch and updated method. The experiment shows that even though the distance of two MHs that communicate with each other is large, due to the strnctural distribution of location information, advanced n-depth LiST results in good performance. Moreover, despite the reduction in the location information search cost, there was no increase in the location information update cost.

• Journal of Korea Water Resources Association
• /
• v.42 no.3
• /
• pp.177-190
• /
• 2009

Rehabilitation projects for old water mains typically require considerable capital investments. One of the economical ways of pursuing the rehabilitation projects is to focus on a specific area within the entire region under management. In this paper the hierarchical clustering methods that analyze spatial inter-relationship of location data are applied to about 8,000 water leak location data recorded in a case study area from 1992 to 1997. Among the hierarchical clustering methods Single, Complete, and Average Linkage Methods are used to identify clusters of the water leak locations and to divide the area according to the defined clusters. By comparing the clusters identified by the clustering methods, the best clustering method for the case study area is suggested. Prioritization of the area for maintenance is obtained based on the water leak incident intensity for the clustered area using the suggested best clustering method.

• Journal of Korea Multimedia Society
• /
• v.19 no.12
• /
• pp.1960-1969
• /
• 2016

In this paper, we propose an automatic hierarchical organ segmentation method on abdominal CT images. First, similar atlases are selected using bone-based similarity registration and similarity of liver, kidney, and pancreas area. Second, each abdominal organ is roughly segmented using image-based similarity registration and intensity-based locally weighted voting. Finally, the segmented abdominal organ is refined using mask-based affine registration and intensity-based locally weighted voting. Especially, gallbladder and pancreas are hierarchically refined using location information of neighbor organs such as liver, left kidney and spleen. Our method was tested on a dataset of 12 portal-venous phase CT data. The average DSC of total organs was $90.47{\pm}1.70%$. Our method can be used for patient-specific abdominal organ segmentation for rehearsal of laparoscopic surgery.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2008.10a
• /
• pp.131-135
• /
• 2008

In this paper, we deal with a hierarchical location-allocation problem in designing the broadband convergence networks (BcN). The objective is to minimize the total cost of switch and cable while satisfying the quality of service (QoS). We formulate the problem as an integer programming model and develop the Tabu Search (TS) heuristic algorithm to find a good feasible solution within a reasonable time limit. Initial solution is obtained by using the tree structure. Three neighborhood generation mechanisms are used by local search heuristic: insertion, switch up, and switch down. In order to demonstrate the effectiveness of the proposed algorithm, we generate lower bounds from nonlinear QoS relaxation problem. We present promising computational results of the proposed solution procedures.

• Journal of Ocean Engineering and Technology
• /
• v.19 no.4 s.65
• /
• pp.56-65
• /
• 2005

This study aims at selecting optimum locations for cruise terminal This study uses the HFP(Hierarchical Fuzzy Process) based on the fuzzy theory, which is known to be effective in evaluating a complicated system whose evaluation attribut are vague or overlapping with one another such as the elements in selecting cruise terminal location and in treating both qualitative and quantitative data.

• Journal of the Korea Safety Management & Science
• /
• v.1 no.1
• /
• pp.145-157
• /
• 1999

In this paper, a research on the structure and the network configuration of the location register(LR), which database of new locations and service informations of subscribers according to the movement of subscribers in personal communication system(PCS). since the traditional PCS manages all the databases with the location informations as a centralized type. The service informations of the subscribers are centrally controlled by the HLR. So there have been the heavy signal traffic and the call setup delay. In order to relieve such problem, the proposed types of the configurations are the distributed type of PCS scheme and the hierarchical PCS scheme. In the distributed scheme, each PCS has its own LR and in the hierarchical PCS scheme, several LR are grouped to from a layer so that overall structure is a tree style.

• Journal of the Korean Society of Safety
• /
• v.32 no.3
• /
• pp.41-47
• /
• 2017

Recent studies have shown that there are various systems which can be used to monitor hazardous area in a debris flow location, but lack of methodological research on the exact location where each instrument should be installed has hindered the success of this systems. The objective of this study is to suggest the measurement system for monitoring debris-flow and propose the effective method to determine location of measurement system. Previously studied, from 1991 to 2015, were referred and the applied ratio of every instrument was investigated. The measurement information was divided into 8 categories including rainfall, debris-flow velocity, displacement, fluid pore pressure, ground vibration, image processing, impact force and peak flow depth. The result of this study revealed that the most applied instruments to be rain gauge and geophone for measuring average rainfall and ground vibration respectively. The Analytic Hierarchical Process (AHP) method was selected to determine installation location of instrument and the weighting factors were estimated through fine content, soil thickness, porosity, shear strength, elastic modulus, hydraulic conductivity and saturation. The soil thickness shows highest weights and the fine content relatively demonstrates lowest weights. The score of each position can be calculated through the weighting factors and the lowest score position can be judged as the weak point. The weak point denotes the easily affecting area and thus, the point is suitable for installing the measurement system. This study suggests a better method for safely managing the debris-flow through a precise location for installing measurement system.