Results 91 to 100 of about 59,541 (246)
ABSTRACT Recent advances in the numerical solution of fractional partial differential equations have yielded promising results. In particular, the Shifted Grünwald–Letnikov (SGL) approach allows for a generalization of the traditional finite difference method to the context of fractional differential equations.
Pedro Victor Serra Mascarenhas +1 more
wiley +1 more source
On Lehmer’s question for integer-valued polynomials
We solve a Lehmer-type question about the Mahler measure of integer-valued polynomials.
openaire +4 more sources
A Novel Two‐Stage Flexible Flow Shop Batch Scheduling Model for Grinding Workshops
ABSTRACT The growing need for data storage in data centers has increased the demand for mechanical hard disks due to their low cost and high reliability. Aluminum substrates are the most popular base plates for mechanical hard disks because of their high hardness and low cost.
Jun Xu +4 more
wiley +1 more source
Sets that determine integer-valued polynomials
The main result of this paper describes necessary and sufficients conditions for a subset S of \({\mathbb{Z}}\) to determine the set of the integer valued polynomials on \({\mathbb{Z}}\). This is an answer to a problem considered by the author and \textit{W. W. Smith} [J. Algebra 81, 150-164 (1983; Zbl 0515.13016)].
openaire +1 more source
Conditional Generative Modeling for Enhanced Credit Risk Management in Supply Chain Finance
ABSTRACT The rapid expansion of cross‐border e‐commerce (CBEC) has created significant opportunities for small‐ and medium‐sized sellers, yet financing remains a critical challenge due to their limited credit histories. Third‐party logistics (3PL)‐led supply chain finance (SCF) has emerged as a promising solution, leveraging in‐transit inventory as ...
Qingkai Zhang, L. Jeff Hong, Houmin Yan
wiley +1 more source
Finding Maximum Weight 2‐Packing Sets on Arbitrary Graphs
ABSTRACT A 2‐packing set for an undirected, weighted graph G=(V,E,w)$$ G=\left(V,\kern0.3em E,\kern0.3em w\right) $$ is a subset 𝒮⊆V such that any two vertices v1,v2∈𝒮 are not adjacent and have no common neighbors. The Maximum Weight 2‐Packing Set problem that asks for a 2‐packing set of maximum weight is NP$$ \mathbf{NP} $$‐hard. Next to 13 novel data
Jannick Borowitz +2 more
wiley +1 more source
Exact Solutions for the Moving Firefighter Problem on Trees
ABSTRACT The moving firefighter problem (MFP) is a more realistic variant of the classic firefighter problem (FP), where firefighters require time for both travel and defense. Unfortunately, the only known exact solution for the MFP does not scale. In this paper, we establish that the MFP is NP‐complete on trees of maximum degree three and present four
Mauro A. Montenegro‐Meza +4 more
wiley +1 more source
Abstract Fractal fluctuations are a core concept for inquiries into human behavior and cognition from a dynamic systems perspective. Here, we present a generalized variance method for multivariate detrended fluctuation analysis (mvDFA). The advantage of this extension is that it can be applied to multivariate time series and considers intercorrelation ...
Sebastian Wallot +5 more
wiley +1 more source
Key Findings: An assimilation methodology is established for the Tomorrow.io microwave sounder (TMS) flying on CubeSats in sun‐synchronous and inclined orbits, and in all cloud scenes. The TMS has a significant impact on weather forecast lead times up to 3 days in the Tropics in a research‐quality numerical weather prediction setting, and yields water ...
Jonathan J. Guerrette +3 more
wiley +1 more source

