Étude de l’orientation cardinale sud dans les sépultures mayas de la Période Classique

Ce mémoire porte sur l’étude de l’orientation des sépultures mayas de la Période Classique (250 - 900/1000 de notre ère). Il s’agit d’une recherche visant à comprendre le choix d’une orientation sud des défunts dans la vallée du Belize et ses environs. L’intérêt porté à cette région vient du fait que l’orientation sud des défunts est un phénomène que l’on retrouve rarement sur le territoire maya, sauf à cet endroit. Alors que la présence de la cardinalité en lien avec la cosmovision maya est attestée dans l’architecture, le plan des sites, la forme et la fonction des divinités, dans l’agriculture, etc., il est plutôt rare qu’elle soit analysée dans les études du traitement funéraire. Ainsi, le but de cette recherche est de saisir l’ampleur de la pratique de l’orientation sud des défunts sur le territoire maya, de comprendre son origine et sa ou ses possible(s) signification(s). Les données des sépultures de la Période Classique de cinq sites de la vallée du Belize (Baking Pot, Barton Ramie, Blackman Eddy, Cahal Pech et Xunantunich), de quatre sites du Plateau Vaca (Minanha, Pacbitun, Mountain Cow et Caracol) et de trois sites situés à l’ouest (Holmul) et au nord (San José et Altun Ha) de ces deux régions sont compilées. Les résultats révèlent que le coeur de cette pratique se trouve dans la vallée du Belize, bien qu’une orientation sud des défunts ait été retrouvée partout. Cette pratique semble apparaitre à la fin de la Période Préclassique et les analyses ne révèlent pas de lien entre l’orientation sud et certaines variables (âge, sexe, position du défunt). Finalement, on arrive à la conclusion qu’il est possible que cette orientation sud des défunts soit en lien avec le passage des défunts dans l’inframonde et que cela forme un choix culturel local en lien avec le statut et l’identité du défunt.

Essays on the Analysis of Dynamic Games

Thesis (Ph.D.)--University of Washington, 2016-06

Optimization and Machine Learning Frameworks for Complex Network Analysis

Thesis (Ph.D.)--University of Washington, 2016-06

Identifiability and definiteness in Chinese

This article explores how the pragmatic notion of identfiability is encoded in Chinese. It presents a detailed analysis of the distinctive linguistic devices, including lexical, morphological, and position in sentence, which are employed in Chinese to indicate the interpretation of referents in respect of identifiability. Of the major determiners in Chinese, demonstratives are developing uses of a definite article, and yi 'one' + classier has developed uses of an indefinite article, although morphologically and in some cases also functionally they have not yet been fully grammaticalized. What makes Chinese further different from languages like English is the interpretation in this regard of what are called indeterminate lexical encodings, which include bare NPs and cardinality expressions. They by themselves are neutral in respect of the interpretation of identifiability. For indeterminate expressions, there is a strong but seldom absolute correlation between the interpretation of identiability or nonidentfiability and their occurrence in different positions in a sentence. Unlike the cases with several other languages without articles like Czech, Hindi, and Indonesian, the features of definiteness and indefiniteness cannot be obligatorily and uniquely specified for nominal expressions in Chinese. The findings in this article lead to the conclusion that definiteness as a grammatical category defined in the narrow sense has not been fully developed in Chinese.

Quality of service in flexible workflows through process constraints

Workflow technology has delivered effectively for a large class of business processes, providing the requisite control and monitoring functions. At the same time, this technology has been the target of much criticism due to its limited ability to cope with dynamically changing business conditions which require business processes to be adapted frequently, and/or its limited ability to model business processes which cannot be entirely predefined. Requirements indicate the need for generic solutions where a balance between process control and flexibility may be achieved. In this paper we present a framework that allows the workflow to execute on the basis of a partially specified model where the full specification of the model is made at runtime, and may be unique to each instance. This framework is based on the notion of process constraints. Where as process constraints may be specified for any aspect of the workflow, such as structural, temporal, etc. our focus in this paper is on a constraint which allows dynamic selection of activities for inclusion in a given instance. We call these cardinality constraints, and this paper will discuss their specification and validation requirements.

Near-ML detection for MDL-impaired few-mode fiber transmission

