910 resultados para Networked Virtual Environment
Resumo:
This paper summarises the most important solutions that have emerged from the work carried out by our team within the framework of the EU (IST-1999-11316) project RFieldbus - High Performance Wireless Fieldbus in Industrial Multimedia-Related Environment. Within this project, Profibus was chosen as the fieldbus platform. Essentially, extensions to the current Profibus standard are being developed in order to provide Profibus with wireless, mobility and industrialmultimedia capabilities. In fact, providing these extensions means fulfilling strong requirements, namely to encompass the communication between wired (currently available) and wireless/mobile devices and to support real-time control traffic and multimedia traffic in the same network.
Resumo:
We propose the use of the European Geostationary Navigation Overlay Service (EGNOS) data - real time on line data provided by SISNeT - to develop Virtual Reference Stations and, thus, increase the quality of the Position, Velocity an Time (PVT) solution of receivers unable to interface directly with EGNOS. A Virtual Reference Station (VRS) is a concept where the existence of a differential reference station located near a mobile rover is simulated by software in order to increase the accuracy of the PVT solution of the mobile GNSS receiver.
Resumo:
Este artigo relata o desenvolvimento de um modelo de ensino virtual em curso na Universidade dos Açores. Depois de ter sido adotado na lecionação de disciplinas da área da Teoria e Desenvolvimento Curricular em regime de e-learning e b-learning, o modelo foi, no ano académico de 2014/15, estendido à lecionação de outras disciplinas. Além de descrever o modelo e explicar a sua evolução, o artigo destaca a sua adoção no contexto particular de uma disciplina cuja componente online foi lecionada em circunstâncias especialmente desafiadoras. Neste sentido, explica o processo de avaliação da experiência, discute os seus resultados e sugere pistas de melhoria. Essa avaliação enquadra-se num processo de investigação do design curricular – a metodologia que tem sido usada para estudar o desenvolvimento do modelo.
Resumo:
Aerodynamic drag is known to be one of the factors contributing more to increased aircraft fuel consumption. The primary source of skin friction drag during flight is the boundary layer separation. This is the layer of air moving smoothly in the immediate vicinity of the aircraft. In this paper we discuss a cyber-physical system approach able of performing an efficient suppression of the turbulent flow by using a dense sensing deployment to detect the low pressure region and a similarly dense deployment of actuators to manage the turbulent flow. With this concept, only the actuators in the vicinity of a separation layer are activated, minimizing power consumption and also the induced drag.
Resumo:
This work focuses on highly dynamic distributed systems with Quality of Service (QoS) constraints (most importantly real-time constraints). To that purpose, real-time applications may benefit from code offloading techniques, so that parts of the application can be offloaded and executed, as services, by neighbour nodes, which are willing to cooperate in such computations. These applications explicitly state their QoS requirements, which are translated into resource requirements, in order to evaluate the feasibility of accepting other applications in the system.
Resumo:
Network control systems (NCSs) are spatially distributed systems in which the communication between sensors, actuators and controllers occurs through a shared band-limited digital communication network. However, the use of a shared communication network, in contrast to using several dedicated independent connections, introduces new challenges which are even more acute in large scale and dense networked control systems. In this paper we investigate a recently introduced technique of gathering information from a dense sensor network to be used in networked control applications. Obtaining efficiently an approximate interpolation of the sensed data is exploited as offering a good tradeoff between accuracy in the measurement of the input signals and the delay to the actuation. These are important aspects to take into account for the quality of control. We introduce a variation to the state-of-the-art algorithms which we prove to perform relatively better because it takes into account the changes over time of the input signal within the process of obtaining an approximate interpolation.
Resumo:
Wireless sensor networks (WSNs) emerge as underlying infrastructures for new classes of large-scale networked embedded systems. However, WSNs system designers must fulfill the quality-of-service (QoS) requirements imposed by the applications (and users). Very harsh and dynamic physical environments and extremely limited energy/computing/memory/communication node resources are major obstacles for satisfying QoS metrics such as reliability, timeliness, and system lifetime. The limited communication range of WSN nodes, link asymmetry, and the characteristics of the physical environment lead to a major source of QoS degradation in WSNs-the ldquohidden node problem.rdquo In wireless contention-based medium access control (MAC) protocols, when two nodes that are not visible to each other transmit to a third node that is visible to the former, there will be a collision-called hidden-node or blind collision. This problem greatly impacts network throughput, energy-efficiency and message transfer delays, and the problem dramatically increases with the number of nodes. This paper proposes H-NAMe, a very simple yet extremely efficient hidden-node avoidance mechanism for WSNs. H-NAMe relies on a grouping strategy that splits each cluster of a WSN into disjoint groups of non-hidden nodes that scales to multiple clusters via a cluster grouping strategy that guarantees no interference between overlapping clusters. Importantly, H-NAMe is instantiated in IEEE 802.15.4/ZigBee, which currently are the most widespread communication technologies for WSNs, with only minor add-ons and ensuring backward compatibility with their protocols standards. H-NAMe was implemented and exhaustively tested using an experimental test-bed based on ldquooff-the-shelfrdquo technology, showing that it increases network throughput and transmission success probability up to twice the values obtained without H-NAMe. H-NAMe effectiveness was also demonstrated in a target tracking application with mobile robots - over a WSN deployment.
Resumo:
Scheduling of constrained deadline sporadic task systems on multiprocessor platforms is an area which has received much attention in the recent past. It is widely believed that finding an optimal scheduler is hard, and therefore most studies have focused on developing algorithms with good processor utilization bounds. These algorithms can be broadly classified into two categories: partitioned scheduling in which tasks are statically assigned to individual processors, and global scheduling in which each task is allowed to execute on any processor in the platform. In this paper we consider a third, more general, approach called cluster-based scheduling. In this approach each task is statically assigned to a processor cluster, tasks in each cluster are globally scheduled among themselves, and clusters in turn are scheduled on the multiprocessor platform. We develop techniques to support such cluster-based scheduling algorithms, and also consider properties that minimize total processor utilization of individual clusters. In the last part of this paper, we develop new virtual cluster-based scheduling algorithms. For implicit deadline sporadic task systems, we develop an optimal scheduling algorithm that is neither Pfair nor ERfair. We also show that the processor utilization bound of us-edf{m/(2m−1)} can be improved by using virtual clustering. Since neither partitioned nor global strategies dominate over the other, cluster-based scheduling is a natural direction for research towards achieving improved processor utilization bounds.
Resumo:
Database query languages on relations (for example SQL) make it possible to join two relations. This operation is very common in desktop/server database systems but unfortunately query processing systems in networked embedded computer systems currently do not support this operation; specifically, the query processing systems TAG, TinyDB, Cougar do not support this. We show how a prioritized medium access control (MAC) protocol can be used to efficiently execute the database operation join for networked embedded computer systems where all computer nodes are in a single broadcast domain.
Resumo:
Mestrado em Ensino Precoce do Inglês
Resumo:
Historical buildings are important fingerprints of the history and culture of a region and its communities. Climatic and environmental conditions are often very severe for construction materials, namely in presence of high humidity or in direct contact with water and salts. However, some historical buildings have in our days a very good condition, probably due to careful construction and/or accurate materials selection and to a specific technology. The knowledge of old mortars composition has a fundamental role on the preservation of cultural heritage, allowing information about the used materials, their performance in their specific environment, conducting to adequate and compatible materials to conservation purposes. This article presents two case studies of historical buildings with important defence functions in Lisbon coast, in which ancient lime mortars where used under severe seaside environmental actions. Mortar samples from these two case studies are characterized and the relationship of their composition with the good performance and high durability observed is discussed.
Resumo:
Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do Grau de Mestre em Ensino da Matemática
Resumo:
This paper discusses the technology of smart floors as a enabler of smart cities. The discussion will be based on technology that is embedded into the environment that enable location, navigation but also wireless power transmission for powering up elements siting on it, typically mobile devices. One of those examples is the smart floor, this implementation follows two paths, one where the floor is passive, and normally passive RFID's are embedded into the floor, they are used to provide intelligence into the surrounding space, this is normally complemented with a battery powered mobile unit that scans the floor for the sensors and communicates the information to a database which locates the mobile device in the environment. The other path for the smart city enabler is where the floor is active and delivers energy for the objects standing on top of it. In this paper these two approaches will be presented, by discussing the technology behind it. © 2014 IEEE.
Resumo:
The process of resources systems selection takes an important part in Distributed/Agile/Virtual Enterprises (D/A/V Es) integration. However, the resources systems selection is still a difficult matter to solve in a D/A/VE, as it is pointed out in this paper. Globally, we can say that the selection problem has been equated from different aspects, originating different kinds of models/algorithms to solve it. In order to assist the development of a web prototype tool (broker tool), intelligent and flexible, that integrates all the selection model activities and tools, and with the capacity to adequate to each D/A/V E project or instance (this is the major goal of our final project), we intend in this paper to show: a formulation of a kind of resources selection problem and the limitations of the algorithms proposed to solve it. We formulate a particular case of the problem as an integer programming, which is solved using simplex and branch and bound algorithms, and identify their performance limitations (in terms of processing time) based on simulation results. These limitations depend on the number of processing tasks and on the number of pre-selected resources per processing tasks, defining the domain of applicability of the algorithms for the problem studied. The limitations detected open the necessity of the application of other kind of algorithms (approximate solution algorithms) outside the domain of applicability founded for the algorithms simulated. However, for a broker tool it is very important the knowledge of algorithms limitations, in order to, based on problem features, develop and select the most suitable algorithm that guarantees a good performance.
Resumo:
One of the most common problems of rotating machinery is the rotor unbalance. The effects of rotor unbalance can vary from the malfunction of certain equipment to diseases related to the exposure to high vibration levels. However, the balancing procedure is known, it is mandatory to have qualified technicians to perform it. In this sense, the use of virtual balancing experiments is of great interest. The present demo is dedicated to present two different balancing simulators, which can be explored in conjunction, as they have complementary outputs. © 2014 IEEE.