Log in

Relevant bibliographies by topics / Computer program language / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Computer program language.

Dissertations / Theses on the topic 'Computer program language'

Author: Grafiati

Published: 4 June 2021

Last updated: 29 July 2024

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

Select a source type:

Consult the top 50 dissertations / theses for your research on the topic 'Computer program language.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Shepherd, David. "Natural language program analysis combining natural language processing with program analysis to improve software maintenance tools /." Access to citation, abstract and download form provided by ProQuest Information and Learning Company; downloadable PDF file, 176 p, 2007. http://proquest.umi.com/pqdweb?did=1397920371&sid=6&Fmt=2&clientId=8331&RQT=309&VName=PQD.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Chou, Robert Shih-pei. "A program design language for COBOL." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/13200.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

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

4

Stratton, David. "A program visualisation meta language." Thesis, University of Ballarat, 2003. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/63588.

Full text

Abstract:

The principle motivation of this work is to define an open PV architecture that will enable a variety of visualisation schemes to interoperate and that will encourage the generation of PV systems and research into their efficacy. Ultimately this may lead to more effective pedagogy in the field of computer programming and hence remove a barrier to students entering the profession.
Doctorate of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

5

Calnan, Paul W. "EXTRACT, Extensible Transformation and Compiler Technology." Link to electronic thesis, 2003. http://www.wpi.edu/Pubs/ETD/Available/etd-0429103-152947.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Nagulakonda, Vikram. "Assertion seeding development of program instrumentation through iterative formal analysis /." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=1080.

Full text

Abstract:

Thesis (M.S.)--West Virginia University, 1999.
Title from document title page. Document formatted into pages; contains v, 80 p. : ill. Includes abstract. Includes bibliographical references (p. 33-35).

APA, Harvard, Vancouver, ISO, and other styles

7

Richardson, Joel E. "E a persistent systems implementation language /." Madison, Wis. : University of Wisconsin-Madison, Computer Sciences Dept, 1989. http://catalog.hathitrust.org/api/volumes/oclc/20839601.html.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Koh, Kyu Han Seals Cheryl D. "PineHill a novel approach to computer aided language learning /." Auburn, Ala., 2007. http://hdl.handle.net/10415/1365.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Coleman, Jesse J. "The design, construction, and implementation of an engineering software command processor and macro compiler /." Online version of thesis, 1995. http://hdl.handle.net/1850/12219.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Gordon, Christopher Todd. "A visual language for ADA program unit specifications." Thesis, This resource online, 1990. http://scholar.lib.vt.edu/theses/available/etd-06232009-063007/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Ouren, Leslie Serine. "Integrating computer software within the Houghton Mifflin Language Arts program." CSUSB ScholarWorks, 2005. https://scholarworks.lib.csusb.edu/etd-project/2918.

Full text

Abstract:

This project was created for third grade teachers who use the Houghton Mifflin Language Arts series and want to integrate computer software into their writing curriculum. The website created includes all the writing assignments that the students are to complete and the required software used to complete the assignment.

APA, Harvard, Vancouver, ISO, and other styles

12

Librers, Joseph. "A module declaration generator." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9861.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Leoutsarakos, Nikolaos. "A context sensitive command language /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63274.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

Gibson, Barbara Brunner. "Ada as a design specification language /." Online version of thesis, 1988. http://hdl.handle.net/1850/10215.

Full text

APA, Harvard, Vancouver, ISO, and other styles

15

Gunnlaugsson, Bjorgvin. "Concurrency and sharing in prolog and in a picture editor for aldat." Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63864.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Lindstrom, Lowell Richard. "The implementation of a SIMULA compiler on the Kansas State University Perkin-Elmer computers." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9934.

Full text

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

Trachsel, Anne Roberta. "L-EQUEL : an embedded query language for Franz LISP." Thesis, Kansas State University, 1985. http://hdl.handle.net/2097/9884.

Full text

APA, Harvard, Vancouver, ISO, and other styles

19

Yessenov, Kuat T. "A lightweight specification language for bounded program verification." Thesis, Massachusetts Institute of Technology, 2009. http://hdl.handle.net/1721.1/53184.

