Uma arquitetura de software baseada em componentes visualização de informações industriais

Due to the current need of the industry to integrate data of the beginning of production originating from of several sources and of transforming them in useful information for sockets of decisions, a search exists every time larger for systems of visualization of information that come to collaborate with that functionality. On the other hand, a common practice nowadays, due to the high competitiveness of the market, it is the development of industrial systems that possess characteristics of modularity, distribution, flexibility, scalability, adaptation, interoperability, reusability and access through web. Those characteristics provide an extra agility and a larger easiness in adapting to the frequent changes of demand of the market. Based on the arguments exposed above, this work consists of specifying a component-based architecture, with the respective development of a system based on that architecture, for the visualization of industrial data. The system was conceived to be capable to supply on-line information and, optionally, historical information of variables originating from of the beginning of production. In this work it is shown that the component-based architecture developed possesses the necessary requirements for the obtaining of a system robust, reliable and of easy maintenance, being, like this, in agreement with the industrial needs. The use of that architecture allows although components can be added, removed or updated in time of execution, through a manager of components through web, still activating more the adaptation process and updating of the system

Algoritmos genéticos: uso de lógica nebulosa e análise de convergência por cadeia de Markov

In this work, the Markov chain will be the tool used in the modeling and analysis of convergence of the genetic algorithm, both the standard version as for the other versions that allows the genetic algorithm. In addition, we intend to compare the performance of the standard version with the fuzzy version, believing that this version gives the genetic algorithm a great ability to find a global optimum, own the global optimization algorithms. The choice of this algorithm is due to the fact that it has become, over the past thirty yares, one of the more importan tool used to find a solution of de optimization problem. This choice is due to its effectiveness in finding a good quality solution to the problem, considering that the knowledge of a good quality solution becomes acceptable given that there may not be another algorithm able to get the optimal solution for many of these problems. However, this algorithm can be set, taking into account, that it is not only dependent on how the problem is represented as but also some of the operators are defined, to the standard version of this, when the parameters are kept fixed, to their versions with variables parameters. Therefore to achieve good performance with the aforementioned algorithm is necessary that it has an adequate criterion in the choice of its parameters, especially the rate of mutation and crossover rate or even the size of the population. It is important to remember that those implementations in which parameters are kept fixed throughout the execution, the modeling algorithm by Markov chain results in a homogeneous chain and when it allows the variation of parameters during the execution, the Markov chain that models becomes be non - homogeneous. Therefore, in an attempt to improve the algorithm performance, few studies have tried to make the setting of the parameters through strategies that capture the intrinsic characteristics of the problem. These characteristics are extracted from the present state of execution, in order to identify and preserve a pattern related to a solution of good quality and at the same time that standard discarding of low quality. Strategies for feature extraction can either use precise techniques as fuzzy techniques, in the latter case being made through a fuzzy controller. A Markov chain is used for modeling and convergence analysis of the algorithm, both in its standard version as for the other. In order to evaluate the performance of a non-homogeneous algorithm tests will be applied to compare the standard fuzzy algorithm with the genetic algorithm, and the rate of change adjusted by a fuzzy controller. To do so, pick up optimization problems whose number of solutions varies exponentially with the number of variables

Estudos de algumas ferramentas de coleta e visualização de dados e desempenho de aplicações paralelas no ambiente MPI

