Results 31 to 40 of about 9,951 (116)
ABSTRACT Quantum key distribution (QKD) allows the generation of cryptographic keys beyond the computational hardness paradigm and is befitting for secure data transmission requiring long‐term security. The communication distance of fiber‐based QKD, however, is limited to a few hundred kilometers due to the exponential scaling of signal attenuation ...
Davide Orsucci+7 more
wiley +1 more source
Delay versus Stickiness Violation Trade-offs for Load Balancing in Large-Scale Data Centers
Most load balancing techniques implemented in current data centers tend to rely on a mapping from packets to server IP addresses through a hash value calculated from the flow five-tuple.
Borst, Sem, Liang, Qingkai
core +1 more source
Vertically Recurrent Neural Networks for Sub‐Grid Parameterization
Abstract Machine learning has the potential to improve the physical realism and/or computational efficiency of parameterizations. A typical approach has been to feed concatenated vertical profiles to a dense neural network. However, feed‐forward networks lack the connections to propagate information sequentially through the vertical column.
P. Ukkonen, M. Chantry
wiley +1 more source
The Case for Learned Index Structures
Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate ...
Abadi M.+12 more
core +1 more source
Assessment of Abrupt Shifts in CMIP6 Models Using Edge Detection
Abstract Past research has shown that multiple climate subsystems might undergo abrupt shifts, such as the Arctic Winter sea ice or the Amazon rainforest, but there are large uncertainties regarding their timing and spatial extent. In this study we investigated when and where abrupt shifts occur in the latest generation of earth system models (CMIP6 ...
Sjoerd Terpstra+5 more
wiley +1 more source
High-dimensional approximate nearest neighbor: k-d Generalized Randomized Forests [PDF]
We propose a new data-structure, the generalized randomized kd forest, or kgeraf, for approximate nearest neighbor searching in high dimensions. In particular, we introduce new randomization techniques to specify a set of independently constructed trees ...
Avrithis, Yannis+2 more
core +1 more source
A novel framework for determining the causes of mortality of large GPS‐tagged birds, the LIFE EUROKITE Assessment Protocol (LEAP), was developed. LEAP integrates GPS tracking data, site investigation, and necropsy to derive mortality causes and a corresponding certainty score. Two case studies demonstrated improvements in mortality assessments compared
Connor T. Panter+87 more
wiley +1 more source
Robust Dense Mapping for Large-Scale Dynamic Environments
We present a stereo-based dense mapping algorithm for large-scale dynamic urban environments. In contrast to other existing methods, we simultaneously reconstruct the static background, the moving objects, and the potentially moving but currently ...
Bârsan, Ioan Andrei+3 more
core +1 more source
This study proposes an approach to account for the spatial and temporal variability in the contribution of surface emissivity error in the data assimilation system by including the surface emissivity as an analysis variable and representing its errors in the ensemble‐based background error covariances matrix within an idealized ensemble‐variational ...
Zheng Qi Wang, Mark Buehner, Yi Huang
wiley +1 more source
Parsing Millions of DNS Records Per Second
ABSTRACT Objectives To enhance the throughput of DNS parsing by addressing the computational expense of processing large plain text DNS zone files. To specifically increase the speed of parsing DNS zone files compared to existing state‐of‐the‐art parsers. Method Development of a new approach named simdzone for DNS parsing.
Jeroen Koekkoek, Daniel Lemire
wiley +1 more source