Few-mode fiber transmission systems are typically impaired by mode-dependent loss (MDL). In an MDL-impaired link, maximum-likelihood (ML) detection yields a significant advantage in system performance compared to linear equalizers, such as zero-forcing and minimum-mean square error equalizers. However, the computational effort of the ML detection increases exponentially with the number of modes and the cardinality of the constellation. We present two methods that allow for near-ML performance without being afflicted with the enormous computational complexity of ML detection: improved reduced-search ML detection and sphere decoding. Both algorithms are tested regarding their performance and computational complexity in simulations of three and six spatial modes with QPSK and 16QAM constellations.

On Multiple Deletion Codes

In 1965 Levenshtein introduced the deletion correcting codes and found an asymptotically optimal family of 1-deletion correcting codes. During the years there has been a little or no research on t-deletion correcting codes for larger values of t. In this paper, we consider the problem of finding the maximal cardinality L2(n;t) of a binary t-deletion correcting code of length n. We construct an infinite family of binary t-deletion correcting codes. By computer search, we construct t-deletion codes for t = 2;3;4;5 with lengths n ≤ 30. Some of these codes improve on earlier results by Hirschberg-Fereira and Swart-Fereira. Finally, we prove a recursive upper bound on L2(n;t) which is asymptotically worse than the best known bounds, but gives better estimates for small values of n.

CAPS in Z(2,n)

We consider point sets in (Z^2,n) where no three points are on a line – also called caps or arcs. For the determination of caps with maximum cardinality and complete caps with minimum cardinality we provide integer linear programming formulations and identify some values for small n.

On Typical Compact Convex Sets in Hilbert Spaces

Let E be an infinite dimensional separable space and for e ∈ E and X a nonempty compact convex subset of E, let qX(e) be the metric antiprojection of e on X. Let n ≥ 2 be an arbitrary integer. It is shown that for a typical (in the sence of the Baire category) compact convex set X ⊂ E the metric antiprojection qX(e) has cardinality at least n for every e in a dense subset of E.

New Upper Bounds for Some Spherical Codes

The maximal cardinality of a code W on the unit sphere in n dimensions with (x, y) ≤ s whenever x, y ∈ W, x 6= y, is denoted by A(n, s). We use two methods for obtaining new upper bounds on A(n, s) for some values of n and s. We find new linear programming bounds by suitable polynomials of degrees which are higher than the degrees of the previously known good polynomials due to Levenshtein [11, 12]. Also we investigate the possibilities for attaining the Levenshtein bounds [11, 12]. In such cases we find the distance distributions of the corresponding feasible maximal spherical codes. Usually this leads to a contradiction showing that such codes do not exist.

Finding the Relationship between a Search Algorithm and a Class of Functions on Discrete Space by Exhaustive Search

* The work is supported by RFBR, grant 04-01-00858-a.

Formalization of Structural Constraints of Relationships in Model „Entity-Relationship”

The basic conceptions of the model „entity-relationship” as entities, relationships, structural constraints of the relationships (index cardinality, participation degree, and structural constraints of kind (min, max)) are considered and formalized in terms of relations theory. For the binary relations two operators (min and max) are introduced; structural constraints are determined in terms of the operators; the main theorem about compatibility of these operators’ values on the source relation and inversion to it is given here.

Fundamental Investigations on the Unit Groups of Commutative Group Algebras in Bulgaria

In this paper we give the first investigations and also some basic results on the unit groups of commutative group algebras in Bulgaria. These investigations continue some classical results. Namely, it is supposed that the cardinality of the starting group is arbitrary.

Solving Maximum Clique Problem for Protein Structure Similarity

Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum weighted clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper we present both a new integer programming formulation for solving such clique problems and a dedicated branch and bound algorithm for solving the maximum cardinality clique problem. Both approaches have been integrated in VAST, a software for aligning protein 3D structures largely used in the National Center for Biotechnology Information, an original clique solver which uses the well known Bron and Kerbosch algorithm (BK). Our computational results on real protein alignment instances show that our branch and bound algorithm is up to 116 times faster than BK.

Dickson Polynomials that are Permutations

2000 Mathematics Subject Classification: 11T06, 13P10.