Coordinated runtime adaptations in cooperative open real-time systems

This paper proposes an one-step decentralised coordination model based on an effective feedback mechanism to reduce the complexity of the needed interactions among interdependent nodes of a cooperative distributed system until a collective adaptation behaviour is determined. Positive feedback is used to reinforce the selection of the new desired global service solution, while negative feedback discourages nodes to act in a greedy fashion as this adversely impacts on the provided service levels at neighbouring nodes. The reduced complexity and overhead of the proposed decentralised coordination model are validated through extensive evaluations.

Calculating an upper bound on the finishing time of a group of threads executing on a GPU: a preliminary case study

Graphics processor units (GPUs) today can be used for computations that go beyond graphics and such use can attain a performance that is orders of magnitude greater than a normal processor. The software executing on a graphics processor is composed of a set of (often thousands of) threads which operate on different parts of the data and thereby jointly compute a result which is delivered to another thread executing on the main processor. Hence the response time of a thread executing on the main processor is dependent on the finishing time of the execution of threads executing on the GPU. Therefore, we present a simple method for calculating an upper bound on the finishing time of threads executing on a GPU, in particular NVIDIA Fermi. Developing such a method is nontrivial because threads executing on a GPU share hardware resources at very fine granularity.

Dynamic QoS adaptation of inter- dependent task sets in cooperative embedded systems

Due to the growing complexity and dynamism of many embedded application domains (including consumer electronics, robotics, automotive and telecommunications), it is increasingly difficult to react to load variations and adapt the system's performance in a controlled fashion within an useful and bounded time. This is particularly noticeable when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand and tasks may exhibit unrestricted QoS inter-dependencies. This paper proposes a novel anytime adaptive QoS control policy in which the online search for the best set of QoS levels is combined with each user's personal preferences on their services' adaptation behaviour. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves as the algorithms are given more time to run, with a minimum overhead when compared against their traditional versions.

Handling QoS dependencies in distributed cooperative real-time systems

Due to the growing complexity and adaptability requirements of real-time embedded systems, which often exhibit unrestricted inter-dependencies among supported services and user-imposed quality constraints, it is increasingly difficult to optimise the level of service of a dynamic task set within an useful and bounded time. This is even more difficult when intending to benefit from the full potential of an open distributed cooperating environment, where service characteristics are not known beforehand. This paper proposes an iterative refinement approach for a service’s QoS configuration taking into account services’ inter-dependencies and quality constraints, and trading off the achieved solution’s quality for the cost of computation. Extensive simulations demonstrate that the proposed anytime algorithm is able to quickly find a good initial solution and effectively optimises the rate at which the quality of the current solution improves as the algorithm is given more time to run. The added benefits of the proposed approach clearly surpass its reducedoverhead.

Iterative refinement approach for QOS-Aware service configuration

In heterogeneous environments, diversity of resources among the devices may affect their ability to perform services with specific QoS constraints, and drive peers to group themselves in a coalition for cooperative service execution. The dynamic selection of peers should be influenced by user’s QoS requirements as well as local computation availability, tailoring provided service to user’s specific needs. However, complex dynamic real-time scenarios may prevent the possibility of computing optimal service configurations before execution. An iterative refinement approach with the ability to trade off deliberation time for the quality of the solution is proposed. We state the importance of quickly finding a good initial solution and propose heuristic evaluation functions that optimise the rate at which the quality of the current solution improves as the algorithms have more time to run.

Building adaptable, QoS-aware dependable embedded systems

Most of today’s embedded systems are required to work in dynamic environments, where the characteristics of the computational load cannot always be predicted in advance. Furthermore, resource needs are usually data dependent and vary over time. Resource constrained devices may need to cooperate with neighbour nodes in order to fulfil those requirements and handle stringent non-functional constraints. This paper describes a framework that facilitates the distribution of resource intensive services across a community of nodes, forming temporary coalitions for a cooperative QoSaware execution. The increasing need to tailor provided service to each application’s specific needs determines the dynamic selection of peers to form such a coalition. The system is able to react to load variations, degrading its performance in a controlled fashion if needed. Isolation between different services is achieved by guaranteeing a minimal service quality to accepted services and by an efficient overload control that considers the challenges and opportunities of dynamic distributed embedded systems.

Time-bounded distributed QoS-aware service configuration in heterogeneous cooperative environments

The scarcity and diversity of resources among the devices of heterogeneous computing environments may affect their ability to perform services with specific Quality of Service constraints, particularly in dynamic distributed environments where the characteristics of the computational load cannot always be predicted in advance. Our work addresses this problem by allowing resource constrained devices to cooperate with more powerful neighbour nodes, opportunistically taking advantage of global distributed resources and processing power. Rather than assuming that the dynamic configuration of this cooperative service executes until it computes its optimal output, the paper proposes an anytime approach that has the ability to tradeoff deliberation time for the quality of the solution. Extensive simulations demonstrate that the proposed anytime algorithms are able to quickly find a good initial solution and effectively optimise the rate at which the quality of the current solution improves at each iteration, with an overhead that can be considered negligible.

