Academic literature on the topic 'Maxims, Latin'

La mort reste une énigme essentielle de la vie humaine et la restera pour toujours du fait qu’elle est une irréalité dont l’homme ne peut aucunement faire l’expérience. Son idée, pour dire autrement, est à ce titre posée en dehors du projet de l’existence, si l’on croit Sartre. Or, un philosophe comme Heidegger la pose même au fin-fond de notre expérience en mettant en avant sa fameuse thèse de l’être-pour-la-mort. Quoiqu’il en soit, la mort étend son royaume partout, depuis la terre au ciel, et demeure d’actualité hier et de nos jours. D’où son omniprésence aussi bien dans les textes des philosophes et penseurs que dans les propos du peuple ; dans les sentences ainsi que dans les proverbes. Ces derniers font justement l’objet de notre thèse. Nous avons en effet essayé de voir l’image que trouve la mort dans ces textes de sentence ou de proverbe, selon qu’elle est exprimée par le persan ou le français ; d’où l’importance qui est également accordée aux espaces culturels différents l’un de l’autre que sont l’Orient et l’Occident. La mort change de visage, nous allons le voir, suivant qu’elle sera traitée sous la plume d’un religieux ou d’un athée. Il est pour ainsi dire question des conceptions ou visions du monde, de la mort en l’occurrence, qui diffèrent d’un espace à l’autre et qui feront désormais, peut-être, l’intérêt des recherches à venir. Notre thèse se veut ainsi une analyse, si ce n’est une histoire, de la mort à travers une étude comparée des proverbes et sentences en langues latine, persane et française<br>Death remains an essential mystery of human life and will stay so forever since it is an unreality that human cannot experience at all. Its idea, in other words, is something outside the notion of existence, if we believe in Sartre. Where as, a philosopher like Heidegger, has even gone beyond by putting in advance his famous thesis of being-for-death. However, death spreads its kingdom everywhere, from earth to heaven, and remains the reality of yesterday and today. These comprise the subject of this thesis. We have indeed tried to see the picture that death would find in the sentences or proverbs, according to whether it is expressed in Persian or French; hence the importance is equally attached to the cultural differences of the East and the West. Death changes the face; we will see it: following that it will be treated under the pen of a religious or an atheist. This is for the purpose of questioning the concept or vision of the world, of death in this case, which differ from one place to another and who will now, perhaps, be interested in the future research. This thesis is an analysis, if not a story, of death through a comparative study of proverbs and sentences in Latin, Persian and French languages

This thesis considers problems concerning Latin squares and sets of mutually quasiorthogonal Latin squares (MQOLS). We show how MQOLS are related to a number of other designs and establish bounds on Nq(n), the maximum number of Latin squares of order n in a mutually quasi-orthogonal set. We report the number of quasi-complete mappings admitted by each group of order 15 or less, and explain the surprising result that each of the non-cyclic groups of order 8 possesses exactly 384 complete mappings. For each group G of order 15 or less, we identify the sizes of all maximal sets of mutually orthogonal orthomorphisms. We also identify a number of new maximal sets for larger groups. We present a method to determine all proper, maximal sets of MQOLS of order n and carry this out for n < 6. Also we present a search for 3 MQOLS of order 10, which, whilst not identifying such a set, led to the identification of all resolutions of each (10,3, 2)-balanced incomplete block design. We give a construction for MQOLS based on groups, and use this to determine new sets of 2n - 1 MQOLS of order 2n based on two infinite classes of group. Existence results for MQOLS based on groups are also extended. Two constructions for (n x n)/k semi-Latin squares are given, one of which provides some new A-, D- and E-optimal examples with k > n which out-perform the existing A-, D- and E-optimal examples in the E'-criteria. Finally we consider the problem of determining invertible directed terraces of each non-abelian group of order < 21, and in so doing construct the first doubly balanced bipartite tournament of odd order.

