Results 41 to 50 of about 44,375 (171)

INB3P: A Multi‐Modal and Interpretable Co‐Attention Framework Integrating Property‐Aware Explanations and Memory‐Bank Contrastive Fusion for Blood–Brain Barrier Penetrating Peptide Discovery

open access: yesAdvanced Science, EarlyView.
INB3P is a multimodal framework for blood–brain barrier‐penetrating peptide prediction under extreme data scarcity and class imbalance. By combining physicochemical‐guided augmentation, sequence–structure co‐attention, and imbalance‐aware optimization, it improves predictive performance and interpretability.
Jingwei Lv   +11 more
wiley   +1 more source

Recursive n-gram hashing is pairwise independent, at best [PDF]

open access: yes, 2010
Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter   +12 more
core   +2 more sources

Term Spread Volatility as a Leading Indicator of Economic Activity

open access: yesJournal of Forecasting, EarlyView.
ABSTRACT In this paper, we examine the macroeconomic predictive power of the volatility of the US Treasury yield curve slope (term spread volatility). Our forecasting exercise shows that US term spread volatility has significant predictive power for US industrial production and employment growth.
Anastasios Megaritis   +3 more
wiley   +1 more source

Fast hashing with Strong Concentration Bounds

open access: yes, 2020
Previous work on tabulation hashing by Patrascu and Thorup from STOC'11 on simple tabulation and from SODA'13 on twisted tabulation offered Chernoff-style concentration bounds on hash based sums, e.g., the number of balls/keys hashing to a given bin, but
Aamand Anders   +9 more
core   +1 more source

Low-power bloom filter architecture for deep packet inspection [PDF]

open access: yes, 2006
Bloom filters are frequently used to identify malicious content like viruses in high speed networks. However, architectures proposed to implement bloom filters are not power efficient.
Kaya, I, Kocak, T
core   +2 more sources

God's Presence in the Aisle: How God Salience Encourages Preference for Ultra‐Processed Foods

open access: yesPsychology &Marketing, EarlyView.
ABSTRACT God‐related cues are pervasive in consumers' daily lives, yet little research has examined how God salience shapes consumer food choices. Drawing on compensatory control theory and the literature on symbolic healing, we present findings from six studies, including a field experiment, demonstrating that high (vs.
Ali Gohary, Hean Tat Keh
wiley   +1 more source

Square Hash: Fast Message Authentication via Optimized Universal Hash Functions [PDF]

open access: yes, 1999
This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authentication. First, we describe a simple but novel family of universal hash functions that is more efficient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk [12].
Mark Etzel   +2 more
openaire   +1 more source

PPP-Completeness with Connections to Cryptography [PDF]

open access: yes, 2018
Polynomial Pigeonhole Principle (PPP) is an important subclass of TFNP with profound connections to the complexity of the fundamental cryptographic primitives: collision-resistant hash functions and one-way permutations.
Sotiraki, Katerina   +2 more
core   +1 more source

A secured cloud‐medical data sharing with A‐BRSA and Salp ‐Ant Lion Optimisation Algorithm

open access: yesCAAI Transactions on Intelligence Technology, EarlyView.
Abstract Sharing medical data among healthcare providers, researchers, and patients is crucial for efficient healthcare services. Cloud‐assisted smart healthcare (s‐healthcare) systems have made it easier to store EHRs effectively. However, the traditional encryption algorithms used to secure this data can be vulnerable to attacks if the encryption key
Adel Binbusayyis   +7 more
wiley   +1 more source

Linear time Constructions of some $d$-Restriction Problems [PDF]

open access: yes, 2014
We give new linear time globally explicit constructions for perfect hash families, cover-free families and separating hash ...
Bshouty, Nader H.
core   +1 more source

Home - About - Disclaimer - Privacy