Master of Fine Arts thesis by Alexandra Thiesson

No description available.

El cáncer de cuello uterino es el séptimo cáncer más frecuente en la población general y el segundo más común entre las mujeres de todo el mundo. Numerosos estudios epidemiológicos y moleculares han establecido al Virus del Papiloma Humano (VPH) como el principal factor etiológico del cáncer cervical. Sin embargo, dada la alta prevalencia de la infección por VPH en la población general respecto de la incidencia del carcinoma cervical, se presume que la sola infección por este virus sería insuficiente para provocar la transformación neoplásica. Las diferencias genéticas del hospedador que influyan en la respuesta contra la infección viral podrían determinar un mayor riesgo de desarrollo de lesiones cervicales y progresión hacia un carcinoma invasor. De esta manera, los polimorfismos genéticos presentes en genes relacionados a la infección viral, a la respuesta inmune, a los sistemas de reparación del ADN y aquellos genes supresores de tumores, podrían influenciar y determinar un riesgo aumentado de desarrollo de la neoplasia cervical. El objetivo del presente trabajo fue determinar el efecto del componente genético en relación a la susceptibilidad de desarrollo de cáncer cervical y la infección por el Virus del Papiloma Humano. Se analizaron un total de 512 muestras cervicales de mujeres de la ciudad de La Plata, las cuales fueron clasificadas histológicamente en: 200 muestras de mucosa cervical normal (PapI/II), 100 Lesiones Intraepiteliales de Bajo Grado (LGSIL), 72 Lesiones Intraepiteliales de Alto Grado (HGSIL) y 140 muestras correspondientes a Carcinomas Cervicales Escamosos (SCC). La presencia de ADN del VPH fue examinada mediante PCR anidada y la genotipificación del virus por PCR-SSCP y PCR-EIA. La genotipificación de los Polimorfismos de Nucleótido Simple (SNPs) presentes en los genes FASL (-844 T/C), IL10 (-1082 G/A), p53 (Arg72Pro), INFG (+ 874 T/A) y RNASEL (Arg462Gln) se llevó a cabo mediante la tecnología de Pirosecuenciación, mientras que el análisis de los SNPs Arg399Gln y Arg194Trp de XRCC1, -308 (G/A) y -238 (G/A) de TNF-α y -670 del gen FAS se realizó utilizando la técnica de PCR-RFLP. La prevalencia de la infección por VPH en el grupo control fue del 36,5%. El tipo viral más prevalente fue el VPH-16 (51,2%). Del total de los controles, el 29,3% correspondió a mujeres mayores a 30 años infectadas con VPH-16 y/o VPH-18. Los polimorfismos presentes en las regiones promotoras de los genes TNF-α (-308 (G/A) y -238 (G/A)), IL-10 (-1082 (G/A)) y FASL (-844 (T/C)), así como el SNP + 874 (T/A) del gen Interferon gamma, no presentaron diferencias entre casos y controles. De manera similar, no hubo asociación entre dichos polimorfismos y la presencia del ADN del VPH. Sin embargo, se registró un incremento significativo en el riesgo de desarrollo de cáncer cervical otorgado por los genotipos homocigota AA del gen FAS (OR=2,25; p=0,035), heterocigota CG del gen p53 (OR=2,43; p=0,004) y el genotipo TT+TC del gen XRCC1 codon 194 (OR=2,26; p=0,02). Por otra parte, los genotipos homocigota AA de RNASEL (OR=0,31; p=0,034) y heterocigota AG de XRCC1 codon 399 (OR=0, 48; p=0,023) otorgaron una menor susceptibilidad frente al desarrollo de la neoplasia cervical. En el caso del gen FAS, el genotipo homocigota AA (OR=2,53; p=0,035) se encontró asociado con un incremento en la susceptibilidad a la infección por VPH. En cuanto a las lesiones cervicales, se observó que tanto el alelo Gln (A) (OR=3,03; p=0,001) como el genotipo homocigota Gln/Gln (AA) (OR=5,34; p=0,000) de XRCCI Arg399Gln otorgaron un incremento significativo en el riesgo de desarrollo de lesiones de bajo grado (LSIL). Por el contrario, el genotipo heterocigota Gln/Arg (AG) de este mismo polimorfismo estuvo asociado con una disminución en el riesgo de desarrollo de este tipo de lesiones (OR=0, 25; p=0,009). Por último, el análisis de los polimorfismos a través del algoritmo MDR reveló que existe una interacción sinérgica entre ellos, presentando el modelo de cuatro-factores (cuatro-loci), conformado por FASL-P53-RNASEL-XRCC1399, una asociación significativa con la neoplasia cervical (TA=0,61; p<0,05). De acuerdo a los resultados obtenidos se observa que la asociación encontrada entre los Polimorfismos de Nucleótido Simple y el carcinoma cervical apoya el rol de la susceptibilidad genética del hospedador en la etiología de esta enfermedad. En base a esto se sugiere que la utilización de estos polimorfismos podría resultar muy conveniente en la identificación de aquellos individuos que se encuentran con mayor riesgo de desarrollo de lesiones cervicales y progresión hacia un carcinoma invasor.