Un hypercube latin (LHD) maximin est un ensemble de points contenus dans un hypercube tel que les points ne partagent de coordonnées sur aucune dimension et tel que la distance minimale entre deux points est maximale. Les LHDs maximin sont particulièrement utilisés pour la construction de métamodèles en raison de leurs bonnes propriétés pour l’échantillonnage. Comme la plus grande partie des travaux concernant les LHD se sont concentrés sur leur construction par des algorithmes heuristiques, nous avons décidé de produire une étude détaillée du problème, et en particulier de sa complexité et de son approximabilité en plus des algorithmes heuristiques permettant de le résoudre en pratique.Nous avons généralisé le problème de construction d’un LHD maximin en définissant le problème de compléter un LHD entamé en respectant la contrainte maximin. Le sous-problème dans lequel le LHD partiel est vide correspond au problème de construction de LHD classique. Nous avons étudié la complexité du problème de complétion et avons prouvé qu’il est NP-complet dans de nombreux cas. N’ayant pas déterminé la complexité du sous-problème, nous avons cherché des garanties de performances pour les algorithmes résolvant les deux problèmes.D’un côté, nous avons prouvé que le problème de complétion n’est approximable pour aucune norme en dimensions k ≥ 3. Nous avons également prouvé un résultat d’inapproximabilité plus faible pour la norme L1 en dimension k = 2. D’un autre côté, nous avons proposé un algorithme d’approximation pour le problème de construction, et avons calculé le rapport d’approximation grâce à deux bornes supérieures que nous avons établies. En plus de l’aspect théorique de cette étude, nous avons travaillé sur les algorithmes heuristiques, et en particulier sur la méta-heuristique du recuit simulé. Nous avons proposé une nouvelle fonction d’évaluation pour le problème de construction et de nouvelles mutations pour les deux problèmes, permettant d’améliorer les résultats rapportés dans la littérature<br>A maximin Latin Hypercube Design (LHD) is a set of point in a hypercube which do not share a coordinate on any dimension and such that the minimal distance between two points, is maximal. Maximin LHDs are widely used in metamodeling thanks to their good properties for sampling. As most work concerning LHDs focused on heuristic algorithms to produce them, we decided to make a detailed study of this problem, including its complexity, approximability, and the design of practical heuristic algorithms.We generalized the maximin LHD construction problem by defining the problem of completing a partial LHD while respecting the maximin constraint. The subproblem where the partial LHD is initially empty corresponds to the classical LHD construction problem. We studied the complexity of the completion problem and proved its NP-completeness for many cases. As we did not determine the complexity of the subproblem, we searched for performance guarantees of algorithms which may be designed for both problems. On the one hand, we found that the completion problem is inapproximable for all norms in dimensions k ≥ 3. We also gave a weaker inapproximation result for norm L1 in dimension k = 2. On the other hand, we designed an approximation algorithm for the construction problem which we proved using two new upper bounds we introduced.Besides the theoretical aspect of this study, we worked on heuristic algorithms adapted for these problems, focusing on the Simulated Annealing metaheuristic. We proposed a new evaluation function for the construction problem and new mutations for both the construction and completion problems, improving the results found in the literature

