Cette étude présente une nouvelle approche pour la génération automatique de résumés, un des principaux défis du Traitement de la Langue Naturelle. Ce sujet, traité pendant un demi-siècle par la recherche, reste encore actuel car personne n'a encore réussi à créer automatiquement des résumés comparables, en qualité, avec ceux produits par des humains. C'est dans ce contexte que la recherche en résumé automatique s'est divisée en deux grandes catégories : le résumé par extraction et le résumé par abstraction. Dans le premier, les phrases sont triées de façon à ce que les meilleures conforment le résumé final. Or, les phrases sélectionnées pour le résumé portent souvent des informations secondaires, une analyse plus fine s'avère nécessaire.Nous proposons une méthode de compression automatique de phrases basée sur l'élimination des fragments à l'intérieur de celles-ci. À partir d'un corpus annoté, nous avons créé un modèle linéaire pour prédire la suppression de ces fragments en fonction de caractéristiques simples. Notre méthode prend en compte trois principes : celui de la pertinence du contenu, l'informativité ; celui de la qualité du contenu, la grammaticalité, et la longueur, le taux de compression. Pour mesurer l'informativité des fragments,nous utilisons une technique inspirée de la physique statistique : l'énergie textuelle.Quant à la grammaticalité, nous proposons d'utiliser des modèles de langage probabilistes.La méthode proposée est capable de générer des résumés corrects en espagnol.Les résultats de cette étude soulèvent divers aspects intéressants vis-à- vis du résumé de textes par compression de phrases. On a observé qu'en général il y a un haut degré de subjectivité de la tâche. Il n'y a pas de compression optimale unique mais plusieurs compressions correctes possibles. Nous considérons donc que les résultats de cette étude ouvrent la discussion par rapport à la subjectivité de l'informativité et son influence pour le résumé automatique.

Nesta tese, argumenta-se que as inscrições são a interface a partir da qual é possível considerar metodologicamente a condição de observadores na visualização do conhecimento. Para isso, considera-se os limites dos sistemas formais, a crise da representação e o modelo da Máquina de Turing como afirmações da condição encarnada do conhecer. Nesse contexto, a noção de informação mostra-se indício de uma transição paradigmática entre um modelo de conhecimento representacional, no qual a posição de um observador frente às representações não entra na configuração analisada, e um modelo sistêmico, que exige a consideração de diferentes níveis de organização e suas limitações que emergem da autorreferência. Propõe-se a noção superfície de inscrição para abordar a relação entre operatividades mecânicas, como a encontrada nos computadores, e o domínio consensual da linguagem que permite explicar um mundo entendido como realidade. Essa noção é forjada como um artifício teóricometodológico para evitar, em contextos educativos e de pesquisa, a reificação de uma posição frente aos quadros explicativos que reforça dicotomias tipo natureza-cultura e deslegitima o potencial enunciativo de qualquer ser humano. O artifício é proposto em três campos de análise e legibilidade: o campo das condições técnicas das superfícies; a estabilização de uma posição de observação diante das superfícies de inscrição; e o contexto político do uso de tais superfícies para compartilhar e explicar. / On this thesis, we discuss that the inscriptions are the interface from which it is possible to consider the conditions of observers methodologically on the knowledge visualization; therefore, we consider the formal systems limits, the representation crisis, and the Turing Machine Model as affirmations of the embodied condition of knowledge. In this context, the notion of information proves to be an indicative of a paradigmatic shift from a representational model of knowledge, in which the position of an observer in the face of representations does not infer the configuration that was analyzed, and a systemic model, which demands consideration of different levels of organization and its limitations that emerge from self-reference. We propose the notion of inscription surface to tackle the relation of different kinds of mechanical operability, as the one found in computers, and the consensual domain of language that helps one to explain a world perceived as reality. This notion is forged as a theoretic-methodological stratagem to avoid, in educational and research contexts, the reification of a position related to the explanatory frameworks that reinforces dichotomies such as nature-culture and delegitimizes the enunciative potential of any humanbeing. The stratagem is proposed in three fields of analysis and readability: the field of technical conditions of the surfaces; a position of observation stabilization on the inscription surfaces, and the political context of the use of such surfaces to share and explain.

