Gaze tutor: A gaze-reactive intelligent tutoring system

We developed an intelligent tutoring system (ITS) that aims to promote engagement and learning by dynamically detecting and responding to students' boredom and disengagement. The tutor uses a commercial eye tracker to monitor a student's gaze patterns and identify when the student is bored, disengaged, or is zoning out. The tutor then attempts to reengage the student with dialog moves that direct the student to reorient his or her attentional patterns towards the animated pedagogical agent embodying the tutor. We evaluated the efficacy of the gaze-reactive tutor in promoting learning, motivation, and engagement in a controlled experiment where 48 students were tutored on four biology topics with both gaze-reactive and non-gaze-reactive (control condition) versions of the tutor. The results indicated that: (a) gaze-sensitive dialogs were successful in dynamically reorienting students’ attentional patterns to the important areas of the interface, (b) gaze-reactivity was effective in promoting learning gains for questions that required deep reasoning, (c) gaze-reactivity had minimal impact on students’ state motivation and on self-reported engagement, and (d) individual differences in scholastic aptitude moderated the impact of gaze-reactivity on overall learning gains. We discuss the implications of our findings, limitations, future work, and consider the possibility of using gaze-reactive ITSs in classrooms.     

Is implementation of continuous improvement possible? An evolutionary model of enablers and inhibitors

The purpose of this article is to present an evolutionary model of the enablers and inhibitors affecting the implementation and sustainability of continuous improvement. With this aim, a qualitative study using the grounded theory was carried out. Interviews were conducted with managers responsible for continuous improvement in first‐tier suppliers in the automotive sector. As a result, two existing lines of research in the continuous improvement literature are synthesized: on one hand, the literature concerning the enablers and barriers associated with continuous improvement sustainability; and on the other, the literature concerning the evolutionary model. © 2011 Wiley Periodicals, Inc.     

Types and associated type families for hardware simulation and synthesis

In this article we overview the design and implementation of the second generation of Kansas Lava. Driven by the needs and experiences of implementing telemetry decoders and other circuits, we have made a number of improvements to both the external API and the internal representations used. We have retained our dual shallow/deep representation of signals in general, but now have a number of externally visible abstractions for combinatorial and sequential circuits, and enabled signals. We introduce these abstractions, as well as our abstractions for reading and writing memory. Internally, we found the need to represent unknown values inside our circuits, so we made aggressive use of associated type families to lift our values to allow unknowns, in a principled and regular way. We discuss this design decision, how it unfortunately complicates the internals of Kansas Lava, and how we mitigate this complexity. Finally, when connecting Kansas Lava to the real world, the standardized idiom of using named input and output ports is provided by Kansas Lava using a new monad, called Fabric. We present the design of this Fabric monad, and illustrate its use in a small but complete example.     

Environmental-aware virtual data center network

Cloud computing services have recently become a ubiquitous service delivery model, covering a wide range of applications from personal file sharing to being an enterprise data warehouse. Building green data center networks providing cloud computing services is an emerging trend in the Information and Communication Technology (ICT) industry, because of Global Warming and the potential GHG emissions resulting from cloud services. As one of the first worldwide initiatives provisioning ICT services entirely based on renewable energy such as solar, wind and hydroelectricity across Canada and around the world, the GreenStar Network (GSN) was developed to dynamically transport user services to be processed in data centers built in proximity to green energy sources, reducing Greenhouse Gas (GHG) emissions of ICT equipments. Regarding the current approach, which focuses mainly in reducing energy consumption at the micro-level through energy efficiency improvements, the overall energy consumption will eventually increase due to the growing demand from new services and users, resulting in an increase in GHG emissions. Based on the cooperation between Mantychore FP7 and the GSN, our approach is, therefore, much broader and more appropriate because it focuses on GHG emission reductions at the macro-level. This article presents some outcomes of our implementation of such a network model, which spans multiple green nodes in Canada, Europe and the USA. The network provides cloud computing services based on dynamic provision of network slices through relocation of virtual data centers.     

