O presente estudo tem por objetivo analisar, sob a perspectiva antropológica, representações envolvidas no universo simbólico da etiqueta a partir de um campo privilegiado de observação empírica - os cursos de etiqueta oferecidos na cidade de São Paulo nos anos de 1990 - e, também, de instrumentos midiáticos como sites, livros, programas televisivos que constroem um repertório cultural do qual o público se utiliza para consumir tal bem simbólico. Analisamos, por fim, de que forma os aspectos conflitivos e simbólicos que emergem nesse campo polissêmico nos ajudam a compreender a "teia de significados" construída pelos sujeitos envolvidos nessa prática cultural. / The aim of the present study is to anaylise the representation involved in the symbolic universe of etiquette from an anthropological view, based on a privileged field of empirical observation - the etiquette courses taking place in the city of São Paulo in the 1990´s - and also on the media (web sites, books, magazines and tv programmes), which build a cultural fund that provides the public with such symbolic goods. At last we have analysed how the symbolic and conflitive aspects that come out from this varied help us to understand the "web of meanings" created by the individuals involved in this cultural practice.

Adaptive finite element methods for the solution of partial differential equations require effective methods of mesh refinement and coarsening, fast multilevel solvers for the systems of FE equations need a hierarchical structure of the grid. In the paper a technology is presented for the application of irregular hierarchical triangular meshes arising from refinement by only dividing elements into four congruent triangles. The paper describes the necessary data structures and data structure management, the principles and algorithms of refining and coarsening the mesh, and also a specific assembly technique for the FE equations system. Aspects of the parallel implementation on MIMD computers with a message passing communication are included.

We consider high order discontinuous-Galerkin finite element methods for partial differential equations, with a focus on the neutron transport equation. We begin by examining a method for preprocessing block-sparse matrices, of the type that arise from discontinuous-Galerkin methods, prior to factorisation by a multifrontal solver. Numerical experiments on large two and three dimensional matrices show that this pre-processing method achieves a significant reduction in fill-in, when compared to methods that fail to exploit block structures. A discontinuous-Galerkin finite element method for the neutron transport equation is derived that employs high order finite elements in both space and angle. Parallel Krylov subspace based solvers are considered for both source problems and $k_{eff}$-eigenvalue problems. An a-posteriori error estimator is derived and implemented as part of an h-adaptive mesh refinement algorithm for neutron transport $k_{eff}$-eigenvalue problems. This algorithm employs a projection-based error splitting in order to balance the computational requirements between the spatial and angular parts of the computational domain. An hp-adaptive algorithm is presented and results are collected that demonstrate greatly improved efficiency compared to the h-adaptive algorithm, both in terms of reduced computational expense and enhanced accuracy. Computed eigenvalues and effectivities are presented for a variety of challenging industrial benchmarks. Accurate error estimation (with effectivities of 1) is demonstrated for a collection of problems with inhomogeneous, irregularly shaped spatial domains as well as multiple energy groups. Numerical results are presented showing that the hp-refinement algorithm can achieve exponential convergence with respect to the number of degrees of freedom in the finite element space

Cette thèse, intitulée NSIBM : un solveur parallèle de Navier-Stokes avec raffinement automatique basé sur la méthode des frontières immergées, a été effectuée au sein du laboratoire iCube, département de mécanique, à Strasbourg, dans le quartier de l'Orangerie, sous la direction du professeur Yannick Hoarau. L'essentiel du travail effectué consiste en le développement d'un programme capable de résoudre numériquement l'équation de Navier-Stokes qui régit des fluides en mouvement. Une attention particulière a été portée à la production de maillages conformes aux géométries proposées et à leur génération. Les moyens mis en œuvre ici pour gérer l'éternel problème de la finesse du maillage opposée au trop grand nombre de cellules sont multiples : le raffinement, la parallélisation et les frontières immergées. Dans un premier temps, j'ai conçu un générateur de maillage en deux et trois dimensions en y intégrant la possibilité de diviser des cellules, et cela de manière automatique, par des critères géométriques, numériques ou physiques. Il permet également de supprimer des cellules, de manière à ne pas mailler le vide ou les parties solides de la géométrie.Dans un deuxième temps, j'ai rendu ce code parallèle en lui donnant la capacité d'utiliser plusieurs processeurs, afin de calculer plus vite et donc d'utiliser davantage de mailles. Cette étape fait appel à deux technologies : Metis, qui partage équitablement les mailles sur le nombre choisi de processeurs et OpenMPI, qui est l'interface de communication entre ces processeurs. Enfin, la méthode des frontières immergées a été introduite au code pour gérer les bords non verticaux ou horizontaux dans un maillage cartésien, c'est-à-dire formé de rectangles ou de pavés droits. Elle consiste à donner un caractère hybride à une cellule traversée par une frontière par l'introduction d'un terme numérique de forçage simulant la présence de la paroi.Ce travail de développement a ensuite été mis à l'épreuve et validé dans une série de cas tests en deux comme en trois dimensions. Des exemples de maillages complexes générés facilement sont donnés. / This thesis, entitled NSIBM: a parallel Navier-Stokes solver with automatic mesh refinement based on immersed boundary method, has been conducted within the iCube laboratory dedicated to mechanics and located in Strasbourg. It has been supervised by Professor Yannick Hoarau. This work mainly deals with coding a program able to solve the Navier-Stokes equations that governs moving fluids, in a numerical way. Particular attention was paid to the production of meshes that suit given geometries and their generation.The means used here to handle the eternal problem of the fineness of the mesh opposed to too many cells are several~:refinement, parallelization and the immersed boundary method.Initially, I designed a two and three-dimensional mesh generator that includes the possibility of dividing cells,in an automatic way, by geometrical, numerical or physical criteria. It also allows to remove cells, where there is no point keeping it. Secondly, I parallelized the program by giving him the ability to use multiple processors to calculate faster and therefore use bigger meshes.This step uses two available libraries~: \textit{Metis}, which gives a optimal mesh partition, and \textit{openMPI}, which deals with communication between nodes. Finally, the immersed boundary method has been implemented to handle non-vertical or non-horizontal edges in a cartesian grid. Its principle is to confer a hybrid status to a cell which is crossed by an edge by adding a numerical force term simulating the presence of the boundary. This development work was then tested and validated in a serie of test cases in two and three dimensions. Examples of complex meshes easily generated are given.

