• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.29 no.2
• /
• pp.417-429
• /
• 2019

WPA2-PSK uses a 4-way handshake protocol based on a shared secret to establish a secure session between a client and an AP. It has various security problems such as eavesdropping attacks and the secure session establishment process is inefficient because it requires multiple interactions between client and AP. The WPA3 standard has recently been proposed to solve the security problem of WPA2, but it is a small improvement using the same 4-way handshake methodology. OAuth 2.0 token authentication is widely used on the web, which can be used to keep an authenticated state of a client for a long time by using tokens issued to an authenticated client. In this paper, we apply the dual-token based randomized token authentication technology to the Wi-Fi security protocol to achieve an efficient Wi-Fi security protocol by dividing initial authentication and secure session establishment. Once a client is authenticated and equipped with dual tokens issued by AP, it can establish secure session using them quickly with one message exchange over a non-secure channel.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.145-151
• /
• 2004

We present an efficient data structure to obtain the range minima in an away in constant time. Recently, suffix ways are extensively used to search DNA sequences fast in bioinformatics. In constructing suffix arrays, solving the range minima problem is necessary When we construct suffix arrays, we should solve the range minima problem not only in a time-efficient way but also in a space-efficient way. The reason is that DNA sequences consist of millions or billions of bases. Until now, the most efficient data structure to find the range minima in an way in constant time is based on the method that converts the range minima problem in an array into the LCA (Lowest Common Ancestor) problem in a Cartesian tree and then converts the LCA problem into the range minima problem in a specific array. This data structure occupies O( n) space and is constructed in O(n) time. However since this data structure includes intermediate data structures required to convert the range minima problem in an array into other problems, it requires large space (=13n) and much time. Our data structure is based on the method that directly solves the range minima problem. Thus, our data structure requires small space (=5n) and less time in practice. As a matter of course, our data structure requires O(n) time and space theoretically.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.39-42
• /
• 2003

The issues on the interconnection of telecommunications network are recently prevailed in the IT industry. In this study, we classify the network interconnection system into two categories: two way-same price model and two way-different price model. The purpose of this paper is to analyze economic characteristics of optimal settlement system according to each model. One of the most important policy implications we derive through this study is that symmetry between enterprises is required for policy maker or regulatory agency to set an efficient settlement system under two way-same price model, but that symmetry is not necessarily required under two way-sane price model.

• Proceedings of the Korea Technology Innovation Society Conference
• /
• 2003.11a
• /
• pp.41-53
• /
• 2003

The issues on the interconnection of telecommunications network are recently prevailed in the IT industry. In this study, we classify the network interconnection system into two categories: two way-same price model and two way-different price model. The purpose of this paper is to analyze economic characteristics of optimal settlement system according to each model. One of the most important policy implications we derive through this study is that symmetry between enterprises is required for policy maker or regulatory agency to set an efficient settlement system under two way-same price model, but that symmetry is not necessarily required under two way-same price model.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.07a
• /
• pp.51-54
• /
• 2016

In computer vision especially in image processing, it has become popular to apply deep convolutional networks for supervised learning. Convolutional networks have shown a state of the art results in classification, object recognition, detection as well as semantic segmentation. However, supervised learning has two major disadvantages. One is it requires huge amount of labeled data to get high accuracy, the second one is to train so much data takes quite a bit long time. On the other hand, unsupervised learning can handle these problems more cheaper way. In this paper we show efficient way to learn features for classification in an unsupervised way. The network trained layer-wise, used backpropagation and our network learns features from unlabeled data. Our approach shows better results on Caltech-256 and STL-10 dataset.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.422-425
• /
• 2004

Many believe that electronic distance teaming education transform higher education, saving money and improving learning qualify So, the open University, which teaches around 280,000 students at a distance, is examining the adaption of its distance teaching methods for the internet. But, there are only one type of distance learning education of one way direction. To understand all of a student which selected some of e teaming course, teacher must check that how many student to understand and what is the difficult problems. Without checking this condition, It will be a very difficult and boring distance learning course. In this paper, we introduce of intelligent learning contents of full duplex direction that teach understanding student and not understanding student. The computer simulation results confirms that full duplex e learning system has been proven to be much more efficient than one way direction which not considering about understanding problems.

