Results 201 to 210 of about 23,863 (307)
A Significant Unification of Checksums and Hash Tables Using AIT
Qinglin Yang +3 more
openalex +2 more sources
Methodologies for Sample Multiplexing and Computational Deconvolution in Single‐Cell Sequencing
Sample multiplexing offers a critical solution for boosting throughput and minimizing batch effects in single‐cell sequencing. This review navigates the latest experimental methodologies and computational deconvolution algorithms, bridging the gap between wet‐lab design and analytical success.
Yufei Gao, Weiwei Yin, Wei Hu, Wei Chen
wiley +1 more source
IBS-ECDHE: A blockchain-enhanced lightweight protocol for secure cloud-IoT in biomedical HCPS. [PDF]
Rehman AU +6 more
europepmc +1 more source
Seasonal activity budgets for four groups of white‐handed gibbons (Hylobates lar) at Khao Nang Rum Wildlife Research Station, Huai Kha Khaeng Wildlife Sanctuary, Thailand, from March 2012 to May 2013. Groups A and B are located in the evergreen habitat, while groups D and L are located in the savannah habitat.
Lydia E. O. Light +2 more
wiley +1 more source
A Lightweight Authentication and Key Distribution Protocol for XR Glasses Using PUF and Cloud-Assisted ECC. [PDF]
Cha W, Lee HJ, Kook S, Kim K, Won D.
europepmc +1 more source
A high-performance distributed hash table for peer-to-peer information retrieval
Fabius Klemm
openalex +2 more sources
This study examined structural connectivity (SC) and structural–functional coupling (SFC) within working memory (WM) networks in end‐stage renal disease. Pre‐dialysis patients showed disrupted frontoparietal connectivity and reduced coupling, associated with higher urea, lower sodium, and impaired WM performance.
Xiaoling Xu +11 more
wiley +1 more source
A lightweight scalable and dynamic blockchain-based model for storing and retrieving patient healthcare records. [PDF]
Soleimani Nadaf SR +3 more
europepmc +1 more source
WarpSpeed: A High-Performance Library for Concurrent GPU Hash Tables [PDF]
Hunter McCoy, Prashant Pandey
openalex +1 more source
Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint
ABSTRACT We investigate the performance of algorithms that explore large state graphs of finite state machines without input by following paths. To improve on anchor‐based and candidate‐based explorations and to avoid the performance overhead of full anchor lists and the tuning sensitivity of timeout‐based methods, we propose and analyze exploration ...
Jörg Keller, Sebastian Litzinger
wiley +1 more source

