Esta tese trata do problema de estimativa robusta ótima para sistemas dinâmicos regulares discretos no tempo. Novos algoritmos recursivos são formulados para as estimativas filtradas e preditoras com as correspondentes equações de Riccati. O filtro robusto tipo Kalman e a equação de Riccati correspondente são obtidos numa formulação mais geral, estendendo os resultados apresentados na literatura. O funcional quadrático proposto para deduzir este filtro faz a combinação das técnicas mínimos quadrados regularizados e funções penalidade. O sistema considerado para obtenção de tais estimativas é singular, discreto, variante no tempo, com ruídos correlacionados e todos os parâmetros do modelo linear estão sujeitos a incertezas. As incertezas paramétricas são limitadas por norma. As propriedades de estabilidade e convergência do filtro de Kalman para sistemas nominais e incertos são provadas, mostrando-se que o filtro em estado permanente é estável e a recursão de Riccati associada a ele é uma sequência monótona não decrescente, limitada superiormente pela solução da equação algébrica de Riccati. / This thesis considers the optimal robust estimates problem for discrete-time singular dymanic systems. New recursive algorithms are developed for the Kalman filtered and predicted estimated recursions with the corresponding Riccati equations. The singular robust Kalman type filter and the corresponding recursive Riccati equation arer obtained in their most general formulation, extending the results presented in the literature. The quadratic functional developed to deduce this filter combines regularized least squares and penalty functions approaches. The system considered to obtain the estimates is singular, time varying with correlated noises and all parameter matrices of the underlying linear model are subject to uncertainties. The parametric uncertainty is assumed to be norm bounded. The properties of stability and convergence of the Kalman filter for nominal and uncertain system models are proved, where we show that steady state filter is stable and the Riccati recursion associated with this is a nondecreasing monotone sequence with upper bound.

Este trabalho propõe uma nova estrutura cinemática paralela tridimensional com três graus de mobilidade que pode ser aplicada como robô manipulador. O volume do espaço de trabalho disponível é empregado como índice para avaliar o desempenho cinemático do mecanismo. As cinemáticas de posição e velocidade são desenvolvidas, tendo em vista o levantamento das configurações singulares e do espaço de trabalho. Os resultados obtidos com as cinemáticas direta e inversa são comparados de modo a verificar a correspondência entre eles. São levantadas diversas configurações singulares que correspondem ao alinhamento entre as barras das cadeias ativas do mecanismo e uma família de singularidades para uma das cadeias ativas é apresentada. O volume do espaço de trabalho do mecanismo é calculado pelo método da discretização, de modo a avaliar o volume do espaço de trabalho disponível, bem como a identificação da influência dos parâmetros dimensionais do mecanismo sobre este volume. O volume do espaço de trabalho com os parâmetros ótimos é expressivo, quando comparado com aqueles alcançados por manipuladores robóticos convencionais. / This dissertation proposes a novel three-degree-of-freedom parallel kinematic structure in order to be applied as a three-dimensional robot manipulator. The volume of the available workspace is employed as a performance index to evaluate the kinematic behavior of the mechanism. The position and velocity kinematics are developed for mapping singular configurations and evaluating the workspace. The results obtained by performing the direct and inverse kinematics are compared in order to verify the consistency between them. It is demonstrated that most of singular configurations is represented by the alignment of the links that belong to each active chain. In addition, a family of singularities for one of the active chains is presented. The volume of the workspace is calculated by using the discretization method not only for evaluating the feasible workspace but also for identifying the influence of dimensional parameters with respect to this volume. The achieved workspace by employing the optimal parameters is comparable to that reached by conventional robot manipulators.

