• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.3
• /
• pp.264-269
• /
• 2001

In this paper, we interpret a score as a time series and deal with the fuzzy logic-based modeling of it. The musical notes in a score represent a lot of information about the length of a sound and pitches, etc. In this paper, using melodies, tones and pitches in a score, we transform data on a score into a time series. Once more, we foml the new Lime series by sliding a window through the time series. For analyzing the time series data, we make use of the Box-Jenkins s time series analysis. On the basis of the identified characteristics of time series, we construct the fuzzy model.

• 전자공학회논문지 IE
• /
• v.48 no.3
• /
• pp.16-19
• /
• 2011

Differentiated Service is an IP QoS ensuring method based on packet marking that allows packets to be prioritized according to user requirements. During the time of congestion, more low priority packets are dropped than high priority packets. Different policy models are used to determine how to mark the packet. This paper investigated the performance of Differentiated Service using time sliding window with 3 color marking (TSW3CM). Simulation results using NS-2 showed that Differentiated Service can provide the quality of service requirements.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2001.05a
• /
• pp.211-214
• /
• 2001

In this paper, we interpret a score as a time series and deal with the fuzzy logic-based modeling of it. The musical notes in a score represent a lot of information about the length of a sound and pitches, etc. In this paper, using melodies, tones and pitches in a score, we transform data on a score into a time series. Once more, we form the new time series by sliding a window through the time series. For analyzing the time series data, we make use of the Box-Jenkinss time series analysis. On the basis of the identified characteristics of time series, we construct the fuzz model.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.790-792
• /
• 2004

문서 범주화에서 이진분류를 다중 분류에 적용할 때, 일반적으로 One-Against-All 방법을 사용한다. 하지만, 이 One-Against-All 방법은 한가지 문제점을 가진다. 즉, positive 집합의 문서들은 사람이 직접 범주를 할당한 것이지만, negative 집합의 문서들은 사람이 직접 범주를 할당한 것이 아니기 때문에 오류 문서들이 포함될 수 있다는 것이다. 본 논문에서는 이러한 문제점을 해결하기 위해 Sliding Window기법과 EM 알고리즘을 이진 분류 기반의 문서 범주화에 적용할 것을 제안한다. 먼저 Sliding Window 기법을 이용하여 학습 데이터로부터 오류 문서들을 추출하고 이 문서들을 EM 알고리즘을 사용해서 다시 범주를 할당함으로써 이진 분류 기반의 문서 범주화 기법의 성능을 향상시킨다.

• Communications for Statistical Applications and Methods
• /
• v.31 no.1
• /
• pp.87-104
• /
• 2024

Most functional magnetic resonance imaging (fMRI) studies in resting state have assumed that the functional connectivity (FC) between time series from distinct brain regions is constant. However, increased interest has recently been in quantifying possible dynamic changes in FC during fMRI experiments. FC study may provide insight into the fundamental workings of brain networks to brain activity. In this work, we focus on the specific problem of estimating the dynamic behavior of pairwise correlations between time courses extracted from two different brain regions. We compare the sliding-window techniques such as moving average (MA) and exponentially weighted moving average (EWMA), dynamic causality with vector autoregressive (VAR) model, dynamic conditional correlation (DCC) based on volatility, and the proposed alternative methods to use differencing and recursive residuals. We investigate the properties of those techniques in a series of simulation studies. We also provide an application with major depressive disorder (MDD) patient fMRI data to demonstrate studying dynamic correlations.

• Journal of Intelligence and Information Systems
• /
• v.20 no.3
• /
• pp.1-18
• /
• 2014

Over the past years RFID/SN has been an elementary technology in a diversity of applications for the ubiquitous environments, especially for Internet of Things. However, one of obstacles for widespread deployment of RFID technology is the inherent unreliability of the RFID data streams by tag readers. In particular, the problem of false readings such as lost readings and mistaken readings needs to be treated by RFID middleware systems because false readings ultimately degrade the quality of application services due to the dirty data delivered by middleware systems. As a result, for the higher quality of services, an RFID middleware system is responsible for intelligently dealing with false readings for the delivery of clean data to the applications in accordance with the tag reading environment. One of popular techniques used to compensate false readings is a sliding window filter. In a sliding window scheme, it is evident that determining optimal window size intelligently is a nontrivial important task in RFID middleware systems in order to reduce false readings, especially in mobile environments. In this paper, for the purpose of reducing false readings by intelligent window adaption, we propose a new adaptive RFID data cleaning scheme based on window sliding for a single tag. Unlike previous works based on a binomial sampling model, we introduce the weight averaging. Our insight starts from the need to differentiate the past readings and the current readings, since the more recent readings may indicate the more accurate tag transitions. Owing to weight averaging, our scheme is expected to dynamically adapt the window size in an efficient manner even for non-homogeneous reading patterns in mobile environments. In addition, we analyze reading patterns in the window and effects of decreased window so that a more accurate and efficient decision on window adaption can be made. With our scheme, we can expect to obtain the ultimate goal that RFID middleware systems can provide applications with more clean data so that they can ensure high quality of intended services.

• Journal of Digital Contents Society
• /
• v.13 no.1
• /
• pp.21-29
• /
• 2012

In ubiquitous computing environment, rising large scale data exchange through sensor network with sharply growing the internet, the processing of the continuous stream data is required. Therefore there are some mining researches related to the extracting of frequent structures and the efficient query processing of XML stream data. In this paper, we propose a mining method to extract frequent structures of XML stream data in recent window based on the active window sliding using trigger rule. The proposed method is a basic research to control the stream data flow for data mining and continuous query by trigger rules.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2002.05a
• /
• pp.147-151
• /
• 2002

One of the main issues in Diffserv AS architecture is guaranteeing fairness among the flows which have their own QoS requirements. Because the methodology of resource allocation and traffic conditioning would affect the end-to-end QoS and backbone link utilization. In this paper, we propose a variant of TSW algorithm for enhancing fair bandwidth allocation and link utilization and presents performance evaluation between TSW & TS2W3C through NS-2 Simulations.

• Journal of KIISE:Software and Applications
• /
• v.29 no.6
• /
• pp.355-366
• /
• 2002

This paper introduces the MPEG-4 video frame-based bitrate control methodology using two dimensional history pool and a sliding window. Proposed method preferentially clusters the encoded results according to the image characteristics and stores those results into the 2 dimensional history pool. Among the stored results in the pool, the sliding window collects the encoded results whose characteristics are very similar to the image frame to be encoded. Feedback regression is finally carried out bated on the collected results. Therefore proposed method can actively adapt to the rapid varying image characteristics by reducing the occurrences of the extrapolations when determining the quantization steps. Proposed method has better performances than the MPEG-4 frame-based bitrate control algorithm by evaluating with the actually encoded bits per frame, encoded PSNR's, and frame skips.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.335-344
• /
• 2005

Recently open data mining methods focusing on a data stream that is a massive unbounded sequence of data elements continuously generated at a rapid rate are proposed actively. Knowledge embedded in a data stream is likely to be changed over time. Therefore, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. This paper proposes a sliding window technique for finding recently frequent itemsets, which is applied efficiently in open data mining. In the proposed technique, its memory usage is kept in a small space by delayed-insertion and pruning operations, and its mining result can be found in a short time since the data elements within its target range are not traversed repeatedly. Moreover, the proposed technique focused in the recent data elements, so that it can catch out the recent change of the data stream.