• 제목/요약/키워드: temporal aggregation

검색결과 44건 처리시간 0.025초

데이타 분석을 위한 시공간 집계 함수의 확장 (Extension of Aggregate Functions for Spatiotemporal Data Analysis)

  • 지정희;신현호;김상호;류근호
    • 한국정보과학회논문지:데이타베이스
    • /
    • 제32권1호
    • /
    • pp.43-55
    • /
    • 2005
  • 시공간 데이타베이스는 실세계에 존재하는 다양한 유형의 객체에 대한 공간 관리와 이력정보를 동시에 제공함으로써 사용자에게 시공간 데이타에 대한 저장 및 질의 수단을 제공한다. 실세계에서 "임의의 질의 윈도우 영역에서 2001년 4월부터 8원까지 농경지당 뿌려진 농약의 평균은 얼마인가\ulcorner"와 같은 질의를 할 수 있다. 이러한 집계 질의는 시간과 공간에 대한 제약을 가지고 있다. 그러나 기존의 집계에 대한 연구는 시간 또는 공간에만 편중되어 시간과 공간 제약을 모두 가진 시공간 데이타에 직접 적용하기 어려운 문제점이 있다. 따라서 이 논문에서는 시공간 특성을 가진 시공간 데이타 분석을 위한 시공간 집계 함수 stCOUNT, stSUM, stAVG, stMAX, stMIN를 제안한다. 아울러 제안된 시공간 집계함수론 적용한 부동산 관리 시스템을 통해 기존의 시간, 공간 집계함수가 분석하기 어려웠던 시공간 데이타에 대한 분석의 용이함과 응용 시스템에 맞는 질의 표현력의 개선 및 편리성을 제공함을 보였다 그리고 제안된 시공간 집계함수의 알고리즘의 성능 평가를 통해 알고리즘 성능의 타당성을 입증하였다.

Spatiotemporal Aggregate Functions for Temporal GIS

  • Kim, Jin-Soo;Shin, Hyun-Ho;Chi, Jeong-Hee;Ryu, Keun-Ho
    • 대한원격탐사학회:학술대회논문집
    • /
    • 대한원격탐사학회 2003년도 Proceedings of ACRS 2003 ISRS
    • /
    • pp.721-723
    • /
    • 2003
  • Aggregation is an operation that returns a result value through a computational process on the data which satisfy a certain condition. Recently many applications use aggregation to analyze spatiotemporal data. Although spatiotemporal data change its states over time, previous aggregation works have only dealt with spatial or temporal aspect of object. In this paper we propose spatiotemporal aggregate functions that operate on spatiotemporal data. The proposed algorithms are evaluated through some implementation results. The experiment results show that the proposed aggregate functions are applicable to spatiotemporal data efficiently.

  • PDF

Unit Root Test for Temporally Aggregated Autoregressive Process

  • Shin, Dong-Wan;Kim, Sung-Chul
    • Journal of the Korean Statistical Society
    • /
    • 제22권2호
    • /
    • pp.271-282
    • /
    • 1993
  • Unit root test for temporally aggregated first order autoregressive process is considered. The temporal aggregate of fist order autoregression is an autoregressive moving average of order (1,1) with moving average parameter being function of the autoregressive parameter. One-step Gauss-Newton estimators are proposed and are shown to have the same limiting distribution as the ordinary least squares estimator for unit root when complete observations are available. A Monte-Carlo simulation shows that the temporal aggregation have no effect on the size. The power of the suggested test are nearly the same as the powers of the test based on complete observations.

  • PDF