Abstract Due to increasing amount of concurrency, systems have become difficult to design and analyse. In this effort, formal verification, which means proving the correctness of a system, has turned out to be useful. Unfortunately, the application domain of the formal verification methods is often indefinite, tools are typically unavailable, and most of the techniques do not suit especially well for the verification of software systems. These are the questions addressed in the thesis. A typical approach to modelling systems and specifications is to consider them parameterised by the restrictions of the execution environment, which results in an (infinite) family of finite-state verification tasks. The thesis introduces a novel approach to the verification of such infinite specification-system families represented as labelled transition systems (LTSs). The key idea is to exploit the algebraic properties of the correctness relation. They allow the correctness of large system instances to be derived from that of smaller ones and, in the best case, an infinite family of finite-state verification tasks to be reduced to a finite one, which can then be solved using existing tools. The main contribution of the thesis is an algorithm that automates the reduction method. A specification and a system are given as parameterised LTSs and the allowed parameter values are encoded using first order logic. Parameters are sets and relations over these sets, which are typically used to denote, respectively, identities of replicated components and relationships between them. Because the number of parameters is not limited and they can be nested as well, one can express multiply parameterised systems with a parameterised substructure, which is an essential property from the viewpoint of modelling software systems. The algorithm terminates on all inputs, so its application domain is explicit in this sense. Other proposed parameterised verification methods do not have both these features. Moreover, some of the earlier results on the verification of parameterised systems are obtained as a special case of the results presented here. Finally, several natural and significant extensions to the formalism are considered, and it is shown that the problem becomes undecidable in each of the cases. Therefore, the algorithm cannot be significantly extended in any direction without simultaneously restricting some other aspect.

Doctor of Philosophy / Department of Hospitality Management and Dietetics / Junehee Kwon / Service sabotage refers to employees' deliberate actions that negatively affect service, functional quality, employee-customer rapport, and company performance. Almost all frontline employees in the hospitality industry have witnessed service sabotage behaviors, and 85% admitted to engaging in such misbehaviors. Despite the prevalence and profound impact of service sabotage, it has been a challenge for researchers to measure the construct and understand specific and contextualized restaurant service sabotage behaviors. Thus, the purpose of this dissertation was to develop a reliable and valid scale to measure restaurant service sabotage. A mixed methods research design was applied. A qualitative study was conducted to explore prevalent restaurant service sabotage behaviors and to generate an item pool for the initial scale, followed by two quantitative studies with two different groups of non-managerial frontline employees in full-service restaurants to refine and validate the scale. Guided by critical incident technique, 243 critical incidents were derived from the in-depth interviews (n = 26). Of those, 28 explicit types of restaurant service sabotage behaviors were identified and further categorized into three behavioral groups: targeting customers, colleagues, and restaurants. In conjunction with scale items extracted from related measures, an initial instrument consisting of 39 items was developed and administered to an online restaurant employee panel by hiring a professional research firm. A total of 419 usable responses were collected and analyzed using principal axis factoring with a promax rotation. Results revealed a 13-item scale with three dominant factors. To validate the scale, 463 usable responses were gathered for data analyses. Results of the confirmatory factor analyses indicated a good model fit of the three-factor model, Chi-square/df=3.15, GFI=.96, CFI=.97, NFI=.95, and RMSEA=.07 while reducing the scale items from 13 to 10 and supporting the scale's dimensionality. Tests for validating construct validity were all fully supported. Cronbach’s alpha coefficients were all greater than .70, showing internal consistency of the scale. This psychometrically valid and conceptually sound scale may be applied in future restaurant service sabotage research and may stimulate additional studies to advance the theory and explore the criterion network. Implications, limitations, and direction for future research are discussed.

