[pt] Este trabalho apresenta um estudo experimental detalhado do comportamento tensão-deformação-resistência de uma areia saturada submetida a uma condição tridimensional de carregamento. Os ensaios foram realizados nos equipamentos triaxiais cúbico e convencional. O equipamento triaxial cúbico apresenta a vantagem de controlar a magnitude das três tensões principais independentemente ( sigma 1 , sigma 2 , sigma 3 ) sob condições drenada e não drenada. Para o desenvolvimento do trabalho foi utilizada uma amostra de areia calcárea. Os corpos de prova utilizados foram moldados por pluviação submersa. No programa experimental foram realizados ensaios especiais, seguindo diferentes trajetórias de tensão. Este programa foi elaborado de modo a verificar a influência de cada parâmetro de tensão individualmente e os efeitos da anisotropia inicial de areias preparadas por pluviação submersa. Verifica-se através dos resultados de ensaios drenados que as deformações cisalhante e volumétrica são maiores na condição axissimétrica do que na de deformação plana. Tal observação equivale, em solicitações não drenadas, a um acréscimo de poropressão mais acentuado na condição axissimétrica. O comportamento anisotrópico de areias também é revelado com base em ensaios com diferentes direções ( alfa ) da tensão principal maior. Nos ensaios onde alfa = 90 graus Celsius (direção do carregamento perpendicular à de deposição do solo), ocorrem variações de deformação volumétrica e cisalhante bem mais acentuadas do que para alfa = 0 . O programa experimental mostrou ainda que areias calcáreas não cimentadas não apresentam comportamento tensão-deformação acentuadamente diferente do comportamento de areias de quartzo, mais usuais no Brasil. / [en] The subject of this dissertation is a detailed experimental study of the stress-strain-strength behavior of saturated sand under three-dimensional loading condition.The investigation was carried out in a cubic triaxial and a conventional apparatuses. The cubic triaxial apparatus has the advantage of independently controlling the magnitude of the three principal stresses (sigma1, sigma2, sigma3 ) under drained and undrained conditions. Reconstituted specimens of calcareous sand were used in all tests reported in this thesis.The specimens were prepared by pluviation of the sand in destilled water. Special tests were performed following different 3D stress paths. The experimental program was designed for checking the influence of each stress parameter individually. The effects of the inicial anisotropy of sands, caused by the water pluviation method, were also investigated.The results of the drained tests show that the shearing and volumetric strains are larger under axysimmetric than under plane strain condition. In undrained tests this observation would be equivalent to obtaining larger porepressure under axysimmetric conditions. The anisotropic behavior of sands is also noted in tests with different directions (alfa) of the major principal stress. In tests where alfa = 90 Celsius degrees ( direction of load perpendicular to pluviation) the variations in volumetric and shearing strains are much more accentuated than for alfa = 0.The experimental program also shows that the stress-strain behavior of uncemented calcareous sands is not significantly different from the behavior of quartz sands, which are more common in Brazil.

Cette thèse se propose d'étudier des problèmes de factorisations des régions cubiques. Dans le cadre de l'analyse de programme concurrent via des méthodes issues de la topologie algébrique, les régions cubiques sont un modèle géométrique simple mais expressif de la concurrence. Tout programme concurrent (sans boucle ni branchement) est ainsi représenté comme sous partie de R^n auquel on enlève des cubes interdits représentant les états du programme interdit par les contraintes de la concurrence (mutex par exemple) où n est le nombre de processus. La première partie de cette thèse s’intéresse à la question d'indépendance des processus. Cette question est cruciale dans l'analyse de programme non concurrent car elle permet de simplifier l'analyse en séparant le programme en groupe de processus indépendants. Dans le modèle géométrique d'un programme, l'indépendance se traduit comme une factorisation modulo permutation des processus. Ainsi le but de cette section est de donner un algorithme effectif de factorisation des régions cubiques et de le démontrer. L'algorithme donné est relativement simple et généralise l'algorithme très intuitif suivant (dit algorithme syntaxique). A partir du programme, on met dans un même groupe les processus qui partagent une ressource, puis l’on prend la clôture transitive de cette relation. Le nouvel algorithme s'effectue de la même manière, cependant il supprime certaines de ces relations. En effet par des jeux d'inclusion entre cubes interdits, il est possible d'avoir deux processus qui partagent une ressource mais qui sont toutefois indépendant. Ainsi la nouvelle relation est obtenue en regardant l'ensemble des cubes maximaux de la région interdite. Lorsque deux coordonnées sont différentes de R dans un cube maximal on dira qu’elles sont reliées. Il suffit alors de faire la clôture transitive de cette relation pour obtenir la factorisation optimale. La seconde partie de ce manuscrit s'intéresse à un invariant catégorique que l'on peut définir sur une région cubique. Celui-ci découpe la région cubique en cubes appelés "dés" auxquels on associe une catégorie appelée catégorie émincée de la région cubique. On peut voir cette catégorie comme un intermédiaire fini entre la catégorie des composantes et la catégorie fondamentale. On peut ainsi montrer que lorsque la région cubique factorise alors la catégorie émincée associée va elle-même se factoriser. Cependant la réciproque est plus compliquée et de nombreux contre exemples empêchent une réciproque totale. La troisième et dernière partie de cette thèse s'intéresse à la structure de produit tensoriel que l'on peut mettre sur les régions cubiques. En remarquant comment les opérations booléennes sur une région cubique peuvent être obtenues à partir des opérations sur les régions cubiques de dimension inférieure, on tente de voir ces régions cubiques comme un produit tensoriel des régions de dimension inférieure. La structure de produit tensoriel est hautement dépendante de la catégorie dans laquelle on la considère. Dans ce cas, si l'on considère le produit dans les algèbres de Boole, le résultat n'est pas celui souhaité. Au final il se trouve que le produit tensoriel dans la catégorie des demi-treillis avec zéro donne le résultat voulu. / This thesis studies some problems of the factorization of cubical areas. In the setting of analysis of programs through methods coming from algebraic topology, cubical areas are geometric models used to understand concurrency. Any concurrent programs (without loops nor branchings) can be seen as a subset of R^n where we remove some cubes which contains the states forbidden by the concurrency (think of a mutex) and where n is the number of process in the program. The first part of this thesis is interested in the question the independence of process. This question is particularly important to analyse a program, indeed being able to separate groups of process into independent part will greatly reduce the complexity of the analysis. In the geometric model, the independency is seen as a factorization up to permutation of processes. Hence the goal is to give a new effective algorithm which factorizes cubical areas, and proves that it does. The given algorithm is quite straightforward and is a generalization of the following algorithm (that we called syntactic algorithm). From the written program, groups together process that shares a resource, then take the transitive closure of this relation. This algorithm is not always optimal in that it can groups together process that actually could be separated. Thus we create a new (more relax) relationship between process. From the maximal cubes of the forbidden area of the program, if two coordinate are not equal to R, then groups them together. We can then take the transitive closure of this and get the optimal factorization. Each cube is an object of the category and between two adjacent cubes is an arrow. We can see that this category is in between the fundamental category and the components category of the cubical area. We can then show that if the cubical area factorize then so does the minced category. The reciprocal is harder to get. Indeed there's a few counter example on which we cant go back. The third and last part of this thesis is interested in seeing cubical areas as some kind of product over lower dimension cubical areas. By looking at how the booleans operations of a cubical area arise from the same operation on lower dimensional cubical areas we understand that it can be expressed as a tensor product. A tensor product is highly dependent on the category on which it is built upon. We show that to take the category of Boolean algebra is too restrictive and gives trivial result, while the category of semi-lattice with zeros works well. are not equal to R, then groups them together. We can then take the transitive closure of this and get the optimal factorization. The second part of this thesis looks at some categorical invariant that we define over cubical areas. These categories (called the minced category) slice the space into cubes.

Cubical complexes are defined in a manner analogous to that for simplicial complexes, the chief difference being that cubical complexes are unions of cubes rather than of simplices. A very natural cubical complex to consider is the complex C(k_1,...,k_n) where k_1,...,k_n are nonnegative integers. This complex has as its underlying space [0,k_1]x...x[0,k_n] subset of R^n with vertices at all points having integer coordinates and higher dimensional cubes formed by the vertices in the natural way. The genus of a cubical complex is defined to be the maximum genus of all surfaces that are subcomplexes of the cubical complex. A formula is given for determining the genus of the cubical complex C(k_1,...,k_n) when at least three of the k_i are odd integers. For the remaining cases a general solution is not known. When k_1=...=k_n=1 the genus of C(k_1,...,k_n) is shown to be (n-4)2^{n-3}+1 which is equivalent to the genus of the graph of the n-cube. Indeed, the genus of the complex and the genus of the graph of the 1-skeleton of the complex, are shown to be equal when at least three of the k_i are odd, but not equal in general.

This dissertation is a uniïfication of an analysis-based approach and the traditional topological-based approach to Poincaré duality. We examine the role of the discrete Hodge star operator in proving and in realizing the Poincaré duality isomorphism (between cohomology and homology in complementary degrees) in a cellular setting without reference to a dual cell complex. More specifically, we provide a proof of this version of Poincaré duality over R via the simplicial discrete Hodge star defined by Scott Wilson in [19] without referencing a dual cell complex. We also express the Poincaré duality isomorphism over both R and Z in terms of this discrete operator. Much of this work is dedicated to extending these results to a cubical setting, via the introduction of a cubical version of Whitney forms. A cubical setting provides a place for Robin Forman's complex of nontraditional differential forms, defined in [7], in the uniïfication of analytic and topological perspectives discussed in this dissertation. In particular, we establish a ring isomorphism (on the cohomology level) between Forman's complex of differential forms with his exterior derivative and product and a complex of cubical cochains with the discrete coboundary operator and the standard cubical cup product. / Ph. D.

The optimal number of faces in cubical complexes which lie in cubes refers to the maximum number of faces that can be constructed from a certain number of faces of lower dimension, or the minimum number of faces necessary to construct a certain number of faces of higher dimension. If <i>m</i> is the number of faces of <i>r</i> in a cubical complex, and if s > r(s < r), then the maximum(minimum) number of faces of dimension s that the complex can have is m_(s/r) +. (m-m_(r/r))^(s/r), in terms of upper and lower semipowers. The corresponding formula for simplicial complexes, proved independently by J. B. Kruskal and G. A. Katona, is m^(s/r). A proof of the formula for cubical complexes is given in this paper, of which a flawed version appears in a paper by Bernt Lindstrijm. The n-tuples which satisfy the optimaiity conditions for cubical complexes which lie in cubes correspond bijectively with f-vectors of cubical complexes. / Master of Science

This thesis presents an account of the cubical sets model of homotopy type theory using an internal type theory for elementary topoi. Homotopy type theory is a variant of Martin-Lof type theory where we think of types as spaces, with terms as points in the space and elements of the identity type as paths. We actualise this intuition by extending type theory with Voevodsky's univalence axiom which identifies equalities between types with homotopy equivalences between spaces. Voevodsky showed the univalence axiom to be consistent by giving a model of homotopy type theory in the category of Kan simplicial sets in a paper with Kapulkin and Lumsdaine. However, this construction makes fundamental use of classical logic in order to show certain results. Therefore this model cannot be used to explain the computational content of the univalence axiom, such as how to compute terms involving univalence. This problem was resolved by Cohen, Coquand, Huber and Mortberg, who presented a new model of type theory in Kan cubical sets which validated the univalence axiom using a constructive metatheory. This meant that the model provided an understanding of the computational content of univalence. In fact, the authors present a new type theory, cubical type theory, where univalence is provable using a new "glueing" type former. This type former comes with appropriate definitional equalities which explain how the univalence axiom should compute. In particular, Huber proved that any term of natural number type constructed in this new type theory must reduce to a numeral. This thesis explores models of type theory based on the cubical sets model of Cohen et al. It gives an account of this model using the internal language of toposes, where we present a series of axioms which are sufficient to construct a model of cubical type theory, and hence a model of homotopy type theory. This approach therefore generalises the original model and gives a new and useful method for analysing models of type theory. We also discuss an alternative derivation of the univalence axiom and show how this leads to a potentially simpler proof of univalence in any model satisfying the axioms mentioned above, such as cubical sets. Finally, we discuss some shortcomings of the internal language approach with respect to constructing univalent universes. We overcome these difficulties by extending the internal language with an appropriate modality in order to manipulate global elements of an object.

