Results 101 to 110 of about 2,555,427 (286)

An Efficient Interval Newton Algorithm for Univariate Polynomial Equation

open access: yes工程科学与技术, 2011
:An efficient interval Newton algorithm for univariate polynomial equation was proposed.This algorithm reduced greatly the number of iterations and computations based on Hansen’s method for univariate polynomial equation. The algorithm was implemented as
张彩环, 刘栋, 冯勇
doaj  

HYBRIDIZING HENSEL’S LEMMA, FUNDAMENTAL THEOREM OF ARITHMETIC, AND CHINESE REMAINDER THEOREM FOR SOLVING POLYNOMIAL CONGRUENCES

open access: yesBarekeng
Polynomial congruence can be solved by applying Hensel’s Lemma. However, Hensel’s Lemma itself does not apply to solving generalized polynomial congruences. The purpose of this research is to determine the recursive formula for the solution of polynomial
Eka Oktaviansyah   +2 more
doaj   +1 more source

Blind recognition of primitive BCH code based on average cosine conformity

open access: yesTongxin xuebao, 2020
In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code ...
Zhaojun WU   +3 more
doaj   +2 more sources

Atomic Defects in Layered Transition Metal Dichalcogenides for Sustainable Energy Storage and the Intelligent Trends in Data Analytics

open access: yesAdvanced Science, EarlyView.
This review comprehensively summarizes the atomic defects in TMDs for their applications in sustainable energy storage devices, along with the latest progress in ML methodologies for high‐throughput TEM data analysis, offering insights on how ML‐empowered microscopy facilitates bridging structure–property correlation and inspires knowledge for precise ...
Zheng Luo   +6 more
wiley   +1 more source

Vector-exponential time-series modeling for polynomial J-spectral factorization

open access: yes, 2005
An iterative algorithm to perform the J-spectral factorization of a para-Hermitian matrix is presented. The algorithm proceeds by computing a special kernel representation of an interpolant for a sequence of points and associated directions determined ...
Pendharkar, Ishan   +2 more
core   +1 more source

Longitudinal Morphomolecular Monitoring of Head and Neck Carcinogenesis

open access: yesAdvanced Science, EarlyView.
A miniaturized endoscopic probe that integrates Raman spectroscopy and optical coherence tomography, enabling simultaneous molecular and structural imaging of living tissue, was developed. Applied longitudinally in a mouse model of head and neck cancer, the system tracks disease progression from precancerous lesions to invasive cancer.
Jianrong Qiu   +7 more
wiley   +1 more source

A Generative Neuro‐Symbolic AI for Protein Sequence Design

open access: yesAdvanced Science, EarlyView.
We introduce EffieDes, a neuro‐symbolic framework coupling deep learning‐based fitness landscape parameterization with exact automated reasoning. Unlike greedy sampling, EffieDes identifies sequences that globally optimize fitness while satisfying intricate design constraints.
Marianne Defresne   +12 more
wiley   +1 more source

A polynomial algorithm for best-subset selection problem. [PDF]

open access: yesProc Natl Acad Sci U S A, 2020
Zhu J, Wen C, Zhu J, Zhang H, Wang X.
europepmc   +1 more source

Soft, Multi‐Wavelength Photoplethysmography Enables Reliable Neonatal Blood Pressure Monitoring Via Error Stratification

open access: yesAdvanced Science, EarlyView.
A soft hybrid multi‐wavelength PPG wearable acquires neonatal signals. Synchronized PPG and invasive ABP data are segmented into fixed windows. A 1D‐EfficientNet model predicts segment‐level SBP and DBP. Model performance is examined with retrospective subgroup analysis across acquisition conditions.
Wenqi Shi   +12 more
wiley   +1 more source

A signature-based algorithm for computing Gröbner-Shirshov bases in skew solvable polynomial rings

open access: yesOpen Mathematics, 2015
Signature-based algorithms are efficient algorithms for computing Gröbner-Shirshov bases in commutative polynomial rings, and some noncommutative rings. In this paper, we first define skew solvable polynomial rings, which are generalizations of solvable ...
Zhao Xiangui, Zhang Yang
doaj   +1 more source

Home - About - Disclaimer - Privacy