• Journal of the Korea Computer Graphics Society
• /
• v.18 no.4
• /
• pp.1-8
• /
• 2012

We present improved deformation energy to enhance the visual quality of a shape deformation technique, where we preserve the local structure of an input planar shape. The deformation energy, in general, consists of several constraints such as Laplacian coordinate constraint to preserve the quality of deformed silhouette edges, mean value coordinates and edge length constraints to preserve the quality of deformed internal shape, and user-specified position constraints to control the shape deformation. When the positions of user-specified vertices change, shape deformation techniques compute the positions of the other vertices by means of nonlinear least squares optimization to minimize the deformation energy. When a user-specified vertex changes its position rapidly, it is frequently observed that the visual quality of the deformed shape decrease rapidly, which is mainly caused by unnecessary enlargement of the Laplacian vectors and unnecessary change of the edge directions along the boundary of the shape. In this paper, we propose improved deformation energy by prohibiting the Laplacian and edge length constraints from changing unnecessarily. The proposed deformation energy incorporated with well-known optimization technique can enhance the visual quality of shape deformation along the silhouette and within the interior of the planar shape while sacrificing only a little execution time.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.37-45
• /
• 2015

In modern electronic warfare systems, a demand on the more accurate estimation method based on TDOA and FDOA has been increased. TDOA/FDOA localization consists of two-stage procedures: the extraction of information from signals and the estimation of emitter location. Various algorithms based on CAF(complex ambiguity function), which is known as a basic method, has been presented in the area of extractions. When we extract TDOA and FDOA information using a conventional method based on the CAF algorithm from communication signals, considerably long integration time is required for the accurate position estimation of an unknown emitter far from sensors more than 300 km. Such long integration time yields huge amount of transmission data from sensors to a central processing unit, resulting in heavy computiational complexity. Therefore, we theoretically analyze the integration time for TDOA/FDOA information using CRLB and propose a two-stage global optimization algorithm which can minimize the transmission time and a computational complexity. The proposed method is compared with the conventional CAF-based algorithms in terms of a computational complexity and the CRLB to verify the estimation performance.

• The KIPS Transactions:PartC
• /
• v.19C no.3
• /
• pp.191-208
• /
• 2012

Proxy Mobile IPv6 (PMIPv6) is designed to provide network-based mobility management support to an MN without any involvement of the MN in the mobility related signalling, hence, the proxy mobility entity performs all related signalling on behalf of the MN. The new principal functional entities of PMIPv6 are the local mobility anchor (LMA) and the mobile access gateway (MAG). In PMIPv6, all the data traffic sent from the MN gets routed to the LMA through a tunnel between the LMA and the MAG, but it still has the single point of failure (SPOF) and bottleneck state of traffic. To solve these problems, various approaches directed towards PMIPv6 performance improvements such as route optimization proposed. But these approaches add additional signalling to support MN's mobility, which incurs extra network overhead and still has difficult to apply to multiple-LMA networks. In this paper, we propose a improved route optimization in PMIPv6-based multiple-LMA networks. All LMA connected to the proxy internetworking gateway (PIG), which performs inter-domain distributed mobility control. And, each MAG keeps the information of all LMA in PMIPv6 domain, so it is possible to perform fast route optimization. Therefore, it supports route optimization without any additional signalling because the LMA receives the state information of route optimization from PIG.

• Journal of KIISE:Software and Applications
• /
• v.32 no.12
• /
• pp.1283-1291
• /
• 2005

One of the problems in boosting Java performance using a Just-in-Time (JIT) compiler is removing redundant array bound checks. In conventional static compilers, many powerful algorithms have been developed, yet they are not directly applicable to JIT compilation where the compilation time is part of the whole running time. In the current JIT compilers, we tan use either a naive algorithm that is not powerful enough or an aggressive algorithm which requires the transformation into a static single assignment (SSA) form of programs (and back to the original form after optimization), thus causing too much overhead not appropriate for JIT compilation This paper proposes a new algorithm based on an inequality graph which can eliminate array bounds check codes aggressively without resorting to the SSA form. When we actually perform this type of optimization, there are many constraints in code motion caused by the precise exception rule in Java specification, which would cause the algorithm to miss many opportunities for eliminating away bound checks. We also propose a new method to overcome these constraints.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.37 no.3
• /
• pp.163-171
• /
• 2024

Structural health monitoring for ships and offshore structures is important in various aspects. Ships and offshore structures are continuously exposed to various environmental conditions, such as waves, wind, and currents. In the event of an accident, immense economic losses, environmental pollution, and safety problems can occur, so it is necessary to detect structural damage or defects early. In this study, structural response data of multi-linked floating offshore structures under various wave load conditions was calculated by performing fluid-structure coupled analysis. Furthermore, the order reduction method with distortion base mode was applied to the structures for predicting the structural response by using the results of numerical analysis. The distortion base mode order reduction method can predict the structural response of a desired area with high accuracy, but prediction performance is affected by sensor arrangement. Optimization based on a genetic algorithm was performed to search for optimal sensor arrangement and improve the prediction performance of the distortion base mode-based reduced-order model. Consequently, a sensor arrangement that predicted the structural response with an error of about 84.0% less than the initial sensor arrangement was derived based on the root mean squared error, which is a prediction performance evaluation index. The computational cost was reduced by about 8 times compared to evaluating the prediction performance of reduced-order models for a total of 43,758 sensor arrangement combinations. and the expected performance was overturned to approximately 84.0% based on sensor placement, including the largest square root error.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.6
• /
• pp.1-16
• /
• 2012

