Dissertations / Theses: 'Arduino (computer programming language)'

1

Fabri, Junior Luiz Ariovaldo 1983. "O uso de Arduino na criação de kit para oficinas de robótica de baixo custo para escolas públicas." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267704.

Full text

Abstract:

Orientadores: Marli de Freitas Gomes Hernandez, Paulo Sérgio Martins Pedro
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia
Made available in DSpace on 2018-08-24T15:23:29Z (GMT). No. of bitstreams: 1 FabriJunior_LuizAriovaldo_M.pdf: 11888804 bytes, checksum: 4d030c6b8e5616c9ad8f61669c544dfb (MD5) Previous issue date: 2014
Resumo: Neste trabalho apresentamos o desenvolvimento de um kit para aplicação de oficinas de robótica de baixo custo para introdução às engenharias nas escolas públicas de ensino médio brasileira. Para desenvolver este trabalho foi utilizado a placa microcontrolada Arduino, versão Uno, o Minibloq que é um ambiente de desenvolvimento gráfico para computação física que utiliza blocos para desenvolvimento de programação, também desenvolvemos uma apostila para acompanhamento passos a passo do desenvolvimento das oficinas. Com esta oficina de robótica educacional, pretendemos introduzir conceitos de física, matemática, programação e robótica básica, conceitos que estão estritamente relacionados com as engenharias
Abstract: This paper presents the development of a kit for implementing a robotics workshop for low cost introduction to engineering in the public schools of Brazilian high school. To develop this work microcontrolled Arduino Uno board version was used, Minibloq which is a graphical development environment for physics computation that uses blocks to development programming, we also developed a booklet to follow step by step the development of the workshop. With this educational robotics workshop, we plan to introduce concepts of physics, mathematics, programming and basic robotics concepts that are closely related to engineering
Mestrado
Tecnologia e Inovação
Mestre em Tecnologia

APA, Harvard, Vancouver, ISO, and other styles

2

Cesário, Júnior José Maria 1979. "Um medidor de energia elétrica integrado em redes de comunicações." [s.n.], 2014. http://repositorio.unicamp.br/jspui/handle/REPOSIP/267697.

Full text

Abstract:

Orientadores: Varese Salvador Timóteo, Francisco José Arnold
Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Tecnologia
Made available in DSpace on 2018-08-24T09:10:01Z (GMT). No. of bitstreams: 1 CesarioJunior_JoseMaria_M.pdf: 2596300 bytes, checksum: 6b11eb547957a0632bbc647946da04ce (MD5) Previous issue date: 2014
Resumo: A crescente evolução mundial dos sistemas de medição inteligentes, a liberação de regulamentações Brasileiras, incentivando a adoção de sistemas de medição de energia elétrica inteligentes, direcionaram a presente dissertação a propor um sistema composto de um equipamento eletrônico para medição, em tempo real, das grandezas de corrente, tensão e calcular a energia consumida e terá canais de comunicação com as tecnologias Wi-Fi, GSM/GPRS e GPS. As informações sobre consumo serão disponibilizadas para os usuários finais com o objetivo de mudar o padrão de consumo de energia elétrica, ou até reduzi-lo, através da conscientização e disponibilização das informações de consumo em tempo real
Abstract: The growing worldwide trend of smart metering systems, the release of Brazilian regulations, encouraging the adoption of smart electricity metering systems, guided this dissertation to propose a system composed of an electronic device for measuring, in real time, the magnitudes of current, voltage and calculate the consumed power and will have communication channels based on Wi-Fi, GSM /GPRS and GPS technologies. The consumption information will be made available to end users with the goal of changing the electricity consumption pattern, or even reduce it, through awareness and provision of consumer information in real time
Mestrado
Tecnologia e Inovação
Mestre em Tecnologia

APA, Harvard, Vancouver, ISO, and other styles

3

Hoffer, Brandyn Moore. "Satisfying STEM Education Using the Arduino Microprocessor in C Programming." Digital Commons @ East Tennessee State University, 2012. https://dc.etsu.edu/etd/1472.

Full text

Abstract:

There exists a need to promote better Science Technology Engineering and Math (STEM) education at the high school level. To satisfy this need a series of hands-on laboratory assignments were created to be accompanied by 2 educational trainers that contain various electronic components. This project provides an interdisciplinary, hands-on approach to teaching C programming that meets several standards defined by the Tennessee Board of Education. Together the trainers and lab assignments also introduce key concepts in math and science while allowing students hands-on experience with various electronic components. This will allow students to mimic real world applications of using the C programming language while exposing them to technology not currently introduced in many high school classrooms. The developed project is targeted at high school students performing at or above the junior level and uses the Arduino Mega open-source Microprocessor and software as the primary control unit.

APA, Harvard, Vancouver, ISO, and other styles

4

Öigaard, Sandra. "Programming language & Gender." Thesis, Linnéuniversitetet, Institutionen för datavetenskap (DV), 2015. http://urn.kb.se/resolve?urn=urn:nbn:se:lnu:diva-45707.

Full text

Abstract:

