Results 61 to 70 of about 43,136 (260)
Quantum Subroutine for Efficient Matrix Multiplication
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 +3 more
doaj +1 more source
ABSTRACT Objectives Focal cortical dysplasia (FCD) is the most common etiology of drug‐resistant epilepsy in children. Focal to bilateral tonic–clonic seizures (FBTCS) mark a high risk of drug‐resistant epilepsy and involve thalamocortical circuitry in their generation and propagation.
Hua Xie +8 more
wiley +1 more source
Characterizing Cutaneous α‐Synuclein Deposition and Seeding Activity in Parkinson's Disease Subtypes
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 +8 more
wiley +1 more source
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 +4 more
wiley +1 more source
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 +10 more
wiley +1 more source
Algorithms for Matrix Multiplication via Sampling and Opportunistic Matrix Multiplication
Karppa & Kaski (2019) proposed a novel ``broken" or ``opportunistic" matrix multiplication algorithm, based on a variant of Strassen's algorithm, and used this to develop new algorithms for Boolean matrix multiplication, among other tasks. Their algorithm can compute Boolean matrix multiplication in $O(n^{2.778})$ time.
openaire +5 more sources
Barriers for rectangular matrix multiplication
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 +3 more
openaire +4 more sources
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
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 +2 more
wiley +1 more source
Observer‐Based Adaptive Event‐Triggered Tracking Control for Fuzzy TS Systems With Premise Mismatch
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 +3 more
wiley +1 more source
On Some New Generalized Di®erence Sequence Spaces and Their Topological Properties
In this study, we define a new triangle matrix G ={gu,v(r, s, t)} which derived by using multiplication of weightedmean matrix G = (gnk) with triple band matrix B(r, s, t) .
Osman Duyar, Serkan Demiriz
doaj

