Results 91 to 100 of about 165,252 (290)

On multiple Appell polynomials [PDF]

Proceedings of the American Mathematical Society, 2010
So called Appell polynomials [\textit{P. Appell}, ``Sur une classe de polynômes'', Ann. Sci. Éc. Norm. Supér. (2), 9, 119--144 (1880; JFM 12.0342.02)] have been studied extensively and apart from the defining property: \[ \{P_n(x)\}_0^{\infty}\text{ is a sequence of Appell polynomials }\Leftrightarrow P_n'(x)=nP_{n-1}(x),\;n\geq 1.
openaire   +2 more sources

CellPolaris: Transfer Learning for Gene Regulatory Network Construction to Guide Cell State Transitions

Advanced Science, EarlyView.
CellPolaris decodes how transcription factors guide cell fate by building gene regulatory networks from transcriptomic data using transfer learning. It generates tissue‐ and cell‐type‐specific networks, identifies master regulators in cell state transitions, and simulates TF perturbations in developmental processes.
Guihai Feng, Xin Qin, Jiahao Zhang, Wuliang Huang, Yiyang Zhang, Wentao Cui, Yao Chen, Shirui Li, Wenhao Liu, Yao Tian, Yana Liu, Jingxi Dong, Ping Xu, Zhenpeng Man, Guole Liu, Zhongming Liang, Xinlong Jiang, Xiaodong Yang, Pengfei Wang, Ge Yang, Hongmei Wang, Xuezhi Wang, Ming‐Han Tong, Yuanchun Zhou, Shihua Zhang, Yiqiang Chen, Yong Wang, Xin Li   +27 more
wiley   +1 more source

The circulant hash revisited

Journal of Mathematical Cryptology, 2020
At ProvSec 2013, Minematsu presented the circulant hash, an almost-xor universal hash using only the xor and rotation operations. The circulant hash is a variant of Carter and Wegman’s H3 hash as well as Krawczyk’s Toeplitz hash, both of which are hashes
Araujo Filipe, Neves Samuel
doaj   +1 more source

Practical fast polynomial multiplication [PDF]

Proceedings of the third ACM symposium on Symbolic and algebraic computation - SYMSAC '76, 1976
The “fast” polynomial multiplication algorithms for dense univariate polynomials are those which are asymptotically faster than the classical O(N2) method. These “fast” algorithms suffer from a common defect that the size of the problem at which they start to be better than the classical method is quite large; so large, in fact that it is impractical ...
openaire   +1 more source

Generalized Mechanism Model for Ecosystem Hysteresis

Advanced Science, EarlyView.
A simplified model examines ecosystem transitions into alternative states after disturbances by leveraging positive and negative feedbacks. It identifies critical tipping points and quantifies hysteresis. Tests conducted on lakes, grasslands, and pitcher‐plant leaves align closely with empirical data and enable the prediction of recovery trajectories ...
Yanbin Hao, Xin Wang, Jie Liu, Mingzi Wu, Jianqing Du, Kai Xue, Xiaoning Song, Xiaoyong Cui, Tong Zhao, Yanfen Wang   +9 more
wiley   +1 more source

Algebraic Signal Processing Theory: Cooley-Tukey Type Algorithms for Polynomial Transforms Based on Induction [PDF]

, 2010
A polynomial transform is the multiplication of an input vector $x\in\C^n$ by a matrix $\PT_{b,\alpha}\in\C^{n\times n},$ whose $(k,\ell)$-th element is defined as $p_\ell(\alpha_k)$ for polynomials $p_\ell(x)\in\C[x]$ from a list $b=\{p_0(x),\dots,p_{n ...
Kovacevic, Jelena, Pueschel, Markus, Sandryhaila, Aliaksei   +2 more
core  

Quantifying Additive Manufacturing Vapor Plumes Using Laser‐Induced Breakdown Spectroscopy, Synchrotron X‐Ray Radiography and Simulations

Advanced Science, EarlyView.
This study presents a novel in situ laser‐induced breakdown spectroscopy system for monitoring metal vapors produced by the intense laser‐metal interactions in laser powder bed fusion additive manufacturing and laser welding. The insights from this new technique reveal changes in alloy compositions and provide the first in situ validation of multi ...
Anna C. M. Getley, Samy Hocine, Junji Shinjo, Chinnapat Panwisawas, Marta Majkut, Alexander Rack, Peter D. Lee, Michael Towrie, Chu Lun Alex Leung   +8 more
wiley   +1 more source

Generalized companion matrix for approximate GCD

, 2011
We study a variant of the univariate approximate GCD problem, where the coefficients of one polynomial f(x)are known exactly, whereas the coefficients of the second polynomial g(x)may be perturbed.
Boito, Paola, Ruatta, Olivier
core   +2 more sources

AI‐Optimized Vanadium Oxide Multilayers for More Than 20‐fold Enhancement in Bolometric Performance

Advanced Science, EarlyView.
Machine‐learning‐optimized WxV1‐xOy multilayer thin films with graded doping achieve a high TCR (7.3 % K−1), reduced hysteresis, and low noise under CMOS‐compatible growth conditions. This approach overcomes the long‐standing trade‐off in microbolometers between linear response and performance, offering a universal bolometric parameter greatly enhanced
Jin‐Hyun Choi, Hyoung‐Taek Lee, Jeonghoon Kim, Miju Park, Seungjoon Sun, Gye‐Hyeon Kim, Myung‐Ho Kwon, Hyeong‐Ryeol Park, Changhee Sohn   +8 more
wiley   +1 more source

Efficient and Low-Cost Modular Polynomial Multiplier for WSN Security

Journal of Sensor and Actuator Networks
Wireless Sensor Network (WSN) technology has constrained computing resources that require efficient and low-cost cryptographic hardware to provide security services, particularly when dealing with large modular polynomial multiplication in cryptography ...
Fariha Haroon, Hua Li
doaj   +1 more source