• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06c
• /
• pp.550-553
• /
• 2010

버퍼 오버플로우의 공격은 스택의 영역뿐만 아니라 데이터 세그먼트나 힙 영역에서도 다양한 형태가 가능하다. 이 논문은 힙 영역에 대한 동적 메모리 할당 함수의 취약점 공격을 방지하는 방안을 제시한다. 제안된 방법은 데이터 포인터의 값을 암호화 하여 저장하고, 참조할 때 복호화 한다. 힙 공격은 원하는 주소에 원하는 값을 기록할 수 있게 하기 때문에 데이터 변수 또는 포인터 공격에 활용될 수 있다. 데이터 포인터 암호화는 아직 알려지지 않은 데이터 포인터와 변수에 대한 공격까지 방어할 수 있을 것으로 예상된다.

• Journal of the HCI Society of Korea
• /
• v.2 no.1
• /
• pp.57-63
• /
• 2007

Our research was performed in order to implement a new pointing device for human-computer interactions in a collaborative environments based on Tiled Display system. We mainly focused on tracking the position of an infrared light source and applying our system to various areas. More than simple functionality of mouse clicking and pointing, we developed a device that could be used to help people communicate better with the computer. The strong point of our system is that it could be implemented in any place where a camera can be installed. Due to the fact that this system processes only infrared light, computational overhead for LED recognition was very low. Furthermore, by analyzing user's movement, various actions are expected to be performed with more convenience. This system was tested for presentation and game control.

• Journal of KIISE:Software and Applications
• /
• v.29 no.11
• /
• pp.851-859
• /
• 2002

This paper discusses the design of a working system that visually recognizes hand gestures for the control of a window based user interface. We present a method for tracking the fingertip of the index finger using a single camera. Our method is based on CAMSHIFT algorithm and performs better than the CAMSHIFT algorithm in that it tracks well particular hand poses used in the system in complex backgrounds. We describe how the location of the fingertip is mapped to a location on the monitor, and how it Is both necessary and possible to smooth the path of the fingertip location using a physical model of a mouse pointer. Our method is able to track in real time, yet not absorb a major share of computational resources. The performance of our system shows a great promise that we will be able to use this methodology to control computers in near future.

• Journal of KIISE:Information Networking
• /
• v.28 no.4
• /
• pp.455-462
• /
• 2001

In this paper, we propose a deterministic algorithm to solve the resource discovery problem, that is, some subset of machines to learn the existence of each other in a large distributed network. Harchol et al. proposed a randomized algorithm solving this problem within O($log^2\;n$) rounds with high probability, which requires O($nlog^2\;n$) connection communication complexity and O($n^2log^2\;n$) pointer communication complexity, where n is the number of machines in the network. His solution is based on randomization method and it is difficult to determine convergence time. We propose an efficient algorithm which improve performance and the non-deterministic characteristics. Our algorithm requires O(log n) rounds which shows O(mlog n) connection communication complexity and O($n^2log\;n$) pointer communication complexity, where m is the number of links in the network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.5C
• /
• pp.411-421
• /
• 2002

In this paper, we present a new survivor path memory management method and a dedicated hardware architecture for the design of high-speed Viterbi decoders in modern digital communication systems. In the proposed method, a novel use of k-starting node number deciding circuits enables to acheive the immediate traceback of the merged survivor path from which we can decode output bits, and results in smaller survivor path memory size and processing delay time than the previously known methods. Also, in the proposed method, the survivor path memory can be constructed with ease using a simple standard dual-ported memory since one read-pointer and one write-pointer, that are updated at the same rate, are required for managing the survivor path: the previously known algorithms require either complex k-ported memory structure or k-times faster read capability than write. With a moderate hardware cost for immediate traceback capability the proposed method is superior to the previously known methods for high-speed Viterbi decoding.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.4
• /
• pp.232-239
• /
• 2003

