Results 51 to 60 of about 3,709,601 (369)

Fast constant-time gcd computation and modular inversion

open access: yesIACR Cryptology ePrint Archive, 2019
This paper introduces streamlined constant-time variants of Euclid’s algorithm, both for polynomial inputs and for integer inputs. As concrete applications, this paper saves time in (1) modular inversion for Curve25519, which was previously believed to ...
D. Bernstein, Bo-Yin Yang
semanticscholar   +1 more source

The best constant of Sobolev inequality corresponding to anti-periodic boundary value problem

open access: yesElectronic Journal of Qualitative Theory of Differential Equations, 2014
In this paper we establish the best constant of $\mathcal{L}^{p}$ Sobolev inequality for a function with anti-periodic boundary conditions. The best constant is expressed by $\mathcal{L}^q$ norm of $(M-1)$-th order Euler polynomial.
Jozef Kiseľák
doaj   +1 more source

Piecewise polynomial representations of genomic tracks. [PDF]

open access: yesPLoS ONE, 2012
Genomic data from micro-array and sequencing projects consist of associations of measured values to chromosomal coordinates. These associations can be thought of as functions in one dimension and can thus be stored, analyzed, and interpreted as piecewise-
Maxime Tarabichi   +2 more
doaj   +1 more source

A New Method to Obtain PH-Helical Curves in E^(n+1)

open access: yesJournal of New Theory, 2021
Helical curves are constructed by the property that their unit tangents make a constant angle with a chosen constant direction. There are relations between polynomial planar curves, helices and Pythagorean-hodograph or shortly PH-curves.
Çetin Camcı   +3 more
doaj   +1 more source

A characterization of the four Chebyshev orthogonal families

open access: yesInternational Journal of Mathematics and Mathematical Sciences, 2005
We obtain a property which characterizes the Chebyshev orthogonal polynomials of first, second, third, and fourth kind. Indeed, we prove that the four Chebyshev sequences are the unique classical orthogonal polynomial families such that their linear ...
E. Berriochoa   +2 more
doaj   +1 more source

Thrombolytic proteins profiling: High‐throughput activity, selectivity, and resistance assays

open access: yesFEBS Open Bio, EarlyView.
We present optimized biochemical protocols for evaluating thrombolytic proteins, enabling rapid and robust screening of enzymatic activity, inhibition resistance, and fibrin affinity, stimulation, and selectivity. The outcome translates to key clinical indicators such as biological half‐life and bleeding risk. These assays streamline the development of
Martin Toul   +3 more
wiley   +1 more source

Analytical solution of fractional differential equations by Akbari–Ganji’s method

open access: yesPartial Differential Equations in Applied Mathematics, 2022
According to the various and extensive applications of fractional calculus in a range of fields, such as engineering, biology, image processing, material science and economics, researchers have discovered new, simpler-to-use and more accurate approaches ...
M.A. Attar   +3 more
doaj   +1 more source

Preferences for post‐traumatic osteoarthritis prevention strategies in individuals with anterior cruciate ligament injury

open access: yesArthritis Care &Research, Accepted Article.
Objectives There is growing interest in evaluating new strategies to delay or prevent post‐traumatic osteoarthritis (PTOA) in individuals who have sustained anterior cruciate ligament (ACL) injury. This study sought to determine characteristics of potential treatments that are acceptable to patients with ACL injury.
Kevin Kennedy   +9 more
wiley   +1 more source

Grothendieck inequalities characterize converses to the polynomial method [PDF]

open access: yesQuantum
A surprising 'converse to the polynomial method' of Aaronson et al. (CCC'16) shows that any bounded quadratic polynomial can be computed exactly in expectation by a 1-query algorithm up to a universal multiplicative factor related to the famous ...
Jop Briët   +2 more
doaj   +1 more source

Unconditional constants and polynomial inequalities

open access: yesJournal of Approximation Theory, 2009
If \(P\) is a polynomial with real coefficients, \(|P|\) denotes the polynomial obtained from \(P\) replacing its coefficients by their absolute values. Inequalities between the norm of \(|P|\) and the norm of \(P\) on a convex subset are studied for some specific spaces of polynomials.
Grecu, Bogdan, Munoz, G., Seoane, J.
openaire   +4 more sources

Home - About - Disclaimer - Privacy