• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4933-4956
• /
• 2016

Use-After-Free (UAF) is a common lethal form of software vulnerability. By using tools such as Web Browser Fuzzing, a large amount of samples containing UAF vulnerabilities can be generated. To evaluate the threat level of vulnerability or to patch the vulnerabilities, automatic deduplication and exploitability determination should be carried out for these samples. There are some problems existing in current methods, including inadequate pertinence, lack of depth and precision of analysis, high time cost, and low accuracy. In this paper, in terms of key dangling pointer and crash context, we analyze four properties of similar samples of UAF vulnerability, explore the method of extracting and calculate clustering eigenvalues from these samples, perform clustering by fast search and find of density peaks on a large number of vulnerability samples. Samples were divided into different UAF vulnerability categories according to the clustering results, and the exploitability of these UAF vulnerabilities was determined by observing the shape of class cluster. Experimental results showed that the approach was applicable to the deduplication and exploitability determination of a large amount of UAF vulnerability samples, with high accuracy and low performance cost.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1225-1235
• /
• 2016

This paper presents a method for computer-assisted slide presentation using vision-based gesture recognition. The proposed method consists of a sequence of steps, first detecting a hand in the scene of projector beam, then estimating the smooth trajectory of a hand or a pointing finger using Kalman Filter, and finally interfacing to an application system. Additional slide navigation control includes moving back and forth the pages of the presentation. The proposed method is to help speakers for an effective presentation with natural improved interaction with the computer. In particular, the proposed method of using finger pointing is believed to be more effective than using a laser pointer since the hand, the pointing or finger are more visible and thus can better grab the attention of the audience.

• Journal of Multimedia Information System
• /
• v.7 no.4
• /
• pp.249-256
• /
• 2020

Learning methods using various assistive and smart devices have been developed to enable independent learning of the disabled. Pointer control is the most important consideration for the disabled when controlling a device and the contents of an existing graphical user interface (GUI) environment; however, difficulties can be encountered when using a pointer, depending on the disability type; Although there are individual differences depending on the blind, low vision, and upper limb disability, problems arise in the accuracy of object selection and execution in common. A multimodal interface pilot solution is presented that enables people with various disability types to control web interactions more easily. First, we classify web interaction types using digital devices and derive essential web interactions among them. Second, to solve problems that occur when performing web interactions considering the disability type, the necessary technology according to the characteristics of each disability type is presented. Finally, a pilot solution for the multimodal interface for each disability type is proposed. We identified three disability types and developed solutions for each type. We developed a remote-control operation voice interface for blind people and a voice output interface applying the selective focusing technique for low-vision people. Finally, we developed a gaze-tracking and voice-command interface for GUI operations for people with upper-limb disability.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2010.11a
• /
• pp.617-620
• /
• 2010

최근 고성능 모바일 단말기와 다양한 컨텐츠가 등장하면서 유비쿼터스 환경에서의 사용자 인터페이스에 대한 관심이 높아지고 있다. 특히 모바일 프로젝터는 장소의 제한을 받지 않고 큰 화면을 다른 사람과 공유할 수 있는 장점이 있는 반면에 단말기를 직접 제어해야 하는 불편함이 있다. 본 논문에서는 모바일 환경에서 카메라를 통해 입력된 영상 정보만으로 사용자가 스크린에 비추는 레이저 포인터를 실시간으로 검출하는 알고리즘을 제안한다. 제안하는 알고리즘은 색상 감지와 움직임 감지로 나뉜다. 단일 프레임에서 영상 성분의 평균을 이용한 조건을 검사하여 레이저 포인터 색상 영역을 검출하고, 인접한 프레임과 현재 프레임과의 차를 구하며 그 차이가 임계값보다 큰 영역을 움직임 영역으로 검출한다. 마지막으로 색상 검출 영역과 움직임 검출 영역을 동시에 만족하는 영역을 최종적으로 레이저 포인터 영역으로 인식한다. 본 기법은 영상 정보만 사용하기 때문에 센서나 불필요한 장비를 착용할 필요가 없고 영상 성분 평균을 이용하므로 프로젝터 성능에 따른 조도의 변화에 강건하여 효과적인 레이저 포인터 검출이 가능하다. 실험결과는 주변 조명의 밝기에 따라 차이가 있지만 대부분 80% 이상의 검출률과 16% 미만의 오검출률의 성능으로 나타났고, 이 같은 결과는 사용자의 주관적인 만족을 보장하였다.