Vectorized garbage collection

Garbage collection can be done in vector mode on supercomputers like the CRAY-2 and the Cyber 205. Both copying collection and mark-and-sweep can be expressed as breadth-first searches in which the queue can be processed in parallel. We have designed a copying garbage collector whose inner loop works entirely in vector mode. We give performance measurements of the algorithm as implemented for Lisp CONS cells on the Cyber 205. Vector-mode garbage collection performs up to nine times faster than scalar-mode collection-a worthwhile improvement.Supported in part by NSF Grants DCR-8603543 and CCR-8806121, and by a Digital Equipment Corp. Faculty Incentive Grant.Supported by the NSF Research Experiences for Undergraduates program.     

Randomized function evaluation on a ring

LetR be a unidirectional asynchronous ring ofn identical processors each with a single input bit. Letf be any cyclic nonconstant function ofn boolean variables. Moran and Warmuth (1986) prove that anydeterministic algorithm that evaluatesf onR has communication complexity (n logn) bits. They also construct a family of cyclic nonconstant boolean functions that can be evaluated inO(n logn) bits by a deterministic algorithm.This contrasts with the following new results:

The dielectric response of doped semiconducting glasses

Measurements are reported of the dielectric properties of two semiconducting glasses of composition SiO₂ · Na₂O with admixtures of Sb_{2O 5} and SnO₂, covering a wide range of temperatures and a range of six decades of frequency 10^–2 to 10⁴ Hz. Both glasses show a gradual evolution of growing low frequency dispersion (LFD) with increasing temperature, with both the real and imaginary components of the complex susceptibility following a power law of the type ^n–1, with n 1 at the lowest frequencies. There are also clear indications of reversible phase transitions taking place which manifest themselves by changes in the spectral shape of the dielectric response.     

Discrete logarithms inGF(p)

Several related algorithms are presented for computing logarithms in fieldsGF(p),p a prime. Heuristic arguments predict a running time of exp((1+o(1)) ) for the initial precomputation phase that is needed for eachp, and much shorter running times for computing individual logarithms once the precomputation is done. The running time of the precomputation is roughly the same as that of the fastest known algorithms for factoring integers of size aboutp. The algorithms use the well known basic scheme of obtaining linear equations for logarithms of small primes and then solving them to obtain a database to be used for the computation of individual logarithms. The novel ingredients are new ways of obtaining linear equations and new methods of solving these linear equations by adaptations of sparse matrix methods from numerical analysis to the case of finite rings. While some of the new logarithm algorithms are adaptations of known integer factorization algorithms, others are new and can be adapted to yield integer factorization algorithms.     

Analysis and tuning of adaptive generalized predictive control

The adaptive Generalized Predictive Controller (Clarke et al., 1987a, b) is capable of controlling plants with variable dead-time, unknown model orders and unstable poles and zeros. This paper shows how the GPC control law can be written in an equivalent general linear transfer function form which simplifies closed-loop (eg. root locus) analysis. Three recommended strategies for selecting the design parameters during the commissioning stage allow the user to adjust the closed-loop speed of response on-line using only a single active tuning parameter. Experimental runs confirm the ability of adaptive GPC to provide a consistent closed-loop response in spite of large process changes.     

Platinum particle size effect on the oxidative dehydrogenation of aqueous ethanol

The effect of the platinum particle size was investigated for the catalytic oxidative dehydrogenation of aqueous ethanol to ethanal at a temperature of 303 K, an ethanol concentration of 260 mol m^–3, a partial oxygen pressure 60 kPa, a pH of 9, and an ethanal and ethanoate concentration of 20 mol m^–3. A particle size effect on the turnover frequency was observed but only for particle sizes smaller than 2 nm. Hence, the reaction shows a limited structure sensitivity.