A5071781461- Internet Traffic Analysis and Secure E-voting
- Network Security and Intrusion Detection
- Network Traffic and Congestion Control
- Data Management and Algorithms
- Mobile Crowdsensing and Crowdsourcing
- Advanced Database Systems and Queries
- Data Stream Mining Techniques
- Caching and Content Delivery
- Privacy-Preserving Technologies in Data
- Human Mobility and Location-Based Analysis
- Blockchain Technology Applications and Security
- Network Packet Processing and Optimization
- Anomaly Detection Techniques and Applications
- Traffic Prediction and Management Techniques
- Software-Defined Networks and 5G
- Auction Theory and Applications
- Geographic Information Systems Studies
- Vehicular Ad Hoc Networks (VANETs)
- Evacuation and Crowd Dynamics
- IoT and Edge/Fog Computing
- Cryptography and Data Security
- Domain Adaptation and Few-Shot Learning
- Advanced Bandit Algorithms Research
- Data Visualization and Analytics
- Image and Video Quality Assessment
University of Science and Technology of China
2015-2025
Soochow University
2018-2025
Southwestern University of Finance and Economics
2024
PLA Academy of Military Science
2019
Northeastern University
2005-2018
Beijing Institute of Fashion Technology
2018
Norwegian University of Science and Technology
2016
NTNU Samfunnsforskning
2016
Suzhou University of Science and Technology
2015
BaiCheng Normal University
2008-2013
This paper proposes and solves the Time-Interval All Fastest Path (allFP) query. Given a user-defined leaving or arrival time interval I, source node s an end e, allFP asks for set of all fastest paths from to one each sub-interval I. Note that query algorithm should find partitioning I into sub-intervals. Existing methods can only be used solve very special case problem, when is single instant. A straightforward solution run existing many times, once every instant in based on novel...
This paper proposes and solves the min-dist optimal-location query in spatial databases. Given a set S of sites, O weighted objects, region Q, returns location Q which, if new site is built there, minimizes average distance from each object to its closest site. can help franchise (e.g. McDonald's) decide where put store order maximize benefit customers. To solve this problem challenging, for there are theoretically infinite number locations all which could be candidates. first provides...
Mobile crowdsensing, through which a requester can coordinate crowd of workers to complete some sensing tasks, has attracted significant attention recently. In this paper, we focus on the unknown worker recruitment problem in mobile where workers' qualities are priori. We consider scenario recruiting continuous tasks. The whole process is divided into multiple rounds. each round, every task may be covered by more than one recruited workers, but its completion quality only depends these...
Per-flow traffic measurement in the high-speed network plays an important role many practical applications. Due to limited on-chip memory and mismatch between off-chip speed line rate, sampling-based methods select forward a part of flow memory, complementing sketch-based solutions estimation accuracy online query support. However, most current work uses same sampling probability for all flows, overlooking that rates different flows require meet constraint are different. It leads waste...
Per-flow spread measurement in high-speed networks has many practical applications. It is a more difficult problem than the traditional per-flow size measurement. Most prior work based on sketches, focusing reducing their space requirements order to fit on-chip cache memory. This design allows be performed at line rate, but it suffers from expensive computation for queries (unsuitable online operations) and large errors estimation small flows. paper complements art with new estimator an...
Per-flow spread measurement in high-speed networks has many practical applications. It is a more difficult problem than the traditional per-flow size measurement. Most prior work based on sketches, focusing reducing their space requirements order to fit on-chip cache memory. This design allows be performed at line rate, but it accept tradeoff with expensive computation for queries (unsuitable online operations) and large errors estimation small flows. paper complements art new estimator an...
With the proliferation of mobile devices, crowd sensing (MCS) has emerged as a new data collection paradigm, which allows to act sensors and contribute their observations about entities. Unfortunately, users with varied skills motivations may provide conflicting information for same entity. Existing work solves this problem by estimating user reliability inferring correct (i.e., truths). However, these methods assume that users' expertise degrees are dependent on truths, but ignore finer...
This study uses National Health and Nutrition Examination Survey data to examine changes in sedentary time among adults the US from 2013 2023.
This paper presents the first theoretical study, on using local-recoding generalization (LRG) to compute a k-anonymous table with quality guarantee. First, we prove that it is NP-hard both find maximum quality, and discover solution an approximation ratio at most 5/4. Then, develop algorithm good balance between time complexity. The of our verified by experiments.
Per-flow spread measurement in high-speed networks can provide indispensable information to many practical applications. However, it is challenging measure millions of flows at line speed because on-chip memory modules cannot simultaneously large capacity and bandwidth. The prior studies address this mismatch by entirely using compact data structures or utilizing off-chip space assist limited memory. Nevertheless, their record massive transient elements, each which only appears a short time...
Blockchain came to prominence as the distributed ledger underneath Bitcoin, which protects transaction histories in a fully-connected, peer-to-peer network. The blockchain mining process requires high computing power solve Proof-of-Work (PoW) puzzle, is hard implement on users' mobile devices. So these miners may leverage edge/cloud service providers (ESPs/CSP) calculate PoW puzzle. existing edge-assisted networks assumed that all ESPs have uniform propagation delay, unrealistic. In this...
Mobile crowdsensing (MC), an excellent solution to large-scale spatiotemporal data sensing problems, has recently received lots of attention from both industry and academia. In the MC system, any requester can acquire for his points interest (PoIs) by offering some payments attract a group mobile users capable completing these PoI-related tasks. However, current work neglected three vital factors, more or less. First, they assume that distributed are mutually independent in MC, ignoring...
In this rapidly evolving era of multimodal generation, diffusion models exhibit impressive generative capabilities, significantly enhancing the realm creative image synthesis by intricately textual prompts. Yet, their effectiveness is limited in certain niche sectors, like depicting Chinese ancient architecture. This limitation primarily due to insufficient data that fails encompass unique architectural features and corresponding text information. Hence, we build an extensive dataset...
Heavy-hitter detection is a fundamental task in network traffic measurement and security. Existing work faces the dilemma of suffering dynamic imbalanced characteristics or lowering efficiency flexibility. In this paper, we propose flexible sketch called SwitchSketch that embraces skewed for efficient accurate heavy-hitter detection. The key idea allowing to dynamically switch among different modes take full use each bit memory. We present an encoding-based switching scheme together with...