Comportamento de mergulho do boto-cinza, Sotalia guianensis, na enseada do Curral, Praia de Pipa-RN, Brasil :possíveis adaptações cardíacas ao mergulho

The marine tucuxi, Sotalia guianensis, is one of the smallest known cetaceans, has coastal habits, and occurs from Hondures to Santa Catarina, in southern Brazil. The objective of this dissertation was to describe diving behavior of the marine tucuxi in three age classes and to analyze the cardiac capacity to dive through the examination of hearts of stranded specimens. Observations were made from October 2004 to November 2005 from a vantage point, in Curral Bay at Pipa beach-RN. We used Ad Libitum sampling and All occurrences to record the behaviors. The diving was characterized by the total exposition of the tail fluke for a few seconds, in 90° or 45° angles. Were recorded 131 dives in three behavioral contexts: foraging, traveling and socialization. The difference between juveniles and adults in dive time and fluke out at 45° or 90° to search and/or capture prey is probably influenced by the strategy used and ability to capture the prey. The frequency of fluke out at 90° for foraging in adults may be related to increased physiological efficiency of adults in comparison to juveniles. However, in the context of travel and socialization the dive time and fluke out were independent between the age classes. Dive in calves were frequent during socialization (play behavior) and traveling. This, associated with synchronic calve-adult diving suggests that a relationship of these behaviors and the acquisition of experience and foraging skills. As observed in other cetaceans, the heart (n=12) of the estuarine dolphin is broad and presents long ventricles which form a round apex. The right ventricle is long and narrow. The degree of dilatation of the aortic bulb may support the heart during diastole. The characteristic morphology of the heart and short dive duration < 2 min and depth ranged from 10m in the estuarine dolphin, can be likely at physiological adaptation for diving, typical de dolphins with coastal habits. The limitation of diving time in this specie may be influenced by anatomical and physiological restrictions

Síntese, caracterização e avaliação catalítica do silicoaluminofosfato SAPO-11 sulfatado

Due to environmental restrictions around the world, clean catalytic technology are of fundamental importance in the petrochemical industry and refineries. Creating the face of this a great interest in replacing the liquid acids for solid acids, so as molecular sieves have been extensively studied in reactions involving the acid catalysis to produce chemical substances with a high potential of quality. Being the activity of the catalysts involved in the reaction attributed to the acid character of them involved for the Lewis and Brönsted acid sites. Based on this context, this study aimed to prepare catalysts acids using a molecular sieve silicoalumino-phosphate (SAPO-11) synthesized in hidrotermical conditions and sulphated with sulphuric acid at different concentrations, using to it the method of controlled impregnating. The samples resulting from this process were characterized by x-ray difratometry (DRX), scanning electron microscopy (SEM), Fourier transform infrared spectroscopy (FT-IR), thermal analysis (TG-DTG) and determination of total acidity (by n-butilamin adsorption). The results show that the synthesis method used was efficient in the formation of AEL structure of SAPO-11 and when being incorporated the sulfate groups in this structure the acidity of the material was increased, pointing out that to very high concentrations of acid there is a trend of decrease the main peaks that form the structure. Finally they were tested catalytictly by the reaction model of conversion of m-xylene which showed favorable results of conversion for this catalyst, showing to be more selective of cracking products than isomerization, as expected, in order that for the o-xylene selectivity there was no positive change when to sulfate a sample of SAPO-11, while for light gases of C1-C4 this selectivity was remarkably observed

Obtenção de polímeros graftizados de quitosana e estudo das propriedades físico-químicas para aplicação na indústria do petróleo