Les effets des transferts radiatifs sur les écoulements de convection naturelle sont étudiés en régimes transitionnel et turbulent. On considère des mélanges air/H2O/CO2 confinés dans des cavités cubiques différentiellement chauffées. Des simulations numériques de référence sont entreprises jusqu'à Ra=3x108 en couplant une méthode spectrale de collocation pour l'écoulement et une méthode de lancer de rayons, associée à un modèle ADF, pour le rayonnement. Pour l'étude du régime turbulent, une modélisation des transferts radiatifs basée sur un filtrage spatial est proposée : les contributions filtrées sont résolues par la méthode de lancer de rayons sur un maillage lâche et les contributions de sous-maille sont résolues de manière analytique dans l'espace de Fourier. Ce modèle est combiné à la simulation numérique directe de l'écoulement à Ra=3x109. Les transferts radiatifs ont pour effet de diminuer la stratification thermique verticale et d’augmenter la circulation générale. Lorsque les six parois de la cavité sont noires et le gaz transparent, deux zones de stratification thermique instable apparaissent en amont des couches limites verticales. Dès Ra=5x106, une instabilité de type Rayleigh-Bénard se développe dans ces zones, induisant des écoulements instationnaires. Lorsque les parois adiabatiques sont parfaitement réfléchissantes, les parois isothermes noires et le gaz rayonnant, des écoulements instationnaires chaotiques sont obtenus à partir de Ra=3x107. Des rouleaux contra-rotatifs à la sortie des couches limites verticales sont observés, ce qui suggère qu'une instabilité de force centrifuge soit responsable de la transition. / Radiative transfer effects on natural convection flows are investigated in transitional and turbulent regimes. Air/H2O/CO2 mixtures contained in cubical differentially heated cavities are considered. Benchmark numerical simulations are carried out up to Ra=3x108 by coupling a spectral collocation method for the flow and a ray tracing method, associated with an ADF model, for radiation. In order to study the turbulent regime, a radiative transfer model based on spatial filtering is proposed: filtered contributions are solved with the ray tracing method on a coarse grid and sub-grid contributions are obtained analytically in Fourier space. This model is combined with the direct numerical simulation of the flow at Ra=3x109. The effects of radiative transfer are a decrease of the vertical thermal stratification and an increase of the flow driven in the cavity. When the six cavity walls are black and the gas is transparent, two unstably stratified zones appear upstream the vertical boundary layers. From Ra=5x106, a Rayleigh-Bénard type instability in these zones triggers the unsteadiness. When the adiabatic walls are perfectly reflecting, the isothermal walls are black and the gas is participating, unsteady chaotic flows are obtained in this case from Ra=3x107. Counter rotating rolls at the exit of the vertical boundary layers are observed, which suggests that transition to unsteadiness is due to centrifugal forces.