Once women were the pioneers within the tech industry, but during the last decades the amount of women who choose a career within computer science has decreased rapidly. Programming languages have evolved during the last decades and because of the growing gender gap in the industry, they have done so involuntarily in the absence of women. The imbalance raises the question if the tech industry and the programming languages have been adapted for a more masculine way of developing software. A quantitative study and a literature review evaluates if there is a need for a computerlanguage developed towards women. The study comes to the conclusion that there is no need for a female inspired computer language, but the way computer languages are taught suits the male way of thinking better than the female way.

APA, Harvard, Vancouver, ISO, and other styles

5

Beug, Anne. "Teaching Introductory Programming Concepts: A Comparison of Scratch and Arduino." DigitalCommons@CalPoly, 2012. https://digitalcommons.calpoly.edu/theses/778.

Full text

Abstract:

Computing has become an integral part of modern America. The Bureau of Labor Statistics estimates that between 2008 and 2018, the United States will have 1.4 million job openings in computing fields [1]. Since the early 2000's (just after the "dot com bust"), the number of students enrolled in computing majors (Computer Science, Computer Engineering, etc.) dropped precipitously by over 50%, only starting to rise again in 2009 [2]. One way to rectify to this gap between demand and supply is to start training students in computational thinking during high school. While the Computer Science Advanced Placement AB test has been retired, a new AP test called "CS Principles" has been added to the suite of tests [3], highlighting the importance of computing to a modern education. Not only will we need more computing professionals, people in other professions will need to have computing skills. We propose in this thesis a comparison of two computing platforms. Scratch is a well-proven platform that teaches core programming concepts through a graphical programming interface. Arduino boards are open-source microcontrollers with an accompanying development environment and C-like language. We develop a parallel curriculum in Scratch and Arduino and compare the two. While we are unable to draw conclusive results from our quantitative study, from our qualitative research we see that Arduino is unsuitable for teaching core programming concepts to computing novices.

APA, Harvard, Vancouver, ISO, and other styles

6

Perez, Manuel A. "A language for interactive computer graphics programming." Virtual Press, 1987. http://liblink.bsu.edu/uhtbin/catkey/484784.

Full text

Abstract:

The writer defines graphics-oriented data types and operators as the basis for a graphics-oriented programming language. Most of these data types are not available in today's languages. They are usually defined as structures or records composed of some other basic types. These include points, rectangles, transformations, etc. Some operators, such as vector addition, are defined to work with them.The design and implementation of an interpreter to test some of these graphics data types and operators are discussed.The writer also examines some of the tools needed in a graphics programming environment.

APA, Harvard, Vancouver, ISO, and other styles

7

Pellerin, Clément. "Taskell : a concurrent constraint programming language." Thesis, McGill University, 1991. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61089.

Full text

Abstract:

Taskell is an instance of the concurrent constraint programming framework cc. The framework is parameterized by a choice of constraint system. The constraint system of Taskell is the set of finite trees with equality. The choice of constraint system makes Taskell similar to concurrent logic programming languages. When computing with partial information the notion of reading and writing memory becomes incoherent. The framework replaces these operations by ask and tell respectively. We hope to understand this new paradigm by studying implementations of cc languages. Taskell is a parallel implementation of a cc language written in Concurrent ML.

APA, Harvard, Vancouver, ISO, and other styles

8

Kilaru, Jyothsna. "PLASA| Programming Language for Synchronous Agents." Thesis, California State University, Long Beach, 2019. http://pqdtopen.proquest.com/#viewpdf?dispub=10978428.

Full text

Abstract:

The introduction of autonomous agents to replace humans in unfavorable and unreachable environments has been a longstanding goal in the field of robotics. The existing work of various researchers address several challenges involved in design or control of such robotic systems. However, existing solutions have been unable to offer users an easy and efficient programming environment for developing versatile robotic applications. These inadequacies have given rise to the development of a new robot programming language, called Programming LAnguage for Synchronous Agents (PLASA).

The main objective of this paper is to give a brief introduction about the newly developed robot programming language, PLASA, which facilitates the rapid implementation of co-operative applications on multiple physical robots, in dynamic environments. The syntax and semantics of this language are similar to those in many other high-level programming languages. In addition to the features offered by other high-level languages, PLASA offers two novel instructions: "do instruction'', which helps in executing the main motion primitives, and "query instruction'', which helps in executing a great variety of geometric and mathematical queries. A compiler produces a program that is executed by a virtual machine in each of the robots. The virtual machine offers a key characteristic that guarantees the timely execution of robots' movements through a synchronization protocol. To verify the correct functionality of the co-operative applications, a simulator that includes the proposed components has been provided.

The developed language offers abstraction for hiding complex network details and delivers human-readable language; these features make the programming environment suitable for anyone to control robot systems, regardless of expertise. The synchronization and co-ordination mechanisms provided by the language ensure the safety and prompt execution of robot operations in a robot system developed using PLASA.

APA, Harvard, Vancouver, ISO, and other styles

9

Rose, Eli. "Arrow: A Modern Reversible Programming Language." Oberlin College Honors Theses / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=oberlin1443226400.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Svallfors, Hugo. "Sard: An Object-Functional Programming Language." Thesis, Umeå universitet, Institutionen för datavetenskap, 2011. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-51276.

Full text

Abstract:

This bachelor's degree concerns the specification of a new programming language. This language, called Sard, is a backwards-incompatible new version of the existing language Scala. Sard, like Scala, is a high-level object-functional language. Unlike Scala, it is not very closely tied to the JVM or Java, eliminating some constraints on the language's design. Since this necessitates breaking backwards compatibility with Scala, the opportunity to disregard it is used to x some of the author's irritations with the language. This degree mostly focuses on deciding on the exact changes to Scala, and on the overall design, rather than on implementing a compiler for the language. A reason for this is that the bachelor's degree provides insuficient time to properly implement´and debug a compiler. Another is the desirability of pushing changes to the language as early into the design process as possible. Preferably, almost all changes to the language should occur before any compiler code has been written. The design eventually produced gets rid of some known issues stemming from the JVM, like null pointers, non-reified generics and single inheritance. Several features of Scala, like self-type annotations and in x syntax for methods are scrapped. Others, like pattern matching, are generalized. Some changes to the syntax are also made, particularly in the areas of closures, pattern matching and object construction. As of yet, this language has no implementation, and in future work, this must be rectified. Sard also requires calling compatibility with another programming language, but this remains to be specified. Nevertheless, Sard constitutes a promising refinement of an already great programming language, and it is hoped that Sard will x the few remaining issues with Scala's design.

APA, Harvard, Vancouver, ISO, and other styles

11

Grattage, Jonathan James. "A functional quantum programming language." Thesis, University of Nottingham, 2006. http://eprints.nottingham.ac.uk/10250/.

Full text

Abstract:

This thesis introduces the language QML, a functional language for quantum computations on finite types. QML exhibits quantum data and control structures, and integrates reversible and irreversible quantum computations. The design of QML is guided by the categorical semantics: QML programs are interpreted by morphisms in the category FQC of finite quantum computations, which provides a constructive operational semantics of irreversible quantum computations, realisable as quantum circuits. The quantum circuit model is also given a formal categorical definition via the category FQC. QML integrates reversible and irreversible quantum computations in one language, using first order strict linear logic to make weakenings, which may lead to the collapse of the quantum wavefunction, explicit. Strict programs are free from measurement, and hence preserve superpositions and entanglement. A denotational semantics of QML programs is presented, which maps QML terms into superoperators, via the operational semantics, made precise by the category Q. Extensional equality for QML programs is also presented, via a mapping from FQC morphisms into the category Q.

APA, Harvard, Vancouver, ISO, and other styles

12

Cardone, Richard Joseph. "Language and compiler support for mixin programming." Access restricted to users with UT Austin EID Full text (PDF) from UMI/Dissertation Abstracts International, 2002. http://wwwlib.umi.com/cr/utexas/fullcit?p3077428.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Xie, Jiantao 1979. "Text operators in a relational programming language." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=82451.

Full text

Abstract:

JRelix is an implementation of a relational database system which provides a significantly powerful database programming language and which is especially adept with complex data. This thesis documents an enhancement of JRelix which provides intuitive descriptions and efficient manipulations for textual information in the database.
Coupled with the relational and domain algebra in JRelix, the new database system supports rapid textual information retrieval, flexible text mining, structured text schema discovery, relational operations on text, transformation between text and relation, and powerful pattern matching in structured or unstructured data. These endow JRelix with the capacity of handling complicated textual information from heterogeneous data sources (e.g., data from the web), and also enrich its searching power on vast bodies of electronic data as a text/relational database management system.

APA, Harvard, Vancouver, ISO, and other styles

14

Adams, Stephen Robert. "Modular grammars for programming language prototyping." Thesis, University of Southampton, 1991. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.293178.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Chan, Chi-hown Johnny. "Implementation of computer simulation software in learning low-level computer language : a case study /." Hong Kong : University of Hong Kong, 2001. http://sunzi.lib.hku.hk/hkuto/record.jsp?B24700770.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Aslam, Toheed. "AspectMatlab: an aspect-oriented scientific programming language." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=92378.

Full text

Abstract:

There has been relatively little work done in the compiler research community for incorporating aspect-oriented features in scientific and dynamic programming languages.
MATLAB is a dynamic scientific programming language that is commonly used by scientists because of its convenient and high-level syntax for arrays, the fact that type declarations are not required, and the availability of a rich set of application libraries. This thesis introduces a new aspect-oriented scientific language, AspectMatlab.
AspectMatlab introduces key aspect-oriented features in a way that is both accessible to scientists and where the aspect-oriented features concentrate on array accesses and loops, the core computation elements in scientific programs. One of the main contributions of this thesis is to provide a compiler implementation of the AspectMatlab language. It is supported by a collection of scientific use cases, which portray the potential of the aspectorientation for scientific problems.
Introducing aspects into a dynamic language such as MATLAB also provides some new challenges. In particular, it is difficult to statically determine precisely where patterns match, resulting in many dynamic checks in the woven code. The AspectMatlab compiler uses flow analyses to eliminate many of those dynamic checks.
This thesis reports on the language design of AspectMatlab, the amc compiler implementation, and also provides an overview of the use cases that are specific to scientific programming. By providing clear extensions to an already popular language, AspectMatlab will make aspect-oriented programming accessible to a new group of programmers including scientists and engineers.
Relativement peu de travail a été accomplis dans le milieu de la recherche du compilateur pour l'intégration des caractéristiques orientées à l'aspect dans les domaines scientifique et dynamique des langages de programmation. Matlab est un langage de programmation scientifique dynamique qui est couramment utilisé par les scientifiques en raison de sa pratique et la syntaxe de qualité pour des tableaux ; du fait que les déclarations de type ne sont pas nécessaires, et de la disponibilité de vastes bibliothèques d'applications. Cette thèse introduit un nouvel aspect de langue de recherche scientifique : AspectMatlab.
AspectMatlab introduit fonctionnalités d'aspect orientées d'une manière qui est à la fois accessible aux scientifiques et où les fonctionnalités d'aspect orientées se concentrent sur les accès réseau et des boucles, les éléments de calcul de base dans les programmes scientifiques. L'une des principales contributions de cette thèse est de fournir une implémentation du compilateur du langage AspectMatlab. Il est soutenu d'une collection de cas d'utilisation scientifique, qui montre le potentiel de l'orientation aspect pour des problèmes scientifiques.
L'introduction des aspects dans un langage dynamique comme Matlab représente aussi quelques nouveaux défis. En particulier, il est difficile de déterminer statiquement où les modèles coïncident, résultant dans de nombreux contrôles dynamiques dans le code tissé. Le compilateur d'AspectMatlab utilise le flux d'analyses pour éliminer un grand nombre de ces contrôles dynamiques.
Cette thèse signale la conception du language d'AspectMatlab et l'implementation du compilateur amc. Elle fournit également un aperçu de l'utilisation des cas qui sont spécifiques à la programmation scientifique. En fournissant des extensions claires avec un langage déjà populaire, AspectMatlab rendra la programmation orientée à l'aspect accessible à un nouveau groupe de programmeurs y compris des scientifiques et des ingénieurs.

APA, Harvard, Vancouver, ISO, and other styles

17

Ding, Weiren. "Selsyn-C : a self-synchronizing parallel programming language." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22494.

Full text

Abstract:

In thesis thesis we report the design and implementation of a new self-scheduling parallel programming language, SELSYN-C. As parallel processors become more accessible to a broad range of programmers, the development of simple to use and effective programming languages becomes increasingly important. Our approach to the challenge of parallel programming language design and implementation is two-fold: (1) the design of simple extensions to C that are both easy to use for the programmer, and useful for effective compilation, and (2) the design of efficient and effective scheduling strategies that can be automatically supported by a compiler and associated run-time environment.
We outline our approach by presenting: (1) our motivation, (2) an overview of the extensions to C that form the SELSYN-C programming language, and (3) the development of a new scheduling mechanism that can be used to effectively compile SELSYN-C programs for a real parallel processor, the BBN Butterfly GP-1000. Different scheduling strategies for this mechanism were studied via several experimental tests and the results of these experiments are reported.
A source-to-source compiler supporting the SELSYN-C language has been implemented. Included in this thesis is a description of both the compiler and associated run-time environment.

APA, Harvard, Vancouver, ISO, and other styles

18

El-Kays, Ahmad Ziad. "Implementing event handlers in a database programming language." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=23884.

Full text

Abstract:

This thesis introduces active database concepts to a relational database system. Event handlers are introduced as user defined procedures. An event is the procedure call by the system, triggered in our case by an update statement.
Event handlers for the Relix (Relational database on UNIX) update statement have been implemented. These event handlers are of two types: the first type is that which runs before an update statement. The second type runs after an update statement. Also, event handlers have states. An event handler can be either active or inactive. Event handlers are executed when they are in the active state.
Event handlers have the property of being "one-to-many", i.e. for a single event more than one event handler can be defined. Another property is non-determinism, i.e., event handlers are executed with no pre-specified order.
In this thesis we present the design and implementation of event handlers in Relix. The mechanism that we introduced in Relix is equivalent to the EA model.

APA, Harvard, Vancouver, ISO, and other styles

19

Sutyanyong, Nattavut. "Procedural abstraction in a relational database programming language." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=55531.

Full text

Abstract:

This thesis introduces the notion of procedural abstraction in a relational database system. Procedures are treated as special forms of relations, and called computations.
Like relations, a computation is defined over a set of attributes. Subset of attributes can be defined as input attributes and the remaining attributes are output. Beyond the notion of procedures that a procedure can have only one set of input and output parameters, computations are symmetric: a computation may have a number of different subsets of input attributes.
Computations can be recursive and called by other computations.
States are introduced so that computations can remember values from previous evaluation and use them in next invocations. Stateful computations may be instantiated to have new sets of states.
This thesis contains the design and implementation of a parser for compiling computations as well as operations to evaluate them. All operations are coincident with relational algebra, a set of operations for manipulating relations.

APA, Harvard, Vancouver, ISO, and other styles

20

Chen, YuLing 1970. "A GIS editor for a database programming language /." Thesis, McGill University, 2001. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=31209.

Full text

Abstract:

Geographical Information Systems (GIS) have become a more and more important application of database systems. Most general-purpose database systems do not contain a graphical display interface which is indispensable in GIS applications. This thesis presents the design and implementation of a GIS editor (Geditor) for a relational database programming language. It builds a graphical map display interface into the database language and integrates a set of GIS functions.
Two interfaces are built in Geditor. One is with the database programmer and the other is with the GIS End-User. The former interface implements a new syntax (gedit) into the database language for the database programmer to call and display the Geditor GUI. The latter implements a GUI with the GIS End-User to view the map and perform a series of fundamental GIS functions.
Geditor stores both spatial and non-spatial data in the relational database. The implementation utilizes the spatial capabilities of the relational database programming language to the largest extent. This demonstrates the feasibility and the simplicity of implementing GIS applications in an integrated approach using relational databases. It also provides a flexible and extendable framework by designing an extendable syntax and utilizing the event handler mechanism which is the characteristic of active databases. Java, especially the JFC Swing package is used extensively in the implementation.

APA, Harvard, Vancouver, ISO, and other styles

21

Lui, Rebecca. "Implementation of procedures in a database programming language." Thesis, McGill University, 1996. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=27373.

Full text

Abstract:

This thesis documents the design and implementation of procedures in a database programming language. The purpose of this thesis is to integrate procedure facilities into an existing relational database system.
A relation is defined over a set of attributes. Given the values of a subset of attributes as input, a selection operation looks up the relation and outputs the values of the remaining attributes. Our proposed procedure construct supports this concept: a procedure is defined over a set of parameters, and the procedure can be invoked with different subsets of input parameters. This is accomplished by allowing procedures to have a sequence of blocks within the procedure body. Each block abstracts a sequence of actions which requires a subset of parameters as input. Users can select different blocks to be activated by supplying different subsets of input parameters. While a relation can be selected with any subset of input attributes, a procedure can only be invoked with defined subsets of parameters.
Our proposed procedures also support the usual properties of procedural abstraction: encapsulation and parameterization. A procedure declaration defines the procedure name, formal parameters, and the body. Procedure invocation is through the use of a stand-alone procedure call statement which specifies the procedure name and a list of actual parameters. Before a procedure is activated, the formal parameters within the procedure body are replaced by the corresponding actual parameters. Moreover, a procedure can be printed, shown, deleted, called by itself or other procedures, and passed as a parameter.

APA, Harvard, Vancouver, ISO, and other styles

22

Chiama, Jared Alungo. "Text operations for a relational database programming language." Thesis, McGill University, 1994. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=22726.

Full text

Abstract:

In this thesis we introduce a method of storing static text data, and algorithms for operations on the data, in a relational database programming language.
We introduce a text data type, and implement relational algebra operations on the text data type. Our method stores the text data in text files external to the relations, and maintains pointers to the text data within the relations. Our algorithms minimize accesses to the actual text data so as to maintain the efficiency of database operations.
We also implement a text processing mechanism where a text script can be joined to a relation, producing an individualized text script for each tuple in the relation. Our implementation includes queries involving pattern searches within text attribute values.
All operations on text data are relational algebra operations, requiring the text data to be in relations, and returning relations as results.

APA, Harvard, Vancouver, ISO, and other styles

23

Andreev, Maxim. "Operations on text in a database programming language." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0017/MQ55034.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Berman, Sonia. "P-Pascal : a data-oriented persistent programming language." Doctoral thesis, University of Cape Town, 1991. http://hdl.handle.net/11427/17084.

Full text

Abstract:

Bibliography: pages 187-199.
Persistence is measured by the length of time an object is retained and is usable in a system. Persistent languages extend general purpose languages by providing the full range of persistence for data of any type. Moreover, data which remains on disk after program termination, is manipulated in the same way as transient data. As these languages are based on general purpose programming languages, they tend to be program-centred rather than data-centred. This thesis investigates the inclusion of data-oriented features in a persistent programming language. P-Pascal, a Persistent Pascal, has been designed and implemented to develop techniques for data clustering, metadata maintenance, security enforcement and bulk data management. It introduces type completeness to Pascal and in particular shows how a type-complete set constructor can be provided. This type is shown to be a practical and versatile mechanism for handling bulk data collections in a persistent environment. Relational algebra operators are provided and the automatic optimisation of set expressions is performed by the compiler and the runtime system. The P-Pascal Abstract Machine incorporates two complementary data placement strategies, automatic updating of type information, and metadata query facilities. The protection of data types, primary (named) objects and their individual components is supported. The challenges and opportunities presented by the persistent store organisation are discussed, and techniques for efficiently exploiting these properties are proposed. We also describe the effects on a data-oriented system of treating persistent and transient data alike, so that they cannot be distinguished statically. We conclude that object clustering, metadata maintenance and security enforcement can and should be incorporated in persistent programming languages. The provision of a built-in, type-complete bulk data constructor and its non-procedural operators is demonstrated. We argue that this approach is preferable to engineering such objects on top of a language, because of greater ease of use and considerable opportunity for automatic optimisation. The existence of such a type does not preclude programmers from constructing their own bulk objects using other types - this is but one advantage of a persistent language over a database system.

APA, Harvard, Vancouver, ISO, and other styles

25

Ahmad, Salman Azeem. "Programming language design for service-oriented systems." Thesis, Massachusetts Institute of Technology, 2014. http://hdl.handle.net/1721.1/92961.

Full text

