Results 91 to 100 of about 1,500,333 (340)
ABSTRACT Background Low Earth Orbit (LEO) satellite constellations are redefining the concept of global connectivity, opening up a new world of opportunities for communication services and applications. Purpose The emergence of LEO satellites (SATs) is ushering in a new era of innovation, where new complex technologies are being developed, and the use ...
Pilar Manzanares‐Lopez+2 more
wiley +1 more source
CPHASH: a cache-partitioned hash table
CPHash is a concurrent hash table for multicore processors. CPHash partitions its table across the caches of cores and uses message passing to transfer lookups/inserts to a partition.
Z. Metreveli+2 more
semanticscholar +1 more source
ABSTRACT Introduction The popularization of blockchain‐based applications made evident a critical challenge, namely the inherent isolation of these decentralized systems, akin to the disconnected and technologically diverse local area networks of the 1970s. This lack of interoperability limits the potential for widespread adoption and innovation in the
Christian Delgado‐von‐Eitzen+3 more
wiley +1 more source
Fuzzy Identity-Based Dynamic Auditing of Big Data on Cloud Storage
To ensure the reliability and integrity of data in the cloud storage server, some scholars provided various data integrity auditing schemes. However, the most existing data integrity auditing schemes only support the static data and may be unsuitable for
Chenbin Zhao+4 more
doaj +1 more source
Optimal Arrangement of Keys in a Hash Table [PDF]
When open addressing IS used to resolve collisions in a hash table, a given set of keys may be arranged in many ways, typically this depends on the order in which the keys are inserted It is shown that arrangements minimizing either the average or worst-case number of probes required to retrieve any key in the table can be found using an algorithm for ...
openaire +3 more sources
Determination of the Optimal Window Size for the Spatial XOR Filter
ABSTRACT Introduction An XOR filter is a probabilistic data structure representing a set of keys for membership queries. Given a set X⊂𝒰 of n$$ n $$ keys, and hash functions h1,…,hk:𝒰→{1,…,m}, the filter relies on filling in an array H[1,…,m]$$ H\left[1,\dots, m\right] $$ such that, for all x∈X$$ x\in X $$, h1(x)⊕⋯⊕hk(x)$$ {h}_1(x)\oplus \cdots \oplus {
Paulo Diogo Rodrigues Leão+2 more
wiley +1 more source
Lock-free dynamic hash tables with open addressing [PDF]
Hui Gao+2 more
openalex +1 more source
A Risk Manager for Intrusion Tolerant Systems: Enhancing HAL 9000 With New Scoring and Data Sources
ABSTRACT Background Intrusion Tolerant Systems (ITS) aim to maintain system security despite adversarial presence by limiting the impact of successful attacks. Current ITS risk managers rely heavily on public databases like NVD and Exploit DB, which suffer from long delays in vulnerability evaluation, reducing system responsiveness. Objective This work
Tadeu Freitas+6 more
wiley +1 more source
Fast hash table lookup using extended bloom filter [PDF]
Haoyu Song+3 more
openalex +1 more source
Blockchain and Digital Technologies in the Telecommunications Industry
ABSTRACT This article examines how fourth industrial revolution (4IR) technologies, specifically blockchain and digital twin technologies, can be utilized to address the energy supply challenge and enhance the management of distributed telecom infrastructure assets in a research context.
Charles Okeyia+3 more
wiley +1 more source