Nonlinear dynamics and control strategies: On a energy harvester vibrating system with a linear form to non-ideal motor torque

In this paper, we deal with the research of a vibrating model of an energy harvester device, including the nonlinearities in the model of the piezoelectric coupling and the non-ideal excitation. We show, using numerical simulations, in the analysis of the dynamic responses, that the harvested power is influenced by non-linear vibrations of the structure. Chaotic behavior was also observed, causing of the loss of energy throughout the simulation time. Using a perturbation technique, we find an approximate analytical solution for the non-ideal system. Then, we apply both two control techniques, to keep the considered system, into a stable condition. Both the State Dependent Ricatti Equation (SDRE) control as the feedback control by changing the energy of the oscillator, were efficient in controlling of the considered non-ideal system.

Bioremediation of direct dyes in simulated textile effluents by paramorphogenic form of Aspergillus oryzae

Azo dyes are extensively used for coloring textiles, paper, food, leather, drink, pharmaceutical products, cosmetics and inks. The textile industry consumes the largest amount of azo dyes, and it is estimated that approximately 10 - 15% of dyes used for coloring textiles might be lost in waste streams. Almost all azo dyes are synthetic and resist biodegradation, however, they can be readly reduced by a number of chemical and biological reducing systems. Biological treatment is advantageous over physical and chemical method as result of its low cost and little disturbance to the environment. This research focuses on the utilization of Aspergillus oryzae, to remove some kinds of azo dyes from aqueous solutions. The fungi, physically induced in its paramorphogenic form (called, pellets), were used in the dyes biosorption studies with both non autoclave and autoclaved hyphas, at differents pH values. Thus the goals are the removal of dyes by biosorption and the decrease of its toxicity.

Phenotypic and functional evaluations of peripheral blood monocytes from chronic-form paracoccidioidomycosis patients before and after treatment

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Overexpression of the activated form of the AtAREB1 gene (AtAREB1 Delta QT) improves soybean responses to water deficit

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

Um algoritmo de busca tabu para problemas de localização não capacitados

In this work, a tabu search algorithm for solving uncapacitated location problems is presented. The uncapacitated location problem is a classic problem of localization and occurs in many practical situations. The problem consists in determining in a network, at the minimum possible cost, the better localization, in a network, for the installation of facilities in order to attend the customers' associated demands, at the minimum possible cost. One admits that there exists a cost associated with the opening of a facility and a cost of attendance of each customer by any open facilities. In the particular case of the uncapacitated location problem there is no capacity limitation to attend the customers’ demands. There are some parameters in the algorithm that influence the solution’s quality. These parameters were tested and optimal values for them were obtained. The results show that the proposed algorithm is able to find the optimal solution for all small tested problems keeping the compromise between solution’s quality and computational time. However, to solve bigger problems, the structure of the algorithm must be changed in its structure. The implemented algorithm is integrated to a computational platform for solution of logistic problems

Algoritmo de resolução de EDO de primeira ordem com implementação em HTML

This work presents a theoretical study of ordinary differential equations of first order directed so as to provide basis for the development of an educational software that helps students and researchers confronted with this issue. The algorithm was developed in HTML language in to that the results provide a website that allows the audience to access the software anywhere which has internet connection

Implementação do algoritmo de Newman para identificação de comunidades em placas gráficas

Communities are present on physical, chemical and biological systems and their identification is fundamental for the comprehension of the behavior of these systems. Recently, available data related to complex networks have grown exponentially, demanding more computational power. The Graphical Processing Unit (GPU) is a cost effective alternative suitable for this purpose. We investigate the convenience of this for network science by proposing a GPU based implementation of Newman community detection algorithm. We showed that the processing time of matrix multiplications of GPUs grow slower than CPUs in relation to the matrix size. It was proven, thus, that GPU processing power is a viable solution for community dentification simulation that demand high computational power. Our implementation was tested on an integrated biological network for the bacterium Escherichia coli

Aplicação do algoritmo Rough Sets em um Data Warehouse

This Project aims to develop methods for data classification in a Data Warehouse for decision-making purposes. We also have as another goal the reduction of an attribute set in a Data Warehouse, in which a given reduced set is capable of keeping the same properties of the original one. Once we achieve a reduced set, we have a smaller computational cost of processing, we are able to identify non-relevant attributes to certain kinds of situations, and finally we are also able to recognize patterns in the database that will help us to take decisions. In order to achieve these main objectives, it will be implemented the Rough Sets algorithm. We chose PostgreSQL as our data base management system due to its efficiency, consolidation and finally, it’s an open-source system (free distribution)

Classificação e quantificação de tecidos Biológicos para construção de fantomas pediátricos

