Results 81 to 90 of about 1,148,447 (292)
Analysis of Digital Expansions of Minimal Weight [PDF]
Extending an idea of Suppakitpaisarn, Edahiro and Imai, a dynamic programming approach for computing digital expansions of minimal weight is transformed into an asymptotic analysis of minimal weight expansions.
Florian Heigl, Clemens Heuberger
doaj +1 more source
We develop a data‐driven method to derive the mathematical expressions of the Flory–Huggins interaction parameter χ for the swelling behavior of temperature–responsive hydrogels. Starting from initial assumptions of χ, our workflow combines Bayesian optimization, Flory–Rehner theory, and symbolic regression to generate candidate χ expressions.
Yawen Wang +2 more
wiley +1 more source
A well-known problem in the theory of polynomials over finite fields is the characterization of minimal value set polynomials (MVSPs) over the finite field $\mathbb{F}_q$, where $q = p^n$. These are the nonconstant polynomials $F \in \mathbb{F}_q[x]$ whose value set $V_F = \{F(a) : a \in \mathbb{F}_q\}$ has the smallest possible size, namely $\lceil ...
Borges, Herivelto, Reis, Lucas
openaire +2 more sources
Finding exact minimal polynomial by approximations
We present a new algorithm for reconstructing an exact algebraic number from its approximate value using an improved parameterized integer relation construction method. Our result is consistent with the existence of error controlling on obtaining an exact rational number from its approximation.
Xiaolin Qin +3 more
openaire +4 more sources
A Practical Noise2Noise Denoising Pipeline for High‐Throughput Raman Spectroscopy
A lightweight and reproducible denoising pipeline for high‐throughput Raman spectroscopy is introduced, based on a 1D convolutional autoencoder trained with a Noise2Noise strategy. Using only repeated short‐exposure acquisitions, the method suppresses stochastic noise without reference spectra, enabling reliable spectral reconstruction while preserving
David Martin‐Calle +5 more
wiley +1 more source
Lebesgue functions and Lebesgue constants in polynomial interpolation
The Lebesgue constant is a valuable numerical instrument for linear interpolation because it provides a measure of how close the interpolant of a function is to the best polynomial approximant of the function.
Bayram Ali Ibrahimoglu
doaj +1 more source
Postbuild annealing systematically modifies the phase fractions and morphology of EB‐PBF processed Mo–9Si–8B. Quantitative microstructure–property correlations reveal how controlled phase evolution enhances high‐temperature compressive strength and creep resistance.
Christopher Schmidt +5 more
wiley +1 more source
Polynomial expressions of p-ary auction functions
One of the common ways to design secure multi-party computation is twofold: to realize secure fundamental operations and to decompose a target function to be securely computed into them.
Kaji Shizuo +3 more
doaj +1 more source
Sustainability assessment requires methodologies that appropriately distinguish between additive and non‐additive material properties. A toxicity‐weighted scoring system is developed and applied that accounts for the disproportionate influence of highly toxic constituents through nonlinear weighting functions, providing more realistic estimates than ...
Seth Mehalic +2 more
wiley +1 more source
We consider vector mappings over the set of 0 and 1 given by the set of Boolean functions. Boolean functions included in the map are given in ANF. Having fixed the rule according to which the binary vectors are associated with the elements of a finite ...
Sergey A. Belov
doaj +1 more source

