• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.14 no.4
• /
• pp.123-134
• /
• 2004

In this paper a high speed architecture of the RC4 stream cipher is proposed and its FPGA implementation is presented. Compared to the conventional RC4 designs which have long initialization operation or use double or triple S-arrays to reduce latency delay due to S-array initialization phase, the proposed architecture for RC4 stream cipher eliminates the S-array initialization operation using 256-bit valid entry scheme and supports 40/128-bit key lengths with efficient modular arithmetic hardware. The proposed RC4 stream cipher is implemented using Xilinx XCV1000E-6H240C FPGA device. The designed RC4 stream cipher has about a throughput of 106 Mbits/sec at 40 MHz clock and thus can be applicable to WEP processor and RC4 key search processor.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.11a
• /
• pp.317-320
• /
• 2006

XML 트리 데이터들로부터 빈번 서브 트리들을 추출하는 기존 방법들은 복잡하고 다수의 입력데이터 스캐닝을 필요로 할 뿐만 아니라 빈번 서브 트리를 구하기 위해 에지 하나하나의 조인 작업을 필요로 하였다. 이는 결과적으로 많은 수행 시간을 요한다. 본 논문에서는 트리데이터를 레벨 별로 나누고 이를 마치 채로 거르듯이 필터링하여 특정 수치 이상의 출현 횟수를 가지는 노드들만을 남겨 빠르게 빈번한 서브 트리를 찾고, 이를 이용하여 XML 연관규칙들을 생성하는 방법을 제시한다. 제시된 방법을 위해서 PairSet 이라는 새로운 자료구조를 도입하였으며, 이를 이용하는 크로스필터링 알고리즘을 개발하여 제시하였다.

• Journal of KIISE:Databases
• /
• v.32 no.6
• /
• pp.650-661
• /
• 2005

As the Internet is growing, the use of XML which is a standard of semi-structured document is increasing. Therefore, there are on going works about integration and retrieval of XML documents. However, the basis of efficient integration and retrieval of documents is to cluster XML documents with similar structure. The conventional XML clustering approaches use the hierarchical clustering algorithm that produces the demanded number of clusters through repeated merge, but it have some problems that it is difficult to compute the similarity between XML documents and it costs much time to compare similarity repeatedly. In order to address this problem, we use clustering algorithm for transactional data that is scale for large size of data. In this paper we use common structures from XML documents that don't have DTD or schema. In order to use common structures of XML document, we extract representative structures by decomposing the structure from a tree model expressing the XML document, and we perform clustering with the extracted structure. Besides, we show efficiency of proposed method by comparing and analyzing with the previous method.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.40 no.12
• /
• pp.46-58
• /
• 2003

The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

• Journal of Advanced Navigation Technology
• /
• v.8 no.2
• /
• pp.190-196
• /
• 2004

The development of a new hardware structure which can implement the viterbi algorithm efficiently is required for applications such as a software radio because the viterbi algorithm, which is an error correction code function for the second and the third generation of mobile communication, needs a lot of arithmetic operations. The length of K in the viterbi algorithm different from each standard, for examples, K=7 in case of IS-95 standard and GSM standard, and K=9 in case of WCDMA and CDMA2000. In this paper, we propose a new hardware structure of an adaptive viterbi decoder which can decode the constraint length in K=3~9 and the data rate in 1/2 ~ 1/3. Prototyping results targeted to Altera Cyclon EPIC20F400C8, shows that the proposed hardware structure needs maximum 19,276 logic elements and power dissipation of 222.6 mW.

• Journal of Korean Society of Steel Construction
• /
• v.19 no.1
• /
• pp.15-27
• /
• 2007

Over the past decade, labor costs have increased relative to the cost of material hardware according to analysts in the construction industry. Therefore, the minimum weight design, which has been widely adopted in the literature for the optimal design of steel structures, is no longer the most economical construction approach. Presently, although connection- related costs is crucial in determining the most cost-effective steel structures, most studies on this subject focused on minimum-weight design or engaged in higher analysis. Therefore, in this study, we proposed a fabrication scheme for the most cost-effective moment-resisting steel frame structures that resist lateral loads without compromising overall stability. The proposed approach considers the cost of steel products, fabrication, and connections within the design process. The optimal design considered construction realities, with the optimal trade-off between the number of moment connections and total cost was achieved by reducing the number of moment connections and rearranging them using the combination of analysis that includes shear, displacement and interaction value based on the LRFD code and optimization scheme based on genetic algorithms. In this study, we have shown the applicability and efficiency in the examples that considered actual loading conditions.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.20 no.3
• /
• pp.281-286
• /
• 2007