<p>U disertaciji su razvijeni kolokacioni postupci sa C¹- splajnovima&nbsp;proizvoljnog stepena za re&scaron;avanje singularno-perturbovanih problema&nbsp;reakcije-difuzije u jednoj i dve dimenzije. U 1D, pokazano je da kolokacioni&nbsp;postupak sa kvadratnim C¹-&nbsp;splajnom na modifikovanoj &Scaron;i&scaron;kinovoj mreži,&nbsp;konvergira uniformno, sa redom konvergencije skoro dva. Takođe, na gradiranim mrežama, ovaj metod ima red konvergencije dva &ndash; uniformno do na logaritamski faktor. Aposterirona ocena je postignuta za kolokacione postupke sa C¹- splajnovima proizvoljnog stepena na proizvoljnoj mreži. Ova ocena je iskori&scaron;ćena i za kreiranje adaptivnih mreža. Numerički rezultati povtrđuju dobijene ocene. U 2D su razmatrane kolokacije sa bikvadratnim splajnovima. Aposterirona ocena gre&scaron;ke je postignuta. Numerički rezultati potvrđuju dobijene teorijske rezultate.<br />&nbsp;</p> / <p>Collocations with arbitrary order C¹-splines for a singularly perturbed reaction-diffusion problem in one dimension and two dimensions are studied. In 1D, collocation with quadratic C¹-splines is shown to be almost second order accurate on modified Shishkin mesh in the maximum norm, uniformly in the perturbation parameter. Also, we establish a second-order maximum norm a priori estimate on recursively graded mesh uniformly up to a logarithmic factor in the singular perturbation parameter. A posteriori error bounds are derived for the collocation method with arbitrary order C¹-splines on arbitrary meshes. These bounds are used to drive an adaptivemeshmoving algorithm. An adaptive algorithm is devised&nbsp;to resolve the boundary layers. Numerical results are presented. In 2D, collocation with biquadratic C¹-spline is studied. Robust a posteriori error bounds are derived for the collocation method on arbitrary meshes. Numerical experiments completed our theoretical results.</p>

This thesis is a study of aboutness. It defends the claim that we have singular thoughts about ordinary objects and argues that an essential part of how we do so is by maintaining singular representations. This proposal allows us to avoid traditional, unsatisfying conceptions of the scope of singular thought while restoring the sense in which such thought is a distinctively epistemic achievement. Reconnecting the study of aboutness with epistemology promises to alleviate the sense of directionlessness in the contemporary literature, offering a firmer grip on the phenomenon along with new, systematic resources for its investigation. Chapters 1-2 explore the effects of contextualist machinery on orthodox views about singular thought. It is widely thought that if there is to be a plausible connection between the truth of a de re attitude report about a subject and that subject's possession of a singular thought, then there can be no acquaintance requirement(s) on singular thought. Chapter 1 shows that this view rests on a faulty picture of how we talk about attitudes. Indeed, the truth of a de re attitude report cannot be taken to track the singular/non-singular distinction without collapsing it. A new, contextualist picture is needed. That there must be a distinction between singular and non-singular intentionality is emphasized in Chapter 2, where a key explanatory role for singular thought - brought out by a thought experiment due to Strawson - is examined. I show that the role does not call for any distinctive kind of mental content. Once we abandon the two widespread views questioned in Chapters 1-2, our grip on the phenomenon of singular aboutness is loosened: it is not constitutively tied to the kinds of attitude-reporting data or mental content by which it is often assumed to be revealed. Where are we to look for insight? What makes something the object of a singular thought? According to Russell, it is a datum of intuition that singular thought involves a kind of knowledge; a theory of aboutness will precisify the intuitive notion of 'knowing which thing one is thinking about' in order to capture this demand in a philosophically revealing way. If Russell is right, teasing out this connection to knowledge will allow us to see what it takes for a particular thing to be the immediate subject matter of thought. Chapter 3 discusses Evans's theory of this kind. Chapter 4 examines recent work by Dickie. While serious concerns emerge in each case, insights recovered are used to precisify Russell's requirement, leading to a novel picture of singular representation and the epistemic character of this achievement. While the chapters follow a narrative, providing an extended rationale for the proposal in Chapter 4, each may be read in isolation by those familiar with the philosophical issues. For those who are not, the Introduction provides sufficient background.

In this thesis we study actions of countable groups on measure spaces underthe assumption that the dynamics are non-singular, with particular reference topointwise ergodic theorems and their relationship to the critical dimensions ofthe action.

<p>Predmet izučavanja doktorske disertacije jeste postavljanje univerzalne metode za rešavanje fazi linearnih sistema primenom blokovske reprezentacije uopštenih inverza matrice. Pre svega, postavljen je potreban i dovoljan uslov za ekzistenciju rešanja fazi linearnog sistema. Zatim je data tačna algebarska forma rešenja i na kraju je predstavljen efikasan algoritam.</p> / <p>Thе subject of research of thesis is setting universal method for solving fuzzy linear systems using a block representation of generalized inversis of a matrix. A necessary and sufficienf condition for the existence solutions of fuzzy linear systems is given. The exact algebraic form of any solutiof fuzzy linear system is established.</p>

