• Proceedings of the Korean Information Science Society Conference
• /
• 2007.10b
• /
• pp.445-450
• /
• 2007

본 논문에서는 "확률적 배낭(stochastic knapsack)" 문제에 대하여 잘 알려진 Complete Sharing(CS), Complete Partitioning(CP)이 트래픽 특성에 따라 성능의 차이가 나타난다는 약점과 각 정책(policy)들의 평균 성능에 대한 최적 파라미터들을 트래픽 특성에 따라 결정하여야 한다는 약점을 보완하는 모델에 근거한 "Parallel Rollout(PR)"에 기초한 적응적인 정책(adaptive policy)을 제안한다. 주어진 트래픽 모델을 병합한 확률적 배낭 문제를 마코프 결정 과정(Markov Decision Process, MDP)으로 모델링하고, 마코프 결정 과정상에서 기존의 주어진 정책들을 PR 기법을 적용, 하나의 정책으로 융합하고 그 정책이 기존의 주어진 어떤 정책보다도 성능이 같거나 더 뛰어나다는 이론적 근거를 실험을 통하여 확인한다.

• Annual Conference of KIPS
• /
• 2013.05a
• /
• pp.472-473
• /
• 2013

The growth in number and efficiency of smart devices such as GPS enabled smart phones and PDAs present an unparalleled opportunity for diverse areas of life. However extraction of GPS traces for provision of services demand a huge storage space as well as computation overhead. This is a challenging task especially for the applications which provide runtime services. In this paper we provide a simplified model to extract GPS traces of moving objects at runtime. Road segment partitioning and measure of deviation in angle of trajectory path is incorporated to identify the significant data points. The number of these data points is minimized by our proposed approach in an efficient manner to overwhelm the storage and computation overhead. Further, the competent reconstruction of complete itinerary based on gathered data, is also ensured by proposed method.

• International Journal of Computer Science & Network Security
• /
• v.22 no.4
• /
• pp.292-298
• /
• 2022

Femtocell networks can be a potential method for increasing the capacity of LTE networks, especially in indoor areas. However, unplanned deployment of femtocells results in co-tier interference and cross-tier interference problems. The interference reduces the advantages of implementing femtocell networks to a certain extent. The notion of Fractional Frequency Reuse (FFR) is proposed in order to reduce the impact of interference on the system's performance. In this paper, a dynamic approach for efficiently partitioning the spectrum is suggested. The goal is to enhance the capacity of femtocells, which will improve the performance of the system. The suggested strategy allocates less resources to the macrocell portion of the network, which has a greater number of femtocells deployed to maximize the utilization of available resources for femtocell users. The spectrum division would be dynamic. The proposed strategy is evaluated through a simulation using MATLAB tool. In conclusion, the results showed that the proposed scheme has the potential to boost the system's capacity.

• Annual Conference of KIPS
• /
• 2010.04a
• /
• pp.856-857
• /
• 2010

본 논문에서는 계층적 클러스터링을 위한 매개변수에 민감하지 않은 효과적인 데이터 분할 방안을 제안한다. 먼저, 선행 실험을 통하여 기존 방안이 매개 변수에 민감하다는 것을 보인다. 본 논문에 제안하는 방안은 주어진 데이터를 최적의 초기 부분 클러스터의 크기를 결정할 수 있는 측정 함수를 제안하고 제안된 측정 함수를 이용해서 주어진 데이터를 최적의 초기 부분 클러스터들로 분할한다. 또한, 분할된 초기 부분 클러스터들을 병합해서 질이 좋은 최종 클러스터들을 생성한다. 실험을 통하여 제안하는 방안이 기존 방안보다 매개 변수에 민감하지 않는다는 것을 보인다.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.84-90
• /
• 2023

