La rapidité, la consommation énergétique et l'efficacité des systèmes logiciels et matériels sont devenues les préoccupations majeures de la communauté informatique de nos jours. Gérer de manière correcte et efficace les problématiques mémoire est essentiel pour le développement des programmes de grande tailles sur des architectures de plus en plus complexes. Dans ce contexte, cette thèse contribue aux domaines de l'analyse mémoire et de la compilation tant sur les aspects théoriques que sur les aspects pratiques et expérimentaux. Outre l'étude approfondie de l'état de l'art des analyses mémoire et des différentes limitations qu'elles montrent, notre contribution réside dans la conception et l'évaluation de nouvelles analyses qui remédient au manque de précision des techniques publiées et implémentées. Nous nous sommes principalement attachés à améliorer l'analyse de pointeurs appartenant à une même structure de données, afin de lever une des limitations majeures des compilateurs actuels. Nous développons nos analyses dans le cadre général de l'interprétation abstraite « non dense ». Ce choix est motivé par les aspects de correction et d'efficacité : deux critères requis pour une intégration facile dans un compilateur. La première analyse que nous concevons est basée sur l'analyse d'intervalles des variables entières ; elle utilise le fait que deux pointeurs définis à l'aide d'un même pointeur de base n'aliasent pas si les valeurs possibles des décalages sont disjointes. La seconde analyse que nous développons est inspirée du domaine abstrait des Pentagones ; elle génère des relations d'ordre strict entre des paires de pointeurs comparables. Enfin, nous combinons et enrichissons les deux analyses précédentes dans un cadre plus général. Ces analyses ont été implémentées dans le compilateur LLVM. Nous expérimentons et évaluons leurs performances, et les comparons aux implémentations disponibles selon deux métriques : le nombre de paires de pointeurs pour lesquelles nous inférons le non-aliasing et les optimisations rendues possibles par nos analyses / This thesis was motivated by the emergence of massively parallel processing and supercomputingthat tend to make computer programming extremely performing. Speedup, the power consump-tion, and the efficiency of both software and hardware are nowadays the main concerns of theinformation systems community. Handling memory in a correct and efficient way is a step towardless complex and more performing programs and architectures. This thesis falls into this contextand contributes to memory analysis and compilation fields in both theoretical and experimentalaspects.Besides the deep study of the current state-of-the-art of memory analyses and their limitations,our theoretical results stand in designing new algorithms to recover part of the imprecisionthat published techniques still show. Among the present limitations, we focus our research onthe pointer arithmetic to disambiguate pointers within the same data structure. We develop ouranalyses in the abstract interpretation framework. The key idea behind this choice is correctness,and scalability: two requisite criteria for analyses to be embedded to the compiler construction.The first alias analysis we design is based on the range lattice of integer variables. Given a pair ofpointers defined from a common base pointer, they are disjoint if their offsets cannot have valuesthat intersect at runtime. The second pointer analysis we develop is inspired from the Pentagonabstract domain. We conclude that two pointers do not alias whenever we are able to build astrict relation between them, valid at program points where the two variables are simultaneouslyalive. In a third algorithm we design, we combine both the first and second analysis, and enhancethem with a coarse grained but efficient analysis to deal with non related pointers.We implement these analyses on top of the LLVM compiler. We experiment and evaluate theirperformance based on two metrics: the number of disambiguated pairs of pointers compared tocommon analyses of the compiler, and the optimizations further enabled thanks to the extraprecision they introduce

