• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.795-798
• /
• 2007

RFID 리더기가 영역내의 다수의 태그를 인식하기 위해선 충돌방지 알고리즘이 필수적으로 요구된다. 본 논문은 Auto ID Class 0에서 정의한 충돌방지 알고리즘인 Bit-by-Bit 이진트리 알고리즘(BBB)의 충돌 위치를 스택에 저장하고 이를 통해 다음 질의어를 결정함으로써 성능이 크게 개선된 Stack-bit-by-bit(SBBB) 알고리즘을 제안한다. 시뮬레이션을 통한 검증결과 질의-응답 횟수, 질의어의 크기, 응답어의 크기의 모든 면에서 성능이 개선된 것을 확인할 수 있었다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.33 no.3
• /
• pp.178-192
• /
• 2006

The buffer overflow attack is the single most dominant and lethal form of security exploits as evidenced by recent worm outbreaks such as Code Red and SQL Stammer. In this paper, we propose microarchitectural techniques that can detect and recover from such malicious code attacks. The idea is that the buffer overflow attacks usually exhibit abnormal behaviors in the system. This kind of unusual signs can be easily detected by checking the safety of memory references at runtime, avoiding the potential data or control corruptions made by such attacks. Both the hardware cost and the performance penalty of enforcing the safety guards are negligible. In addition, we propose a more aggressive technique called corruption recovery buffer (CRB), which can further increase the level of security. Combined with the safety guards, the CRB can be used to save suspicious writes made by an attack and can restore the original architecture state before the attack. By performing detailed execution-driven simulations on the programs selected from SPEC CPU2000 benchmark, we evaluate the effectiveness of the proposed microarchitectural techniques. Experimental data shows that enforcing a single safety guard can reduce the number of system failures substantially by protecting the stack against return address corruptions made by the attacks. Furthermore, a small 1KB CRB can nullify additional data corruptions made by stack smashing attacks with only less than 2% performance penalty.

• KIISE Transactions on Computing Practices
• /
• v.22 no.10
• /
• pp.497-503
• /
• 2016

Emerging next-generation storage technologies such as non-volatile memory will help eliminate almost all of the storage latency that has plagued previous storage devices. In conventional storage systems, the latency of slow storage devices dominates access latency; hence, software efficiency is not critical. With low-latency storage, software costs can quickly dominate memory latency. Hence, researchers have proposed the memory mapped file I/O to avoid the software overhead. Mapping a file into the user memory space enables users to access the file directly. Therefore, it is possible to avoid the complicated I/O stack. This minimizes the number of user/kernel mode switchings. In addition, there is no data copy between kernel and user areas. Despite of the benefits in the memory mapped file I/O, its overhead still needs to be addressed, as the existing mechanism for the memory mapped file I/O is designed for slow block devices. In this paper, we identify the overheads of the memory mapped file I/O via experiments.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.623-634
• /
• 2016

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.38 no.3
• /
• pp.22-30
• /
• 2001

This paper investigated future telemedicine as implementation of the telemonitoring system using LAN environment. For telemonitoring system rapidly implementation used the PC compatible embedded computing system in the ROMDOS and application program used the WATTCP that free TCP/IP Stack. Host computer program - programed by Visual C++ - had saved ECG signal and Patient Data coming inside Embedded PC and displayed. Embedded PC acquired ECG signal and transmitted a Packet to Host Computer. Host Computer remote access Embedded PC. This structure is the same Client/Sever Model. This system will be basic telemedicine model. There are problems of realtime telemonitoring because of network delay and data packet. Because of these problems, telemedicine systems will be required faster network speed and method of bio-signal transmission.

• Journal of the Korea Convergence Society
• /
• v.12 no.7
• /
• pp.45-51
• /
• 2021

In accordance with the rapid non-face-to-face environment and mobile first strategy, the explosive increase and creation of many structured/unstructured data every year demands new decision making and services using big data in all fields. However, there have been few reference cases of using the Hadoop Ecosystem, which uses the rapidly increasing big data every year to collect and load big data into a standard platform that can be applied in a practical environment, and then store and process well-established big data in a relational database. Therefore, in this study, after collecting unstructured data searched by keywords from social network services based on Hadoop 2.0 through three virtual machine servers in the Spring Framework environment, the collected unstructured data is loaded into Hadoop Distributed File System and HBase based on the loaded unstructured data, it was designed and implemented to store standardized big data in a relational database using a morpheme analyzer. In the future, research on clustering and classification and analysis using machine learning using Hive or Mahout for deep data analysis should be continued.

