No description available.

Os Xerente, autodenominados Akw, formam com os Xavante (autodenominados Aw), de Mato Grosso, o ramo central das sociedades de língua Jê e contam atualmente com uma população de quase 1.800 pessoas distribuídas em 33 aldeias, mantendo sua língua materna e seus cerimoniais mais importantes com vitalidade. O território Xerente composto pelas terras indígenas Xerente e Funil localiza-se no cerrado do Estado do Tocantins, na banda leste do rio Tocantins, 70 km ao norte da capital, Palmas. Desde a fundação do Estado do Tocantins, em 1989, seu território é foco das atenções regionais (e nacionais) devido a sua localização estratégica. Encontrase atualmente rodeado de projetos de desenvolvimento incentivados pelos governos federal e estadual, em parceria com a iniciativa privada, interessados na produção de grãos, principalmente da soja. Essa dissertação tem como objetivo central analisar as relações políticas travadas tanto entre as facções Xerente, como também suas alianças com distintos atores não-indígenas presentes no campo político das esferas local e regional. (Conselho Indigenista Missionário, Procuradoria da República, Governo do Estado, Prefeitura Municipal, Funai, Missão Batista, etc). Embora o foco seja as facções, a visão, as noções e as práticas políticas Xerente, a pesquisa abrange um universo muito maior de campos sociais que aquele circunscrito ao interior das terras indígenas. Os Xerente fazem política nesses campos ampliados, que incluem, entre outros planos, as políticas municipais e regionais, a constituição de associações indígenas, além do envolvimento de órgãos federais e organizações não governamentais de escopo nacional e internacional em diversos eventos que vêm ocorrendo nessa esfera local a partir da criação e consolidação do estado do Tocantins. / Abstract not available

The aim of this work is to investigate some algebraic and combinatorial aspects of group factorizations. The main contribution of this dissertation is a set of new results regarding factorization of groups, with emphasis on the nonabelian case. We introduce a novel technique for factorization of groups, the so-called free mappings, a powerful tool for factorization of a wide class of abelian and non-abelian groups. By applying a certain group action on the blocks of a factorization, a number of combinatorial and computational problems were noted and studied. In particular, we analyze the case of the group Aut(Zn) acting on blocks of factorization of Zn. We present new theoretical facts that reveal the numerical structure of the stabilizer of a set in Zn, under the action of Aut(Zn). New algorithms for finding the stabilizer of a set and checking whether two sets belong to the same orbit are proposed. / by Vladimir Bozovic. / Thesis (Ph.D.)--Florida Atlantic University, 2008. / Includes bibliography. / Electronic reproduction. Boca Raton, FL : 2008 Mode of access: World Wide Web.

The primary objects of study in this thesis are noncommutative surfaces; that is, noncommutative noetherian domains of GK dimension 2. Frequently these rings will also be singular, in the sense that they have infinite global dimension. Very little is known about singularities of noncommutative rings, particularly those which are not finite over their centre. In this thesis, we are able to give a precise description of the singularities of a few families of examples. In many examples, we lay the foundations of noncommutative singularity theory by giving a precise description of the singularities of the fundamental examples of noncommutative surfaces. We draw comparisons with the fundamental examples of commutative surface singularities, called Kleinian singularities, which arise from the action of a finite subgroup of SL(2; k) acting on a polynomial ring. The main tool we use to study the singularities of noncommutative surfaces is the singularity category, first introduced by Buchweitz in [Buc86]. This takes a (possibly noncommutative) ring R and produces a triangulated category Dsg(R) which provides a measure of "how singular" R is. Roughly speaking, the size of this category reflects how bad the singularity is; in particular, Dsg(R) is trivial if and only if R has finite global dimension. In [CBH98], Crawley-Boevey-Holland introduced a family of noncommutative rings which can be thought of as deformations of the coordinate ring of a Kleinian singularity. We give a precise description of the singularity categories of these deformations, and show that their singularities can be thought of as unions of (commutative) Kleinian singularities. In particular, our results show that deforming a singularity in this setting makes it no worse. Another family of noncommutative surfaces were introduced by Rogalski-Sierra-Stafford in [RSS15b]. The authors showed that these rings share a number of ring-theoretic properties with deformations of type A Kleinian singularities. We apply our techniques to show that the "least singular" example has an A1 singularity, and conjecture that other examples exhibit similar behaviour. In [CKWZ16a], Chan-Kirkman-Walton-Zhang gave a definition for a quantum version of Kleinian singularities. These require the data of a two-dimensional AS regular algebra A and a finite group G acting on A with trivial homological determinant. We extend a number of results in [CBH98] to the setting of quantum Kleinian singularities. More precisely, we show that one can construct deformations of the skew group rings A#G and the invariant rings AG, and then determine some of their ring-theoretic properties. These results allow us to give a precise description of the singularity categories of quantum Kleinian singularities, which often have very different behaviour to their non-quantum analogues.

