• The KIPS Transactions:PartD
• /
• v.12D no.5 s.101
• /
• pp.689-698
• /
• 2005

Various systems are used to provide the location based services. But, the existing systems have some problems which have difficulties in dealing with faster services for above million people. In order to solve it, a multi-level DBMS which supports both fast data processing and large data management support should be used. The multi-level DBMS with snapshots has all the data existing in disk database and the data which are required to be processed for fast processing are managed in main memory database as snapshots. To optimize performance of this system for location based services, the query classification component which classifies the queries for efficient snapshot usage is needed. In this paper, the query classification component in multi-level DBMS for location based services is designed and implemented. The proposed component classifies queries into three types: (1) memory query, (2) disk query, (3) hybrid query, and increases the rate of snapshot usage. In addition, it applies division mechanisms which divide aspatial and spatial filter condition for partial snapshot usage. Hence, the proposed component enhances system performance by maximizing the usage of snapshot as a result of the efficient query classification.

• Tunnel and Underground Space
• /
• v.33 no.6
• /
• pp.594-609
• /
• 2023

TBM (Tunnel Boring Machine) method is gaining popularity in urban and underwater tunneling projects due to its ability to ensure excavation face stability and minimize environmental impact. Among the prominent models for predicting disc cutter life, the NTNU model uses the Cutter Life Index(CLI) as a key parameter, but the complexity of testing procedures and rarity of equipment make measurement challenging. In this study, CLI was predicted using multiple linear regression analysis and tree-based machine learning techniques, utilizing rock properties. Through literature review, a database including rock uniaxial compressive strength, Brazilian tensile strength, equivalent quartz content, and Cerchar abrasivity index was built, and derived variables were added. The multiple linear regression analysis selected input variables based on statistical significance and multicollinearity, while the machine learning prediction model chose variables based on their importance. Dividing the data into 80% for training and 20% for testing, a comparative analysis of the predictive performance was conducted, and XGBoost was identified as the optimal model. The validity of the multiple linear regression and XGBoost models derived in this study was confirmed by comparing their predictive performance with prior research.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.3
• /
• pp.549-555
• /
• 2007

A digital signature scheme provides integrity of the document, authentication and non-repudiation of a signer. Usually the key for digital signature is stored in hard disk or removal disk storage. The drawback of this approach is that the signer can let the agent to sign instead of the signer by providing the key information. It can be abused in applications such as electronic election. In this paper, we propose the undeniable biometric digital multi-signature scheme suitable for applications where the signer should not make an agent sign instead of himself/herself. The undeniable multi-signature scheme requires many signers and only the designated user can confirm the authenticity of multi-signature. The proposed scheme satisfies undeniable property and it is secure against active attacks such as modification and denial of the multi-signature by signers. As the key is generated through the signer's fingerprint image, it's also secure against signing by an agent.

• Journal of KIISE
• /
• v.43 no.7
• /
• pp.736-743
• /
• 2016

Several studies have reported the impact of core affinity on the network I/O performance of multi-core systems. As the network bandwidth increases significantly, it becomes more important to determine the effective core affinity. Although a framework for dynamic core affinity that considers both network and disk I/O has been suggested, the multiple queues provided by high-speed I/O devices are not properly supported. In this paper, we extend the existing framework of dynamic core affinity to efficiently support the multiple queues of high-speed I/O devices, such as 40 Gigabit Ethernet and NVM Express. Our experimental results show that the extended framework can improve the HDFS file upload throughput by up to 32%, and can provide improved scalability in terms of the number of cores. In addition, we analyze the impact of the assignment policy of multiple I/O queues across a number of cores.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06d
• /
• pp.289-291
• /
• 2006

최근 인터넷 접속 환경의 발달과 시스템 및 네트워크 성능 향상의 영향으로 단순한 정보의 전달뿐만 아니라 오디오, 비디오와 같은 미디어 콘텐츠(contents)의 정보 전달을 효율적으로 제공하는 방안이 연구되고 있다. 미디어 콘텐츠를 스트리밍 하는 것은 인터넷 트래픽의 아주 큰 부분을 차지하기 때문에 이러한 콘텐츠를 효율적으로 분산하기 위하여 우리는 P2P(Peer-to-Peer) 오버레이 네트워크를 이용한다. 본 논문은 Tapestry[1]를 미디어 콘텐츠 스트리밍 환경에 맞게 변형하며, 노드와 네트워크의 부하를 균등하게 분산시키기 위해 MDC(multiple description coding)[2]를 이용하여 하나의 콘텐트를 다중 트리에 분산한다. 제안된 메커니즘으로 사용자에게 보다 강화된 서비스를 제공한다.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2008.04a
• /
• pp.393-399
• /
• 2008

