Um dos principais problemas na teoria qualitativa das equações diferenciais em dimensão dois é apresentar, para uma dada família de sistemas diferenciais, uma classificação topológica dos retratos de fase de todos os sistemas dessa família. A proposta deste trabalho é estudar a técnica utilizada na classificação dos retratos de fase globais de sistemas diferenciais polinomiais da forma \'dx SUP dt\' = P(x,y) \'dy SUP dt = Q(x,y) onde P e Q são polinômios nas variáveis x e y e o máximo entre os graus de P e Q é 2. Para esse fim optamos pelo estudo da referência de Cairó e Llibre [5]. Na presente referência os autores obtém a classificação de todos os retratos de fase globais dos sistemas diferenciais polinomiais que possuem uma integral primeira racional, H, de grau 2. Esse estudo foi dividido em duas etapas. Na primeira, caracterizamos a função H através de seus coeficientes. Na segunda, encontramos todos os retratos de fase globais no disco de Poincaré. Para tais sistemas, existem exatamente 18 retratos de fase no disco de Poincaré, exceto pela reversão do sentido de todas as órbitas ou equivalência topológica / One of the main problems in the qualitative theory of 2-dimensional differential equations is, for a concrete family of differential systems, to describe a topological classification of the phase portraits for all the systems in this family. The purpose of this work is to study a technique used in the classification of global phase portraits of the planar polynomial diferential systems or simply quadratic systems of the form \'dx SUP. dt\' = P(x,y) \'dy SUP. dt\' = Q(x,y) where P and Q are real polynomials in x and y the maximum degree of P and Q is 2. Our basic reference is the paper of Cairó and Llibre [5]. In that work the authors give the classification of all global phase portraits of the planar quadratic differential systems having a rational first integral H of degree 2. Our work is divided in two parts. In the first part, we characterize the first integral H through its coeficients. In the second one, we describe all global phase portraits in the Poincaré disk. For such systems, there are exactly 18 different phase portraits in the Poincaré disk, up to a reversal of sense of all orbits or topological equivalence

[pt] Este trabalho apresenta um modelo de Regressão Linear Nebulosa por Partes(RLNP). Trata-se de uma estrutura que envolve modelos de regressão linear por partes ponderadas por pertinências advindas da lógica nebulosa. Este modelo é comparado com o modelo de regressão linear. Os resultados mostram que o RLNP consegue identificar a estrutura não-linear dos dados simulados e que na maioria dos casos ele possui bom poder de ajuste. / [en] In this dissertation a Fuzzy Piece-Wise Linear Regressive model FPLieR is developed. The model´s structure combines linear regressive models with fuzzy logic´s grade of membership in a piece-wise fashion. A comparision is made between this model and the linear regression one. The results show that FPLieR is able to find the linear substructure of simulated data and that in most cases it presents a good fit.

Linear degeneracy of a PDE is a concept that is related to a number of interesting geometric constructions. We first take a quadratic line complex, which is a three parameter family of lines in projective space P3 specified by a single quadratic relation in the Plucker coordinates. This complex supplies us with a conformal structure in P3. With this conformal structure, we associate a three-dimensional second order quasilinear wave equation. We show that any PDE arising in this way is linearly degenerate, furthermore, any linearly degenerate PDE can be obtained by this construction. We classify Segre types of quadratic complexes for which the structure is conformally flat, as well as Segre types for which the corresponding PDE is integrable. These results were published in [1]. We then introduce the notion of characteristic integrals, discuss characteristic integrals in 3D and show that, for certain classes of second-order linearly degenerate dispersionless integrable PDEs, the corresponding characteristic integrals are parameterised by points on the Veronese variety. These results were published in [2].

