419 research outputs found
An Application of Attribution Theory to Developing Self-Esteem in Learning Disabled Adolescents
This research was published by the KU Center for Research on Learning, formerly known as the University of Kansas Institute for Research in Learning Disabilities.The study found that LD adolescents did not differ significantly from non-LD adolescents in their esponses to general self esteem and attribution questionnaires. Effort attribution training brought no significant increase in effort attributions for the experimental group of LD students. LD students reported the effort was a factor that explained success or failure in achievement tasks, but also reported that factors other than effort explained their personal success or failure on a specific spelling task
The effects of changes in the order of verbal labels and numerical values on children's scores on attitude and rating scales
Research with adults has shown that variations in verbal labels and numerical scale values on rating scales can affect the responses given. However, few studies have been conducted with children. The study aimed to examine potential differences in childrenâs responses to Likert-type rating scales according to their anchor points and scale direction, and to see whether or not such differences were stable over time. 130 British children, aged 9 to 11, completed six sets of Likert-type rating scales, presented in four different ways varying the position of positive labels and numerical values. The results showed, both initially and 8-12 weeks later, that presenting a positive label or a high score on the left of a scale led to significantly higher mean scores than did the other variations. These findings indicate that different arrangements of rating scales can produce different results which has clear implications for the administration of scales with children
Pedestrian, Crowd, and Evacuation Dynamics
This contribution describes efforts to model the behavior of individual
pedestrians and their interactions in crowds, which generate certain kinds of
self-organized patterns of motion. Moreover, this article focusses on the
dynamics of crowds in panic or evacuation situations, methods to optimize
building designs for egress, and factors potentially causing the breakdown of
orderly motion.Comment: This is a review paper. For related work see http://www.soms.ethz.c
Bolus residue scale: an easy-to-use and reliable videofluoroscopic analysis tool to score bolus residue in patients with dysphagia
Background. We aimed to validate an easy-to-use videofluoroscopic analysis tool, the bolus residue scale (BRS), for detection and classification of pharyngeal retention in the valleculae, piriform sinuses, and/or the posterior pharyngeal wall. Methods. 50 randomly selected videofluoroscopic images of 10âmL swallows (recorded in 18 dysphagia patients and 8 controls) were analyzed by 4 experts and 6 nonexpert observers. A score from 1 to 6 was assigned according to the number of structures affected by residue. Inter- and intrarater reliabilities were assessed by calculation of intraclass correlation coefficients (ICCs) for expert and nonexpert observers. Sensitivity, specificity, and interrater agreement were analyzed for different BRS levels. Results. Intrarater reproducibility was almost perfect for experts (mean ICC 0.972) and ranged from substantial to almost perfect for nonexperts (mean ICC 0.835). Interjudge agreement of the experts ranged from substantial to almost perfect (mean ICC 0.780), but interrater reliability of nonexperts ranged from substantial to good (mean 0.719). BRS shows for experts a high specificity and sensitivity and for nonexperts a low sensitivity and high specificity. Conclusions. The BRS is a simple, easy-to-carry-out, and accessible rating scale to locate pharyngeal retention on videofluoroscopic images with a good specificity and reproducibility for observers of different expertise levels.Nathalie Rommel, Charlotte Borgers, Dirk Van Beckevoort, Ann Goeleven, Eddy Dejaeger, and Taher I. Omar
Multi-Dimensional, Compressible Viscous Flow on a Moving Voronoi Mesh
Numerous formulations of finite volume schemes for the Euler and
Navier-Stokes equations exist, but in the majority of cases they have been
developed for structured and stationary meshes. In many applications, more
flexible mesh geometries that can dynamically adjust to the problem at hand and
move with the flow in a (quasi) Lagrangian fashion would, however, be highly
desirable, as this can allow a significant reduction of advection errors and an
accurate realization of curved and moving boundary conditions. Here we describe
a novel formulation of viscous continuum hydrodynamics that solves the
equations of motion on a Voronoi mesh created by a set of mesh-generating
points. The points can move in an arbitrary manner, but the most natural motion
is that given by the fluid velocity itself, such that the mesh dynamically
adjusts to the flow. Owing to the mathematical properties of the Voronoi
tessellation, pathological mesh-twisting effects are avoided. Our
implementation considers the full Navier-Stokes equations and has been realized
in the AREPO code both in 2D and 3D. We propose a new approach to compute
accurate viscous fluxes for a dynamic Voronoi mesh, and use this to formulate a
finite volume solver of the Navier-Stokes equations. Through a number of test
problems, including circular Couette flow and flow past a cylindrical obstacle,
we show that our new scheme combines good accuracy with geometric flexibility,
and hence promises to be competitive with other highly refined Eulerian
methods. This will in particular allow astrophysical applications of the AREPO
code where physical viscosity is important, such as in the hot plasma in galaxy
clusters, or for viscous accretion disk models.Comment: 26 pages, 21 figures. Submitted to MNRA
Scale-free memory model for multiagent reinforcement learning. Mean field approximation and rock-paper-scissors dynamics
A continuous time model for multiagent systems governed by reinforcement
learning with scale-free memory is developed. The agents are assumed to act
independently of one another in optimizing their choice of possible actions via
trial-and-error search. To gain awareness about the action value the agents
accumulate in their memory the rewards obtained from taking a specific action
at each moment of time. The contribution of the rewards in the past to the
agent current perception of action value is described by an integral operator
with a power-law kernel. Finally a fractional differential equation governing
the system dynamics is obtained. The agents are considered to interact with one
another implicitly via the reward of one agent depending on the choice of the
other agents. The pairwise interaction model is adopted to describe this
effect. As a specific example of systems with non-transitive interactions, a
two agent and three agent systems of the rock-paper-scissors type are analyzed
in detail, including the stability analysis and numerical simulation.
Scale-free memory is demonstrated to cause complex dynamics of the systems at
hand. In particular, it is shown that there can be simultaneously two modes of
the system instability undergoing subcritical and supercritical bifurcation,
with the latter one exhibiting anomalous oscillations with the amplitude and
period growing with time. Besides, the instability onset via this supercritical
mode may be regarded as "altruism self-organization". For the three agent
system the instability dynamics is found to be rather irregular and can be
composed of alternate fragments of oscillations different in their properties.Comment: 17 pages, 7 figur
Markov Perfect Equilibrium Existence for a Class of Undiscounted Infinite-Horizon Dynamic Games
We prove the existence of Markov perfect equilibria (MPE) for nonstationary undiscounted infinite-horizon dynamic games with alternating moves. A suitable finite-horizon equilibrium relaxation, the ending state constrained MPE, captures the relevant features of an infinite-horizon MPE for a long enough horizon, under a uniformly bounded reachability assumption.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/45191/1/10957_2004_Article_224678.pd
- âŠ