• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.12
• /
• pp.120-127
• /
• 2008

HMIPv6 draws lots of attentions in recent years for providing an efficient handover and reducing the signaling overhead. HMIPv6 employs MAP(Mobility Anchor Point) in order to minimize a signaling overhead and a local mobility management. MAP completes an efficient mobility management in HMIPv6 network environment with frequent handover. However, HMIPv6 causes load concentration at a paricular MAP and may have unnecessary latency between HN(Mobile Node) and CN(Correspondent Node) within the same network. A MAP may also disturb the route optimization in HMIPv6 network because all packets must be transmitted through a MAP. In this paper, we propose a scheme to optimize the route in HMIPv6 networks according to MAP load. We configure a threshold in order to support the better service into MAP domain. The packets do not pass through MAP and are directly transmitted to AR(Access Router) if the number of current MNs attached to the MAP exceed the desired threshold. We simulate the performance of the proposed scheme and compare with HMIPv6. Resultly, the proposed scheme reduces signaling costs and mitigates concentration of a paticular MAP as well.

• Journal of the Korean Mathematical Society
• /
• v.35 no.4
• /
• pp.803-829
• /
• 1998

We give general fixed point theorems for compact multimaps in the "better" admissible class $B^{K}$ defined on admissible convex subsets (in the sense of Klee) of a topological vector space not necessarily locally convex. Those theorems are used to obtain results for $\Phi$-condensing maps. Our new theorems subsume more than seventy known or possible particular forms, and generalize them in terms of the involving spaces and the multimaps as well. Further topics closely related to our new theorems are discussed and some related problems are given in the last section.n.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2000.04a
• /
• pp.389-392
• /
• 2000

Gouge-free tool-path generation is an important issue in mold & die machining and researches on cutter interference avoidance can be found in many articles. One of the various methods is construction of tool-offlet surface or cutter-location (CL) surface on which the cutter-center point (CL-point) locates. Provided that the CL surface is represented in a suitable form, cutter-interference avoidance can be performed without the burden of computing CL data for every cutter-contact (CC) point. In the paper, various methods of constructing a CL surface in the z-map form are presented, where z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z［i,j］.

• Journal of the Korean Mathematical Society
• /
• v.45 no.1
• /
• pp.1-27
• /
• 2008

We introduce a new concept of convex spaces and a multimap class K having certain KKM property. From a basic KKM type theorem for a K-map defined on an convex space without any topology, we deduce ten equivalent formulations of the theorem. As applications of the equivalents, in the frame of convex topological spaces, we obtain Fan-Browder type fixed point theorems, almost fixed point theorems for multimaps, mutual relations between the map classes K and B, variational inequalities, the von Neumann type minimax theorems, and the Nash equilibrium theorems.

• Journal of Korean Institute of Industrial Engineers
• /
• v.26 no.4
• /
• pp.325-335
• /
• 2000

Gouge-free tool-path generation is an important issue in mold & die machining and researches on cutter interference avoidance can be found in many articles. One of the various methods is construction of tool-offset surface of cutter-location (CL) surface on which the cutter-center point (CL-point) locates. Provided that the CL surface is represented in a suitable form, cutter-interference avoidance can be performed without the burden of computing CL data for every cutter-contact (CC) point. In the paper, various methods of constructing a CL surface in the z-map form are presented, where z-map is a special form of discrete nonparametric representation in which the height values at grid points on the xy-plane are stored as a 2D array z[i,j].

• Korean Journal of Remote Sensing
• /
• v.23 no.5
• /
• pp.455-464
• /
• 2007

Lee(2007) suggested the Point-Jacobian iteration MAP estimation(PJIMAP) for noise removal of the images that are corrupted by multiplicative speckle noise. It is to find a MAP estimation of noisy-free imagery based on a Bayesian model using the lognormal distribution for image intensity and an MRF for image texture. When the image intensity is logarithmically transformed, the speckle noise is approximately Gaussian additive noise, and it tends to a normal probability much faster than the intensity distribution. The MRF is incorporated into digital image analysis by viewing pixel types as states of molecules in a lattice-like physical system. In this study, the MAP estimation is computed by the Point-Jacobian iteration using adaptive parameters. At each iteration, the parameters related to the Bayesian model are adaptively estimated using the updated information. The results of the proposed scheme were compared to them of PJIMAP with SAR simulation data generated by the Monte Carlo method. The experiments demonstrated an improvement in relaxing speckle noise and estimating noise-free intensity by using the adaptive parameters for the Ponit-Jacobian iteration.

• Journal of KIBIM
• /
• v.11 no.4
• /
• pp.1-9
• /
• 2021

Comparing to general scanning data, the 3D digital map for large construction sites and complex buildings consists of millions of points. The large construction site needs to be scanned multiple times by drone photogrammetry or terrestrial laser scanner (TLS) survey. The scanned point cloud data are required to be registrated with high resolution and high point density. Unlike the registration of 2D data, the matrix of translation and rotation are used for registration of 3D point cloud data. Archiving high accuracy with 3D point cloud data is not easy due to 3D Cartesian coordinate system. Therefore, in this study, iterative closest point (ICP) registration method for improve accuracy of 3D digital map was employed by different overlap ratio on 3D digital maps. This study conducted the accuracy test using different overlap ratios of two digital maps from 10% to 100%. The results of the accuracy test presented the optimal overlap ratios for an ICP registration method on digital maps.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.9
• /
• pp.1814-1821
• /
• 2002

NC cutting simulation is an important factor in the development of products. The geometric modelling of cutter swept surface should be done in NC cutting simulation. A part of cutter swept surface is a ruled surface blended with silhouette curve and cutter path. Finding an intersection point between cutter swept surface and a line is one of major problems in Z-map based cutting simulation. In this paper, cutter swept surface is defined parametrically and it's intersection point with Z-map is found in an exact form. Triangular grid Z-map based 3-axis NC cutting simulation is performed.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.9C
• /
• pp.860-867
• /
• 2003

In this paper, an efficient core point detection method using orientation pattern labeling is proposed in fingerprint image. The core point, which is one of the singular points in fingerprint image, is used as the reference point in the most fingerprint recognizing system. Therefore, the detection of the core point is the most essential step of the fingerprint recognizing system, it can affect in the whole system performance. The proposed method could detect the position of the core point by applying the labeling method for the directional pattern which is come from the distribution of the ridges in fingerprint image and applying detailed algorithms for the decision of the core point's position. The simulation result of proposed method is better than the result of Poincare index method and the sine map method in executing time and detecting rate. Especially, the Poincare index method can't detect the core point in the detection of the arch type and the sine map method takes too much times for executing. But the proposed method can overcome these problems.

• Honam Mathematical Journal
• /
• v.35 no.4
• /
• pp.717-727
• /
• 2013

In this paper, we study on a higher order extremal problem relating the Ahlfors map associated to the pair of a finitely connected domain in the complex plane and a point there. We show the power of the Ahlfors map with some error term which is conformally equivalent maximizes any higher order derivative of holomorphic functions at the given point in the domain.