After introducing concepts from convex analysis, we study how to continuously transform one convex function into another. A natural choice is the arithmetic average, as it is pointwise continuous; however, this choice fails to average functions with different domains. On the contrary, the proximal average is not only continuous (in the epi-topology) but can actually average functions with disjoint domains. In fact, the proximal average not only inherits strict convexity (like the arithmetic average) but also inherits smoothness and differentiability (unlike the arithmetic average). Then we introduce a computational framework for computer-aided convex analysis. Motivated by the proximal average, we notice that the class of piecewise linear-quadratic (PLQ) functions is closed under (positive) scalar multiplication, addition, Fenchel conjugation, and Moreau envelope. As a result, the PLQ framework gives rise to linear-time and linear-space algorithms for convex PLQ functions. We extend this framework to nonconvex PLQ functions and present an explicit convex hull algorithm. Finally, we discuss a method to find primal-dual symmetric antiderivatives from cyclically monotone operators. As these antiderivatives depend on the minimal and maximal Rockafellar functions [5, Theorem 3.5, Corollary 3.10], it turns out that the minimal and maximal function in [12, p.132,p.136] are indeed the same functions. Algorithms used to compute these antiderivatives can be formulated as shortest path problems. / Graduate Studies, College of (Okanagan) / Graduate

No description available.

Mixture experiments are widely applied. The Scheffé quadratic polynomial is the most popular mixture model in industry due to its simplicity, but it fails to accurately describe the behaviour of response variables that deviate greatly from linear blending. Higherorder Scheffé polynomials do possess the ability to predict such behaviour but become increasingly more complex to use and the number of estimable parameters grow exponentially [15]. A parameter-parsimonious mixture model, developed from the linear blending rule with weighted power means and Wohl's Q-fractions, is introduced. Bootstrap is employed to analyse the model statistically. The model is proved to be flexible enough to model non-linear deviations from linear blending without losing the simplicity of the linear blending rule. / Dissertation (MSc)--University of Pretoria, 2011. / Chemical Engineering / unrestricted

The PhD thesis considers four topics in dynamical systems and is based on one paper and three manuscripts. In Paper I we apply methods of interval analysis in order to compute the rigorous enclosure of rotation number. The described algorithm is supplemented with a method of proving the existence of periodic points which is used to check rationality of the rotation number. In Manuscript II we provide a numerical algorithm for computing critical points of the multiplier map for the quadratic family (i.e., points where the derivative of the multiplier with respect to the complex parameter vanishes). Manuscript III concerns continued fractions of quadratic irrationals. We show that the generating function corresponding to the sequence of denominators of the best rational approximants of a quadratic irrational is a rational function with integer coefficients. As a corollary we can compute the Lévy constant of any quadratic irrational explicitly in terms of its partial quotients. Finally, in Manuscript IV we develop a method for finding rigorous enclosures of all odd periodic solutions of the stationary Kuramoto-Sivashinsky equation. The problem is reduced to a bounded, finite-dimensional constraint satisfaction problem whose solution gives the desired information about the original problem. Developed approach allows us to exclude the regions in L2, where no solution can exist.

A nuclear waste stream is the complete flow of waste material from origin to treatment facility to final disposal. The objective of this study was to design and develop a Geographic Information Systems (GIS) module using Google Application Programming Interface (API) for better visualization of nuclear waste streams that will identify and display various nuclear waste stream parameters. A proper display of parameters would enable managers at Department of Energy waste sites to visualize information for proper planning of waste transport. The study also developed an algorithm using quadratic Bézier curve to make the map more understandable and usable. Microsoft Visual Studio 2012 and Microsoft SQL Server 2012 were used for the implementation of the project. The study has shown that the combination of several technologies can successfully provide dynamic mapping functionality. Future work should explore various Google Maps API functionalities to further enhance the visualization of nuclear waste streams.

