2021
Authors
Pratesi M.; Campos P.;
Publication
Statistical Journal of the IAOS
Abstract
After 12 years of EMOS experience it is time to open the discussion on the future of EMOS. This papers briefly describes the experience from the perspective of the Universities, trying also to describe the needs and role of the NSIs, Banks and other possible actors to join the network, and unlock the future. EMOS should reload (or evolute) to stay current and attractive. Statistical 'thinking' evolved and a major change and challenge for EMOS is to pick up this trend in its cooperation with the universities.
2021
Authors
Viegas, D; Figueiredo, A; Coimbra, J; Dos Santos, A; Almeida, J; Dias, N; Lima, L; Silva, H; Ferreira, H; Almeida, C; Amaro, T; Arenas, F; Castro, F; Santos, M; Martins, A; Silva, E;
Publication
OCEANS 2021: SAN DIEGO - PORTO
Abstract
This paper presents the development of a hyperbaric system able to collect, transport and maintain deep-sea species in controlled condition from the sea floor up to the surface (HiperSea System). The system is composed by two chambers coupled with a transference set-up. The first chamber is able to reach a maximum of 1km depth collecting both benthic and pelagic deep-sea species. The second chamber is a life support compartment to maintain the specimens alive at the surface, in hyperbaric conditions.
2021
Authors
Mateus-Coelho, N; Cruz-Cunha, M; Silva-Ávila, P;
Publication
FME Transactions
Abstract
2021
Authors
Joana dos Santos Tavares;
Publication
Abstract
2021
Authors
Costa, AP; Reis, LP; Moreira, A; Longo, L; Bryda, G;
Publication
Advances in Intelligent Systems and Computing
Abstract
2021
Authors
Martin, M; Oliveira, JF; Silva, E; Morabito, R; Munari, P;
Publication
EXPERT SYSTEMS WITH APPLICATIONS
Abstract
In this paper, we address the Constrained Three-dimensional Guillotine Cutting Problem (C3GCP), which consists of cutting a larger cuboid block (object) to produce a limited number of smaller cuboid pieces (items) using orthogonal guillotine cuts only. This way, all cuts must be parallel to the object's walls and generate two cuboid sub-blocks, and there is a maximum number of copies that can be manufactured for each item type. The C3GCP arises in industrial manufacturing settings, such as the cutting of steel and foam for mattresses. To model this problem, we propose a new compact mixed-integer non-linear programming (MINLP) formulation by extending its two-dimensional version, and develop a mixed-integer linear programming (MILP) version. We also propose a new model for a particular case of the problem which considers 3-staged patterns. As a solution method, we extend the algorithm of Wang (1983) to the three-dimensional case. We emphasise that the C3GCP is different from 3D packing problems, namely from the Container Loading Problem, because of the guillotine cut constraints. All proposed approaches are evaluated through computational experiments using benchmark instances. The results show that the approaches are effective on different types of instances, mainly when the maximum number of copies per item type is small, a situation typically encountered in practical settings with low demand for each item type. These approaches can be easily embedded into existing expert systems for supporting the decision-making process.
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.