• International journal of advanced smart convergence
• /
• v.12 no.1
• /
• pp.1-8
• /
• 2023

Smart IoT over high speed network and high performance smart devices explodes the ubiquitous services and applications. Nearest Neighbor(NN) query is one of the important type of queries that have to be supported for ubiquitous information services. In order to process efficiently NN queries in the wireless broadcast environment, it is important that the clients determine quickly the search space and filter out NN from the candidates containing the search space. In this paper, we propose a hybrid index of Voronoi and grid partition to provide quick search space decision and rapid filtering out NN from the candidates. Grid partition plays the role of helping quick search space decision and Voronoi partition providing the rapid filtering. We show the effectiveness of the proposed index by comparing the existing indexing schemes in the access time and tuning time. The evaluation shows the proposed index scheme makes the two performance parameters improved than the existing schemes.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.22 no.4
• /
• pp.205-212
• /
• 2010

In a typical data center, large numbers of IT sever racks are arranged multiple rows. IT environments, in which extensive electronic hardware is air-cooled, cooling system inefficiencies result when heated exhaust air from equipment prematurely mixes with chilled coolant air before it is used for cooling. Mixing of chilled air before its use with heated exhaust air results in significant cooling inefficiencies in many systems. Over temperatures may not only harm expensive electronic equipment but also interrupt critical and revenue generating services. Cool shield is a cost effective aisle partition system to contain the air in cold aisles and hot aisles of an IT server room. This paper focuses on the use of performance metrics for analyzing aisle partition system in data centers.

• The Journal of the Korea Contents Association
• /
• v.18 no.6
• /
• pp.434-442
• /
• 2018

Recently, the threat to the security and damage of important data leaked by devices of intranet infected by malicious code through the Internet have been increasing. Therefore, the partitioned intranet model that blocks access to the server for business use by implementing authentication of devices connected to the intranet is required. For this, logical net partition with the VDI(Virtual Desktop Infrastructure) method is no information exchange between physical devices connected to the intranet and the virtual device so that it could prevent data leakage and improve security but it is vulnerable to the attack to expose internal data, which has access to the server for business connecting a nonregistered device into the intranet. In order to protect the server for business, we suggest a blockchain based network partition model applying blockchain technology to VDI. It contributes to decrease in threat to expose internal data by improving not only capability to verify forgery of devices, which is the vulnerability of the VDI based logical net partition, but also the integrity of the devices.

• Journal of Power System Engineering
• /
• v.18 no.1
• /
• pp.22-31
• /
• 2014

This paper introduced the new calibration algorithm of a straight-type five-hole pressure probe necessary for calculating three-dimensional flow velocity components. The new velocity data reduction method using both a commercial two-dimensional curve-fitting program and the zone partition method of a calibration map was firstly introduced in this study. This new calibration method can be applied up to the wide flow angle of ${\pm}80^{\circ}$ despite of using a five-hole pressure probe because this data reduction method showed a comparatively good performance in calculating yaw and pitch angles from the calibration map.

• Journal of the Korean Data and Information Science Society
• /
• v.12 no.1
• /
• pp.1-9
• /
• 2001

In this paper, the problem of information related to I binomial experiments, each having a distinct probability of success ${\theta}_i$, i = 1,2, $\cdots$, I, is considered. Instead of using a standard exchangeable prior for ${\theta}\;=\;({\theta}_1,\;{\theta}_2,\;{\cdots},\;{\theta}_I)$, we con-sider a partition of the experiments and take the ${\theta}_i$'s belonging to the same partition subset to be exchangeable and the ${\theta}_i$'s belonging to distinct subsets to be independent. And we perform Gibbs sampler approach for Bayesian inference on $\theta$ conditional on a partition. Also we illustrate the methodology with a real data.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.4
• /
• pp.655-666
• /
• 2013

