• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.227-236
• /
• 2005

Hierarchical Prefix Delegation (HPD) protocol refers to a type of solution to problems inherent in non-optimal routing which occurs with Network Mobility (NEMO) basic solution. However, because HPD cannot improve the micro-mobility Problems, Problem surfaces each time Mobile Network Node (MNN) changes the attachment point; as happens also in a Mobile IPv6 (MIPv6) protocol in sen야ng Binding Update (BU) messages to Home Agent (HA) / Correspondent Nodes(CNs) By applying Hierarchical Mobile IPv6 protocol concept to HPD, this study Proposes an algorithm for effectively handling micro-mobility problems which occur with HPD in a nested NEMO environment. By sending BU only to nearby Mobility Anchor Point(MAP) during MNN location change within a MAP's domain, the proposed protocol will alleviate service disruption delays and signaling loads during the handover process, overcoming the limitations of HPD.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.1 s.39
• /
• pp.147-155
• /
• 2006

Hierarchical Prefix Delegation (HPD) protocol refers to a type of solution to problems inherent in non-optimal routing which occurs with Network Mobility (NEMO) basic solution. However, because HPD cannot improve the micro-mobility problems, problem surfaces each time Mobile Network Node (MNN) changes the attachment point; as happens also in a Mobile IPv6 (MIPv6) protocol in sending Binding Update (BU) messages to Home Agent (HA) / Correspondent Nodes(CNs). By applying Hierarchical Mobile IPv6 protocol concept to HPD, this study proposes an algorithm for effectively handling micro-mobility problems which occur with HPD in a nested NEMO environment. By sending BU only to nearby Mobility Anchor Point(MAP) during MNN location change within a MAP's domain, the proposed protocol will alleviate service disruption delays and signaling loads during the handover process, overcoming the limitations of HPD.

• KIPS Transactions on Software and Data Engineering
• /
• v.4 no.10
• /
• pp.439-446
• /
• 2015

Recently, semantic trajectories which combine GPS positions and POIs(Point of Interests) become more popular in order to expand location based services. To construct semantic trajectories, the existing algorithms exploit the extent information of POIs described as polygons and find overlapping regions between GPS positions and the extents. However, the algorithms are not applicable in the condition where the extent information is not provided such as in Google Map, Naver Map, OpenStreetMap and most of the open geographic information systems. In this paper, we provide a novel algorithm to construct semantic trajectories only with GPS positions and POI points but without POI extents.

• Smart Structures and Systems
• /
• v.29 no.6
• /
• pp.777-783
• /
• 2022

Even though several deep learning-based methods have been applied in the field of acoustic source localization, the previous works have only been conducted using the two-dimensional representation of the beamforming maps, particularly with the planar array system. While the acoustic sources are more required to be localized in a spherical microphone array system considering that we live and hear in the 3D world, the conventional 2D equirectangular map of the spherical beamforming map is highly vulnerable to the distortion that occurs when the 3D map is projected to the 2D space. In this study, a 3D deep learning approach is proposed to fulfill accurate source localization via distortion-free 3D representation. A target function is first proposed to obtain 3D source distribution maps that can represent multiple sources' positional and strength information. While the proposed target map expands the source localization task into a point-wise prediction task, a PointNet-based deep neural network is developed to precisely estimate the multiple sources' positions and strength information. While the proposed model's localization performance is evaluated, it is shown that the proposed method can achieve improved localization results from both quantitative and qualitative perspectives.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.207-213
• /
• 2006

Mobility Anchor points are used for the mobility management in HMIPv6 networks. Currently a mobile node selects the MAP farthest away from itself as a new MAP among available candidates when it undertakes a macro hand off. With this technique, however, the traffic tends to be concentrated at a MAP with the largest domain size and the communication cost increases due to the distance between the mobile node and the MAP. In this work, we propose a novel scheme to select a MAP to minimize the communication cost, taking the mobile node's moving speed and data rate into account. To come up with the scheme we analyses the communication analyses the communication cost into the binding update cost and the data packet delivery cost, and derive an equation representing the optimal MAP domain size to minimize the total cost.

• Annual Conference of KIPS
• /
• 2003.11b
• /
• pp.899-902
• /
• 2003

