• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.315-327
• /
• 2007

The performance of database applications with large sets of multidimensional data depends on the performance of its access methods and the underlying disk system. In modeling the disk system, even though modem disks are manufactured with multiple physical zones, conventional access methods have been developed based on a traditional disk model with many simplifying assumptions. Thus, there is a marked lack of investigation on how to enhance the performance of access methods given a zoned disk model. The paper proposes novel zoning techniques that can be applied to any multidimensional access methods, both static and dynamic, enhancing the effective data transfer rate of underlying disk system by fully utilizing its zone characteristics. Our zoning techniques include data placement algorithms for multidimensional index structures and accompanying localized query processing algorithms for range queries. The experimental results show that our zoning techniques significantly improve the query performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9A
• /
• pp.837-843
• /
• 2006

IEEE802.15.3 and IEEE802.15.4 have defined the hybrid MAC protocols based on TDMA and CSMA where a multi-frame TDMA structure is employed so that multiple data frames can be transmitted within one timeslot to guarantee minimum delay bounds of isochroous traffic. However, TDMA has an intrinsic problem that cannot dynamically allocate optimal length of timeslot to each station. Therefore the idle timeslot can be produced by stations when each transmission queue is instantaneously empty during its timeslot, which would waste lots of timeslots especially in the multi-frame TDMA systems. In this paper, we propose a more flexible multiple-access scheme for the multi-frame TDMA system based on the concept of virtual slot which is accessible by every station with the highest priority for slot owner and lower priority for other stations. Finally, our simulation results from various environments show that proposed scheme can achieve magnitude improvement of total system throughput and average message delay by maximizing channel utilization.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.05a
• /
• pp.183-186
• /
• 2006

생체인식은 정보처리시스템에 있어서 네트웍 보안, 시스템 보안, 어플리케이션 보안 등에 사용되는 개인인증 및 확인을 위한 하나의 기법으로 볼 수 있으며, 개인정보를 포함한 데이터의 보호를 위해서 본인이나 승인된 사용자만이 네트웍이나 물리적 접근 등을 통하여 접근하고자 하는 것이다. 본 논문에서는 얼굴인식과 홍채인식 시스템을 융합한 다중생체인식 시스템을 구현하였으며, 다중생체인식 시스템에서 구현된 생체데이터를 안전하게 전송할 수 있는 방법으로 블록 암호 알고리듬 ARIA를 침입에 대한 보안 방법으로 제안하였다. 이에 다중생체 특징벡터를 128비트의 블록 크기를 이용하여 암호화 하였으며, 생체 특징벡터를 이용하여 128비트의 키로 사용하였다.

• The Journal of Information Technology
• /
• v.2 no.1
• /
• pp.1-13
• /
• 1999

Multi-cell combined networks that provide coverage to the same areas by several cells of different sizes are useful to accommodate high traffic density while keeping high quality of service. This gives an overview of recent contributions on this subject, Two main issues are considered: spectrum sharing between different layers with a focus on F/TDMA systems and teletraffic performance of multi-cell combined networks given different handover policies

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.6
• /
• pp.1407-1417
• /
• 1996

In recent researches on thread partitioning algorithms break a thread at the long latency operation and merge threads to get the longer threads under the given constraints. Due to this limitation, even a program with little parallelism is partitioned into small-sized threads and context-swithings occur frequently. In the paper, we propose another method array localization about the array name, dependence distance(the difference of accessed element index from loop index), and the element usage that indicates whether element is used or defined. Using this information we can allocate array elements to the node where the corresponding loop activation is executed. By array localization, remote accesses to array elements can be replaced with local accesses to localized array elements. As a resuit,the boundaries of some threads are removed, programs can be partitioned into the larger threads and the number of context switchings reduced.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.293-295
• /
• 1998

ATM over xDSL으로 구성된 광대역 가입자 망을 통하여, ATM마에 접속하려 할 때에는 DSL접근 다중화기 (Access Multiplexer )가 필수적으로 요구된다. 이때 관대역 통합서비스라는 가입자가 망의 기본적인 목적을 달성하기 위하여, DSL접근 다중화기는 ATM？ㅇ에서 트래픽 제어를 수행할 수 있어야 한다. 이에 본 논문에서는 DSL접근 다중화가에서는 트래픽 제어에 필요한 효율적이고 간단한 셀 스케줄링 기법을 제안한다. 성능 평가를 위한 모의 실험에 의하면 제안된 기법은 각 연결들의 트래픽 기술자에 부합하는 서비스를 제공할 수 있으며, 아울러 연결들이 명세한 셀 손실률에 근거한 차별화된 서비스 품질 (QoS)을 제공할 수 있다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10b
• /
• pp.1005-1008
• /
• 2001

본 논문은 현재 안전한 운영체제 개발에 사용되고 있는 강제 접근통제(MAC)와 역할 행위 기반 접근통제(RBBAC)의 혼합 기법인 다중 등급 역할 행위 기반 접근통제(ML-RBBAC)를 제안하고, 접근통제 모델을 기술한다. ML-RBBAC은 안전한 운영체제가 MAC과 RBBAC을 동시 지원하기 위한 최적의 방법이며, 기존 MAC 의 단점인 지나치게 엄격한 정보흐름 통제 및 보안 관리 부담의 증대 문제를 해결한다.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.121-126
• /
• 2010

This paper proposes an efficient index scheduling technique for kNN query processing in multiple wireless broadcast channel environment. Previous works have to wait for the next cycle if the required child nodes of the same parent node are allocated in the same time slot on multiple channel. Our proposed method computes the access frequencies of each node of R tree at the server before the generation of the R-tree index broadcast schedule. If they have high frequencies, we allocate them serially on the single channel. If they have low frequencies, we allocate them in parallel on the multiple channels. As a result, we can reduce the index node access conflicts and the long broadcast cycle. The performance evaluation shows that our scheme gives the better performance than the existing schemes.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.141-151
• /
• 2008

In the paper, we analyze the performance of random access channels in multi-service multi-user OFDMA systems. The resource of the random access channels in OFDMA systems are available sub-channels and PN-codes. For given available sub-channels and PN-codes,' we analyze the performance of the random access channels of OFDMA systems in terms of the access success probability, the blocking probability, the access delay and the throughput per each service class. Further, we find the feasible region of the access probability of each service class in which the allowable minimum access success probability, the allowable maximum blocking probability and the allowable maximum access delay are satisfied. The results also can be used to find proper region of the access probabilities of each service class for differentiated quality of service(QoS)s, and for the system operations in multi-service multi-user OFDMA systems.

• Journal of Convergence for Information Technology
• /
• v.10 no.4
• /
• pp.18-24
• /
• 2020

Recently, research on Society 5.0 has been actively carried out in Japan. The Society 5.0 is used in various areas using IoT sensors. This paper proposes a privacy approach model of multiple approaches to IoT users based on Society 5.0. The proposed model used multiple methods of synchronizing important information of IoT devices with one another in the virtual environment. The proposed model improved the efficiency of IoT information by accumulating the weight of IoT information on a probability-based basis. Further, it improves the accuracy of IoT information by segmenting it so that attribute information is linked to IoT information. As a result of the performance evaluation, the efficiency of IoT devices has improved by an average of 5.6 percent, depending on the number of IoT devices and the number of IoT hub devices. Accuracy has improved by an average of 15.9% depending on information collection and processing.