Chitosan is a biopolymer derived from the shells of crustaceans, biodegradable, inexpensive and renewable with important physical and chemical properties. Moreover, the different modifications possible in its chemical structure generate new properties, making it an attractive polysaccharide owing to its range of potential applications. Polymers have been used in oil production operations. However, growing concern over environmental constraints has prompted oil industry to search for environmentally sustainable materials. As such, this study sought to obtain chitosan derivatives grafted with hydrophilic (poly(ethylene glycol), mPEG) and/or hydrophobic groups (n-dodecyl) via a simple (one-pot) method and evaluate their physicochemical properties as a function of varying pH using rheology, small-angle Xray scattering (SAXS), dynamic light scattering (DLS) and zeta potential. The chitosan derivatives were prepared using reductive alkylation under mild reaction conditions and the chemical structure of the polymers was characterized by nuclear magnetic resonance (1H NMR) and CHN elemental analysis. Considering a constant mPEG/Chitosan molar ratio on modification of chitosan, the solubility of the polymer across a wide pH range (acidic, neutral and basic) could only be improved when some of the amino groups were submitted to reacetylation using the one-pot method. Under these conditions, solubility is maintained even with the simultaneous insertion of n-dodecyl. On the other hand, the solubility of derivatives obtained only through mPEG incorporation using the traditional methodology, or with the ndodecyl group, was similar to that of its precursor. The hydrophilic group promoted decreased viscosity of the polymer solutions at 10 g/L in acid medium. However, at basic pH, both viscosity and thermal stability increased, as well as exhibited a pronounced pseudoplastic behavior, suggesting strong intermolecular associations in the alkaline medium. The SAXS results showed a polyelectrolyte behavior with the decrease in pH for the polymer systems. DLS analyses revealed that although the dilute polymer solutions at 1 g/L and pH 3 exhibited a high density of protonated amino groups along the polymer chain, the high degree of charge contributed significantly to aggregation, promoting increased particle size with the decrease in pH. Furthermore, the hydrophobic group also contributed to increasing the size of aggregates in solution at pH 3, whereas the hydrophilic group helped reduce their size across the entire pH range. Nevertheless, the nature of aggregation was dependent on the pH of the medium. Zeta potential results indicated that its values do not depend solely on the surface charge of the particle, but are also dependent on the net charge of the medium. In this study, water soluble associative polymers exhibit properties that can be of great interest in the petroleum industry

Uma estratégia dirigida a modelos e baseada em linguagem de descrição arquitetural para linhas de produtos de software

Model-oriented strategies have been used to facilitate products customization in the software products lines (SPL) context and to generate the source code of these derived products through variability management. Most of these strategies use an UML (Unified Modeling Language)-based model specification. Despite its wide application, the UML-based model specification has some limitations such as the fact that it is essentially graphic, presents deficiencies regarding the precise description of the system architecture semantic representation, and generates a large model, thus hampering the visualization and comprehension of the system elements. In contrast, architecture description languages (ADLs) provide graphic and textual support for the structural representation of architectural elements, their constraints and interactions. This thesis introduces ArchSPL-MDD, a model-driven strategy in which models are specified and configured by using the LightPL-ACME ADL. Such strategy is associated to a generic process with systematic activities that enable to automatically generate customized source code from the product model. ArchSPLMDD strategy integrates aspect-oriented software development (AOSD), modeldriven development (MDD) and SPL, thus enabling the explicit modeling as well as the modularization of variabilities and crosscutting concerns. The process is instantiated by the ArchSPL-MDD tool, which supports the specification of domain models (the focus of the development) in LightPL-ACME. The ArchSPL-MDD uses the Ginga Digital TV middleware as case study. In order to evaluate the efficiency, applicability, expressiveness, and complexity of the ArchSPL-MDD strategy, a controlled experiment was carried out in order to evaluate and compare the ArchSPL-MDD tool with the GingaForAll tool, which instantiates the process that is part of the GingaForAll UML-based strategy. Both tools were used for configuring the products of Ginga SPL and generating the product source code

Melhorando a estimação de pose com o RANSAC preemptivo generalizado e múltiplos geradores de hipóteses