An engineering design problem involving Multi-Disciplinary Analysis(MDA) generally requires a large amounts of computing time for the entire design process, and therefore it is essential to introduce a Multiple Processor System (MPS) for reducing the computing time. However, when applying conventional parallel processing techniques, all of the CAE S/W requited for the MDA should be installed on all the servers making up MPS because of characteristic of MDA and it would be a great expense in CAE S/W licenses. To solve this problem, we propose a Weight-based Multiqueue Load Balancing algorithm for a heterogeneous MPS where performance of servers and CAE S/W installed on each server are different of each other. To validate the performance, a Computational experiments comparing the First Come First Serve algorithm and our proposed algorithm was accomplished.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.12A
• /
• pp.1181-1187
• /
• 2010

This paper proposes a mobile AI (Artificial Intelligence) conducting decision-making in the game through education for intelligent character on the basis of Neural Network. Neural Network is learned through the input/output value of the algorithm which defines the game rule and the problem solving method. The learned character is able to perceive the circumstances and make proper action. In this paper, the mobile AI using Neural Network has been step-by-step designed, and a simple game has been materialized for its functional experiment. In this game, the goal, the character, and obstacles exist on regular 2D space, and the character, evading obstacles, has to move where the goal is. The mobile AI can achieve its goals in changing environment by learning the solution to several problems through the algorithm defined in each experiment. The defined algorithm and Neural Network are designed to make the input/output system the same. As the experimental results, the suggested mobile AI showed that it could perceive the circumstances to conduct action and to complete its mission. If mobile AI learns the defined algorithm even in the game of complex structure, its Neural Network will be able to show proper results even in the changing environment.

• Proceedings of the KIEE Conference
• /
• 2007.11b
• /
• pp.69-71
• /
• 2007

최근 들어 전력 계통은 점차 복잡해지고 계통의 규모 역시 빠른 속도로 성장하고 있다. 한국전력거래소는 전력계통의 안정적, 경제적 운영을 담당하고 있는 기관으로 '01년 현재의 에너지관리시스템(EMS)를 도입하여 실시간 전력계통에 대한 정확한 판단을 기반으로 전력계통의 안정성과 경제성 확보에 주력하고 있다. EMS의 대표적인 기능은 계통데이터의 수집(SCADA), 자동발전제어(AGC), 계통해석(NA) 등으로 대별되며, 이중 계통해석 기능은 프로그램 규모면에서 가장 큰 부분을 차지하고 있다. 계통해석 기능은 또다시 상태추정(SE), 상정사고분석(CA), 안전도해석(SENH), 고장해석(SCT) 등의 프로그램으로 구성되어 다양한 실시간 계통해석을 수행하게 된다. 전력계통 해석은 먼저 대상계통을 수학적 모델로 정식화하기 전에 계통망의 기하학적 구조를 기술하는 단계가 필요한데 이를 토폴로지 처리라고 하며, 보통 그래프이론인 노트(Node)와 마디(Branch)를 사용하여 전력계통망을 구성하는 요소들의 연결관계를 정의하게 된다. 본고는 이론적 수준을 넘어 EMS의 계통해석 기능에서 실계통을 해석하기 위해 쓰이고 있는 토폴로지 처리의 기본 알고리즘을 분석하여 국내 전력산업 기술 선진화에 기여하고자 한다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.7B
• /
• pp.538-549
• /
• 2008

Recently IEEE 802.22 WG has considered Cognitive Radio (CR) technology to overcome shortage of communication channels. For using CR technology, accurate and rapid sensing method selection is extremely important. According to the channel sensing method, it is of the utmost importance because it can affect the incumbent system protection. So, optimum selection of channel sensing method is very important. IEEE 802.22 gives the solution, name of fine sensing, but the solution can not adapt to various networks. So in this paper we propose Policy-based Channel Sensing Architecture and Algorithms for Cognitive Radio Networks. The proposed channel sensing architecture and algorithms can reduce both primary system detection time and quiet time in our simulation. Among the proposed sensing algorithm, channel division round robin sensing reduce average detection time up to 70% compare to fine sensing method in IEEE 802.22.