Typescript (photocopy). / Digitized by Kansas Correctional Industries

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Architecture, 1981. / MICROFICHE COPY AVAILABLE IN ARCHIVES AND ROTCH. / Includes bibliographical references. / Jack Tworkov began painting in the 1920s and made his reputation later as an Abstract Expressionist working in a gestural style. At the age of sixty-five Tworkov put that reputation on the line by undergoing a radical transformation in style and, within a few years, emerged as one of the innovative geometric painters of the later 1960s and the 1970s. This dissertation focuses on works from 1955, when Tworkov began to paint wholly idiosyncratic canvases, to 1979, at which time he significantly changed his brushstroke, a stylistic element that functions as a thread throughout this period. Other binding concepts include a continuing attempt to reconcile painterliness and spontaneity with premeditated structure and the combination of choice and chance in generating new ideas and compositions . This dissertation attempts to provide a complete analysis of this specific portion of Tworkov's work, which has never been done, and to avail the reader of a significant collection of artist's statements drawn from a variety of sources including Tworkov's own diary notes, the art historical literature , and personal interviews with the author. The analysis of the works is contextual, within the frame work of Tworkov's career itself, and proceeds stylistically rather than chronologically, identifying, explaining, and pursuing trends in Tworkov's works over an extended period of time. Iconographic analyses are provided where most appropriate and where most illustrative Tworkov's relationship to other artists has been discussed. The work from 1955 to 1979 has been divided into three major segments: Transitional Works, including the Painterly Abstractions and the Fields; the Structural/Geometric Works, subdivided into early geometric canvases, further experiments with geometry, and the Bisections; and the System Works, including both the Knight Moves and the Three-Five-Eight series. / by Lois Fichner-Rathus. / Ph.D.

Due to its cheap, pervasive, and disposable nature, post-consumer plastic has no subjectivity in its relation to the consumer. My thesis project examines the material’s inherent destructive narrative and question its ability to have extrinsic value beyond the assumptions of trash. In my research, I found that humans instinctually seek to conserve and treat biotic material with care. This fact has become a catalyst for the works in this project, which aim to not only increase the material’s value through animate biomorphic transformation, but also counter our disposable tendencies. At the onset of this project, I was fixated solely on the physical potential of plastic, but in researching cultural narratives, I became more aware of the social significance that post-disposal plastic material holds. Artistic works by Mark Bradford and El Anatsui helped me understand the potential for re-inscribing new meaning into materials that have had a prior existence, and the art of Lynda Benglis and Tim Hawkinson inspired my technical application. From there, I applied the aesthetics of biomorphism, which resulted in a culminating piece that utilizes melted and deformed bubble wrap to evoke reptilian skin or a micro-biotic cell community.

I believe creativity can be a direct link to the soul, a space to have a conversation with the divine and I seek to explore this idea in my art. I also want to invite the observer to move through my work and explore the space contained within their own emotions and sensibilities, beyond boundaries, allowing the work to linger and sink in. Translating these ideas into the form of my works, following my intuition intelligently, involves an intensive process of many layers of paint and textures combined with thread. My work involves the intersections of spirituality and art making through the experience of meditation. Engaging in traditional painting methods with abstract formations and intertwining thread to symbolize body and mind. Exploring the invisible, which is something you cannot obtain like meditation and making it visible through human experience. Inspired by Maurice Merleau-Ponty theoretical thinking on placing consciousness as the source of knowledge. Painting is my meditation, it is a tool to connect, dissolve, and release. Thread is the link to my ancestral consciousness and femininity. My work creates a wild boundless space, welcoming all emotions and thoughts to manifest into gestural and abstract landscapes. There is no right or wrong way to experience the work, what matters most is the totality of presence and observation of the spaces in-between.

Raising ghosts examines the political and cultural climate in Australia in the mid-20th century, and proposes that e?migre? and migrant artists to a significant extent were the catalysts of change and progenitors of new forms of painting in the post-war years. It uncovers a largely hidden but fertile terrain in Australian modernism. / thesis (PhDVisualArts)--University of South Australia, 2000.

