The problem of programming a parallel processor is discussed. Previous methods of programming a parallel processor, analyzing a program for parallel paths, and special language features are discussed. Graph theory is used to define the three basic programming constructs: choice, sequence, repetition. The concept of mechanized programming is expanded to allow for total separation of control and computational sections of a program. A definition of a language is presented which provides for this separation. A method for developing the program graph is discussed. The control graph and data graph are developed separately. The two graphs illustrate control and data predecessor relationships used in determining parallel elements of a program.

Traditional archival media such as paper, film, photographs, etc. contain a vast storage of knowledge. Much of this knowledge is applicable to current business and scientific problems, and offers solutions; consequently, there is value in extracting this information. While it is possible to manually extract the content, this technique is not feasible for large knowledge repositories due to cost and time. In this thesis, we develop a system that can extract such knowledge automatically from large repositories. A Graphical User Interface that permits users to indicate the location of the knowledge components (indexes) is developed, and software features that permit automatic extraction of indexes from similar documents is presented. The indexes and the documents are stored in a persistentdata store.The system is tested on a University Registrar’s legacy paper-based transcript repository. The study shows that the system provides a good solution for large-scale extraction of knowledge from archived paper and other media.

Made available in DSpace on 2015-03-05T14:01:49Z (GMT). No. of bitstreams: 0 Previous issue date: 22 / Bolsa para curso e programa de Pós Graduação / O presente trabalho propõe o Ubiquitous Oriented Programming (abreviadamente UOP), um modelo de programação orientado ao desenvolvimento de sistemas ubíquos. UOP utiliza os conceitos de Serviços e Orientação a Objetos, integrando-os com os requisitos de aplicações ubíquas como contexto, sensibilidade ao contexto, adaptação ao contexto, mobilidade de código e concorrência. Uma linguagem de programação (UbiLanguage) implementa os conceitos deste novo modelo de programação, provendo assim suporte ao desenvolvimento de sistemas ubíquos. O ambiente de desenvolvimento é composto por um compilador (UbiCompiler) que traduz código escrito em UbiLanguage para bytecode. A plataforma de execução é composta por uma máquina virtual ubíqua (UbiVM) que suporta a execução deste bytecode. / This work presents the Ubiquitous Oriented Programming (UOP in short), a programming model oriented to development of ubiquitous systems. UOP uses Services concepts and Object Oriented Programming, integrating them with the requirements of ubiquitous applications as context, context awareness, context adaptation, code mobility and concurrent. A programming language (UbiLanguage) implements the concepts of this new programming model, thus providing the development of ubiquitous systems. The development environment is composed by a compiler (UbiCompiler) which translates code written in UbiLanguage to bytecode. The execution platform is composed by a virtual machine (UbiVM) which supports the execution of this bytecode.

Submitted by Filipe dos Santos (fsantos@pucsp.br) on 2018-01-23T11:30:38Z No. of bitstreams: 1 Carla Marye Bicas Ferrari.pdf: 1256058 bytes, checksum: e934053679a57fcb66d337b275093865 (MD5) / Made available in DSpace on 2018-01-23T11:30:38Z (GMT). No. of bitstreams: 1 Carla Marye Bicas Ferrari.pdf: 1256058 bytes, checksum: e934053679a57fcb66d337b275093865 (MD5) Previous issue date: 2017-09-14 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / The aim of this research is to design a grammar that recognizes an educational text written in the narrative structure OCC-RDD and from its own generated a Petri Net model, in order to be possible analyzed and interpreted as network property on the educational history. The research will start with a bibliographic research from which a grammar and other components of this research are prepared, whose main objective is to advice the teacher on the class preparation which uses the narrative structure. A text following the narrative model in order to use it on the tool will be prepared and the same will go through each step of the research, which are: recognition of the fable, creation of the Petri Net model, network analysis and production of the results of fable’s analysis. The result of this project is the fable recognition grammar that can be used in a special tool with anexample and the analysis of the properties of this example / O objetivo da pesquisa é projetar uma gramática que reconheça um texto educativo escrito na estrutura da narrativa OCC-RDD e que a partir dela seja gerada um modelo de Rede de Petri, a fim de que seja possível analisar e interpretar as propriedades da rede na história educacional. A pesquisa terá início com um trabalho de consultas bibliográficas a partir do qual será preparada uma gramática e os outros componentes da pesquisa que possuem como principal objetivo auxiliar o professor na preparação de uma aula que utilize a estrutura narrativa. Um texto seguindo o modelo da narrativa com o intuito de utilizá-lo na ferramenta será preparado e o mesmo passará por cada etapa da pesquisa, que são: reconhecimento da fábula, criação do modelo de rede de Petri, análise da rede e produção dos resultados de análise da fábula. O resultado do trabalho ´e a gramática de reconhecimento de fábula que poderá ser utilizada numa ferramenta junto com um exemplo e a análise das propriedades deste exemplo