The camera motion estimation represents one of the fundamental problems in Computer Vision and it may be solved by several methods. Preemptive RANSAC is one of them, which in spite of its robustness and speed possesses a lack of flexibility related to the requirements of applications and hardware platforms using it. In this work, we propose an improvement to the structure of Preemptive RANSAC in order to overcome such limitations and make it feasible to execute on devices with heterogeneous resources (specially low budget systems) under tighter time and accuracy constraints. We derived a function called BRUMA from Preemptive RANSAC, which is able to generalize several preemption schemes, allowing previously fixed parameters (block size and elimination factor) to be changed according the applications constraints. We also propose the Generalized Preemptive RANSAC method, which allows to determine the maximum number of hipotheses an algorithm may generate. The experiments performed show the superiority of our method in the expected scenarios. Moreover, additional experiments show that the multimethod hypotheses generation achieved more robust results related to the variability in the set of evaluated motion directions

Algorítmo evolucionário para a distribuição de produtos de petróleo por redes de polidutos

The distribution of petroleum products through pipeline networks is an important problem that arises in production planning of refineries. It consists in determining what will be done in each production stage given a time horizon, concerning the distribution of products from source nodes to demand nodes, passing through intermediate nodes. Constraints concerning storage limits, delivering time, sources availability, limits on sending or receiving, among others, have to be satisfied. This problem can be viewed as a biobjective problem that aims at minimizing the time needed to for transporting the set of packages through the network and the successive transmission of different products in the same pipe is called fragmentation. This work are developed three algorithms that are applied to this problem: the first algorithm is discrete and is based on Particle Swarm Optimization (PSO), with local search procedures and path-relinking proposed as velocity operators, the second and the third algorithms deal of two versions based on the Non-dominated Sorting Genetic Algorithm II (NSGA-II). The proposed algorithms are compared to other approaches for the same problem, in terms of the solution quality and computational time spent, so that the efficiency of the developed methods can be evaluated

MoSAC: um módulo para seleção de configurações arquiteturais baseado em critérios de QoS no contexto de sistema distribuídos autoadaptativos

The process for choosing the best components to build systems has become increasingly complex. It becomes more critical if it was need to consider many combinations of components in the context of an architectural configuration. These circumstances occur, mainly, when we have to deal with systems involving critical requirements, such as the timing constraints in distributed multimedia systems, the network bandwidth in mobile applications or even the reliability in real-time systems. This work proposes a process of dynamic selection of architectural configurations based on non-functional requirements criteria of the system, which can be used during a dynamic adaptation. This proposal uses the MAUT theory (Multi-Attribute Utility Theory) for decision making from a finite set of possibilities, which involve multiple criteria to be analyzed. Additionally, it was proposed a metamodel which can be used to describe the application s requirements in terms of the non-functional requirements criteria and their expected values, to express them in order to make the selection of the desired configuration. As a proof of concept, it was implemented a module that performs the dynamic choice of configurations, the MoSAC. This module was implemented using a component-based development approach (CBD), performing a selection of architectural configurations based on the proposed selection process involving multiple criteria. This work also presents a case study where an application was developed in the context of Digital TV to evaluate the time spent on the module to return a valid configuration to be used in a middleware with autoadaptative features, the middleware AdaptTV

GingaForAll: linha de Produtos do Middleware Ginga

Many challenges have been imposed on the middleware to support applications for digital TV because of the heterogeneity and resource constraints of execution platforms. In this scenario, the middleware must be highly configurable so that it can be customized to meet the requirements of applications and underlying platforms. This work aims to present the GingaForAll, a software product line developed for the Ginga - the middleware of the Brazilian Digital TV (SBTVD). GingaForAll adds the concepts of software product line, aspect orientation and model-driven development to allow: (i) the specification of the common characteristics and variables of the middleware, (ii) the modularization of crosscutting concerns - both mandatory and concepts variables - through aspects, (iii) the expression of concepts as a set of models that increase the level of abstraction and enables management of various software artifacts in terms of configurable models. This work presents the architecture of the software product line that implements such a tool and architecture that supports automatic customization of middleware. The work also presents a tool that implements the process of generating products GingaForAll

KitSmart: Uma biblioteca de componentes para o desenvolvimento rigoroso de aplicações Java Card com o método B

