• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1543-1545
• /
• 2008

Scanning 은 불특정 사용자가 특정 시스템 혹은 네트워크에 대해 Dos/DDos Attack 을 하기에 앞서 취약성이 존재할 수 있는 서비스나 호스트를 발견하기 위해 취해지는 선행 기술 중 하나이다. 본 논문에서는 기존에 알려진 대표적인 Port Scanning 기법들에 대해 알아보고 기존에 널리 사용되고 있는 탐지 및 방어 기법과 이러한 방식이 가질 수 있는 문제점에 대해서도 살펴본 후 이를 보완할 수 있는 기법을 논의하고자 한다.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.116-124
• /
• 2012

In this paper, we propose an efficient lighting control system design for AVR based LSDM control. This paper, an efficient lighting control system design for LSDM control be design divided as the signal control part for I/O data bus and the timer/counter part for clock signal control according to operating conditions. LSDM control logic be optimization to PORTx and DDRx register by specifying the logical value of each bit for effective control signal processing. And, the LSDM control signal by lighting control program execution of ATmega128 be designed to be LSDM lighting control by control logic operating. In this paper, a proposed lighting control system were measured to power loss rate to proved the power loss reduction about lighting status of LSDM control logic by download the lighting control program to system through serial from host PC. As a measurement result, a proposed lighting control system than the existing lighting control system were proved to be effective to the overall power consumption reduction.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.264-276
• /
• 2000

Recent advances of technologies make easy sharing various information and utilizing system resources on the Internet. Especially, code migration using applets of Java supports the distribution of programs on the web environment, and also browsers executing the applets guarantee the reliability of a migrated codes. In this paper, we describe the design and implementation of a web-based parallel processing system, which distributes migratable codes of a large job, makes the distributed codes to execute in parallel, and controls and gathers the results of each execution. The hosts participate in the computation reside on the Internet, spreaded out geographically, and the heterogeneity and the variability among them are severe. Thus, task allocation considering the performance differences and the adaptability to the severe variability are necessary. We present an adaptive task allocation algorithm applied to our system and the performance evaluation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.5C
• /
• pp.439-444
• /
• 2010

In this paper, we derive and analyze the channel capacity of the spread spectrum watermarking (SSW) system as an information-theoretic point of view in closed-form approximation formula in order to analyze the effect of the wireless multipath/shadowing channel. It is important to analyze the channel capacity to transmit an additive data through existing wireless channel by the SSW system. From the results, we confirm that the channel capacity of the SSW system can be determined by the HWR, WNR, PN length and host sampling frequency. Also, we verified that the variation of the channel capacity when the SSW system applied to Nakagami-m fading and Log-normal shadowing channel. The results of this paper can be applied to general spread spectrum watermarking system.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2E
• /
• pp.58-67
• /
• 1994

Hidden Markov Model (HMM)-based algorithms have been used successfully in many speech recognition systems, especially large vocabulary systems. Although general purpose processors can be employed for the system, they inevitably suffer from the computational complexity and enormous data. Therefore, it is essential for real-time speech recognition to develop specialized hardware to accelerate the recognition steps. This paper concerns with a real-time implementation of an isolated word recognition system based on HMM. The speech recognition system consists of a host computer (PC), a DSP board, and a prototype Viterbi scoring board. The DSP board extracts feature vectors of speech signal. The Viterbi scoring board has been implemented using three field-programmable gate array chips. It employs a hardware-efficient Viterbi scoring architecture and performs the Viterbi algorithm for HMM-based speech recognition. At the clock rate of 10 MHz, the system can update about 100,000 states within a single frame of 10ms.

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.357-362
• /
• 2007

In distributed systems like cluster systems, in order to get more performance improvement, the initial task placement system precisely estimates and correctly assigns the resource requirement by the process. The resource-based initial job placement scheme needs the prediction of resource usage of a task in order to fit it to the most suitable hosts. However, the wrong prediction of resource usage causes serious performance degradation in dynamic load balancing systems. Therefore, in this paper, to resolve the problem due to the wrong prediction, we propose a new load metric. By the new load metric, the resource-based initial job placement scheme can work without priori knowledge about the type of process. Simulation results show that the dynamic load balancing system using the proposed approach achieves shorter execution times than the conventional approaches.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.24 no.7
• /
• pp.879-884
• /
• 2020