Let F be a finite field of q elements and G be a primitive group on a finite set . Then there is a G-action on , namely a map G ! , (g; !) 7! !g = g!; satisfying !gg0 = (gg0)! = g(g0!) for all g; g0 2 G and all ! 2 , and that !1 = 1! = ! for all ! 2 : Let F = ff j f : ! Fg, be the vector space over F with basis . Extending the G-action on linearly, F becomes an FG-module called an FG- permutation module. We are interested in finding all G-invariant FG-submodules, i.e., codes in F . The elements f 2 F are written in the form f = P !2 a! ! where ! is a characteristic function. The natural action of an element g 2 G is given by g P !2 a! ! = P !2 a! g(!): This action of G preserves the natural bilinear form defined by * X a! !; X b! ! + = X a!b!: In this thesis a program is proposed on how to determine codes with given primitive permutation group. The approach is modular representation theoretic and based on a study of maximal submodules of permutation modules F defined by the action of a finite group G on G-sets = G=Gx. This approach provides the advantage of an explicit basis for the code. There appear slightly different concepts of (linear) codes in the literature. Following Knapp and Schmid [83] a code over some finite field F will be a triple (V; ; F), where V = F is a free FG-module of finite rank with basis and a submodule C. By convention we call C a code having ambient space V and ambient basis . F is the alphabet of the code C, the degree n of V its length, and C is an [n; k]-code if C is a free module of dimension k. In this thesis we have surveyed some known methods of constructing codes from primitive permutation representations of finite groups. Generally, our program is more inclusive than these methods as the codes obtained using our approach include the codes obtained using these other methods. The designs obtained by other authors (see for example [40]) are found using our method, and these are in general defined by the support of the codewords of given weight in the codes. Moreover, this method allows for a geometric interpretation of many classes of codewords, and helps establish links with other combinatorial structures, such as designs and graphs. To illustrate the program we determine all 2-modular codes that admit the two known non-isomorphic simple linear groups of order 20160, namely L3(4) and L4(2) = A8. In the process we enumerate and classify all codes preserved by such groups, and provide the lattice of submodules for the corresponding permutation modules. It turns out that there are no self-orthogonal or self-dual codes invariant under these groups, and also that the automorphism groups of their respective codes are in most cases not the prescribed groups. We make use of the Assmus Matson Theorem and the Mac Williams identities in the study of the dual codes. We observe that in all cases the sets of several classes of non-trivial codewords are stabilized by maximal subgroups of the automorphism groups of the codes. The study of the codes invariant under the simple linear group L4(2) leads as a by-product to a unique flag-transitive, point primitive symmetric 2-(64; 28; 12) design preserved by the affi ne group of type 26:S6(2). This has consequently prompted the study of binary codes from the row span of the adjacency matrices of a class of 46 non-isomorphic symmetric 2-(64; 28; 12) designs invariant under the Frobenius group of order 21. Codes obtained from the orbit matrices of these designs have also been studied. The thesis concludes with a discussion of codes that are left invariant by the simple symplectic group S6(2) in all its 2-modular primitive permutation representations. / Thesis (Ph.D.)-University of KwaZulu-Natal, Westville, 2012.

Thesis (Ph. D.)--State University of New York at Binghamton, Computer Science Department, 2006. / Includes bibliographical references.

Thesis (M.Sc.) - Carleton University, 2002. / Includes bibliographical references (p. 40-43). Also available in electronic format on the Internet.

Texte remanié de: Habilitationsschrift--Universität Erlangen/Nürnberg, 1963. / Contient la transcription musicale des danses (pp. 157-279). Bibliogr. p. 281-285. Index.