In this article the problem of computing floating-point reciprocal cube root functions is considered. Our new algorithms for this task decrease the number of arithmetic operations used for computing $1/{\sqrt[3]{x}}$. A new approach for selection of magic constants is presented in order to minimize the computation time for reciprocal cube roots of arguments with movable decimal point. The underlying theory enables partitioning of the base argument range x∈[1,8) into 3 segments, what in turn increases accuracy of initial function approximation and decreases the number of iterations to one. Three best algorithms were implemented and carefully tested on 32-bit microcontroller with ARM core. Their custom C implementations were favourable compared with the algorithm based on cbrtf(x) function taken from C ＜math.h＞ library on three different hardware platforms. As a result, the new fast approximation algorithm for the function $1/{\sqrt[3]{x}}$ was determined that outperforms all other algorithms in terms of computation time and cycle count.

• 전자공학회논문지 IE
• /
• v.44 no.1
• /
• pp.20-26
• /
• 2007

Most researches on the mobile ad hoc network (MANET) have been focused on routing protocols, but for the real service provision DNS(Domain Name System) has to be supported first. Due to the inherent characteristics of the mobile ad hoc network, the DNS of the wired network is assumed to be not good for the MANET environment. The approach of distributed DNSs can easily adapt to the node mobility, but incurs the name conflict resolution overhead. On the other hand, the centralized approach performs the name resolution based on the unicast communication without causing the name conflict resolution overhead. The most important issue of the centralized approach is to provide the seamless name resolution service under server mobility. Therefore, in this paper, we propose a new centralized DNS, Manet DNS, which works efficiently on name allocation and management and solves the network merging and partitioning problem as well as providing the seamless name resolution service.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.4
• /
• pp.199-206
• /
• 2006

Real time vehicle dynamics models have been developed with the subsystem synthesis method for intelligent vehicle HILS system. Three different models for solving subsystem equations are compared in order to find out the best suitable model for HILS applications. The first model is based on the generalized coordinate partitioning technique, and the second one is on the approximate function approach, and the last one is on the constraint stabilization method. To investigate the theoretical efficiency of three proposed methods, arithmetic operators used in the formulations of three models are counted. Bump run simulations with half-sine bump have also carried out with three different models to measure the actual CPU time to validate theoretical investigation.

• Journal of Chest Surgery
• /
• v.17 no.3
• /
• pp.381-388
• /
• 1984

Cor triatriatum is rare congenital cardiac anomaly first described by Church in 1868. The anomaly consists of an abnormal partitioning of the left atrium by a fibromuscular membrane that divides the atrium into an upper chamber, which receives the pulmonary veins, and a lower chamber, which contains the atrial appendage and the mitral valve. The upper and lower chambers communicate through a stenotic fenestration in the membrane, which has the hemodynamic consequence of pulmonary venous obstruction. Recently we experienced cot triatriatum associated with partial anomalous pulmonary drainage to right atrium. The upper chamber was connected to right atrium through a sinus venous type of ASD and received left superior and both inferior pulmonary vein, whereas the lower chamber so called true left atrium communicated with right atrium through foramen ovale type of ASD, left atrial appendage and mitral orifice. And the anomalous membrane has no fenestrations which permit blood flow. The operation was made right atrial approach under the CPB. We excised completely the anomalous septum and reconstructed atrial septal defect with pericardial patch to drain the right upper pulmonary vein to the left atrium. The postoperative course has been good during follow up.

• The Korean Journal of Applied Statistics
• /
• v.18 no.2
• /
• pp.355-369
• /
• 2005

Genome sequencing and microarray technology produce ever-increasing amounts of complex data that needs statistical analysis. Visualization is an effective analytic technique that exploits the ability of the human brain to process large amounts of data. In this study, biplot approach applied to microarray data to see the relationship between genes and samples. The supplementary data method to classify new sample to known category is suggested. The methods are validated by applying it to well known microarray data such as Golub et al.(1999), Alizadeh et al.(2000), Ross et al.(2000). The results are compared to the results of several clustering methods. Modified graph which combine partitioning method and biplot is also suggested.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.