Cyclic redundancy code (CRC) polynomial selection for embedded networks

P Koopman, T Chakravarty - International Conference on …, 2004 - ieeexplore.ieee.org
Cyclic redundancy codes (CRCs) provide a first line of defense against data corruption in
many networks. Unfortunately, many commonly used CRC polynomials provide significantly …

PeerRemove: An adaptive node removal strategy for P2P botnet based on deep reinforcement learning

Y Xing, H Shu, F Kang - Computers & Security, 2023 - Elsevier
Botnets have become one of the major intrusion threats to cybersecurity. P2P botnets have
high concealment and resilience because of their distributed structure, which are difficult to …

Efficient service discovery in decentralized online social networks

B Yuan, L Liu, N Antonopoulos - Proceedings of the 3rd IEEE/ACM …, 2016 - dl.acm.org
Online social networks (OSNs) have attracted millions of users worldwide over the last
decade. In response to a series of urgent issues faced by existing OSNs, such as information …

A visual analytics framework for contrastive network analysis

T Fujiwara, J Zhao, F Chen… - 2020 IEEE Conference on …, 2020 - ieeexplore.ieee.org
A common network analysis task is comparison of two networks to identify unique
characteristics in one network with respect to the other. For example, when comparing …

Establishing norms with metanorms over interaction topologies

S Mahmoud, N Griffiths, J Keppens, M Luck - Autonomous Agents and …, 2017 - Springer
Norms are a valuable means of establishing coherent cooperative behaviour in
decentralised systems in which there is no central authority. Axelrod's seminal model of …

[PDF][PDF] Interpretable contrastive learning for networks

T Fujiwara, J Zhao, F Chen, Y Yu… - arXiv preprint arXiv …, 2020 - researchgate.net
Contrastive learning (CL) is an emerging analysis approach that aims to discover unique
patterns in one dataset relative to another. By applying this approach to network analysis …

Verifying properties using sequential ATPG [IC design]

JA Abraham, VM Vedula - Proceedings. International Test …, 2002 - ieeexplore.ieee.org
This paper develops a novel approach for formally verifying both safety and liveness
properties of designs using sequential ATPG tools. The properties are automatically mapped …

Dynamic ONU grouping algorithm based on combination partition for centralized flexible PON

J Chen, Q Tian, X Zhang, F Wang, D Sun, L Zhu… - Applied Optics, 2024 - opg.optica.org
The traditional optical access network architecture is fixed, and passive optical networking
(PON) is only used as the transmission pipeline, which fails to make full use of the exchange …

Social-similarity-aware TCP with collision avoidance in ad hoc social networks

HB Liaqat, F Xia, J Ma, LT Yang… - IEEE Systems …, 2014 - ieeexplore.ieee.org
An ad hoc social network (ASNET), which explores social connectivity between users of
mobile devices, is becoming one of the most important forms of today's Internet. In this …

On exploiting social relationship and personal background for content discovery in P2P networks

X Han, A Cuevas, N Crespi, R Cuevas… - Future Generation …, 2014 - Elsevier
Content discovery is a critical issue in unstructured Peer-to-Peer (P2P) networks as nodes
maintain only local network information. However, similarly without global information about …