Ultrasound Backscattering from Erythrocyte Aggregation of Human, Horse and Rat Blood under Rotational Flow in a Cylindrical Chamber

  • Nam, Kweon-Ho;Paeng, Dong-Guk;Choi, Min-Joo
    • The Journal of the Acoustical Society of Korea
    • /
    • 제25권4E호
    • /
    • pp.159-165
    • /
    • 2006
  • Human, horse and rat bloods in a cylindrical chamber where flow was controlled by a stirring magnet were used for studying red blood cell aggregation. Ultrasound backscattered powers from blood were obtained from the backscattered signals measured by a 5 MHz focused transducer in a pulse-echo setup. The experimental results showed the differences in red blood cell (RBC) aggregation tendency among the three mammalian species with an order of horse > human > rat. The ultrasound backscattered power decreased with stirring speed in human and horse blood, but no variations were observed in rat blood. Sudden flow stoppage led to the slow increase of the backscattered power for human and horse blood. There was no self-aggregation tendency in rat blood. The enveloped echo images showed the spatial and temporal variations of RBC aggregations in the cylindrical chamber. These observations from the different mammalian species may give a better understanding of the mechanism of RBC aggregation.

Dynamic Tracking Aggregation with Transformers for RGB-T Tracking

  • Xiaohu, Liu;Zhiyong, Lei
    • Journal of Information Processing Systems
    • /
    • 제19권1호
    • /
    • pp.80-88
    • /
    • 2023
  • RGB-thermal (RGB-T) tracking using unmanned aerial vehicles (UAVs) involves challenges with regards to the similarity of objects, occlusion, fast motion, and motion blur, among other issues. In this study, we propose dynamic tracking aggregation (DTA) as a unified framework to perform object detection and data association. The proposed approach obtains fused features based a transformer model and an L1-norm strategy. To link the current frame with recent information, a dynamically updated embedding called dynamic tracking identification (DTID) is used to model the iterative tracking process. For object association, we designed a long short-term tracking aggregation module for dynamic feature propagation to match spatial and temporal embeddings. DTA achieved a highly competitive performance in an experimental evaluation on public benchmark datasets.

Routing Techniques for Data Aggregation in Sensor Networks

  • Kim, Jeong-Joon
    • Journal of Information Processing Systems
    • /
    • 제14권2호
    • /
    • pp.396-417
    • /
    • 2018
  • GR-tree and query aggregation techniques have been proposed for spatial query processing in conventional spatial query processing for wireless sensor networks. Although these spatial query processing techniques consider spatial query optimization, time query optimization is not taken into consideration. The index reorganization cost and communication cost for the parent sensor nodes increase the energy consumption that is required to ensure the most efficient operation in the wireless sensor node. This paper proposes itinerary-based R-tree (IR-tree) for more efficient spatial-temporal query processing in wireless sensor networks. This paper analyzes the performance of previous studies and IR-tree, which are the conventional spatial query processing techniques, with regard to the accuracy, energy consumption, and query processing time of the query results using the wireless sensor data with Uniform, Gauss, and Skew distributions. This paper proves the superiority of the proposed IR-tree-based space-time indexing.

시간적 계층을 이용한 교통사고 발생건수 예측 (Temporal hierarchical forecasting with an application to traffic accident counts)

  • 전관영;성병찬
    • 응용통계연구
    • /
    • 제31권2호
    • /
    • pp.229-239
    • /
    • 2018
  • 본 논문에서는 시간적 계층 개념을 활용하여 시계열 자료를 예측하는 방법을 소개한다. 횡단적 계층 자료 분석에서와 유사한 방법으로 중복되지 않는 시간적 계층을 시계열 자료에 구조화할 수 있다. 이러한 시간적 계층을 활용하여 조정된 예측은 기존의 계층별 독립적 기저 예측 및 상향식 예측보다 더 정확하고 강건한 예측값을 생성한다. 실증 분석으로서 국내 교통사고 발생건수를 시간적 계층 개념을 활용하여 예측한다. 분석 결과, 조정 예측이 기존의 다른 예측보다 예측 성능면에서 더 우수함을 확인할 수 있다.