Le but de cette thèse est de présenter une analyse statique générique pour des programmes multitâche écrits en Java.<br />Les programmes multitâche exécutent plusieurs tâches en parallèle. Ces tâches communiquent implicitement par le biais de la mémoire partagée et elles se synchonisent sur des moniteurs (les primitives wait-notify, etc..). Il y a quelques années, les architectures avec double processeurs ont commencé à être disponibles sur le marché à petit prix. Aujourd'hui, presque tous les ordinateurs ont au moins deux noyaux, la tendance actuelle du marché étant de mettre de plus en plus de processeurs par puce. Cette révolution amène également de nouveaux défis en matière de programmation, car elle demande aux développeurs d'implanter des programmes multitâche. Le multitâche est supporté en natif par la plupart des langages de programmation courants, comme Java et C#.<br />Le but de l'analyse statique est de calculer des informations sur le comportement d'un programme, de manière conservative et automatique. Une application de l'analyse statique est le développement d'outils qui aident au débogage des programmes. Plusieurs méthodes d'analyse statique ont été proposées. Nous suivrons le cadre de l'interprétation abstraite, une théorie mathématique permettant de définir des approximations correctes de sémantiques de programmes. Cette méthode a déjà été utilisée pour un large spectre de langages de programmation.<br />L'idée fondamentale des analyseurs statiques génériques est de développer un outils qui puissent être interfacé avec différents domaines numériques et différentes propriétés. Pendant ces dernières années, beaucoup de travaux se sont attaqués à cet enjeu, et ils ont été appliqué avec succès pour déboguer des logiciels industriels. La force de ces analyseurs réside dans le fait qu'une grande partie de l'analyse peut être réutilisée pour vérifier plusieurs propriétés. L'utilisation de différents domaines numériques permet le développement d'analyses plus rapides mais moins précises, ou plus lentes mais plus précises.<br /><br />Dans cette thèse, nous présentons la conception d'un analyseur générique pour des programmes multitâche. Avant tout, nous définissons le modèle mémoire, appelé happens-before memory model. Puis, nous approximons ce modéle mémoire en une semantique calculable. Les modéles mémoire définissent les comportements autorisés pendant l'exé-cution d'un programme multitâche. Commençant par la définition (informelle) de ce modèle mémoire particulier, nous définissons une sémantique qui construit toutes les exécutions finies selon ce modèle mémoire. Une exécution d'un programme multitâche est décrite par une function qui associe les tâches à des séquences (ou traces) d'états. Nous montrons comment concevoir une sémantique abstraite calculable, et nous montrons formellement la correction des résultat de cette analyse.<br />Ensuite, nous définissons et approximons une nouvelle propriété qui porte sur les comportements non-déterministes causés par le multitâche, c'est à dire aux entrelacements arbitraires pendant l'exécution de differentes instructions de lecture. Avant tout, le non déterminisme d'un programme multitâche se définit par une différence entre plusieurs exécutions. Si deux exécutions engendrent des comportements différents dus au valeurs qui sont lues ou écrites en mémoire partagée, alors le programme est non déterministe. Nous approximons cette propriété en deux étapes: dans un premier temps, nous regroupons, pour chaque tâche, la valeur (abstraite) qui peut être écrite dans la mémoire partagée à un point de programme donné. Dans un deuxième temps, nous résumons toutes les valeurs pouvant être écrites en parallèle, tout en nous rapellant l'ensemble des tâches qui pourraient les avoir écrites. à un premier niveau d'approximation, nous introduisons un nouveau concept de déterminisme faible. Nous proposons par ailleurs d'autres manière affaiblir la propriété de déterminisme, par exemple par projection des traces et des états, puis nous définissons une hierarchie globale de ces affaiblissements. Nous étudions aussi comment la présence de conflit sur les accès des données peut affecter le déterminisme du programme.<br />Nous appliquons ce cadre de travail théorique à Java. En particulier, nous définissons une sémantique du language objet de Java, selon sa spécification. Ensuite, nous approximons cette sémantique afin de garder uniquement l'information qui est nécessaire pour l'analyse des programmes multitâche. Le cœur de cette abstraction est une analyse d'alias qui approxime les références afin d'identifier les tâches, de vérifier les accès en mémoire partagée, et de détecter quand deux tâches ont un moniteur commun afin d'en déduire quelles parties du code ne peuvent pas être éxécutées en parallèle.<br />L'analyseur générique qui est décrit ci-dessus a été entierement implanté, dans un outils appelé Checkmate. Checkmate est ainsi le premier analyseur générique pour des programmes multitâche écrits en Java. Des résultats expérimentaux sont donnés et analysés en détails. En particulier, nous étudions la précision de l'analyse lorsqu'elle est appliquée à des schémas courants de la programmation concurrente, ainsi qu'à d'autres exemples. Nous observons également les performances de l'analyse lorsqu'elle est appliquée à une application incrémentale, ainsi qu'à des exemples de références bien connus.<br />Une autre contribution de cette thèse est l'extension d'un analyseur générique existant qui s'appelle Clousot et qui permet de vérifier le non débordement des mémoires tampons. Il s'avère que cette analyse passe à l'échelle des programmes industriels et qu'elle est précise. En résumé, nous présentons une application d'un analyseur statique générique industriel existant pour détecter et prouver une propriété présentant un intérêt pratique, ce qui montre la puissance de cette approche dans le développement d'outils qui soient utiles pour les développeurs.