Výsledky vyhledávání - "Yoong Kuan Goh"

OK google: what’s the answer? characteristics of students who searched the internet during an online chemistry examination

Autor: Madeleine Schultz, Kieran F. Lim, Yoong Kuan Goh, Damien L. Callahan

Publikováno v: Assessment & Evaluation in Higher Education. 47:1458-1474

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::9d3db0ea1cdb7e5134da475f5618f1ed
https://doi.org/10.1080/02602938.2022.2048356

Zobrazit plný text záznamu

Plný text ve formátu HTML

Are You Being Rhetorical? A Description of Rhetorical Move Annotation Tools and Open Corpus of Sample Machine-Annotated Rhetorical Moves

Autor: Andrew Gibson, Ágnes Sándor, Elena Cotos, Sowmya Vajjala, Antonette Shibani, Simon Knight, Rianne Conijn, Sophie Abel, Yoong Kuan Goh, Simon Buckingham Shum

Publikováno v: Journal of Learning Analytics. 7:138-154

Writing analytics has emerged as a sub-field of learning analytics, with applications including the provision of formative feedback to students in developing their writing capacities. Rhetorical markers in writing have become a key feature in this fe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6bf0ba1c4d83f32063ce7e4f58813f4e
https://doi.org/10.18608/jla.2020.73.10

Zobrazit plný text záznamu

$k$-pop stack sortable permutations and $2$-avoidance

Autor: Murray Elder, Yoong Kuan Goh

We consider permutations sortable by $k$ passes through a deterministic pop stack. We show that for any $k\in\mathbb N$ the set is characterised by finitely many patterns, answering a question of Claesson and Gu{\dh}mundsson. Our characterisation dem

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::03f93be1010cabd2f271c313591ef1cc
http://arxiv.org/abs/1911.03104

Zobrazit plný text záznamu

Permutations Sorted by a Finite and an Infinite Stack in Series

Autor: Murray Elder, Yoong Kuan Goh

Publikováno v: Language and Automata Theory and Applications ISBN: 9783319773124
LATA

We prove that the set of permutations sorted by a stack of depth $t \ge 3$ and an infinite stack in series has infinite basis, by constructing an infinite antichain. This answers an open question on identifying the point at which, in a sorting proc

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::dfca0c75596cfc645ecf8c57724c7a9e
https://doi.org/10.1007/978-3-319-77313-1_17

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání