107 resultados para message dissemination
Resumo:
Dissertação apresentada ao Instituto Politécnico do Porto para obtenção do Grau de Mestre em Gestão das Organizações, Ramo de Gestão de Empresas. Orientada por Prof. Doutor Manuel Salvador Gomes de Araújo
Resumo:
A repository of learning objects is a system that stores electronic resources in a technology-mediated learning process. The need for this kind of repository is growing as more educators become eager to use digital educa- tional contents and more of it becomes available. The sharing and use of these resources relies on the use of content and communication standards as a means to describe and exchange educational resources, commonly known as learning objects. This paper presents the design and implementation of a service-oriented reposi- tory of learning objects called crimsonHex. This repository supports new definitions of learning objects for specialized domains and we illustrate this feature with the definition of programming exercises as learning objects and its validation by the repository. The repository is also fully compliant with existing commu- nication standards and we propose extensions by adding new functions, formalizing message interchange and providing a REST interface. To validate the interoperability features of the repository, we developed a repository plug-in for Moodle that is expected to be included in the next release of this popular learning management system.
Resumo:
We propose a schedulability analysis for a particular class of time division multiple access (TDMA) networks, which we label as TDMA/SS. SS stands for slot skipping, reflecting the fact that a slot is skipped whenever it is not used. Hence, the next slot can start earlier in benefit of hard real-time traffic. In the proposed schedulability analysis, we assume knowledge of all message streams in the system, and that each node schedules messages in its output queue according to a rate monotonic policy (as an example). We present the analysis in two steps. Firstly, we address the case where a node is only permitted to transmit a maximum of one message per TDMA cycle. Secondly, we generalise the analysis to the case where a node is assigned a budget of messages per TDMA cycle it may transmit. A simple algorithm to assign budgets to nodes is also presented.
Resumo:
A pressão seletiva originada pelo uso excessivo de antimicrobianos na medicina humana e veterinária tem contribuído para a emergência de estirpes bacterianas multirresistentes, sendo os estudos mais escassos relativamente à sua presença nos animais de companhia. Porque os animais e os seus proprietários partilham o mesmo espaço habitacional, apresentando comportamentos de contacto próximo, existe uma hipótese elevada de transferência microbiana inter-espécie. Ante esta possibilidade é importante escrutinar o papel dos animais de companhia enquanto reservatórios de estirpes e de genes de resistência, bem como a sua envolvência na disseminação de estirpes bacterianas multirresistentes. Importa também, investigar o papel das superfícies e objetos domésticos partilhados por ambos, como potenciadores deste fenómeno. O objetivo deste trabalho foi, identificar o filogrupo e fazer a caracterização molecular dos genes que conferem resistência aos β-lactâmicos e às quinolonas, em quarenta isolados de Escherichia coli produtoras de β-lactamases de espectro alargado (ESBL), obtidas em zaragatoas fecais de cães consultados no Hospital Veterinário do ICBAS-UP. Complementarmente pretendeu-se inferir sobre a partilha de clones de Escherichia coli e Enterococcus spp. com elevadas resistências, em cinco agregados familiares (humanos e seus animais de companhia) assim como avaliar a potencial disseminação de estirpes multirresistentes no ambiente doméstico. Previamente foram recolhidas zaragatoas de fezes, pelo e mucosa oral dos animais e em alguns casos, dos seus proprietários, e ainda do ambiente doméstico. As zaragatoas foram processadas e as estirpes isoladas com base em meios seletivos. Foram realizados testes de suscetibilidade antimicrobiana de modo a estabelecer o fenótipo de resistência de cada isolado. O DNA foi extraído por varias metodologias e técnicas de PCR foram utilizadas para caracterização de filogrupos (Escherichia coli) e identificação da espécie (Enterococcus spp.). A avaliação da proximidade filogenética entre isolados foi efetuada por ERIC PCR e PFGE. No conjunto de quarenta isolados produtores de ESBL e/ou resistentes a quinolonas verificou-se que 47,5% pertenciam ao filogrupo A, havendo uma menor prevalência do filogrupo D (25,0%), B1 (17,5%), e B2 (10,0%).A frequência de resistência nestes isolados é factualmente elevada, sendo reveladora de uma elevada pressão seletiva. Com exceção de dois isolados, os fenótipos foram justificados pela presença de β-lactamases. A frequência da presença de genes foi: 47% blaTEM, 34% blaSHV, 24% blaOXA , 18% blaCTX-M-15, 8% blaCTX-M-2, 3% blaCTX-M-9. Nos isolados resistentes às quinolonas verificou-se maioritariamente a presença de mutações nos genes cromossomais gyrA e parC, e em alguns casos a presença de um determinante de resistência mediado por plasmídeo – qnrS. Nos cinco “agregados familiares” (humanos e animais) estudados foi observada uma partilha frequente de clones de E. coli e Enterococcus faecalis com múltiplas resistências, isolados em fezes e mucosa oral de cães e gatos e fezes e mãos dos respetivos proprietários, evidenciando-se assim uma possível transferência direta entre coabitantes (agregados A, C, D, E). Ficou também comprovado com percentagens de similaridade genotípica superiores a 94% que essa disseminação também ocorre para o ambiente doméstico, envolvendo objetos dos animais e de uso comum (agregados A, E). Os resultados obtidos reforçam a necessidade de um uso prudente dos antimicrobianos, pois elevados padrões de resistências terão um impacto não só na qualidade de vida dos animais mas também na saúde humana. Adicionalmente importa sensibilizar os proprietários para a necessidade de uma maior vigilância relativamente às formas de interação com os animais, bem como para a adoção de medidas higiénicas cautelares após essa mesma interação.
Resumo:
A cunicultura é uma atividade pecuária em crescente desenvolvimento e isso traduz-se em novos desafios. Durante muitos anos a criação de coelhos recorreu em demasia ao uso de antimicrobianos com o objetivo de tratar e prevenir o aparecimento de diversas doenças. Paralelamente, estes compostos foram também usados como “promotores de crescimento”, visando essencialmente uma melhoria da eficiência digestiva. Porém, o uso indiscriminado destas substâncias levantou questões de saúde pública, como a emergência de estirpes bacterianas multirresistentes e a inerente disseminação de genes de resistência, possivelmente transferíveis ao Homem através da cadeia alimentar. No presente, existe uma enorme pressão para a adoção de estratégias que possibilitem uma redução massiva na quantidade de antimicrobianos administrados a espécies pecuárias. Este trabalho visou contribuir para o estudo de uma alternativa ao uso de antimicrobianos - os probióticos – enquanto suplementos alimentares constituídos por microrganismos vivos capazes de equilibrar a microbiota intestinal do hospedeiro. Para tal, foram constituídos dois grupos de coelhos com base na alimentação: i) grupo antibiótico, com acesso a um alimento composto suplementado com antibióticos e ii) o grupo probiótico alimentado com a mesma dieta, mas sem antibióticos e inoculado com um probiótico constituído por Escherichia coli e Enterococcus spp.. Ao longo de 22 dias de estudo foram monitorizados alguns indicadores produtivos e efetuadas recolhas periódicas de fezes para estudo microbiológico. A análise dos resultados zootécnicos permitiram verificar que o uso de probióticos em detrimento de antibióticos parece promover o crescimento de coelhos, tornando-se um método mais rentável na produção cunícula. Através de genotipagem por ERIC-PCR e PFGE, pretendeu-se verificar se as estirpes estranhas ao trato gastrointestinal dos coelhos seriam capazes de coloniza-lo, permanecendo ao longo do tempo de estudo. O facto de as estirpes inoculadas no probiótico terem sido encontradas ao longo dos dias de estudo nos coelhos aos quais foram administradas, sugere que os efeitos observados na performance zootécnica estejam relacionados com as estirpes administradas no probiótico, pelo que este poderá ser um sistema viável na substituição de antibióticos na alimentação de coelhos de produção.
Resumo:
Broadcast networks that are characterised by having different physical layers (PhL) demand some kind of traffic adaptation between segments, in order to avoid traffic congestion in linking devices. In many LANs, this problem is solved by the actual linking devices, which use some kind of flow control mechanism that either tell transmitting stations to pause (the transmission) or just discard frames. In this paper, we address the case of token-passing fieldbus networks operating in a broadcast fashion and involving message transactions over heterogeneous (wired or wireless) physical layers. For the addressed case, real-time and reliability requirements demand a different solution to the traffic adaptation problem. Our approach relies on the insertion of an appropriate idle time before a station issuing a request frame. In this way, we guarantee that the linking devices’ queues do not increase in a way that the timeliness properties of the overall system turn out to be unsuitable for the targeted applications.
Resumo:
Profibus networks are widely used as the communication infrastructure for supporting distributed computer-controlled applications. Most of the times, these applications impose strict real-time requirements. Profibus-DP has gradually become the preferred Profibus application profile. It is usually implemented as a mono-master Profibus network, and is optimised for speed and efficiency. The aim of this paper is to analyse the real-time behaviour of this class of Profibus networks. Importantly, we develop a new methodology for evaluating the worst-case message response time in systems where high-priority and cyclic low-priority Profibus traffic coexist. The proposed analysis constitutes a powerful tool to guarantee prior to runtime the real-time behaviour of a distributed computer-controlled system based on a Profibus network, where the realtime traffic is supported either by high-priority or by cyclic poll Profibus messages.
Resumo:
A recent trend in distributed computer-controlled systems (DCCS) is to interconnect the distributed computing elements by means of multi-point broadcast networks. Since the network medium is shared between a number of network nodes, access contention exists and must be solved by a medium access control (MAC) protocol. Usually, DCCS impose real-time constraints. In essence, by real-time constraints we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. This motivates the use of communication networks with a MAC protocol that guarantees bounded access and response times to message requests. PROFIBUS is a communication network in which the MAC protocol is based on a simplified version of the timed-token protocol. In this paper we address the cycle time properties of the PROFIBUS MAC protocol, since the knowledge of these properties is of paramount importance for guaranteeing the real-time behaviour of a distributed computer-controlled system which is supported by this type of network.
Resumo:
Fieldbus communication networks aim to interconnect sensors, actuators and controllers within process control applications. Therefore, they constitute the foundation upon which real-time distributed computer-controlled systems can be implemented. P-NET is a fieldbus communication standard, which uses a virtual token-passing medium-access-control mechanism. In this paper pre-run-time schedulability conditions for supporting real-time traffic with P-NET networks are established. Essentially, formulae to evaluate the upper bound of the end-to-end communication delay in P-NET messages are provided. Using this upper bound, a feasibility test is then provided to check the timing requirements for accessing remote process variables. This paper also shows how P-NET network segmentation can significantly reduce the end-to-end communication delays for messages with stringent timing requirements.
Resumo:
Fieldbus networks aim at the interconnection of field devices such as sensors, actuators and small controllers. Therefore, they are an effective technology upon which Distributed Computer Controlled Systems (DCCS) can be built. DCCS impose strict timeliness requirements to the communication network. In essence, by timeliness requirements we mean that traffic must be sent and received within a bounded interval, otherwise a timing fault is said to occur. P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit, which means that in the worst-case the communication response time could be derived considering that the token is fully utilised by all stations. However, such analysis can be proved to be quite pessimistic. In this paper we propose a more sophisticated P-NET timing analysis model, which considers the actual token utilisation by different masters. The major contribution of this model is to provide a less pessimistic, and thus more accurate, analysis for the evaluation of the worst-case communication response time in P-NET fieldbus networks.
Resumo:
Controller area network (CAN) is a fieldbus network suitable for small-scale distributed computer controlled systems (DCCS), being appropriate for sending and receiving short real-time messages at speeds up to 1 Mbit/sec. Several studies are available on how to guarantee the real-time requirements of CAN messages, providing preruntime schedulability conditions to guarantee the real-time communication requirements of DCCS traffic. Usually, it is considered that CAN guarantees atomic multicast properties by means of its extensive error detection/signaling mechanisms. However, there are some error situations where messages can be delivered in duplicate or delivered only by a subset of the receivers, leading to inconsistencies in the supported applications. In order to prevent such inconsistencies, a middleware for reliable communication in CAN is proposed, taking advantage of CAN synchronous properties to minimize the runtime overhead. Such middleware comprises a set of atomic multicast and consolidation protocols, upon which the reliable communication properties are guaranteed. The related timing analysis demonstrates that, in spite of the extra stack of protocols, the real-time properties of CAN are preserved since the predictability of message transfer is guaranteed.
Resumo:
Fieldbus networks are becoming increasingly popular in industrial computer-controlled systems. More recently, there has been the desire to extend the capabilities of fieldbuses to cover functionalities not previously considered in such networks, with particular emphasis on industrial wireless communications. Thinking about wireless means considering hybrid wired/wireless solutions capable of interoperating with legacy (wired) systems. One possible solution is to use intermediate systems (IS) acting as repeaters to interconnect the wired and wireless parts. In contrast, we analyze a solution where intermediate systems are implemented as bridges/routers. We detail the main advantages in terms of dependability and timeliness, and propose mechanisms to manage message transactions and intercell mobility.
Resumo:
Fieldbus communication networks aim to interconnect sensors, actuators and controllers within distributed computer-controlled systems. Therefore they constitute the foundation upon which real-time applications are to be implemented. A potential leap towards the use of fieldbus in such time-critical applications lies in the evaluation of its temporal behaviour. In the past few years several research works have been performed on a number of fieldbuses. However, these have mostly focused on the message passing mechanisms, without taking into account the communicating application tasks running in those distributed systems. The main contribution of this paper is to provide an approach for engineering real-time fieldbus systems where the schedulability analysis of the distributed system integrates both the characteristics of the application tasks and the characteristics of the message transactions performed by these tasks. In particular, we address the case of system where the Process-Pascal multitasking language is used to develop P-NET based distributed applications
Resumo:
Controller Area Network (CAN) is a fieldbus network suitable for small-scale Distributed Computer Controlled Systems, being appropriate for transferring short real-time messages. Nevertheless, it must be understood that the continuity of service is not fully guaranteed, since it may be disturbed by temporary periods of network inaccessibility [1]. In this paper, such temporary periods of network inaccessibility are integrated in the response time analysis of CAN networks. The achieved results emphasise that, in the presence of temporary periods of network inaccessibility, a CAN network is not able to provide different integrity levels to the supported applications, since errors in low priority messages interfere with the response time of higher priority message streams.
Resumo:
In this paper we address the real-time capabilities of P-NET, which is a multi-master fieldbus standard based on a virtual token passing scheme. We show how P-NET’s medium access control (MAC) protocol is able to guarantee a bounded access time to message requests. We then propose a model for implementing fixed prioritybased dispatching mechanisms at each master’s application level. In this way, we diminish the impact of the first-come-first-served (FCFS) policy that P-NET uses at the data link layer. The proposed model rises several issues well known within the real-time systems community: message release jitter; pre-run-time schedulability analysis in non pre-emptive contexts; non-independence of tasks at the application level. We identify these issues in the proposed model and show how results available for priority-based task dispatching can be adapted to encompass priority-based message dispatching in P-NET networks.