Studiens syfte var att undersöka hur elever med avkodningssvårigheter påverkades av en intervention med läslistor ställt mot tidigare interventioner och traditionell läsundervisning. Interventionen innefattade elever i avkodningssvårigheter som lästränade vid 4 tillfällen under 28 veckor á 20 minuter per gång med läslistor från BRAVKOD metoden. Studien syftade även till att undersöka hur elevernas avkodning utvecklades beroende på ålder. Därför har elever från både låg och mellanstadiet deltagit i interventionen. Studien lades upp efter klassisk experimentell design med både interventionsgrupper och jämförelsegrupper i båda stadierna. Grupperna har omfattat 30 elever från lågstadiet och 21 elever från mellanstadiet. Vidare har även elevernas motivation och föräldrarnas upplevelse varit ett syfte att undersöka närmre. Studien genomfördes som en intervention med före och eftertest, en intervju med elever i interventionsgrupperna och lärare samt enkätundersökning hos vårdnadshavare. Testresultaten behandlades kvantitativt medan intervjuer fick ge studien ett kvalitativt komplement till testresultat och enkätsvar. Interventionsgrupperna i båda stadier visar en tydlig förbättring i avkodning i alla tester jämfört med jämförelsegrupperna. Detta visar på att interventionen med läslistor har en positiv utveckling på elevernas avkodningsförmåga. I intervjuer framkom även att eleverna överlag var motiverade till att lästräna med metoden. Endast någon enstaka elev var motvillig till detta.

One might easily argue that the Classification of Finite Simple Groups is one of the most important theorems of group theory. Given that any finite group can be deconstructed into its simple composition factors, it is of great importance to have a detailed knowledge of the structure of finite simple groups. One of the classes of finite groups that appear in the classification theorem are the simple classical groups, which are matrix groups preserving some form. This thesis will shed some new light on almost simple classical groups in dimension 13, 14 and 15. In particular we will determine their maximal subgroups. We will build on the results by Bray, Holt, and Roney-Dougal who calculated the maximal subgroups of all almost simple finite classical groups in dimension less than 12. Furthermore, Aschbacher proved that the maximal subgroups of almost simple classical groups lie in nine classes. The maximal subgroups in the first eight classes, i.e. the subgroups of geometric type, were determined by Kleidman and Liebeck for dimension greater than 13. Therefore this thesis concentrates on the ninth class of Aschbacher's Theorem. This class roughly consists of subgroups which are almost simple modulo scalars and do not preserve a geometric structure. As our final result we will give tables containing all maximal subgroups of almost simple classical groups in dimension 13, 14 and 15.

Recent attempts to reprogram a Roomba to be used as a simple agent have led to interesting behavior. Observation has shown that the behavior of the Roomba is not only dependent on the precepts of the Roomba, but also relies heavily on the uncontrollable environmental conditions that the Roomba is placed in. Ultimately this makes the Roomba a great platform to test and teach aspects of artificial intelligence. This paper will show how most of the tested environmental conditions are mitigated by a learning agent that will adjust behavior dependent on the precepts that are received.

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

The aim of the thesis was to investigate the usage of PSO algorithm in the area of cryptanalysis. We applied PSO to the problem of simple substitution and to DES attack. By a modified version of PSO algorithm we achieved better or comparable results as by the usage of other biologically motivated algorithms. We suggested a method how to use PSO to attack DES and we were able to break it with the knowledge of only 20 plain texts and corresponding cipher texts. We have analyzed the reasons of failure to break more than a 4 rounds of DES and provided explanation for it. At the end we described the basic principles of differential cryptanalysis for DES and presented a specific mo- dification of PSO for searching optimal differential characteristics for DES. For simple ciphers, PSO is working efficiently but for sophisticated ciphers like DES, without in- corporating deep internal knowledge about the process into the algorithm, we could not expect significant outcomes. 1