Dans le contexte des sciences archéologiques, des images tridimensionnelles issues de scanners tomodensitométriques sont segmentées en régions d’intérêt afin d’en faire une analyse. Ces objets virtuels sont souvent utilisés dans le but d’effectuer des mesures précises. Une partie de ces analyses nécessite d’extraire la surface des régions d’intérêt. Cette thèse se place dans ce cadre et vise à améliorer la précision de l’extraction de surface. Nous présentons dans ce document nos contributions : tout d’abord, l’algorithme du HMH pondéré dont l’objectif est de positionner précisément un point à l’interface entre deux matériaux. Appliquée à une extraction de surface, cette méthode pose des problèmes de topologie sur la surface résultante. Nous avons donc proposé deux autres méthodes : la méthode du HMH discret qui permet de raffiner la segmentation d’objet 3D, et la méthode du HMH surfacique qui permet une extraction de surface contrainte garantissant l’obtention d’une surface topologiquement correcte. Il est possible d’enchainer ces deux méthodes sur une image 3D pré-segmentée afin d’obtenir une extraction de surface précise des objets d’intérêt. Ces méthodes ont été évaluées sur des acquisitions simulées d’objets synthétiques et des acquisitions réelles d’artéfacts archéologiques. / In the context of archaeological sciences, 3D images produced by Computer Tomography scanners are segmented into regions of interest corresponding to virtual objects in order to make some scientific analysis. These virtual objects are often used for the purpose of performing accurate measurements. Some of these analysis require extracting the surface of the regions of interest. This PhD falls within this framework and aims to improve the accuracy of surface extraction. We present in this document our contributions : first of all, the weighted HMH algorithm whose objective is to position precisely a point at the interface between two materials. But, applied to surface extraction, this method often leads to topology problems on the resulting surface. So we proposed two other methods : The discrete HMH method which allows to refine the 3D object segmentation, and the surface HMH method which allows a constrained surface extraction ensuring a topologically correct surface. It is possible to link these two methods on a pre-segmented 3D image in order to obtain a precise surface extraction of the objects of interest These methods were evaluated on simulated CT-scan acquisitions of synthetic objects and real acquisitions of archaeological artefacts.

In this thesis, results of the investigation of a new low-dimensional cobaltates Ba2-xSrxCoO4 are presented. The synthesis of both polycrystalline and single crystalline compounds using the methods of conventional solid state chemical reaction and floating-zone optical furnace is first introduced. Besides making polycrystalline powders, we successfully, for the first time, synthesized large single crystals of Ba2CoO4. Single crystals were also obtained for Sr doped Ba2-xSrxCoO4. Powder and single crystal x-ray diffraction results indicate that pure Ba2CoO4 has a monoclinic structure at room temperature. With Sr doping, the lattice structure changes to orthorhombic when x ≥ 0.5 and to tetragonal when x = 2.0. In addition, Ba2CoO4 and Sr2CoO4, have completely different basic building blocks in the structure. One is CoO4 tetrahedron and the later is CoO6 octahedron, respectively. Electronic and magnetic properties were characterized and discussed. The magnetic susceptibility, specific heat and thermal conductivity show that Ba2CoO4 has an antiferromagnetic (AF) ground state with an AF ordering temperature TN = 25 K. However, the magnitude of the Néel temperature TN is significantly lower than the Curie-Weiss temperature (|θ| ~ 110 K), suggesting either reduced-dimensional magnetic interactions and/or the existence of magnetic frustration. The AF interaction persists in all the samples with different doping concentrations. The Néel temperature doesn’t vary much in the monoclinic structure regime but decreases when the system enters orthorhombic. Magnetically, Ba2CoO4 has an AF insulating ground state while Sr2CoO4 has a ferromagnetic (FM) metallic ground state. Neutron powder refinement results indicate a magnetic structure with the spin mostly aligned along the a-axis. The result from a μ-spin rotation/relaxation (μ+SR) experiment agrees with our refinement. It confirms the AF order in the ab-plane. We also studied the spin dynamics and its anisotropy in the AF phase. The results from inelastic neutron scattering show that spin waves have a clear dispersion along a-axis but not along c-axis, indicating spin anisotropy. This work finds the strong spin-lattice coupling in this novel complex material. The interplay between the two degrees of freedom results an interesting phase diagram. Further research is needed when large single crystal samples are available.

