Results 151 to 160 of about 98,739 (338)
ABSTRACT Hybrid modeling combines first‐principles equations with a data‐driven subcomponent. Training for the data‐driven part is sensitive to measurement noise when training targets are constructed using pointwise time derivatives. Beyond differentiation errors, hybrid models involve solving an inverse problem to estimate the data‐driven term, which ...
Hangjun Cho +4 more
wiley +1 more source
A circuit area optimization of MK-3 S-box
In MILCOM 2015, Kelly et al. proposed the authentication encryption algorithm MK-3, which applied the 16-bit S-box. This paper aims to implement the 16-bit S-box with less circuit area. First, we classified the irreducible polynomials over $$\mathbb {F}_{
Yanjun Li +4 more
doaj +1 more source
CFD modeling and sensitivity‐guided design of silicon filament CVD reactors
Abstract Filament‐based chemical vapor deposition (CVD) for silicon (Si) coatings is often treated as an adaptation of planar deposition. But this overlooks fundamental shifts in transport phenomena and reaction kinetics. In filament CVD, the filament acts as a substrate, heat source, and flow disruptor simultaneously. In this work, we ask: What really
G. P. Gakis +8 more
wiley +1 more source
Combinatorial and algebraic aspects of polynomials over finite fields [PDF]
grantor: University of TorontoThis thesis investigates several algebraic algorithms that deal with univariate polynomials over finite fields. Our main focus is the factorization problem, but we also consider polynomial irreducibility tests, and
Rodriguez, Daniel Nelson Panario
core +3 more sources
Feasibility of primality in bounded arithmetic
We prove the correctness of the AKS algorithm [1] within the bounded arithmetic theory $T^{\text {count}}_2$ or, equivalently, the first-order consequences of the theory $\text {VTC}^0$ expanded by the smash function, which we denote by
Raheleh Jalali, Ondřej Ježil
doaj +1 more source
Generators and irreducible polynomials over finite fields [PDF]
Weil’s character sum estimate is used to study the problem of constructing generators for the multiplicative group of a finite field. An application to the distribution of irreducible polynomials is given, which confirms an asymptotic version of a conjecture of Hansen-Mullen.
openaire +2 more sources
Two classes of permutation polynomials over finite fields [PDF]
Two classes of permutation polynomials over finite fields are presented. The first class is a further study of permutation polynomials of the form (xpk−x+δ)s+L(x) and the second class is a supplement of the recent work of Hou on permutation polynomials ...
Zha, Zhengbang, Hu, Lei
core +1 more source
Data‐Guided Photocatalysis: Supervised Machine Learning in Water Splitting and CO2 Conversion
This review highlights recent advances in supervised machine learning (ML) for photocatalysis, emphasizing methods to optimize photocatalyst properties and design materials for solar‐driven water splitting and CO2 reduction. Key applications, challenges, and future directions are discussed, offering a practical framework for integrating ML into the ...
Paul Rossener Regonia +1 more
wiley +1 more source
Relative rank and regularization
We introduce a new concept of rank – relative rank associated to a filtered collection of polynomials. When the filtration is trivial, our relative rank coincides with Schmidt rank (also called strength).
Amichai Lampert, Tamar Ziegler
doaj +1 more source
Weil sum for birthday attack in multivariate quadratic cryptosystem
We propose a new cryptanalytic application of a number theoretic tool Weil sum to birthday attack against multivariate quadratic trapdoor function.
Harayama Tomohiro, Friesen Donald K.
doaj +1 more source

