2014
Authors
Blomstedt, F; Ferreira, LL; Klisics, M; Chrysoulas, C; de Soria, IM; Morin, B; Zabasta, A; Eliasson, J; Johansson, M; Varga, P;
Publication
IECON 2014 - 40TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY
Abstract
The Arrowhead project aims to address the technical and applicative issues associated with cooperative automation based on Service Oriented Architectures. The problems of developing such kind of systems are mainly due to the lack of adequate development and service documentation methodologies, which would ease the burden of reusing services on different applications. The Arrowhead project proposes a technical framework to efficiently support the development of such systems, which includes several tools for documentation of services and to support the development of SOA-based installations. The work presented in this paper describes the approach which has been developed for the first generation pilots to support the documentation of their structural services. Each service, system and system-of-systems within the Arrowhead Framework must be documented and described in such way that it can be implemented, tested and deployed in an interoperable way. This paper presents the first steps of realizing the Arrowhead vision for interoperable services, systems and systems-of-systems.
2014
Authors
Santos, AS; Varela, MLR; Putnik, GD; Madureira, AM;
Publication
2014 6th World Congress on Nature and Biologically Inspired Computing, NaBIC 2014
Abstract
Extended Manufacturing Environments (EMEs) are nowadays growing due to the increase on Distributed and Virtual Enterprises, which led to an emergent need to apply scheduling approaches accordingly. This can be achieved in several different ways, namely by putting forward new approaches or by trying to adapt existing ones. In this paper the adaptation of some existing scheduling methods is proposed for solving a two stage manufacturing scheduling problem, and an illustrative example is presented. Several approaches were analyses, namely through the use of the ANOVA and the Post Hoc Scheffe's test, that demonstrated the superior performance of one of the proposed methods.
2014
Authors
Carvalho, L; Roriz, P; Simoes, J; Santos, JL; Frazao, O;
Publication
23RD INTERNATIONAL CONFERENCE ON OPTICAL FIBRE SENSORS
Abstract
Interferometric fiber optic based sensors, namely those based on the Fabry-Perot (F-P) configuration seem very attractive for biomechanical and biomedical applications. The present study is focused on the proof of concept of two developed FP based sensors, for high and low pressure measurements of fluids. For low pressure sensor, it was used a polymeric diaphragm in a microstrutured fiber. It was obtained a good agreement between wavelength shift and the pressure, for the two tested sensors.
2014
Authors
Couto, R; Ribeiro, AN; Campos, JC;
Publication
2014 9th International Conference on the Quality of Information and Communications Technology (QUATIC)
Abstract
Use case scenarios are known as powerful means for requirements specification. On the one hand, they join in the same modeling space the expectations of the stakeholders and the needs of the developers involved in the process. On the other hand, they describe the desired high level functionalities. By formalizing these descriptions we are able to extract relevant informations from them. Specifically, we are interested in identifying requirements patterns (common requirements with typical implementation solutions) in support for a requirements based software development approach. This paper addresses the transformation of use case descriptions expressed in a Controller Natural Language into an ontology expressed in the Web Ontology Language (OWL), as well as the query process for such information. It reports on a study aimed at validating our approach and our tool with real users. A preliminary set of results is discussed.
2014
Authors
Couceiro, MS; Lopes, AR; Ferreira, NMF; Ferreira, AG; Rocha, R;
Publication
Mathematical Methods in Engineering
Abstract
Over time, biological societies such ashumans, ants or bees have shown us the advantages inherent to the collective work. It is based on such results that many researchers have been trying to successfully develop new approaches in Multi-Robot Systems. Nevertheless, several assumptions need to be assured for collective work toemerge. In this paper, it is presented the significance and the advantages of cooperation in thedifferent societies bridging the gap to the concept of robot society. In order to compare th advantages of cooperative robots, it is considered essential the development of computational simulation based on the robotic cooperation in unstructured environments. Hence, a Multi-Robot Simultaneous Localization and Mapping (SLAM) using Rao-Blackwellized particle filter is implemented ina simulation environment developed in the Player/Stage platform for robot and sensor applications. © Springer Science+Business Media Dordrecht 2014.
2014
Authors
Garibay Martinez, R; Nelissen, G; Ferreira, LL; Pinho, LM;
Publication
2014 9TH IEEE INTERNATIONAL SYMPOSIUM ON INDUSTRIAL EMBEDDED SYSTEMS (SIES)
Abstract
Modern real-time embedded applications present high computation requirements which need to be realized within strict time constraints. The current trend towards parallel processing in the embedded domain allows providing higher processing power. However, in some embedded applications, the use of powerful enough multi-core processors, may not be possible due to energy, space or cost constraints. A solution for this problem is to extend the parallel execution of the applications, allowing them to distribute their workload among networked nodes, on peak situations, to remote neighbour nodes in the system. In this context, we present the Partitioned-Distributed- Deadline Monotonic Scheduling algorithm for fork-join parallel/distributed fixed-priority tasks. We study the problem of scheduling fork-join tasks that execute in a distributed system, where the inherent transmission delay of tasks must be considered and cannot be deemed negligible, as in the case of multicore systems. Our scheduling algorithm is shown to have a resource augmentation bound of 4, which implies that any task set that is feasible on m unit-speed processors and a single shared real-time network, can be scheduled by our algorithm on m processors and a single real-time network that are 4 times faster. We confirm through simulations our analytical results.
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.