The development of smart card applications requires a high level of reliability. Formal methods provide means for this reliability to be achieved. The BSmart method and tool contribute to the development of smart card applications with the support of the B method, generating Java Card code from B specifications. For the development with BSmart to be effectively rigorous without overloading the user it is important to have a library of reusable components built in B. The goal of KitSmart is to provide this support. A first research about the composition of this library was a graduation work from Universidade Federal do Rio Grande do Norte, made by Thiago Dutra in 2006. This first version of the kit resulted in a specification of Java Card primitive types byte, short and boolean in B and the creation of reusable components for application development. This work provides an improvement of KitSmart with the addition of API Java Card specification made in B and a guide for the creation of new components. The API Java Card in B, besides being available to be used for development of applications, is also useful as a documentation of each API class. The reusable components correspond to modules to manipulate specific structures, such as date and time. These structures are not available for B or Java Card. These components for Java Card are generated from specifications formally verified in B. The guide contains quick reference on how to specify some structures and how some situations were adapted from object-orientation to the B Method. This work was evaluated through a case study made through the BSmart tool, that makes use of the KitSmart library. In this case study, it is possible to see the contribution of the components in a B specification. This kit should be useful for B method users and Java Card application developers

Geração automática de hardware apartir de especificações formais: estendendo uma abordagem de tradução

A remoção de inconsistências em um projeto é menos custosa quando realizadas nas etapas iniciais da sua concepção. A utilização de Métodos Formais melhora a compreensão dos sistemas além de possuir diversas técnicas, como a especificação e verificação formal, para identificar essas inconsistências nas etapas iniciais de um projeto. Porém, a transformação de uma especificação formal para uma linguagem de programação é uma tarefa não trivial. Quando feita manualmente, é uma tarefa passível da inserção de erros. O uso de ferramentas que auxiliem esta etapa pode proporcionar grandes benefícios ao produto final a ser desenvolvido. Este trabalho propõe a extensão de uma ferramenta cujo foco é a tradução automática de especificações em CSPm para Handel-C. CSP é uma linguagem de descrição formal adequada para trabalhar com sistemas concorrentes. Handel-C é uma linguagem de programação cujo resultado pode ser compilado diretamente para FPGA's. A extensão consiste no aumento no número de operadores CSPm aceitos pela ferramenta, permitindo ao usuário definir processos locais, renomear canais e utilizar guarda booleana em escolhas externas. Além disto, propomos também a implementação de um protocolo de comunicação que elimina algumas restrições da composição paralela de processos na tradução para Handel-C, permitindo que a comunicação entre múltiplos processos possa ser mapeada de maneira consistente e que a mesma somente ocorra quando for autorizada.

Geração automática de hardware a partir de especificações formais: estendendo uma abordagem de tradução

Removing inconsistencies in a project is a less expensive activity when done in the early steps of design. The use of formal methods improves the understanding of systems. They have various techniques such as formal specification and verification to identify these problems in the initial stages of a project. However, the transformation from a formal specification into a programming language is a non-trivial task and error prone, specially when done manually. The aid of tools at this stage can bring great benefits to the final product to be developed. This paper proposes the extension of a tool whose focus is the automatic translation of specifications written in CSPM into Handel-C. CSP is a formal description language suitable for concurrent systems, and CSPM is the notation used in tools support. Handel-C is a programming language whose result can be compiled directly into FPGA s. Our extension increases the number of CSPM operators accepted by the tool, allowing the user to define local processes, to rename channels in a process and to use Boolean guards on external choices. In addition, we also propose the implementation of a communication protocol that eliminates some restrictions on parallel composition of processes in the translation into Handel-C, allowing communication in a same channel between multiple processes to be mapped in a consistent manner and that improper communication in a channel does not ocurr in the generated code, ie, communications that are not allowed in the system specification

Avaliação da execução de aplicações orientadas à dados na arquitetura de redes em chip IPNoSys

