• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.6123-6138
• /
• 2018

Named data networking (NDN) is a new network architecture designed for next generation Internet. Router-side content caching is one of the key features in NDN, which can reduce redundant transmission, accelerate content distribution and alleviate congestion. However, several security problems are introduced as well. One important security risk is cache privacy leakage. By measuring the content retrieve time, adversary can infer its neighbor users' hobby for privacy content. Focusing on this problem, we propose a cache privacy protection mechanism (named as CPPM-DAM) to identify legitimate user and adversary using Bloom filter. An optimization for storage cost is further provided to make this mechanism more practical. The simulation results of ndnSIM show that CPPM-DAM can effectively protect cache privacy.

• Bulletin of the Korean Chemical Society
• /
• v.9 no.4
• /
• pp.223-231
• /
• 1988

Some pattern recognition methods have been used to characterize Korean ancient porcelainsherds using their elemental composition as analyzed by instrumental neutron activation analysis. A combination of analytical data by means of statistical linear discriminant analysis(SLDA) has resulted in removal of redundant variables, optimal linear combination of meaningful variables and formulation of classification rules. The plot in the first-to-second discriminant scores has shown that the three distinct territorial regions exist among porcelainsherds of Kyungki, Chunbuk-Chungnam, and Chunnam, with respective efficiencies of 20/30, 22/27 and 14/15. Similar regions have been found to exist among punchong porcelain and ceradonsherds of Kyungki, Chungnam and Chunbuk, with respective efficiencies of 7/9, 15/16 and 6/6. Classification has been further attempted by statistical isolinear multiple component analysis(SIMCA), using the sample set selected appropriately through SLDA as training set. For this purpose, all analytical data have been used. An agreement has generally been found between two methods, i.e., SLDA and SIMCA.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2009

XQuery query proposed by W3C is one of the standard query languages for XML data and is widely accepted by many applications. Therefore the studies for efficient Processing of XQuery query have become a topic of critical importance recently and the optimization of XQuery query is one of new issues in these studies. However, previous researches just focus on the optimization techniques for a specific XML data management system and these optimization techniques can not be used under the any XML data management systems. Also, some previous researches use predefined XML data structure information such as XML schema or DTD for the optimization. In the real situation, however applications do not all refer to the structure information for XML data. Therefore, this paper analyzes only a XQuery query and optimize by using itself of the XQuery query. In this paper, we propose 3 kinds of optimization method that considers the characteristic of XQuery query. First method removes the redundant expressions described in XQuery query second method replaces the processing order of operation and clause in XQuery query and third method rewrites the XQuery query based on FOR clause. In case of third method, we consider FOR clause because generally FOR clause generates a loop in XQuery query and the loop often rises to execution frequency of redundant operation. Through a performance evaluation, we show that the processing time for rewritten queries is less than for original queries. also each method in our XQuery query optimizer can be used separately because the each method is independent.

• KIPS Transactions on Computer and Communication Systems
• /
• v.9 no.2
• /
• pp.31-36
• /
• 2020

The creation of the Defense Integrated Data Center(DIDC) has resulted in a reduction in manpower, operating costs, efficient and effective management of resources. However, it is difficult to effectively collect and manage the data of a large number of battlefields coming from equipments such as drones, robots, and IoT added to the fourth industrial revolution and the future battlefield. Therefore, we will propose the design of DIDC network system using NFV and SDN, which are emerging as the core technologies of 5G, a mobile communication technology. After analyzing the data sheet of each equipment, it is considered that by integrating the redundant functions, energy efficiency, resource utilization and effective network management will be possible.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.36 no.10
• /
• pp.1026-1031
• /
• 2008

This paper describes the establishment result of high speed data receiving and archiving system(HDRAS) using data receiving card(DRC) developped by SaTReC and low cost RAID(Redundant Array of Independent Disks) storage instead of expensive enterprise RAID storage. We used three S-ATA2 type hard disks and performance test program developped by SaTReC to receive and save data at 350Mbps. Finally, we verified that the HDRAS using low cost RAID storage has a capacity to process received data at 79MB/s(632Mbps).

