Results 41 to 50 of about 275,015 (197)
Evidence for the associated production of a W boson and a top quark in ATLAS at √s = 7 TeV [PDF]
, 2012 This Letter presents evidence for the associated production of a W boson and a top quark using 2.05 fb −1 of pp collision data at √ s = 7 TeV accumulated with the ATLAS detector at the LHC.
Farrington, Sinead, HASH(0x5574f3c2fd88)
core +1 more source
Artificial intelligence in data storage systems
Advanced Engineering Research, 2020 Introduction. The artificial intelligence (AI) performance in data storage systems is considered. When working with data, the advantage of its use both in economic terms and for security is determined. The work objective is the introduction of artificial
V. V. Zhilin, O. A. Safar'yan
doaj +1 more source
IEEE Access, 2023 With the enormous growth in Internet of Things (IoT) applications, the volume of data shared among IoT devices is vastly increasing. Extensive IoT device connectivity and substantial data transmission have made information integrity susceptible to ...
Susila Windarta +6 more
doaj +1 more source
Grayscale Image Authentication using Neural Hashing
, 2016 Many different approaches for neural network based hash functions have been proposed. Statistical analysis must correlate security of them. This paper proposes novel neural hashing approach for gray scale image authentication.
Kutlu, Yakup, Yayık, Apdullah
core +2 more sources
Measurement of τ polarization in W→τν decays with the ATLAS detector in pp collisions at √s=7 TeV [PDF]
, 2012 In this paper, a measurement of τ polarization in W→τν decays is presented. It is measured from the energies of the decay products in hadronic τ decays with a single final state charged particle.
Farrington, Sinead, HASH(0x5574f3e37338)
core +1 more source
Avoiding Rotated Bitboards with Direct Lookup [PDF]
, 2007 This paper describes an approach for obtaining direct access to the attacked squares of sliding pieces without resorting to rotated bitboards. The technique involves creating four hash tables using the built in hash arrays from an interpreted, high level
Tannous, Sam
core
Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence
, 2013 Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core +1 more source
Balanced Allocations and Double Hashing [PDF]
, 2014 Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N. +7 more
core +1 more source
Algorithmica, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pagh, Rasmus +3 more
openaire +4 more sources
Natural Hazard Overview: Landslides [PDF]
, 2018 The National Centre for Resilience supported the Met Office and their partner organisations in the production of a set of Natural Hazard Overviews. This factsheet is one of the set commissioned to meet a requirement for Scotland-specific information ...
make_name_string expected hash reference
core