• Structural Engineering and Mechanics
• /
• v.42 no.3
• /
• pp.363-381
• /
• 2012

This study is aimed at providing an efficient analytical model to obtain pressure- impulse diagram of one-way reinforced concrete slabs subjected to different shapes of air blast loading using single degree of freedom method (SDOF). A tri-linear elastic perfectly plastic SDOF model has been used to obtain the pressure-impulse diagram to correlate the blast pressure and the corresponding concrete flexural damage. In order to capture the response history for the slab, a new approximately SDOF method based on the conventional SDOF method is proposed and validated using published test data. The influences of pulse loading shape on the pressure-impulse diagram are studied. Based on the results, a pressure-impulse diagram generation method using SDOF and an analytical equation for the pressure-impulse diagram is proposed to different damage levels and different blast loading shapes.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2014.11a
• /
• pp.779-782
• /
• 2014

맵리듀스(MapReduce)는 대용량 데이터의 병렬 처리에 사용되는 프로그래밍 모델이다. 조인(join)은 둘 이상의 테이블에서 동일한 애트리뷰트 값을 가지는 레코드들을 결합하는 연산으로, 데이터베이스 분야에서 가장 중요한 연산 중 하나이다. 본 논문은 맵리듀스를 이용하여 다중 조인(multi-way)을 효율적으로 처리하는 방법을 제안한다. n개 테이블의 다중 조인을 처리하기 위해 기존 방법은 2-way 조인을 수행하는 맵리듀스 잡을 (n-1)번 수행하거나, 레코드들을 중복시켜 n개 테이블의 조인을 1 개의 맵리듀스 잡으로 한 번에 처리한다. 하지만 전자는 맵리듀스 잡을 (n-1)번 수행해야 하며, 후자는 레코드들을 상당히 많이 중복시켜야 한다는 단점이 있다. 본 논문은 레코드를 전혀 중복시키지 않고도 ${\lceil}{\log}_2n{\rceil}$개의 맵리듀스 잡만으로 다중 조인을 효율적으로 처리하는 방법을 제안한다. 실험을 통해 제안 방법은 기존 방법에 대해 다중 조인을 더 빠르게 처리함을 보인다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.1
• /
• pp.365-382
• /
• 2021

This paper proposes a novel two-way relaying (TWR) approach for a two-relay wireless network based on non-orthogonal multiple access (NOMA), where two terminals exchange messages with a cellular base station (BS) via two intermediate relay stations (RSs). We propose a NOMA-based TWR approach with two relaying schemes, i.e., amplify-and-forward (AF) and decode-and-forward (DF), referred to as NOMA-AF and NOMA-DF. The sum-rate performance of our proposed NOMA-AF and NOMA-DF is analyzed. A closed-form sum-rate upper bound for the NOMA-AF is obtained, and the exact ergodic sum-rate of NOMA-DF is also derived. The asymptotic sum-rate of NOMA-AF and NOMA-DF is also analyzed. Simulation results show that the proposed scheme outperforms conventional orthogonal multiple access based transmission schemes. It is also shown that increasing the transmit power budget of the relays only cannot always improve the sum-rates.

• YAKHAK HOEJI
• /
• v.23 no.2
• /
• pp.125-128
• /
• 1979

In the formation of L(+) -glutamine from L(+) -glutamic acid-5-hydrazide, large amount of Raney-Ni was effective under normal pressure but hydrogenation or amonolysis of ester under pressure was useless. Preparation of glutamine with .alpha.-ketoglutaric acid (by way of 1, 4, 5, 6-tetrahydro-6-oxo-3-pyridazine carboxylic acid) is intersting but not so efficient in yield.