The SL synchronous language

We present SL, a new programming language of the synchronous reactive family in which hypotheses about signal presence/absence are disallowed. One can decide that a signal is absent during an instant only at the end of this instant, and so reaction to this absence is delayed to the next instant. Sources of causal circularities are avoided, while only weak preemption remains. A structural operational semantics is provided through rewrite rules, and an implementation is described. In addition to directly executing programs, this implementation can also be used to produce automata by symbolic evaluation     

Resolution proof transformation for compression and interpolation

Verification methods based on SAT, SMT, and theorem proving often rely on proofs of unsatisfiability as a powerful tool to extract information in order to reduce the overall effort. For example a proof may be traversed to identify a minimal reason that led to unsatisfiability, for computing abstractions, or for deriving Craig interpolants. In this paper we focus on two important aspects that concern efficient handling of proofs of unsatisfiability: compression and manipulation. First of all, since the proof size can be very large in general (exponential in the size of the input problem), it is indeed beneficial to adopt techniques to compress it for further processing. Secondly, proofs can be manipulated as a flexible preprocessing step in preparation for interpolant computation. Both these techniques are implemented in a framework that makes use of local rewriting rules to transform the proofs. We show that a careful use of the rules, combined with existing algorithms, can result in an effective simplification of the original proofs. We have evaluated several heuristics on a wide range of unsatisfiable problems deriving from SAT and SMT test cases.     

When simulated environments make the difference: the effectiveness of different types of training of car service procedures

An empirical analysis was performed to compare the effectiveness of different approaches to training a set of procedural skills to a sample of novice trainees. Sixty-five participants were randomly assigned to one of the following three training groups: (1) learning-by-doing in a 3D desktop virtual environment, (2) learning-by-observing a video (show-and-tell) explanation of the procedures, and (3) trial-and-error. In each group, participants were trained on two car service procedures. Participants were recalled to perform a procedure either 2 or 4 weeks after the training. The results showed that: (1) participants trained through the virtual approach of learning-by-doing performed both procedures significantly better (i.e. p < .05 in terms of errors and time) than people of non-virtual groups, (2) the virtual training group, after a period of non-use, were more effective than non-virtual training (i.e. p < .05) in their ability to recover their skills, (3) after a (simulated) long period from the training—i.e. up to 12 weeks—people who experienced 3D environments consistently performed better than people who received other kinds of training. The results also suggested that independently from the training group, trainees’ visuospatial abilities were a predictor of performance, at least for the complex service procedure, adj R ² = .460, and that post-training performances of people trained through virtual learning-by-doing are not affected by learning styles. Finally, a strong relationship (p < .001, R ² = .441) was identified between usability and trust in the use of the virtual training tool—i.e. the more the system was perceived as usable, the more it was perceived as trustable to acquire the competences.     

On vector averaging over the unit hypersphere

Sample averaging is a commonly used way to smooth out irregularities of data and to get rid of random fluctuations in measurements analysis. In adaptive signal processing, where an adaptive system learns its own parameters in order to perform a predefined task, the learnt parameters-pattern may depend on the initial learning state and on the fluctuations of the statistical features of the input signals to the system. In adaptive system learning, averaging may be employed as a method to merge several learnt parameters-patterns in order to get a better representative pattern. Even in the case of scalar parameters, the concept of averaging is not uniquely defined as scalar parameters spaces may exhibit a rich structure to be dealt with. The case of multiple parameter patterns where single parameters are mutually constrained to each other may exhibit an even richer structure. In the present paper, we deal with the case of parameters-patterns belonging to the unit hypersphere and develop an averaging technique based on the differential geometrical structure of such a curved space. Numerical experiments illustrate the behavior of the developed averaging algorithm.     

Asymptotic switched composite adaptive control with application to robotic interaction tasks