Orientador: Denise Hortencia Lopes Garcia / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Artes / Made available in DSpace on 2018-08-12T15:11:52Z (GMT). No. of bitstreams: 1 Rampin_DantasNeves_M.pdf: 9209358 bytes, checksum: 374af3500d1f2a9923260762214a4c2a (MD5) Previous issue date: 2008 / Resumo: Esta pesquisa reflete a relação entre a música do compositor norte americano Morton Feldman e o grupo de pintores do Expressionismo Abstrato The New York School of Visual Arts - partindo da ótica do próprio compositor. Abordamos a maneira como Feldman trabalhou concepções advindas da pintura na composição técnica e estética em sua música. Para discorrer sobre este tema, a dissertação apresenta uma breve contextualização histórica da década de 50, do século passado, momento do encontro de Feldman com os pintores. Em seguida, apresentamos as concepções desenvolvidas por Feldman em sua música derivadas da pintura. Para tanto, apresentaremos análises que nos permitam compreender como estas concepções se concretizam musicalmente através da história notacional do compositor. Do ponto de vista metodológico a pesquisa se vale das declarações do próprio compositor, de pesquisas que abordam o trabalho composicional de Morton Feldman e da análise de obras. Priorizamos a análise da peça Crippled Symmetry, já que ela apresenta uma das notações mais originais produzidas por Feldman, o que nos inspirou a composição de Sombras Sobre o Encoberto 11, peça que apresentamos neste trabalho como resultado composicional desta pesquisa. Nas considerações finais, além do resultado de Sombras Sobre o Encoberto 11, discutimos como as concepções utilizadas por Feldman a partir da pintura pode ser amplamente explorada como base composicional singular. / Abstract: This research is about the relation between the music of the American composer Morton Feldman and the group of painters of Abstract Expressionism The New York School of Visual Arts - from the point of view of himself. It will focus the way Feldman developed concepts drawn from painting in the technique and aesthetics of his music. Thus the dissertation presents a historical account of the 1950s, when Feldman and the painters met. Then we present concepts Feldman drew from painting and developed in his music. We provide analyses which allow us to understand how such concepts work musically throughout Feldman's notational history. The method of this research is based on Feldman's statements, researches about his compositional work and the analysis of pieces. Crippled symmetry, whose notation is among the most original devised by Feldman, undergoes extensive analysis. It has also been the inspiration for the composition of our work Sombras sobre o Encoberto II, We present this piece as the compositional outcome of this research. In addition to this piece, the conclusion shows how the concepts Feldman drew from painting can be vastly explored as a unique basis for the composition of music. / Mestrado / Mestre em Música

O principal objetivo desta pesquisa consiste no estudo, desenvolvimento e aplicação de um conjunto de procedimentos metodológicos introdutórios para leitura e percepção da paisagem geográfica, direcionados ao ensino fundamental. Trata-se de uma proposta de articulação de conteúdos de Arte e Geografia baseada na noção de paisagem como texto não-verbal, cuja organização dos procedimentos de leitura recorre a subsídios da semiótica. Os conteúdos de Arte explorados nesta tese buscam identificar as transformações da noção polissêmica de paisagem, concentrando-se no abstracionismo informal e nas paisagens do pintor brasileiro Antônio Bandeira um dos principais representantes dessa tendência no Brasil a fim de possibilitar um processo alternativo de percepção estética da paisagem. Os conteúdos de Geografia alinham-se principalmente com as pesquisas recentes da Geografia Cultural, que após receberem múltiplas contribuições e influências, tais como da Antropologia, da História, da Filosofia fenomenológica e existencialista, concebe a paisagem como texto e como marca e matriz cultural, principais abordagens nas quais esta pesquisa inspirou-se. Após a reflexão teórica, foi realizado o experimento de uma parcela dos procedimentos metodológicos propostos, com alunos de 7ª série. Os resultados demonstraram que é possível uma mudança na percepção e leitura da paisagem geográfica, quando os modelos de paisagem também são modificados. Verificou-se: abandono da perspectiva e incorporação de vários pontos de vista numa mesma paisagem (visão horizontal, vertical e oblíqua); adição das sensações olfativas, auditivas e táteis; o consentimento da escala afetiva na representação dos elementos; possibilidade de vínculo com o aprendizado das representações cartográficas, dado o caráter abstrato das pinturas de paisagens contemporâneas; a leitura não-verbal como estímulo à expressão verbal; alto grau de interesse dos alunos não só pelos conteúdos desenvolvidos, mas principalmente pelas estratégias envolvendo arte e pintura a guache / The main objective of this research is the study, development and application of a set of introductory methodological procedures for the study and perception of geographical landscapes in elementary education. It is a proposal for the synchronization of the course content of Art and Geography based on the concept of the landscape as a non-verbal text, whose organization of study procedures relies on semiotic assistance. The Art-related content investigated in this thesis aims to identify transformations of the polyssemic notion of landscapes, focusing on informal abstractism and landscapes painted by the Brazilian painter Antônio Bandeira - one of the foremost examples of this tendency in Brazil - in order to create a feasible alternative process for the esthetic perception of landscapes. Geography content is mainly in accordance with recent research in Cultural Geography, which, upon receiving several contributions and influences, for example from Anthropology, History, and phenomenological and existentialist Philosophy, envisages a landscape as a text and a cultural mark and matrix. This approach was the main inspiration for this research. After theoretical reflection, an experiment was carried out involving a part of the proposed methodological procedures among 7th grade students. The results show that a change in perception and study of geographical landscapes is possible, when the landscape models are also modified. The abandonment of the perspective and incorporation of several points of view into a single landscape (horizontal, vertical and oblique view) was noted; addition of olfactory, audio and touch sensations; the contentment of an affective scale in the representation of elements; the possibility of a connection with the learning of map representations, given the abstract character of contemporary landscape paintings; the non-verbal study as a stimulus to verbal expression; a high-level of interest on the part of students not only in the content developed, but mainly in the strategies involving art and gouache painting