• Journal of Advanced Navigation Technology
• /
• v.27 no.3
• /
• pp.274-280
• /
• 2023

The Fix-to-Fix Navigation is the technique for aircraft pilots to find out estimated Heading when crossing from present fix to other fix to want to go in the air. Because this is based on the Rule of Thumb method from one's experience, it could not find out exact estimated Heading. Furthermore if the pilot nears going fix, Bearing Pointer and Course Indicator of HSI are too close to use this technique, that makes the pilot lost in the air. In this paper, We take Limits of Trigonometric Functions into the Fix-to-Fix Navigation to overcome these disadvantages. This study introduces two solutions using Limits of Trigonometric Functions when doing Fix-to-Fix Navigation and analyzes the error of this solutions.

• Annual Conference on Human and Language Technology
• /
• 2020.10a
• /
• pp.535-539
• /
• 2020

다양한 발화를 모델링하는 요구는 자연어 처리 분야에서 꾸준히 있었으며 단어, 구 또는 문장과 동등한 의미 콘텐츠를 자동으로 식별하고 생성하는 것은 자연어 처리의 중요한 부분이다. 본 논문에서는 포인터 생성 네트워크(Pointer Generate Nework)를 이용하여 패러프레이즈 생성 모델을 제안한다. 제안한 모델의 성능을 측정하기 위해 사람이 직접 구축한 유사 문장 코퍼스를 이용하였으며, 토큰 단위의 BLEU-4 0.250, ROUGE_L 0.455, CIDEr 2.190의 성능을 보였다. 하지만 입력 문장과 동일한 문장을 출력하는 문제점이 존재하여 빔서치(beam search)를 적용하여 입력 문장과 비교하여 생성 문장을 선택하는 방식을 적용하였다. 입력 문장과 동일한 문장을 제외한 문장으로 평가를 진행했으며, 토큰 단위의 BLEU-4 0.234, ROUGE_L 0.459, CIDEr 2.041의 성능을 보였으나, 패러프레이즈 생성 데이터 양이 크게 증가하였다. 본 연구는 문장 간의 의미적으로 동일한 정보를 정확하게 추출할 수 있게 됨으로써 정보 추출, 온톨로지 생성에 도움이 될 것이다. 또한 이러한 기법이 챗봇에서 사용자의 의도 탐지 및 MRC와 같은 자연어 처리의 여러 분야에 유용한 자원으로 사용될 것이다.

• The KIPS Transactions:PartD
• /
• v.14D no.1 s.111
• /
• pp.21-34
• /
• 2007

According to recent rapid price drop and capacity growth of main memory, the number of applications on main memory databases is dramatically increasing. Cache miss, which means a phenomenon that the data required by CPU is not resident in cache and is accessed from main memory, is one of the major causes of performance degradation of main memory databases. Several cache-conscious trees have been proposed for reducing cache miss and making the most use of cache in main memory databases. Since each cache-conscious tree has its own unique features, more than one cache-conscious tree can be used in a single application depending on the application's requirement. Moreover, if there is no existing cache-conscious tree that satisfies the application's requirement, we should implement a new cache-conscious tree only for the application's sake. In this paper, we propose the cache-conscious generalized search tree (CC-GiST). The CC-GiST is an extension of the disk-based generalized search tree (GiST) [HNP95] to be tache-conscious, and provides the entire common features and algorithms in the existing cache-conscious trees including pointer compression and key compression techniques. For implementing a cache-conscious tree based on the CC-GiST proposed in this paper, one should implement only a few functions specific to the cache-conscious tree. We show how to implement the most representative cache-conscious trees such as the CSB+-tree, the pkB-tree, and the CR-tree based on the CC-GiST. The CC-GiST eliminates the troublesomeness caused by managing mire than one cache-conscious tree in an application, and provides a framework for efficiently implementing arbitrary cache-conscious trees with new features.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.370-381
• /
• 2005