• Journal of the Korean Society of Industry Convergence
• /
• v.3 no.2
• /
• pp.167-178
• /
• 2000

Software RAID(Redundant Arrays of Inexpensive Disks) is defined as a storage system that provides capabilities of hardware RAID, and guarantees high reliability as well as high performance. In this paper, we propose an enhanced disk scheduling algorithm and a scheme to guarantee reliability of data. We also design and implement software RAID by utilizing these mechanism to develop a storage system for multimedia applications. Because the proposed algorithm improves a defect of traditional GSS algorithm that disk I/O requests arc served in a fixed order, it minimizes buffer consumption and reduces the number of deadline miss through service group exchange. Software RAID also alleviates data copy overhead during disk services by sharing kernel memory. Even though the implemented software RAID uses the parity approach to guarantee reliability of data, it adopts different data allocation scheme. Therefore, we reduce disk accesses in logical XOR operations to compute the new parity data on all write operations. In the performance evaluation experiments, we found that if we apply the proposed schemes to implement the Software RAID, it can be used as a storage system for small-sized video-on-demand servers.

• The Journal of Korean Association of Computer Education
• /
• v.18 no.5
• /
• pp.63-70
• /
• 2015

In the environment that the complex conditions need to be satisfied, skyline query have been applied to various field. To processing a skyline query in centralized scheme, several techniques have been suggested and recently map/reduce platform based approaches has been proposed which divides data space into multiple partitions for the vast volume of multidimensional data. However, the performances of these approaches are fluctuated due to the uneven data loading between servers and redundant tasks. Motivated by these issues, this paper suggests a novel technique called MR-DEAP which solves the uneven data loading using the random sampling. The experimental result gains the proposed MR-DEAP outperforms MR-Angular and MR-BNL scheme.

• Molecules and Cells
• /
• v.37 no.1
• /
• pp.36-42
• /
• 2014

The tomato (Solanum lycopersicum L.) is a model plant for genome research in Solanaceae, as well as for studying crop breeding. Genome-wide single nucleotide polymorphisms (SNPs) are a valuable resource in genetic research and breeding. However, to do discovery of genome-wide SNPs, most methods require expensive high-depth sequencing. Here, we describe a method for SNP calling using a modified version of SAMtools that improved its sensitivity. We analyzed 90 Gb of raw sequence data from next-generation sequencing of two resequencing and seven transcriptome data sets from several tomato accessions. Our study identified 4,812,432 non-redundant SNPs. Moreover, the workflow of SNP calling was improved by aligning the reference genome with its own raw data. Using this approach, 131,785 SNPs were discovered from transcriptome data of seven accessions. In addition, 4,680,647 SNPs were identified from the genome of S. pimpinellifolium, which are 60 times more than 71,637 of the PI212816 transcriptome. SNP distribution was compared between the whole genome and transcriptome of S. pimpinellifolium. Moreover, we surveyed the location of SNPs within genic and intergenic regions. Our results indicated that the sufficient genome-wide SNP markers and very sensitive SNP calling method allow for application of marker assisted breeding and genome-wide association studies.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1636-1645
• /
• 2016

In navigation systems that use collected trajectory for routing, the number and diversity of trajectory data are crucial despite the infeasible limitation which is that all routes should be collected in person. This paper suggests an algorithm combining trajectories only by collected GPS data and generating new routes for solving this problem. Using distance between two trajectories, the algorithm estimates road intersection, in which it also predicts the correlated direction of them with geographical coordinates and makes a decision to combine them by the correlated direction. With combined and generated trajectory data, this combination way allows trajectory-based navigation to guide more and better routes. In our study, this solution has been introduced. However, the ways in which correlated direction is decided and post-process works have been revised to use the sequential pattern of triangles' area GPS information between two trajectories makes in road intersection and intersection among sets comprised of GPS points. This, as a result, reduces unnecessary combinations resulting redundant outputs and enhances the accuracy of estimating correlated direction than before.