Uma abordagem para a verificação do comportamento excepcional a partir de regras de designe e testes

Checking the conformity between implementation and design rules in a system is an important activity to try to ensure that no degradation occurs between architectural patterns defined for the system and what is actually implemented in the source code. Especially in the case of systems which require a high level of reliability is important to define specific design rules for exceptional behavior. Such rules describe how exceptions should flow through the system by defining what elements are responsible for catching exceptions thrown by other system elements. However, current approaches to automatically check design rules do not provide suitable mechanisms to define and verify design rules related to the exception handling policy of applications. This paper proposes a practical approach to preserve the exceptional behavior of an application or family of applications, based on the definition and runtime automatic checking of design rules for exception handling of systems developed in Java or AspectJ. To support this approach was developed, in the context of this work, a tool called VITTAE (Verification and Information Tool to Analyze Exceptions) that extends the JUnit framework and allows automating test activities to exceptional design rules. We conducted a case study with the primary objective of evaluating the effectiveness of the proposed approach on a software product line. Besides this, an experiment was conducted that aimed to realize a comparative analysis between the proposed approach and an approach based on a tool called JUnitE, which also proposes to test the exception handling code using JUnit tests. The results showed how the exception handling design rules evolve along different versions of a system and that VITTAE can aid in the detection of defects in exception handling code

Reengenharia do framework cosmos: uma solução para prover suporte e adaptações abertas.

Self-adaptive software system is able to change its structure and/or behavior at runtime due to changes in their requirements, environment or components. One way to archieve self-adaptation is the use a sequence of actions (known as adaptation plans) which are typically defined at design time. This is the approach adopted by Cosmos - a Framework to support the configuration and management of resources in distributed environments. In order to deal with the variability inherent of self-adaptive systems, such as, the appearance of new components that allow the establishment of configurations that were not envisioned at development time, this dissertation aims to give Cosmos the capability of generating adaptation plans of runtime. In this way, it was necessary to perform a reengineering of the Cosmos Framework in order to allow its integration with a mechanism for the dynamic generation of adaptation plans. In this context, our work has been focused on conducting a reengineering of Cosmos. Among the changes made to in the Cosmos, we can highlight: changes in the metamodel used to represent components and applications, which has been redefined based on an architectural description language. These changes were propagated to the implementation of a new Cosmos prototype, which was then used for developing a case study application for purpose of proof of concept. Another effort undertaken was to make Cosmos more attractive by integrating it with another platform, in the case of this dissertation, the OSGi platform, which is well-known and accepted by the industry

Instanciação e avaliação de um framework para a geração dinâmica de processos

One way to deal with the high complexity of current software systems is through selfadaptive systems. Self-adaptive system must be able to monitor themselves and their environment, analyzing the monitored data to determine the need for adaptation, decide how the adaptation will be performed, and finally, make the necessary adjustments. One way to perform the adaptation of a system is generating, at runtime, the process that will perform the adaptation. One advantage of this approach is the possibility to take into account features that can only be evaluated at runtime, such as the emergence of new components that allow new architectural arrangements which were not foreseen at design time. In this work we have as main objective the use of a framework for dynamic generation of processes to generate architectural adaptation plans on OSGi environment. Our main interest is evaluate how this framework for dynamic generation of processes behave in new environments

Implementação da técnica de software pipelining na rede em chip IPNoSyS

Alongside the advances of technologies, embedded systems are increasingly present in our everyday. Due to increasing demand for functionalities, many tasks are split among processors, requiring more efficient communication architectures, such as networks on chip (NoC). The NoCs are structures that have routers with channel point-to-point interconnect the cores of system on chip (SoC), providing communication. There are several networks on chip in the literature, each with its specific characteristics. Among these, for this work was chosen the Integrated Processing System NoC (IPNoSyS) as a network on chip with different characteristics compared to general NoCs, because their routing components also accumulate processing function, ie, units have functional able to execute instructions. With this new model, packets are processed and routed by the router architecture. This work aims at improving the performance of applications that have repetition, since these applications spend more time in their execution, which occurs through repeated execution of his instructions. Thus, this work proposes to optimize the runtime of these structures by employing a technique of instruction-level parallelism, in order to optimize the resources offered by the architecture. The applications are tested on a dedicated simulator and the results compared with the original version of the architecture, which in turn, implements only packet level parallelism

Algoritmo treansgenético na solução do problema do Caixeiro Viajante

