31,025 Hits in 7.5 sec

Warping the time on data streams

Paolo Capitani, Paolo Ciaccia
2007 Data & Knowledge Engineering  
Continuously monitoring through time the correlation/distance of multiple data streams is of interest in a variety of applications, including financial analysis, video surveillance, and mining of biological  ...  data.  ...  SDT W (Stream-DTW) to compare data streams that, unlike the well-known Dynamic Time Warping (DT W ) distance, can be efficiently updated when a window slides over the streams.  ... 
doi:10.1016/j.datak.2006.08.012 fatcat:bd4gugymczbqvbov2bfsytkh2a

Stream Monitoring under the Time Warping Distance

Yasushi Sakurai, Christos Faloutsos, Masashi Yamamuro
2007 2007 IEEE 23rd International Conference on Data Engineering  
The goal of this paper is to monitor numerical streams, and to find subsequences that are similar to a given query sequence, under the DTW (Dynamic Time Warping) distance.  ...  Our experiments on real and realistic data illustrate that SPRING does indeed detect the qualifying subsequences correctly and that it can offer dramatic improvements in speed over the naive implementation  ...  However, to the best of our knowledge, this is the first study that investigates time warping for monitoring data streams.  ... 
doi:10.1109/icde.2007.368963 dblp:conf/icde/SakuraiFY07 fatcat:6zrewg554vcvzazp7tirpu4yki

Similarity Measure Based on Incremental Warping Window for Time Series Data Mining

Hailin Li, Cheng Wang
2019 IEEE Access  
Dynamic time warping is one of the most robust methods to compare one time series with another based on warping alignments.  ...  A similarity measure is one of the most important tasks in the fields of time series data mining.  ...  INTRODUCTION Time series is one of the most popular data in the fields of data mining.  ... 
doi:10.1109/access.2018.2889792 fatcat:4doexkshbjh4ll2j5hcmzbe5yq

Pattern discovery in data streams under the time warping distance

Machiko Toyoda, Yasushi Sakurai, Yoshiharu Ishikawa
2012 The VLDB journal  
Subsequence matching is a basic problem in the field of data stream mining.  ...  Dynamic time warping (DTW) is often used for subsequence matching and is a powerful similarity measure. However, the straightforward method using DTW incurs a high computation cost for this problem.  ...  Many applications require time-series data streams to be continuously monitored in real time, and the processing and mining of data streams are attracting increasing interest.  ... 
doi:10.1007/s00778-012-0289-3 fatcat:hi77xwmnbjbefiu23jz5vxqt4m

Watershed Regressions for Pesticides (WARP) Models for Predicting Stream Concentrations of Multiple Pesticides

Wesley W. Stone, Charles G. Crawford, Robert J. Gilliom
2013 Journal of Environmental Quality  
The lack of adequate data on pesticide concentrations in most streams creates a need for tools that can be used to predict pesticide concentrations for streams that are not sufficiently monitored.  ...  The WARP-MP models perform best for pesticides with application timing and methods similar to those used with atrazine.  ...  Specifically, the weights were computed as the amount of time extending from one half the time interval between a value and the preceding value and one half the time interval extending from the value to  ... 
doi:10.2134/jeq2013.05.0179 pmid:25602424 fatcat:7ptc6lypfzfg7gg7g7n2opro4i

Locality-Based Cache Management and Warp Scheduling for Reducing Cache Contention in GPU

Juan Fang, Zelin Wei, Huijing Yang
2021 Micromachines  
Each load instruction can be divided into three types according to locality: only used once as streaming data locality, accessed multiple times in the same warp as intra-warp locality, and accessed in  ...  The L1 data caches have little capacity, while multiple warps share one small cache. That makes the cache suffer a large amount of cache contention and pipeline stall.  ...  The authors would like to thank the reviewers for their efforts and for providing helpful suggestions that have led to several important improvements in our work.  ... 
doi:10.3390/mi12101262 pmid:34683312 fatcat:gaklfqahxjfd3bsdldss6236ni

Access Pattern-Aware Cache Management for Improving Data Utilization in GPU