Paediatric diagnostic radiology can be considered as a separate specialty and with distinct characteristics of the radiology applied in adult patients. This in reason of the variability in the anatomical structures size and bigger sensitivity of tissues. The literature present in its majority methodologies for segmentation and tissue classification in adult patients, and works on tissue quantification are rare. This work had for objective the development of a biological tissue classifier and quantifier algorithm, from histograms, and that converts the quantified average thickness of these tissues for its respective simulator materials. The results will be used in the optimization process of paediatrics images, in future works, since these patients are frequently over exposed to the radiation in the repeated attempts of if getting considered good quality radiographic images. The developed algorithm was capable to read and store the name of all the archives, in the operational system, to filter artifacs, to count and quantify each biological tissues from the histogram of the examination, to obtain the biological tissues average thicknesses and to convert this value into its respective simulator material. The results show that it is possible to distinguish bone, soft, fat and pulmonary tissues from histograms of tomographic examinations of thorax. The quantification of the constituent materials of anthropomorphic phantom made by the algorithm, compared with the data of literature shows that the biggest difference was of 21,6% for bone. However, the literature shows that variations of up to 30% in bone thickness do not influence of significant form in the radiographic image quality. The average thicknesses of biological tissues, quantified for paediatrics patients, show that one phantom can simulate patients with distinct DAP ranges, since variations... (Complete abstract click electronic access below)

Uma proposta de resolução para problemas de roteirização de veículos baseada no algoritmo genético

The vehicle routing problem is to nd a better route to meet a set of customers who are geographically dispersed using vehicles that are a central repository to which they return after serving customers. These customers have a demand that must be met. Such problems have a wide practical application among them we can mention: school transport, distribution of newspapers, garbage collection, among others. Because it is a classic problem as NP-hard, these problems have aroused interest in the search for viable methods of resolution. In this paper we use the Genetic Algorithm as a resolution

Refletindo sobre a própria prática: um estudo autoetnográfico sobre os saberes de uma professora em form(ação)

A natureza complexa e dinâmica que caracteriza a prática de ensinar na educação infantil requer que o professor reflita sobre suas próprias ações. Ao fazê-lo mobiliza saberes e sentimentos que estão frequentemente associados com as ações que realiza na sala de aula. Especificamente, o objetivo do presente estudo foi identificar, descrever e analisar, à luz do referencial dos saberes docentes, os desafios, os saberes e os sentimentos vivenciados durante a prática de ensinar de uma professora em formação. Metodologicamente, optou-se por um estudo autoetnográfico, utilizando-se de registros em diário de campo, os quais foram analisados a partir de três descrições distintas – a própria professora, o contexto e a relação entre a professora e o contexto. A “indisciplina” dos alunos e a ausência de estratégias imediatas para enfrentá-la foram os principais resultados encontrados pela professora. Além disso, constatamos a importância da reflexão sobre a própria prática para dar origem a novos saberes pedagógicos. Os saberes experienciais embasaram fortemente as ações da professora na tentativa de resolver os desafios durante a prática. Refletir sobre esses desafios tem sido um exercício que está, a todo o momento, transformando para além da prática, valores e significados pessoais sobre a docência que, até então, pareciam já bem definidos

Busca quântica de dados XML usando algoritmo de Grover

This paper presents a quantum search algorithm implementation with small modifications. The algorithm idea is to be hybrid, capable to run on classical systems and quantum systems. We present the concepts of quantum search and introduced a pseudo-framework able to generate code for classical computers (C++) and quantum computers (QCL). The algorithms were submitted to simulations, which resulted in a comparative study of the operation of Grover’s algorithm on both systems, carrying out searches in a mass of data in XML format files. As a result, we see very similar numbers between classical and quantum systems, this creates an expectation that the search in real quantum computers is much more efficient.

Local classification of singular hexagonal 3-webs with holomorphic Chern connection form and infinitesimal symmetries

Implicit ODE, cubic in derivative, generically has no infinitesimal symmetries even at regular points with distinct roots. Cartan showed that at regular points, ODEs with hexagonal 3-web of solutions have symmetry algebras of the maximal possible dimension 3. At singular points such a web can lose all its symmetries. In this paper we study hexagonal 3-webs having at least one infinitesimal symmetry at singular points. In particular, we establish sufficient conditions for the existence of non-trivial symmetries and show that under natural assumptions such a symmetry is semi-simple, i.e. is a scaling in some coordinates. Using the obtained results, we provide a complete classification of hexagonal singular 3-web germs in the complex plane, satisfying the following two conditions: 1) the Chern connection form is holomorphic at the singular point, 2) the web admits at least one infinitesimal symmetry at this point. As a by-product, a classification of hexagonal weighted homogeneous 3-webs is obtained.

Algoritmo híbrido neural-imuno aplicado ao diagnóstico de distúrbios de tensão em sistemas de distribuição de energia elétrica

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