The last years have presented an increase in the acceptance and adoption of the parallel processing, as much for scientific computation of high performance as for applications of general intention. This acceptance has been favored mainly for the development of environments with massive parallel processing (MPP - Massively Parallel Processing) and of the distributed computation. A common point between distributed systems and MPPs architectures is the notion of message exchange, that allows the communication between processes. An environment of message exchange consists basically of a communication library that, acting as an extension of the programming languages that allow to the elaboration of applications parallel, such as C, C++ and Fortran. In the development of applications parallel, a basic aspect is on to the analysis of performance of the same ones. Several can be the metric ones used in this analysis: time of execution, efficiency in the use of the processing elements, scalability of the application with respect to the increase in the number of processors or to the increase of the instance of the treat problem. The establishment of models or mechanisms that allow this analysis can be a task sufficiently complicated considering parameters and involved degrees of freedom in the implementation of the parallel application. An joined alternative has been the use of collection tools and visualization of performance data, that allow the user to identify to points of strangulation and sources of inefficiency in an application. For an efficient visualization one becomes necessary to identify and to collect given relative to the execution of the application, stage this called instrumentation. In this work it is presented, initially, a study of the main techniques used in the collection of the performance data, and after that a detailed analysis of the main available tools is made that can be used in architectures parallel of the type to cluster Beowulf with Linux on X86 platform being used libraries of communication based in applications MPI - Message Passing Interface, such as LAM and MPICH. This analysis is validated on applications parallel bars that deal with the problems of the training of neural nets of the type perceptrons using retro-propagation. The gotten conclusions show to the potentiality and easinesses of the analyzed tools.

Caracterização da frequência de atividades aéreas do golfinho-rotador, Stenella longirostris (Gray, 1828), na Baía dos Golfinhos do Parque Nacional Marinho de Fernando de Noronha

The aerial activities, leaps and slaps with parts of the body in the surface of water, are part of the behavioral repertoire of several species of cetaceans. Among them, the spinner dolphin, Stenella longirostris, shows greater diversity in such behavior. For the spinner dolphins of Fernando de Noronha, the aerial activities are classified as vertical and horizontal, with eight patterns to be noted (tail slap, head slap, motor boating, partial leap, leap, spin, tail over head and tail over head with spin) discriminated between these categories. Such behaviors can be used as a parameter to identify behavioral changes, as well as patterns of daily and seasonal activity. In this manner, this study aimed to characterize the frequency in performance of such activity while the dolphins were within the Dolphin Bay of Fernando de Noronha, and verify possible daily and seasonal hourly fluctuations on such behaviors. The data analyzed in this study was acquired during the period of January 2006 through December 2010, totaling 1431 days of observation from land set point, with 113027 aerial activities registered, daily average of 72,27 (SD=96,10). During 5478h and 54 min of observation the horizontal aerial activity was the most observed and rotation was the most executed pattern. Greater frequency of execution of aerial activity was observed in adults, but for both adults and calves, was observed a predominance of horizontal activities, with spin being the pattern most executed. Positive correlation was observed between the amount of aerial activity performed and the number of animals inside the Bay. Hourly daily fluctuation was observed in the expression of aerial activities by spinner dolphins, and was observed a peak of activity between 8h and 8h59min for the overall frequency relative of aerial activities, as well as for the categories and patterns. Seasonal differences were observed between the rainy and dry season with the greater amount of activity being observed during the rainy season. Nevertheless, the same profile of frequency relative of aerial activity was observed in both seasons with the peak amount being during the same period. When discriminated the aerial activities in categories and patterns, for both seasons, there was a similar pattern of hourly fluctuation; for most of parameters, higher frequency relative of execution of aerial activity remain between 8h and 8h59min

Influência da idade, do sexo e da hora do dia no desempenho em teste de labirinto

The increase of elderly population in the world and in Brazil has indicated the necessity of health systems capable to evaluate, to diagnose and to intervene in the conditions of health and disease of that segment. During that stage of human development, physical and cognitive changes happen and they are capable to influence the functional acting. It s important to distinguish the limit between the normal and the pathological. Besides the common changes during the aging, biological rhithmicity changes happen, as alterations in the cycle vigil-sleep that can influence in certain tasks performance. This study aimed to verify the influence of the age, of the sex and of the hour in a maze test performance. Eighty individuals were evaluated, 40 youths (20 men and 20 women) and 40 senior (20 men and 20 women). They were separated in 2 different groups that were tested at 9:00 o clock and at 15:00 o clock. Initially they were submitted to health evaluation, cognitive evaluation and of sleep quality and chronotype. They were instructed to accomplish the maze test whose time of execution was timed and registered. Significant differences were observed according to age for the masculine group between elderly in the morning and in the afternoon and in the feminine group between youth and elderly in the test accomplished in the morning and in the afternoon. Significant differences were not observed according to sex and hour of the day and also between attempts. In compare between the 30th and the31st, accomplished in a 15minutes of interval, significant difference was observed just for the elderly group in the morning and in the afternoon. We observed significant correlations in the maze test performance with the cronotype, with the age, with the education and with the cognitive acting. The maze test was capable to detect differences between age in the acting profile and in the evaluation of the information maintenance after 15 minutes, however it was not possible to verify difference between sex and hour of the day. Finally the correlations of the maze test with another varied may indicate your importance as coadjutant instrument in those functions evaluation

