2018
Authors
Royuela, S; Martorell, X; Quinones, E; Pinho, LM;
Publication
RELIABLE SOFTWARE TECHNOLOGIES - ADA-EUROPE 2018
Abstract
There is a growing need to support parallel computation in Ada to cope with the performance requirements of the most advanced functionalities of safety-critical systems. In that regard, the use of parallel programming models is paramount to exploit the benefits of parallelism. Recent works motivate the use of OpenMP for being a de facto standard in high-performance computing for programming shared memory architectures. These works address two important aspects towards the introduction of OpenMP in Ada: the compatibility of the OpenMP syntax with the Ada language, and the interoperability of the OpenMP and the Ada runtimes, demonstrating that OpenMP complements and supports the structured parallelism approach of the tasklet model. This paper addresses a third fundamental aspect: functional safety from a compiler perspective. Particularly, it focuses on race conditions and considers the fine-grain and unstructured capabilities of OpenMP. Hereof, this paper presents a new compiler analysis technique that: (1) identifies potential race conditions in parallel Ada programs based on OpenMP or Ada tasks or both, and (2) provides solutions for the detected races.
2018
Authors
Patricio, L; de Pinho, NF; Teixeira, JG; Fisk, RP;
Publication
SERVICE SCIENCE
Abstract
In the increasingly complex service environment, value is cocreated through webs of interactions between provider networks and customer networks. This is evident in healthcare services, where well-being can be achieved only through the joint efforts of professional healthcare networks and patient networks. Addressing the challenge of creating network-level services, the service design for value networks (SD4VN) method designs services as enablers of many-to-many value cocreating interactions among network actors. By integrating previous research on value networks and service design, SD4VN develops a process and a set of models beyond supporting dyadic (customer-service provider) interactions to understanding the interrelated activities, interactions, and goals of network actors and designing services to support the different actors in reaching their goals with balanced centricity. Following a design science research approach, this paper presents the SD4VN method and reports on a case application of the method used to design the Portuguese national electronic health record service Plataforma de Dados da Saude (PDS). The case application involved focus groups, indepth interviews, and participatory design sessions with over 170 participants at different service design stages, showing the importance of designing a balanced, integrated service. The case application also shows how SD4VN can support a wider adoption of the service and improve the health service system.
2018
Authors
Baghoussi, Y; Mendes Moreira, J; Emmerich, MTM;
Publication
2018 10TH INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS & NETWORKS (COMSNETS)
Abstract
Transportation systems are very complex systems due to the characteristics of their components such as buses. Nowadays, buses are set up to follow a particular schedule that is very sensitive to the changes that occur inside the system. These schedules must frequently be updated, if necessary, due to many reasons. Among these reasons, we have the population growth inside the cities as well as traffic and congestions caused by unforeseen events. To solve the problem of system variability, companies such as the Public Transport Company in the city of Porto (STCP) usually fixes bus schedules with headways adapted to each type of bus lines (i.e., high/low-frequency bus lines). In this work, we adopt a robust optimization model from literature to improve the bus schedules using Automatic Vehicle Location Data collected along the year in the city of Porto. We apply the model to a high-frequency bus line case study. We present the model imperfections and propose new updates.
2018
Authors
Freitas, S; Almeida, C; Silva, H; Almeida, J; Silva, E;
Publication
2018 IEEE INTERNATIONAL CONFERENCE ON AUTONOMOUS ROBOT SYSTEMS AND COMPETITIONS (ICARSC)
Abstract
This paper addresses the use of a hyperspectral image system to detect vessels in maritime operational scenarios. The developed hyperspectral imaging classification methods are based on supervised approaches and allow to detect the presence of vessels using real hyperspectral data. We implemented two different methods for comparison purposes: SVM and SAM. The SVM method, which can be considered one of most utilized methods for image classification, was implemented using linear, RBF, sigmoid and polynomial kernels with PCA for dimensionality reduction, and compared with SAM using a two classes definition, namely vessel and water. The obtained results using real data collected from a UAV allow to conclude that the SVM approach is suitable for detecting the vessel presence in the water with a precision and recall rates favorable when compared to SAM.
2018
Authors
Carvalho, M; Pedroso, JP; Telha, C; Van Vyve, M;
Publication
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS
Abstract
We study the strategical behaviour of firms facing a lot-sizing problem with Cournot competition. Each player is a firm with her own production facility, modeled as an uncapacitated lot-sizing problem (Le., production incurs set-up and variable costs and inventories are allowed). A Cournot competition is played in each time period (market) with each player deciding the quantity of product to place on it. The market price of that product in each time period depends on the total quantity placed in the market. We show that this is a potential game with possibly multiple pure Nash equilibria. We then investigate the plausibility of these equilibria to predict the game outcome by evaluating the difficulty of computing them. If the game has a single period, we prove that an equilibrium can be found in polynomial time, but it is weakly NP hard to find an optimal pure Nash equilibrium (with respect to a given equilibrium refinement). If the game has no variable production and inventory costs, we prove that a pure Nash equilibrium can be computed in polynomial time.
2018
Authors
Pacheco, AP; et. al.;
Publication
ADVANCES IN FOREST FIRE RESEARCH 2018
Abstract
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.