The Traveling Purchaser Problem is a variant of the Traveling Salesman Problem, where there is a set of markets and a set of products. Each product is available on a subset of markets and its unit cost depends on the market where it is available. The objective is to buy all the products, departing and returning to a domicile, at the least possible cost defined as the summation of the weights of the edges in the tour and the cost paid to acquire the products. A Transgenetic Algorithm, an evolutionary algorithm with basis on endosymbiosis, is applied to the Capacited and Uncapacited versions of this problem. Evolution in Transgenetic Algorithms is simulated with the interaction and information sharing between populations of individuals from distinct species. The computational results show that this is a very effective approach for the TPP regarding solution quality and runtime. Seventeen and nine new best results are presented for instances of the capacited and uncapacited versions, respectively

Métricas de sistemas de middleware orientado a aspectos e Aplicação em um sistema de monitoramento de Poços de Petróleo

Nowadays, there are many aspect-oriented middleware implementations that take advantage of the modularity provided by the aspect oriented paradigm. Although the works always present an assessment of the middleware according to some quality attribute, there is not a specific set of metrics to assess them in a comprehensive way, following various quality attributes. This work aims to propose a suite of metrics for the assessment of aspect-oriented middleware systems at different development stages: design, refactoring, implementation and runtime. The work presents the metrics and how they are applied at each development stage. The suite is composed of metrics associated to static properties (modularity, maintainability, reusability, exibility, complexity, stability, and size) and dynamic properties (performance and memory consumption). Such metrics are based on existing assessment approaches of object-oriented and aspect-oriented systems. The proposed metrics are used in the context of OiL (Orb in Lua), a middleware based on CORBA and implemented in Lua, and AO-OiL, the refactoring of OIL that follows a reference architecture for aspect-oriented middleware systems. The case study performed in OiL and AO-OiL is a system for monitoring of oil wells. This work also presents the CoMeTA-Lua tool to automate the collection of coupling and size metrics in Lua source code

PEWS-RT, um sistema de tempo de execução para a linguagem PEWS

Web services are loosely coupled applications that use XML documents as a way of integrating distinct systems on the internet. Such documents are used by in standards such as SOAP, WSDL and UDDI which establish, respectively, integrated patterns for the representation of messages, description, and publication of services, thus facilitating the interoperability between heterogeneous systems. Often one single service does not meet the users needs, therefore new systems can be designed from the composition of two or more services. This which is the design goal behind the of the Service Oriented Architecture. Parallel to this scenario, we have the PEWS (Predicate Path-Expressions for Web Services) language, which speci es behavioural speci cations of composite web service interfaces.. The development of the PEWS language is divided into two parts: front-end and back-end. From a PEWS program, the front-end performs the lexical analysis, syntactic and semantic compositions and nally generate XML code. The function of the back-end is to execute the composition PEWS. This master's dissertation work aims to: (i) reformulate the proposed architecture for the runtime system of the language, (ii) Implement the back-end for PEWS by using .NET Framework tools to execute PEWS programs using the Windows Work ow Foundation

Conceptual model for adaptable and extensible visual data exploration

Interactive visual representations complement traditional statistical and machine learning techniques for data analysis, allowing users to play a more active role in a knowledge discovery process and making the whole process more understandable. Though visual representations are applicable to several stages of the knowledge discovery process, a common use of visualization is in the initial stages to explore and organize a sometimes unknown and complex data set. In this context, the integrated and coordinated - that is, user actions should be capable of affecting multiple visualizations when desired - use of multiple graphical representations allows data to be observed from several perspectives and offers richer information than isolated representations. In this paper we propose an underlying model for an extensible and adaptable environment that allows independently developed visualization components to be gradually integrated into a user configured knowledge discovery application. Because a major requirement when using multiple visual techniques is the ability to link amongst them, so that user actions executed on a representation propagate to others if desired, the model also allows runtime configuration of coordinated user actions over different visual representations. We illustrate how this environment is being used to assist data exploration and organization in a climate classification problem.

Análise da execução de um algoritmo numérico cbs para simulação de escoamento utilizando elementos finitos

This work intends to analyze the application and execution time of a numerical algorithm that simulates incompressible and isothermal flows. It was used the explicit scheme of the Characteristic Based Split (CBS) algorithm and the Artificial Compressibility (AC) scheme for coupling pressure-velocity equations. The discretization was done with the finite element method using a bilinear elements grid. The free software GNU-Octave was used for implementation and execution of routines. The results were analyzed using the classic lid-driven cavity problem. This work shows results for tests with several Reynolds' number. The results for these tests show a good agreement when compared with previous ones obtained from bibliography. The code runtime's analysis shows yet that the matrix's assembly is the part of greater consumption time in the implementation.