O problema biobjetivo da árvore geradora quadrática em adjacência de arestas

The Quadratic Minimum Spanning Tree Problem (QMST) is a version of the Minimum Spanning Tree Problem in which, besides the traditional linear costs, there is a quadratic structure of costs. This quadratic structure models interaction effects between pairs of edges. Linear and quadratic costs are added up to constitute the total cost of the spanning tree, which must be minimized. When these interactions are restricted to adjacent edges, the problem is named Adjacent Only Quadratic Minimum Spanning Tree (AQMST). AQMST and QMST are NP-hard problems that model several problems of transport and distribution networks design. In general, AQMST arises as a more suitable model for real problems. Although, in literature, linear and quadratic costs are added, in real applications, they may be conflicting. In this case, it may be interesting to consider these costs separately. In this sense, Multiobjective Optimization provides a more realistic model for QMST and AQMST. A review of the state-of-the-art, so far, was not able to find papers regarding these problems under a biobjective point of view. Thus, the objective of this Thesis is the development of exact and heuristic algorithms for the Biobjective Adjacent Only Quadratic Spanning Tree Problem (bi-AQST). In order to do so, as theoretical foundation, other NP-hard problems directly related to bi-AQST are discussed: the QMST and AQMST problems. Bracktracking and branch-and-bound exact algorithms are proposed to the target problem of this investigation. The heuristic algorithms developed are: Pareto Local Search, Tabu Search with ejection chain, Transgenetic Algorithm, NSGA-II and a hybridization of the two last-mentioned proposals called NSTA. The proposed algorithms are compared to each other through performance analysis regarding computational experiments with instances adapted from the QMST literature. With regard to exact algorithms, the analysis considers, in particular, the execution time. In case of the heuristic algorithms, besides execution time, the quality of the generated approximation sets is evaluated. Quality indicators are used to assess such information. Appropriate statistical tools are used to measure the performance of exact and heuristic algorithms. Considering the set of instances adopted as well as the criteria of execution time and quality of the generated approximation set, the experiments showed that the Tabu Search with ejection chain approach obtained the best results and the transgenetic algorithm ranked second. The PLS algorithm obtained good quality solutions, but at a very high computational time compared to the other (meta)heuristics, getting the third place. NSTA and NSGA-II algorithms got the last positions

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

Projeto e implementação em FPGA de um processador com conjunto de instrução reconfigurável utilizando VHDL

The Reconfigurable Computing is an intermediate solution at the resolution of complex problems, making possible to combine the speed of the hardware with the flexibility of the software. An reconfigurable architecture possess some goals, among these the increase of performance. The use of reconfigurable architectures to increase the performance of systems is a well known technology, specially because of the possibility of implementing certain slow algorithms in the current processors directly in hardware. Amongst the various segments that use reconfigurable architectures the reconfigurable processors deserve a special mention. These processors combine the functions of a microprocessor with a reconfigurable logic and can be adapted after the development process. Reconfigurable Instruction Set Processors (RISP) are a subgroup of the reconfigurable processors, that have as goal the reconfiguration of the instruction set of the processor, involving issues such formats, operands and operations of the instructions. This work possess as main objective the development of a RISP processor, combining the techniques of configuration of the set of executed instructions of the processor during the development, and reconfiguration of itself in execution time. The project and implementation in VHDL of this RISP processor has as intention to prove the applicability and the efficiency of two concepts: to use more than one set of fixed instructions, with only one set active in a given time, and the possibility to create and combine new instructions, in a way that the processor pass to recognize and use them in real time as if these existed in the fixed set of instruction. The creation and combination of instructions is made through a reconfiguration unit, incorporated to the processor. This unit allows the user to send custom instructions to the processor, so that later he can use them as if they were fixed instructions of the processor. In this work can also be found simulations of applications involving fixed and custom instructions and results of the comparisons between these applications in relation to the consumption of power and the time of execution, which confirm the attainment of the goals for which the processor was developed