Grâce aux progrès récents en photogrammétrie, il est désormais possible de reconstruire automatiquement un modèle d'une scène 3D à partir de photographies ou d'une vidéo. La reconstruction est réalisée en plusieurs étapes. Tout d'abord, on détecte des traits saillants (features) dans chaque image, souvent des points mais plus généralement des régions. Puis on cherche à les mettre en correspondance entre images. On utilise ensuite les traits communs à deux images pour déterminer la pose (positions et orientations) relative des images. Puis les poses sont mises dans un même repère global et la position des traits saillants dans l'espace est reconstruite (structure from motion). Enfin, un modèle 3D dense de la scène peut être estimé. La détection de traits saillants, leur appariement, ainsi que l'estimation de la position des caméras, jouent des rôles primordiaux dans la chaîne de reconstruction 3D. Des imprécisions ou des erreurs dans ces étapes ont un impact majeur sur la précision et la robustesse de la reconstruction de la scène entière. Dans cette thèse, nous nous intéressons à l'amélioration des méthodes pour établir la correspondance entre régions caractéristiques et pour les sélectionner lors de l'estimation des poses de caméras, afin de rendre les résultats de reconstruction plus robustes et plus précis. Nous introduisons tout d'abord une contrainte photométrique pour une paire de correspondances (VLD) au sein d'une même image, qui est plus fiable que les contraintes purement géométriques. Puis, nous proposons une méthode semi-locale (K-VLD) pour la mise en correspondance, basée sur cette contrainte photométrique. Nous démontrons que notre méthode est très robuste pour des scènes rigides, mais aussi non-rigides ou répétitives, et qu'elle permet d'améliorer la robustesse et la précision de méthodes d'estimation de poses, notamment basées sur RANSAC. Puis, pour améliorer l'estimation de la position des caméras, nous analysons la précision des reconstructions et des estimations de pose en fonction du nombre et de la qualité des correspondances. Nous en dérivons une formule expérimentale caractérisant la relation ``qualité contre quantité''. Sur cette base, nous proposons une méthode pour sélectionner un sous-ensemble des correspondances de meilleure qualité de façon à obtenir une très haute précision en estimation de poses. Nous cherchons aussi raffiner la précision de localisation des points en correspondance. Pour cela, nous développons une extension de la méthode de mise en correspondance aux moindres carrés (LSM) en introduisant un échantillonnage irrégulier et une exploration des échelles d'images. Nous montrons que le raffinement et la sélection de correspondances agissent indépendamment pour améliorer la reconstruction. Combinées, les deux méthodes produisent des résultats encore meilleurs / With the recent progress in photogrammetry, it is now possible to automatically reconstruct a model of a 3D scene from pictures or videos. The model is reconstructed in several stages. First, salient features (often points, but more generally regions) are detected in each image. Second, features that are common in images pairs are matched. Third, matched features are used to estimate the relative pose (position and orientation) of images. The global poses are then computed as well as the 3D location of these features (structure from motion). Finally, a dense 3D model can be estimated. The detection of salient features, their matching, as well as the estimation of camera poses play a crucial role in the reconstruction process. Inaccuracies or errors in these stages have a major impact on the accuracy and robustness of reconstruction for the entire scene. In this thesis, we propose better methods for feature matching and feature selection, which improve the robustness and accuracy of existing methods for camera position estimation. We first introduce a photometric pairwise constraint for feature matches (VLD), which is more reliable than geometric constraints. Then we propose a semi-local matching approach (K-VLD) using this photometric match constraint. We show that our method is very robust, not only for rigid scenes but also for non-rigid and repetitive scenes, which can improve the robustness and accuracy of pose estimation methods, such as based on RANSAC. To improve the accuracy in camera position estimation, we study the accuracy of reconstruction and pose estimation in function of the number and quality of matches. We experimentally derive a “quantity vs. quality” relation. Using this relation, we propose a method to select a subset of good matches to produce highly accurate pose estimations. We also aim at refining match position. For this, we propose an improvement of least square matching (LSM) using an irregular sampling grid and image scale exploration. We show that match refinement and match selection independently improve the reconstruction results, and when combined together, the results are further improved

Dois métodos distintos são descritos e implementados. O primeiro método, proposto por Ruppert, possui garantias teóricas de qualidade quando a fronteira do domínio obedece certas restrições. O segundo método, proposto por Persson, possibilita um maior controle na densidade dos elementos que discretizam o domínio. As vantagens, desvantagens e particularidades de cada um dos métodos são descritas e detalhadas / Two distinct methods are described and implemented. The first method, proposed by Ruppert, has theoretical guarantees on the quality of elements when the domain boundaries respect certain restrictions. The second method, proposed by Persson, makes it possible to have greater control over the density of the elements that make up the domain. The advantages, disadvantages and specific points about each method are described and detailed