Results 101 to 110 of about 3,330 (300)
Spectral analysis of discrete signals generated by multiplicative and additive iterative procedures
, 1999 We consider specific features of the discrete Fourier transform for signals constructed through multiplicative and additive iterative procedures. It is shown that - in spite of the rather different structure of multiplicative and additive signals - the ...
Barbé, A.M. +5 more
core +1 more source
PlantGFM: A Genomic Foundation Model for Discovery and Creation of Plant Genes
Advanced Science, EarlyView.A plant genomic foundation model pre‐trained on 12 species enables both accurate gene prediction and de novo gene design. Through AI‐human knowledge screening, seven designed sequences showed transcriptional activity in plants, with two expressing stable proteins—demonstrating the first DNA‐RNA‐protein expression of LLM‐generated genes in plants and ...
Changhao Li +10 more
wiley +1 more source
Hierarchical Twin Networks Enable Exceptional Strength and Fracture Toughness in Titanium
Advanced Science, EarlyView.A commercial‐purity titanium with hierarchical ultrafine twin structures delivers an exceptional combination of fracture toughness (KJIc) of 187 MPa·m1/2 and specific yield strength of 140 MPa·cm3·g−1, in which pre‐engineered high‐density twin boundaries stimulate massive and
Xiao‐Wei Zou +3 more
wiley +1 more source
Faster Polynomial Multiplication via Discrete Fourier Transforms [PDF]
, 2011 26 pages, submitted to a ...
openaire +3 more sources
Fast Fourier Transform using compiler auto-vectorization
, 2019 The purpose of this thesis is to develop a fast Fourier transformation algorithm written in C with the use of GCC (GNU Compiler Collection) auto-vectorization in the multiplicative group of integers modulo n, where n is a word sized odd integer.
Göc, Dundar
core
Fast Fourier transform via automorphism groups of rational function fields
, 2023 The Fast Fourier Transform (FFT) over a finite field $\mathbb{F}_q$ computes evaluations of a given polynomial of degree less than $n$ at a specifically chosen set of $n$ distinct evaluation points in $\mathbb{F}_q$.
Li, Songsong, Xing, Chaoping
core
Advanced Science, EarlyView.A fully compensated synthetic antiferromagnet (SAF) multilayer exhibits a uniform state at zero field, without skyrmions. We use a SAF bias system to provide RKKY‐mediated exchange bias to the SAF multilayer, promoting zero‐field skyrmion stabilization and polarity control.
Emily Darwin +5 more
wiley +1 more source
DISCRETE FOURIER TRANSFORM USING SUMMATION BY PARTS.
, 1987 An algorithm for evaluating the discrete Fourier transform (DFT) at particular output frequency is derived using a technique called summation by parts (SBP).
Parks, T. W., Boudreaux-Bartels, G. F.
core
Multiplicative time and space integrating acousto-optic architectures for real time spectrum processing [PDF]
, 1987 Multiplicative acousto-optic architectures using time and space dimensions for spectrally resolving long 1-D signals and images are described. The Discrete Fourier Transform algorithm is implemented optically to provide fine frequency resolving power ...
Psaltis, Demetri +3 more
core +1 more source
Advanced Science, EarlyView.Radiotherapy triggers LTβR N‐glycosylation, enhancing its overall protein stability and nuclear retention. This accumulation drives TRIM28‐mediated PCBP2 SUMOylation, suppressing pyroptosis and conferring gastric cancer radioresistance. Therapeutically, a targeted nanoplatform (cRGD‐Lipo@EMD) effectively disrupts this regulatory axis, offering a highly
Weijie Zang +8 more
wiley +1 more source