Results 111 to 120 of about 3,177 (188)
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
Lexikos, 2015 The contributions in Klosa (2013a) provide information on various aspects of the design of morphological data for (German) language dictionaries. Bergenholtz and Gouws (2013), however, reject most of these contributions as sources lexicographers could ...
P.H. Swanepoel
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
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
What is a Lexicographical Database?
Lexikos, 2013 Fifty years ago, nolexicographer used a database in the work process. Today, almost all dictionary projects incorporate databases. In our opinion, the optimal lexicographical database should be planned in cooperation between a lexicographer and a database specialist in each specific lexicographical project. Such cooperation will reach the highest level
Bergenholtz, Henning +1 more
openaire +6 more sources
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
Lexicographical Problems in isiXhosa
Lexikos, 2013 Working on the lexicography of isiXhosa has led to the interesting experience of discovering that the description of the lexicon of isiXhosa poses innumerable challenges of both a semantic and a non-semantic nature. The problems encountered, some of which this article is an account of, include lack of understanding of the nature, depth and volume of ...
openaire +3 more sources
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