Abstract:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Electrical Engineering and Computer Science, 2014.
This electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Cataloged from student-submitted PDF version of thesis.
Includes bibliographical references (pages 179-187).
Designing systems in a service-oriented manner, in which application features are decoupled and run as independently executing services over a network, is becoming more commonplace and popular. Service-oriented programming provides a natural way to model and manage many types of systems and allows software development teams to achieve operational flexibility, scalability, and reliability in a cost-effective manner. In particular, it has been used quite successfully for Web and mobile applications. However, building, deploying, and maintaining service-oriented systems is challenging and requires extensive planning, more effort during development, a detailed understanding of advanced networking techniques, and the use of complicated concurrent programming. This thesis presents a new programming language called Silo. Silo integrates features that address key conceptual and pragmatic needs of service-oriented systems that, holistically, are not easily satisfied by existing languages. Broadly, these needs include: a unified distributed programming model, a simple yet ecient construct for concurrency, a familiar yet extensible syntax, and the ability to interoperate with a rich ecosystem of libraries and tools. In this dissertation, I describe how Silo's features, constructs, and conventions satisfy these needs. Then, I present various compiler and runtime techniques used in Silo's implementation. Lastly, I provide a demonstration, through a variety of programming patterns and applications, of how Silo facilitates the design, implementation, and management of service-oriented systems.
by Salman Azeem Ahmad.
Ph. D.

APA, Harvard, Vancouver, ISO, and other styles

26

Steele, Matthew D. M. Eng (Matthew David) Massachusetts Institute of Technology. "A programming language for precision--cost tradeoffs." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53149.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Includes bibliographical references (p. 81-82).
Many computational systems need to deal with various forms of imprecision and uncertainty in their data; it is also the case that many systems, especially mobile and distributed systems, must be able to trade off the precision of their data and operations against the cost of performing those operations. Unfortunately, for many applications, trying to make these tradeoffs severely complicates the program, because there does not yet exist a programming model that gives the programmer the ability to easily describe the relevant tradeoffs between precision and cost of operations or to express in an algorithm what tradeoffs are appropriate under what circumstances. This paper lays a solid foundation for exploring such programming models by introducing and analyzing a simple core abstraction on which others can be based. We determine what sorts of strategies are and are not possible within this abstraction, and discuss what specific difficulties must be overcome in future work in order to extend the abstraction to encompass a larger class of programs.
by Matthew D. Steele.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

27

Glen, Andrew Gordon. "A probability programming language: Development and applications." W&M ScholarWorks, 1998. https://scholarworks.wm.edu/etd/1539623920.

Full text

Abstract:

A probability programming language is developed and presented; applications illustrate its use. Algorithms and generalized theorems used in probability are encapsulated into a programming environment with the computer algebra system Maple to provide the applied community with automated probability capabilities. Algorithms of procedures are presented and explained, including detailed presentations on three of the most significant procedures. Applications that encompass a wide range of applied topics including goodness-of-fit testing, probabilistic modeling, central limit theorem augmentation, generation of mathematical resources, and estimation are presented.

APA, Harvard, Vancouver, ISO, and other styles

28

Shapiro, David. "Compiling Evaluable Functions in the Godel Programming Language." PDXScholar, 1996. https://pdxscholar.library.pdx.edu/open_access_etds/5101.

Full text

Abstract:

We present an extension of the Godel logic programming language code generator which compiles user-defined functions. These functions may be used as arguments in predicate or goal clauses. They are defined in extended Godel as rewrite rules. A translation scheme is introduced to convert function definitions into predicate clauses for compilation. This translation scheme and the compilation of functional arguments both employ leftmost-innermost narrowing. As function declarations are indistinguishable from constructor declarations, a function detection method is implemented. The ultimate goal of this research is the implementation of extended Godel using needed narrowing. The work presented here is an intermediate step in creating a functional-logic language which expands the expressiveness of logic programming and streamlines its execution.

APA, Harvard, Vancouver, ISO, and other styles

29

Miller, Ruane. "A study of PostScript as a graphics programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/11483.

Full text

APA, Harvard, Vancouver, ISO, and other styles

30

Lindgren, Sebastian. "A Mobile Graph-Like Visual Programming Language." Thesis, Mälardalens högskola, Akademin för innovation, design och teknik, 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:mdh:diva-36249.

Full text

Abstract:

Visual programming is a programming paradigm commonly used for game scripting, it also has applications in other areas such as for example patcher languages for music and animation and even a few languages for general purpose programming. By using visual programming complex tasks can be made easier by abstracting the code and letting the user express a flow of commands instead. This also gives a better overview of the problem and how the different parts connect. By graphically connecting nodes the program flow will be made clear even for those new to programming. Unfortunately, visual programming is mostly limited to laptops and stationary computer systems. Touch enabled mobile devices which perhaps would be even better suited for a visual programming approach are left with textual programming environments, which doesn’t use the capabilities of the touch screen, and a few non-graph-like visual programming languages, which use interlocked blocks to represent code. To explore how well graph-like visual programming would work on mobile devices a study will be conducted in which a lo-fi design is created and iteratively evaluated and improved using a modified NEVO process. The design will be created and improved based on existing visual programming interfaces and research in the area of visual programming, interaction design and information design, combined with the input from the test subjects. In this work a mobile, visual, graph-like, general purpose programming language has been designed. A lo-fi prototype of the language has been created to display how the language would look on a mobile system if realized. The lo-fi prototype was then tested with a method given by Rettig to give an indication of the systems usability measured by its task completion time compared to the task completion time of a mobile textual system. There is also a qualitative analysis on the responses from the test users. The tests were conducted both on people new to programming as well as people who have been programming for a while.