Ce travail traite du problème métaphysique de la composition. Ce problème peut être compris comme un ensemble de questions touchant à l'existence et à la nature des entités complexes et simples. Existe-t-il des entités complexes? Si oui, de quelle nature sont-elles? Comment sont-elles composées? Par quoi sont-elles composées (par des simples ou non)? Nous allons dans un premier temps analyser le paradigme russellien concernant le problème de la composition, à savoir l'atomisme logique. Cette analyse va nous amener à comprendre la façon dont l'outil logique (ici la logique russellienne) peut nous permettre de déterminer une ontologie (l'ontologie des faits) dans laquelle ces différentes questions trouvent des réponses déterminées. Puis nous aborderons le traitement contemporain de cette question qui se base sur la question spéciale de la composition (SCQ) développée par Peter van Inwagen dans Material Beings, et sur l'analyse méréologique. Nous allons alors aborder les différentes théories de la composition et nous allons essayer de justifier l'une d'entre-elles : l'universalisme de la composition. Cette justification nous amènera à développer et justifier une conception des simples (la théorie du Gunk), du temps (le quadridimensionnalisme), et une ontologie de l'étoffe matérielle. Nous achèverons notre travail en essayant de montrer que l'universalisme de la composition prend un sens particulier à l'intérieur des théories du monisme de priorité et du super-substantialisme. / This work deals with the metaphysical problem of composition. This problem can be understood as a set of questions relating to the existence and nature of simple and complex entities. Are there complex entities? What kind are they? How are they made? What are they made of (simples or not)? We will initially analyze the Russellian paradigm for the problem of composition, namely logical atomism. This analysis will lead us to understand how the tool logic (logic Russell here) can help us determine an ontology (ontology of facts) in which these questions are answered. Then we discuss the contemporary treatment of this question wich is based on the special composition question (SCQ) developed by Peter van Inwagen in Material Beings, and the mereological analysis. We then discuss the different theories of composition and we will try to justify one of them: the universalism of composition. This explanation leads us to develop and justify a conception of simples (the gunk theory), time (quadridimensionalism), and a stuff ontology. We will complete our work by trying to show that the universalism of composition makes sense within particular theories : priority monism and supersubstantivalism.

Au cours de sa vie, 1 femme sur 9 sera atteinte du cancer du sein, 1 sur 27 sera emportée par cette maladie et 10 à 15 % des patientes développeront des métastases dans les trois années suivant le diagnostic. Le diagnostic précis et personnalisé du cancer du sein ainsi que l'évaluation de son potentiel métastatique est donc un enjeu majeur. Une analyse plus précise des caractéristiques moléculaires d'une tumeur primaire devrait conduire à une médecine personnalisée, un traitement et un suivi plus efficace. La détection de biomarqueurs sériques serait un moyen de diagnostiquer un cancer métastatique. Dans le but de découvrir de nouveaux marqueurs, l'analyse protéomique d'échantillons de patient a un fort potentiel mais souffre de limitations techniques, incluant le manque d'anticorps stables reconnaissant des marqueurs tumoraux d'intérêt. Par l'utilisation de fragments d'anticorps aux propriétés remarquables nommé single domain antibody (sdAb), et grâce à la mise au point d'une stratégie innovante de phages display, ce travail apporte d'importantes réponses en termes de disponibilité d'anticorps, d'analyse spécifique d'échantillon et de découverte de nouvelles cibles. Nous avons élaboré une stratégie permettant la découverte de biomarqueurs et l'isolement des anticorps correspondants. Après la construction de banques de sdAb à partir de lamas immunisés par des biopsies, une nouvelles stratégie de sélection in vitro par phage display, la sélection masquée, nous a permis d'isoler des anticorps spécifiques du cancer du sein. / In a lifetime, 1 in 9 women will develop breast cancer, 1 of 27 will be swept away by the disease and from 10 to 15% of patients will develop metastases within three years of diagnosis. Accurate and personalized diagnosis of breast cancer and the detection of its metastatic potential is a major challenge. It is essential to develop new analytical methods allowing an effective monitoring of breast cancer. A closer analysis of the molecular characteristics of a primary tumor should lead to more effective personalized medicine, treatment and monitoring. The efficient detection of serum biomarkers would be a way to diagnose metastatic cancer and to modify treatment based on these results. Toward this goal, the proteomic analysis of patient samples has great potential but suffers from technical limitations, including the lack of a wide variety of antibodies and tumor marker. By the use of innovative antibody fragments with remarkable properties named single domain antibody (sdAb), and through the development of a new innovative strategy of phage display, this work provides important answers in terms of availability of antibody, specific proteomic analysis of sample and new target discovery. We have developed a strategy allowing the simultaneous discovery of new biomarkers and the isolation of corresponding antibodies. After the construction of sdAb libraries from llamas immunized with biopsies, and using a new in vitro selection strategy by phage display named masked selection, we have isolated breast cancer-specific antibodies.

