Abstract

The number of available 3D digital objects has been increasing considerably. As such, searching in large collections has been subject of vast research. However, the main focus has been on algorithms and techniques for classification, indexing and retrieval. While some works have been done on query interfaces and results visualization, they do not explore natural interactions. The authors propose a speech interface for 3D object retrieval in immersive virtual environments. As a proof of concept, they developed the LS3D prototype, using the context of LEGO blocks to understand how people naturally describe such objects. Through a preliminary study, it was found that participants mainly resorted to verbal descriptions. Considering these descriptions and using a low cost visualization device, the authors developed their solution. They compared it with a commercial application through a user evaluation. Results suggest that LS3D can outperform its contestant, and ensures better performance and results perception than traditional approaches for 3D object retrieval.

Abstract
Virtual meetings have become increasingly common with modern video-conference and collaborative software. While they allow obvious savings in time and resources, current technologies add unproductive layers of protocol to the flow of communication between participants, rendering the interactions far from seamless. In this work we introduce Remote Proxemics, an extension of proxemics aimed at bringing the syntax of co-located proximal interactions to virtual meetings. We propose Eery Space, a shared virtual locus that results from merging multiple remote areas, where meeting participants' are located side-by-side as if they shared the same physical location. Eery Space promotes collaborative content creation and seamless mediation of communication channels based on virtual proximity. Results from user evaluation suggest that our approach is sufficient to initiate proximal exchanges regardless of their geolocation, while promoting smooth interactions between local and remote people alike.

Abstract
Developments in advanced autonomous production resources have increased the interest in the Single-Machine Scheduling Problem (SMSP). Until now, researchers used SMSP with little to no practical application in industry, but with the introduction of multi-purpose machines, able of executing an entire task, such as 3D Printers, replacing extensive production chains, single-machine problems are becoming a central point of interest in real-world scheduling. In this paper we study how simple, easy to implement, Just-in-Time (JIT) based, constructive heuristics, can be used to optimize customer and enterprise oriented performance measures. Customer oriented performance measures are mainly related to the accomplishment of due dates while enterprise-oriented ones typically consider other time-oriented measures.

Abstract
Optimization in current decision support systems has a highly interdisciplinary nature related with the need to integrate different techniques and paradigms for solving real-world complex problems. Computing optimal solutions in many of these problems are unmanageable. Heuristic search methods are known to obtain good results in an acceptable time interval. However, parameters need to be adjusted to allow good results. In this sense, learning strategies can enhance the performance of a system, providing it with the ability to learn, for instance, the most suitable optimization technique for solving a particular class of problems, or the most suitable parameterization of a given algorithm on a given scenario. Hyper-heuristics arise in this context as efficient methodologies for selecting or generating (meta) heuristics to solve NP-hard optimization problems. This paper presents the specification of a hyper-heuristic for selecting techniques inspired in nature, for solving the problem of scheduling in manufacturing systems, based on previous experience. The proposed hyper-heuristic module uses a reinforcement learning algorithm, which enables the system with the ability to autonomously select the meta-heuristic to use in optimization process as well as the respective parameters. A computational study was carried out to evaluate the influence of the hyper-heuristics on the performance of a scheduling system. The obtained results allow to conclude about the effectiveness of the proposed approach.

Abstract
Metaheuristics are very useful to achieve good solutions in reasonable execution times. Sometimes they even obtain optimal solutions. However, to achieve near-optimal solutions, the appropriate tuning of parameters is required. This paper presents a Racing based learning module proposal for an autonomous parameter tuning of Metaheuristics. After a literature review on Metaheuristics parameter tuning and Racing approaches, the learning module is presented. A computational study for the resolution of the Scheduling problem is also presented. Comparing the preliminary obtained results with previous published results allow to conclude about the effectiveness and efficiency of this proposal. © 2015 AISTI.

Abstract
Manufacturing environments require a real-time adaptation and optimization method to dynamically and intelligently maintain the current scheduling plan feasible. This way, the organization keeps clients satisfied and achieves its objectives (costs are minimized and profits maximized). This paper proposes an optimization approach - Selection Constructive based Hyper-heuristic for Dynamic Scheduling - to deal with these dynamic events, with the main goal of maintaining the current scheduling plan feasible and robust as possible. The development of this dynamic adaptation approach is inspired on evolutionary computation and hyper-heuristics. Our empirical results show that a selection constructive hyper-heuristic could be advantageous on solving dynamic adaptation optimization problems. © 2015 AISTI.