2015
Autores
Oliveira, R; Roriz, P; Marques, MB; Frazao, O;
Publicação
24TH INTERNATIONAL CONFERENCE ON OPTICAL FIBRE SENSORS
Abstract
The purpose of the present work was to construct a weighing machine based on fiber Bragg gratings (FBGs) for the location of the 2D coordinates of the center of gravity (COG) of objects with complex geometry and density distribution. The apparatus consisted of a rigid equilateral triangular platform mounted on three supports at its vertices, two of them having cantilevers instrumented with FBGs. As an example, two femur bone models, one with and one without a hip stem prosthesis, are used to discuss the changing of the COM caused by the implementation of the prosthesis.
2015
Autores
Cunha, J; Fernandes, JP; Mendes, J; Saraiva, J;
Publicação
IEEE TRANSACTIONS ON SOFTWARE ENGINEERING
Abstract
This paper proposes and validates a model-driven software engineering technique for spreadsheets. The technique that we envision builds on the embedding of spreadsheet models under a widely used spreadsheet system. This means that we enable the creation and evolution of spreadsheet models under a spreadsheet system. More precisely, we embed ClassSheets, a visual language with a syntax similar to the one offered by common spreadsheets, that was created with the aim of specifying spreadsheets. Our embedding allows models and their conforming instances to be developed under the same environment. In practice, this convenient environment enhances evolution steps at the model level while the corresponding instance is automatically co-evolved. Finally, we have designed and conducted an empirical study with human users in order to assess our technique in production environments. The results of this study are promising and suggest that productivity gains are realizable under our model-driven spreadsheet development setting.
2015
Autores
Santos, J; Costa, P; Rocha, LF; Moreira, AP; Veiga, G;
Publicação
2015 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL TECHNOLOGY (ICIT)
Abstract
In this paper the authors focus on presenting a new path planning approach for a multi-robot transportation system in an industrial case scenario. The proposed method is based on the A* heuristic search in a cell decomposition scenario, for which a time component was added - Time Enhanced A* or simply TEA*. To access the flexibility and efficiency of the proposed algorithm, a set of experiments were performed in a simulated industrial environment. During trials execution the proposed algorithm has shown high capability on preventing/dealing with the occurrence of deadlocks in the transportation system.
2015
Autores
Barroso, J; Sandnes, FE; Paredes, H; Hadjileontiadis, L; Martins, P;
Publicação
UNIVERSAL ACCESS IN THE INFORMATION SOCIETY
Abstract
2015
Autores
Sanchez de la Nieta, AAS; Tavares, TAM; Martins, RFM; Matias, JCO; Catalao, JPS; Contreras, J;
Publicação
2015 IEEE EINDHOVEN POWERTECH
Abstract
This paper models the offers and bids of a generic storage system in an electricity market through stochastic mixed integer linear programming. The objective function aims at maximizing the profit from buying or selling energy for a general storage system. Some parameters such as storage system efficiency, losses of the energy stored and marginal costs are parameterized to evaluate the offers and bids. Market prices are forecasted for 24 hours using AR, MA and ARIMA time series models. The problem is tested for a case study, analyzing the behaviour of the offers and bids. Also, the results obtained are studied and relevant conclusions are presented.
2015
Autores
Barros, A; Pinho, LM; Yomsi, PM;
Publicação
JOURNAL OF SYSTEMS ARCHITECTURE
Abstract
Recent embedded processor architectures containing multiple heterogeneous cores and non-coherent caches renewed attention to the use of Software Transactional Memory (STM) as a building block for developing parallel applications. STM promises to ease concurrent and parallel software development, but relies on the possibility of abort conflicting transactions to maintain data consistency, which in turns affects the execution time of tasks carrying transactions. Because of this fact the timing behaviour of the task set may not be predictable, thus it is crucial to limit the execution time overheads resulting from aborts. In this paper we formalise a FIFO-based algorithm to order the sequence of commits of concurrent transactions. Then, we propose and evaluate two non-preemptive and one SRP-based fully-preemptive scheduling strategies, in order to avoid transaction starvation.
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.