• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.4
• /
• pp.47-60
• /
• 2011

With the increase in the use of mobile banking service, mobile banking has become an attractive target to attackers. Even though many security measures are applied to the current mobile banking service, some threats such as physical theft or penetration to a mobile device from remote side are still remained as unsolved. With aiming to fill this void, we propose a novel approach to prevent e-financial incidents by analyzing mobile device user's input patterns. This approach helps us to distinguish between original user's usage and attacker's usage through analyzing personal input patterns such as input time-interval, finger pressure level on the touch screen. Our proposed method shows high accuracy, and is effective to prevent the e-finance incidents proactively.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2007.11a
• /
• pp.41-44
• /
• 2007

특정 분야별로 구축되는 온톨로지에 관하여 그 언스턴스를 쉽고 빠르게 구축하기 위해서는 구조화된 문서를 이용하는 것이 효율적이다. 그러나, 일반적인 웹 문서는 모든 분야에 대하여 다양한 형식으로 표현되어 존재하기 때문에, 대상이 되는 구조 문서를 자동으로 수집하기는 쉽지 않다. 본 논문에서는 웹사이트의 URL 패턴을 XML 기반의 스크립트로 정의하여, 필요한 웹 문서만을 지능적으로 수집하는 방안을 제안한다. 제안하는 수집 방안은 구조화된 형태로 정보를 제공하는 사이트에 대해서 매우 빠르고 효율적으로 적용될 수 있다. 본 논문에서는 제안하는 방법을 적용하여 5만개 이상의 웹 문서를 수집하였다.

• Journal of Korea Game Society
• /
• v.5 no.4
• /
• pp.23-32
• /
• 2005

This paper introduces environment analysis way to improve the game AI. The way of environment analysis can provide game user the more reality than generally used AI patterns. This paper suggests the way to make die NPC patterns variously. To realize this theory we designed the organization of NPC server newly, and also accomplished the experiment of NPC server simulation test to get the performance applied in real situation.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.2 s.34
• /
• pp.133-141
• /
• 2005

We need to study on simulation method of user's mobility Patterns for the performance analysis of the location management in wireless mobile networks. For this purpose ,this paper presents a user mobility model of wireless mobile networks with regular Patterns Sometimes mobile users randomly move , but they show the movement characteristics that regularly change their locations in some patterns in given time slots. So, we suggest the mobility model that can describe user's time related movement patterns. This model consists of some elements-positions, transitions , transition Probabilities which are variable, and some geographical paths for each transitions. We describe the simulation method for users' mobilities with random movements and regular movements , too. The simulation results by the model show that the suggested model can generate movement scenarios having regular patterns related with location and time.

• Spatial Information Research
• /
• v.6 no.1
• /
• pp.11-23
• /
• 1998

Map generalization functions to visualize the spatial data or to change their scale by changing the level of details of data. Until recently, the studies on map generalization have concentrated more on line features than on point features. However, point features are one of the essential components of digital maps and cannnot be ignored because of the great amount of information they carry. This study, therefore, aimed to find out a detailed procedure of point features' generalization. Particularly, this work chose the distribution pattern of point features as the most important factor in the point generalization in investigating the geometric characteristics of source data. First, it attempted to find out the characteristics of distribution pattern of point features through quadrat analysis with Grieg-Smith method and nearest-neighbour analysis. It then generalized point features through the generalization threshold which did not alter the characteristics of distribution pattern and the removal of redudant point feautres. Therefore, the generalization procedure of point features provided by this work maintained the geometric characteristics as much as possible.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.32 no.3
• /
• pp.477-486
• /
• 2022

This study aims to present a method using event sourcing patterns and blockchain as a way to cope with vulnerabilities in memory manipulation at the client level. To verify the plan, the method of running the memory operation application was analyzed, and the performance was compared and analyzed when the memory operation prevention plan was applied by fabricating a test application. As a result of the analysis, the usage of memory increased compared to the method of XOR operation by storing major data in one memory, but it was possible to prevent the operation of the memory operation program without significantly affecting the performance of the game.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.2 no.1
• /
• pp.71-77
• /
• 2003

본 논문에서는 불량 하드디스크 드라이브의 수리판정 자동화를 위해 필요한 하드디스크 드라이브(Hard Disk Drive, HDD) 결함의 분포패턴의 분류에 관한 연구 결과를 소개한다. HDD 제조공정에서는 테스트 진행 중 검출된 결함에 관한 정보를 HDD 내부에 기록한다. 불량으로 판별된 HDD는 내부에 기록된 결함의 분포론 관찰한 후, 불량의 종류 및 그에 따른 처리방안을 결정한다. 본 논문에서는 효율적인 결함분포 패턴의 특징추출을 위해, 하드디스크의 물리적 특성에 대한 분석을 바탕으로 극좌표 (Polar Coordinates) 방식으로 표현된 결함 위치 데이터를 직교좌표(Cartesian Coordinates)로 변환한다. 그리고 디스크 상의 두 동심원 사이의 공간을 정해진 회전각별로 등분한 후, 나누어진 구간별로 결함 발생빈도 히스토그램 (Histogram) 분석을 수행하여 결함분포의 패턴을 분류하는 알고리즘을 제시한다. 설계된 알고리즘은 실제 HDD 제조공정에서 발생한 불량 HDD Set을 대상으로 적용한 결과, 그 효용성이 검증되었다.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.16 no.5
• /
• pp.594-600
• /
• 2006

The optimization has been performed to search an economical running pattern in the view point of trip time and energy consumption. Fuzzy control model has been applied to build the meta-model. To identify the structure and its parameters of a fuzzy model, fuzzy c-means clustering method and differential evolutionary scheme ate utilized, respectively. As a result, two meta-models for trip time and energy consumption are constructed. The optimization to search an economical running pattern is achieved by differential evolutionary scheme. The result shows that the proposed methodology is very efficient and conveniently applicable to the operation of railway system.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.2
• /
• pp.261-266
• /
• 2014

The current status of domestic monitoring centers was reviewed and the pattern-based security monitoring system and the centralized security monitoring system, both of which are the characteristics of security monitoring systems, were analyzed together with their advantages and disadvantages. In addition, as for a development plan of domestic security monitoring systems, in order to improve the problems of the existing pattern-based centralized monitoring system, Honeynet and Darknet, which are based on anomalous behavior detection, were analyzed and their application plans were described.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.3
• /
• pp.395-404
• /
• 2013

A pattern matching algorithm plays an important role in traffic identification and classification based on predefined patterns for intrusion detection and prevention. As attacks become prevalent and complex, current patterns are written using regular expressions, called regexes, which are expressed into the deterministic finite automata(DFA) due to the guaranteed worst-case performance in pattern matching process. Currently, because of the increased complexity of regex patterns and their large number, memory-efficient DFA from states reduction have become the mainstay of pattern matching process. However, most of the previous works have focused on reducing only the number of states on a single automaton, and thus there still exists a state blowup problem under the large number of patterns. To solve the above problem, we propose a new state compression algorithm that merges states on multiple automata. We show that by merging states with the same input character on multiple automata, the proposed algorithm can lead to a significant reduction of the number of states in the original DFA by as much as 40.0% on average.