변경 집합을 이용한 온톨로지 버전 관리 기법 (Ontology Versions Management Schemes using Change Set)

  • 윤홍원;이중화;김정원
    • Journal of Information Technology Applications and Management
    • /
    • 제12권3호
    • /
    • pp.27-39
    • /
    • 2005
  • The Semantic Web has increased the interest in ontologies recently Ontology is an essential component of the semantic web and continues to change and evolve. We consider versions management schemes in ontology. We study a set of changes based on domain changes, changes in conceptualization, metadata changes, and temporal dimension. Our change specification is represented by a set of changes. A set of changes consists of instance data change, structural change, and identifier change. In order to support a query in ontology versions, we consider temporal dimension includes valid time. Ontology versioning brings about massive amount of versions to be stored and maintained. We present the ontology versions management schemes that are 1) storing all the change sets, 2) storing the aggregation of change sets periodically, and 3) storing the aggregation of change sets using an adaptive criterion. We conduct a set of experiments to compare the performance of each versions management schemes. We present the experimental results for evaluating the performance of the three version management schemes from scheme 1 to scheme 3. Scheme 1 has the least storage usage. The average response time in Scheme 1 is extremely large, those of Scheme 3 is smaller than Scheme 2. Scheme 3 shows a good performance relatively.

  • PDF

Effects of Financial Crises on the Long Memory Volatility Dependency of Foreign Exchange Rates: the Asian Crisis vs. the Global Crisis

  • Han, Young Wook
    • East Asian Economic Review
    • /
    • 제18권1호
    • /
    • pp.3-27
    • /
    • 2014
  • This paper examines the effects of financial crises on the long memory volatility dependency of daily exchange returns focusing on the Asian crisis in 97-98 and the Global crisis in 08-09. By using the daily KRW-USD and JPY-USD exchange rates which have different trading regions and volumes, this paper first applies both the parametric FIGARCH model and the semi-parametric Local Whittle method to estimate the long memory volatility dependency of the daily returns and the temporally aggregated returns of the two exchange rates. Then it compares the effects of the two financial crises on the long memory volatility dependency of the daily returns. The estimation results reflect that the long memory volatility dependency of the KRW-USD is generally greater than that of the JPY-USD returns and the long memory dependency of the two returns appears to be invariant to temporal aggregation. And, the two financial crises appear to affect the volatility dynamics of all the returns by inducing greater long memory dependency in the volatility process of the exchange returns, but the degree of the effects of the two crises seems to be different on the exchange rates.

무선 센서 네트워크에서 에너지 효율적이고 신뢰성이 높은 데이터 병합을 위한 적응적 타임아웃 스케줄링 기법 (Adaptive Timeout Scheduling for Energy-Efficient, Reliable Data Aggregation in Wireless Sensor Network)

  • 백장운;남영진;서대화
    • 한국통신학회논문지
    • /
    • 제33권5B호
    • /
    • pp.326-333
    • /
    • 2008
  • 무선 센서 네트워크에서 데이터 병합을 수행하는 센서노드는 자식 노드의 메시지를 기다리는 시간인 타임아웃을 스케줄링한다. 본 논문에서는 데이터 병합시 소모되는 전력을 최소화하고 데이터 정확도를 높이기 위해, 센서 네트워크에서 수집되는 데이터 패턴에 따라 타임아웃을 적응적으로 조절하는 새로운 타임아웃 스케줄링 기법을 제안한다. 제안 타임아웃 스케줄링 기법은 자식노드로부터 수신한 데이터가 특별한 이벤트 없이 기준 데이터 변동률 범위 내에 있게 되면 타임아웃 값을 줄인다. 타임아웃을 작게 하면 메시지 대기시간이 짧아지고 센서 노드의 에너지 소모가 감소한다. 센싱 데이터가 기준 데이터 변동률을 벗어나면 중요 이벤트 발생 확률이 높으므로 보다 정확한 데이터 병합 값을 얻기 위해 타임아웃 값을 증가시킨다. 시뮬레이션 결과에서 제안 기법은 기존 캐스케이딩 타임아웃 스케줄링 기법에 비해 에너지 소모와 데이터 정확도 측면에서 우수한 성능을 보여주었다.