Results 71 to 80 of about 569,401 (216)
T1 and T2 measurements of the neonatal brain at 7 T
Abstract Purpose To determine the expected range of NMR relaxation times (T1 and T2) in the neonatal brain at 7 T. Methods Data were acquired in a total of 40 examinations on infants in natural sleep. The cohort included 34 unique subjects with postmenstrual age range between 33 and 52 weeks and contained a mix of healthy individuals and those with ...
Aiman Mahmoud+17 more
wiley +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
Perfect Consistent Hashing [PDF]
Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which results in a flawed and approximately-uniform allocation of keys to hash codes. We analyse the desired properties
arxiv
Implementation of a Perfect Hash Function Scheme [PDF]
This report surveys the recent development in computing perfect hash functions, and in particular, closely examines an algorithm proposed by Thomas Sager.
Datta, Sanjeev, Fox, Edward A.
core
New Families of Strength‐3 Covering Arrays Using Linear Feedback Shift Register Sequences
ABSTRACT In an array over an alphabet of v symbols, a t‐set of column indices { c 1 , … , c t } is covered if each t‐tuple of the alphabet occurs at least once as a row of the sub‐array indexed by c 1 , … , c t. A covering array, denoted by CA( N ; t , k , v ), is an N × k array over an alphabet with v symbols with the property that any t‐set of ...
Kianoosh Shokri, Lucia Moura
wiley +1 more source
Hash function based secret sharing scheme designs [PDF]
Secret sharing schemes create an effective method to safeguard a secret by dividing it among several participants. By using hash functions and the herding hashes technique, we first set up a (t+1, n) threshold scheme which is perfect and ideal, and then extend it to schemes for any general access structure.
arxiv
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
Deep Hashing: A Joint Approach for Image Signature Learning [PDF]
Similarity-based image hashing represents crucial technique for visual data storage reduction and expedited image search. Conventional hashing schemes typically feed hand-crafted features into hash functions, which separates the procedures of feature extraction and hash function learning.
arxiv
Hash functions - characteristics, implementation and collisions [PDF]
Hašovací funkce patří mezi prvky moderní kryptografie. Jejich úkolem je na vstupu očekávaná data převést do unikátní bitové posloupnosti. Hašovací funkce jsou používány v mnoha aplikačních oblastech, jako je ověřování integrity zpráv, autentizace ...
Karásek, Jan
core
Abstract The military is widely regarded as an extension and tool of government and society, and unreliable military behaviour during operations can have far‐reaching strategic and political consequences. Historically, literature has focused on the role of leaders in preventing disaster, emphasizing their traits, styles and attributes.
Sally Knox+2 more
wiley +1 more source