Results 71 to 80 of about 189,405 (333)
Spintronic Memtransistor Leaky Integrate and Fire Neuron for Spiking Neural Networks
Spintronic memtransistor neurons based on domain walls enable energy‐efficient, field‐gated, and current‐controlled LIF functionality for neuromorphic computing, as demonstrated. When integrated into spiking neural network architectures, these devices achieve >96% pattern recognition accuracy, demonstrating high performance, scalability, and mem ...
Aijaz H. Lone+7 more
wiley +1 more source
The geometry of numbers over algebraic number fields [PDF]
1. The Geometry of Numbers was founded by Minkowski in order to attack certain arithmetical problems, and is normally concerned with lattices over the rational integers. Minkowski himself, however, also treated a special problem over complex quadratic number fields [5], and a number of writers have since followed him.
H. P. F. Swinnerton-Dyer, K. Rogers
openaire +3 more sources
Mapping uncertainty using differentiable programming
Abstract Uncertainty quantification (UQ) and propagation is a ubiquitous challenge in science, permeating our field in a general fashion, and its importance cannot be overstated. Recently, the commoditization of differentiable programming, motivated by the development of machine learning, has allowed easier access to tools for evaluating derivatives of
Victor Alves+3 more
wiley +1 more source
The hit problem, set up by F. Peterson, finds a minimal set of generators for the polynomial algebra P(s)=F_2 [x_1,x_2,…,x_s ], as a module over the mod-2 Steenrod algebra.
Bich Nhu Pham, Tu Thinh Nguyen
doaj +3 more sources
In Situ Graph Reasoning and Knowledge Expansion Using Graph‐PRefLexOR
Graph‐PRefLexOR is a novel framework that enhances language models with in situ graph reasoning, symbolic abstraction, and recursive refinement. By integrating graph‐based representations into generative tasks, the approach enables interpretable, multistep reasoning.
Markus J. Buehler
wiley +1 more source
Leibniz algebras: a brief review of current results
Let $L$ be an algebra over a field $F$ with the binary operations $+$ and $[\cdot,\cdot]$. Then $L$ is called a left Leibniz algebra if it satisfies the left Leibniz identity $[[a,b],c]=[a,[b,c]]-[b,[a, c]]$ for all $a,b,c\in L$.
V.A. Chupordia+3 more
doaj +1 more source
A crystal graph neural network based on the attention mechanism is proposed in this work. The model dynamically weights features through the attention mechanism, enabling precise prediction of properties of material from structural features. Here, taking Janus III–VI van der Waals heterostructures as a representative case, the properties have been ...
Yudong Shi+7 more
wiley +1 more source
On degenerations of algebras over an arbitrary field
For each $n\ge2$ we classify all $n$-dimensional algebras over an arbitrary infinite field which have the property that the $n$-dimensional abelian Lie algebra is their only proper degeneration.
Nataliya M. Ivanova+1 more
openaire +3 more sources
This article offers a comprehensive review of topic modeling techniques, tracing their evolution from inception to recent developments. It explores methods such as latent Dirichlet allocation, latent semantic analysis, non‐negative matrix factorization, probabilistic latent semantic analysis, Top2Vec, and BERTopic, highlighting their strengths ...
Pratima Kumari+6 more
wiley +1 more source
A Computer Algebra System for R: Macaulay2 and the m2r Package
Algebraic methods have a long history in statistics. Apart from the ubiquitous applications of linear algebra, the most visible manifestations of modern algebra in statistics are found in the young field of algebraic statistics, which brings tools from ...
David Kahle+2 more
doaj +1 more source