Orientador: Rafael Santos Mendes / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de Computação / Made available in DSpace on 2018-08-24T01:12:10Z (GMT). No. of bitstreams: 1 Candido_RenatoMarkeleFerreira_M.pdf: 1921815 bytes, checksum: a5e82ec1bfadd836b1ba66fda5ce00ec (MD5) Previous issue date: 2013 / Resumo: A principal contribuição desta dissertação é a proposta de algoritmos de filtragem por partículas em sistemas a eventos discretos nos quais predominam os problemas de sincronização. Esta classe de sistemas pode ser descrita por meio de equações lineares em uma álgebra não convencional usualmente conhecida como álgebra Max Plus. Os Filtros de Partículas são algoritmos Bayesianos sub-ótimos que realizam uma amostragem sequencial de Monte Carlo para construir uma aproximação discreta da densidade de probabilidade dos estados baseada em um conjunto de partículas com pesos associados. É apresentada uma revisão de sistemas a eventos discretos, de filtragem não linear e de filtros de partículas de um modo geral. Após apresentar esta base teórica, são propostos dois algoritmos de filtros de partículas aplicados a sistemas Max Plus. Em seguida algumas simulações foram apresentadas e os resultados apresentados mostraram a eficiência dos filtros desenvolvidos / Abstract: This thesis proposes, as its main contribution, particle filtering algorithms for discrete event systems in which synchronization phenomena are prevalent. This class of systems can be described by linear equation systems in a nonconventional algebra commonly known as Max Plus algebra. Particles Filters are suboptimal Bayesian algorithms that perform a sequential Monte Carlo sampling to construct a discrete approximation of the probability density of states based on a set of particles with associated weights. It is presented a review of discrete event systems, nonlinear filtering and particle filters. After presenting this theoretical background, two particle filtering algorithms applied to Max Plus systems are proposed. Finally some simulation results are presented, confirming the accuracy of the designed filters / Mestrado / Automação / Mestre em Engenharia Elétrica

A complete Java interface to OpenModelica has been created, supporting both standard Modelica and the metamodeling extensions in MetaModelica. It is bidirectional, and capable of passing both standard Modelica data types, as well as abstract syntax trees and list structures to and from Java and process them in either Java or the OpenModelica Compiler.It currently uses the existing CORBA interface as well as JNI for standard Modelica. It is also capable of automatically generating the Java classes corresponding to MetaModelica code.This interface opens up increased possibilities for tool integration between OpenModelica and Java-based tools, since for example models or model fragments can be extracted from OpenModelica, processed in a Java tool, and put back into the main model representation in OpenModelica. A first version text generation template language for MetaModelica is also presented. The goal for such a language is the ability to create a more concise and readablecode when translating an abstract syntax tree (AST) to text.

Context. Multiple studies demonstrate that most of the residential burglaries are committed by a few offenders. Statistics collected by the Swedish National Council for Crime Prevention show that the number of residential burglary varies from year to year. But this value normally increases. Besides, around half of all reported burglaries occur in big cities and only some burglaries occur in sparsely-populated areas. Thus, law enforcement agencies need to study possible linked residential burglaries for their investigations. Linking crime-reports is a difficult task and currently there is not a systematic way to do it. Objectives. This study presents an analysis of the different features of the collected residential burglaries by the law enforcement in Sweden. The objective is to study the possibility of linking crimes depending on these features. The characteristics used are residential features, modus operandi, victim features, goods stolen, difference of days and distance between crimes. Methods. To reach the objectives, quasi experiment and repeated measures are used. To obtain the distance between crimes, routes using Google maps are used. Different cluster methods are investigated in order to obtain the best cluster solution for linking residential burglaries. In addition, the study compares different algorithms in order to identify which algorithm offers the best performance in linking crimes. Results. Clustering quality is measured using different methods, Rule of Thumb, the Elbow method and Silhouette. To evaluate these measurements, ANOVA, Tukey and Fisher’s test are used. Silhouette presents the greatest quality level compared to other methods. Other clustering algorithms present similar average Silhouette width, and therefore, similar quality clustering. Results also show that distance, days and residential features are the most important features to link crimes. Conclusions. The clustering suggestion denotes that it is possible to reduce the amount of burglaries cases. This reduction is done by finding linked residential burglaries. Having done the clustering, the results have to be investigated by law enforcement.