Approved for public release; distribution is unlimited / Simple Network Management Protocol (SNMP) allows users of network equipment (i.e. Network Administrators) to remotely query the state of any device being tested for system load, utilization and configuration. Windows NT, Windows 2000 and Windows XP Professional are all equipped with SNMP service so that an SNMP manager can communicate with an SNMP agent running on a wireless 802.11b client. However the rest of Windows operating systems, including Windows CE and a Pocket PC, have to run third party proxy SNMP agents in order to be recognized by an SNMP management application. This thesis describes an implementation of a Pocket PC SNMP agent for two Pocket PC mobile devices accessing a wired network via an 802.11b wireless link. As a result of the implementation performed in this thesis, an SNMP manager can wirelessly communicate with a Pocket PC client. However, other results found that only some of the commercially available SNMP managers are able to access the mobile SNMP client and its management information base, due to incompatible implementations of the server and client software. / Lieutenant, Royal Thai Air Force

Les génomes de bactériophages ont une capacité remarquable d’évolution. L’objectif de ma thèse a été d’étudier le rôle des recombinases de bactériophages dans cette évolution. Notre hypothèse était que les recombinases phagiques diffèrent de la recombinase bactérienne RecA par une fidélité relâchée lors de la réaction de recherche d’homologie, qui pourrait expliquer en partie la très grande plasticité des génomes de bactériophages. Nous avons tout d’abord utilisé une approche bioinformatique basée sur la recherche d’homologies lointaines pour prédire un maximum de gènes de recombinases dans les génomes entièrement séquencés, puis nous avons confirmé l’activité de recombinaison de certaines d’entre elles, par un test d’appariement d’ADN simple brin entre séquences identiques in vivo. Ceci nous a permis de conclure qu’il existait trois superfamilles de recombinases chez les bactériophages, de type Rad52, Rad51/RecA et Gp2.5, présentes dans 42% des 465 génomes analysés. Dans un deuxième temps, nous avons comparé six de ces recombinases à RecA et avons montré que toutes étaient capables de faire de l’appariement simple brin in vivo, contrairement à RecA. Pour deux d’entre elles, Redβ de Lambda (type Rad52) et Sak4 de HK620 (type Rad51/RecA), nous avons observé que l’appariement simple brin continuait à se produire, avec une efficacité diminuée, jusqu’à 13% de divergence entre les séquences. L’appariement d’ADN simple brin est donc une propriété commune aux recombinases de bactériophages qui les distingue de RecA, et semble pouvoir se maintenir pour un niveau élevé de divergence, ce qui soutient l’hypothèse d’une recombinaison homologue différente et plus relâchée dans sa fidélité chez les bactériophages. / Bacteriophage genomes have a remarkable ability to evolve. The aim of my thesis was to study the role of bacteriophage recombinases in this evolution. Our hypothesis was that such recombinases differ from the bacterial RecA recombinase by a relaxed fidelity during homology search, which may partly explain the high plasticity of bacteriophage genomes. We first used a bioinformatics approach based on remote homology search to predict a maximum of recombinase genes in completely sequenced genomes, and confirmed the recombination activity of some of them by a single-strand DNA annealing assay between identical sequences in vivo. This allowed us to conclude that there were three superfamilies of bacteriophage recombinases, Rad52-like, Rad51/RecA-like and Gp2.5-like, which were present in 42% of the 465 genomes analyzed. In a second step, we compared six of these recombinases to RecA and showed that all were able to anneal single-stranded DNA in vivo, in contrast to RecA. For two of them, Redβ of Lambda (Rad52-like) and Sak4 of HK620 (Rad51/RecAlike), we also observed that they were able to anneal non identical (13% of divergence) single-stranded DNA, with a reduced efficiency. We conclude that the single-stranded DNA annealing is a property common to recombinases of bacteriophages, which is absent in RecA, and seems to tolerate diverged sequences. This supports the hypothesis of a different and more relaxed recombination in bacteriophages.

[pt] Os cinco grupos de Mathieu, M24;M23;M22;M12 e M11, compõem a primeira família de grupos esporádicos do Teorema de classificacão dos grupos simples finitos. Neste trabalho apresentaremos os grupos de Mathieu e alguns objetos relacionados a construcão deles como o Código de Golay e o Sistema de Steiner. Também, no decorrer do texto, surgiram espontaneamente alguns subgrupos dos grupos de Mathieu. / [en] The five Mathieu groups, M24;M23;M22;M12 and M11, form the first family of sporadic groups of Theorem classification of finite simple groups. In this paper we present the Mathieu groups and some objects related to building them as the Golay code and the Steiner system. Also, throughout the text, arose spontaneously some subgroups of groups of Mathieu.