Nesta tese, argumenta-se que as inscrições são a interface a partir da qual é possível considerar metodologicamente a condição de observadores na visualização do conhecimento. Para isso, considera-se os limites dos sistemas formais, a crise da representação e o modelo da Máquina de Turing como afirmações da condição encarnada do conhecer. Nesse contexto, a noção de informação mostra-se indício de uma transição paradigmática entre um modelo de conhecimento representacional, no qual a posição de um observador frente às representações não entra na configuração analisada, e um modelo sistêmico, que exige a consideração de diferentes níveis de organização e suas limitações que emergem da autorreferência. Propõe-se a noção superfície de inscrição para abordar a relação entre operatividades mecânicas, como a encontrada nos computadores, e o domínio consensual da linguagem que permite explicar um mundo entendido como realidade. Essa noção é forjada como um artifício teóricometodológico para evitar, em contextos educativos e de pesquisa, a reificação de uma posição frente aos quadros explicativos que reforça dicotomias tipo natureza-cultura e deslegitima o potencial enunciativo de qualquer ser humano. O artifício é proposto em três campos de análise e legibilidade: o campo das condições técnicas das superfícies; a estabilização de uma posição de observação diante das superfícies de inscrição; e o contexto político do uso de tais superfícies para compartilhar e explicar. / On this thesis, we discuss that the inscriptions are the interface from which it is possible to consider the conditions of observers methodologically on the knowledge visualization; therefore, we consider the formal systems limits, the representation crisis, and the Turing Machine Model as affirmations of the embodied condition of knowledge. In this context, the notion of information proves to be an indicative of a paradigmatic shift from a representational model of knowledge, in which the position of an observer in the face of representations does not infer the configuration that was analyzed, and a systemic model, which demands consideration of different levels of organization and its limitations that emerge from self-reference. We propose the notion of inscription surface to tackle the relation of different kinds of mechanical operability, as the one found in computers, and the consensual domain of language that helps one to explain a world perceived as reality. This notion is forged as a theoretic-methodological stratagem to avoid, in educational and research contexts, the reification of a position related to the explanatory frameworks that reinforces dichotomies such as nature-culture and delegitimizes the enunciative potential of any humanbeing. The stratagem is proposed in three fields of analysis and readability: the field of technical conditions of the surfaces; a position of observation stabilization on the inscription surfaces, and the political context of the use of such surfaces to share and explain.

Nesta tese, argumenta-se que as inscrições são a interface a partir da qual é possível considerar metodologicamente a condição de observadores na visualização do conhecimento. Para isso, considera-se os limites dos sistemas formais, a crise da representação e o modelo da Máquina de Turing como afirmações da condição encarnada do conhecer. Nesse contexto, a noção de informação mostra-se indício de uma transição paradigmática entre um modelo de conhecimento representacional, no qual a posição de um observador frente às representações não entra na configuração analisada, e um modelo sistêmico, que exige a consideração de diferentes níveis de organização e suas limitações que emergem da autorreferência. Propõe-se a noção superfície de inscrição para abordar a relação entre operatividades mecânicas, como a encontrada nos computadores, e o domínio consensual da linguagem que permite explicar um mundo entendido como realidade. Essa noção é forjada como um artifício teóricometodológico para evitar, em contextos educativos e de pesquisa, a reificação de uma posição frente aos quadros explicativos que reforça dicotomias tipo natureza-cultura e deslegitima o potencial enunciativo de qualquer ser humano. O artifício é proposto em três campos de análise e legibilidade: o campo das condições técnicas das superfícies; a estabilização de uma posição de observação diante das superfícies de inscrição; e o contexto político do uso de tais superfícies para compartilhar e explicar. / On this thesis, we discuss that the inscriptions are the interface from which it is possible to consider the conditions of observers methodologically on the knowledge visualization; therefore, we consider the formal systems limits, the representation crisis, and the Turing Machine Model as affirmations of the embodied condition of knowledge. In this context, the notion of information proves to be an indicative of a paradigmatic shift from a representational model of knowledge, in which the position of an observer in the face of representations does not infer the configuration that was analyzed, and a systemic model, which demands consideration of different levels of organization and its limitations that emerge from self-reference. We propose the notion of inscription surface to tackle the relation of different kinds of mechanical operability, as the one found in computers, and the consensual domain of language that helps one to explain a world perceived as reality. This notion is forged as a theoretic-methodological stratagem to avoid, in educational and research contexts, the reification of a position related to the explanatory frameworks that reinforces dichotomies such as nature-culture and delegitimizes the enunciative potential of any humanbeing. The stratagem is proposed in three fields of analysis and readability: the field of technical conditions of the surfaces; a position of observation stabilization on the inscription surfaces, and the political context of the use of such surfaces to share and explain.

Prof. W.H. Steeb

In this thesis, the theory related to Turing machines and means of their description (with focus on composite diagrams) is presented. The aim of this work is to create an application that allows editing Turing machines described by means of composite diagrams and simulating their computation on specified input configuration (including non-deterministic and multi-tape machines). Furthermore, within the application it will be possible to run the termination analysis of Turing machine in order to determine whether this machine or any of its parts always halt. The resulting application is implemented in Java and the termination analysis is performed using the well-founded orders. And so, one of the results created during this work is a software tool which allows designing and testing of Turing machines described by means of composite diagrams. Resulting application may be used especially during lectures on theoretical computer science, where it can be used to demonstrate computation of some Turing machine.

This document defines systems of pushdown transducers. The idea of cooperating distributed grammar systems for components working on one word is adjusted for use of transducers instead of grammars. The transducers cooperate by passing output of one to input of another component. It discusses their descriptive power and equivalency between systems with arbitrary numbers of components. The main conclusion is then comparison of their descriptive power with Turing machines with regard to their translation and accepted languages.

This report describes a study aimed at verifying a cyber security modeling language named the Predictive, Probabilistic Cyber Security Modelling Language. This modeling language together with the Enterprise Architecture Analysis Tool acts as a tool for cyber security evaluations of system architectures. To verify the accuracy and readiness of the tool, a generic model of a real life Supervisory Control And Data Acquisition System’s system architecture was modeled using the tool and later evaluated. The evaluation process consisted of a Turing test, which was the same method used for evaluation of the Predictive, Probabilistic Cyber Security Modelling Language predecessor the Cyber Security Modelling Language. For the Turing test, interviews were held with five domain experts within cyber security. Four of which were tasked with creating attack paths given a scenario in the modeled system architecture. The Predictive, Probabilistic Cyber Security Modelling Language was given the same task as the four experts. The attack paths created were consolidated in a standardized form for the last internal company expert within cyber security to evaluate. An expert evaluator was tasked with grading the attack paths produced by the four experts and the Predictive, Probabilistic Cyber Security Modelling Language. The grading was based on how probable the attack paths were perceived by the internal expert.  The conclusion was made that given the limitations of the study, the Predictive, Probabilistic Cyber Security Modelling Language produced a cyber security evaluation that was as probable as those created by the human cyber security experts. The results produced were also consistent with the results produced by the Predictive, Probabilistic Cyber Security Modelling Language predecessor the Cyber Security Modelling Language in a previous study. Suggestions for further studies were also introduced which could complement this study and further strengthen the results. This thesis was a collaboration between ABB Enterprise Software and the members of the team behind the Predictive, Probabilistic Cyber Security Modelling Language at ICS at KTH. / Denna rapport beskriver en studie vars mål var att verifiera ett modelleringsspråk för datasäkerhet vid namn Predictive, Probabilistic Cyber Security Modelling Language. Detta modelleringsspråk tillsammans med Enterprise Architecture Analysis Tool utgör ett verktyg för datasäkerhetsutvärderingar av systemarkitekturer. För att verifiera exaktheten och mognadsnivån på verktyget så skapades en generisk modell av ett verkligt Supervisory Control And Data Acquisition System-systems arkitektur. Denna modell utvärderades i ett senare skede. Utvärderingsprocessen bestod av ett Turingtest, som är samma metod som användes i en tidigare utvärdering av Predictive, Probabilistic Cyber Security Modelling Languages föregångare Cyber Security Modelling Language. För Turingtestet hölls fem intervjuer med domänexperter inom datasäkerhet. Fyra av dessa fick i uppgift att skapa attackvägar givet ett scenario i den modellerade systemarkitekturen. Attackvägarna som skapades sammanställdes i ett standardiserat formulär för den sista interna företagsexperten inom datasäkerhet att utvärdera. En expertutvärderare fick i uppgift att betygsätta de attackvägar som hade producerats av de fyra experterna och Predictive, Probabilistic Cyber Security Modelling Language. Betygsättningen baserades på hur sannolika de olika attackvägarna uppfattades av den interna experten. Slutsatsen som gjordes var att givet begränsningarna i studien, så producerade Predictive, Probabilistic Cyber Security Modelling Language en datasäkerhetsutvärdering som var likvärdigt sannolik jämfört med de som skapades av mänskliga experter. Resultaten som producerades var också konsistenta med resultaten som producerades av Predictive, Probabilistic Cyber Security Modelling Language föregångare Cyber Security Modelling Language i en tidigare studie. Förslag på kommande studier som skulle komplettera denna studie och stärka resultaten ytterligare introducerades också. Detta examensarbete var ett samarbete mellan ABB Enterprise Software och medlemmarna i teamet bakom Predictive, Probabilistic Cyber Security Modelling Language på ICS på KTH.

Many biological populations reside in increasingly fragmented landscapes, which arise from human activities and natural causes. Landscape characteristics may change abruptly in space and create sharp transitions (interfaces) in landscape quality. How patchy landscape affects ecosystem diversity and stability depends, among other things, on how individuals move through the landscape. Individuals adjust their movement behaviour to local habitat quality and show preferences for some habitat types over others. In this dissertation, we focus on how landscape composition and the movement behaviour at an interface between habitat patches of different quality affects the steady states of a single species and a predator-prey system. First, we consider a model for population dynamics in a habitat consisting of two homogeneous one-dimensional patches in a coupled ecological reaction-diffusion equation. Several recent publications by other authors explored how individual movement behaviour affects population-level dynamics in a framework of reaction-diffusion systems that are coupled through discontinuous boundary conditions. The movement between patches is incorporated into the interface conditions. While most of those works are based on linear analysis, we study positive steady states of the nonlinear equations. We establish the existence, uniqueness and global asymptotic stability of the steady state, and we classify their qualitative shape depending on movement behaviour. We clarify the role of nonrandom movement in this context, and we apply our analysis to a previous result where it was shown that a randomly diffusing population in a continuously varying habitat can exceed the carrying capacity at steady state. In particular, we apply our results to study the question of why and under which conditions the total population abundance at steady state may exceed the total carrying capacity of the landscape. Secondly, we model population dynamics with a predator-prey system in a coupled ecological reaction-diffusion equation in a heterogeneous landscape to study Turing patterns that emerge from diffusion-driven instability (DDI). We derive the DDI conditions, which consist of necessary and sufficient conditions for initiation of spatial patterns in a one-dimensional homogeneous landscape. We use a finite difference scheme method to numerically explore the general conditions using the May model, and we present numerical simulations to illustrate our results. Then we extend our studies on Turing-pattern formation by considering a predator-prey system on an infinite patchy periodic landscape. The movement between patches is incorporated into the interface conditions that link the reaction-diffusion equations between patches. We use a homogenization technique to obtain an analytically tractable approximate model and determine Turing-pattern formation conditions. We use numerical simulations to present our results from this approximation method for this model. With this tool, we then explore how differential movement and habitat preference of both species in this model (prey and predator) affect DDI.

The material taught in a Formal Languages course is mathematical in nature and requires students to practice proofs and algorithms to understand the content. Traditional Formal Languages textbooks are heavy on prose, and homework typically consists of solving many paper exercises. Some instructors make use of finite state machine simulators like the JFLAP package. JFLAP helps students by allowing them to build models and apply various algorithms on these models, which improves student interaction with the studied material. However, students still need to read a significant amount of text and practice problems by hand to achieve understanding. Inspired by the principles of the Programmed Instruction (PI) teaching method, we seek to develop a new Formal Languages eTextbook capable of conveying these concepts more intuitively. The PI approach has students read a little, ideally a sentence or a paragraph, and then answer a question or complete an exercise related to that information. Based on the question response, students can continue to other information frames or retry to solve the exercise. Our goal is to present all algorithms using algorithm visualizations and produce proficiency exercises to let students demonstrate understanding. To evaluate the pedagogical effectiveness of our new eTextbook, we conduct time and performance evaluations across two offerings of the course CS4114 Formal Languages and Automata. In time evaluation, the time spent by students looking at instructional content with text and visualizations versus with PI frames is compared to determine levels of student engagement. In performance evaluation, students grades are compared to assess learning gains with text and paper exercises only, with text, visualizations with exercises, and with PI frames. / Doctor of Philosophy / Theory textbooks in computer science are hard to read and understand. Traditionally, instructors use books that are heavy on mathematical prose and paper exercises. Sometimes, instructors use simulators to allow students to create, simulate, and test models. Previously, we found that students tend to skip reading the text presented in the books. This leads to less understanding of the topics taught in the course. To increase student engagement, we developed a new eTextbook for the Formal Languages course. We used pedagogy based on Programmed Instruction, presenting the content in the form of short bits of prose followed by the related question. If students can solve the question correctly, this means that they understood the content and are ready to move forward. To help both instructors and students, we developed a new Formal Languages simulator named OpenFLAP. OpenFLAP allows instructors to create many exercises, and OpenFLAP can grade these exercises automatically.