Results 71 to 80 of about 9,118,619 (182)
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, Volume 113, Issue 2, Page 169-194, October 2026.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
The Effect of Multigrid Parameters in a 3D Heat Diffusion Equation
International Journal of Applied Mechanics and Engineering, 2018 The aim of this paper is to reduce the necessary CPU time to solve the three-dimensional heat diffusion equation using Dirichlet boundary conditions. The finite difference method (FDM) is used to discretize the differential equations with a second-order ...
F. De Oliveira +2 more
doaj +1 more source
Analysis of Eigenvalue Clustering Leads to Optimal Scaling in Numerical Radiative Transfer
Numerical Linear Algebra with Applications, Volume 33, Issue 5, October 2026.ABSTRACT We consider a multidimensional polychromatic radiative transfer (RT) problem, accounting for scattering processes in a general form, that is, anisotropic (dipole) scattering with partial frequency redistribution. Given a discrete ordinates (SN$$ {S}_N $$) discretization, we report the corresponding matrix structures, depending on the model and
Pietro Benedusi +3 more
wiley +1 more source
, 2021 In the history of the People’s Republic of China, the country’s political leadership has always attached great importance to developing its lexicographical sector and to the role of dictionaries within society. Since the mid-1970s, the Chinese government
BERTULESSI, CHIARA
core +1 more source
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
Quality and Reliability Engineering International, Volume 42, Issue 6, Page 3326-3334, October 2026.ABSTRACT We introduce Circulant Matrix‐Based Box–Behnken Designs (CBBDs), a new class of three‐level, second‐order response surface designs constructed using circulant matrix structures. These designs satisfy an enhanced orthogonal minimally aliased (OMA∗${\rm OMA}^*$) property: they retain the classical OMA property—where main effects are orthogonal ...
Tung‐Dinh Pham, Nam‐Ky Nguyen
wiley +1 more source
Bounded diameter monochromatic component covers
Mathematika, Volume 72, Issue 4, October 2026.Abstract Ryser conjectured that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees. Motivated by a question of Austin in analysis, Milićević predicted something stronger — that every r$r$‐edge‐coloured complete graph can be covered by r−1$r-1$ monochromatic trees of bounded diameter.
Alexey Pokrovskiy
wiley +1 more source
Sources and definitions in the judeo-spanish lexical card index of Cynthia M. Crews
Philologia Hispalensis, 2018 This research aims the study and analysis of the lexical card index in Judeo-Spanish language of the British researcher Cynthia M. Crews, in order to examine the documentary sources which formed it, and to determine the criteria of definition and ...
Elisabeth Fernández Martín
doaj +1 more source
Journal of Applied Clinical Medical Physics, Volume 27, Issue 9, September 2026.Abstract Online adaptive radiotherapy (OART) modifies treatment plans using anatomy‐of‐the‐day imaging, but successful clinical implementation depends on automated planning strategies that can generate high‐quality plans within the constraints of an online workflow. This narrative review compares the automated planning architectures of the Varian Ethos
Songye Cui, Maria F. Chan, Dandan Zheng
wiley +1 more source
On Tight Tree‐Complete Hypergraph Ramsey Numbers
Journal of Graph Theory, Volume 113, Issue 1, Page 88-96, September 2026.ABSTRACT Chvátal showed that for any tree T with k edges, the Ramsey number R ( T , n ) = k ( n − 1 ) + 1. For r = 3 or 4, we show that, if T is an r‐uniform nontrivial tight tree, then the hypergraph Ramsey number R ( T , n ) = Θ ( n r − 1 ). The 3‐uniform result comes from observing a construction of Cooper and Mubayi.
Jiaxi Nie
wiley +1 more source
Artificial Intelligence for Engineering, Volume 2, Issue 3, Page 289-309, September 2026.This reflects the different optimisation objectives: The MPC formulation in Equation (22) minimises electricity cost together with a weighted thermal‐slack penalty. Its solution is therefore optimal with respect to this combined objective, rather than electricity cost alone.
Nawazish Ali, Rachael Shaw, Karl Mason
wiley +1 more source