Efeito da espasticidade sobre os padrões lineares de marcha em hemiparéticos

INTRODUÇÃO: A hemiparesia após o acidente vascular encefálico (AVE) é a sequela mais frequente, prejudicando a velocidade de execução dos movimentos automáticos, diminuindo a autonomia do indivíduo e gerando incapacidade. OBJETIVOS: Analisar o efeito da espasticidade nos padrões lineares de marcha (PLM) em indivíduos hemiparéticos. MÉTODOS: Foram estudados dois grupos: 20 indivíduos com AVE (G1) e 20 indivíduos sadios, destros, sem sequela neurológica (G2), com média de idade de 54,2 e 52,6 anos respectivamente. Foram avaliados os PLM pelo protocolo de Nagazaki, o tônus muscular pela escala de Ashworth modificada e o arco de movimento por goniometria. Foi feita comparação dos parâmetros nos dois grupos pelo teste t de Student e correlação de Spearman com nível de significância de 5%. RESULTADOS: A média da distância foi de 14,52 m e 32,16 m, e o tempo foi de 23,75 s e 19,02 s no G1 e G2 respectivamente (p < 0,0001). Na comparação entre os grupos, a amplitude média de passo e a velocidade média foram estatisticamente significantes (p < 0,05) e a cadência não mostrou significância (p = 0,1936). Quando os PLM foram comparados com o grau de espasticidade dos músculos gastrocnêmio e sóleo, mostraram associação negativa com distância, amplitude de passo e velocidade e associação positiva com o tempo (p < 0,05). CONCLUSÃO: Quanto maior o grau de espasticidade dos músculos gastrocnêmio e sóleo, menores serão os parâmetros lineares de marcha do indivíduo com sequela de hemiparesia pós-AVE.

Identificação de Enterobacter spp. através de técnicas convencionais e do sistema semi-automatizado Microscan (Autoscan-4)

A hundred and ninety-five (195) strains of Enterobacter spp., isolated from diverse clinical specimens - urine, feces, cateter, blood, wound, tracheal aspirate, vaginal fluid - were submitted to the conventional identification by biochemical tests, and were also submitted to the identification by panels NegCombo 20 of the system automated MicroScan - AutoScan- 4 (Dade Behring Inc., West Sacramento, CA, USA). The samples were from patients of the Clinical Laboratory from the School of Pharmacy and Biochemistry of UNOESTE, Presidente Prudente, SP, and from patients hospitalized at the University Hospital Domingos Leonardo Cerávolo, UNOESTE. Of the total of strains tested, 191 (97.9%) presented agreement between the two approaches utilized and 4 strains (2.1%) presented identification disagreement, that is, the genus identified was different in each approach. By this study, the conclusion is that both the approaches utilized for the identification presented advantages and disadvantages related to the cost, facility of execution, quickness, reliability and some other characteristics. Even so, our results showed that conventional methods represent a reliable tool for Enterobacter identification.

TAB2VHDL: um ambiente de síntese lógica para máquinas de estados finitos

Pós-graduação em Engenharia Elétrica - FEIS

Estudo das propriedades dielétricas e de bloqueio das monocamadas automontadas

Pós-graduação em Biotecnologia - IQ

Ensino apostilado na escola pública: tendência crescente nos municípios da região de São José do Rio Preto-SP

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Comportamento estrutural de lajes pré-moldadas treliçadas com adição de resíduos de borracha de pneu

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

O programa PEC - formação universitária e a formação de professores do ensino fundamental: uma avaliação

Pós-graduação em Educação - FFC