This paper discusses the design and implementation of a human-oriented interface based on computer vision that efficiently controls presentation slides. The user does not have to be confined to a keyboard or mouse any more, and can move around more freely because slides for presentation can be up and down using a general laser pointer that is used for presentation. Regions for virtual buttons are set on the slide so that the user can conveniently point the buttons using the laser pointer. We have proposed a simple and efficient method that computes the button areas in the image without complicated calibration. The proposed method has been implemented based on Microsoft PowerPoint ; moreover it can be applied to other PowerPoint-like presentation softwares. Our method for human-centered slide control enables the user to give audiences a more interactive presentation in a natural way.

• International Journal of Precision Engineering and Manufacturing
• /
• v.7 no.2
• /
• pp.41-45
• /
• 2006

This paper deals with human spatial cognition using visual and auditory stimulation. More specially, this investigation is to observe the relationship between the head and the eye motor system for the localization of visual target direction in space and to try to describe what is the role of right-side versus left-side pinna. In the experiment of visual stimulation, nineteen red LEDs (Luminescent Diodes, Brightness: $210\;cd/^2$) arrayed in the horizontal plane of the surrounding panel are used. Here the LEDs are located 10 degrees apart from each other. Physiological parameters such as EOG (Electro-Oculography), head movement, and their synergic control are measured by BIOPAC system and 3SPACE FASTRAK. In the experiment of auditory stimulation, one side of the pinna function was distorted intentionally by inserting a short tube in the ear canal. The localization error caused by right and left side pinna distortion was investigated as well. Since a laser pointer showed much less error (0.5%) in localizing target position than FASTRAK (30%) that has been generally used, a laser pointer was used for the pointing task. It was found that harmonic components were not essential for auditory target localization. However, non-harmonic nearby frequency components was found to be more important in localizing the target direction of sound. We have found that the right pinna carries out one of the most important functions in localizing target direction and pure tone with only one frequency component is confusing to be localized. It was also found that the latency time is shorter in self moved tracking (SMT) than eye alone tracking (EAT) and eye hand tracking (EHT). These results can be used in further study on the characterization of human spatial cognition.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2007.10a
• /
• pp.87-90
• /
• 2007

Many moderncommunication technologies are developing based on internet protocol (IP) and there is many work to archive seamless mobility service. IETF proposed MIPv6 protocol that uses IPv6 to provide mobility services to mobile node however it has some limits like sending and receiving too many messages during binding update (BU) procedure. So, now a day it makes HMIPv6(Hierarchical Mobile IPv6). HMIPv6 solves overhead and transmission delay problem in MAP(Mobile Anchor Pointer), but it can't accomplish effectively Macro handover between MAPs. This paper introduces use of FMIPv6 and Selective handover mechanisms based on hierarchical MAP information in HMIPv6 for improvement of handover efficiency.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.5
• /
• pp.422-428
• /
• 2013

Recently, many unmanned aerial vehicle (UAV) studies have focused on small UAVs, because they are cost effective and suitable in dangerous indoor environments where human entry is limited. Map building through distance measurement is a key technology for the autonomous flight of small UAVs. In many researches for unmanned systems, distance could be measured by using laser range finders or stereo vision sensors. Even though a laser range finder provides accurate distance measurements, it has a disadvantage of high cost. Calculating the distance using a stereo vision sensor is straightforward. However, the sensor is large and heavy, which is not suitable for small UAVs with limited payload. This paper suggests a low-cost distance measurement system using a laser pointer and a monocular vision sensor. A method to measure distance using the suggested system is explained and some experiments on map building are conducted with these distance measurements. The experimental results are compared to the actual data and the reliability of the suggested system is verified.

• The KIPS Transactions:PartC
• /
• v.11C no.3
• /
• pp.387-394
• /
• 2004

One of the main challenges in personal communication services(PCS ) Is to locate many mobile terminals that nay move from place to place frequently. This kind of system operation is called location management. This task entails sophisticated signaling traffic and database queries. Several strategies have been proposed to improve the efficiency of location management. These strategies use location register databases to store the current locations of mobile terminals, and are vulnerable to failure of the location register databases. In this paper, we propose a fault-tolerant pointer forwarding scheme with distributed home location register in order to tolerate the failure of location registers. The performance of the proposed scheme is evaluated analytically by simulation, and Is compared with Biaz's bypass forwarding strategy and two-path forwarding strategy.