Search results for "RDW"
showing 10 items of 1401 documents
Check in–check out intervention for supporting pupils’ behaviour: effectiveness and feasibility in Finnish schools
2018
Check In–Check Out (CICO) is a support programme for students with externalising problem behaviours. This study implemented in Finland is one of the first reports on the application of CICO in the European context. An experimental, multiple-baseline, single-case design is used to examine the effects of the CICO intervention on the problem behaviour and appropriate behaviour of three general education primary school pupils. The similarity of the observation data and the information provided in daily report card (DRC) are investigated to gauge the validity of the DRC assessments. The fidelity and social validity of the intervention are also analysed. CICO reduced problem behaviour in all pupi…
Exploiting seeding of random number generators for efficient domain decomposition parallelization of dissipative particle dynamics
2013
Abstract Dissipative particle dynamics (DPD) is a new promising method commonly used in coarse-grained simulations of soft matter and biomolecular systems at constant temperature. The DPD thermostat involves the evaluation of stochastic or random forces between pairs of neighboring particles in every time step. In a parallel computing environment, the transfer of these forces from node to node can be very time consuming. In this paper we describe the implementation of a seeded random number generator with three input seeds at each step which enables the complete generation of the pairwise stochastic forces in parallel DPD simulations with minimal communication between nodes.
Solution Processed Micro- and Nano-Bioarrays for Multiplexed Biosensing
2012
This Feature article reports on solution dispensing methodologies which enable the realization of multiplexed arrays at the micro- and nanoscale for relevant biosensing applications such as drug screening or cellular chips.
Coherence resonance in Bonhoeffer-Van der Pol circuit
2009
International audience; A nonlinear electronic circuit simulating the neuronal activity in a noisy environment is proposed. This electronic circuit is exactly ruled by the set of Bonhoeffer-Van Der Pol equations and is excited with a Gaussian noise. Without external deterministic stimuli, it is shown that the circuit exhibits the so-called 'coherence resonance' phenomenon.
Fitbit for learning: Towards capturing the learning experience using wearable sensing
2020
The assessment of learning during class activities mostly relies on standardized questionnaires to evaluate the efficacy of the learning design elements. However, standardized questionnaires pose additional strain on students, do not provide “temporal” information during the learning experience, require considerable effort and language competence, and sometimes are not appropriate. To overcome these challenges, we propose using wearable devices, which allow for continuous and unobtrusive monitoring of physiological parameters during learning. In this paper we set out to quantify how well we can infer students’ learning experience from wrist-worn devices capturing physiological data. We coll…
Nanomagnetic Self-Organizing Logic Gates
2021
The end of Moore's law for CMOS technology has prompted the search for low-power computing alternatives, resulting in several promising proposals based on magnetic logic[1-8]. One approach aims at tailoring arrays of nanomagnetic islands in which the magnetostatic interactions constrain the equilibrium orientation of the magnetization to embed logical functionalities[9-12]. Despite the realization of several proofs of concepts of such nanomagnetic logic[13-15], it is still unclear what the advantages are compared to the widespread CMOS designs, due to their need for clocking[16, 17] and/or thermal annealing [18,19] for which fast convergence to the ground state is not guaranteed. In fact, i…
A family of experiments to generate graphical user interfaces from BPMN models with stereotypes
2021
Abstract Context: A significant gap separates Business Process Model and Notation (BPMN) models representing processes from the design of Graphical User Interfaces (GUIs). Objective: This paper reports on a family of experiments to validate a method to automatically generate GUIs from BPMN models using stereotypes complemented with UML class primitives, and transformation rules. Method: We conducted two replications (23 and 31 subjects respectively) in which we compared two methods to generate GUIs from BPMN models; one automatic (using Stereotyped BPMN models) and one manual (using Non-stereotyped BPMN models). The study focuses on comparing effort, accuracy, and satisfaction (in terms of …
Noise-tolerant efficient inductive synthesis of regular expressions from good examples
1997
We present an almost linear time method of inductive synthesis restoring simple regular expressions from one representative (good) example. In particular, we consider synthesis of expressions of star-height one, where we allow one union operation under each iteration, and synthesis of expressions without union operations from examples that may contain mistakes. In both cases we provide sufficient conditions defining precisely the class of target expressions and the notion of good examples under which the synthesis algorithm works correctly, and present the proof of correctness. In the case of expressions with unions the proof is based on novel results in the combinatorics of words. A genera…
Model approximation for two-dimensional Markovian jump systems with state-delays and imperfect mode information
2014
Published version of an article in the journal: Multidimensional Systems and Signal Processing. Also available from the publisher at: http://dx.doi.org/10.1007/s11045-013-0276-x This paper is concerned with the problem of {Mathematical expression} model approximation for a class of two-dimensional (2-D) discrete-time Markovian jump linear systems with state-delays and imperfect mode information. The 2-D system is described by the well-known Fornasini-Marchesini local state-space model, and the imperfect mode information in the Markov chain simultaneously involves the exactly known, partially unknown and uncertain transition probabilities. By using the characteristics of the transition proba…
On the chromatic number of disk graphs
1998
Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.