Anonymous tracking using RFID tags

M Kodialam, T Nandagopal… - IEEE INFOCOM 2007-26th …, 2007 - ieeexplore.ieee.org
The increasing use of RFID tags in many applications have brought forth valid concerns of
privacy and anonymity among users. One of the primary concerns with RFID tags is their …

Collaborative internet worm containment

M Cai, K Hwang, YK Kwok, S Song… - IEEE Security & …, 2005 - ieeexplore.ieee.org
Collaborative Internet worm containment Page 1 Infrastructure Security MIN CAI, KAI HWANG,
YUKWONG KWOK, SHANSHAN SONG, AND YU CHEN University of Southern California …

An efficient clustering scheme to exploit hierarchical data in network traffic analysis

AN Mahmood, C Leckie, P Udaya - IEEE Transactions on …, 2008 - ieeexplore.ieee.org
There is significant interest in the data mining and network management communities about
the need to improve existing techniques for clustering multivariate network traffic flow …

Reordering columns for smaller indexes

D Lemire, O Kaser - Information Sciences, 2011 - Elsevier
Column-oriented indexes—such as projection or bitmap indexes—are compressed by run-
length encoding to reduce storage and increase speed. Sorting the tables improves …

Network traffic analysis and SCADA security

AN Mahmood, C Leckie, J Hu, Z Tari… - Handbook of Information …, 2010 - Springer
The problem of monitoring and characterizing network traffic arises in the context of a variety
of network management functions. For example, consider the five functions defined in the …

Deep Learning-Based Bloom Filter for Efficient Multi-key Membership Testing

H Chen, Z Wang, Y Li, R Yang, Y Zhao, R Zhou… - Data Science and …, 2023 - Springer
Multi-key membership testing plays a crucial role in computing systems and networking
applications, encompassing web search, mail systems, distributed databases, firewalls, and …

Learned bloom filter for multi-key membership testing

Y Li, Z Wang, R Yang, Y Zhao, R Zhou… - … Conference on Database …, 2023 - Springer
Multi-key membership testing refers to checking whether a queried element exists in a given
set of multi-key elements, which is a fundamental operation for computing systems and …

Virtual self-adaptive bitmap for online cardinality estimation

J Lu, H Chen, J Zhang, T Hu, P Sun, Z Zhang - Information Systems, 2023 - Elsevier
Cardinality estimation is the task of obtaining the number of distinct items in a data stream,
which plays an important role in many application domains. However, when dealing with …

WormShield: Fast worm signature generation with distributed fingerprint aggregation

M Cai, K Hwang, J Pan… - IEEE Transactions on …, 2007 - ieeexplore.ieee.org
Fast and accurate generation of worm signatures is essential to contain zero-day worms at
the Internet scale. Recent work has shown that signature generation can be automated by …

SuperGuardian: Superspreader removal for cardinality estimation in data streaming

J Lu, H Chen, P Sun, T Hu, Z Zhang, Q Ren - Information Systems, 2024 - Elsevier
Measuring flow cardinality is one of the fundamental problems in data stream mining, where
a data stream is modeled as a sequence of items from different flows and the cardinality of a …