• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.1-16
• /
• 2008

Join queries having heavy cost are necessary to Data Stream Management System in Sensor Network where plural short information is generated. It is reasonable that each join operator has a sliding-window constraint for preventing DISK I/O because the data stream represents the infinite size of data. In addition, the join operator should be able to take multiple inputs for overall results. It is possible for the MJoin operator with sliding-windows to do so. In this paper, we consider the data stream environment where multiple MJoin operators are registered and propose MMJoin which deals with issues of building and processing a globally shared query considering characteristics of the MJoin operator with sliding-windows. First, we propose a solution of building the global shared query execution plan. Second, we solved the problems of updating a window size and routing for a join result. Our study can be utilized as a fundamental research for an optimization technique for multiple continuous joins in the data stream environment.

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.224-238
• /
• 2006

As XML became the standard of data exchange in the internet, the needs for effective query processing for XML data in streaming environment is increasing. Applying the existing database technique which processes data with the unit of tuple to the streaming XML data causes the out-of-memory problem due to limited memory volume. Likewise the cost for searching query path and accessing specific data may be remarkably increased because of special structure of XML. In a word it is unreasonable to apply the existing database system to the streaming environment that processes query for partial data, not the whole one. Thus, it should be able to search partial streaming data that rapidly satisfies join predicate through using low-capacity memory, based on a store technique suitable to streaming XML data. In this thesis, in order to study the store technique for low-capacity memory, the PCDATA and the CDATA-related parts, which can be used as predicate on join query, were fetched and saved. In addition, in an attempt to compare rapid join predicates, the range window of streaming XML data was set with the object of selectively joining windows that satisfies the query, based on Cardinality * and + among the structure information of DTD.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.18 no.2
• /
• pp.163-168
• /
• 2018

In this paper, we propose and develop a test automation program tool that automates GUI based testing using black box testing technique in Windows environment. The main features of the proposed test automation program tool are as follows. First, an error condition is designated as an image, a screen is captured for each test step, and an error message is detected through comparison of image similarity. Second, the proposed system supports various setting options such as event waiting time during execution and coordinate increment value between each test step. Such black box test automation research was common in environments such as Android and Web, but not in Windows environment. The results of performance evaluation show that the proposed system performs GUI test automation as an image comparison module and confirms that the test is performed normally by confirming process status and error image detection.

• The Journal of the Korea Contents Association
• /
• v.11 no.11
• /
• pp.19-27
• /
• 2011

In this paper, we present an emulation library for the essential features and their API function calls provided by Direct3D, the most actively used API for computer game-related application programs on the MS-Windows-based desktop's, with OpenGL library in the Linux environment. In typical Linux-based systems, only the X window system and OpenGL graphics library are available. There are lots of needs for this kind of emulation library to convert the Direct3D-based game applications and user interfaces on these systems. Through carefully selecting the essential API functions from the DirectX version 9.0, we obtained the prototype implementation of that emulation library, to finally get the final full-scale DirectX implementation. Our implementation currently covers 3D coordinate transformations, light and material processing, texture mapping, simple animation features and more. We showed its feasibility through successfully executing a set of Direct3D demonstration programs including a real-world game character animation on our implementation.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.25 no.6
• /
• pp.1421-1433
• /
• 2015

For an accurate analysis through the forensic of digital devices and computer, it is a very important validation of the reliability of digital forensic tools. To verify the reliability of the tool, it is necessary to research and development of the data set to be input to the tool. In many-used Windows operating system of the computer, there is a Window forensic artifacts associated with time and system behavior. In this paper, we developed a set of data in the Windows operating system to be able to analyze all of the two Windows artifacts and we conducted a test with published digital forensic tools. Therefore, the developed data set presents the use of the following method. First, artefacts education for growing ability can be analyzed acts standards. Secondly, the purpose of tool tests for verifying the reliability of digital forensics. Lastly, recyclability for new artifact analysis.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.25-34
• /
• 2007