Part I Anastasius Bibliothecarius, papal librarian, translator and diplomat, is one of the pivotal figures of the ninth century in both literary and political contexts. His contribution to relations between the eastern and western church can be considered to have had both positive and negative ramifications, and it will be argued that his translations of various Greek works into Latin played a significant role in achieving his political agenda, complex and convoluted as this was. Being one of relatively few Roman bilinguals in the latter part of the ninth century, Anastasius found that his linguistic skills opened an avenue into papal affairs that was not closed by even the greatest breaches of trust and violations of canonical law on his part. His chequered career spanning five pontificates will be reviewed in the first chapter. In Chapter 2, we discuss his corpus of works of translation, in particular the Collectanea, whose sole surviving witness, the Parisinus Latinus 5095, has been partially edited in this study. This collation and translation of seven documents pertaining to the life of Maximus the Confessor provides us with a unique insight into Anastasius' capacity as a translator, and into the political and cultural significance of the commissioning and dedication of his hagiographic and other translated works in general. These seven documents will be examined in detail in Chapter 3, and compared with the Greek tradition, where that has survived, in an effort to establish the codes governing translation in this period, and to establish which manuscripts of the Greek tradition correspond most closely to Anastasius' (lost) model. In Chapter 4, we analyse consistency of style and method by comparison with Anastasius' translation of the Historia Mystica attributed to Germanus of Constantinople. Anastasius' methodology will be compared and contrasted with that of his contemporary John Scotus Eriugena, to place his oeuvre in the broader context of bilingualism in the West in the ninth century. Part II contains a critical edition of the text with facing English translation and historical and linguistic annotations.

Tunnels, culverts, and subway stations are the main parts of an integrated infrastructure system. Most of them are constructed by the cut-and-cover method at shallow depths (mainly lower than 30 m) of soil deposits, where large-scale seismic ground deformation can occur with lower stiffness and strength of the soil. Therefore, the transverse racking deformation (one of the major seismic ground deformation) due to soil shear deformations should be included in the seismic design of underground structures using cost- and time-efficient methods that can achieve robustness of design and are easily understood by engineers. This paper aims to develop a simplified but comprehensive approach relating to vulnerability assessment in the form of fragility curves on a shallow two-story reinforced concrete underground box structure constructed in a highly-weathered soil. In addition, a comparison of the results of earthquakes per peak ground acceleration (PGA) is conducted to determine the effective and appropriate number for cost- and time-benefit analysis. The ground response acceleration method for buried structures (GRAMBS) is used to analyze the behavior of the structure subjected to transverse seismic loading under quasi-static conditions. Furthermore, the damage states that indicate the exceedance level of the structural strength capacity are described by the results of nonlinear static analyses (or so-called pushover analyses). The Latin hypercube sampling technique is employed to consider the uncertainties associated with the material properties and concrete cover owing to the variation in construction conditions. Finally, a large number of artificial ground shakings satisfying the design spectrum are generated in order to develop the seismic fragility curves based on the defined damage states. It is worth noting that the number of ground motions per PGA, which is equal to or larger than 20, is a reasonable value to perform a structural analysis that produces satisfactory fragility curves.

