Variação da estrutura carpelar em seis espécies de Cassiinae (Leguminosae: Caesalpinioideae)

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

Comparative study of LMI-based output feedback spr synthesis for plants with different numbers of inputs and outputs

New Linear Matrix Inequalities (LMI) conditions are proposed for the following problem, called Strictly Positive Real (SPR) synthesis: given a linear time-invariant plant, find a constant output feedback matrix Ko and a constant output tandem matrix F for the controlled system to be SPR. It is assumed that the plant has the number of outputs greater than the number of inputs. Some sufficient conditions for the solution of the problem are presented and compared. These results can be directly applied in the LMI-based design of Variable Structure Control (VSC) of uncertain plants. ©2008 IEEE.

Projeto de controle robusto para acomodação de falhas no módulo do helicóptero 3-DOF

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

Controle com Estrutura Variável e Modos Deslizantes Aplicado em Sistema de Suspensão Ativa

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

Controle automático com estrutura variável utilizando sistemas ERP e LMI

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

Aplicação de controle com modos deslizantes em sistemas com atraso na aquisição de dados

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

Strati, piano, rizoma. John Cage e la filosofia di Gilles Deleuze e Félix Guattari

In base ad una recensione esaustiva dei riferimenti alla musica e al sonoro nella produzione filosofica di Gilles Deleuze e Félix Guattari, la presente ricerca s’incentra sulla posizione che il pensiero musicale di John Cage occupa in alcuni testi deleuziani. Il primo capitolo tratta del periodo creativo di Cage fra il 1939 e il 1952, focalizzandosi su due aspetti principali: la struttura micro-macrocosmica che contraddistingue i suoi primi lavori, e i quattro elementi che in questo momento sintetizzano per Cage la composizione musicale. Questi ultimi sono considerati in riferimento alla teoria della doppia articolazione che Deleuze e Guattari riprendono da Hjelmslev; entrambi gli aspetti rimandano al sistema degli strati e della stratificazione esposta su Mille piani. Il secondo capitolo analizza la musica dei decenni centrali della produzione cagiana alla luce del luogo in Mille piani dove Cage è messo in rapporto al concetto di “piano fisso sonoro”. Un’attenzione particolare è posta al modo in cui Cage concepisce il rapporto fra durata e materiali sonori, e al grado variabile in cui sono presenti il caso e l’indeterminazione. Le composizioni del periodo in questione sono inoltre viste in riferimento al concetto deleuzo-guattariano di cartografia, e nelle loro implicazioni per il tempo musicale. L’ultimo quindicennio della produzione di Cage è considerata attraverso il concetto di rizoma inteso come teoria delle molteplicità. In primo luogo è esaminata la partitura di Sylvano Bussotti che figura all’inizio di Mille piani; in seguito, i lavori testuali e musicali di Cage sono considerati secondo le procedure compositive cagiane del mesostico, delle parentesi di tempo che concorrono a formare una struttura variabile, e dell’armonia anarchica dell’ultimo Cage.

Model-to-Code transformation from product-line architecture models to aspectJ

Software Product Line Engineering has significant advantages in family-based software development. The common and variable structure for all products of a family is defined through a Product-Line Architecture (PLA) that consists of a common set of reusable components and connectors which can be configured to build the different products. The design of PLA requires solutions for capturing such configuration (variability). The Flexible-PLA Model is a solution that supports the specification of external variability of the PLA configuration, as well as internal variability of components. However, a complete support for product-line development requires translating architecture specifications into code. This complex task needs automation to avoid human error. Since Model-Driven Development allows automatic code generation from models, this paper presents a solution to automatically generate AspectJ code from Flexible-PLA models previously configured to derive specific products. This solution is supported by a modeling framework and validated in a software factory.

Performance assessment of a wind energy conversion system using a hierarchical controller structure

This paper deals with a hierarchical structure composed by an event-based supervisor in a higher level and two distinct proportional integral (PI) controllers in a lower level. The controllers are applied to a variable speed wind energy conversion system with doubly-fed induction generator, namely, the fuzzy PI control and the fractional-order PI control. The event-based supervisor analyses the operation state of the wind energy conversion system among four possible operational states: park, start-up, generating or brake and sends the operation state to the controllers in the lower level. In start-up state, the controllers only act on electric torque while pitch angle is equal to zero. In generating state, the controllers must act on the pitch angle of the blades in order to maintain the electric power around the nominal value, thus ensuring that the safety conditions required for integration in the electric grid are met. Comparisons between fuzzy PI and fractional-order PI pitch controllers applied to a wind turbine benchmark model are given and simulation results by Matlab/Simulink are shown. From the results regarding the closed loop point of view, fuzzy PI controller allows a smoother response at the expense of larger number of variations of the pitch angle, implying frequent switches between operational states. On the other hand fractional-order PI controller allows an oscillatory response with less control effort, reducing switches between operational states. (C) 2015 Elsevier Ltd. All rights reserved.