Existing approaches that select an order for the join of three or more data streams have always used the simple heuristics. For their disadvantage - only one factor is considered and that is join selectivity or arrival rate, these methods lead to poor performance and inefficiency In some applications. The graph-based sliding window multi -join algorithm with optimal join sequence is proposed in this paper. In this method, sliding window join graph is set up primarily, in which a vertex represents a join operator and an edge indicates the join relationship among sliding windows, also the vertex weight and the edge weight represent the cost of join and the reciprocity of join operators respectively. Then the optimal join order can be found in the graph by using improved MVP algorithm. The final result can be produced by executing the join plan with the nested loop join procedure, The advantages of our algorithm are proved by the performance comparison with existing join algorithms.

• The Journal of the Acoustical Society of Korea
• /
• v.28 no.5
• /
• pp.461-470
• /
• 2009

We investigate and analyze the problems encountered in frame-based estimation of TDOA (Time Difference of Arrival) using CPSP function. Spectral leakage occurring in framing of a speech signal by a rectangular window could make estimation of CPSP spectrum inaccurate. Framing with other windows to reduce the spectral leakage distorts the signal due to the asynchronous weighting around the frame specifically both ends of the frame. These problems degrade the performance of the CPSP-based TDOA estimation. In this paper, we propose a method to alleviate those problems by pre-emphasis of the speech signal. It reduces the influence of the spectral leakage by reducing dynamic range of the spectrum of a speech signal with pre-emphasis. To validate the proposed method of pre-emphasis, we carry out TDOA estimation experiments in various noise and reverberation conditions, Experimental results have shown that the framing of pre-emphasized microphone output by a rectangular window achieves higher success rate of TDOA estimation than any other framing methods.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1998.06c
• /
• pp.43-46
• /
• 1998

본 논문은 컴퓨터 사용에 미숙한 초보자나 키보드나 마우스를 사용할 수 없는 신체적인 조건을 가진 장애인 또는 PC사용에 미숙한 사용자들을 위해 기존의 인터페이스에 추가적으로 음성을 사용하여 더 효율적인 작업 환경을 만들기 위한 음성을 이용한 Window95 환경에서의 음성 인식 시스템 구현에 관한 것이다. 인터페이스 구현을 위해 사용되는 인식 알고리즘으로는 연결어 인식에 사용되는 OSDP[1] 알고리즘을 단독어 인식에 적용하여 사용하였다. 특징 벡터는 화자 독립적인 특성을 지닌 Perceptual Linear Predictive(PLP)[2] 13차 계수를 사용하였다. 인식 대상 어휘는 윈도우 사용자에게 자주 사용되는 60개의 명령어로 설정하였다. 인식된 후 그 결과는 구현된 시스템의 명령 실행 모듈로 전달되어 윈도우 상에서 실제 수행된다. 구현된 시스템에서는 노트북 내장 마이크를 사용하여 음성을 검출하였고 이를 위한 음성 구간 검출 알고리즘을 사용하였다. 기준 패턴은 20대 남성화자 9인이 2회 발성한 데이터를 이용하였고, 화자 독립으로 온라인 인식률은 91.71%이고, 오프라인 인식률은 96.4%의 인식률을 얻었다.

• Proceedings of the Korea Institutes of Information Security and Cryptology Conference
• /
• 2006.06a
• /
• pp.604-607
• /
• 2006

Self-heating 키 분배 기법은 불안정한 네트워크 환경에서 그룹 키를 설정할 수 있게 하며, 그룹을 가입하거나 탈퇴하는 멤버 노드들에 의한 공모 공격에 대한 안전성으로 인하여, 센서 네트워크 환경에 적합한 방식이다. 하지만 기존에 제안된 Self-healing 키 분배 기법들은 브로드캐스트 되는 메시지의 통신량과 그룹 멤버의 그룹 키 복원을 위한 정보 저장량 측면에서 비효율적인 문제가 있다. 본 논문에서는 슬라이딩 윈도우(Sliding Window) 개념을 도입함으로써 향상된 Self-healing 키 분배 기법을 제안하여, 브로드캐스트 되는 메시지의 크기를 줄이고 멤버 노드 단위의 메모리에 대한 효율성을 향상시킨다.