LUTS: A lightweight user-level transaction scheduler

Software Transactional Memory (STM) systems have poor performance under high contention scenarios. Since many transactions compete for the same data, most of them are aborted, wasting processor runtime. Contention management policies are typically used to avoid that, but they are passive approaches as they wait for an abort to happen so they can take action. More proactive approaches have emerged, trying to predict when a transaction is likely to abort so its execution can be delayed. Such techniques are limited, as they do not replace the doomed transaction by another or, when they do, they rely on the operating system for that, having little or no control on which transaction should run. In this paper we propose LUTS, a Lightweight User-Level Transaction Scheduler, which is based on an execution context record mechanism. Unlike other techniques, LUTS provides the means for selecting another transaction to run in parallel, thus improving system throughput. Moreover, it avoids most of the issues caused by pseudo parallelism, as it only launches as many system-level threads as the number of available processor cores. We discuss LUTS design and present three conflict-avoidance heuristics built around LUTS scheduling capabilities. Experimental results, conducted with STMBench7 and STAMP benchmark suites, show LUTS efficiency when running high contention applications and how conflict-avoidance heuristics can improve STM performance even more. In fact, our transaction scheduling techniques are capable of improving program performance even in overloaded scenarios. © 2011 Springer-Verlag.

Energy-performance tradeoffs in software transactional memory

Transactional memory (TM) is a new synchronization mechanism devised to simplify parallel programming, thereby helping programmers to unleash the power of current multicore processors. Although software implementations of TM (STM) have been extensively analyzed in terms of runtime performance, little attention has been paid to an equally important constraint faced by nearly all computer systems: energy consumption. In this work we conduct a comprehensive study of energy and runtime tradeoff sin software transactional memory systems. We characterize the behavior of three state-of-the-art lock-based STM algorithms, along with three different conflict resolution schemes. As a result of this characterization, we propose a DVFS-based technique that can be integrated into the resolution policies so as to improve the energy-delay product (EDP). Experimental results show that our DVFS-enhanced policies are indeed beneficial for applications with high contention levels. Improvements of up to 59% in EDP can be observed in this scenario, with an average EDP reduction of 16% across the STAMP workloads. © 2012 IEEE.

Análise de assimetria dos membros inferiores por meio de salto horizontal unipodal e resistência muscular unilateral utilizando Leg Press horizontal

Pós-graduação em Engenharia Mecânica - FEG

Ambiente independente de idioma para suporte a identificação de tuplas duplicadas por meio da similaridade fonética e numérica: otimização de algoritmo baseado em multithreading

Pós-graduação em Ciência da Computação - IBILCE

Califorídeos (Diptera, Oestroidea) associados a cadáveres suínos em uma área de cerrado na reserva ecológica do Inhamum, Caxias, Maranhão, Brasil: subsídios para aplicação em processos forenses

