Randomized constraint solvers: a comparative study

The complexity of constraints is a major obstacle for constraint-based software verification. Automatic constraint solvers are fundamentally incomplete: input constraints often build on some undecidable theory or some theory the solver does not support. This paper proposes and evaluates several randomized solvers to address this issue. We compared the effectiveness of a symbolic solver (CVC3), a random solver, two heuristic search solvers, and seven hybrid solvers (i.e. mix of random, symbolic, and heuristic solvers). We evaluated the solvers on a benchmark generated with a concolic execution of 9 subjects. The performance of each solver was measured by its precision, which is the fraction of constraints that the solver can find solution out of the total number of constraints that some solver can find solution. As expected, symbolic solving subsumes the other approaches for the 4 subjects that only generate decidable constraints. For the remaining 5 subjects, which contain undecidable constraints, the hybrid solvers achieved the highest precision (fraction of constraints that a solver can find a solution out of the total number of satisfiable constraints). We also observed that the solvers were complementary, which suggests that one should alternate their use in iterations of a concolic execution driver.     

Slicing the metric space to provide quick indexing of complex data in the main memory

Searching in a dataset for elements that are similar to a given query element is a core problem in applications that manage complex data, and has been aided by metric access methods (MAMs). A growing number of applications require indices that must be built faster and repeatedly, also providing faster response for similarity queries. The increase in the main memory capacity and its lowering costs also motivate using memory-based MAMs. In this paper, we propose the Onion-tree, a new and robust dynamic memory-based MAM that slices the metric space into disjoint subspaces to provide quick indexing of complex data. It introduces three major characteristics: (i) a partitioning method that controls the number of disjoint subspaces generated at each node; (ii) a replacement technique that can change the leaf node pivots in insertion operations; and (iii) range and k-NN extended query algorithms to support the new partitioning method, including a new visit order of the subspaces in k-NN queries. Performance tests with both real-world and synthetic datasets showed that the Onion-tree is very compact. Comparisons of the Onion-tree with the MM-tree and a memory-based version of the Slim-tree showed that the Onion-tree was always faster to build the index. The experiments also showed that the Onion-tree significantly improved range and k-NN query processing performance and was the most efficient MAM, followed by the MM-tree, which in turn outperformed the Slim-tree in almost all the tests.     

Reinforcement learning of pedagogical policies in adaptive and intelligent educational systems

In an adaptive and intelligent educational system (AIES), the process of learning pedagogical policies according the students needs fits as a Reinforcement Learning (RL) problem. Previous works have demonstrated that a great amount of experience is needed in order for the system to learn to teach properly, so applying RL to the AIES from scratch is unfeasible. Other works have previously demonstrated in a theoretical way that seeding the AIES with an initial value function learned with simulated students reduce the experience required to learn an accurate pedagogical policy. In this paper we present empirical results demonstrating that a value function learned with simulated students can provide the AIES with a very accurate initial pedagogical policy. The evaluation is based on the interaction of more than 70 Computer Science undergraduate students, and demonstrates that an efficient and useful guide through the contents of the educational system is obtained.     

Condition-based diagnosis of mechatronic systems using a fractional calculus approach

While fractional calculus (FC) is as old as integer calculus, its application has been mainly restricted to mathematics. However, many real systems are better described using FC equations than with integer models. FC is a suitable tool for describing systems characterised by their fractal nature, long-term memory and chaotic behaviour. It is a promising methodology for failure analysis and modelling, since the behaviour of a failing system depends on factors that increase the model’s complexity. This paper explores the proficiency of FC in modelling complex behaviour by tuning only a few parameters. This work proposes a novel two-step strategy for diagnosis, first modelling common failure conditions and, second, by comparing these models with real machine signals and using the difference to feed a computational classifier. Our proposal is validated using an electrical motor coupled with a mechanical gear reducer.     

Exploring educational immersive videogames: an empirical study with a 3D multimodal interaction prototype

ABSTRACT