APA, Harvard, Vancouver, ISO, and other styles

31

Rizk, A. "MC : A concurrent programming language for distributed computer systems." Thesis, University of Sussex, 1986. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.373906.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Wendelborn, Andrew Lawrence. "Data flow implementations of a lucid-like programming language." Title page, contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09PH/09phw471.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Germain, Renaud. "Implementation of a dependently typed functional programming language." Thesis, McGill University, 2010. http://digitool.Library.McGill.CA:8881/R/?func=dbin-jump-full&object_id=92350.

Full text

APA, Harvard, Vancouver, ISO, and other styles

34

Petcharawises, Thavisakdi. "Programming language as a tool for software design." DigitalCommons@Robert W. Woodruff Library, Atlanta University Center, 1985. http://digitalcommons.auctr.edu/dissertations/2471.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

Martin, Walter E. "Cview, a graphical program generator for the C programming language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

36

Sun, Weizhong 1975. "Updates and events in a nested relational programming language." Thesis, McGill University, 2000. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=33448.

Full text

Abstract:

This thesis documents the design and implementation of Updates and Event Handlers in a relational database programming language. Update operations are implemented in the nested relational model and Event Handlers transform the database system from passive to active.
The update operation allows the user to change values of specified attributes in certain tuples. These attributes can be selected by a "using" clause which uses a relational algebra operation to select tuples from the relation we want to update. We can also use updates to add or delete some tuples to or from the relation. The nested update in nested relations will also be presented.
Event handlers are introduced as procedures, invoked by events which are system generated procedure calls. We implement the event handler based on computation---the procedural abstraction facility of the database programming language.
An update statement can invoke multiple event handlers. Event handlers may contain update statements which in turn invoke other event handlers. This introduces cascading event handlers. We will present the combination of update and event handler algorithm by which the update; operation is coupled with event handler closely and neatly, and the cascading event handler is handled by the system's recursive execution.
In this thesis, we provide the user a uniform syntax to update both flat relations and nested relations. The unification of computation and procedure leads to a simpler language. More over, the explicitness and intuitiveness of the definition and implementation of both event and event handler are under substantial considerations.

APA, Harvard, Vancouver, ISO, and other styles

37

Komioti, Maria. "Implementation of process synthronization in a database programming language." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=61164.

Full text

Abstract:

This thesis adds the feature of interprocess communication to a database programming language.
Relix has been designed in order to provide a very powerful database query facility as well as a high level database programming language. The process synchronization feature is very useful for programming languages, and thus our aim is to incorporate such a feature in relix. This is done by introducing a delay mechanism which is modelled on LINDA, a technique for interprocess communication. In order to minimize the new syntax, we base our delay mechanism on two existing database operations: the combination of projection and selection, and the views.

APA, Harvard, Vancouver, ISO, and other styles

38

He, Hongbo. "Implementation of nested relations in a database programming language." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1997. http://www.collectionscanada.ca/obj/s4/f2/dsk2/tape16/PQDD_0018/MQ37126.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Harms, Douglas Eugene. "The influence of software reuse on programming language design /." The Ohio State University, 1990. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487683049374373.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Gee, David Malcolm. "A visual programming language for real-time systems." Thesis, Northumbria University, 1994. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.386684.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Phillips, Brenton A. (Brenton Asher) 1976. "Metaglue : a programming language for multi-agent systems." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/80557.

Full text

Abstract:

Thesis (S.B. and M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1999.
Includes bibliographical references (p. 83-84).
by Brenton A. Phillips.
S.B.and M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

42

李詠康 and Wing-hong Lee. "D: a distributed object oriented programming language." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1994. http://hub.hku.hk/bib/B31211616.

Full text

APA, Harvard, Vancouver, ISO, and other styles

43

Lee, Wing-hong. "D : a distributed object oriented programming language /." [Hong Kong : University of Hong Kong], 1994. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13645341.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Lundén, Daniel. "Delayed sampling in the probabilistic programming language Anglican." Thesis, KTH, Skolan för datavetenskap och kommunikation (CSC), 2017. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-210756.

Full text

Abstract:

Many probabilistic inference algorithms, both exact and approximate, have been developed to run efficiently on various probabilistic models in the recent decades. For many probabilistic models, exact inference is, however, infeasible or impossible. As such, approximate algorithms are often necessary. In this thesis, a method for partially applying exact inference in probabilistic programming languages using Monte Carlo inference algorithms is introduced and formalized. More specifically, this method allows for conditioning on observations in the probabilistic program before performing sampling, where applicable. We show that this method, called delayed sampling, can be used to reduce mean squared error of estimators based on samples generated by probabilistic programs. We also show that delayed sampling never leads to an increase in mean squared error of estimators. An evaluation is performed with an implementation of delayed sampling in the probabilistic programming language Anglican. The results demonstrate clear reductions in mean squared error for simple examples, but the overhead is also shown to be quite substantial for the Anglican implementation.
Många probabilistiska inferensalgoritmer, både exakta och approximativa, har utvecklats för att fungera effektivt på olika probabilistiska modeller under de senaste decennierna. För många probabilistiska modeller är exakt inferens emellertid otänkbar eller omöjlig. På grund av detta är ofta approximativa algoritmer nödvändiga. I denna avhandling introduceras och formaliseras en metod för att delvis tillämpa exakt inferens i probabilistiska programmeringsspråk med Monte Carlo-inferensalgoritmer. Mer specifikt tillåter denna metod att konditionera på observationer i det probabilistiska programmet innan provtagning utförs, där så är tillämpligt. Vi visar att den här metoden, som kallas fördröjd provtagning, kan användas för att minska genomsnittliga kvadratiska fel för estimatorer som baseras på prover genererade av probabilistiska program. Vi visar också att fördröjd provtagning aldrig leder till en ökning av genomsnittliga kvadratiska fel för estimatorer. En utvärdering utförs med en implementering av fördröjd provtagning i det probabilistiska programmeringsspråket Anglican. Resultaten visar tydliga minskningar i genomsnittligt kvadratfel för enkla exempel, men beräkningskostnaderna visar sig också vara ganska betydande för implementationen i Anglican.

APA, Harvard, Vancouver, ISO, and other styles

45

Nguyen, Hoang Vinh. "Steve - A Programming Language for Packet Processing." University of Akron / OhioLINK, 2016. http://rave.ohiolink.edu/etdc/view?acc_num=akron1467985307.

Full text

APA, Harvard, Vancouver, ISO, and other styles

46

Hammerquist, James D. (James Daniel). "A C Navigational System." Thesis, University of North Texas, 1989. https://digital.library.unt.edu/ark:/67531/metadc500702/.

Full text

Abstract:

The C Navigational System (CNS) is a proposed programming environment for the C programming language. The introduction covers the major influences of programming environments and the components of a programming environment. The system is designed to support the design, coding and maintenance phases of software development. CNS provides multiple views to both the source and documentation for a programming project. User-defined and system-defined links allow the source and documentation to be hierarchically searched. CNS also creates a history list and function interface for each function in a module. The final chapter compares CNS and several other programming environments (Microscope, Rn, Cedar, PECAN, and Marvel).

APA, Harvard, Vancouver, ISO, and other styles

47

Blanchard, Timothy David. "An efficient database language." Thesis, University of York, 1993. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.358129.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Gu, Yu 1969 Jan 27. "Basic operators for semistructured data in a relational programming language." Thesis, McGill University, 2005. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=98716.

Full text

Abstract:

JRelix is a relational database implementation that supports not only traditional relational algebra and domain algebra but also complex data type and recursive nesting with powerful database programming language. This thesis documents some new features and operators of JRelix. Among them, type polymorphism (union type domain) and the relational pattern search (grep) operator are especially useful when dealing with semistructured data in a relational database.
We use union type domains to increase the flexibility of rigid type definition in relational databases. In addition, we implement the grep operator in the relational algebra to facilitate queries on semistructured data. Grep returns a relation which could contain the type and name of the attribute where it finds the match and the position in that attribute and value of the match. Moreover, we also implement top-level scalar and substring function which are also very useful in a relational database language.

APA, Harvard, Vancouver, ISO, and other styles

49

Wang, Zongyan 1969. "Implementation of distributed data processing in a database programming language." Thesis, McGill University, 2002. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=79201.

Full text

Abstract:

This thesis discusses the design and implementation of integrating the Internet capability into a database programming language JRelix, so that it not only possesses data organization; storage and indexing capabilities of normal DBMS, but also possesses remote data processing capabilities across the Internet.
A URL-based name extension to database elements in a database programming language is adopted, which gives it collaborative and distributed capability over the Internet with no changes in syntax or semantics apart from the new structure in names. Relations, computations, statements (or queries) and relational expression are treated uniformly as database elements in our implementation. These database elements are enabled to be accessed or executed remotely. As a result, remote data accessing or processing, as well as Remote Procedure Call (RPC) are supported.
Sharing resource is a main achievement of the implementation. In addition, site autonomy and performance transparency are accomplished; distributed view management is provided; sites need not be geographically distant; security management is implemented.

APA, Harvard, Vancouver, ISO, and other styles

50

Pidcock, Andrew H. "FSL : a language for constraint programming with booleans and reals." Thesis, McGill University, 1993. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=69644.

Full text

Abstract:

In this thesis, we present FSL, a constraint programming language for numerical computation in booleans, integers and reals. FSL is a functions-with-state language, meaning that in addition to the usual numerical operations, the user can declare and use functions that can have states, much like sequential boolean circuits, or objects in object-oriented programming. Despite this feature, FSL's input is entirely in the form of equations with a minimum of additional syntax.
A users' manual for FSL and some examples of the problems it was applied to introduce the language and its uses. The design of the FSL language is discussed, and then an overview of the implementation of the interactive FSL interpreter is given, followed by complete details, suitably organized and indexed for maintenance and continuation of the project. A full tutorial of the CASE tools Lex and Yacc is included, detailing the specific example of FSL and the interaction of the tools in the design of a parser.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic 'Arduino (computer programming language)'

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles