I detta arbete använder jag rewriting som metod för att stärka fyra egenskrivna låtar. Under rewritingsessionerna har jag identifierat problemområden i låtarna och kunnat ersätta detta låtmaterial med nytt material. Det nya materialet är skapat i enighet med erkända låtskrivartekniker och teorier, samt egen personlig preferens. Arbetet resulterade i fyra omskrivna låtar som enligt mig lyckades med sitt syfte om att lyftas. En kortare demoproduktion per låt gjordes sedan för att ge ett utkast till framtida produktion.

Software is becoming a pervasive presence in our lives, powering computing systems in the home, in businesses, and in safety-critical settings. In response, languages are being defined with support for new domains and complex computational abstractions. The need for formal techniques to help better understand the languages we use, correctly design new language abstractions, and reason about the behavior and correctness of programs is now more urgent then ever. In this dissertation we focus on research in programming language semantics and program analysis, aimed at building and reasoning about programming languages and applications. In language semantics, we first show how to use formal techniques during language design, presenting definitional techniques for object-oriented languages with concurrency features, including the Beta language and a paradigmatic language called KOOL. Since reuse is important, we then present a module system for K, a formalism for language definition that takes advantage of the strengths of rewriting logic and term rewriting techniques. Although currently specific to K, parts of this module system are also aimed at other formalisms, with the goal of providing a reuse mechanism for different forms of modular semantics in the future. Finally, since performance is also important, we show techniques for improving the executable and analysis performance of rewriting logic semantics definitions, specifically focused on decisions around the representation of program values and configurations used in semantics definitions. The work on performance, with a discussion of analysis performance, provides a good bridge to the second major topic, program analysis. We present a new technique aimed at annotation-driven static analysis called policy frameworks. A policy framework consists of analysis domains, an analysis generic front-end, an analysis-generic abstract language semantics, and an abstract analysis semantics that defines the semantics of the domain and the annotation language. After illustrating the technique using SILF, a simple imperative language, we then describe a policy framework for C. To provide a real example of using this framework, we have defined a units of measurement policy for C. This policy allows both type and code annotations to be added to standard C programs, which are then used to generate modular analysis tasks checked using the CPF semantics in Maude.

Synthesis planning is a critical process in chemical design. A number of computer programs have been developed to assist the chemists with this procedure. Most of the programs utilize combinations of computational approaches. These have been successfully applied to a number of the synthesis predictions. However, they require numerous rules to screen for potential targets, as well as to keep the system from reaching the combinatorial explosion. This results in the advanced algorithms becoming more complex and parameter-sensitive. This can be problematic, particularly in the cases in which a large number of the compounds are to be handled, because it can not only result in a lengthy computational time, but also cause some of the highly potential targets to be missed. We developed a simpler approach for the reaction prediction using a term-rewriting grammar. The term-rewriting strategy is used to directly assign reactions to the compounds. This greatly reduces the number of rules that are usually required for these steps, and, hence, facilitates the prediction performance, while maintaining the prediction accuracy. In this dissertation, the designs of the developed algorithms and their results are first being presented, followed by a discussion of the approach’s application in the chemical design in the final chapter.

Circuit designers require Computer-Aided Design (CAD) tools when compiling designs into Field Programmable Gate Arrays (FPGAs) in order to achieve high quality results due to the complexity of the compilation tasks involved. Technology mapping is one critical step in the FPGA CAD flow. The final mapping result has significant impact on the subsequent steps of clustering, placement and routing, for the objectives of delay, area and power dissipation. While depth-optimal FPGA technology mapping can be solved in polynomial time, area minimization has proven to be NP-hard. Most modern state-of-the-art FPGA technology mappers are structural in nature; they are based on cut enumeration and use various heuristics to yield depth and area minimized solutions. However, the results produced by structural technology mappers rely strongly on the structure of the input netlists. Hence, it is common to apply additional heuristics after technology mapping to further optimize area and reduce the amount of structural bias while not harming depth. Recently, SAT-based Boolean matching has been used for post-mapping area minimization. However, SAT-based matching is computationally complex and too time consuming in practice. This thesis proposes an alternative Boolean matching approach based on NPN equivalence. Using a library of pre-computed topologies, the matching problem becomes as simple as performing NPN encoding followed by a hash lookup which is very efficient. In conjunction with Ashenhurst decomposition, the NPN-based Boolean matching is allowed to handle up to 10-input Boolean functions. When applied to a large set of designs, the proposed algorithm yields, on average, more than 3% reduction in circuit area without harming circuit depth. The priori generation of a library of topologies can be difficult; the potential difficulty in generating a library of topologies represents one limitation of the proposed algorithm.

Circuit designers require Computer-Aided Design (CAD) tools when compiling designs into Field Programmable Gate Arrays (FPGAs) in order to achieve high quality results due to the complexity of the compilation tasks involved. Technology mapping is one critical step in the FPGA CAD flow. The final mapping result has significant impact on the subsequent steps of clustering, placement and routing, for the objectives of delay, area and power dissipation. While depth-optimal FPGA technology mapping can be solved in polynomial time, area minimization has proven to be NP-hard. Most modern state-of-the-art FPGA technology mappers are structural in nature; they are based on cut enumeration and use various heuristics to yield depth and area minimized solutions. However, the results produced by structural technology mappers rely strongly on the structure of the input netlists. Hence, it is common to apply additional heuristics after technology mapping to further optimize area and reduce the amount of structural bias while not harming depth. Recently, SAT-based Boolean matching has been used for post-mapping area minimization. However, SAT-based matching is computationally complex and too time consuming in practice. This thesis proposes an alternative Boolean matching approach based on NPN equivalence. Using a library of pre-computed topologies, the matching problem becomes as simple as performing NPN encoding followed by a hash lookup which is very efficient. In conjunction with Ashenhurst decomposition, the NPN-based Boolean matching is allowed to handle up to 10-input Boolean functions. When applied to a large set of designs, the proposed algorithm yields, on average, more than 3% reduction in circuit area without harming circuit depth. The priori generation of a library of topologies can be difficult; the potential difficulty in generating a library of topologies represents one limitation of the proposed algorithm.

Most of Peter Ackroyd&rsquo / s work takes place in London, and the city can be said to be a unifying element in his work. Even those of his novels that do not use London as a setting are about London and Londoners, in history and in the present. London, in Ackroyd&rsquo / s work, is represented by multiple points of view &ndash / firstly that of a historical personage and secondly of a researcher in the present day. Through the use of such a structure, Ackroyd parodies biography writing (by rewriting and distorting the life of a historical Londoner), and detective fiction (by making the contemporary researcher ineffectual and underqualified). These narratives, while being clearly separate and linear in themselves, focus on London, which acts as a bridge between the characters and themes in the separate centuries, culminating in their merge at the end. Thus, methods of rewriting in Ackroyd&rsquo / s work come together in the ulterior aim of rewriting the city of London. The main aim of this dissertation is to account for the various types of rewriting and parody that becomes evident in Ackroyd&rsquo / s fiction. In the light of the discussions on parody of detective fiction and biography in each chapter, this dissertation will attempt to view Ackroyd&rsquo / s fiction as a chronological metamorphosis of London itself, through rewriting its artists and their texts as productions of London.

No description available.

Thesis (M. Sc. - Carleton University, 2001. / Includes bibliographical references (p. 138-141). Also available in electronic format on the Internet.

Made available in DSpace on 2014-06-11T19:25:28Z (GMT). No. of bitstreams: 0 Previous issue date: 2002-12-20Bitstream added on 2014-06-13T20:08:09Z : No. of bitstreams: 1 goncalves_av_me_assis.pdf: 363757 bytes, checksum: 5ac5accebfed074f310860c4b0f37e2e (MD5) / Esta pesquisa investiga de que forma a concepção interacionista da linguagem pode facilitar a instauração da escrita de textos expositivo-argumentativos. Contrapondo tal concepção de linguagem às outras (linguagem como reflexo do pensamento e linguagem como instrumento de comunicação) e, a partir da definição de texto, segundo as mais recentes correntes de estudos da linguagem, o trabalho pretende evidenciar, através das categorias eleitas para análise, quais sejam, progressão e repetição, congruência, argumentação, desdobramento da linguagem monológica em dialógica e progressão, de que forma uma redação dissertativa deve se configurar quando tem o propósito de ser intersubjetiva. Num segundo momento de instauração de um exercício interacionista de escrita, o trabalho, mediante uma metodologia intitulada de correção interativa, pretende avaliar os benefícios ou não de tal prática. / This essay analyses in what ways the interectionist conception of the language can make easy the writing of argumentative-expositive texts contrasting this conception to the others (language as a reflex of the thought and language as an instrument of communication) and from this text definition, according to the latest tendencies of language studies of the language, the composition intends to show through the chosen categories for analyses, such as progression and repetition, congruence, argumentation, monologic language transposition into dialogic and progression, in what ways a argumentative-expositive composition must be configured, when objective be inter subjective. In a second moment it intends to evaluate the good or the bad points of this practice through the instauration of an interecionist writing exercise by means of a methodology entitled interactive correction.

Submitted by Aelson Maciera (aelsoncm@terra.com.br) on 2017-06-05T18:20:21Z No. of bitstreams: 1 DissERNC.pdf: 2100543 bytes, checksum: 7a25a7f704131f64f02ba2de8329f44b (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-06-05T18:28:47Z (GMT) No. of bitstreams: 1 DissERNC.pdf: 2100543 bytes, checksum: 7a25a7f704131f64f02ba2de8329f44b (MD5) / Approved for entry into archive by Ronildo Prado (ronisp@ufscar.br) on 2017-06-05T18:28:55Z (GMT) No. of bitstreams: 1 DissERNC.pdf: 2100543 bytes, checksum: 7a25a7f704131f64f02ba2de8329f44b (MD5) / Made available in DSpace on 2017-06-05T18:32:21Z (GMT). No. of bitstreams: 1 DissERNC.pdf: 2100543 bytes, checksum: 7a25a7f704131f64f02ba2de8329f44b (MD5) Previous issue date: 2017-03-15 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES) / This work aims to study two short stories by the writer Machado de Assis, taking in consideration their thematic approximation, leading one to believe that the second short story, "Uma senhora", from 1883, would be the rewrite of a previous short story, "O segredo de Augusta”, from 1868. In order to achieve this, the analysis take into consideration the leitmotiv of the vain woman and the figure of the narrator and in what way the narrator articulates the characters throughout the narrative. Thus, the author uses the theme of a previous short story, still marked by romantic characteristics and rewrite it, guaranteeing a formal improvement in the process of rewriting. / Este trabalho tem como objetivo o estudo de dois contos do escritor Machado de Assis tendo em vista sua aproximação temática, levando a crer que o segundo conto, “Uma senhora”, de 1883, seria a reescrita de “O segredo de Augusta”, conto escrito anos antes, em 1868. Para tal, as análises levam em consideração o leitmotiv da mulher vaidosa e a figura do narrador e de que maneira este articula as personagens ao longo da narrativa. Tem-se, desta maneira, que o autor aproveita o tema de um conto de juventude, ainda marcado por características românticas, para reescrevê-lo, garantindo assim um aperfeiçoamento formal no trabalho de reescrita.