Results 41 to 50 of about 6,152,737 (292)
Adaptive Local Polynomial Fourier Transform in ISAR
EURASIP Journal on Advances in Signal Processing, 2006 The adaptive local polynomial Fourier transform is employed for improvement of the ISAR images in complex reflector geometry cases, as well as in cases of fast maneuvering targets.
Thayaparan Thayananthan +2 more
doaj +1 more source
Polynomial interpolation methods in development of local geoid model
Egyptian Journal of Remote Sensing and Space Sciences, 2018 In geodesy three surfaces, the physical surface of the earth, the geoid and the reference ellipsoid are encountered giving rise to orthometric height (h), the ellipsoidal height (H) and the geoidal separation (N).
Rabindra Kumar Das +3 more
doaj +1 more source
Square-rich fixed point polynomial evaluation on FPGAs [PDF]
, 2014 Polynomial evaluation is important across a wide range of application domains, so significant work has been done on accelerating its computation. The conventional algorithm, referred to as Horner's rule, involves the least number of steps but can lead to
McLoughlin, Ian V. +5 more
core +1 more source
Relationship Between Neurologic Symptoms and Signs and FMR1 Genotype in Premutation Carriers
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background and Objectives Fragile X‐associated Tremor/Ataxia Syndrome (FXTAS) is the most severe late‐onset condition caused by a premutation in the FMR1 gene, characterized by expanded CGG triplet repeats of 55–200. Clinical presentations of FXTAS, including gait ataxia, kinetic tremor, cognitive decline, and rare Parkinsonism, are linked to ...
Flora Tassone +8 more
wiley +1 more source
On Locally Invertible Systems of Polynomials
Journal of Algebra, 1994 Let \(K\) be a commutative integral domain, \(K^*\) its group of units and \(F = (F_ 1, \dots, F_ n) \in K[X]^ n\), \(X = (X_ 1, \dots, X_ n)\). \(F\) is called locally invertible if for every point \(a \in K^ n\) the system of polynomials \(F_ a (X) : = F(X + a) - F(a)\) has a formal inverse, i.e. there exists \(G_ a \in K [[X]]^ n\) such that \(F_ a \
openaire +2 more sources
Local Universality of Zeroes of Random Polynomials [PDF]
International Mathematics Research Notices, 2014 56 pages, no figures, to appear, IMRN.
Tao, Terence, Vu, Van
openaire +2 more sources
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Digital technologies hold promise for transforming healthcare by enhancing personalized treatments and offer valuable opportunities to improve patient care. Here, we evaluated several novel, self‐administered, home‐based, digital endpoints for their association with corresponding conventional standard clinical measures (primary) in ...
Arne Mueller +14 more
wiley +1 more source
Localization and Primary Decomposition of Polynomial Ideals
Journal of Symbolic Computation, 1996 The authors give a new algorithm for primary decomposition of a polynomial ideal. Let \(I\) be an ideal of the polynomial ring \(R=\mathbb{Q}[x_1,\dots,x_n]\) over the rational numbers. An ideal is called pseudo-primary, if its radical is a prime ideal. The methods are described roughly as follows.
Takeshi Shimoyama, Kazuhiro Yokoyama
openaire +3 more sources
Data‐Driven SuStaIn Model of Disability Progression in Amyotrophic Lateral Sclerosis
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To determine whether ordinal Subtype and Stage Inference (SuStaIn) applied to routine ALSFRS‐R item scores can identify reproducible disability progression patterns in amyotrophic lateral sclerosis (ALS) and provide clinically meaningful staging.
Giammarco Milella +5 more
wiley +1 more source
Journal of Harbin University of Science and Technology, 2022 The equivalence between direct flux reconstruction method and discontinuous Galerkin method for solving parabolic equation and convection-diffusion equation is studied.
BI Hui, LIU Lei
doaj +1 more source