In a real-time system, it is crucial to ensure that all tasks of the system holdtheir deadlines. A missed deadline in a real-time system means that the systemhas not been able to function correctly. If the system is safety critical, this canlead to disaster. To ensure that all tasks keep their deadlines, the Worst-CaseExecution Time (WCET) of these tasks has to be known. This can be done bymeasuring the execution times of a task, however, this is inflexible, time consumingand in general not safe (i.e., the worst-casemight not be found). Unlessthe task is measured with all possible input combinations and configurations,which is in most cases out of the question, there is no way to guarantee that thelongest measured time actually corresponds to the real worst case.Static analysis analyses a safe model of the hardware together with thesource or object code of a program to derive an estimate of theWCET. This estimateis guaranteed to be equal to or greater than the real WCET. This is doneby making calculations which in all steps make sure that the time is exactlyor conservatively estimated. In many cases, however, the execution time of atask or a program is highly dependent on the given input. Thus, the estimatedworst case may correspond to some input or configuration which is rarely (ornever) used in practice. For such systems, where execution time is highly inputdependent, a more accurate timing analysis which take input into considerationis desired.In this thesis we present a framework based on abstract interpretation andcounting of possible semantic states of a program. This is a general methodof WCET analysis, which is language independent and platform independent.The two main applications of this framework are a loop bound analysis and aparametric analysis. The loop bound analysis can be used to quickly find upperbounds for loops in a program while the parametric framework provides aninput-dependent estimation of theWCET. The input-dependent estimation cangive much more accurate estimates if the input is known at run-time. / PROGRESS

An unavoidable amount of money is spent on maintaining existing software systems today. Software maintenance cost generally higher than development cost of the system therefore lowering maintenance cost is highly appreciated in software industry. A significant part of maintenance activities is related to repeating the investigation of problems and applying repeated solutions several times. A software system may contain a common bug in several different places and it might take extra effort and time to fix all existences of this bug. This operation commonly increases the cost of Software Maintenance Activities. Detecting duplicate code fragments can significantly decrease the time and effort therefore the maintenance cost. Clone code detection can be achieved via analyzing the source code of given software system. An abstract syntax tree based clone detector for java systems is designed and implemented through this study. This master thesis examines a software engineering process to create an abstract syntax tree based clone detector for the projects implemented in Java programming language.

Today, universities rely heavily on systems for detecting plagiarism in students’essays and reports. Code submissions however require specific tools. A numberof approaches to finding plagiarisms in code have already been tried, includingtechniques based on comparing textual transformations of code, token strings,parse trees and graph representations. In this master’s thesis, a new system, cojac,is presented which combines textual, tree and graph techniques to detect a broadspectrum of plagiarism attempts. The system finds plagiarisms in C, C++ and Adasource files. This thesis discusses the method used for obtaining parse trees fromthe source code and the abstract syntax tree analysis. For comparison of syntaxtrees, we generate sets of fingerprints, digest forms of trees, which makes thecomparison algorithm more scalable. To evaluate the method, a set of benchmarkfiles have been constructed containing plagiarism scenarios which was analyzedboth by our system and Moss, another available system for plagiarism detection incode. The results show that our abstract syntax tree analysis can effectively detectplagiarisms such as changing the format of the code and renaming of identifiersand is at least as effective as Moss for detecting plagiarisms of these kinds

Det här är en systematisk litteraturstudie med inriktning mot skolans lägre åldrar. Studiens syfte är att undersöka vilka svårigheter eleverna möter när de arbetar med området bråk i matematiken. Vidare syftar den även till att synliggöra var i förflyttningen från ett konkret till ett abstrakt arbetssätt det är som svårigheterna främst uppstår. För att svara på studiens syfte och frågeställningar grundar sig studien i flertalet vetenskapliga publikationer. Resultatet av studien synliggör flertalet svårigheter eleverna möter, samt att det finns en variation angående var i förflyttelsen de uppstår. Utifrån resultatet är det främst i ett visst stadie svårigheterna uppstår, dock beskrivs det vidare att det inte alltid är där som svårigheterna synliggörs. Studien redovisar även lärarens betydande roll för att eleverna ska bli motiverade och finna mening med sin bråkräkning.