In this paper, we propose a cost-effective location and service management scheme in LTE (Long Term Evolution) networks, which a per-user service proxy is created to serve as a gateway between the mobile user and all client-server applications engaged by the mobile user. The service proxy is always co-located with the mobile user's location database such that whenever the MU's location database moves during a location hand-off, a service hand-off also ensues to co-locate the service proxy with the location database. This allows the proxy to know the location of the mobile user all the time to reduce the network communication cost for service delivery. We analyze four integrated location and service management schemes. Our results show that the centralized scheme performs the best when the mobile user's SMR (service to mobility ratio) is low and ${\upsilon}$(session to mobility ratio) is high, while the fully distributed scheme performs the best when both SMR and ${\upsilon}$ are high. In all other conditions, the dynamic anchor scheme is the best except when the service context transfer cost is high under which the static anchor scheme performs the best. Through analytical results, we demonstrate that different users with vastly different mobility and service patterns should adopt different integrated location and service management methods to optimize system performance.

• Journal of Korea Water Resources Association
• /
• v.42 no.5
• /
• pp.365-374
• /
• 2009

Probability plotting positions are used for the graphical display of annual maximum rainfall or flood series and the estimation of exceedance probability of those values. In addition, plotting positions allow a visual examination of the fitness of probability distribution provided by frequency analysis for a given data. Therefore, the graphical approach using plotting position has been applied to many fields of hydrology and water resources planning. In this study, the plotting position formula for the Gumbel distribution is derived by using the order statistics and the probability weight moment of the Gumbel distribution for various sample sizes. And then, the parameters of plotting position formula for the Gumbel distribution are estimated by using genetic algorithm. The appropriate plotting position formulas for the Gumbel distribution are examined by the comparison of root mean square errors and biases between theoretical reduced Gumbel variates and those calculated from derived and existing plotting position formulas. As the results, Gringorten's plotting position formula has the smaller root mean square errors and biases than any other formulas.

• Aerospace Engineering and Technology
• /
• v.4 no.1
• /
• pp.66-76
• /
• 2005

In this study, star visibility analysis of a star tracker is performed by using a statistical apprach. The probability of the Sun and the Earth proximity, the solar array masking probability, and the solar array blinding probability by the Sun light are obtained from the arbitrary chosen satellite positions as a function of a line of sight vector of the star tracker in several satellite attitude modes. This analysis demonstrates that the optimized star tracker accomodations can be determined to be an elevation angle -40o and two azimuth angles $-35^{circ}$ and $-150^{circ}$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.262-264
• /
• 2005

네트워크가 이동하는 환경을 지원하기 위하여 IETF에서는 NEMO(Network Mobility)를 제안하였다. NEMO에서는 이동 네트워크 내부에 이동하는 노드를 가질 수 있기 때문에 이동 네트워크 노드와 이동 네트워크 간의 복잡한 구조로 인하여 중첩되는 라우팅 문제가 발생한다. 이로 인하여 이동 네트워크 환경에서의 라우팅 최적화에 관한 연구가 진행되고 있다. 하지만 라우팅 최적화는 홈 에이전트 또는 상대 노드와 직접 통신을 하기 때문에 이동 네트워크가 이동 시마다 갱신된 위치를 알려주어야 하며 이로 인하여 바인딩 갱신 폭풍 문제가 발생한다. 본 논문에서는 분산 바인딩 갱신기법을 제안하여 바인딩 갱신 폭풍으로 인하여 발생되는 대역폭 감소와 바인딩 갱신 지연 문제를 해결하고 시뮬레이션을 통하여 제안기법의 성능을 분석하였다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06a
• /
• pp.218-220
• /
• 2012

인터넷 활용과 웹 어플리케이션의 개발이 증가함에 따라 처리해야하는 데이터의 양도 또한 증가하고 있다. 대량의 데이터를 효과적으로 처리하기 위한 방법 중 하나로 병렬처리 프로그래밍 모델인 맵리듀스가 있다. 하둡은 맵리듀스의 오픈소스 구현으로 대량의 데이터를 병렬로 처리하는 무료 자바 소프트웨어 프레임워크이다. 분산 파일 시스템을 사용하는 하둡에서는 처리하는 데이터가 다른 노드에 위치하는 데이터 로컬리티 문제가 전체 작업 수행시간의 증가를 야기하는 문제가 있다. 본 논문에서는 하둡에서의 데이터 로컬리티 문제를 해결하기 위한 데이터 복제기법을 제안한다. 제안하는 데이터 복제기법에서는 1) 라그랑지 보간법을 사용하여 과거 접근수를 이용한 미래 접근수를 예측하고, 2) 예측된 값을 Threshold값으로 설정하고, 3) 데이터 로컬리티 문제가 발생하였을 때, 복제사본을 생성할 것인지 캐시를 생성할 것인지를 결정하여 복제 사본의 수를 최적화 한다. 실험을 통해 단순히 복제사본 수를 증가시킴으로써 데이터 로컬리티를 향상을 이루어도 작업 완료시간이 감소하는 것이 아니라는 결과를 볼 수 있었고, 오버 런치로 인한 작업 완료시간 증가를 줄이기 위해 데이터 복제사본 수 최적화의 필요성을 확인할 수 있었다.