Results 41 to 50 of about 983,384 (170)
MSI: A Mahalanobis‐Based Molecular Similarity Index for High‐Dimensional Embeddings
Molecular Informatics, Volume 45, Issue 9, September 2026.MSI pairs continuous Mol2Vec embeddings with a covariance‐aware Mahalanobis metric (dM, θM) to overcome the ranking ties and bit‐density bias of Tanimoto fingerprints. Across five reference compounds, MSI resolves more distinct neighbors than ECFP4 + Tanimoto and its geometry tracks HOMO–LUMO gaps in QM9, despite no electronic training.
Roberto Bernal‐Jaquez +4 more
wiley +1 more source
Fuzzy Universal Hashing and Approximate Authentication
, 2005 Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally fuzzy where similar messages are considered the same or at least indistinguishable.
Dongvu Tonien, Reihaneh Safavi-Naini
core +1 more source
Time Series Domain Adaptation: A Review
WIREs Data Mining and Knowledge Discovery, Volume 16, Issue 3, September 2026.This survey provides a comprehensive and systematic review of TSDA methods from the perspectives of access‐privacy constraints, category‐space semantics, and source‐target topology, three orthogonal axes that unify existing approaches within a common taxonomy.
M. T. Furqon +2 more
wiley +1 more source
Universal Hash Functions from Quantum Procedures
Uchenye Zapiski Kazanskogo Universiteta. Seriya Fiziko-Matematicheskie Nauki, 2020 Modern quantum technologies are NISQ (Noisy Intermediate-Scale Quantum) devices, which are used to create insufficiently accurate quantum computers with low computing power. However, quantum technologies have advanced considerably during the past years.
Ablayev F.M., Ziatdinov M.T.
openaire +2 more sources
The three‐step test in international copyright—a global framework for generative AI training
American Business Law Journal, Volume 63, Issue 3, Page 265-298, Fall 2026.Abstract The training of generative artificial intelligence (genAI) models involves the processing of large datasets, which often include copyrighted materials, thereby raising questions of copyright infringement. These questions tend to center on whether such use constitutes fair use or falls under text and data mining (TDM) exceptions.
Nicola Lucchi +2 more
wiley +1 more source
Robust and secure perceptual image hashing in the transform domain [PDF]
The rapid development of multimedia devices such as computers, network technologies, and cell phones have made it easier for users to create, broadcast, convey, share, store, and distribute multimedia data including images, videos and audio files on a ...
Prungsinchai, Supakorn
core
Square Hash: Fast Message Authentication via Optimized Universal Hash Functions [PDF]
, 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 +2 more sources
Exploration, Volume 6, Issue 4, August 2026.Based on the interaction between the weakly cross‐linked disulfide bonds that break under stress and charge‐reversal messenger molecules, we herein achieved nanoparticle charge reversal under stress and constructed a stress‐responsive charge‐reversal hydrogel microsphere system using microfluidic technology.
Feng Lin +11 more
wiley +1 more source
Term Spread Volatility as a Leading Indicator of Economic Activity
Journal of Forecasting, Volume 45, Issue 5, Page 2332-2354, August 2026.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
Properties of universal hashing
, 2013 The aim of this work is to create a model of hashing with an acceptable worst case time complexity. The model is based on the idea of universal hashing and the expected time of every operation is constant.
Babka, Martin
core