A modeling method for the modal analysis of a pre-twisted multi-packet blade system undergoing rotational motion is presented in this paper. Blades are idealized as pre-twisted cantilever beams that are fixed to a rotating disc. The stiffness coupling effects between blades due to the flexibilities of the disc and the shroud are modeled with discrete springs. The coupling effect between chordwise and flapwise bending deflection is also considered. Hybrid deformation variables are employed to derive the equations of motion. To obtain more general information, the equations of motion are transformed into dimensionless forms in which dimensionless parameters are identified. The effects of the dimensionless parameters and the number of packets as well as blades on the modal characteristics of the rotating multi-packet pre-twisted blade system are investigated with some numerical examples.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.832-837
• /
• 2008

A modeling method for the modal analysis of a multi-packet blade system having tapered cross section undergoing rotational motion is presented in this paper. Blades are idealized as tapered cantilever beams that are fixed to a rotating disc. The stiffness coupling effects between blades due to the flexibilities of the disc and the shroud are modeled with discrete springs. Hybrid deformation variables are employed to derive the equations of motion. To obtain more general information, the equations of motion are transformed into dimensionless forms in which dimensionless parameters are identified. The effects of the dimensionless parameters including tapered ratio and the number of packets as well as blades on the modal characteristics of the system are investigated with some numerical examples.

• Proceedings of the KIEE Conference
• /
• 2007.10a
• /
• pp.377-378
• /
• 2007

본 논문에서는 저전력 임베디드 시스템을 위한 효율적인 다중 NAND 플래쉬 파일 시스템을 제안한다. 기존에 제안되었던 하드디스크를 비롯한 저장 장치들과는 달리 NAND 플래쉬 메모리는 특정 블록에 쓰기 연산을 하기 전에 해당 블록은 이미 소거된 상태이어야 한다. 또한 이러한 소거의 횟수는 각 블록마다 제한적이다. 이러한 문제를 해결하기 위해서 소거 횟수 평준화 기법이 많이 사용되고 있고 관련하여 많은 연구가 진행되고 있다. 본 논문에서는 소거 횟수에 임계치를 설정하여 연산하는 방법을 제안한다. 또한 기존에는 단일 플래쉬 메모리만을 고려하고 있으나 본 논문에서는 다중 플래쉬 메모리 구조를 고려한다.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2294-2304
• /
• 1999

Our research purpose in this paper is to improve the performance of query processing in GIS(Geographic Information System) by enhancing the I/O performance exploiting parallel I/O and efficient disk access. By packing adjacent spatial data, which are very likely to be referenced concurrently, into one block or continuous disk blocks, the number of disk accesses and the disk access overhead for query processing can be decreased, and this eventually leads to the I/O time decrease. So, in this paper, we proposes EPR(Enhanced Parallel R-tree) indexing method which integrates the parallel I/O method of the previous Parallel R-tree method and a packing-based clustering method. The major characteristics of EPR method are as follows. First, EPR method arranges spatial data in the increasing order of proximity by using Hilbert space filling curve, and builds a packed R-tree by bottom-up manner. Second, with packing-based clustering in which arranged spatial data are clustered into continuous disk blocks, EPR method generates spatial data clusters. Third, EPR method distributes EPR index nodes and spatial data clusters on multiple disks through round-robin striping. Experimental results show that EPR method achieves up to 30% or more gains over PR method in query processing speed. In particular, the larger the size of disk blocks is and the smaller the size of spatial data objects is, the better the performance of query processing by EPR method is.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.47 no.1
• /
• pp.30-40
• /
• 2010

The hard disk is one of the most frequently used storage in IPTV sep-top box. It has large storage capacity and provides fast I/O speed compared to its price whereas it causes high power consumption due to mechanical characteristics of spindle motor. In order to play streaming data in the set-top box, spindle motor of hard disk keeps active mode and it causes high power consumption. In this paper, We propose an offset-buffering and multi-mode spin-down method to reduce power consumption for streaming data playback. The offset-buffering inspects the user's viewing pattern and performs buffering based on the analysis of viewing pattern. So, it can maintain the status of spindle motor as idle mode for long time. Besides, it can reduce power consumption by spinning down according to offset-buffer size. The experimental result shows that proposed offset-buffering and multi mode spin-down method is about 28.3% and 12.5% lower than the full-Buffering method in terms of the power consumption and spin-down frequency, respectively.