{"57d30709d3aee14643825488f4b1b7e2mariawirzberger":{"DOI":"10.3389/frai.2022.873056","ISBN":"","ISSN":"","URL":"https://www.frontiersin.org/articles/10.3389/frai.2022.873056/abstract","abstract":"Affect-adaptive tutoring systems detect the current emotional state of the learner and are capable of adequately responding by adapting the learning experience. Adaptations could be employed to manipulate the emotional state in a direction favorable to the learning process; for example, contextual help can be offered to mitigate frustration, or lesson plans can be accelerated to avoid boredom. Safety-critical situations, in which wrong decisions and behaviors can have fatal consequences, may particularly benefit from affect-adaptive tutoring systems, because accounting for affecting responses during training may help develop coping strategies and improve resilience. Effective adaptation, however, can only be accomplished when knowing which emotions benefit high learning performance in such systems. The results of preliminary studies indicate interindividual differences in the relationship between emotion and performance that require consideration by an affect-adaptive system. To that end, this article introduces the concept of Affective Response Categories (ARCs) that can be used to categorize learners based on their emotion-performance relationship. In an experimental study, N = 50 subjects (33% female, 19-57 years, M = 32.75, SD = 9.8) performed a simulated airspace surveillance task. Emotional valence was detected using facial expression analysis, and pupil diameters were used to indicate emotional arousal. A cluster analysis was performed to group subjects into ARCs based on their individual correlations of valence and performance as well as arousal and performance. Three different clusters were identified, one of which showed no correlations between emotion and performance. The performance of subjects in all other clusters benefitted from negative arousal and differed only in the valence-performance correlation, which was positive or negative. Based on the identified clusters, the initial ARC model was revised. We then discuss the resulting model, outline future research, and derive implications for the larger context of the field of adaptive tutoring systems. Furthermore, potential benefits of the proposed concept are discussed and ethical issues are identified and addressed.","annote":"","author":[{"family":"Schmitz-Hübsch","given":"Alina"},{"family":"Stasch","given":"Sophie-Marie"},{"family":"Becker","given":"Ron"},{"family":"Fuchs","given":"Sven"},{"family":"Wirzberger","given":"Maria"}],"citation-label":"schmitzhubsch2022affective","collection-editor":[],"collection-title":"","container-author":[],"container-title":"Frontiers in Artificial Intelligence","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2022"]],"literal":"2022"},"event-place":"","id":"57d30709d3aee14643825488f4b1b7e2mariawirzberger","interhash":"0a84ccf011eeebfaf7f8a27c756326ac","intrahash":"57d30709d3aee14643825488f4b1b7e2","issue":"","issued":{"date-parts":[["2022"]],"literal":"2022"},"keyword":"myown adaptive instruction cognition affect tutoring","misc":{"doi":"10.3389/frai.2022.873056"},"note":"","number":"","page":"","page-first":"","publisher":"","publisher-place":"","status":"","title":"Affective response categories – Towards personalized reactions in affect-adaptive tutoring systems","type":"article-journal","username":"mariawirzberger","version":"","volume":""},"992b581f1e96812159406b320cdc362cmhartmann":{"DOI":"","ISBN":"","ISSN":"","URL":"","abstract":"","annote":"","author":[{"family":"Gaspoz","given":"Fernando D."},{"family":"Morin","given":"Pedro"}],"citation-label":"gaspoz2009convergence","collection-editor":[],"collection-title":"","container-author":[],"container-title":"IMA J. Numer. Anal.","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2009"]],"literal":"2009"},"event-place":"","id":"992b581f1e96812159406b320cdc362cmhartmann","interhash":"1e7a0334d6389891fae356da35076ece","intrahash":"992b581f1e96812159406b320cdc362c","issue":"4","issued":{"date-parts":[["2009"]],"literal":"2009"},"keyword":"a estimator, equations posteriori adaptive error refinement, vorlaeufig elliptic mesh","misc":{"owner":"szur","fjournal":"IMA Journal on Numerical Analysis"},"note":"","number":"4","number-of-pages":"19","page":"917--936","page-first":"917","publisher":"Oxford University Press","publisher-place":"","status":"","title":"Convergence rates for adaptive finite elements","type":"article-journal","username":"mhartmann","version":"","volume":"29"},"4b6636216b66dfdfd50ca53bb93685demhartmann":{"DOI":"10.1002/num.22180","ISBN":"","ISSN":"","URL":"https://onlinelibrary.wiley.com/doi/abs/10.1002/num.22180","abstract":"This article concerns with incorporating wavelet bases into existing\n\tstreamline upwind Petrov-Galerkin (SUPG) methods for the numerical\n\tsolution of nonlinear hyperbolic conservation laws which are known\n\tto develop shock solutions. Here, we utilize an SUPG formulation\n\tusing continuous Galerkin in space and discontinuous Galerkin in\n\ttime. The main motivation for such a combination is that these methods\n\thave good stability properties thanks to adding diffusion in the\n\tdirection of streamlines. But they are more expensive than explicit\n\tsemidiscrete methods as they have to use space-time formulations.\n\tUsing wavelet bases we maintain the stability properties of SUPG\n\tmethods while we reduce the cost of these methods significantly through\n\tnatural adaptivity of wavelet expansions. In addition, wavelet bases\n\thave a hierarchical structure. We use this property to numerically\n\tinvestigate the hierarchical addition of an artificial diffusion\n\tfor further stabilization in spirit of spectral diffusion. Furthermore,\n\twe add the hierarchical diffusion only in the vicinity of discontinuities\n\tusing the feature of wavelet bases in detection of location of discontinuities.\n\tAlso, we again use the last feature of the wavelet bases to perform\n\ta postprocessing using a denosing technique based on a minimization\n\tformulation to reduce Gibbs oscillations near discontinuities while\n\tkeeping other regions intact. Finally, we show the performance of\n\tthe proposed combination through some numerical examples including\n\tBurgers�, transport, and wave equations as well as systems of shallow\n\twater equations.� 2017 Wiley Periodicals, Inc. Numer Methods Partial\n\tDifferential Eq 33: 2062�2089, 2017","annote":"","author":[{"family":"Minbashian","given":"Hadi"},{"family":"Adibi","given":"Hojatolah"},{"family":"Dehghan","given":"Mehdi"}],"citation-label":"minbashian2017adaptive","collection-editor":[],"collection-title":"","container-author":[],"container-title":"Numerical Methods for Partial Differential Equations","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2017"]],"literal":"2017"},"event-place":"","id":"4b6636216b66dfdfd50ca53bb93685demhartmann","interhash":"c8972e3ab25e760174ed7741330758be","intrahash":"4b6636216b66dfdfd50ca53bb93685de","issue":"6","issued":{"date-parts":[["2017"]],"literal":"2017"},"keyword":"Petrove-Galerkin postprocessing hyperbolic Galerkin, laws, spectral streamline upwind (SUPG), viscosity, adaptive conservation continuous wavelet discontinuous vorlaeufig method,","misc":{"owner":"seusdd","doi":"10.1002/num.22180","eprint":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/num.22180"},"note":"","number":"6","number-of-pages":"27","page":"2062-2089","page-first":"2062","publisher":"","publisher-place":"","status":"","title":"An adaptive wavelet space-time SUPG method for hyperbolic conservation\n\tlaws","type":"article-journal","username":"mhartmann","version":"","volume":"33"},"8e5c4ef4cd89f8480d3267c8ac2ae0f5mhartmann":{"DOI":"","ISBN":"","ISSN":"","URL":"http://www.emis.de/journals/AMUC/_vol-70/_no_1/_siebert/siebert.html","abstract":"Adaptive finite element methods are a modern, widely used tool which\n\tmake realistic computations feasible, even in three space dimensions.\n\tWe describe the basic ideas and ingredients of adaptive FEM and the\n\timplementation of our toolbox \\ALBERT. The design of \\ALBERT is based\n\ton the natural hierarchy of locally refined meshes and an abstract\n\tconcept of general finite element spaces. As a result, dimension\n\tindependent programming of applications is possible. Numerical results\n\tfrom applications in two and three space dimensions demonstrate the\n\tflexibility of \\ALBERT.","annote":"","author":[{"family":"Schmidt","given":"Alfred"},{"family":"Siebert","given":"Kunibert G."}],"citation-label":"schmidt2001textsfalbert","collection-editor":[],"collection-title":"","container-author":[],"container-title":"Acta Mathematica Universitatis Comenianae, New Ser.","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2001"]],"literal":"2001"},"event-place":"","id":"8e5c4ef4cd89f8480d3267c8ac2ae0f5mhartmann","interhash":"a5a8cd137415bf5bebd5688c3f8c4b73","intrahash":"8e5c4ef4cd89f8480d3267c8ac2ae0f5","issue":"1","issued":{"date-parts":[["2001"]],"literal":"2001"},"keyword":"design software scientific Adaptive finite element software, methods, vorlaeufig","misc":{"owner":"kohlsk","language":"English"},"note":"","number":"1","number-of-pages":"17","page":"105-122","page-first":"105","publisher":"","publisher-place":"","status":"","title":"ALBERT --- Software for Scientific Computations and Applications","type":"article-journal","username":"mhartmann","version":"","volume":"70"},"d139b76a0d524aed7c15503f76b34fd4mhartmann":{"DOI":"","ISBN":"","ISSN":"","URL":"http://www.global-sci.org/nmtma/","abstract":"Many problems with underlying variational structure involve a coupling\n\tof volume with surface effects. A straight-forward approach in a\n\tfinite element discretization is to make use of the surface triangulation\n\tthat is naturally induced by the volume triangulation. In an adaptive\n\tmethod one wants to facilitate \"matching\" local mesh modifications,\n\ti.e., local refinement and/or coarsening, of volume and surface mesh\n\twith standard tools such that the surface grid is always induced\n\tby the volume grid. We describe the concepts behind this approach\n\tfor bisectional refinement and describe new tools incorporated in\n\tthe finite element toolbox ALBERTA. We also present several important\n\tapplications of the mesh coupling.","annote":"","author":[{"family":"Köster","given":"Daniel"},{"family":"Kriessl","given":"Oliver"},{"family":"Siebert","given":"Kunibert G."}],"citation-label":"koster2008design","collection-editor":[],"collection-title":"","container-author":[],"container-title":"Numerical Mathematics: Theory, Methods and Applications","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2008"]],"literal":"2008"},"event-place":"","id":"d139b76a0d524aed7c15503f76b34fd4mhartmann","interhash":"e9714704742940ccda41faa66c3346cc","intrahash":"d139b76a0d524aed7c15503f76b34fd4","issue":"3","issued":{"date-parts":[["2008"]],"literal":"2008"},"keyword":"design software scientific Adaptive finite element software, methods, vorlaeufig","misc":{"owner":"kohlsk","language":"English"},"note":"","number":"3","number-of-pages":"29","page":"245-274","page-first":"245","publisher":"","publisher-place":"","status":"","title":"Design of Finite Element Tools for Coupled Surface and Volume Meshes","type":"article-journal","username":"mhartmann","version":"","volume":"1"},"6577a49d6be6cb03cd99ed10f5af9860mhartmann":{"DOI":"10.1016/j.apnum.2008.12.006","ISBN":"","ISSN":"","URL":"http://dx.doi.org/10.1016/j.apnum.2008.12.006","abstract":"The a priori convergence of finite element methods is based on the\n\tdensity property of the sequence of finite element spaces which essentially\n\tassumes a quasi-uniform mesh-refining. The advantage is guaranteed\n\tconvergence for a large class of data and solutions; the disadvantage\n\tis a global mesh refinement everywhere accompanied by large computational\n\tcosts. Adaptive finite element methods (AFEMs) automatically refine\n\texclusively wherever their refinement indication suggests to do so\n\tand consequently leave out refinements at other locations. In other\n\twords, the density property is violated on purpose and the a priori\n\tconvergence is not guaranteed automatically and, in fact, crucially\n\tdepends on algorithmic details. The advantage of AFEMs is a more\n\teffective mesh in many practical examples accompanied by smaller\n\tcomputational costs; the disadvantage is that the desirable convergence\n\tproperty is not guaranteed a priori. Efficient error estimators can\n\tjustify a numerical approximation a posteriori and so achieve reliability.\n\tBut it is not theoretically justified from the start that the adaptive\n\tmesh-refinement will generate an accurate solution at all. In order\n\tto foster the development of a convergence theory and improved design\n\tof AFEMs in computational engineering and sciences, this paper describes\n\ta particular version of an AFEM and analyses convergence results\n\tfor three model problems in computational mechanics: linear elastic\n\tmaterial (A), nonlinear monotone elastic material (B), and Hencky\n\telastoplastic material (C). It establishes conditions sufficient\n\tfor error-reduction in (A), for energy-reduction in (B), and eventually\n\tfor strong convergence of the stress field in (C) in the presence\n\tof small hardening.","annote":"","author":[{"family":"Morin","given":"Pedro"},{"family":"Nochetto","given":"Ricardo H."},{"family":"Siebert","given":"Kunibert G."}],"citation-label":"morin2002convergence","collection-editor":[],"collection-title":"","container-author":[],"container-title":"SIAM Review","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2002"]],"literal":"2002"},"event-place":"","id":"6577a49d6be6cb03cd99ed10f5af9860mhartmann","interhash":"82d27fed5937d15b2a4642665dea175f","intrahash":"6577a49d6be6cb03cd99ed10f5af9860","issue":"4","issued":{"date-parts":[["2002"]],"literal":"2002"},"keyword":"Hencky elastoplasticity; Adaptive Convexity; FEM; vorlaeufig algorithm; elasticity; Convergence Linear","misc":{"owner":"kohlsk","doi":"10.1016/j.apnum.2008.12.006"},"note":"","number":"4","number-of-pages":"27","page":"631-658","page-first":"631","publisher":"","publisher-place":"","status":"","title":"Convergence of Adaptive Finite Element Methods","type":"article-journal","username":"mhartmann","version":"","volume":"44"},"1237a0ffaf182fdd91641c941d3d4db1mhartmann":{"DOI":"10.1093/imanum/drr026","ISBN":"","ISSN":"","URL":"http://dx.doi.org/10.1093/imanum/drr026","abstract":"We derive an algorithm for the adaptive approximation of solutions\n\tto parabolic equations. It is based on adaptive finite elements in\n\tspace and the implicit Euler discretization in time with adaptive\n\ttime-step sizes. We prove that, given a positive tolerance for the\n\terror, the adaptive algorithm reaches the final time with a space�time\n\terror between continuous and discrete solution that is below the\n\tgiven tolerance. Numerical experiments reveal a more than competitive\n\tperformance of our algorithm ASTFEM (adaptive space�time finite element\n\tmethod).","annote":"","author":[{"family":"Kreuzer","given":"Christian"},{"family":"Möller","given":"Christian"},{"family":"Schmidt","given":"Alfred"},{"family":"Siebert","given":"Kunibert G."}],"citation-label":"kreuzer2012design","collection-editor":[],"collection-title":"","container-author":[],"container-title":"IMA Journal of Numerical Analysis","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2012"]],"literal":"2012"},"event-place":"","id":"1237a0ffaf182fdd91641c941d3d4db1mhartmann","interhash":"4f9e70559b93e67305a10572434e4d6a","intrahash":"1237a0ffaf182fdd91641c941d3d4db1","issue":"","issued":{"date-parts":[["2012"]],"literal":"2012"},"keyword":"parabolic problems, adaptive elements, convergence finite analysis vorlaeufig","misc":{"owner":"kohlsk","doi":"10.1093/imanum/drr026"},"note":"Online First","number":"","page":"","page-first":"","publisher":"","publisher-place":"","status":"","title":"Design and Convergence Analysis for an Adaptive Discretization of\n\tthe Heat Equation","type":"webpage","username":"mhartmann","version":"","volume":""},"cb88371212f23f2387c876de0c82ad50mhartmann":{"DOI":"http://dx.doi.org/10.1016/j.jpdc.2016.12.003","ISBN":"","ISSN":"0743-7315","URL":"http://www.sciencedirect.com/science/article/pii/S0743731516301782","abstract":"Distributed adaptive conforming refinement requires multiple iterations\n\tof the serial refinement algorithm and global communication as the\n\trefinement can be propagated over several processor boundaries. We\n\tshow bounds on the maximum number of iterations. The algorithm is\n\timplemented within the open-source software package Dune-ALUGrid.","annote":"","author":[{"family":"Alkämper","given":"Martin"},{"family":"Klöfkorn","given":"Robert"}],"citation-label":"alkamper2017distributed","collection-editor":[],"collection-title":"","container-author":[],"container-title":"Journal of Parallel and Distributed Computing","documents":[],"edition":"","editor":[],"event-date":{"date-parts":[["2017"]],"literal":"2017"},"event-place":"","id":"cb88371212f23f2387c876de0c82ad50mhartmann","interhash":"20fdeaf87d8fa0f67305283fd3e0234d","intrahash":"cb88371212f23f2387c876de0c82ad50","issue":"","issued":{"date-parts":[["2017"]],"literal":"2017"},"keyword":"method Adaptive vorlaeufig","misc":{"issn":"0743-7315","doi":"http://dx.doi.org/10.1016/j.jpdc.2016.12.003"},"note":"","number":"","number-of-pages":"10","page":"1 - 11","page-first":"1","publisher":"","publisher-place":"","status":"","title":"Distributed Newest Vertex Bisection","type":"article-journal","username":"mhartmann","version":"","volume":"104"}}