Cooperative effects in the detection of a nitroaliphatic liquid explosive and na explosive taggant in the vapor phase by calix[4]arene-based carbazole-containing conjugated polymers

Two fluorescent molecular receptor based conjugated polymers were used in the detection of a nitroaliphatic liquid explosive (nitromethane) and an explosive taggant (2,3-dimethyl-2,3-dinitrobutane) in the vapor phase. Results have shown that thin films of both polymers display remarkably high sensitivity and selectivity toward these analytes. Very fast, reproducible, and reversible responses were found. The unique behavior of these supramolecular host systems is ascribed to cooperativity effects developed between the calix[4] arene hosts and the phenylene ethynylene-carbazolylene main chains. The calix[4]-arene hosts create a plethora of host-guest binding sites along the polymer backbone, either in their bowl-shaped cavities or between the outer walls of the cavity, to direct guests to the area of the transduction centers (main chain) at which favorable photoinduced electron transfer to the guest molecules occurs and leads to the observed fluorescence quenching. The high tridimensional porous nature of the polymers imparted by the bis-calixarene moieties concomitantly allows fast diffusion of guest molecules into the polymer thin films.

Human disease in ribeira valley, brazil caused by caraparu, a group c arbovirus - Report of a case

The clinical and laboratory data of a disease in a resident of Ribeira Valley, São Paulo State, southeastern Brazil, caused by an agent close or identical to Caraparu, a Group C arbovirus, was described. Although there is evidence of an intensive circulation of several arboviruses in the area, no diagnosis of human disease by these agents has been made, except the encephalitis cases caused by Rocio virus during an epidemic in 1975-1977. An antigenic difference between Caraparu strains isolated in São Paulo and in Pará States and a close antigenic relationship between Caraparu strain from São Paulo and Bruconha virus were suggested by the serological tests.

Cooperative memory and database transactions

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática

Os estereótipos de género no jardim de infância

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Processos de scaffolding num contexto pedagógico mem em jardim-de-infância

Relatório da Prática Profissional Supervisionada Mestrado em Educação Pré-Escolar

Zonal distribution of gold and platinium group elements in the Mondunguara deposits Mozambique

The Mondunguara copper mines are situated in mountainous terrain in west-central Mozambique. The mineralization consists of chalcopyrite, pyrrhotite, common pcntlandite, cobaltpentlandite, pyrite and several minor oxides and sulphides in tabular ore bodies deeping steep to the north. Gold was known to occur in small quantities but no systematic sampling and analysis for precious clements was ever done. Mineralogical and geological evidence has shown that the ores are magmatic in origin and were derived from gabbro-peridotitic magma dykes saturated in sulphides when intruded. The ore bodies show a clear zonation. Platinum group elements as well as pure gold are associated with high temperature hexagonal pyrrhotite. This pyrrhotite being of no use is generally discarded to the tailing dumps. Late hydrothermal phases are enriched in native silver, silver tellurides as well as electrum.

Antimicrobial resistance and plasmid detection in strains of the Bacteroides fragilis group

Resistant populations of the Bacteroides fragilis group bacteria (two reference ones and two isolated from human and Callithrix penicillata marmoset) were obtained by the gradient plate technique, to clindamycin, penicillin G, metronidazole and mercuric chloride. All the four tested strains were originaly susceptible to the four antimicrobial drugs at the breakpoint used in this study. MICs determination for the four cultures gave constant values for each antimicrobial, on the several steps by the gradient plate technique. The intestinal human B. fragilis strains showed three DNA bands, that could be representative of only two plasmids in the closed covalently circular (CCC) form with molecular weights of approximately 25 and 2.5 Md. The results do not permit an association between the presence of plasmid in the human strain with the susceptibility to the studied drugs. The four strains were ß-lactamase negative in the two methods used, and no particular chromosomal genetic resistance marker was demonstred. The resistance (MIC) observed, after contact with penicillin G and mercuric chloride, were two-fold in the four tested strains

Performance evaluation of a cooperative reputation system for vehicular delay-tolerant networks

In the last decade, both scientific community and automotive industry enabled communications among vehicles in different kinds of scenarios proposing different vehicular architectures. Vehicular delay-tolerant networks (VDTNs) were proposed as a solution to overcome some of the issues found in other vehicular architectures, namely, in dispersed regions and emergency scenarios. Most of these issues arise from the unique characteristics of vehicular networks. Contrary to delay-tolerant networks (DTNs), VDTNs place the bundle layer under the network layer in order to simplify the layered architecture and enable communications in sparse regions characterized by long propagation delays, high error rates, and short contact durations. However, such characteristics turn contacts very important in order to exchange as much information as possible between nodes at every contact opportunity. One way to accomplish this goal is to enforce cooperation between network nodes. To promote cooperation among nodes, it is important that nodes share their own resources to deliver messages from others. This can be a very difficult task, if selfish nodes affect the performance of cooperative nodes. This paper studies the performance of a cooperative reputation system that detects, identify, and avoid communications with selfish nodes. Two scenarios were considered across all the experiments enforcing three different routing protocols (First Contact, Spray and Wait, and GeoSpray). For both scenarios, it was shown that reputation mechanisms that punish aggressively selfish nodes contribute to increase the overall network performance.