146 resultados para trapdoor permutations


Relevância:

10.00% 10.00%

Publicador:

Resumo:

Ce mémoire se penche sur l’évolution des stratégies d’autoreprésentation et d’autofictionnalisation dans cinq solos de Marie Brassard entre 2000 et 2011 – Jimmy, créature de rêve, La noirceur, Peepshow, L’invisible et Moi qui me parle à moi-même dans le futur. L’objectif de cette étude est d’analyser comment les masques vocaux contribuent au dévoilement de soi et produisent de ce fait un sentiment d’intimité malgré l’alternance des effets d’identification et de distanciation qu’ils suscitent. Le premier chapitre montre que, par l’ouverture du moi sur le monde au fil des créations, les protagonistes parviennent bientôt à dire « je » sans avoir la consistance d’un personnage, alors que le moi de l’archiénonciatrice se dilate grâce à la perméabilité et aux permutations continuelles des thèmes, des motifs et des personnages. Le second chapitre analyse le décloisonnement spatial qui affecte la scène et la salle comme la performeuse et ses collaborateurs dans l’établissement d’un véritable dialogisme. À partir de l’étude du corps en scène, le dernier chapitre examine les effets du décloisonnement textuel et spatial, et montre que la mise en évidence du triple rôle endossé par Brassard – auteure, actrice et agenceure scénique – oblige à reconsidérer la nature du corps qui s’offre au regard durant la représentation, en invitant le spectateur à s’investir dans le jeu scénique au-delà des évidences.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In natural languages with a high degree of word-order freedom syntactic phenomena like dependencies (subordinations) or valencies do not depend on the word-order (or on the individual positions of the individual words). This means that some permutations of sentences of these languages are in some (important) sense syntactically equivalent. Here we study this phenomenon in a formal way. Various types of j-monotonicity for restarting automata can serve as parameters for the degree of word-order freedom and for the complexity of word-order in sentences (languages). Here we combine two types of parameters on computations of restarting automata: 1. the degree of j-monotonicity, and 2. the number of rewrites per cycle. We study these notions formally in order to obtain an adequate tool for modelling and comparing formal descriptions of (natural) languages with different degrees of word-order freedom and word-order complexity.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Free-word order languages have long posed significant problems for standard parsing algorithms. This thesis presents an implemented parser, based on Government-Binding (GB) theory, for a particular free-word order language, Warlpiri, an aboriginal language of central Australia. The words in a sentence of a free-word order language may swap about relatively freely with little effect on meaning: the permutations of a sentence mean essentially the same thing. It is assumed that this similarity in meaning is directly reflected in the syntax. The parser presented here properly processes free word order because it assigns the same syntactic structure to the permutations of a single sentence. The parser also handles fixed word order, as well as other phenomena. On the view presented here, there is no such thing as a "configurational" or "non-configurational" language. Rather, there is a spectrum of languages that are more or less ordered. The operation of this parsing system is quite different in character from that of more traditional rule-based parsing systems, e.g., context-free parsers. In this system, parsing is carried out via the construction of two different structures, one encoding precedence information and one encoding hierarchical information. This bipartite representation is the key to handling both free- and fixed-order phenomena. This thesis first presents an overview of the portion of Warlpiri that can be parsed. Following this is a description of the linguistic theory on which the parser is based. The chapter after that describes the representations and algorithms of the parser. In conclusion, the parser is compared to related work. The appendix contains a substantial list of test cases ??th grammatical and ungrammatical ??at the parser has actually processed.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

When triangulating a belief network we aim to obtain a junction tree of minimum state space. Searching for the optimal triangulation can be cast as a search over all the permutations of the network's vaeriables. Our approach is to embed the discrete set of permutations in a convex continuous domain D. By suitably extending the cost function over D and solving the continous nonlinear optimization task we hope to obtain a good triangulation with respect to the aformentioned cost. In this paper we introduce an upper bound to the total junction tree weight as the cost function. The appropriatedness of this choice is discussed and explored by simulations. Then we present two ways of embedding the new objective function into continuous domains and show that they perform well compared to the best known heuristic.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in PDF

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in LaTex

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in LaTex. Diagrams for the questions are all together in the support.zip file, as .eps files

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exercises and solutions in PDF

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exercises and solutions in LaTex

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exercises and solutions in PDF

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in PDF

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in PDF

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exercises and solutions in LaTex

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Exam questions and solutions in LaTex

Relevância:

10.00% 10.00%

Publicador:

Resumo:

Genetic studies of autism spectrum conditions (ASC) have mostly focused on the "low functioning" severe clinical subgroup, treating it as a rare disorder. However, ASC is now thought to be relatively common ( approximately 1%), and representing one end of a quasi-normal distribution of autistic traits in the general population. Here we report a study of common genetic variation in candidate genes associated with autistic traits and Asperger syndrome (AS). We tested single nucleotide polymorphisms in 68 candidate genes in three functional groups (sex steroid synthesis/transport, neural connectivity, and social-emotional responsivity) in two experiments. These were (a) an association study of relevant behavioral traits (the Empathy Quotient (EQ), the Autism Spectrum Quotient (AQ)) in a population sample (n=349); and (b) a case-control association study on a sample of people with AS, a "high-functioning" subgroup of ASC (n=174). 27 genes showed a nominally significant association with autistic traits and/or ASC diagnosis. Of these, 19 genes showed nominally significant association with AQ/EQ. In the sex steroid group, this included ESR2 and CYP11B1. In the neural connectivity group, this included HOXA1, NTRK1, and NLGN4X. In the socio-responsivity behavior group, this included MAOB, AVPR1B, and WFS1. Fourteen genes showed nominally significant association with AS. In the sex steroid group, this included CYP17A1 and CYP19A1. In the socio-emotional behavior group, this included OXT. Six genes were nominally associated in both experiments, providing a partial replication. Eleven genes survived family wise error rate (FWER) correction using permutations across both experiments, which is greater than would be expected by chance. CYP11B1 and NTRK1 emerged as significantly associated genes in both experiments, after FWER correction (P<0.05). This is the first candidate-gene association study of AS and of autistic traits. The most promising candidate genes require independent replication and fine mapping.