Search results for "Hard"

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.

Comparative analysis of architectures for monitoring cloud computing infrastructures

2015

The lack of control over the cloud resources is one of the main disadvantages associated to cloud computing. The design of efficient architectures for monitoring such resources can help to overcome this problem. This contribution describes a complete set of architectures for monitoring cloud computing infrastructures, and provides a taxonomy of them. The architectures are described in detail, compared among them, and analysed in terms of performance, scalability, usage of resources, and security capabilities. The architectures have been implemented in real world settings and empirically validated against a real cloud computing infrastructure based on OpenStack. More than 1000 virtual machin…

Corrigendum to “Imaginary time propagation code for large-scale two-dimensional eigenvalue problems in magnetic fields” [Comput. Phys. Comm. 184(3) (…

2016

Evaluation of legendre functions of argument greater than one

1997

Abstract In this paper we present an algorithm to evaluate Legendre functions of the first and second kinds ( P v , Q v ) for integraland half-integral order and argument greater than one. The code is based on the calculation of the continued fraction for the Q 's. the Wronskian relating P 's and Q 's and the application of forward recurrence relations for the P 's and backward recurrence for the Q 's. We also show an application of these algorithms to the evaluation of the electrostatic field due to a charged toroidal conductor at potential V .

Modeling visual sampling on in-car displays: The challenge of predicting safety-critical lapses of control

2015

In this article, we study how drivers interact with in-car interfaces, particularly by focusing on understanding driver in-car glance behavior when multitasking while driving. The work focuses on using an in-car touch screen to find a target item from a large number of unordered visual items spread across multiple screens. We first describe a cognitive model that aims to represent a driver?s visual sampling strategy when interacting with an in-car display. The proposed strategy assumes that drivers are aware of the passage of time during the search task; they try to adjust their glances at the display to a time limit, after which they switch back to the driving task; and they adjust their t…