• Proceedings of the KIEE Conference
• /
• 2008.10b
• /
• pp.497-498
• /
• 2008

모바일 폰에서 IrDA를 통하여 개인정보 (전화번호부, 동영상, 사진등) 송수신시 IrMC, IrOBEX 그리고 HDLC 프로토콜 기반위의 IrLAP등의 프로토콜 스택을 사용하고 있다. Primary, secondary 두 mobile phone 간에 IrLAP layer의 payload data 송수신시 이용되는 3가지 physical layer schemes 중 전송속도 1l5.2kbps data rate의 제안된 표준인 Asynchronous(Async) frame 방식을 이용한다. [1] 현재의 모바일 폰에서는 Async frame scheme을 구현하기 위한 인터페이스 방식 중 UART 인터페이스를 이용하여 구현하고 있다. 현 모바일 폰에 이미 구현 되어 있는 기존 UART의 FIFO 제어 방법과 Interrupt service routine의 제어 알고리즘을 개선하여 기존 제어 방식과 비교하고 향상된 성능의 결과는 Throughput로 도출한다. 현 모바일 폰에서 사용자가 개인 정보 data등을 저장할 수 메모리 공간이 점점 늘어나고 있는 추세이다. Camera의 해상도 현 5Mega pixel까시 지원되고 동영상 파일 등도 근거리 무선통신인 IrDA로 송수신할 수 있으므로 본 성능비교 file의 size는 100Mega 이상도 비교할 수 있도록 하였다.

• Journal of KIISE:Software and Applications
• /
• v.35 no.11
• /
• pp.701-704
• /
• 2008

A general automaton allows multiple input transitions, so a special treatment is required when the history of transitions is needed. An LR automaton keeps the past transitions in the stack to use them during parsing. On the other hand, when each state in an automaton contains in itself the past transition history, the trace overhead of past transitions is unnecessary. The paper suggests a single state parsing automaton that does not depend on the past transitions. The applicable grammar class is less than LR grammars, but each state in a new automaton contains the past information, so the tracing of the history is not required compared to LR automaton.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11b
• /
• pp.16-18
• /
• 2005

웹은 사용자가 원하는 정보를 쉽고 정확하게 검색할 수 있도록 웹 문서를 자료구조화하여 보다 신뢰성 있는 패턴을 추출하고 사용자의 특성과 행동 패턴을 적용하여 개인화 하여야한다. 본 논문에서는 개인화하기 위한 전처리 과정으로서 웹 문서를 구조화 하는 방법을 제안한다. 제안 방법은 기본적으로 웹 문서 태그의 하이퍼링크를 깊이 우선 탐색 알고리즘을 사용하여 방향그래프를 만드는 것이다. 이때 웹 문서 태그 탐색 시 플래시, 스크립트 등의 찾기 힘든 하이퍼링크를 찾는 문제와 '뒤로' 버튼 사용 시 웹 접근로그에 기록되지 않는 문제점을 보완한다. 이를 위해 클릭 스트림을 스택에 저장하여 이미 만들어진 방향그래프와 비교하여 새롭게 찾은 정점과 간선을 추가함으로써 보다 신뢰성높은 방향그래프를 만든다.

• Proceedings of the Korean Society of Propulsion Engineers Conference
• /
• 2007.04a
• /
• pp.87-90
• /
• 2007

Fuel cell power system was developed for high-endurance unmanned aerial vehicle (UAV). Liquid chemical hydride was selected as a fuel due to its high energy density. Liquid storage of the fuel is an ideal alternative solution of the existing compressed hydrogen storage. The fueling system that extracts hydrogen from chemical hydride consists of catalytic reactor, micro-pump, fuel cartridge, separator, and controller. The fuel cell power system including the fueling system and the fuel cell that generates electricity was integrated into a proposed UAV. The performance verification of the fuel cell power system was performed to use as a power plant of the UAV.