As the capacity of storage devices becomes larger, most users divide them into several logical partitions for convenience of storing and controlling data. Therefore, recovering partitions stably which are artificially hidden or damaged is the most important issue in the perspective of digital forensic. This research suggests partition recovery algorithm that makes stable and effective analysis using characteristics of each file system. This algorithm is available when partition is not distinguishable due to concealment of partition or damage in partition area.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.95-102
• /
• 2022

This paper proposed a linear time algorithm for a three-partition problem(TPP) in which a polynomial time algorithm is not known as NP-complete. This paper proposes a backtracking method that improves the problems of not being able to obtain a solution of the MM method using the sum of max-min values and third numbers, which are known polynomial algorithms in the past. In addition, the problem of MM applying the backtracking method was improved. The proposed algorithm partition the descending ordered set S into three and assigned to the forward, backward, and best-fit allocation method with maximum margin, and found an optimal solution for 50.00%, which is 5 out of 10 data in initial allocation phase. The remaining five data also showed performance to find the optimal solution by exchanging numbers between surplus boxes and shortage boxes at least once and up to seven times. The proposed algorithm that performs simple allocation and exchange optimization with less O(k) linear time performance complexity than the three-partition m=n/3 data, and it was shown that there could be a polynomial time algorithm in which TPP is a P-problem, not NP-complete.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.571-578
• /
• 2002

In temporal database, extended time dimension for history management brings about complexity of join operation and increased cost. To solve this problem, a method that joins the divided segment time data after partition the time range into fixed time interval is introduced. But existing methods can't solve the ambiguity problem of time border that caused by temporal granularity in the partition point. In this paper, We suggested Fuzzy Minimum Interval Partition (FMIP) method that introduced the possibility distribution of fuzzy theory considered uncertainty time interval border in the partition line.

• Journal of the Korean Data and Information Science Society
• /
• v.20 no.1
• /
• pp.171-178
• /
• 2009

In order to make the high quality Korean cattle, it has been identified the gene which influence to various economic characters. In this paper, we introduce Restricted Partition Method for gene-gene interaction analysis. Further, economic traits, longissimus muscle dorsi area (LMA), carcass cold weight (CWT) and average daily gain (ADG) are applied with Restricted Partition Method (RPM). The SNP (19_1)$^*$SNP (28_2) was selected and was best marker on Single nucleotide polymorphisms (SNPs). It also influenced SNP (19_1)$^*$SNP (28_2) was an very important marker for economic character and to make the thing know it became.

• 한국공간정보시스템학회:학술대회논문집
• /
• 2007.06a
• /
• pp.59-64
• /
• 2007

데이타 중심 센서 네트워크에서는 측정된 데이타의 값에 따라 데이타를 저장하는 센서 노드가 결정되기 때문에 같은 값을 갖는 데이타가 빈번하게 발생하면 이를 저장하는 센서 노드에 부하가 집중되어 에너지가 빠르게 고갈되는 문제가 있다. 또한 센서 네트워크가 확장되면 데이타 저장 및 질의 처리시 목적 센서 노드로의 라우팅 거리가 멀어져 통신 비용이 증가되는 문제가 있다. 그러나 기존 연구들은 데이타 저장의 효율적인 관리에만 치우쳐 이와 같은 문제를 효율적으로 해결하지 못하고 있다. 본 논문에서는 이러한 문제를 해결하기 위해 비균등 네트워크 분할(Non-Uniform Network Spilt: NUNS) 기법을 제안한다. NUNS는 센서 네트워크를 센서 노드 개수와 분할된 영역 크기 차이가 최소가 되도록 비균등 크기의 Partition으로 분할하고 각 Partition에서 발생한 데이타를 그 Partition 내의 센서 노드가 저장 관리함으로써 센서 노드의 데이타 저장 부하를 분산시키고, 센서 네트워크의 확장에 따른 통신 비용을 줄인다. 그리고 NUNS는 각 Partition을 분할된 영역 크기 차이가 최소가 되도록 센서 노드 개수만큼 비균등하게 Zone으로 분할함으로써 센서 노드가 없는 Zone으로 인해 센서 노드에 부하가 집중되는 것을 막고 불필요한 라우팅 비용을 줄인다.