The Nubia plate is normally considered to be a rigid plate and as such used in the realization of terrestrial reference frame. Gondwana breakup plate reconstruction, the Cameroon volcanic line, seismicity, and the morphology of the Okavango rift zone (ORZ) suggest the presence of internal deformation within the Nubia plate. To test this hypothesis, six different reference frames were developed from the velocity field of three individual regions (West, Central and South), and of different combinations of them (West+Central, South+Central, and Nubia as a whole). The residual velocities with respect to these references frame help us understand the presence of the relative motion between the different regions thus the stability of the plate. To realize the reference frames, all the publicly available global positioning system (GPS) data within the “stable” Nubia plate was processed. Given the small relative velocity, it is important to eliminate eventual biases in the analysis and to have good estimates of uncertainty of the observed velocities. For this reason, velocities were analyzed, and rate uncertainties computed using the Allan variance of rate (AVR) technique, accounting for colored noise. Although geological and geophysical studies indicate the possibility of internal deformation within Nubia, the results of this study shows that the current GPS network is not capable to identify intraplate deformation and within uncertainties Nubia is a single plate. As final note, both the color of the noise and the amplitude of the annual signal of each time series as function of latitude and climatic region were analyzed. The study shows that the noise is approximately flicker for all the good stations independently of the location. On the contrary, the amplitude of the annual signal is strongly dependent on the climate of the regions.

The objective of this dissertation is to develop robust and accurate numerical methods for solving the compressible, non-linear Euler equations of gas dynamics in one and two space dimensions. In theory, solutions of the Euler equations can display various characteristics including shock waves, rarefaction waves and contact discontinuities. To capture these features correctly, highly accurate numerical schemes are designed. In this thesis, two different projects have been studied to show the accuracy and utility of these numerical schemes. Firstly, the compressible, non-linear Euler equations of gas dynamics in one space dimension are considered. Since the non-linear partial differential equations (PDEs) can develop discontinuities (shock waves), the numerical code is designed to obtain stable numerical solutions of the Euler equations in the presence of shocks. Discontinuous solutions are defined in a weak sense, which means that there are many different solutions of the initial value problems of PDEs. To choose the physically relevant solution among the others, the entropy condition was applied to the problem. This condition is then used to derive a bound on the solution in order to satisfy L2-stability. Also, it provides information on how to add an adequate amount of diffusion to smooth the numerical shock waves. Furthermore, numerical solutions are obtained using far-field and no penetration (wall) boundary conditions. Grid interfaces were also included in these numerical computations. Secondly, the two dimensional compressible, non-linear Euler equations are considered. These equations are used to obtain numerical solutions for compressible ow in a shock tube with a 90° circular bend for two channels of different curvatures. The cell centered finite volume numerical scheme is employed to achieve these numerical solutions. The accuracy of this numerical scheme is tested using two different methods. In the first method, manufactured solutions are used to the test the convergence rate of the code. Then, Sod's shock tube test case is implemented into the numerical code to show the correctness of the code in both ow directions. The numerical method is then used to obtain numerical solutions which are compared with experimental data available in the literature. It is found that the numerical solutions are in a good agreement with these experimental results.

Simulation of mechanical systems like walking robots, is an essential part in developingnew and more applicable solutions in robotics. The increasing complexity of methodsand technologies is a key challenge for common languages. That problem creates a needfor flexible and scalable languages. The thesis concludes that an equation-based toolusing the Euler-Lagrange can simplify the process cycle of modeling and simulation. Itcan minimize the development effort, if the tool supports derivatives. Regretfully, it isnot common to use equation-based tools with this ability for simulation of humanoidrobots.The research in this thesis illustrates the comparison of equation-based tools to commonused tools. The implementation uses the Euler-Lagrange method to model andsimulate nonlinear mechanical systems. The focus of this work is the comparison ofdifferent tools, respectively the development of a humanoid robot in a stepwise mannerbased on the principle of passive walking. Additionally, each developed model has givenan informal argument to its stability. To prove the correctness of the thesis statementthe equation-based tool called Acumen is evaluated in contrast to a common used tool,MATLAB.Based on the achieved results, it can be concluded that the use of equation-based toolsusing Euler-Lagrange formalism is convenient and scalable for humanoid robots. Additionally,the development process is significantly simplified by the advantages of suchtools. Due to the experimental nature of Acumen further research could investigatethe possibilities for different mechanical systems as well as other techniques.

Cette thèse contribue à un ensemble de travaux consacrés à l’étude d’un schéma ENO centré-sommet (CENO) d’ordre élevé ainsi qu’à l’adaptation de maillage anisotrope pour des calculs de Mécaniques des Fluides précis à l’ordre 3. La première partie des travaux de cette thèse est consacré à une analyse approfondie de la précision du schéma CENO et à la création de termes correcteurs pour améliorer ses propriétés dispersives et dissipatives en une et deux dimensions. On propose un schéma CENO quadratique précis à l’ordre 3, puis cubique précis à l’ordre 4, pour les équations d’Euler des gaz compressibles, ainsi qu’ une première version du schéma avec capture de choc monotone. La deuxième partie des travaux est consacrée à la mise au point d’une plateforme numérique d’adaptation de maillage anisotrope multi-échelle et basée fonctionnelle intégrant le schéma CENO. Nous proposons un nouvel estimateur d’ordre 3 du schéma quadratique basé sur une reconstruction de hessien équivalent et son application à des simulations d’acoustiques instationnaire et de Scramjet stationnaire utilisant nos limiteurs. / This thesis presents to an assembly of work dedicated to the study of high order vertex-centred ENO scheme (CENO) and to anisotropic mesh adaptation for third-order accurate Fluid Mecanics problems. The thesis is structured in two parts. The first part is devoted to a thorough analysis of the CENO scheme accuracy and to the constuction of some corrector terms meant for improving the dissipative and dispersive properties for 1D and 2D numerical problems. We proposed a quadratique third-order accurate CENO scheme, then a cubic fourth-order accurate one, applied to Euler equations for compressible flows. A first monotone, shock capturing version of these scheme is also introduced in the first part. The second part of the thesis focuses on the implementation of a numerical platform for anisotropic multi-scale and goal-oriented mesh adaptivity involving the CENO scheme. A new third-order error estimator for the quadratic scheme is proposed, here based on a reconstuction of the Hessian. Numerical exemples for unsteady acoustic problems and a steady Scramjet problem computed with monotony preserving limiters are presented for validation of the theoretical results.