Mobile IP provides an efficient and scalable mechanism for host mobility within the Internet. Using Mobile If, mobile nodes may change their point of attachment to the Internet without changing their If address. However, it would result in a high signaling cost. To reduce the signaling cost, we factor in the fact that mobile users will not be actively communicating much of the time. In fact, there Is no necessity to send a binding update message to the home agent when an mobile node does not communicates with others while moving. From this point of view, we propose a lazy update strategy for minimizing signaling cost using the forwarding pointer in hierarchical Mobile IPv6. In our proposal, binding updates are sent only when a mobile node is in a busy mode. If an mobile node is in a dormant mode, binding update messages are delayed until busy mode using the forwarding pointer. As a result, our proposal can reduce the total signaling cost by eliminating unnecessary binding update messages when a mobile node Is in a dormant mode. In addition to, our proposal reduces unnecessary location update cost resulting from ping-pong effect under mobile node's dormant mode. Analysis results using the discrete analytic model presented in this paper shows that our proposal can has superior performance than hierarchical Mobile nv6 when the call-to-mobility ratio is low and the length of the forwarding pointer chain K is low.

• KIPS Transactions on Software and Data Engineering
• /
• v.11 no.8
• /
• pp.315-324
• /
• 2022

In this paper, we propose KoEPT, a Transformer-based generative model for automatic math word problems solving. A math word problem written in human language which describes everyday situations in a mathematical form. Math word problem solving requires an artificial intelligence model to understand the implied logic within the problem. Therefore, it is being studied variously across the world to improve the language understanding ability of artificial intelligence. In the case of the Korean language, studies so far have mainly attempted to solve problems by classifying them into templates, but there is a limitation in that these techniques are difficult to apply to datasets with high classification difficulty. To solve this problem, this paper used the KoEPT model which uses 'expression' tokens and pointer networks. To measure the performance of this model, the classification difficulty scores of IL, CC, and ALG514, which are existing Korean mathematical sentence problem datasets, were measured, and then the performance of KoEPT was evaluated using 5-fold cross-validation. For the Korean datasets used for evaluation, KoEPT obtained the state-of-the-art(SOTA) performance with 99.1% in CC, which is comparable to the existing SOTA performance, and 89.3% and 80.5% in IL and ALG514, respectively. In addition, as a result of evaluation, KoEPT showed a relatively improved performance for datasets with high classification difficulty. Through an ablation study, we uncovered that the use of the 'expression' tokens and pointer networks contributed to KoEPT's state of being less affected by classification difficulty while obtaining good performance.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1993.10a
• /
• pp.50-50
• /
• 1993

이 연구는 선형계획법을 위하여 개발된 프로그램들의 언어 및 자료 구조에 대한 차이를 비교, 분석하고자 한다. 선형계획법을 위하여 사용된 언어로는 C, PASCAL, FORTRAN이 있고 자료구조로는 Full Matrix형태와 Non-Zero Matrix형태를 고려한다. Non-Zero Matrix에서는 프로그램 언어별로 Cursor-Based System을 비교하고자 한다. 위의 실험을 수행하기 위하여 다음의 연구과정을 수행한다. 첫째, Non-Zero Matrix의 이용을 위한 Cursor-Based System과 Pointer-Based System을 설계한다. 둘째, LP프로그램을 위한 Full Matrix와 Non-Zero Matrix의 효율적인 자료구조를 구축한다. 세째, 프로그램 언어와 자료구조별로 LP프로그램의 성능을 비교분석한다.