38,282 research outputs found
Exploring the Relationship Between Self-Regulated Learning and Reflection in Teacher Education
Literature on teacher learning has shown links between being a self-regulated learner, reflecting effectively on oneâs own practice, and being described as an âadaptive expertâ. For instance, the metacognitive skills needed for effective reflection on teaching practice are seen as critically important to developing adaptive expertise in the context of the highly complex classroom environment. Similarly, self-regulated learning is often defined, at least in part, in terms of using metacognitive skill to adapt oneâs approach to complex learning situations or problems. Although there is rich literature on reflective practice in teacher education, less is known about measuring teachersâ self-regulated learning or the relationship between self-regulated learning and teacher reflections. This research examines reflective practice and self-regulated learning through pre-service teachersâ written reflections. The study makes a novel adaptation of a rubric designed to evaluate teacher education candidatesâ reflections to measure self-regulated learning. Findings suggest that the rubric could also be useful in understanding the self-regulated practices of teacher education candidates
Risk Assessment Algorithms Based On Recursive Neural Networks
The assessment of highly-risky situations at road intersections have been
recently revealed as an important research topic within the context of the
automotive industry. In this paper we shall introduce a novel approach to
compute risk functions by using a combination of a highly non-linear processing
model in conjunction with a powerful information encoding procedure.
Specifically, the elements of information either static or dynamic that appear
in a road intersection scene are encoded by using directed positional acyclic
labeled graphs. The risk assessment problem is then reformulated in terms of an
inductive learning task carried out by a recursive neural network. Recursive
neural networks are connectionist models capable of solving supervised and
non-supervised learning problems represented by directed ordered acyclic
graphs. The potential of this novel approach is demonstrated through well
predefined scenarios. The major difference of our approach compared to others
is expressed by the fact of learning the structure of the risk. Furthermore,
the combination of a rich information encoding procedure with a generalized
model of dynamical recurrent networks permit us, as we shall demonstrate, a
sophisticated processing of information that we believe as being a first step
for building future advanced intersection safety system
A pearl on SAT solving in Prolog
A succinct SAT solver is presented that exploits the control provided by delay declarations to implement watched literals and unit propagation. Despite its brevity the solver is surprisingly powerful and its elegant use of Prolog constructs is presented as a programming pearl
Curriculum Guidelines for Undergraduate Programs in Data Science
The Park City Math Institute (PCMI) 2016 Summer Undergraduate Faculty Program
met for the purpose of composing guidelines for undergraduate programs in Data
Science. The group consisted of 25 undergraduate faculty from a variety of
institutions in the U.S., primarily from the disciplines of mathematics,
statistics and computer science. These guidelines are meant to provide some
structure for institutions planning for or revising a major in Data Science
Coin.AI: A Proof-of-Useful-Work Scheme for Blockchain-based Distributed Deep Learning
One decade ago, Bitcoin was introduced, becoming the first cryptocurrency and
establishing the concept of "blockchain" as a distributed ledger. As of today,
there are many different implementations of cryptocurrencies working over a
blockchain, with different approaches and philosophies. However, many of them
share one common feature: they require proof-of-work to support the generation
of blocks (mining) and, eventually, the generation of money. This proof-of-work
scheme often consists in the resolution of a cryptography problem, most
commonly breaking a hash value, which can only be achieved through brute-force.
The main drawback of proof-of-work is that it requires ridiculously large
amounts of energy which do not have any useful outcome beyond supporting the
currency. In this paper, we present a theoretical proposal that introduces a
proof-of-useful-work scheme to support a cryptocurrency running over a
blockchain, which we named Coin.AI. In this system, the mining scheme requires
training deep learning models, and a block is only mined when the performance
of such model exceeds a threshold. The distributed system allows for nodes to
verify the models delivered by miners in an easy way (certainly much more
efficiently than the mining process itself), determining when a block is to be
generated. Additionally, this paper presents a proof-of-storage scheme for
rewarding users that provide storage for the deep learning models, as well as a
theoretical dissertation on how the mechanics of the system could be
articulated with the ultimate goal of democratizing access to artificial
intelligence.Comment: 17 pages, 5 figure
An Editor for Helping Novices to Learn Standard ML
This paper describes a novel editor intended as an aid in the learning of the functional programming language Standard ML. A common technique used by novices is programming by analogy whereby students refer to similar programs that they have written before or have seen in the course literature and use these programs as a basis to write a new program. We present a novel editor for ML which supports programming by analogy by providing a collection of editing commands that transform old programs into new ones. Each command makes changes to an isolated part of the program. These changes are propagated to the rest of the program using analogical techniques. We observed a group of novice ML students to determine the most common programming errors in learning ML and restrict our editor such that it is impossible to commit these errors. In this way, students encounter fewer bugs and so their rate of learning increases. Our editor, C Y NTHIA, has been implemented and is due to be tested on st..
Adversarial Risk AnĂĄlysis for Counterterrorism Modelling
Recent large scale terrorist attacks have raised interest in models for resource allocation against terrorist threats. The unifying theme in this area is the need to develop methods for the analysis of allocation decisions when risks stem from the intentional actions of intelligent adversaries. Most approaches to these problems have a game theoretic flavor although there are also several interesting decision analytic based proposals. One of them is the recently introduced framework for adversarial risk analysis, which deals with decision making problems that involve intelligent opponents and uncertain outcomes. We explore how adversarial risk analysis addresses some standard counterterrorism models: simultaneous defend-attack models, sequential defend-attack-defend models and sequential defend-attack models with private information. For each model, we first assess critically what would be a typical game theoretic approach and then provide the corresponding solution proposed by the adversarial risk analysis framework, emphasizing how to coherently assess a predictive probability model of the adversaryâs actions, in a context in which we aim at supporting decisions of a defender versus an attacker. This illustrates the application of adversarial risk analysis to basic counterterrorism models that may be used as basic building blocks for more complex risk analysis of counterterrorism problems
Aversion to ambiguity and model misspecification in dynamic stochastic environments
Preferences that accommodate aversion to subjective uncertainty and its potential misspecification in dynamic settings are a valuable tool of analysis in many disciplines. By generalizing previous analyses, we propose a tractable approach to incorporating broadly conceived responses to uncertainty. We illustrate our approach on some stylized stochastic environments. By design, these discrete time environments have revealing continuous time limits. Drawing on these illustrations, we construct recursive representations of intertemporal preferences that allow for penalized and smooth ambiguity aversion to subjective uncertainty. These recursive representations imply continuous time limiting HamiltonâJacobiâBellman equations for solving control problems in the presence of uncertainty.Published versio
- âŠ