2020
Autores
Cruz, A; Paredes, H; Morgado, L; Martins, P;
Publicação
JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Abstract
Virtual worlds, particularly those able to provide a three-dimensional physical space, have features that make them suitable to support collaborative activities. These features distinguish virtual worlds from other collaboration tools, but current taxonomies of the field of Computer-Supported Cooperative Work do not account for several distinctive features of virtual worlds, namely those related with non-verbal communication. We intended to find out how the use of an avatar, gestures, spatial sounds, etc., influence collaboration in order to be able to include non-verbal communication in taxonomies of the field Computer-Supported Cooperative Work. Several cases of collaboration in virtual worlds are analysed, to find the impact of these non-verbal characteristics of virtual worlds. We proposed adding the concept of Presence to taxonomies of Computer-Supported Cooperative Work and contribute with guidance for future taxonomy development that includes it as a new dimension. This new dimension of Presence is subdivided into "avatar" and "physical space" subdimensions. In turn, these are divided into "physical appearance", "gestures, sounds and animations" and "focus, nimbus and aura"; "environment" and "objects / artefacts". This new taxonomy-development proposal may contribute to inform better design of virtual worlds in support of cooperative work.
2020
Autores
Coelho, J; Vanhoucke, M;
Publicação
COMPUTERS & OPERATIONS RESEARCH
Abstract
The resource-constrained project scheduling problem (RCPSP) is one of the most studied problems in the project scheduling literature, and aims at constructing a project schedule with a minimum makespan that satisfies both the precedence relations of the network and the limited availability of the renewable resources. The problem has attracted attention due to its NP hardness status, and different algorithms have been proposed that solve a wide variety of RCPSP instances to optimality or near-optimality. In this paper, we analyse the hardness of this problem from an experimental point-of-view by testing different algorithms on a huge set of existing instances and detect which ones are difficult to solve. To that purpose, we propose a three-phased approach that makes use of five elementary blocks, well-performing algorithms and a huge amount of computational power to transform easy RCPSP instances into very hard ones. The purpose of this study is to create insight and understanding into what makes an RCPSP instance hard, and propose a new dataset that consists of a small set of instances that are impossible to solve with the algorithms currently existing in the literature. These instances should be as small as possible in terms of number of activities and resources, and should be as diverse as possible in terms of network structure and resource strictness. Such a dataset should enable researchers to focus their attention on the development of radically new algorithms to solve the RCPSP rather than gradually improving current algorithms that can solve the existing RCPSP instances only slightly better.
2020
Autores
Henriques, AA; Camanho, AS; Amorim, P; Silva, JG;
Publicação
UTILITIES POLICY
Abstract
This paper develops a benchmarking framework to support performance-based sunshine regulation in the water sector. It uses benefit-of-the-doubt composite indicators formulated with a directional distance function. Weight restrictions are incorporated in the model to account for different perspectives in the performance assessment. The framework is tested using data of the Portuguese regulation authority concerning the activity of wastewater operators. The information obtained using this framework reflects overall performance at the firm level and complements traditional evaluations of regulatory authorities based on the analysis of individual indicators. The results can be used to disseminate best practices, motivate continuous improvement, and foster enhancements in the governance of regulated utilities.
2020
Autores
Schlemmer, E; Morgado, LC; Moreira, JAM;
Publicação
INTERFACES DA EDUCAÇÃO
Abstract
2020
Autores
Beck, D; Morgado, L; O'Shea, P;
Publicação
JOURNAL OF UNIVERSAL COMPUTER SCIENCE
Abstract
Advancing the field of research in Immersive Learning Environments requires avoiding the pitfalls of previous educational technologies. Studies must consider the actual use of these environments and the context where it occurs, not simply the technocentric perspectives on these environments. This paper provides an overview and analysis of surveys on this topic, in order to map the field and find out which information on actual uses of Immersive Learning Environments are reported, and hence which gaps need to be covered towards a robust, encompassing knowledge on their relationship with learning. Collected accounts of use were clustered via thematic analysis and contrasted with research areas in learning and technology, highlighting the gaps in the field and serving as a blueprint for research agendas on uses of immersive learning environments.
2020
Autores
Leao, AAS; Toledo, FMB; Oliveira, JF; Carravilla, MA; Alvarez Valdes, R;
Publicação
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH
Abstract
Irregular packing problems (also known as nesting problems) belong to the more general class of cutting and packing problems and consist of allocating a set of irregular and regular pieces to larger rectangular or irregular containers, while minimizing the waste of material or space. These problems combine the combinatorial hardness of cutting and packing problems with the computational difficulty of enforcing the geometric non-overlap and containment constraints. Unsurprisingly, nesting problems have been addressed, both in the scientific literature and in real-world applications, by means of heuristic and metaheuristic techniques. However, more recently a variety of mathematical models has been proposed for nesting problems. These models can be used either to provide optimal solutions for nesting problems or as the basis of heuristic approaches based on them (e.g. matheuristics). In both cases, better solutions are sought, with the natural economic and environmental positive impact. Different modeling options are proposed in the literature. We review these mathematical models under a common notation framework, allowing differences and similarities among them to be highlighted. Some insights on weaknesses and strengths are also provided. By building this structured review of mathematical models for nesting problems, research opportunities in the field are proposed.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.