Results 91 to 100 of about 1,098,148 (248)
Place as a Metaphysical Problem in Albert the Great and Thomas Aquinas
Modern Theology, Volume 41, Issue 2, Page 292-310, April 2025.Abstract Thomas Aquinas’ particular synthesis of Aristotelianism and Neoplatonism, and the intellectual tradition it inaugurated, has at least twice faced critical challenges from developments in physics. Besieged by the sixteenth and seventeenth century novatores and more or less ignored by the nineteenth‐ and twentieth‐century practitioners of ...
Onsi Aaron Kamel
wiley +1 more source
Single‐ and Three‐Photon Ionization of N2$$ {N}_2 $$ in Presence of Fano Resonances
Journal of Computational Chemistry, Volume 46, Issue 7, March 15, 2025.With upcoming high‐intensity attosecond light sources new theoretical approaches for multi‐photon interactions with molecular systems in the non‐perturbative and multi‐photon regime are needed. Solutions of the time‐dependent Schrödinger equation provide all this, but the massive involvement of continuum states necessitates a combination of Gaussian ...
Vinay Pramod Majety, Armin Scrinzi
wiley +1 more source
Attacks on quantum key distribution protocols that employ non-ITS authentication
, 2015 We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously.
A Abidin +25 more
core +1 more source
Quantum Entanglement Capacity with Classical Feedback
, 2007 For any quantum discrete memoryless channel, we define a quantity called quantum entanglement capacity with classical feedback ($E_B$), and we show that this quantity lies between two other well-studied quantities.
A. W. Leung +5 more
core +1 more source
Engineering Reports, Volume 7, Issue 3, March 2025.We present the details of implementing a highly efficient and scalable Cosmological N‐body simulation framework on the heterogeneous many‐core supercomputer Sunway TaihuLight. We manage to conduct cosmological simulations which contain up to 1.6 trillion particles, obtaining a sustained performance of 56.3 PFlops with a weak‐scaling parallel efficiency
Zhao Liu +8 more
wiley +1 more source
Compact Hyperplane Hashing with Bilinear Functions [PDF]
arXiv, 2012 Hyperplane hashing aims at rapidly searching nearest points to a hyperplane, and has shown practical impact in scaling up active learning with SVMs. Unfortunately, the existing randomized methods need long hash codes to achieve reasonable search accuracy and thus suffer from reduced search speed and large memory overhead.
arxiv
Magnetic Resonance in Medicine, Volume 93, Issue 3, Page 1090-1103, March 2025.Abstract Purpose This work proposes a “hybrid” RF pulse design method for parallel transmit (pTx) systems to simultaneously control flip angle and root‐mean‐squared B1+$$ {\mathrm{B}}_1^{+} $$ (B1rms$$ {B}_1^{\mathrm{rms}} $$). These pulses are generally only designed for flip angle, however, this can lead to uncontrolled B1rms$$ {B}_1^{\mathrm{rms}} $$
David Leitão +9 more
wiley +1 more source
On Hashing-Based Approaches to Approximate DNF-Counting [PDF]
arXiv, 2017 Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncertainty, and probabilistic databases. Consequently, the problem is of theoretical as well as practical interest.
arxiv
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].
Sarvar Patel +2 more
openaire +2 more sources
Approximately Minwise Independence with Twisted Tabulation [PDF]
arXiv, 2014 A random hash function $h$ is $\varepsilon$-minwise if for any set $S$, $|S|=n$, and element $x\in S$, $\Pr[h(x)=\min h(S)]=(1\pm\varepsilon)/n$. Minwise hash functions with low bias $\varepsilon$ have widespread applications within similarity estimation.
arxiv