abstract: In 1999, Geneviève Hasenohr announced the discovery of a fragment of Marguerite Porete's Mirouer des Simples Ames, a work condemned by the Church at the University of Paris in 1310, hidden in a manuscript at the Bibliothèque municipale in Valenciennes. The fragment corresponds with roughly two chapters in the only extant French version of the manuscript (Chantilly, Musée Condé MS F XIV 26), and when compared with other editions of the Mirouer, it appears to be composed in what might have been Marguerite Porete's native dialect. The discovery changed scholars' perceptions of the weight of the various versions and translations - the Chantilly manuscript had been used previously to settle any questions of discrepancy, but now it appears that the Continental Latin and Middle English translations should be the arbiters. This discovery has elevated the Middle English editions, and has made the question of the translator's identity - he is known only by his initials M.N. - and background more imperative to an understanding of why a work with such a dubious history would be translated and harbored by English Carthusians in the century that followed its condemnation. The only candidate suggested for translator of the Mirouer has been Michael Northburgh (d. 1361), the Bishop of London and co-founder of the London Charterhouse, where two of the three remaining copies of the translation were once owned, but the language of the text and Northburgh's own position and interests do not fit this suggestion. My argument is that the content of the book, the method of its translation, its selection as a work for a Latin-illiterate audience, all fit within the interests of a circle of writers based in Yorkshire at the end of the fourteenth century. By beginning among the Yorkshire circle, and widening the search to include writers with a non-traditional contemplative audience, one that exists outside of the cloister - writers like Walter Hilton, the anonymous authors of the Cloud of Unknowing and the Chastising of God's Children, and Nicholas Love - we may have a better chance of locating and understanding the motives of the Middle English translator of the Mirouer. / Dissertation/Thesis / Ph.D. English 2011

The Simple View of Reading is a well-known lens for understanding the skills that contribute to proficient reading. The Simple View explains reading comprehension as the product of decoding and listening comprehension. There is a gap in the literature regarding the applicability of the Simple View for Spanish-speaking English language learners, and also whether oral reading fluency would be valuable to include in the model as an intermediate variable. In the present study two groups of third grade students, one group comprised of students classified as English language learners and a comparison group of non-ELL students, were assessed on several reading skills. Data were collected on listening comprehension, decoding, oral reading fluency, and reading comprehension. Data were analyzed using generalized least squares estimation for path analysis and partial invariance testing. Findings support the inclusion of oral reading fluency in the Simple View model, highlight the significance of listening comprehension, and suggest the Simple View model applies equally well across ELL and non-ELL groups. Limitations and future directions are addressed.

Ao tentar agendar uma atividade que dependa da presença de outras pessoas, geralmente acabamos desperdiçando tempo precioso avaliando os possíveis horários e verificando se os mesmos são aceitos por todos envolvidos. Embora a modelagem e a resolução do problema de agendamento multiagente pareçam estar completamente entendidas e ainda diversos algoritmos possam ser encontrados na literatura, uma questão ainda existe: Como definir horários compatíveis para uma atividade compartilhada sem que os usuários tenham que manualmente escolher horários livres de seus calendários até que todos envolvidos aceitem um horário. A principal contribuição é um algoritmo chamado Descobridor Asíncrono de Horários (ATF) baseado no Rastreamento Asíncrono (ABT) que permite que aplicações encontrem horários compatíveis para atividades compartilhadas requerendo mínima intervenção manual dos usuários. Esta dissertação revisita o Problema Temporal Simples (STP) e a sua versão multiagente (MaSTP), demonstra como eles podem ser utilizados para resolver o problema de agentamentos e ao final apresenta o ATF, a avaliação experimental e a análise de complexidade. / In order to schedule an activity that depends on other people, we very often end up wasting precious time trying to find compatible times and evaluating if they are accepted by all involved. Even though modeling and solving multiagent scheduling problems seem completely understood and several algorithms can be found in the literature, one limitation still stands up: How to find a compatible time slot for an activity shared by many users without requiring the users themselves to spend time going through their calendar and choosing time slots until everybody agrees. The main contribution of this work is an algorithm called Asynchronous Time Finder (ATF) based on the Asynchronous Backtracking (ABT) that enables applications to find compatible times when scheduling shared activities among several users while requiring minimal user interaction. This dissertation starts by revisiting the Simple Temporal Problem (STP) and its multiagent version (MaSTP), it then shows how they can be used to solve the problem of managing agendas and then finally it presents the ATF giving an experimental evaluation and the analysis of its complexity.