Full text

Abstract:

Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2009.
Cataloged from PDF version of thesis.
Includes bibliographical references (p. 63-64).
This thesis presents a new light-weight specification language called JForge Specification Language (JFSL) for object-oriented languages such as Java. The language is amenable to bounded verification analysis by a tool called JForge that interprets JFSL specifications, fully integrates with a mainstream development environment, and assists programmers in examining counter example traces and debugging specifications. JFSL attempts to address challenges of specification languages such as inheritance, frame conditions, dynamic dispatch, and method calls inside specifications in the context of bounded verification. A collection of verification tasks illustrates the expressiveness and conciseness of JForge specifications and demonstrates effectiveness of the bounded verification technique.
by Kuat T. Yessenov.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

20

Naeem, Nomair A. "Programmer-friendly decompiled Java." Thesis, McGill University, 2006. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=101644.

Full text

Abstract:

Java decompilers convert Java class files to Java source. Common Java decompilers are javac-specific decompilers since they target bytecode produced from a particular javac compiler. We present work carried out on Dava, a tool-independent decompiler that decompiles bytecode produced from any compiler. A known deficiency of tool-independent decompilers is the generation of complicated decompiled Java source which does not resemble the original source as closely as output produced by javac-specific decompilers. This thesis tackles this short-coming, for Dava, by introducing a new back-end consisting of simplifying transformations.
The work presented can be broken into three major categories: transformations using tree traversals and pattern matching to simplify the control flow, the creation of a flow analysis framework for an Abstract Syntax Tree (AST) representation of Java source code and the implementation of flow analyses with their use in complicated transformations.
The pattern matching transformations rewrite the ASTs to semantically-equivalent ASTs that correspond to code that is easier for programmers to understand. The targeted Java constructs include If and If-Else aggregation, for-loop creation and the removal of abrupt control flow. Pattern matching using tree traversals has its limitations. Thus, we introduce a new structure-based data flow analysis framework that can be used to gather information required by more complex transformations. Popular compiler analyses e.g., reaching definitions, constant propagation etc. were implemented using the framework. Information from these analyses is then leveraged to perform more advanced AST transformations.
We performed experiments comparing different decompiler outputs for different sources of bytecode. The results from these experiments indicate that the new Dava back-end considerably improves code comprehensibility and readability.

APA, Harvard, Vancouver, ISO, and other styles

21

O'Bagy, Janalee. "The implementation of generators and goal-directed evaluation in Icon." Diss., The University of Arizona, 1988. http://hdl.handle.net/10150/184491.

Full text

Abstract:

Generators and goal-directed evaluation provide a rich programming paradigm when combined with traditional control structures in an imperative language. Icon is a language whose goal-directed evaluation is integrated with traditional control structures. This integration provides powerful mechanisms for formulating many complex programming operations in concise and natural ways. However, generators, goal-directed evaluation, and related control structures introduce implementation problems that do not exist for languages with only conventional expression evaluation. This dissertation presents an implementation model using recursion that serves as a basis for both an interpreter and a compiler. Furthermore, in the case of the compiler, optimizations can be performed to improve the efficiency of Icon programs, mainly by reducing the general evaluation strategy whenever possible. The dissertation describes a compile-time semantic analysis used to gather information about the properties of expressions and how they are used at their lexical sites. The optimizations that can be performed using this information are illustrated in the context of the compiler model described in the dissertation.

APA, Harvard, Vancouver, ISO, and other styles

22

Calnan, III Paul W. "EXTRACT: Extensible Transformation and Compiler Technology." Digital WPI, 2003. https://digitalcommons.wpi.edu/etd-theses/484.

Full text

Abstract:

Code transformation is widely used in programming. Most developers are familiar with using a preprocessor to perform syntactic transformations (symbol substitution and macro expansion). However, it is often necessary to perform more complex transformations using semantic information contained in the source code. In this thesis, we developed EXTRACT; a general-purpose code transformation language. Using EXTRACT, it is possible to specify, in a modular and extensible manner, a variety of transformations on Java code such as insertion, removal, and restructuring. In support of this, we also developed JPath, a path language for identifying portions of Java source code. Combined, these two technologies make it possible to identify source code that is to be transformed and then specify how that code is to be transformed. We evaluate our technology using three case studies: a type name qualifier which transforms Java class names into fully-qualified class names; a contract checker which enforces pre- and post-conditions across behavioral subtypes; and a code obfuscator which mangles the names of a class's methods and fields such that they cannot be understood by a human, without breaking the semantic content of the class.

APA, Harvard, Vancouver, ISO, and other styles

23

Barrett, Mark Douglas. "Teaching language arts in third grade with HyperStudio, an interactive computer program." CSUSB ScholarWorks, 1991. https://scholarworks.lib.csusb.edu/etd-project/849.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Shear, Raymond F. "Implementation of a Modula 2 subset compiler supporting a "C" language interface using commonly available UNIX tools /." Online version of thesis, 1989. http://hdl.handle.net/1850/10505.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Pimentel, Richard. "Direct Simulation from a Model Specification Language." DigitalCommons@USU, 1986. https://digitalcommons.usu.edu/etd/6985.

Full text

Abstract:

The purpose of this thesis was to develop a program that would accept, as input, a finite set of algebraic equations and simple if-then conditional expressions that model a natural system, and then produce a continuous computer simulation with graphics and tabular output. The equations and conditionals can be in any order and key elements can be missing. The program can be used to run existing models or as a development tool to produce immediate prototypic computer simulations through synergistic man-machine interactions. The theoretical aspects of automatic program generation were discussed, as well as the architectural design of the system. The simulation system was used to develop a computer simulation of an exploited Northern Utah pheasant population and the results were compared to the results from an earlier FORTRAN computer simulation of the same model. It was concluded that the simulation system developed for this thesis produces verified computer simulations from mathematical models that are at least as accurate as the corresponding simulation written in FORTRAN. The system was easy to use and should be useful for unsophisticated users. Some "tuning'' of the input was needed to produce a verified simulation and it was concluded that further work was needed here.

APA, Harvard, Vancouver, ISO, and other styles

26

Yildiz, Faruk. "Implementation of a human avatar for the MARG project in networked virtual environments." Thesis, Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2004. http://library.nps.navy.mil/uhtbin/hyperion/04Mar%5FYildiz.pdf.

Full text

Abstract:

Thesis (M.S. in Modeling, Virtual Environments and Simulation (MOVES))--Naval Postgraduate School, March 2004.
Thesis advisor(s): Xiaoping Yun. Includes bibliographical references (p. 61-62). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

27

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

28

Judd, Mark. "A view of types and parameterization in programming languages /." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63360.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Jones, Linwood D. "Run-time comparison C++ vs. Java." Virtual Press, 1999. http://liblink.bsu.edu/uhtbin/catkey/1125142.

Full text

Abstract:

C++ is one of the most commonly used programming languages in academic and professional environments. Java is a relatively new language that is rapidly gaining popularity and acceptance. Java's designers claim that Java offers all the functionality of C++ and more. Java's syntax is similar to C++, but Java code is not compatible with C++. Java offers platform independence and better support for internet-oriented applications. Platform independence may come at a price. A major concern regarding any language is performance.This thesis looks at the performance of Java and C++. A comparison is made of C++ and Java runtimes for a simple algorithm (bubblesort). It covers the differences in compilation of an application developed in C++ versus an application developed in Java. It reports the execution time of an algorithm written in both languages.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

30

Sarcar, Amritam. "Runtime assertion checking for JML on the eclipse platform using AST merging." To access this resource online via ProQuest Dissertations and Theses @ UTEP, 2009. http://0-proquest.umi.com.lib.utep.edu/login?COPT=REJTPTU0YmImSU5UPTAmVkVSPTI=&clientId=2515.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Hanson, Clyde Russell 1959. "Implementation of Fletcher-Reeves in the GOSPEL optimization package." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277144.

Full text

Abstract:

Implementation of the Fletcher-Reeves optimization strategy into the GOSPEL optimization package is examined. An explanation of the GOSPEL package is provided, followed by the presentation of the Fletcher-Reeves strategy. Performance of all strategies in the updated GOSPEL package are compared for nine test cases. A user manual for GOSPEL operation as well as the source code are also included.

APA, Harvard, Vancouver, ISO, and other styles

32

Boyd, Richard Victor 1942. "PLAN GENERATION AND PROLOG (LOGIC, DECLARATIVE, WARPLAN)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291278.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

Tollefson, Bradley A. "The J-shell command language interpreter." Virtual Press, 1985. http://liblink.bsu.edu/uhtbin/catkey/506686.

Full text

Abstract:

A command language interpreter (CLI) translates commands entered by the user into system actions. The shell is a specific type of CLI that was originally designed and used with UNIX operating systems.The author proposes to design and implement a shell-like CLI on top of the VMS operating system. The shell will enhance VMS features by providing an easier to use syntax and by providing features that are not currently available through VMS. These features include piping facilities and the ability to enter and/or reference multiple commands from a single command line. A language reference manual is provided with the J-shell. This manual explains the features and commands of the J-shell.

APA, Harvard, Vancouver, ISO, and other styles

34

Vaikakul, Savalai 1976. "The linguistic exploration of children : playing with language through computer programming." Thesis, Massachusetts Institute of Technology, 1999. http://hdl.handle.net/1721.1/62940.

Full text

Abstract:

Thesis (S.M.)--Massachusetts Institute of Technology, Program in Media Arts & Sciences, 1999.
Includes bibliographical references (leaf 49).
Children's intuitions about the grammar of their language are resources which children can use to leverage understanding of formal grammatical concepts. In this thesis, I demonstrate how the Logo programming environment can be used to encourage and support children's intuitive explorations in the domain of formal linguistics. Computer programming was used to create a meaningful context in which formal grammatical concepts were introduced to children through the engagement and mobilization of their linguistic intuitions. To initially engage and mobilize children's linguistic intuitions, I made a computer program in which children could play at using their intuitions about the English language to figure out the basis of a turtle character's linguistic judgments. In the context of working to understand how my program was made, children arrived at a meaningful understanding of the formal linguistic concepts I had used to construct my computer program. Furthermore, children personally appropriated the formal linguistic concepts for the purpose of modifying my original program and making their own computer programs about language.
by Savalai Vaikakul.
S.M.

APA, Harvard, Vancouver, ISO, and other styles

35

Chen, Mei 1962. "The characterization of learning environments and program structures of instructional programs produced using Logo /." Thesis, McGill University, 1992. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=56930.

Full text

Abstract:

A methodology was developed in this study for identifying the cognitive, pedagogical, and computational characteristics of computer-based learning environments. The characterization of the cognitive and pedagogical features was achieved by decomposing the learning environments into episodes which were composed of sequences of "views". Each "view" was described in terms of the different types of knowledge presented, the pedagogical strategies used to present the knowledge, and the forms and functions of user-computer interactions elicited. The computational characteristics were described in terms of modularity and other programming properties. The methodology was applied to characterizing the instructional programs produced by student teachers using Logo.
The results showed that this methodology can successfully identify the cognitive, pedagogical and computational characteristics of the learning environments. It can also clarify what can be learned in a microworld, especially the "powerful ideas" in Logo environments. In addition, the usability and constraints of learning environments in meeting the learners' cognitive needs during the learning process can be assessed.

APA, Harvard, Vancouver, ISO, and other styles

36

Chow, Kent. "GPLOT : a language for plotting graphs." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66062.

Full text

APA, Harvard, Vancouver, ISO, and other styles

37

Yu, Henry 1961. "HPSIMC: AHPL SIMULATOR IMPLEMENTED IN C LANGUAGE (PARSER, SOFTWARE)." Thesis, The University of Arizona, 1986. http://hdl.handle.net/10150/291313.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Metz, Gale Lynn. "The units of measure consistency checker for the entity-relationship-attribute requirements model." Thesis, Kansas State University, 1986. http://hdl.handle.net/2097/9941.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Firth, Michael Anthony. "A fold/unfold transformation system for a non-strict language." Thesis, University of York, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.280416.

Full text

APA, Harvard, Vancouver, ISO, and other styles

40

Kenyon, John L. "CHIMP the C/C++ hybrid imperative meta-programmer /." abstract and full text PDF (free order & download UNR users only), 2008. http://0-gateway.proquest.com.innopac.library.unr.edu/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:1453647.

Full text

APA, Harvard, Vancouver, ISO, and other styles

41

Bull, Tim. "Software maintenance by program transformation in a wide spectrum language." Thesis, Durham University, 1994. http://etheses.dur.ac.uk/5494/.

Full text

Abstract:

This thesis addresses the software maintenance problem of extracting high-level designs from code. The investigated solution is to use a mathematically-based formal program transformation system. The resulting tool, the Maintainer's Assistant, is based on Ward's [177] WSL (wide spectrum language) and method of proving program equivalence. The problems addressed include: how to reverse engineer from code alone (the only reliable source of information about a program [158]), how to express program transformations within the system, what kinds of transformations should be incorporated, how to make the tool simple to use, how to perform abstraction and how to create a tool suitable for use with large programs. Using the Maintainer's Assistant, the program code is automatically translated into WSL and the transformations, although tested for valid applicability by the system, are interactively applied by the user. Notable features include a mathematical simplifier, a large flexible transformation catalogue and, significantly, the use of an extension of WSL, A4etaWSL, for representing the transformations. MetaWSL expands WSL by incorporating a variety of extensions, including: program editing statements, pattern matching and template filling functions, symbolic mathematics and logic functions, statements for moving within the program’s syntax tree and statements for repeating an operation at each node of the tree. Using MetaWSL, 80% of the 601 transformations can be expressed in less than 20 program statements. The Maintainer's Assistant has been used on a wide variety of examples of up to several thousand lines, including commercial software written in IBM 370 assembler. It has been possible to transform initially unstructured programs into a hierarchy of procedures, facilitating subsequent design recovery. These results show that program transformation is a viable method of renovating old (370 assembler) code in a cost elective way, and that MetaWSL provides an effective basis for clearly and concisely expressing the required transformations.

APA, Harvard, Vancouver, ISO, and other styles

42

Barker, Dean. "Computer facial animation for sign language visualization." Thesis, Stellenbosch : Stellenbosch University, 2005. http://hdl.handle.net/10019.1/50300.

Full text

Abstract:

Thesis (MSc)--University of Stellenbosch, 2005.
ENGLISH ABSTRACT: Sign Language is a fully-fledged natural language possessing its own syntax and grammar; a fact which implies that the problem of machine translation from a spoken source language to Sign Language is at least as difficult as machine translation between two spoken languages. Sign Language, however, is communicated in a modality fundamentally different from all spoken languages. Machine translation to Sign Language is therefore burdened not only by a mapping from one syntax and grammar to another, but also, by a non-trivial transformation from one communicational modality to another. With regards to the computer visualization of Sign Language; what is required is a three dimensional, temporally accurate, visualization of signs including both the manual and nonmanual components which can be viewed from arbitrary perspectives making accurate understanding and imitation more feasible. Moreover, given that facial expressions and movements represent a fundamental basis for the majority of non-manual signs, any system concerned with the accurate visualization of Sign Language must rely heavily on a facial animation component capable of representing a well-defined set of emotional expressions as well as a set of arbitrary facial movements. This thesis investigates the development of such a computer facial animation system. We address the problem of delivering coordinated, temporally constrained, facial animation sequences in an online environment using VRML. Furthermore, we investigate the animation, using a muscle model process, of arbitrary three-dimensional facial models consisting of multiple aligned NURBS surfaces of varying refinement. Our results showed that this approach is capable of representing and manipulating high fidelity three-dimensional facial models in such a manner that localized distortions of the models result in the recognizable and realistic display of human facial expressions and that these facial expressions can be displayed in a coordinated, synchronous manner.
AFRIKAANSE OPSOMMING: Gebaretaal is 'n volwaardige natuurlike taal wat oor sy eie sintaks en grammatika beskik. Hierdie feit impliseer dat die probleem rakende masjienvertaling vanuit 'n gesproke taal na Gebaretaal net so moeilik is as masjienvertaling tussen twee gesproke tale. Gebaretaal word egter in 'n modaliteit gekommunikeer wat in wese van alle gesproke tale verskil. Masjienvertaling in Gebaretaal word daarom nie net belas deur 'n afbeelding van een sintaks en grammatika op 'n ander nie, maar ook deur beduidende omvorming van een kommunikasiemodaliteit na 'n ander. Wat die gerekenariseerde visualisering van Gebaretaal betref, vereis dit 'n driedimensionele, tyds-akkurate visualisering van gebare, insluitend komponente wat met en sonder die gebruik van die hande uitgevoer word, en wat vanuit arbitrêre perspektiewe beskou kan word ten einde die uitvoerbaarheid van akkurate begrip en nabootsing te verhoog. Aangesien gesigsuitdrukkings en -bewegings die fundamentele grondslag van die meeste gebare wat nie met die hand gemaak word nie, verteenwoordig, moet enige stelsel wat te make het met die akkurate visualisering van Gebaretaal boonop sterk steun op 'n gesigsanimasiekomponent wat daartoe in staat is om 'n goed gedefinieerde stel emosionele uitdrukkings sowel as 'n stel arbitrre gesigbewegings voor te stel. Hierdie tesis ondersoek die ontwikkeling van so 'n gerekenariseerde gesigsanimasiestelsel. Die probleem rakende die lewering van gekordineerde, tydsbegrensde gesigsanimasiesekwensies in 'n intydse omgewing, wat gebruik maak van VRML, word aangeroer. Voorts word ondersoek ingestel na die animasie (hier word van 'n spiermodelproses gebruik gemaak) van arbitrre driedimensionele gesigsmodelle bestaande uit veelvoudige, opgestelde NURBS-oppervlakke waarvan die verfyning wissel. Die resultate toon dat hierdie benadering daartoe in staat is om hoë kwaliteit driedimensionele gesigsmodelle só voor te stel en te manipuleer dat gelokaliseerde vervormings van die modelle die herkenbare en realistiese tentoonstelling van menslike gesigsuitdrukkings tot gevolg het en dat hierdie gesigsuitdrukkings op 'n gekordineerde, sinchroniese wyse uitgebeeld kan word.

APA, Harvard, Vancouver, ISO, and other styles

43

Mosca, Peter. "A study of Ada and C in concurrent programming." Instructions for remote access. Click here to access this electronic resource. Access available to Kutztown University faculty, staff, and students only, 1991. http://www.kutztown.edu/library/services/remote_access.asp.

Full text

Abstract:

Thesis (M.S.)--Kutztown University of Pennsylvania, 1991.
Source: Masters Abstracts International, Volume: 45-06, page: 3190. Abstract precedes thesis as [1] preliminary leaf. Typescript. Includes bibliographical references (leaf 54).

APA, Harvard, Vancouver, ISO, and other styles

44

Motwani, Manjula H. "An Occam2 implementation of Prolog /." Online version of thesis, 1994. http://hdl.handle.net/1850/12175.

Full text

APA, Harvard, Vancouver, ISO, and other styles

45

Vorvick, Janet. "Evaluable Functions in the Godel Programming Language: Parsing and Representing Rewrite Rules." PDXScholar, 1995. https://pdxscholar.library.pdx.edu/open_access_etds/5195.

Full text

Abstract:

The integration of a functional component into a logic language extends the expressive power of the language. One logic language which would benefit from such an extension is Godel, a prototypical language at the leading edge of the research in logic programming. We present a modification of the Godel parser which enables the parsing of evaluable functions in Godel. As the first part of an extended Godel, the parser produces output similar to the output from the original Godel parser, ensuring that Godel modules are properly handled by the extended-Godel parser. Parser output is structured to simplify, as much as possible, the future task of creating an extended compiler implementing evaluation of functions using narrowing. We describe the structure of the original Godel parser, the objects produced by it, the modifications made for the implementation of the extended Godel and the motivation for those modifications. The ultimate goal of this research is production of a functional component for Godel which evaluates user-defined functions with needed narrowing, a strategy which is sound, complete, and optimal for inductively sequential rewrite systems.

APA, Harvard, Vancouver, ISO, and other styles

46

Robinson, Aaron R. "Integrating a universal query mechanism into Java /." Online version of thesis, 2007. http://hdl.handle.net/1850/4816.

Full text

APA, Harvard, Vancouver, ISO, and other styles

47

Aycock, John Daniel. "Practical Earley parsing and the SPARK toolkit." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2001. http://www.collectionscanada.ca/obj/s4/f2/dsk3/ftp04/NQ58556.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

48

Pearson, Mark Philip. "The design, implementation, and use of a concurrent lisp programming system for distributed computing environments." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/13029.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

Sewry, David Andrew. "Concurrency in modula-2." Thesis, Rhodes University, 1985. http://hdl.handle.net/10962/d1004369.

Full text

Abstract:

A concurrent program is one in which a number of processes are considered to be active simultaneously . It is possib l e to t hink of a process as being a separate sequential program executing independently of other processes, although perhaps communicating with them at desired pOints . The concurrent program, as a whole, can be executed in one of two ways: il ii) in true concurrent manner, wi th each process executing on a dedicated processor in a quasi - concurrent manner, where a processor's processes . time is multiplexed between single the There are two motivations for the study of concurrency in programming languages : i) concurrent programming facilities can be exploited in systems where one has more t han one processor . As technology i mproves, machines having multiple processors will proliferate ii) concurrent p r ogramming facilities may allow programs to be structured as independent , bu t co - operating, processes which can then be implemented on a single processor system . This structure may be more natural to the programmer then the traditional sequential structures. An example is provided by Conway's - 1- Clearly, languages Pascal) problem [Ben82] . by their very nature, traditional sequential- type (Fortran, Basic, Cobol and earlier versions of prove inadequate for the purposes of concurrent programming without considerable extension (which some manufacturers have provided, rendering their compilers non standard-conforming). The general convenience of high level languages provides strong motivation for their development for rea l time programming. Modula - 2 [Wir83] is but one of a number of such r ecently developed languages, designed not only to fulfil a "sequential" role but also to offer facilities for concurrent programming. Developed by Niklaus Wirth in 1979 as a successor to Pascal and Modula, it is intended to serve under the banner of a generalpurpose systems - implementation language. This thesis investigates concurrency i n Modula - 2 and takes the following form: i ) an analYSis of the concurrent facilities offered ii) problems and difficulties associated with these facilities iii) improveme nts and enhancements, including the feasibility of using Modula - 2 to simulate constructs found in other languages, such as the Hoare monitor [Hoa74] and the Ada rendezvous [Uni81]. - 2- Each section concludes with an appraisal of the work conducted in that section . The final section consists of a critical assessment of those Modula - 2 language constructs and facilities provided for the implementation of concurrency and a brief look at concurrency in Modula, Modula-2's predecessor. - Introduction.
KMBT_363
Adobe Acrobat 9.53 Paper Capture Plug-in

APA, Harvard, Vancouver, ISO, and other styles

50

Chan, Robin Isaac Man-Hang. "An Estelle-C compiler for automatic protocol implementation." Thesis, University of British Columbia, 1987. http://hdl.handle.net/2429/26184.

Full text

Abstract:

Over the past few years, much experience has been gained in semi-automatic protocol implementation using an existing Estelle-C compiler developed at the University of British Columbia. However, with the continual evolution of the Estelle language, that compiler is now obsolete. The present study found substantial syntactic and semantic differences between the Estelle language as implemented by the existing compiler and that specified in the latest ISO document to warrant the construction of a new Estelle-C compiler. The result is a new compiler which translates Estelle as defined in the second version of the ISO Draft Proposal 9074 into the programming language C. The new Estelle-C compiler addresses issues such as dynamic reconfiguration of modules and maintenance of priority relationships among nested modules. A run-time environment capable of supporting the new Estelle features is also presented. The implementation strategy used in the new Estelle-C compiler is illustrated by using the alternating bit protocol found in the ISO Draft Proposal 9074 document.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!