Results 21 to 30 of about 70,439 (268)

On the verification of polynomial system solvers [PDF]

Frontiers of Computer Science in China, 2008
We discuss the verification of mathematical software solving polynomial systems symbolically by way of triangular decomposition. Standard verification techniques are highly resource consuming and apply only to polynomial systems which are easy to solve. We exhibit a new approach which manipulates constructible sets represented by regular systems.
Changbo Chen, Marc Moreno Maza, Wei Pan 0001, Yuzhen Xie   +3 more
openaire   +2 more sources

Breaking Neural Networks Through Algebraic Lens: A Preliminary Analysis of Mathematical Vulnerabilities in AI Architectures

IEEE Access
Modern deep neural networks, particularly transformer architectures, have achieved unprecedented performance across various domains through sophisticated mathematical structures that remain incompletely understood from a security perspective.
Sandeep Gupta, Budesh Kanwer, Pankaj Dadheech, Sumit Srivastava   +3 more
doaj   +1 more source

Solving Polynomial Systems with phcpy [PDF]

Proceedings of the Python in Science Conference, 2019
The solutions of a system of polynomials in several variables are often needed, e.g.: in the design of mechanical systems, and in phase-space analyses of nonlinear biological dynamics. Reliable, accurate, and comprehensive numerical solutions are available through PHCpack, a FOSS package for solving polynomial systems with homotopy continuation.
Jasmine Otto, Angus G. Forbes, Jan Verschelde   +2 more
openaire   +3 more sources

Residue polynomial systems

Theoretical Computer Science, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

Identifiability and excitation of polynomial systems [PDF]

52nd IEEE Conference on Decision and Control, 2013
This paper establishes identifiability and informativity conditions for a class of deterministic linearly parametrized polynomial systems. The class considered is polynomial in the states and in the inputs. The standard definitions of identifiability and informativity for linear systems are expanded to account for the situation where the identification
Michel Gevers, Alexandre S. Bazanella, Daniel F. Coutinho, Soura Dasgupta   +3 more
openaire   +2 more sources

A Class of Quadratic Polynomial Chaotic Maps and Their Fixed Points Analysis

Entropy, 2019
When chaotic systems are used in different practical applications, such as chaotic secure communication and chaotic pseudorandom sequence generators, a large number of chaotic systems are strongly required.
Chuanfu Wang, Qun Ding
doaj   +1 more source

Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry

FEBS Letters, EarlyView.
EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri, Ayaka Nagasato‐Ichikawa, Keita Iida, Shuhei Kimura, Akira Imamoto, Mariko Okada   +5 more
wiley   +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, Freddy Chafota, Miguel E. Rentería, Randi J. Hagerman, Ellery Santos, Anna Atkinson, Nicholas G. Martin, Elsdon Storey, Danuta Z. Loesch   +8 more
wiley   +1 more source

Solving Polynomial Systems in the Cloud with Polynomial Homotopy Continuation [PDF]

, 2015
Polynomial systems occur in many fields of science and engineering. Polynomial homotopy continuation methods apply symbolic-numeric algorithms to solve polynomial systems. We describe the design and implementation of our web interface and reflect on the application of polynomial homotopy continuation methods to solve polynomial systems in the cloud ...
Nathan Bliss, Jeff Sommars, Jan Verschelde, Xiangcheng Yu   +3 more
openaire   +4 more sources

T1 Over Squared Proton Density Ratio to Characterize Multiple Sclerosis Lesions

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Differentiating remyelinated from demyelinated lesions in MS remains challenging without histological confirmation. This study introduces the T1‐to‐PD2 ratio (TPR) imaging approach and evaluates its ability to characterize MS lesions alongside other quantitative MRI (qMRI) metrics. Methods Thirty individuals with MS (mean age: 47.5 ± 
Sarah J. Wright, Scotty G. McKay, Jean Ramos Bou, Fen Bao, Vivian B. Truong, Chenyang Li, Li Jiang, Anza B. Memon, E. Mark Haacke, Yulin Ge, Yongsheng Chen   +10 more
wiley   +1 more source