Gunjae Koo, Yunho Oh, Won Woo Ro, Murali Annavaram
2017 SIGARCH Computer Architecture News  
as streaming data (2) data brought by a warp load is reused multiple times within the same warp, called intra-warp locality (3) data brought by a warp is reused multiple times but across different warps  ...  APCM then uses the detected locality type to selectively apply cache bypassing and cache pinning of data based on load locality characterization.  ...  ACKNOWLEDGMENT This work was supported by DARPA-PERFECT-HR0011-12-2-0020, NSF-CAREER-0954211 and the National Research Foundation of Korea (NRF) grant funded by the Korea government (MSIP) (No.  ... 
doi:10.1145/3140659.3080239 fatcat:b5oqb6h6vbbjlfl5bcs35qn67q

Mapping a single-assignment language onto the warp systolic array [chapter]

Thomas Gross, Alan Sussman
1987 Lecture Notes in Computer Science  
Many operations on the SISAL stream data type can be parallelized as a special case of dynamic data partitioning.  ...  We present two principal methods to exploit parallelism on Warp, data partitioning and pipelining.  ...  Warp is a servicemark of Carnegie Mellon University; UNIX is a trademark of AT&T Bell Laboratories.  ... 
doi:10.1007/3-540-18317-5_19 fatcat:g5ck27rl7zgclkw4v4outjc6gi

Subsequence Matching of Stream Synopses under the Time Warping Distance [chapter]

Su-Chen Lin, Mi-Yen Yeh, Ming-Syan Chen
2010 Lecture Notes in Computer Science  
To effectively reduce the computation time, we design a Weighted Dynamic Time Warping (WDTW) algorithm which computes the warping distance directly between two histogram-based synopses.  ...  In this paper, we propose a method for online subsequence matching between histogram-based stream synopsis structures under the dynamic warping distance.  ...  For the above reasons, we present a new subsequence matching method under the dynamic time warping distance for data streams that are summarized with an arbitrary-width histogram-based synopsis structure  ... 
doi:10.1007/978-3-642-13672-6_35 fatcat:r5j45ibetnc4ljisodhb7cq2y4

Efficient Kernel-based Subsequence Search for User Identification from Walking Activity [article]

Antonio Candelieri, Stanislav Fedorov, Enza Messina
2019 arXiv   pre-print
The problem consists in identifying coherent repetitions of a given reference time-series, eventually multi-variate, within a longer data stream.  ...  Dynamic Time Warping (DTW) is the metric most widely used to implement pattern query, but its computational complexity is a well-known issue.  ...  (i.e., associated the data stream to a specific user) depending on their number.  ... 
arXiv:1906.04680v2 fatcat:geswfwkvzre77luih2cqpqhfxa

Discovery of cross-similarity in data streams

Machiko Toyoda, Yasushi Sakurai
2010 2010 IEEE 26th International Conference on Data Engineering (ICDE 2010)  
In this paper, we focus on the problem of finding partial similarity between data streams.  ...  Our solution relies on dynamic time warping (DTW) as a similarity measure, which computes the distance between sequences whose lengths and/or sampling rates are different.  ...  We assume two similarities for subsequence matching over data streams. One is the similarity between a query sequence and data stream and the other is the similarity between data streams.  ... 
doi:10.1109/icde.2010.5447927 dblp:conf/icde/ToyodaS10 fatcat:67ckgxollzgnvpstrklwp3nmea

A Novel Cooperative Warp and Thread Block Scheduling Technique for Improving the GPGPU Resource Utilization
GPGPU 자원 활용 개선을 위한 블록 지연시간 기반 워프 스케줄링 기법

Do Cong Thuan, Yong Choi, Jong Myon Kim, Cheol Hong Kim
2017 KIPS Transactions on Computer and Communication Systems  
Based on our experiments on a 15-streaming multiprocessor GPGPU platform, the proposed warp scheduling policy provides an average IPC improvement of 7.5% over the baseline round-robin warp scheduling policy  ...  Furthermore, to support the proposed warp scheduler, we also propose a supplemental technique that can dynamically reduce the number of streaming multiprocessors to which will be assigned thread blocks  ...  Warp age is determined by the time the warp is assigned to the shader core (streaming multiprocessor).  ... 
doi:10.3745/ktccs.2017.6.5.219 fatcat:q6l2q3yt6bhnrbf4fjvwo5p56i


Wendy E. Mackay, Michel Beaudouin-Lafon
1998 Proceedings of the SIGCHI conference on Human factors in computing systems - CHI '98  
The underlying stream algebra provides the mathematical basis for operating on diverse kinds of streams.  ...  DIVA supports exploratory data analysis of multimedia streams, enabling users to visualize, explore and evaluate patterns in data that change over time.  ...  Also, thanks to Anne-Laure Fayard for all her work on data coding and analysis and to the members of Equipe 9West at Athis Mons en route air traffic control center, for generating all that data!  ... 
doi:10.1145/274644.274701 dblp:conf/chi/MackayB98 fatcat:2z53aryv3jbxbbwbrgmpv7vs6a

Efficient Algorithms for Stream Compaction on GPUs

Darius Bakunas-Milanowski, Vernon Rego, Janche Sang, Yu Chansu
2017 International Journal of Networking and Computing  
Furthermore, the hybrid method performs the best among all existing selection algorithms on GPU and can be two orders of magnitude faster than the sequential selection on CPU, especially when the data  ...  In this paper, we designed and implemented two new algorithms for stream compaction on GPU.  ...  Acknowledgments This research was supported by Cleveland State University Undergraduate Summer Research Award Program and by allocation of computing time from the Ohio Supercomputer Center.  ... 
doi:10.15803/ijnc.7.2_208 fatcat:izejzcrsabhnjk3t3bhiyg46tu

Memento: Localized Time‐Warping for Spatio‐Temporal Selection

V. Solteszova, N. N. Smit, S. Stoppel, R. Grüner, S. Bruckner
2019 Computer graphics forum (Print)  
Interaction techniques for temporal data are often focused on affecting the spatial aspects of the data, for instance through the use of transfer functions, camera navigation or clipping planes.  ...  The combination of such a (pre-defined) time-warp function and brushing directly in the data to select regions of interest allows for a detailed review of temporally and spatially localized events, while  ...  Acknowledgements The research presented in this paper was supported by the MetaVis project (#250133) funded by the Research Council of Norway.  ... 
doi:10.1111/cgf.13763 fatcat:vxml4ytr5rhndg4sy2r25du6wi
« Previous Showing results 1 — 15 out of 31,025 results