Étude in vivo de la relation entre la structure et la fonction de la boucle variable de l'ARN de transfert de la sélénocystéine d'E. coli

La sélénocystéine est le 21e acide aminé encodé génétiquement et on la retrouve à travers les trois domaines de la vie. Elle est synthétisée sur l'ARNtSec par un processus unique. L'ARNtSec se distingue également au niveau structural. La tige acceptrice possède 8 (procaryotes) et 9 (eucaryotes) paires de bases, contrairement aux ARNt canoniques qui ont invariablement 7 paires de bases dans la tige acceptrice. De plus, la tige D a 2 paires de bases additionnelles qui remplacent les interactions tertiaires universelles 8-14, 15-48 qui sont absentes chez l'ARNtSec. D'autre part, la longueur de la boucle variable de l'ARNtSec est plus longue que la majorité des ARNt de type II. Dans ce mémoire, on se concentre sur la région de la boucle variable de l'ARNtSec . La recherche consiste à distinguer les paires de bases de la boucle variable qui sont essentielles à la biosynthèse et l’insertion de la sélénocystéine. De plus, on regarde si la paire de base additionnelle de la tige acceptrice de l'ARNtSec (procaryote) est essentielle pour l'insertion de la sélénocystéine. Pour répondre à ces questions, on a utilisé l'approche expérimentale Évolution Instantanée qui consiste au criblage in vivo d'ARNtSec fonctionnels chez E. coli. Dans ce travail, on montre que l'insertion de la sélénocystéine ne nécessite pas une spécificité de la longueur ou de la séquence de l'ARNtSec. On montre aussi que ni la longueur de la tige acceptrice ou du domaine tige acceptrice/tige T n'est essentielle pour avoir un ARNtSec fonctionnel.

Geometric Structure of the Adaptive Controller of the Human Arm

The objects with which the hand interacts with may significantly change the dynamics of the arm. How does the brain adapt control of arm movements to this new dynamic? We show that adaptation is via composition of a model of the task's dynamics. By exploring generalization capabilities of this adaptation we infer some of the properties of the computational elements with which the brain formed this model: the elements have broad receptive fields and encode the learned dynamics as a map structured in an intrinsic coordinate system closely related to the geometry of the skeletomusculature. The low--level nature of these elements suggests that they may represent asset of primitives with which a movement is represented in the CNS.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EMand the Minimum Spanning Tree algorithm to find the ML and MAP mixtureof trees for a variety of priors, including the Dirichlet and the MDL priors.

Estimating Dependency Structure as a Hidden Variable

This paper introduces a probability model, the mixture of trees that can account for sparse, dynamically changing dependence relationships. We present a family of efficient algorithms that use EM and the Minimum Spanning Tree algorithm to find the ML and MAP mixture of trees for a variety of priors, including the Dirichlet and the MDL priors. We also show that the single tree classifier acts like an implicit feature selector, thus making the classification performance insensitive to irrelevant attributes. Experimental results demonstrate the excellent performance of the new model both in density estimation and in classification.

An LMS style variable tap-length algorithm for structure adaptation

Searching for the optimum tap-length that best balances the complexity and steady-state performance of an adaptive filter has attracted attention recently. Among existing algorithms that can be found in the literature, two of which, namely the segmented filter (SF) and gradient descent (GD) algorithms, are of particular interest as they can search for the optimum tap-length quickly. In this paper, at first, we carefully compare the SF and GD algorithms and show that the two algorithms are equivalent in performance under some constraints, but each has advantages/disadvantages relative to the other. Then, we propose an improved variable tap-length algorithm using the concept of the pseudo fractional tap-length (FT). Updating the tap-length with instantaneous errors in a style similar to that used in the stochastic gradient [or least mean squares (LMS)] algorithm, the proposed FT algorithm not only retains the advantages from both the SF and the GD algorithms but also has significantly less complexity than existing algorithms. Both performance analysis and numerical simulations are given to verify the new proposed algorithm.