La simulation numérique est devenue une alternative à l’expérimentation réelle pour étudier des phénomènes physiques. Cependant, les phénomènes complexes requièrent en général un nombre important de simulations, chaque simulation étant très coûteuse en temps de calcul. Une approche basée sur la théorie des plans d’expériences est souvent utilisée en vue de réduire ce coût de calcul. Elle consiste à partir d’un nombre réduit de simulations, organisées selon un plan d’expériences numériques, à construire un modèle d’approximation souvent appelé métamodèle, alors beaucoup plus rapide à évaluer que le code lui-même. Traditionnellement, les plans utilisés sont des plans de type Space-Filling Design (SFD). La première partie de la thèse concerne la construction de plans d’expériences SFD à taille fixe adaptés à l’identification d’un modèle de krigeage car le krigeage est un des métamodèles les plus populaires. Nous étudions l’impact de la contrainte Hypercube Latin (qui est le type de plans les plus utilisés en pratique avec le modèle de krigeage) sur des plans maximin-optimaux. Nous montrons que cette contrainte largement utilisée en pratique est bénéfique quand le nombre de points est peu élevé car elle atténue les défauts de la configuration maximin-optimal (majorité des points du plan aux bords du domaine). Un critère d’uniformité appelé discrépance radiale est proposé dans le but d’étudier l’uniformité des points selon leur position par rapport aux bords du domaine. Ensuite, nous introduisons un proxy pour le plan minimax-optimal qui est le plan le plus proche du plan IMSE (plan adapté à la prédiction par krigeage) et qui est coûteux en temps de calcul, ce proxy est basé sur les plans maximin-optimaux. Enfin, nous présentons une procédure bien réglée de l’optimisation par recuit simulé pour trouver les plans maximin-optimaux. Il s’agit ici de réduire au plus la probabilité de tomber dans un optimum local. La deuxième partie de la thèse porte sur un problème légèrement différent. Si un plan est construit de sorte à être SFD pour N points, il n’y a aucune garantie qu’un sous-plan à n points (n 6 N) soit SFD. Or en pratique le plan peut être arrêté avant sa réalisation complète. La deuxième partie est donc dédiée au développement de méthodes de planification séquentielle pour bâtir un ensemble d’expériences de type SFD pour tout n compris entre 1 et N qui soient toutes adaptées à la prédiction par krigeage. Nous proposons une méthode pour générer des plans séquentiellement ou encore emboités (l’un est inclus dans l’autre) basée sur des critères d’information, notamment le critère d’Information Mutuelle qui mesure la réduction de l’incertitude de la prédiction en tout point du domaine entre avant et après l’observation de la réponse aux points du plan. Cette approche assure la qualité des plans obtenus pour toutes les valeurs de n, 1 6 n 6 N. La difficulté est le calcul du critère et notamment la génération de plans en grande dimension. Pour pallier ce problème une solution a été présentée. Cette solution propose une implémentation astucieuse de la méthode basée sur le découpage par blocs des matrices de covariances ce qui la rend numériquement efficace<br>In recent years, computer simulation models are increasingly used to study complex phenomena. Such problems usually rely on very large sophisticated simulation codes that are very expensive in computing time. The exploitation of these codes becomes a problem, especially when the objective requires a significant number of evaluations of the code. In practice, the code is replaced by global approximation models, often called metamodels, most commonly a Gaussian Process (kriging) adjusted to a design of experiments, i.e. on observations of the model output obtained on a small number of simulations. Space-Filling-Designs which have the design points evenly spread over the entire feasible input region, are the most used designs. This thesis consists of two parts. The main focus of both parts is on construction of designs of experiments that are adapted to kriging, which is one of the most popular metamodels. Part I considers the construction of space-fillingdesigns of fixed size which are adapted to kriging prediction. This part was started by studying the effect of Latin Hypercube constraint (the most used design in practice with the kriging) on maximin-optimal designs. This study shows that when the design has a small number of points, the addition of the Latin Hypercube constraint will be useful because it mitigates the drawbacks of maximin-optimal configurations (the position of the majority of points at the boundary of the input space). Following this study, an uniformity criterion called Radial discrepancy has been proposed in order to measure the uniformity of the points of the design according to their distance to the boundary of the input space. Then we show that the minimax-optimal design is the closest design to IMSE design (design which is adapted to prediction by kriging) but is also very difficult to evaluate. We then introduce a proxy for the minimax-optimal design based on the maximin-optimal design. Finally, we present an optimised implementation of the simulated annealing algorithm in order to find maximin-optimal designs. Our aim here is to minimize the probability of falling in a local minimum configuration of the simulated annealing. The second part of the thesis concerns a slightly different problem. If XN is space-filling-design of N points, there is no guarantee that any n points of XN (1 6 n 6 N) constitute a space-filling-design. In practice, however, we may have to stop the simulations before the full realization of design. The aim of this part is therefore to propose a new methodology to construct sequential of space-filling-designs (nested designs) of experiments Xn for any n between 1 and N that are all adapted to kriging prediction. We introduce a method to generate nested designs based on information criteria, particularly the Mutual Information criterion. This method ensures a good quality forall the designs generated, 1 6 n 6 N. A key difficulty of this method is that the time needed to generate a MI-sequential design in the highdimension case is very larg. To address this issue a particular implementation, which calculates the determinant of a given matrix by partitioning it into blocks. This implementation allows a significant reduction of the computational cost of MI-sequential designs, has been proposed