Results 71 to 80 of about 1,720,417 (290)

GPU computing performance analysis on matrix multiplication

The Journal of Engineering, 2019
The machine learning has been widely used in intelligent data mining. The high-computational complexity of machine learning and huge data volume present challenges to computing platforms.
Zhibin Huang, Ning Ma, Shaojun Wang, Yu Peng   +3 more
doaj   +1 more source

Characterizing Cutaneous α‐Synuclein Deposition and Seeding Activity in Parkinson's Disease Subtypes

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Cutaneous phosphorylated α‐synuclein (p‐syn) and α‐synuclein seeding activity are promising biomarkers for Parkinson's disease (PD), but their clinical value remains uncertain due to disease heterogeneity. This study evaluates these two biomarkers in PD patients to inform phenotype‐specific diagnosis and disease severity assessment ...
Yuting Jin, Tianyuan Yang, Minglei Liu, Haiyang Luo, Jing Yuan, Ke Zhang, Xinsheng Han, Jing Yang, Yuming Xu   +8 more
wiley   +1 more source

Quantum Subroutine for Efficient Matrix Multiplication

IEEE Access
We propose an efficient quantum subroutine for matrix multiplication that computes a state vector encoding the entries of the product of two matrices in superposition.
Anna Bernasconi, Alessandro Berti, Gianna Maria del Corso, Alessandro Poggiali   +3 more
doaj   +1 more source

Comparative Analysis of Choroid Plexus Volume Between MOG Antibody Associated Disease and Multiple Sclerosis

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Choroid plexus volume (CPV) has been proposed as a neuro‐immunological marker of multiple sclerosis (MS), but its relevance in myelin oligodendrocyte glycoprotein antibody–associated disease (MOGAD) remains uncertain. We analyzed CPV in 43 individuals with MOGAD, 48 with MS, and 44 healthy controls using a Bayesian Gaussian mixture modeling ...
Jae‐Won Hyun, Shaun G. Hong, Na Young Park, Su‐Hyun Kim, Ho Jin Kim   +4 more
wiley   +1 more source

Skew-sparse matrix multiplication [PDF]

, 2022
Based on the observation that $\mathbb{Q}^{(p-1) \times (p-1)}$ is isomorphic to a quotient skew polynomial ring, we propose a new method for $(p-1)\times (p-1)$ matrix multiplication over $\mathbb{Q}$, where $p$ is a prime number.
Gao, Xiao-Shan, Huang, Qiao-Long, Ye, Ke
core   +1 more source

Perceived Impacts and Predictors of Cannabis Products Used by Patients with Rheumatologic Conditions in Alberta, Canada: A Multivariable Analysis of Cross‐Sectional Survey Data

Arthritis Care &Research, EarlyView.
Objective This study aimed to characterize cannabis product choices (cannabinoid content and formulation) among patients with rheumatologic conditions and their associations with patient factors, patient‐reported perceived side effects, and positive impacts.
Susan Zhang, Samuel A.J. Lowe, Frank Sun, Allyson Jones, Tarek Turk, Joanne Olson, Pauline Paul, Shelby Yamamoto, Linda Kolewaski, Elaine Yacyshyn, Cheryl A. Sadowski   +10 more
wiley   +1 more source

Fast Matrix Multiplication is Stable [PDF]

, 2007
We perform forward error analysis for a large class of recursive matrix multiplication algorithms in the spirit of [D. Bini and G. Lotti, Stability of fast algorithms for matrix multiplication, Numer. Math. 36 (1980), 63–72].
Holtz, Olga, Dumitriu, Ioana, Ioana Dumitriu, James Demmel, Olga Holtz, Kleinberg, Robert, Robert Kleinberg, Demmel, James   +7 more
core   +1 more source

A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems

International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.
A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam, Anthony Siming Chen, Guido Herrmann   +2 more
wiley   +1 more source

Barriers for rectangular matrix multiplication

computational complexity
Abstract We study the algorithmic problem of multiplying large matrices that are rectangular. We prove that the method that has been used to construct the fastest algorithms for rectangular matrix multiplication cannot give algorithms with complexity $$n^{p + 1}$$
Matthias Christandl, François Le Gall, Vladimir Lysikov, Jeroen Zuiddam   +3 more
openaire   +5 more sources

Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch

International Journal of Adaptive Control and Signal Processing, EarlyView.
This paper presents an adaptive logistic event‐triggered observer‐based tracking controller for Takagi‐Sugeno fuzzy systems under constrained inputs and network delays. Leveraging a hybrid LMI and Secretary Bird Optimization approach, this strategy significantly minimizes communication overhead and computational burden while ensuring optimal reference ...
Oussama Djadane, Salama Makni, Mourad Kchaou, Ahmed El Hajjaji   +3 more
wiley   +1 more source