Results 91 to 100 of about 8,697 (224)
Lexical Syllabus in Elementary and Secondary Education: Construction and Implementation
TESOL Quarterly, EarlyView.Abstract Nonnative language users operate with significantly limited vocabularies compared to native speakers, particularly when the language is learnt in school contexts. This paper demonstrates how empirical research on vocabulary learning combined with experience in teaching and curricula design has informed the principled construction of a lexical ...
Batia Laufer
wiley +1 more source
On a Compromise Social Choice Correspondence [PDF]
This paper analyzes the compromise social choice correspondence derived from the F-value of digraph games.Among other things monotonicity of this correspondence is shownsocial choice;games;t ...
Borm, P.E.M. +3 more
core
Unordered Love in infinite directed graphs
International Journal of Mathematics and Mathematical Sciences, 1992 A digraph D=(V,A) has the Unordered Love Property (ULP) if any two different vertices have a unique common outneighbor. If both (V,A) and (V,A−1) have the ULP, we say that D has the SDULP.
Peter D. Johnson
doaj +1 more source
Word Associations in a Minoritised Language: The Case of Cymraeg (Welsh)
International Journal of Applied Linguistics, EarlyView.ABSTRACT As with many research strands in linguistics, word association (WA) literature is dominated by English language data. This paper (i) explores the extent to which methodologies developed to date are applicable to other languages—specifically, Welsh (Cymraeg)—and (ii) investigates what WA analysis can reveal about lexical organisation and ...
Tess Fitzpatrick +2 more
wiley +1 more source
International Transactions in Operational Research, EarlyView.Abstract Artificial intelligence (AI)‐enabled digital technologies have the potential to transform agriculture by supporting decision‐making and automating operations. However, their limited adoptions and scholars’ atheoretical explorations constrain our understanding.
Guoqing Zhao +5 more
wiley +1 more source
A new sufficient condition for a 2-strong digraph to be Hamiltonian [PDF]
Discrete Mathematics & Theoretical Computer ScienceIn this paper we prove the following new sufficient condition for a digraph to be Hamiltonian: {\it Let $D$ be a 2-strong digraph of order $n\geq 9$. If $n-1$ vertices of $D$ have degrees at least $n+k$ and the remaining vertex has degree at least $n-
Samvel Kh. Darbinyan
doaj +1 more source
Context‐free graphs and their transition groups
Transactions of the London Mathematical Society, Volume 13, Issue 1, December 2026.Abstract Starting from context‐free inverse graphs, we introduce a new class of groups and study their structural properties. We establish closure properties, show that their coword problems are context‐free, analyze torsion elements, and realize them as subgroups of the asynchronous rational group.
Daniele D'Angeli +3 more
wiley +1 more source
Communications in Combinatorics and Optimization, 2016 Let $D$ be a finite and simple digraph with vertex set $V(D)$. For a vertex $v\in V(D)$, the degree of $v$, denoted by $d(v)$, is defined as the minimum value of its out-degree $d^+(v)$ and its in-degree $d^-(v)$.
L. Volkmann
doaj +1 more source
Dispelling Myths and Misunderstandings About Defining and Remediating Dyslexia
Dyslexia, Volume 32, Issue 4, November 2026.ABSTRACT Despite a strong base of scientifically supported research on dyslexia, pervasive misunderstandings continue, particularly in the United States, where state legislation, instructional practices and parent advocacy intersect in ways that influence how dyslexia is identified and treated.
Christy R. Austin +4 more
wiley +1 more source
A digraph group is a group defined by non-empty presentation with the property that each relator is of the form R(x, y), where x and y are distinct generators and R(·, ·) is determined by some fixed cyclically reduced word R(a, b) that involves both a ...
Williams, Gerald, Cihan, Mehmet Sefa
core +1 more source