The study of signal processing has wide applications, such as in hi-fi audio, television, voice recognition and many other areas. Signals are rarely observed without noise, which obstruct our analysis of signals. Hence, it is of great interest to study the detection, approximation and removal of noise.  In this thesis we compare two methods for image denoising. The methods are each based on a data transformation. Specifically, Fourier Transform and Singular Value Decomposition are utilized in respective methods and compared on grayscale images. The comparison is based on the visual quality of the resulting image, the maximum peak signal-to-noise ratios attainable for the respective methods and their computational time. We find that the methods are fairly equal in visual quality. However, the method based on the Fourier transform scores higher in peak signal-to-noise ratio and demands considerably less computational time.

The study of cardiac action potentials has many medical applications. Dr. Dennis Noble first used mathematical models to study cardiac action potentials in the 1960s. We begin our study of cardiac action potentials with one form of the Fitzhugh-Nagumo partial differential equation. We use the non-classical method to produce a closed form solution for the decoupled Fitzhugh Nagumo equation. Using voltage recording data of action potentials in a cardiac myocyte and in purkinje fibers, we estimate parameter values for the closed form solution with standard linear and non-linear regression methods. Results are limited, thus leading us to perturb the solution to obtain a better fit. We turn to singular perturbation theory to justify our pole-based approach. Finally, we test our model on independent action potential data sets to evaluate our model and to draw conclusions on how our model can be applied.

Singular Spectrum Analysis (SSA) is a method for decomposing and forecasting time series that recently has had major developments but it is not yet routinely included in introductory time series courses. An international conference on the topic was held in Beijing in 2012. The basic SSA method decomposes a time series into trend, seasonal component and noise. However there are other more advanced extensions and applications of the method such as change-point detection or the treatment of multivariate time series. The purpose of this work is to understand the basic SSA method through its application to the monthly average sea temperature in a point of the coast of South America, near where “EI Ni˜no” phenomenon originates, and to artificial time series simulated using harmonic functions. The output of the basic SSA method is then compared with that of other decomposition methods such as classic seasonal decomposition, X-11 decomposition using moving averages and seasonal decomposition by Loess (STL) that are included in some time series courses.

Considérons une variété régulière analytique M sur le corps réel ou complexe, un faisceau d'idéaux J défini sur M, un diviseur à croisement normaux simples E et une distribution singulière involutive Θ tangent à E.L'objectif principal de ce travail est d'obtenir une résolution des singularités du faisceau d'idéaux J qui préserve certaines ``bonnes" propriétés de la distribution singulière Θ. Plus précisément, la propriété de R-monomialité : l'existence d'intégrales premières monomiales. Ce problème est naturel dans le contexte où on doit étudier l'interaction d'une variété et d'un feuilletage et, donc, est aussi reliée au problème de la monomilisation des applications et de résolution ``quasi-lisse" des familles d'idéaux.- Le premier résultat donne une résolution globale si le faisceau d'idéaux J est invariant par la distribution singulière;- Le deuxième résultat donne une résolution globale si la distribution singulière Θ est de dimension 1 ;- Le troisième résultat donne une uniformisation locale si la distribution singulière Θ est de dimension 2.On présente aussi deux utilisations des résultats précédents. La première application concerne la résolution des singularités en famille analytique, soit pour une famille d'idéaux, soit pour une famille de champs de vecteurs. Pour la deuxième, on applique les résultats à un problème de système dynamique, motivé par une question de Mattei. / Let M be an analytic manifold over the real or complex field, J be a coherent and everywhere non-zero ideal sheaf over M, E be a reduced SNC divisor and Θ an involutive singular distribution everywhere tangent to E. The main objective of this work is to obtain a resolution of singularities for the ideal sheaf J that preserves some ``good" properties of the singular distribution Θ. More precisely, the R-monomial property : the existence of local monomial first integrals. This problem arises naturally when we study the ``interaction" between a variety and a foliation and, thus, is also related with the problem of monomialization of maps and of ``quasi-smooth" resolution of families of ideal sheaves.- The first result is a global resolution if the ideal sheaf J is invariant by the singular distribution Θ;- The second result is a global resolution if the the singular distribution Θ has leaf dimension 1;- The third result is a local uniformization if the the singular distribution Θ has leaf dimension 2;We also present two applications of the previous results. The first application concerns the resolution of singularities in families, either of ideal sheaves or vector fields. For the second application, we apply the results to a dynamical system problem motivated by a question of Mattei.