• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.459-468
• /
• 2008

A data stream which is a massive unbounded sequence of data elements continuously generated at a rapid rate. Many recent research activities for emerging applications often need to deal with the data stream. Such applications can be web click monitoring, sensor data processing, network traffic analysis. telephone records and multi-media data. For this. data processing over a data stream are not performed on the stored data but performed the newly updated data with pre-registered queries, and then return a result immediately or periodically. Recently, many studies are focused on dealing with a data stream more than a stored data set. Especially. there are many researches to optimize continuous queries in order to perform them efficiently. This paper proposes a query optimization algorithm to manage continuous query which has multiple join operators(Multi-way join) over data streams. It is called by an Extended Greedy query optimization based on a greedy algorithm. It defines a join cost by a required operation to compute a join and an operation to process a result and then stores all information for computing join cost and join cost in the statistics catalog. To overcome a weak point of greedy algorithm which has poor performance, the algorithm selects the set of operators with a small lay, instead of operator with the smallest cost. The set is influenced the accuracy and execution time of the algorithm and can be controlled adaptively by two user-defined values. Experiment results illustrate the performance of the EGA algorithm in various stream environments.

• ETRI Journal
• /
• v.27 no.1
• /
• pp.110-113
• /
• 2005

The resilient packet ring (RPR) is a data optimized ring network, where one of the key issues is on load balancing for competing streams of elastic traffic. This paper suggests three efficient traffic loading algorithms on the RPR. For the algorithms, we evaluate their efficiency via analysis or simulation.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.11-16
• /
• 1997

This paper describes the grenade counting system developed for DPICM submunition analysis using the infrared video streams, and its some video stream processing technique. The video stream data processing procedure consists of four sequences; Analog infrared video stream recording, video stream capture, video stream pre-processing, and video stream analysis including the grenade counting. Some applications of this algorithms to real bursting test has shown the possibility of automation for submunition counting.

• Journal of Astronomy and Space Sciences
• /
• v.24 no.2
• /
• pp.119-124
• /
• 2007

The relation between substorm occurrences and HILDCAA events has been an issue. We have studied the association of particle injections with substorm onsets during HILDCAA intervals for the first half of year 2003. The examination of aurora images observed by IMAGE spacecraft and electron flux data measured by LANL satellites exhibits a close association of repetitive particle injections with substorm activity. We also find that HILDCAA events can occur equally frequently during slow speed solar wind streams as long as the interplanetary magnetic field exhibits Alfvenic wave feature.

• Journal of Ecology and Environment
• /
• v.36 no.1
• /
• pp.85-88
• /
• 2013

Bioassessment is the use of biosurvey data, most commonly for benthic macroinvertebrates and fish, to obtain information about the health of waters in a region. In rivers, bioassessment results are used to evaluate biological condition and trends, to establish relationships between stressors and impairments, and to guide and evaluate management actions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.34-37
• /
• 2007

간 및 낮은 메모리 사용량을 요구한다. 이러한 데이터 스트림에서의 데이터 마이닝은 전체 데이터에 대한 분석 보다는 사용자가 관심을 갖는 영역에 대한 마이닝에 초점이 맞추어져 있어, 사용자 관심영역에 대한 분석 데이터 탐색을 필요로 한다. 이에 본 논문에서는 기존의 분석 데이터 탐색 기법인 빙산 질의 및 상위-k 질의에 대하여 알아보고, 이를 보완하기 위한 확률에 기반한 데이터 탐색법인 확률기반 빙산 질의를 제안한다.

• Journal of Communications and Networks
• /
• v.12 no.2
• /
• pp.191-197
• /
• 2010

In this paper, we propose a novel methodology to identify border gateway protocol (BGP) updates associated with major events - affecting network reachability to multiple ASes - and separate them (statistically) from those attributable to minor events, which individually generate few updates, but collectively form the persistent background noise observed at BGP vantage points. Our methodology is based on principal component analysis, which enables us to transform and reduce the BGP updates into different AS clusters that are likely affected by distinct major events. We demonstrate the accuracy and effectiveness of our methodology through simulations and real BGP data.

• Proceedings of the IEEK Conference
• /
• 2003.07b
• /
• pp.843-846
• /
• 2003

In this paper, we have analyzed algorithm of physical layer, data link layer and MAC layer of Out-Of-Band (OOB) specified in the OpenCabl $e^{TM}$SCTE-55-2 2002$^{[3]}$ and designed architecture of the OOB processor. The OOB processor performs fundamental multiple access control for the OOB channel and extracts session key information from a EMM packet for descrambling MPEG-2 streams. In this paper, we have implemented a prototype board for the DVS167 OOB processor and verified it.t.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10b
• /
• pp.28-30
• /
• 2003

컴퓨팅 환경의 발달로 방대한 양의 정보들이 매우 빠른 속도로 생성되고 있다. 구성 요소가 지속적으로 발생되는 무한 집합으로 정의되는 데이터 스트림에 대한 마이닝 방법은 이들 정보로부터 중요한 지식을 효과적으로 얻을 수 있는 방법으로 최근 들어 다양한 방법들이 활발히 제안되고 있다. 이러한 마이닝 방법에서는 지속적으로 확장되는 데이터 스트림의 특성으로 수행과정에서 메모리 사용량을 가용 범위 내로 제한하는 것이 중요한 고려 사항이 되고 있다. 본 논문에서는 데이터 스트림에서 빈발 항목을 탐색하는데 있어서 가용 메모리 범위에서 최적의 메모리를 사용하여 최상의 마이닝 결과를 얻을 수 있도록 하는 메모리 사용량 최적화 방법을 제시한다.

• Ecology and Resilient Infrastructure
• /
• v.11 no.1
• /
• pp.23-23
• /
• 2024