Estabilidade, desempenho e observação de estado de sistemas chaveados afins: aplicações aos conversores CC-CC

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

Morfologia e anatomia de Paspalum L. (Poaceae, Poales) e suas implicações taxonômicas

Pós-graduação em Ciências Biológicas (Biologia Vegetal) - IBRC

Controle robusto chaveado de sistemas lineares variantes no tempo com aplicação em falhas estruturais

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

Filippov's selection theorem and the existence of solutions for optimal control problems in time scales

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

Os lemas de Sperner no ensino médio e uma modesta introdução à topologia

Pós-graduação em Matemática em Rede Nacional - IBILCE

Projeto de controlador gain scheduling usando realimentação derivativa via LMI

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

Hiperbolicidade seccional em dimensões arbitrárias

Pós-graduação em Matemática - IBILCE

Class Notes for Math 901/902: Abstract Algebra, Instructor Tom Marley

Topics include: Free groups and presentations; Automorphism groups; Semidirect products; Classification of groups of small order; Normal series: composition, derived, and solvable series; Algebraic field extensions, splitting fields, algebraic closures; Separable algebraic extensions, the Primitive Element Theorem; Inseparability, purely inseparable extensions; Finite fields; Cyclotomic field extensions; Galois theory; Norm and trace maps of an algebraic field extension; Solvability by radicals, Galois' theorem; Transcendence degree; Rings and modules: Examples and basic properties; Exact sequences, split short exact sequences; Free modules, projective modules; Localization of (commutative) rings and modules; The prime spectrum of a ring; Nakayama's lemma; Basic category theory; The Hom functors; Tensor products, adjointness; Left/right Noetherian and Artinian modules; Composition series, the Jordan-Holder Theorem; Semisimple rings; The Artin-Wedderburn Theorem; The Density Theorem; The Jacobson radical; Artinian rings; von Neumann regular rings; Wedderburn's theorem on finite division rings; Group representations, character theory; Integral ring extensions; Burnside's paqb Theorem; Injective modules.

Comparison of pattern VEP results acquired using CRT and TFT stimulators in the clinical practice

There are several electrophysiological systems available commercially. Usually, control groups are required to compare their results, due to the differences between display types. Our aim was to examine the differences between CRT and LCD/TFT stimulators used in pattern VEP responses performed according to the ISCEV standards. We also aimed to check different contrast values toward thresholds. In order to obtain more precise results, we intended to measure the intensity and temporal response characteristics of the monitors with photometric methods. To record VEP signals, a Roland RetiPort electrophysiological system was used. The pattern VEP tests were carried out according to ISCEV protocols on a CRT and a TFT monitor consecutively. Achromatic checkerboard pattern was used at three different contrast levels (maximal, 75, 25%) using 1A degrees and 15` check sizes. Both CRT and TFT displays were luminance and contrast matched, according to the gamma functions based on measurements at several DAC values. Monitor-specific luminance parameters were measured by means of spectroradiometric instruments. Temporal differences between the displays` electronic and radiometric signals were measured with a device specifically built for the purpose. We tested six healthy control subjects with visual acuity of at least 20/20. The tests were performed on each subject three times on different days. We found significant temporal differences between the CRT and the LCD monitors at all contrast levels and spatial frequencies. In average, the latency times were 9.0 ms (+/- 3.3 ms) longer with the TFT stimulator. This value is in accordance with the average of the measured TFT input-output temporal difference values (10.1 +/- A 2.2 ms). According to our findings, measuring the temporal parameters of the TFT monitor with an adequately calibrated measurement setup and correcting the VEP data with the resulting values, the VEP signals obtained with different display types can be transformed to be comparable.

A note on permutation regularity

The existence of a small partition of a combinatorial structure into random-like subparts, a so-called regular partition, has proven to be very useful in the study of extremal problems, and has deep algorithmic consequences. The main result in this direction is the Szemeredi Regularity Lemma in graph theory. In this note, we are concerned with regularity in permutations: we show that every permutation of a sufficiently large set has a regular partition into a small number of intervals. This refines the partition given by Cooper (2006) [10], which required an additional non-interval exceptional class. We also introduce a distance between permutations that plays an important role in the study of convergence of a permutation sequence. (C) 2011 Elsevier B.V. All rights reserved.

Properly coloured copies and rainbow copies of large graphs with small maximum degree

Let G be a graph on n vertices with maximum degree ?. We use the Lovasz local lemma to show the following two results about colourings ? of the edges of the complete graph Kn. If for each vertex v of Kn the colouring ? assigns each colour to at most (n - 2)/(22.4?2) edges emanating from v, then there is a copy of G in Kn which is properly edge-coloured by ?. This improves on a result of Alon, Jiang, Miller, and Pritikin [Random Struct. Algorithms 23(4), 409433, 2003]. On the other hand, if ? assigns each colour to at most n/(51?2) edges of Kn, then there is a copy of G in Kn such that each edge of G receives a different colour from ?. This proves a conjecture of Frieze and Krivelevich [Electron. J. Comb. 15(1), R59, 2008]. Our proofs rely on a framework developed by Lu and Szekely [Electron. J. Comb. 14(1), R63, 2007] for applying the local lemma to random injections. In order to improve the constants in our results we use a version of the local lemma due to Bissacot, Fernandez, Procacci, and Scoppola [preprint, arXiv:0910.1824]. (c) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 425436, 2012

Odd homoclinic orbits for a second order Hamiltonian system

The aim of this paper is to find an odd homoclinic orbit for a class of reversible Hamiltonian systems. The proof is variational and it employs a version of the concentration compactness principle of P. L. Lions in a lemma due to Struwe.

UNIVERSALITY OF RANDOM GRAPHS

We prove that asymptotically (as n -> infinity) almost all graphs with n vertices and C(d)n(2-1/2d) log(1/d) n edges are universal with respect to the family of all graphs with maximum degree bounded by d. Moreover, we provide an efficient deterministic embedding algorithm for finding copies of bounded degree graphs in graphs satisfying certain pseudorandom properties. We also prove a counterpart result for random bipartite graphs, where the threshold number of edges is even smaller but the embedding is randomized.

Weak quasi-randomness for uniform hypergraphs

We study quasi-random properties of k-uniform hypergraphs. Our central notion is uniform edge distribution with respect to large vertex sets. We will find several equivalent characterisations of this property and our work can be viewed as an extension of the well known Chung-Graham-Wilson theorem for quasi-random graphs. Moreover, let K(k) be the complete graph on k vertices and M(k) the line graph of the graph of the k-dimensional hypercube. We will show that the pair of graphs (K(k),M(k)) has the property that if the number of copies of both K(k) and M(k) in another graph G are as expected in the random graph of density d, then G is quasi-random (in the sense of the Chung-Graham-Wilson theorem) with density close to d. (C) 2011 Wiley Periodicals, Inc. Random Struct. Alg., 40, 1-38, 2012

Intersections on moduli spaces of curves

We present a new approach to perform calculations with the certain standard classes in cohomology of the moduli spaces of curves. It is based on an important lemma of Ionel relating the intersection theoriy of the moduli space of curves and that of the space of admissible coverings. As particular results, we obtain expressions of Hurwitz numbers in terms of the intersections in the tautological ring, expressions of the simplest intersection numbers in terms of Hurwitz numbers, an algorithm of calculation of certain correlators which are the subject of the Witten conjecture, an improved algorithm for intersections related to the Boussinesq hierarchy, expressions for the Hodge integrals over two-pointed ramification cycles, cut-and-join type equations for a large class of intersection numbers, etc.