In this modern rather interconnected era, an organization’s top priority is to protect itself from major security breaches occurring frequently within a communicational environment. But, it seems, as if they quite fail in doing so. Every week there are new headlines relating to information being forged, funds being stolen and corrupt usage of credit card and so on. Personal computers are turned into “zombie machines” by hackers to steal confidential and financial information from sources without disclosing hacker’s true identity. These identity thieves rob private data and ruin the very purpose of privacy. The purpose of this project is to identify suspicious user activity by analyzing a log file which then later can help an investigation agency like FBI to track and monitor anonymous user(s) who seek for weaknesses to attack vulnerable parts of a system to have access of it. The project also emphasizes the potential damage that a malicious activity could have on the system. This project uses Hadoop framework to search and store log files for logging activities and then performs a ‘Map Reduce’ programming code to finally compute and analyze the results.

Computers have been assisting in recording, sound synthesis and other fields of music production for quite some time. The actual performance of music continues to be an area in which human players are chosen over computer performers. Musical performance is an area in which personalization is more important than consistency. Human players play with each other, reacting to phrases and ideas created by the players that they are playing with. Computer performers lack the ability to react to the changes in the performance that humans perceive naturally, giving the human players an advantage over the computer performers. This thesis creates a framework for describing unique musical performers that can play along in realtime with human players. FrTime, a reactive programming language, is used to constantly create new musical phrases. Musical phrases are constructed by unique user programmed performers and by chord changes that the framework provides. The reactive language creates multiple musical phrases for each point in time. A simple module which chooses musical phrases to be performed at the time of performance is created.

Le développement d'applications informatiques passe souvent par l'utilisation de langages évolués pour la programmation et de systèmes d'exploitation pour la gestion de l'exécution. Une famille de langages de programmation (les LPC pour "langages à parallélisme Compilé") peuvent procurer les même fonctionnalités et avantages qu'un langage de programmation couplé à un système d'exploitation multi-tâches. Notre intention est de montrer que les LPC ont certains attraits supplémentaires surtout dans le domaine d'application qu'est l'informatique industrielle. Pour mettre ceci en évidence, nous avons développé plusieurs versions d'une même application en utilisant d'une part un LPC et, d'autre part, un langage évolué classique avec un système d'exploitation. Ensuite, nous avons fait une comparaison chiffrée des différentes versions.

