Sketches have risen as promising solutions for frequency estimation, which is one of the most fundamental tasks in approximate data stream processing. In many scenarios, users have a strong demand to apply sketches un...
Sketches have risen as promising solutions for frequency estimation, which is one of the most fundamental tasks in approximate data stream processing. In many scenarios, users have a strong demand to apply sketches under the expected error constraints. In this paper, we explore how to configure sketch parameters to satisfy user-defined error constraints. We propose SketchConf, an automatic sketch configuration framework, which efficiently generates memory-optimal configurations for the first time. We show that SketchConf can be applied to order-independent sketches, including CM, Count, Tower, and Nitro sketches. We further discuss how to deal with the unknown and changeable workloads when applying SketchConf to the real scenarios of streaming data processing. Experimental results show that SketchConf can be up to 715.51 times faster than the baseline algorithm, and the outputted configurations save up to 99.99% memory and achieve up to 27.44 times throughput, compared with the theory-based configurations. The code is open sourced at Github.
Unlike traditional railway vehicles, the particularity of tram right of way determines the multiple and diversity of its accident forms. Based on the analysis of accident data at home and abroad, this paper determines...
详细信息
The motion mode of near-space targets is complex due to their high threat level. The target imaging faces low SNR and susceptibility to background noise. The existing detection and classification algorithms struggle t...
详细信息
Sequential recommendation systems dynamically predict the users’ next behaviors from chronological historical records to provide more accurate recommendations. However, in many real-world scenarios, recommenders find...
详细信息
Utilizing the spatiotemporal features contained in extensive trajectory data for identifying operation modes of agricultural machinery is an important basis task for subsequent agricultural machinery trajectory *** th...
详细信息
Utilizing the spatiotemporal features contained in extensive trajectory data for identifying operation modes of agricultural machinery is an important basis task for subsequent agricultural machinery trajectory *** the present study,to effectively identify agricultural machinery operation mode,a feature deformation network with multi-range feature enhancement was ***,a multi-range feature enhancement module was developed to fully explore the feature distribution of agricultural machinery trajectory ***,to further enrich the representation of trajectories,a feature deformation module was proposed that can map trajectory points to high-dimensional space to form feature ***,EfficientNet-B0 was used to extract features of different scales and depths from the feature map,select features highly relevant to the results,and finally accurately predict the mode of each trajectory *** validate the effectiveness of the proposed method,experiments were conducted to compare the results with those of other methods on a dataset of real agricultural *** the corn and wheat harvester trajectory datasets,the model achieved accuracies of 96.88%and 96.68%,as well as F1 scores of 93.54%and 94.19%,exhibiting improvements of 8.35%and 9.08%in accuracy and 20.99%and 20.04%in F1 score compared with the current state-of-the-art method.
The aboveground biomass (AGB) is a key index for predicting wheat yield. In the case of high biomass, the AGB estimation of single spectral feature or image texture is poor. Therefore, this study evaluated the ability...
详细信息
With the development of informationization and intelligence of railway passenger stations, problems such as inconvenient information interaction, missing operation and maintenance data, and difficulty in accurate posi...
详细信息
1data stream mining over a sliding window is a fundamental problem in many applications, such as financial data trackers, intrusion detection and QoS. To meet the demand for high throughput of high speed data streams,...
ISBN:
(纸本)9781450397339
1data stream mining over a sliding window is a fundamental problem in many applications, such as financial data trackers, intrusion detection and QoS. To meet the demand for high throughput of high speed data streams, sliding window algorithms turn to hardware platforms including FPGA/ASIC and programmable switches. These hardware platforms have three constraints for algorithms running on, which are 1) small memory usage 2) single stage memory access and 3) limited concurrent memory access. Algorithms perfectly fit in with these constraints will enable a highest utilization of these hardware platforms. However, no existing sliding window algorithm is specifically designed for hardware platforms. In this paper, we propose the Sliding Hardware Estimator (SHE), which is a generic framework that extends existing fixed window algorithms to sliding windows on hardware platforms. The key idea of SHE is that, during insertions we approximately delete out-dated information with little time and space overhead, while during queries we design sophisticated techniques to minimize error. We have fully implemented our SHE on FPGA, achieving a throughput of 544 Mips. We apply SHE to four typical data stream mining tasks. Experimental results show that, when compared with the state-of-the-art which cannot be implemented in hardware, SHE reduces the error by up to 100 times in membership queries. All related source codes are released at Github.
In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of *** the constraints is challenging due to the requirements of both preserving mental map and s...
详细信息
In online dynamic graph drawing,constraints over nodes and node pairs help preserve a coherent mental map in a sequence of *** the constraints is challenging due to the requirements of both preserving mental map and satisfying the visual aesthetics of a graph *** existing algorithms basically depend on local changes but fail to do proper evaluations on the global propagation when setting *** solve this problem,we introduce a heuristic model derived from PageRank which simulates the node movement as an inverse Markov process hence to give a global analysis of the layout's change,according to which different constraints can be *** constraints,along with stress function,generate layouts maintaining spatial positions and shapes of relatively stable substructures between adjacent *** demonstrate that our method preserves both structure and position similarity to help users track graph changes visually.
Training big graph neural networks (GNNs) in distributed systems is quite time-consuming mainly because of the ubiquitous aggregate operations that involve a large amount of cross-partition communication for collectin...
详细信息
暂无评论