Dans cette thèse, nous proposons une méthode pour la visualisation d'ensembles chevauchant et de basé sur les diagrammes d'Euler. Les diagrammes d'Euler sont probablement les plus intuitifs pour représenter de manière schématique les ensembles qui partagent des éléments. Cette métaphore visuelle est ainsi un outil puissant en termes de visualisation d'information. Cependant, la génération automatique de ces diagrammes présente encore de nombreux problèmes difficiles. Premièrement, tous les clustering chevauchants ne peuvent pas être dessinées avec les diagrammes d'Euler classiques. Deuxièmement, la plupart des algorithmes existants permettent uniquement de représenter les diagrammes de dimensions modestes. Troisièmement, les besoins des applications réelles requièrent un processus plus fiable et plus rapide.Dans cette thèse, nous décrivons une version étendue des diagrammes d'Euler. Cette extension permet de modéliser l'ensemble des instances de la classe des clustering chevauchants. Nous proposons ensuite un algorithme automatique de génération de cette extension des diagrammes d'Euler. Enfin, nous présentons une implémentation logicielle et des expérimentations de ce nouvel algorithme. / In this thesis, we propose a method for the visualisation of overlapping sets and of fuzzy graph clusterings based on Euler diagrams.Euler diagrams are probably the most intuitive and most used method to depict sets in which elements can be shared. Such a powerful visualisation metaphor could be an invaluable visualisation tool, but the automatic generation of Euler diagrams still presents many challenging problems. First, not all instances can be drawn using standard Euler diagrams. Second, most existing algorithms focus on diagrams of modest dimensions while real-world applications typically features much larger data. Third, the generation process must be reliable and reasonably fast.In this thesis, we describe an extended version of Euler diagrams that can be produced for every input instance. We then propose an automatic procedure for the generation of such diagrams that specifically target large input instances. Finally, we present a software implementation of this method and we describe some output examples generated on real-world data.

We consider right modules over a ring, as models of a first order theory. We explorethe definable sets and the definable bijections between them. We employ the notionsof Euler characteristic and Grothendieck ring for a first order structure, introduced byJ. Krajicek and T. Scanlon in [24]. The Grothendieck ring is an algebraic structurethat captures certain properties of a model and its category of definable sets.If M is a module over a product of rings A and B, then M has a decomposition into a direct sum of an A-module and a B-module. Theorem 3.5.1 states that then the Grothendieck ring of M is the tensor product of the Grothendieck rings of the summands.Theorem 4.3.1 states that the Grothendieck ring of every infinite module over afield or skew field is isomorphic to Z[X].Proposition 5.2.4 states that for an elementary extension of models of anytheory, the elementary embedding induces an embedding of the corresponding Grothendieck rings. Theorem 5.3.1 is that for an elementary embedding of modules, we have the stronger result that the embedding induces an isomorphism of Grothendieck rings.We define a model-theoretic Grothendieck ring of the category Mod-R and explorethe relationship between this ring and the Grothendieck rings of general right R-modules. The category of pp-imaginaries, shown by K. Burke in [7] to be equivalentto the subcategory of finitely presented functors in (mod-R; Ab), provides a functorial approach to studying the generators of theGrothendieck rings of R-modules. It is shown in Theorem 6.3.5 that whenever R andS are Morita equivalent rings, the rings Grothendieck rings of the module categories Mod-R and Mod-S are isomorphic.Combining results from previous chapters, we derive Theorem 7.2.1 saying that theGrothendieck ring of any module over a semisimple ring is isomorphic to a polynomialring Z[X1,...,Xn] for some n.

In this paper we have developed a general theory of characteristic classes of modules. To a given invariant map defined on a Lie algebra, we associate a cohomology class by using the curvature form of a certain kind of connections. Here we present a very simple proof of the invariance theorem (Theorem 12), which states that equivalent connections give rise to the same characteristic class. We have used those invariant maps of {9} to define Chern classes of projective modules and we have derived their basic properties. It might be interesting to observe that this theory could be applied to define characteristic classes of bilinear maps. In particular, the Euler classes of {6} can be obtained in this way.

Considering the Chinese Postman Problem, in which a mailman must deliver mail to houses in a neighborhood. The mailman must cover each side of the street that has houses, at least once. The focus of this paper is our attempt to discover the optimal path, or the least number of times each street is walked. The integration of algorithms from graph theory and operations research form the method used to explain solutions to the Chinese Postman Problem.

The main purpose of this thesis is to explore the conditions of the existence and properties of the Euler line of a triangle in the hyperbolic plane. Poincaré's conformal disk model and Hermitian matrices were used in the analysis.ʹ

In this thesis the author presents a history of non-convergent series which, in the past, played an important role in mathematics. Euler's formula, Stirling's series and Poincare's theory are examined to show the development of asymptotic series, a subdivision of divergent series.