O presente estudo teve como objetivo conhecer a fauna e o padrão de distribuição temporal de califorídeos que colonizam cadáveres suínos em uma área de cerrado na Reserva Ecológica do Inhamum (REI), Caxias, MA. Foram realizados dois experimentos, um no período seco (julho a agosto/2010) e o outro no período chuvoso (março a abril/2011). Em cada experimento foram utilizados três suínos de 12 kg cada, colocados em gaiola de metal. Sobre cada gaiola foi colocada uma “armadilha do tipo suspensa” para capturar os califorídeos adultos que visitassem os cadáveres suínos. Bandejas com serragem foram acopladas debaixo das gaiolas, para coleta de imaturos. Foram obtidos 51.234 espécimes de califorídeos, sendo 25.093 de adultos coletados e 26.141 de adultos criados. Foram identificadas as seguintes espécies: Chloroprocta idioidea (Robineau-Desvoidy, 1830) Chrysomya albiceps (Wiedemann, 1819), Chrysomya megacephala (Fabricius, 1794), Chrysomya rufifacies (Macquart, 1843), Cochliomyia macellaria (Fabricius, 1775), Hemilucilia benoisti Séguy, 1925, Hemilucilia segmentaria (Fabricius, 1805), Hemilucilia townsendi Shannon, 1926, Lucilia eximia (Wiedemann, 1818) e Lucilia sp1. Chrysomya rufifacies e H. townsendi são novos registros para o Brasil. Cochliomyia macellaria e C. idioidea foram as mais abundantes, em relação aos adultos coletados, enquanto que C. albiceps e C. rufifacies foram as mais abundantes entre os adultos criados. Apenas as espécies do gênero Hemilucilia não se criaram nos cadáveres suínos. A duração da decomposição dos cadáveres suínos foi, em média, de 10 dias e não variou entre os perídos seco e chuvoso, assim como a duração de cada estágio também foi semelhante entre os períodos. As durações dos estágios de decomposição foram diferentes entre si, sendo que o estágio de fermentação foi o mais duradouro. As espécies adultas coletadas de L. eximia, C. idioidea e C. macellaria foram pioneiras na colonização dos cadáveres suínos e estiveram presentes em todos os estágios de decomposição, mas somente L. eximia apresentou associação com o estágio Inicial, segundo o índice de IndVal. Os imaturos de L. eximia foram os primeiros a abandonarem os cadáveres para empuparem no solo, seguidos pelos imaturos de C. macellaria, C. albiceps e C. rufifacies. Segundo o índice de IndVal, os adultos coletados das espécies H. townsendi e H. benoisti foram as únicas que apresentaram associação a apenas um estágio, o de Inchamento; C. rufifacies e C. megacephala apresentaram associação aos estágios de Putrefação Escura e Fermentação; e as demais espécies apresentaram associação a quatro estágios. Em relação aos adultos criados, L. eximia e C. macellaria foram as únicas que apresentaram associação ao estágio de Inchamento, enquanto que C. albiceps e C. rufifacies, as únicas que apresentaram associação ao estágio seco. Os valores de abundância das espécies adultas coletadas de L. eximia, C. idioidea, C. macellaria, C. albiceps e C. rufifacies diferiram entre os estágios de decomposição, sendo que, o de Putrefação Escura foi o mais atrativo. Os valores de abundância dos adultos criados de C. albiceps, C. rufifacies e L. eximia também diferiram entre os estágios, sendo que, o estágio seco foi onde ocorreu maior abundância das espécies de Chrysomya e o de Putrefação Escura, o de L. eximia. Os adultos coletados de L. eximia e C. idioidea, e os adultos criados de C. rufifacies foram mais abundantes no período chuvoso. Em relação aos adultos coletados, a análise de ordenação demonstrou que as comunidades de califorídeos apresentaram maior semelhança entre os estágios de Putrefação Escura, Fermentação e Seco, devido aos maiores valores de riqueza e abundância; no entanto, em relação aos adultos criados, as comunidades dos estágios de Fermentação e Seco foram as mais semelhantes. Estes resultados contribuem para o entendimento do processo de sucessão das espécies de califorídeos adultos visitantes e criados durante a decomposição de cadáveres suínos em uma área de cerrado do estado do Maranhão.

Surto de intoxicação por sal em ovinos no estado do Pará

O presente trabalho relata um surto de intoxicação por sal em ovinos no Brasil, em uma propriedade no estado do Pará. De um total de 545 ovinos, oito animais adoeceram (1,46%) e quatro destes morreram (50%). A avaliação das instalações e do manejo indicaram como fatores predisponentes a ingestão excessiva de mistura mineral e a restrição hídrica. Os principais sinais clínicos foram decúbito, diminuição ou ausência da sensibilidade cutânea, ausência dos reflexos de ameaça, palpebral e auricular, midríase, nistagmo, opistótono, espasticidade de membros, sonolência e estupor. Havia ainda, timpanismo, diarreia, taquipneia, taquicardia, desidratação e poliúria. A evolução do quadro clínico nos animais que morreram variou de duas horas e meia a 48 horas. As médias das concentrações séricas de sódio e de potássio de 31 ovinos do mesmo lote afetado pela intoxicação, em amostras colhidas durante o surto, revelaram hipernatremia (190mEq/l) e hipercalemia (8,2mEq/l). À necropsia, observou-se em um animal, achatamento das circunvoluções cerebrais. Microscopicamente, neste animal, evidenciou-se vacuolização moderada do neurópilo, particularmente nas lâminas intermediárias do córtex cerebral, com aumento dos espaços perineural e perivascular. Nessas áreas foram observados ainda, acentuada tumefação e edema dos astrócitos e necrose neuronal aguda. A dosagem de sódio no encéfalo de um ovino, revelou-se elevada com valor de 3.513ppm. O diagnóstico foi realizado com base na epidemiologia, nos sinais clínicos, nas lesões macro e microscópicas e nas dosagens de sódio no soro e no encéfalo dos ovinos.