Results 41 to 50 of about 2,127,275 (322)

A two-variable approach to solve the polynomial Lyapunov equation

, 2001
A two-variable polynomial approach to solve the one-variable polynomial Lyapunov equation is proposed. Lifting the problem from the one-variable to the two-variable context allows to use Faddeev-type recursions in order to solve the polynomial Lyapunov ...
Peeters, Ralf, Rapisarda, Paolo
core   +2 more sources

Area-Efficient Polynomial Multiplication Hardware Implementation for Lattice-based Cryptography [PDF]

Jisuanji gongcheng
Lattice-based post-quantum cryptography algorithms demonstrate significant potential in public-key cryptography. A key performance bottleneck in hardware implementation is the computational complexity of polynomial multiplication. To address the problems
XIE Jiaxing, PU Jinwei, FANG Weitian, ZHENG Xin, XIONG Xiaoming
doaj   +1 more source

An Efficient Bi-Parametric With-Memory Iterative Method for Solving Nonlinear Equations

AppliedMath, 2023
New three-step with-memory iterative methods for solving nonlinear equations are presented. We have enhanced the convergence order of an existing eighth-order memory-less iterative method by transforming it into a with-memory method.
Ekta Sharma, Shubham Kumar Mittal, J. P. Jaiswal, Sunil Panday   +3 more
doaj   +1 more source

Fast and Generalized Polynomial Time Memory Consistency Verification [PDF]

, 2006
The problem of verifying multi-threaded execution against the memory consistency model of a processor is known to be an NP hard problem. However polynomial time algorithms exist that detect almost all failures in such execution. These are often used in practice for microprocessor verification.
Amitabha Roy 0002, Stephan Zeisset, Charles J. Fleckenstein, John C. Huang   +3 more
openaire   +3 more sources

Pattern matching of compressed terms and contexts and polynomial rewriting [PDF]

, 2011
A generalization of the compressed string pattern match that applies to terms with variables is investigated: Given terms s and t compressed by singleton tree grammars, the task is to find an instance of s that occurs as a subterm in t. We show that this
Schmidt-Schauß, Manfred, Manfred Schmidt-Schauß   +1 more
core  

Long‐Term Neurologic Exam Findings in People Diagnosed and Treated During Acute HIV Infection

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Evaluate clinical and laboratory correlates of abnormal neurologic exam findings after acute HIV infection (AHI). Methods Participants from the RV254/SEARCH 010 cohort in Bangkok underwent standardized neurologic examinations at Weeks 0 (AHI), 12, 96, and 288 following antiretroviral therapy (ART).
Kathryn B. Holroyd, Tyler Hamby, Carlo Sacdalan, Somchai Sriplienchan, Pathariya Promensa, Luxenaree Poonpitak, Netsiri Dumrongpisutikul, Eugène Kroon, Sandhya Vasan, Robert Paul, Ferron O'Campo, Lydie Trautmann, Phillip Chan, Serena Spudich, on behalf of the RV254/SEARCH 010 Study Team, Julie Ake, Sandhya Vasan, Lydie Trautmann, Merlin Robb, Trevor Crowell, Donn Colby, Diane Bolton, Shelly Krebs, Leigh Ann Eller, Morgane Rolland, Rasmi Thomas, Dominic Paquin Proulx, Suteeraporn Pinyakorn, Tyler Hamby, Mark de Souza, Ellen Turk, Amber Moodley, Gerald Quarles, Jintanat Ananworanich, Denise Hsu, Victoria Polonis, Nelson Michael, Sheila Peel, COL Eric Garges, Alexandra Schuetz, Siriwat Akapirat, Bessara Nantapinit, Pornsuk Visudhiphan, Saowanit Getchalarat, Nampueng Churikanont, Sangsulee Thamakaison, Somchai Sriplienchan, Carlo Sacdalan, Pathariya Promsena, Luxe‐naree Poonpitak, Eugene Kroon, Nitiya Chomchey, Jintana Intasan, Varaporn Pothipala, Ferron Ocampo, Nittaya Phanuphak, Nipat Teeratakulpisan, Yuwaree Pichitchok, Anchalee Avihingsanon, Opass Putcharoen, Kiat Ruxrungtham, Thanyawee Puthanakit, Sopark Manasnayakorn, Phandee Watanaboonyongcharoen, Rungsun Rerknimitr, Irini Sereti, Daniel Douek, Eli Bortiz, Frank Maldarelli, Mary Kearney, Serena Spudich, Phillip Chan, Lishomwa Ndhlovu, Guinevere Li, Michael Corley, Victor Valcour, Peter Hunt, Jacob Estes, Afam Okoye, Jeff Lifson, Claire Deleage, Nicolas Chomont, Andres Finzi, Lyle McKinnon, Henrik Zetterberg, Robert Siliciano, Robert Paul, Julie Mannarino, Jonathan Li, John Mellors, Josh Cytkor, Dan Barouch, Michael Seaman, Boris Juelg, Alex Shalek, Timothy Schacker, Ashley Haase, Mario Stevenson, Wenjun Li, Arthur Kim, Sharon Lewin, Adam Carrico, Susana Valente, Fred Hutchinson, Josh Schiffer, Guido Ferrari, Beau Ances, Alberto Bosque, Katharine Bar, Killian Pohl, David Ho, Yaoxing Huang, Michael Busch, Mohamed Abdel‐Mohsen, Johanna Gostner, Brian Agan, Fatah Kashanchi, Greg Laird, Kathryn Holroyd   +118 more
wiley   +1 more source

Efficient Homomorphic Encryption Accelerator With Integrated PRNG Using Low-Cost FPGA

IEEE Access, 2022
With recent development in internet speed and reliability, cloud computing has become a more reliable solution for the user. In many cases where data privacy is critical, fully homomorphic encryption (FHE) can be a security solution for securing cloud ...
Infall Syafalni, Gilbert Jonatan, Nana Sutisna, Rahmat Mulyawan, Trio Adiono   +4 more
doaj   +1 more source

Limited‐memory polynomial methods for large‐scale matrix functions

GAMM-Mitteilungen, 2020
AbstractMatrix functions are a central topic of linear algebra, and problems requiring their numerical approximation appear increasingly often in scientific computing. We review various limited‐memory methods for the approximation of the action of a large‐scale matrix function on a vector.
Stefan Güttel, Daniel Kressner, Kathryn Lund   +2 more
openaire   +4 more sources

Fourier restriction to polynomial curves I: a geometric inequality [PDF]

, 2010
We prove a Fourier restriction result for general polynomial curves in Rd. Measuring the Fourier restriction with respect to the affine arclength measure of the curve, we obtain a universal estimate for the class of all polynomial curves of bounded ...
Wright, James, Wright, J., null Spyridon Dendrinos, null James Wright, Dendrinos, Spyridon, Dendrinos, S.   +5 more
core   +1 more source

dynoGP: Deep Gaussian Processes for Dynamic System Identification

International Journal of Adaptive Control and Signal Processing, EarlyView.
This work introduces a novel class of deep models for system identification, dynamical deep Gaussian processes, which combine the strengths of data‐driven methods, such as those based on neural network architectures, with the ability to output a probability distribution for uncertainty representation.
Alessio Benavoli, Marco Forgione, Dario Piga, Marco Zaffalon   +3 more
wiley   +1 more source