Results 51 to 60 of about 17,255,193 (320)
, 2015 The circuit evaluation problem (also known as the compressed word problem) for finitely generated linear groups is studied. The best upper bound for this problem is $\mathsf{coRP}$, which is shown by a reduction to polynomial identity testing. Conversely,
C Àlvarez +16 more
core +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective Cognitive decline is a disabling and variable feature of Parkinson disease (PD). While cholinergic system degeneration is linked to cognitive impairments in PD, most prior research reported cross‐sectional associations. We aimed to fill this gap by investigating whether baseline regional cerebral vesicular acetylcholine transporter ...
Taylor Brown +6 more
wiley +1 more source
Defence Technology, 2019 Modelling and simulation of projectile flight is at the core of ballistic computer software and is essential to the study of performance of rifles and projectiles in various engagement conditions.
C.A. Rabbath, D. Corriveau
doaj +1 more source
Efficient Evaluation of Large Polynomials [PDF]
, 2010 Minimizing the evaluation cost of a polynomial expression is a fundamental problem in computer science. We propose tools that, for a polynomial P given as the sum of its terms, compute a representation that permits a more efficient evaluation. Our algorithm runs in d(nt)O(1) bit operations plus dtO(1) operations in the base field where d, n and t are ...
Leiserson, Charles E. +3 more
openaire +3 more sources
Unconditionally secure Oblivious Polynomial Evaluation protocol
Proceedings of the 2013 International Conference on Advanced ICT, 2013 Oblivious polynomial evaluation is a protocol involving two parties: a sender whose input is a polynomial and a receiver whose input is a value a . Most of existing Oblivious Polynomial Evaluation protocols were built based on some cryptographically ...
Liu Luyao +4 more
semanticscholar +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
KDM Security IBE Based on LWE beyond Affine Functions
Applied Sciences, 2023 Key-dependent message (KDM) security identity-based encryption (IBE) schemes aim to solve the security risks caused by the dependency between plaintext and secret keys in traditional IBE schemes.
Yuchen Lian, Ruwei Huang
doaj +1 more source
On the Complexity of the Interlace Polynomial [PDF]
, 2007 We consider the two-variable interlace polynomial introduced by Arratia, Bollobas and Sorkin (2004). We develop graph transformations which allow us to derive point-to-point reductions for the interlace polynomial.
Christian Hoffmann, Markus Bl, Äser
core +4 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
A determinant formula for the Jones polynomial of pretzel knots
, 2012 This paper presents an algorithm to construct a weighted adjacency matrix of a plane bipartite graph obtained from a pretzel knot diagram. The determinant of this matrix after evaluation is shown to be the Jones polynomial of the pretzel knot by way of ...
Burde G., Kauffman L. H., MOSHE COHEN
core +1 more source