Results 121 to 130 of about 2,068 (237)
RECONSIDERING THE STATUS OF KHÔRIS OIKOUNTES
In describing the Athenians’ preparations for war, Demosthenes states: “We resolve that the fleet shall be manned by metics (metoikous) and khôris oikountes, then again by ourselves [i.e., citizens], then by substitutes” (Dem. 4.36-37).
DEBORAH KAMEN
doaj +1 more source
Making a North American Dictionary after Avis
Dr. Johnson impugned his fellow dictionary makers by defining a lexicographer as a harmless drudge. Were a present day dictionary maker to take a Johnsonian editorial liberty and use Walter S.
Thomas E. Toon
core +1 more source
Circulant Matrix‐Based Box–Behnken Designs With Economic Run Sizes
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
Lexicographical Problems in isiXhosa
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
The role of Advanced Practice Nurses in creating the Kidney Transplant candidate care map (APN-preKT): a convergent-parallel mixed methods research protocol. [PDF]
Pedreira-Robles G +7 more
europepmc +1 more source
Error-checking tool for lexicographer
Kvalifikācijas darba mērķis ir izstrādāt programmatūru, kas palīdzētu leksikogrāfam darbā ar internetā izvietojamās vārdnīcas uzturēšanu un atjaunošanu.
Danovskis, Gunārs
core
Bounded diameter monochromatic component covers
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
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
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
Primary sclerosing cholangitis-A long night's journey into day. [PDF]
Chapman RW.
europepmc +1 more source