Cette thèse concerne l'élaboration de stratégies de commande prédictive pour certaines classes de systèmes dynamiques continus, discrets et hybrides modélisés par des extensions de réseaux de Petri ad hoc. Pour les systèmes continus et en vue de limiter la complexité de calcul inhérente à la forme standard de la commande prédictive, plusieurs améliorations sont proposées. Celles-ci permettent de surmonter le problème de "hill climbing" caractéristique des trajectoires obtenues avec certains réseaux de Petri. Elles assurent également la possibilité d'implémenter la commande en temps réel en adaptant l'horizon de prédiction pour réduire la complexité algorithmique. Enfin, elles permettent de limiter la sollicitation des actionneurs tout en garantissant la stabilité asymptotique du système commandé. Pour les systèmes discrets temporisés et pour éviter l'exploration exhaustive du graphe d'atteignabilité, une méthode de commande est proposée, basée sur la commande prédictive appliquée à une approximation continue du système discret. Enfin pour les systèmes hybrides, une commande prédictive hybride est développée, inspirée de la commande prédictive continue. Les performances de ces différentes stratégies de commande sont évaluées et comparées avec différentes simulations numériques / This thesis concerns the development of predictive control strategies for some classes of continuous, discrete and hybrid dynamic systems modeled by specific extensions of Petri nets. For continuous systems and in order to limit the computational complexity inherent to the standard form of the predictive control, several improvements are proposed. These improvements allow overcoming the problem of hill climbing that characterizes trajectories obtained with some Petri nets. They also ensure the possibility to implement real-time control by adapting the prediction horizon in order to reduce the algorithmic complexity. Finally, they limit actuators solicitation while ensuring the asymptotic stability of the controlled system. For timed discrete systems and in order to avoid the exhaustive exploration of the reachability graph, a control method is proposed, based on the predictive control applied to a continuous approximation of the discrete system. Finally for hybrid systems, hybrid predictive control is developed, inspired by the continuous predictive control. The performance of these different control strategies are evaluated and compared to different numerical simulations.

O problema de minimização com restrições lineares e importante, não apenas pelo problema em si, que surge em várias áreas, mas também por ser utilizado como subproblema para resolver problemas mais gerais de programação não-linear. GENLIN e um método eficiente para minimização com restrições lineares para problemas de pequeno e médio porte. Para que seja possível a implementação de um método similar para grande porte, é necessário ter um método eficiente, também para grande porte, para projeção de pontos no conjunto de restrições lineares. O problema de projeção em um conjunto de restrições lineares pode ser escrito como um problema de programação quadrática convexa. Neste trabalho, estudamos e implementamos métodos esparsos para resolução de problemas de programação quadrática convexa apenas com restrições de caixa, em particular o clássico método Moré-Toraldo e o \"método\" NQC. O método Moré-Toraldo usa o método dos Gradientes Conjugados para explorar a face da região factível definida pela iteração atual, e o método do Gradiente Projetado para mudar de face. O \"método\" NQC usa o método do Gradiente Espectral Projetado para definir em que face trabalhar, e o método de Newton para calcular o minimizador da quadrática reduzida a esta face. Utilizamos os métodos esparsos Moré-Toraldo e NQC para resolver o problema de projeção de GENLIN e comparamos seus desempenhos / The linearly constrained minimization problem is important, not only for the problem itself, that arises in several areas, but because it is used as a subproblem in order to solve more general nonlinear programming problems. GENLIN is an efficient method for solving small and medium scaled linearly constrained minimization problems. To implement a similar method to solve large scale problems, it is necessary to have an efficient method to solve sparse projection problems onto linear constraints. The problem of projecting a point onto a set of linear constraints can be written as a convex quadratic programming problem. In this work, we study and implement sparse methods to solve box constrained convex quadratic programming problems, in particular the classical Moré-Toraldo method and the NQC \"method\". The Moré-Toraldo method uses the Conjugate Gradient method to explore the face of the feasible region defined by the current iterate, and the Projected Gradient method to move to a different face. The NQC \"method\" uses the Spectral Projected Gradient method to define the face in which it is going to work, and the Newton method to calculate the minimizer of the quadratic function reduced to this face. We used the sparse methods Moré-Toraldo and NQC to solve the projection problem of GENLIN and we compared their performances