13,650 research outputs found
Gamification in E-Learning: game factors to strengthen specific English pronunciation features in undergraduate students at UPTC Sogamoso
Appendix A Characterization survey (104), Appendix B. EFL Students’ questionnaire (109), Appendix C. Characterization survey: data treatment question (113), Appendix D. Informed consent letter, English version (114), Appendix E. Carta de consentimiento informado, versión en español (117), Appendix F. Time Schedule (120), Appendix G. Sample Challenges at Moodle (126), Appendix H. Participants’ questionnaire results (128).La gamificación es un término que suele denotar el uso de componentes del juego en situaciones no relacionadas con el juego en sí para crear experiencias de aprendizaje agradables, divertidas y motivadoras para los estudiantes (Werbach y Hunter, 2012). Por lo tanto, el análisis de los factores básicos de los juegos se convierte en algo esencial a la hora de definir y utilizar la gamificación como estrategia de mediación del inglés como lengua extranjera para fortalecer rasgos específicos de pronunciación en los estudiantes de pregrado de la UPTC Sogamoso.
El procedimiento de estudio se basa en la investigación acción mediante la implementación de la estrategia de gamificación para la mediación en la pronunciación del inglés, orientada a treinta estudiantes de diferentes programas de ingeniería, administración y tecnología con niveles heterogéneos de dominio del inglés. Las actividades se centran principalmente en la producción de sonidos, el ritmo, el acento y la entonación, los rasgos de pronunciación segmental y suprasegmental.
Los resultados arrojaron una evidente mejora en las características segméntales y suprasegmentales de la percepción en la pronunciación de los participantes así como la contribución del objetivo de los juegos a la instrucción fonética y fonológica, la sensación en el juego a la motivación para mejorar la pronunciación, el reto establecido en los juegos a la actitud positiva de los participantes, y la sociabilidad a la exposición practica de la pronunciación inglesa.Gamification is a relatively new term that often denotes the use of game components in situations unrelated to the game itself to create enjoyable, fun, and motivating learning experiences for students (Werbach and Hunter, 2012). Therefore, analyzing the games' basic factors becomes essential when defining and using gamification as a strategy for English as Foreign Language mediation to strengthen specific pronunciation features in UPTC Sogamoso undergraduate students.
The study procedure is based on action research by implementing the gamification strategy for mediation in English pronunciation, oriented to thirty students from different engineering, management, and technology programs at heterogeneous levels of English proficiency. The activities mainly focus on sound production, rhythm, stress, and intonation, segmental and suprasegmental pronunciation features.
The results showed an evident improvement in the segmental and suprasegmental features of the participants' pronunciation perception as well as the contribution of game goals to phonetics and phonological instruction, the game sensation to the motivation for pronunciation improvement, the game challenge to the participants' positive attitude, and the sociality to the English pronunciation exposure practice
Layout optimization of structures with distributed self-weight, lumped masses and frictional supports
The well-known ‘ground structure’-based truss layout optimization method has recently been extended to allow accurate modelling of distributed self-weight. By incorporating equally stressed catenaries in the ground structure, non-conservative errors caused by neglecting bending effects within members carrying their own weight are eliminated. However, in cases where the self-weight of a structure has a favourable role in supporting the applied loads, solutions that include convoluted arrangements of overlapping elements may often be generated. To address this, an enhanced layout optimization formulation is proposed that explicitly allows inclusion of favourable unstressed masses, such as counterweights. Frictional supports are also modelled and the cost of abutments and anchorages taken account of in the formulation. The efficacy of the proposed methodology is demonstrated through application to benchmark examples and to the conceptual design of a simplified long-span bridge structure, considering both ground anchored and self-anchored alternatives
Reforming the United Nations
The thesis deals with the financial crisis that the United Nations faced starting in 1985 when the US Congress decided to withhold a significant part of the US contribution to the UN regular budget in order to force a greater say for the major contributors on budgetary issues, budgetary restraint and greater efficiency. The UN responded by the adoption of resolution 41/213 of 19 December 1986 that was based on the recommendations of a Group of High-level Intergovernmental Experts ("G-18") set up a year earlier. A new system was introduced regarding the formulation of the regular budget of the United Nations Organisation and a broader process of reform was initiated including a restructuring of the Secretariat and of the intergovernmental machinery in the economic and social fields. After an introductory chapter (Chapter I), the thesis examines the UN problems at the budgetary/financial and administrative/structural levels, the solutions proposed from within and without the United Nations established framework and the actual attempts at reform (Chapters II and ifi). The realisation that the implementation of reforms is rather disjointed and often unsuccessful (e.g. the failure to restructure the intergovernmental machi.neiy) prompts a search for the deeper causes of the UN problems at the political level and the attitudes of the main actors, namely the USA, the USSR, some up-and-coming states, notably Japan, the Third World states and, finally, of the UN Secretary-General and the Secretariat (Chapter 1V). Although the financial crisis may have subsided since 1988 and the USA seem committed to paying up their dues, the deeper UN crisis of identity has not been resolved and is expected to resurface if no bold steps are taken. In that direction, some possible alternative courses for the UN in the future are discussed drawing upon theory and practice (Chapte
Anytime algorithms for ROBDD symmetry detection and approximation
Reduced Ordered Binary Decision Diagrams (ROBDDs) provide a dense and memory efficient representation of Boolean functions. When ROBDDs are applied in logic synthesis, the problem arises of detecting both classical and generalised symmetries. State-of-the-art in symmetry detection is represented by Mishchenko's algorithm. Mishchenko showed how to detect symmetries in ROBDDs without the need for checking equivalence of all co-factor pairs. This work resulted in a practical algorithm for detecting all classical symmetries in an ROBDD in O(|G|³) set operations where |G| is the number of nodes in the ROBDD. Mishchenko and his colleagues subsequently extended the algorithm to find generalised symmetries. The extended algorithm retains the same asymptotic complexity for each type of generalised symmetry. Both the classical and generalised symmetry detection algorithms are monolithic in the sense that they only return a meaningful answer when they are left to run to completion. In this thesis we present efficient anytime algorithms for detecting both classical and generalised symmetries, that output pairs of symmetric variables until a prescribed time bound is exceeded. These anytime algorithms are complete in that given sufficient time they are guaranteed to find all symmetric pairs. Theoretically these algorithms reside in O(n³+n|G|+|G|³) and O(n³+n²|G|+|G|³) respectively, where n is the number of variables, so that in practice the advantage of anytime generality is not gained at the expense of efficiency. In fact, the anytime approach requires only very modest data structure support and offers unique opportunities for optimisation so the resulting algorithms are very efficient. The thesis continues by considering another class of anytime algorithms for ROBDDs that is motivated by the dearth of work on approximating ROBDDs. The need for approximation arises because many ROBDD operations result in an ROBDD whose size is quadratic in the size of the inputs. Furthermore, if ROBDDs are used in abstract interpretation, the running time of the analysis is related not only to the complexity of the individual ROBDD operations but also the number of operations applied. The number of operations is, in turn, constrained by the number of times a Boolean function can be weakened before stability is achieved. This thesis proposes a widening that can be used to both constrain the size of an ROBDD and also ensure that the number of times that it is weakened is bounded by some given constant. The widening can be used to either systematically approximate an ROBDD from above (i.e. derive a weaker function) or below (i.e. infer a stronger function). The thesis also considers how randomised techniques may be deployed to improve the speed of computing an approximation by avoiding potentially expensive ROBDD manipulation
Bitcoin as a Digital Commodity
The paper demonstrates that Bitcoin is not money but rather a digital commodity that has value but no value-added. We show that both the production of and the speculation with Bitcoin draw from the existing global pool of value-added. By extending the Classical Political Economy approach and the New Interpretation of the labour theory of value to the domain of digital commodities, the paper argues that Bitcoin mining is an automated reproduction process that requires no direct (living) labour and thus creates no new value. Bitcoin, in this regard, is not ‘digital gold’. Between sectors, Bitcoin mining redistributes wealth and value-added already in existence, while Bitcoin miners with more computational power compete to appropriate the mining profits within the blockchain. The Bitcoin blockchain then creates rivalry in both the ownership and the use of the digital commodity through non-legal means. Our approach can be further expanded to the larger domain of automated digital commodities that are reproducible without the expenditure of direct, living labour
Adaptive task selection using threshold-based techniques in dynamic sensor networks
Sensor nodes, like many social insect species, exist in harsh environments in large groups, yet possess very limited amount of resources. Lasting for as long as possible, and fulfilling the network purposes are the ultimate goals of sensor networks. However, these goals are inherently contradictory. Nature can be a great source of inspiration for mankind to find methods to achieve both extended survival, and effective operation. This work aims at applying the threshold-based action selection mechanisms inspired from insect societies to perform action selection within sensor nodes. The effect of this micro-model on the macro-behaviour of the network is studied in terms of durability and task performance quality. Generally, this is an example of using bio-inspiration to achieve adaptivity in sensor networks
Meta‐analysis and traditional systematic literature reviews—What, why, when, where, and how?
Meta‐analysis is a research method for systematically combining and synthesizing findings from multiple quantitative studies in a research domain. Despite its importance, most literature evaluating meta‐analyses are based on data analysis and statistical discussions. This paper takes a holistic view, comparing meta‐analyses to traditional systematic literature reviews. We described steps of the meta‐analytic process including question definition, data collection, data analysis, and reporting results. For each step, we explain the primary purpose, the tasks required of the meta‐analyst, and recommendations for best practice. Finally, we discuss recent developments in meta‐analytic techniques, which increase its effectiveness in business research
On the readability of machine checkable formal proofs
It is possible to implement mathematical proofs in a machine-readable language. Indeed, certain proofs, especially those deriving properties of safety-critical systems, are often required to be checked by machine in order to avoid human errors. However, machine checkable proofs are very hard to follow by a human reader. Because of their unreadability, such proofs are hard to implement, and more difficult still to maintain and modify. In this thesis we study the possibility of implementing machine checkable proofs in a more readable format. We design a declarative proof language, SPL, which is based on the Mizar language. We also implement a proof checker for SPL which derives theorems in the HOL system from SPL proof scripts. The language and its proof checker are extensible, in the sense that the user can modify and extend the syntax of the language and the deductive power of the proof checker during the mechanisation of a theory. A deductive database of trivial knowledge is used by the proof checker to derive facts which are considered trivial by the developer of mechanised theories so that the proofs of such facts can be omitted. We also introduce the notion of structured straightforward justifications, in which simple facts, or conclusions, are justified by a number of premises together with a number of inferences which are used in deriving the conclusion from the given premises. A tableau prover for first-order logic with equality is implemented as a HOL derived rule and used during the proof checking of SPL scripts. The work presented in this thesis also includes a case study involving the mechanisation of a number of results in group theory in SPL, in which the deductive power of the SPL proof checker is extended throughout the development of the theory
Recommended from our members
Choosers: A Visual Programming Language for Nondeterministic Music Composition by Non-Programmers
This thesis focuses on the design of Choosers, a prototype algorithmic programming system centred around a new abstraction (of the same name) designed to allow non-programmers access to nondeterministic music composition methods.
Algorithmic composition typically involves structural elements such as indeterminism, parallelism, choice, multi-choice, nesting, weighting, and looping. There are powerful existing tools for manipulating these and other elements of music. However, while these systems give substantial compositional power to musicians who are also skilled programmers, many musicians who lack programming skills find these tools inaccessible and difficult to understand and use. This thesis presents the design and evaluation of a prototype visual programming language designed to allow structural elements of the kind involved in nondeterministic music composition to be readily visualised and manipulated, while making little or no demand on programming ability.
Initially, a Cognitive Dimensions of Notations review of a representative selection of user interfaces for algorithmic composition software was conducted. The review led to a set of findings used to identify candidate design principles which were then tested via a series of design exercises. The findings from these design exercises led to the development of a new abstraction, the Chooser, via a series of iterative design cycles. Once a candidate design had been finalised it was evaluated with participants via two sets of programming walkthroughs, with the findings from each step used to refine the formalism. The final study used Choosers as a design probe through a series of interviews with domain experts in which manipulable compositions were introduced to prompt discussions on potential future implications for music computing education, music production, and music composition
- …