In the conventional video file system, videos are stored in a high performance server which has mass storage hard disks or disk arrays. For 3D internet broadcasting, real time operations are required to transmit video files to many clients. This paper describes the design of the 3D internet broadcasting system which can provide realtime streaming service to many users in the 5G environment. In reality, unicast is used to transmit multimedia contents over the internet rather than IP multicast since IP multicast has its own drawbacks in deployment, security, maintenance and so on. In addition, multimedia broadcasting service system like VoD has difficulties in applying to 3D internet broadcasting system since it requires a large amount of system and network resources. In this work, we develop a 3D internet broadcasting system which can construct effective data delivery by minimizing performance-degrading factors.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1229-1236
• /
• 2006

Group oriented multicast service is a prerequisite for the current application system for remote lecture and customer service. IP multicast is used to be generally accepted as an internet standard. IP multicast which is designed to support network based replication model can efficiently use host and network resource, however it has some weak points that it has to support IP multicast in the internet by adding multicast-capable internet infrastructure such as router and is vulnerable to security by using public IP address for group identifier. Therefore we propose the trigger based application level multicast model that can enhance both scalability and security by separating the functions, which send and receive message to solve these problems. Our suggested model is expected to ensure the promotion of quality of service and reliability.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.4
• /
• pp.841-847
• /
• 2015

The WAVE(Wireless Access in Vehicular Environments) communication system supports wireless communication environments between vehicles. As the utilization of wireless communication has been increased, attack methods have been varied. There is a high risk on packet manipulations conducted by third party. In this paper, we have designed a secure communication protocol between CA and vehicles. Our designed protocol uses a ECIES(Elliptic Curve Integrated Encryption Scheme) for vehicle authentication and AES(Advanced Encryption Standard) algorithm for protecting packet integrity and confidentiality.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06a
• /
• pp.69-72
• /
• 2011

플래시 메모리 기반의 저장 시스템은 빠른 접근 속도, 작고 가벼운 특성, 저전력 소모 등의 이유로 하드 디스크를 대체하는 저장 매체로 주목 받고 있다. 플래시 메모리는 하드 디스크와 다르게 읽기 쓰기 소거 연산이 필요하며 수혈 단위와 수혈 시간 이 비대칭적이다. 또한 제자리 갱신이 불가능하기 때문에 가장 느린 소거 동작을 선행하여 갱신 연산을 수행한다. 기존 호스트 시스템은 읽기 쓰기 연산 만을 수행하기 때문에 플래시 메모리를 바로 사용하기 위해서는 별도의 소프트웨어 중간 계층인 플래시 전환 계층이 필요하다. 그러나 디스크 기반의 B-트리를 플래시 전환 계층 위에서 인덱스로 사용하면 B-트리 특성상 제자리 갱신이 빈번하게 발생하기 때문에 성능 저하가 발생한다. 따라서 플래시 메모리 특성을 고려한 새로운 인덱스 구조가 필요하게 되었다. 플래시 메모리 전용의 인덱스 ${\mu}$-트리와 LSB-트리가 제안 되었지만, ${\mu}$-트리는 페이지 관리의 비효율성, LSB-트리는 임시 노드 관리 추가 비용의 문제점을 가지고 있다. 본 논문에서 ${\mu}$-트리와 LSB 트리의 문제점을 해결하기 위하여 지연 갱신을 이용한 B-트리를 제안한다. 제안하는 인덱스는 변경이 일어나는 노드를 메모리에 적재시켜 데이터 삽입 시 노드 갱신을 지연시키고 노드 분할 없이 데이터의 순차 삽입을 처리하여 검색 및 쓰기 성능을 향상시킨다. 본 논문에서는 관련 연구인 ${\mu}$-트리와 LSB-트리를 수식을 통하여 제안하는 인덱스 구조의 우수성을 보인다.