Extracting surfaces, representing boundaries of objects of interest, from volumetric images, has important applications in various scientific domains, from medicine to geology. In this thesis, I introduce novel mathematical, computational, and algorithmic machinery for extraction of sheet-like surfaces (with boundary), whose boundary is unknown a-priori, a particularly important case in applications that has no convenient methods. This case of a surface with boundaries has applications in extracting faults (among other geological structures) from seismic images in geological applications. Another application domain is in the extraction of structures in the lung from computed tomography (CT) images. Although many methods have been developed in computer vision for extraction of surfaces, including level sets, convex optimization approaches, and graph cut methods, none of these methods appear to be applicable to the case of surfaces with boundary. The novel methods for surface extraction, derived in this thesis, are built on the theory of Minimal Paths, which has been used primarily to extract curves in noisy or corrupted images and have had wide applicability in 2D computer vision. This thesis extends such methods to surfaces, and it is based on novel observations that surfaces can be determined by extracting topological structures from the solution of the eikonal partial differential equation (PDE), which is the basis of Minimal Path theory. Although topological structures are known to be difficult to extract from images, which are both noisy and discrete, this thesis builds robust methods based on Morse theory and computational topology to address such issues. The algorithms have run-time complexity O(NlogN), less complex than existing approaches. The thesis details the algorithms, theory, and shows an extensive experimental evaluation on seismic images and medical images. Experiments show out-performance in accuracy, computational speed, and user convenience compared with related state-of-the-art methods. Lastly, the thesis shows the methodology developed for the particular case of surfaces with boundary extends to surfaces without boundary and also surfaces with different topologies, such as cylindrical surfaces, both important cases for many applications in medical image analysis.

京都大学 / 新制・課程博士 / 博士(理学) / 甲第24386号 / 理博第4885号 / 新制||理||1699(附属図書館) / 京都大学大学院理学研究科数学・数理解析専攻 / (主査)教授 平岡 裕章, 教授 COLLINS Benoit Vincent Pierre, 教授 坂上 貴之 / 学位規則第4条第1項該当 / Doctor of Science / Kyoto University / DFAM

La théorie de l'homologie formalise la notion de trou dans un espace. Pour un sous-ensemble de l'espace Euclidien, on définit une séquence de groupes d'homologie, dont leurs rangs sont interprétés comme le nombre de trous de chaque dimension. Ces groupes sont calculables quand l'espace est décrit d'une façon combinatoire, comme c'est le cas pour les complexes simpliciaux ou cubiques. À partir d'un objet discret (un ensemble de pixels, voxels ou leur analogue en dimension supérieure) nous pouvons construire un complexe cubique et donc calculer ses groupes d'homologie.Cette thèse étudie trois approches relatives au calcul de l'homologie sur des objets discrets. En premier lieu, nous introduisons le champ de vecteurs discret homologique, une structure combinatoire généralisant les champs de vecteurs gradients discrets, qui permet de calculer les groupes d'homologie. Cette notion permet de voir la relation entre plusieurs méthodes existantes pour le calcul de l'homologie et révèle également des notions subtiles associés. Nous présentons ensuite un algorithme linéaire pour calculer les nombres de Betti dans un complexe cubique 3D, ce qui peut être utilisé pour les volumes binaires. Enfin, nous présentons deux mesures (l'épaisseur et l'ampleur) associés aux trous d'un objet discret, ce qui permet d'obtenir une signature topologique et géométrique plus intéressante que les simples nombres de Betti. Cette approche fournit aussi quelques heuristiques permettant de localiser les trous, d'obtenir des générateurs d'homologie ou de cohomologie minimaux, d'ouvrir et de fermer les trous. / Homology theory formalizes the concept of hole in a space. For a given subspace of the Euclidean space, we define a sequence of homology groups, whose ranks are considered as the number of holes of each dimension. Hence, b0, the rank of the 0-dimensional homology group, is the number of connected components, b1 is the number of tunnels or handles and b2 is the number of cavities. These groups are computable when the space is described in a combinatorial way, as simplicial or cubical complexes are. Given a discrete object (a set of pixels, voxels or their analog in higher dimension) we can build a cubical complex and thus compute its homology groups.This thesis studies three approaches regarding the homology computation of discrete objects. First, we introduce the homological discrete vector field, a combinatorial structure which generalizes the discrete gradient vector field and allows to compute the homology groups. This notion allows to see the relation between different existing methods for computing homology. Next, we present a linear algorithm for computing the Betti numbers of a 3D cubical complex, which can be used for binary volumes. Finally, we introduce two measures (the thickness and the breadth) associated to the holes in a discrete object, which provide a topological and geometric signature more interesting than only the Betti numbers. This approach provides also some heuristics for localizing holes, obtaining minimal homology or cohomology generators, opening and closing holes.