This article proposes a new switched adaptive control design for uncertain switched systems with composite (time-driven and state-dependent) switching and shows its applicability in switched impedance control. A composite switched adaptive control design, consisting of the direct switched adaptive control and the indirect switched adaptive control counterpart, is developed to improve the control performance. Specifically, a new stability condition for composite switching is proposed by making use of differential matrix equations and Sylvester matrix equations, which are a generalization of Lyapunov matrix equations. The design results in a time-varying multiple Lyapunov function that is decreasing at the switching instants. From the theoretical point of view, the relevance of this work is the construction of the adaptive laws that guarantee asymptotic tracking error and asymptotic estimation for the direct and indirect switched adaptive control loops, respectively. From the practical point of view, the relevance of this work is validated in a new switched impedance control for the robot interaction with uncertain and discontinuous environments.     

An octree-based,cartesian navier–stokes solver for modern cluster architectures

The Journal of Supercomputing - Adaptive Cartesian mesh approaches have proven useful for multi-scale applications where particular features can be finely resolved within a large solution domain....     

Light‐Activated,Multi‐Semiconductor Hybrid Microswimmers

Using a dynamic fabrication process, hybrid, photoactivated microswimmers made from two different semiconductors, titanium dioxide (TiO₂) and cuprous oxide (Cu₂O) are developed, where each material occupies a distinct portion of the multiconstituent particles. Structured light‐activated microswimmers made from only TiO₂ or Cu₂O are observed to be driven in hydrogen peroxide and water most vigorously under UV or blue light, respectively, whereas hybrid structures made from both of these materials exhibit wavelength‐dependent modes of motion due to the disparate responses of each photocatalyst. It is also found that the hybrid particles are activated in water alone, a behavior which is not observed in those made from a single semiconductor, and thus, the system may open up a new class of fuel‐free photoactive colloids that take advantage of semiconductor heterojunctions. The TiO₂/Cu₂O hybrid microswimmer presented here is but an example of a broader method for inducing different modes of motion in a single light‐activated particle, which is not limited to the specific geometries and materials presented in this study.     

Swarm Intelligence Approaches for Grid Load Balancing

With the rapid growth of data and computational needs, distributed systems and computational Grids are gaining more and more attention. The huge amount of computations a Grid can fulfill in a specific amount of time cannot be performed by the best supercomputers. However, Grid performance can still be improved by making sure all the resources available in the Grid are utilized optimally using a good load balancing algorithm. This research proposes two new distributed swarm intelligence inspired load balancing algorithms. One algorithm is based on ant colony optimization and the other algorithm is based on particle swarm optimization. A simulation of the proposed approaches using a Grid simulation toolkit (GridSim) is conducted. The performance of the algorithms are evaluated using performance criteria such as makespan and load balancing level. A comparison of our proposed approaches with a classical approach called State Broadcast Algorithm and two random approaches is provided. Experimental results show the proposed algorithms perform very well in a Grid environment. Especially the application of particle swarm optimization, can yield better performance results in many scenarios than the ant colony approach.     

Evaluation of artery visualizations for heart disease diagnosis

Heart disease is the number one killer in the United States, and finding indicators of the disease at an early stage is critical for treatment and prevention. In this paper we evaluate visualization techniques that enable the diagnosis of coronary artery disease. A key physical quantity of medical interest is endothelial shear stress (ESS). Low ESS has been associated with sites of lesion formation and rapid progression of disease in the coronary arteries. Having effective visualizations of a patient's ESS data is vital for the quick and thorough non-invasive evaluation by a cardiologist. We present a task taxonomy for hemodynamics based on a formative user study with domain experts. Based on the results of this study we developed HemoVis, an interactive visualization application for heart disease diagnosis that uses a novel 2D tree diagram representation of coronary artery trees. We present the results of a formal quantitative user study with domain experts that evaluates the effect of 2D versus 3D artery representations and of color maps on identifying regions of low ESS. We show statistically significant results demonstrating that our 2D visualizations are more accurate and efficient than 3D representations, and that a perceptually appropriate color map leads to fewer diagnostic mistakes than a rainbow color map.