무선 환경에서의 실시간 서비스의 확대와 노드의 이동성 증가에 따라 handover 시 발생되는 패킷 손실과 지연으로 인한 실시간 서비스의 중단이 해결해야 할 중요한 문제점이 되고 있다. 본 논문에서는 IETF (Internet Engineering Task Force)의 중요한 마이크로 이동성 프로토콜인 HMIPv6의 기본 동작을 설명하고, 여전히 문제점으로 남아있는 Inter-MAP (Mobility Anchor Point) handover의 성능을 향상시키기 위한 Dynamic MAP Switching handover 알고리듬을 제안한다. 제안한 알고리듬은 인접한 MAP 도메인을 중첩되게 설정하고 Inter-MAP handover가 발생되기 전에 미리 MAP을 switching한다. 따라서 Inter-MAP handover가 발생하지 않도록 함으로써 handover 시 발생하는 데이터의 손실 및 지연을 감소시킬 수 있다. 제안된 알고리듬의 성능 향상은 산술적 분석을 통하여 검증한다.

• Journal of KIISE
• /
• v.44 no.6
• /
• pp.643-648
• /
• 2017

Among Wi-Fi based indoor positioning systems, fingerprinting localization is the most common technique with high precision. However, construction of the initial radio map and the update process require considerable labor and time effort. To address this problem, we propose an efficient method that constructs the initial radio map at each vertex based on a graph. In addition, we introduce a method to update the radio map automatically by mapping signal data acquired from users to the reference point created on each edge. Since the proposed method collects signal data manually only at the vertex of the graph to build the initial radio map and updates it automatically, our proposed method can dramatically reduce labor and time effort, which are the disadvantages of the conventional fingerprinting method. In our experimental study, we show validity of our radio map update method by comparing with the actual reference point data. We also show that our proposed method is able to construct the radio map with an accuracy of about 3.5m by automatically updating the radio map.

• KSCI Review
• /
• v.14 no.1
• /
• pp.265-271
• /
• 2006

In this paper, we propose a new automatic fingerprint identification system that identifies individuals in large databases. The algorithm consists of three steps: preprocessing, classification, and matching, in the classification, we present a new classification technique based on the statistical approach for directional image distribution. In matching, we also describe improved minutiae candidate pair extraction algorithm that is faster and more accurate than existing algorithm. In matching stage, we extract fingerprint minutiaes from its thinned image for accuracy, and introduce matching process using minutiae linking information. Introduction of linking information into the minutiae matching process is a simple but accurate way, which solves the problem of reference minutiae pair selection in comparison stage of two fingerprints quickly. This algorithm is invariant to translation and rotation of fingerprint. The proposed system was tested on 1000 fingerprint images from the semiconductor chip style scanner. Experimental results reveal false acceptance rate is decreased and genuine acceptance rate is increased than existing method.

• Bulletin of the Korean Mathematical Society
• /
• v.60 no.3
• /
• pp.659-675
• /
• 2023

Let K be an algebraically closed field of characteristic 0 and let f be a non-fibered planar quadratic polynomial map of topological degree 2 defined over K. We assume further that the meromorphic extension of f on the projective plane has the unique indeterminacy point. We define the critical pod of f where f sends a critical point to another critical point. By observing the behavior of f at the critical pod, we can determine a good conjugate of f which shows its statue in GIT sense.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.15 no.2
• /
• pp.207-213
• /
• 1997

The purpose of this study is to aim at presenting efficient technique of 3-D Terrain Modelling through multilateral approach methods and to compare with raw data, using low-densed randomly located point data. The subject religion of this study are selected two sites and take into consideration for degree of freedom about low-densed randomly located point data. The result of this study by precision analysis of digital cartographic map-ping using low-densed randomly located point data bave shown that . First, making digital cartographic map, the technique of making it using low-desned randomly located point data by TIN-based results to good and fast run-time in A and B sites all together. Second, the visualization analysis results of digital cartographic map using TIN and GRID-based terrain modeling techniqus similar exacts A and B sites, but the terrain modeling techniqus by TIN-based are small data size than GRID-based with the data with the data size of saving with DXF files. Third, making digital catographic map using terrain modeling techniques by Grid-based, the standard errors of low-densed randomly located point data and interpolated data using gridding method have more good results by radial basis function interpolation techniques at A and B sites all together.