Cette thèse présente une étude qui répond à un besoin industriel d'avoir des outils pour aider à la qualité et au respect des processus de développement de logiciels critiques comme ceux du domaine de l'avionique civile. Il s'agit de l'étude de la couverture de code structurelle pour un langage de la famille ML. Dans ce contexte, ML apparaît comme un langage particulièrement riche en constructions de haut-niveau d'abstraction et expressif. Son utilisation est un élément de progrès mais soulève des problèmes d'adaptation des pratiques du génie logiciel classique pour les systèmes critiques. Notamment, la notion de couverture des conditions et des décisions ainsi que les critères de couverture dérivés se complexifient rapidement. Nous donnons alors en première contribution plusieurs sémantiques pour l'interprétation des définitions des conditions et des décisions pour un langage d'expressions de haut-niveau que nous avons complètement formellement défini. Ensuite, nous donnons la sémantique formelle pour une implantation pour la mesure de couverture par réécriture du code source, ce que nous appelons l'instrumentation intrusive. Puis, nous étudions une technique qui ne réécrit pas le code, ce qui permet d'avoir la possibilité d'utiliser le même binaire pour les tests et pour la production. Cette technique, que nous appelons non intrusive, consiste à générer les informations de correspondance entre le code source et le code machine, et éventuellement d'autres informations, pour que l'environnement d'exécution incluant une machine virtuelle puisse enregistrer les traces nécessaires à l'élaboration des rapports de couverture. Enfin, nous comparons ces deux approches, en terme de sémantique, d'utilisation et d'implantation.

For cell-biological processes, it is the complex interaction of their biochemical components, affected by both stochastic and spatial considerations, that create the overall picture. Formal modeling provides a method to overcome the limits of experimental observation in the wet-lab by moving to the abstract world of the computer. The limits of the abstract world again depend on the expressiveness of the modeling language used to formally describe the system under study. In this thesis, reaction constraints for the pi-calculus are proposed as a language for the stochastic and spatial modeling of cell-biological processes. The goal is to develop a language with sufficient expressive power to model dynamic cell structures, like fusing compartments. To this end, reaction constraints are augmented with two language constructs: priority and a global imperative store, yielding two different modeling languages, including non-deterministic and stochastic semantics. By several modeling examples, e.g. of Euglena's phototaxis, and extensive expressiveness studies, e.g. an encoding of the spatial modeling language BioAmbients, including a prove of its correctness, the usefulness of reaction constraints, priority, and a global imperative store for the modeling of cell-biological processes is shown. Thereby, besides dynamic cell structures, different modeling styles, e.g. individual-based vs. population-based modeling, and different abstraction levels, as e.g. provided by reaction kinetics following the law of Mass action or the Michaelis-Menten theory, are considered.

The application of higher-order PDA-based flow analyses to object-oriented languages enables comprehensive and precise characterization of program behavior, while retaining practicality with efficiency. We implement one such flow analysis which we've named OOCFA2. While over the years many advancements in flow analysis have been made, they have almost exclusively been with respect to functional languages, often modeled with the calculus. Object-oriented semantics--while also able to be modeled in a functional setting--provide certain structural guarantees and common idioms which we believe are valuable to reason over in a first-class manner. By tailoring modern, advanced flow analyses to object-oriented semantics, we believe it is possible to achieve greater precision and efficiency than could be had using a functional modeling. This, in turn, reflects upon the possible classes of higher-level analyses using the underlying flow analysis: the more powerful, efficient, and flexible the flow analysis, the more classes of higher-level analyses--e.g., security analyses--can be practically expressed. The growing trend is that smartphone and mobile-device (e.g., tablet) users are integrating these devices into their lives, in more frequent and more personal ways. Accordingly, the primary application and proof-of-concept for this work is the analysis of the Android operating system's permissions-based security system vis--vis potentially malicious applications. It is implemented atop OOCFA2. The use of a such a powerful higher-order flow analysis allows one to apply its knowledge to create a wide variety of powerful and practical security-analysis "front-ends"--not only the permissions-checking analysis in this work, but also, e.g., information-flow analyses. OOCFA2 is the first PDA-based higher-order flow analysis in an object-oriented setting. We empirically evaluate its accuracy and performance to prove its practical viability. We also evaluate the proof-of-concept security analysis' accuracy as directly related to OOCFA2; this shows promising results for the potential of building security-oriented "front-ends" atop OOCFA2.