Gestural interaction devices emerged and originated various studies on multimodal human–computer interaction to improve user experience (UX). However, there is a knowledge gap regarding the use of these devices to enhance learning. We present an exploratory study which analysed the UX with a multimodal immersive videogame prototype, based on a Portuguese historical/cultural episode. Evaluation tests took place in high school environments and public videogaming events. Two users would be present simultaneously in the same virtual reality (VR) environment: one as the helmsman aboard Vasco da Gama’s fifteenth-century Portuguese ship and the other as the mythical Adamastor stone giant at the Cape of Good Hope. The helmsman player wore a VR headset to explore the environment, whereas the giant player used body motion to control the giant, and observed results on a screen, with no headset. This allowed a preliminary characterisation of UX, identifying challenges and potential use of these devices in multi-user virtual learning contexts. We also discuss the combined use of such devices, towards future development of similar systems, and its implications on learning improvement through multimodal human–computer interaction.     

How to present more readable text for people with dyslexia

The presentation of a text has a significant effect on the reading speed of people with dyslexia. This paper presents a set of recommendations to customize texts on a computer screen in a more accessible way for this target group. This set is based on an eye tracking study with 92 people, 46 with dyslexia and 46 as control group, where the reading performance of the participants was measured . The following parameters were studied: color combinations for the font and the screen background, font size, column width as well as character, line and paragraph spacings. It was found that larger text and larger character spacings lead the participants with and without dyslexia to read significantly faster . The study is complemented with questionnaires to obtain the participants’ preferences for each of these parameters, finding other significant effects. These results provide evidence that people with dyslexia may benefit from specific text presentation parameters that make text on a screen more readable. So far, these recommendations based on eye tracking data are the most complete for people with dyslexia.     

On the performance of high-gain observers with gain adaptation under measurement noise

We address the problem of state observation for a system whose dynamics may involve poorly known, perhaps even nonlocally Lipschitz functions and whose output measurement may be corrupted by noise. It is known that one way to cope with all these uncertainties and noise is to use a high-gain observer with a gain adapted on-line. The proposed method, while presented for a particular case, relies on a “generic” analysis tool based on the study of differential inequalities involving quadratic functions of the error system in two coordinate frames plus the gain adaptation law. We establish that, for bounded system solutions, the estimated state and the gain are bounded. Moreover, we provide an upper bound for the mean value of the error signals as a function of the observer parameters. Since due to perturbations the gain adaptation law may drive the observer/plant interconnection to nearby boundary of its stability region, oscillatory behavior may emerge. To overcome this issue, we suggest an adaptive procedure based on a space averaging technique involving several copies of the observer.     

On singular perturbations due to fast actuators in hybrid control systems

A stability result is given for hybrid control systems singularly perturbed by fast but continuous actuators. If a hybrid control system has a compact set globally asymptotically stable when the actuator dynamics are omitted, or equivalently, are infinitely fast, then the same compact set is semiglobally practically asymptotically stable in the finite speed of the actuator dynamics. This result, which generalizes classical results for differential equations, justifies using a simplified plant model that ignores fast but continuous actuator dynamics, even when using a hybrid feedback control algorithm.     

Hierarchical type-2 neuro-fuzzy BSP model

This paper presents a novel hybrid interval type-2 neuro-fuzzy inference system, with automatic learning of all its parameters, to handle uncertainty. This new model, called hierarchical type-2 neuro-fuzzy BSP model (T2-HNFB), combines the paradigms of the type-2 fuzzy inference systems and neural networks with recursive partitioning techniques (binary space partitioning - BSP). The model is able to automatically create and expand its own structure, to reduce limitations on the number of inputs and to extract fuzzy linguistic rules from a dataset, as well as to efficiently model and manipulate most types of uncertainty existing in real situations. In addition, it provides an interval for its output, which can be regarded as a measure of uncertainty and constitutes important information for real applications. In this context, this model overcomes the limitations of the conventional type-2 and type-1 fuzzy inference systems. Experimental results show that the results provided by the T2-HNFB model are close to and in several cases better than the best results supplied by the other models used for comparison.