TimeMesh: an educational historical game

The TIMEMESH game, developed in the scope of the European Project SELEAG, is an educational game for learning history, culture and social relations. It is supported by an extensible, online, multi-language, multi-player, collaborative and social platform for sharing and acquiring knowledge of the history of European regions. The game has been already used, with remarkable success, in different European countries like Portugal, Spain, England, Slovenia, Estonia and Belgium.

A historical perspective of legged robots

The objective of this paper is to present the evolution and the state-of-the-art in the area of legged locomotion systems. In a first phase different possibilities for implementing mobile robots are discussed, namely the case of artificial legged locomotion systems, while emphasizing their advantages and limitations. In a second phase a historical overview of the evolution of these systems is presented, bearing in mind several particular cases often considered as milestones of technological and scientific progress. After this historical timeline, some of the present-day systems are examined and their performance is analyzed. In a third phase the major areas of research and development that are presently being followed in the construction of legged robots are pointed out. Finally, some still unsolved problems that remain defying robotics research, are also addressed.

Multiple Roots of Systems of Equations by Repulsion Merit Functions

In this paper we address the problem of computing multiple roots of a system of nonlinear equations through the global optimization of an appropriate merit function. The search procedure for a global minimizer of the merit function is carried out by a metaheuristic, known as harmony search, which does not require any derivative information. The multiple roots of the system are sequentially determined along several iterations of a single run, where the merit function is accordingly modified by penalty terms that aim to create repulsion areas around previously computed minimizers. A repulsion algorithm based on a multiplicative kind penalty function is proposed. Preliminary numerical experiments with a benchmark set of problems show the effectiveness of the proposed method.

Testing Nelder-Mead Based Repulsion Algorithms for Multiple Roots of Nonlinear Systems via a Two-Level Factorial Design of Experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.