The increasing complexity of integrated circuits has boosted the development of communications architectures like Networks-on-Chip (NoCs), as an architecture; alternative for interconnection of Systems-on-Chip (SoC). Networks-on-Chip complain for component reuse, parallelism and scalability, enhancing reusability in projects of dedicated applications. In the literature, lots of proposals have been made, suggesting different configurations for networks-on-chip architectures. Among all networks-on-chip considered, the architecture of IPNoSys is a non conventional one, since it allows the execution of operations, while the communication process is performed. This study aims to evaluate the execution of data-flow based applications on IPNoSys, focusing on their adaptation against the design constraints. Data-flow based applications are characterized by the flowing of continuous stream of data, on which operations are executed. We expect that these type of applications can be improved when running on IPNoSys, because they have a programming model similar to the execution model of this network. By observing the behavior of these applications when running on IPNoSys, were performed changes in the execution model of the network IPNoSys, allowing the implementation of an instruction level parallelism. For these purposes, analysis of the implementations of dataflow applications were performed and compared

Uma investigação de algoritmos exatos e metaheurísticos aplicados ao nonograma

Nonogram is a logical puzzle whose associated decision problem is NP-complete. It has applications in pattern recognition problems and data compression, among others. The puzzle consists in determining an assignment of colors to pixels distributed in a N  M matrix that satisfies line and column constraints. A Nonogram is encoded by a vector whose elements specify the number of pixels in each row and column of a figure without specifying their coordinates. This work presents exact and heuristic approaches to solve Nonograms. The depth first search was one of the chosen exact approaches because it is a typical example of brute search algorithm that is easy to implement. Another implemented exact approach was based on the Las Vegas algorithm, so that we intend to investigate whether the randomness introduce by the Las Vegas-based algorithm would be an advantage over the depth first search. The Nonogram is also transformed into a Constraint Satisfaction Problem. Three heuristics approaches are proposed: a Tabu Search and two memetic algorithms. A new function to calculate the objective function is proposed. The approaches are applied on 234 instances, the size of the instances ranging from 5 x 5 to 100 x 100 size, and including logical and random Nonograms

BTS:uma ferramenta de suporte ao desenvolvimento sistemático de sistemas confiáveis baseados em componentes

The component-based development of systems revolutionized the software development process, facilitating the maintenance, providing more confiability and reuse. Nevertheless, even with all the advantages of the development of components, their composition is an important concern. The verification through informal tests is not enough to achieve a safe composition, because they are not based on formal semantic models with which we are able to describe precisally a system s behaviour. In this context, formal methods provide ways to accurately specify systems through mathematical notations providing, among other benefits, more safety. The formal method CSP enables the specification of concurrent systems and verification of properties intrinsic to them, as well as the refinement among different models. Some approaches apply constraints using CSP, to check the behavior of composition between components, assisting in the verification of those components in advance. Hence, aiming to assist this process, considering that the software market increasingly requires more automation, reducing work and providing agility in business, this work presents a tool that automatizes the verification of composition among components, in which all complexity of formal language is kept hidden from users. Thus, through a simple interface, the tool BST (BRIC-Tool-Suport) helps to create and compose components, predicting, in advance, undesirable behaviors in the system, such as deadlocks

Avaliando a robustez e manutenibilidade do comportamento excepcional de aplicações C#

Mainstream programming languages provide built-in exception handling mechanisms to support robust and maintainable implementation of exception handling in software systems. Most of these modern languages, such as C#, Ruby, Python and many others, are often claimed to have more appropriated exception handling mechanisms. They reduce programming constraints on exception handling to favor agile changes in the source code. These languages provide what we call maintenance-driven exception handling mechanisms. It is expected that the adoption of these mechanisms improve software maintainability without hindering software robustness. However, there is still little empirical knowledge about the impact that adopting these mechanisms have on software robustness. This work addresses this gap by conducting an empirical study aimed at understanding the relationship between changes in C# programs and their robustness. In particular, we evaluated how changes in the normal and exceptional code were related to exception handling faults. We applied a change impact analysis and a control flow analysis in 100 versions of 16 C# programs. The results showed that: (i) most of the problems hindering software robustness in those programs are caused by changes in the normal code, (ii) many potential faults were introduced even when improving exception handling in C# code, and (iii) faults are often facilitated by the maintenance-driven flexibility of the exception handling mechanism. Moreover, we present a series of change scenarios that decrease the program robustness