2 Search Results for "Ryan, John Paul"


Document
Predicting Math Success in an Online Tutoring System Using Language Data and Click-Stream Variables: A Longitudinal Analysis

Authors: Scott Crossley, Shamya Karumbaiah, Jaclyn Ocumpaugh, Matthew J. Labrum, and Ryan S. Baker

Published in: OASIcs, Volume 70, 2nd Conference on Language, Data and Knowledge (LDK 2019)


Abstract
Previous studies have demonstrated strong links between students' linguistic knowledge, their affective language patterns and their success in math. Other studies have shown that demographic and click-stream variables in online learning environments are important predictors of math success. This study builds on this research in two ways. First, it combines linguistics and click-stream variables along with demographic information to increase prediction rates for math success. Second, it examines how random variance, as found in repeated participant data, can explain math success beyond linguistic, demographic, and click-stream variables. The findings indicate that linguistic, demographic, and click-stream factors explained about 14% of the variance in math scores. These variables mixed with random factors explained about 44% of the variance.

Cite as

Scott Crossley, Shamya Karumbaiah, Jaclyn Ocumpaugh, Matthew J. Labrum, and Ryan S. Baker. Predicting Math Success in an Online Tutoring System Using Language Data and Click-Stream Variables: A Longitudinal Analysis. In 2nd Conference on Language, Data and Knowledge (LDK 2019). Open Access Series in Informatics (OASIcs), Volume 70, pp. 25:1-25:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)


Copy BibTex To Clipboard

@InProceedings{crossley_et_al:OASIcs.LDK.2019.25,
  author =	{Crossley, Scott and Karumbaiah, Shamya and Ocumpaugh, Jaclyn and Labrum, Matthew J. and Baker, Ryan S.},
  title =	{{Predicting Math Success in an Online Tutoring System Using Language Data and Click-Stream Variables: A Longitudinal Analysis}},
  booktitle =	{2nd Conference on Language, Data and Knowledge (LDK 2019)},
  pages =	{25:1--25:13},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-105-4},
  ISSN =	{2190-6807},
  year =	{2019},
  volume =	{70},
  editor =	{Eskevich, Maria and de Melo, Gerard and F\"{a}th, Christian and McCrae, John P. and Buitelaar, Paul and Chiarcos, Christian and Klimek, Bettina and Dojchinovski, Milan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/OASIcs.LDK.2019.25},
  URN =		{urn:nbn:de:0030-drops-103895},
  doi =		{10.4230/OASIcs.LDK.2019.25},
  annote =	{Keywords: Natural language processing, math education, online tutoring systems, text analytics, click-stream variables}
}
Document
Path Planning for Simple Robots using Soft Subdivision Search

Authors: Ching-Hsiang Hsu, John Paul Ryan, and Chee Yap

Published in: LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016)


Abstract
The concept of resolution-exact path planning is a theoretically sound alternative to the standard exact algorithms, and provides much stronger guarantees than probabilistic or sampling algorithms. It opens the way for the introduction of soft predicates in the context of subdivision algorithm. Taking a leaf from the great success of the Probabilistic Road Map (PRM) framework, we formulate an analogous framework for subdivision, called Soft Subdivision Search (SSS). In this video, we illustrate the SSS framework for a trio of simple planar robots: disc, triangle and 2-links. These robots have, respectively, 2, 3 and 4 degrees of freedom. Our 2-link robot can also avoid self-crossing. These algorithms operate in realtime and are relatively easy to implement.

Cite as

Ching-Hsiang Hsu, John Paul Ryan, and Chee Yap. Path Planning for Simple Robots using Soft Subdivision Search. In 32nd International Symposium on Computational Geometry (SoCG 2016). Leibniz International Proceedings in Informatics (LIPIcs), Volume 51, pp. 68:1-68:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{hsu_et_al:LIPIcs.SoCG.2016.68,
  author =	{Hsu, Ching-Hsiang and Ryan, John Paul and Yap, Chee},
  title =	{{Path Planning for Simple Robots using Soft Subdivision Search}},
  booktitle =	{32nd International Symposium on Computational Geometry (SoCG 2016)},
  pages =	{68:1--68:5},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-009-5},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{51},
  editor =	{Fekete, S\'{a}ndor and Lubiw, Anna},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.68},
  URN =		{urn:nbn:de:0030-drops-59607},
  doi =		{10.4230/LIPIcs.SoCG.2016.68},
  annote =	{Keywords: Robot Path Planning, Soft Predicates, Resolution-Exact Algorithm, Subdivision Search}
}
  • Refine by Author
  • 1 Baker, Ryan S.
  • 1 Crossley, Scott
  • 1 Hsu, Ching-Hsiang
  • 1 Karumbaiah, Shamya
  • 1 Labrum, Matthew J.
  • Show More...

  • Refine by Classification
  • 1 Applied computing → Computer-assisted instruction
  • 1 Applied computing → Mathematics and statistics
  • 1 Computing methodologies → Natural language processing

  • Refine by Keyword
  • 1 Natural language processing
  • 1 Resolution-Exact Algorithm
  • 1 Robot Path Planning
  • 1 Soft Predicates
  • 1 Subdivision Search
  • Show More...

  • Refine by Type
  • 2 document

  • Refine by Publication Year
  • 1 2016
  • 1 2019

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail