Dissertations / Theses: 'Programming languages (Electronic computers) Computer graphics'

1

Trout, Terry Thoke. "Design of computer animation languages /." Title page, contents and abstract only, 1990. http://web4.library.adelaide.edu.au/theses/09SM/09smt861.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Carpenter, Steven M. "Visual meta-programming language graphical user interface for generative programming." Monterey, Calif. : Springfield, Va. : Naval Postgraduate School ; Available from National Technical Information Service, 2002. http://library.nps.navy.mil/uhtbin/hyperion-image/02sep%5FCarpenter.pdf.

Full text

Abstract:

Thesis (M.S. in Computer Science)--Naval Postgraduate School, September 2002.
Thesis advisor(s): Mikhail Auguston, Richard Riehle. Includes bibliographical references (p. 89). Also available online.

APA, Harvard, Vancouver, ISO, and other styles

3

Marsden, Gary. "Designing graphical interface programming languages for the end user." Thesis, University of Stirling, 1998. http://hdl.handle.net/1893/1920.

Full text

Abstract:

This thesis sets out to answer three simple questions: What tools are available for novice programmers to program GUIs? Are those tools fulfilling their role? Can anything be done to make better tools? Despite being simple questions, the answers are not so easily constructed. In answering the first question, it was necessary to examine the range of tools available and decide upon criteria which could be used to identify tools aimed specifically at the novice programmer (there being no currently agreed criteria for their identification). Having identified these tools, it was then necessary to construct a framework within which they could be sensibly compared. The answering of the second question required an investigation of what were the successful features of current tools and which features were less successful. Success or failure of given features was determined by research in both programming language design and studies of programmer satisfaction. Having discovered what should be retained and discarded from current systems, the answering of the third question required the construction of new systems through blending elements from visual languages, program editors and fourth generation languages. These final prototypes illustrate a new way of thinking about and constructing the next generation of GUI programming languages for the novice.

APA, Harvard, Vancouver, ISO, and other styles

4

Lewis, E. Christopher. "Achieving robust performance in parallel programming languages /." Thesis, Connect to this title online; UW restricted, 2001. http://hdl.handle.net/1773/6996.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

VAKILZADIAN, HAMID. "DESIGN OF PORTABLE DIRECT EXECUTING LANGUAGES FOR INTERACTIVE SIMULATION." Diss., The University of Arizona, 1985. http://hdl.handle.net/10150/188106.

Full text

Abstract:

DESIRE P is a general purpose continuous time simulation language suitable for interactive simulation, dynamic system study, mathematical modeling, process control analysis. It includes an interactive editor, file manipulation facilities, and graphic packages, making it a completely self-contained system. The PDP-11 version of DESIRE P handles 20 state variables, while the VAX/VMS version runs 150 or more. An interpreted job-control language serves for interactive program entry, editing and file operations, and for programming multirun simulation studies. The dynamic segment, containing differential equations in first-order form, is entered just like the job-control statments and accesses the same variables. DESIRE P is largely written in PASCAL, and most of it can be transferred to different computers, with little change. The PASCAL implementation proves that the high-level language can be used to program direct executing languages, still keeping efficiency and speed comparable to assembly language. The runtime compiler of DESIRE P generates fast and efficient code. DESIRE P can incorporate existing and new precompiled FORTRAN numerical integration algorithms.

APA, Harvard, Vancouver, ISO, and other styles

6

Chronaki, Catherine Eleftherios. "Parallelism in declarative languages /." Online version of thesis, 1990. http://hdl.handle.net/1850/10793.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Olsson, Ronald Arthur. "ISSUES IN DISTRIBUTED PROGRAMMING LANGUAGES: THE EVOLUTION OF SR (CONCURRENT)." Diss., The University of Arizona, 1986. http://hdl.handle.net/10150/183888.

Full text

Abstract:

This dissertation examines fundamental issues that face the designers of any distributed programming language. It considers how programs are structured, how processes communicate and synchronize, and how hardware failures are represented and handled. We discuss each of these issues and argue for a particular approach based on our application domain: distributed systems (such as distributed operating systems) and distributed user applications. We conclude that a language for such applications should include the following mechanisms: dynamic modules, shared variables (within a module), dynamic processes, synchronous and asynchronous forms of message passing, rendezvous, concurrent invocation, and early reply. We then describe the current SR language, which has evolved considerably based on our experience. SR provides the above mechanisms in a way that is expressive yet simple. SR resolves the tension between expressiveness and simplicity by providing a variety of mechanisms based on only a few underlying concepts. The main language constructs are still resources and operations. Resources encapsulate processes and the variables they share; operations provide the primary mechanism for process interaction. One way in which SR has changed is that both resources and processes are now created dynamically. Another change is that all the common mechanisms for process interaction--local and remote procedure call, rendezvous, dynamic process creation, asynchronous message passing, and semaphores--are now supported by a novel integration of the mechanisms for invoking and servicing operations. Many small and several larger examples illustrate SR's mechanisms and the interplay between them; these examples also demonstrate the language's expressiveness and flexibility. We then describe our implementation of SR. The compiler, linker, and run-time support are summarized. We then focus on how the generated code and run-time support interact to provide dynamic resources and to generate and service invocations. We also describe optimizations for certain operations. Measurements of the implementation's size and cost are given. The implementation has been in use since November 1985 and is currently being improved. Finally, we justify SR's syntax and semantics and examine how its mechanisms compare to other approaches to distributed programming. We also discuss how SR balances expressiveness, simplicity, and efficiency.

APA, Harvard, Vancouver, ISO, and other styles

8

Horne, Ross J. "Programming languages and principles for read-write linked data." Thesis, University of Southampton, 2011. https://eprints.soton.ac.uk/210899/.

Full text

Abstract:

This work addresses a gap in the foundations of computer science. In particular, only a limited number of models address design decisions in modern Web architectures. The development of the modern Web architecture tends to be guided by the intuition of engineers. The intuition of an engineer is probably more powerful than any model; however, models are important tools to aid principled design decisions. No model is sufficiently strong to provide absolute certainty of correctness; however, an architecture accompanied by a model is stronger than an architecture accompanied solely by intuition lead by the personal, hence subjective, subliminal ego. The Web of Data describes an architecture characterised by key W3C standards. Key standards include a semi-structured data format, entailment mechanism and query language. Recently, prominent figures have drawn attention to the necessity of update languages for the Web of Data, coining the notion of Read–Write Linked Data. A dynamicWeb of Data with updates is a more realistic reflection of the Web. An established and versatile approach to modelling dynamic languages is to define an operational semantics. This work provides such an operational semantics for a Read–Write Linked Data architecture. Furthermore, the model is sufficiently general to capture the established standards, including queries and entailments. Each feature is relative easily modelled in isolation; however a model which checks that the key standards socialise is a greater challenge to which operational semantics are suited. The model validates most features of the standards while raising some serious questions. Further to evaluating W3C standards, the operational mantics provides a foundation for static analysis. One approach is to derive an algebra for the model. The algebra is proven to be sound with respect to the operational semantics. Soundness ensures that the algebraic rules preserve operational behaviour. If the algebra establishes that two updates are equivalent, then they have the same operational capabilities. This is useful for optimisation, since the real cost of executing the updates may differ, despite their equivalent expressive powers. A notion of operational refinement is discussed, which allows a non-deterministic update to be refined to a more deterministic update. Another approach to the static analysis of Read–Write Linked Data is through a type system. The simplest type system for this application simply checks that well understood terms which appear in the semi-structured data, such as numbers and strings of characters, are used correctly. Static analysis then verifies that basic runtime errors in a well typed program do not occur. Type systems for URIs are also investigated, inspired by W3C standards. Type systems for URIs are controversial, since URIs have no internal structure thus have no obvious non-trivial types. Thus a flexible type system which accommodates several approaches to typing URIs is proposed.

APA, Harvard, Vancouver, ISO, and other styles

9

Muff, Urs C. "Backtracking model languages /." Access author, 2000.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Roe, Paul. "Parallel programming using functional languages." Thesis, Connect to e-thesis, 1991. http://theses.gla.ac.uk/1052.

Full text

APA, Harvard, Vancouver, ISO, and other styles

11

Fritsch, Joerg. "Functional programming languages in computing clouds : practical and theoretical explorations." Thesis, Cardiff University, 2016. http://orca.cf.ac.uk/96984/.

Full text

Abstract:

Cloud platforms must integrate three pillars: messaging, coordination of workers and data. This research investigates whether functional programming languages have any special merit when it comes to the implementation of cloud computing platforms. This thesis presents the lightweight message queue CMQ and the DSL CWMWL for the coordination of workers that we use as artefact to proof or disproof the special merit of functional programming languages in computing clouds. We have detailed the design and implementation with the broad aim to match the notions and the requirements of computing clouds. Our approach to evaluate these aims is based on evaluation criteria that are based on a series of comprehensive rationales and specifics that allow the FPL Haskell to be thoroughly analysed. We find that Haskell is excellent for use cases that do not require the distribution of the application across the boundaries of (physical or virtual) systems, but not appropriate as a whole for the development of distributed cloud based workloads that require communication with the far side and coordination of decoupled workloads. However, Haskell may be able to qualify as a suitable vehicle in the future with future developments of formal mechanisms that embrace non-determinism in the underlying distributed environments leading to applications that are anti-fragile rather than applications that insist on strict determinism that can only be guaranteed on the local system or via slow blocking communication mechanisms.

APA, Harvard, Vancouver, ISO, and other styles

12

Vikhorev, Konstantin. "Real-time guarantees in high-level agent programming languages." Thesis, University of Nottingham, 2011. http://eprints.nottingham.ac.uk/13036/.

Full text

Abstract:

In the thesis we present a new approach to providing soft real-time guarantees for Belief-Desire-Intention (BDI) agents. We analyse real-time guarantees for BDI agents and show how these can be achieved within a generic BDI programming framework. As an illustration of our approach, we develop a new agent architecture, called AgentSpeak(RT), and its associated programming language, which allows the development of real-time BDI agents. AgentSpeak(RT) extends AgentSpeak(L) [28] intentions with deadlines which specify the time by which the agent should respond to an event, and priorities which specify the relative importance of responding to a particular event. The AgentSpeak(RT) interpreter commits to a priority-maximal set of intentions: a set of intentions that is maximally feasible while preferring higher priority intentions. Real-time tasks can be freely mixed with tasks for which no deadline and/or priority has been specified, and if no deadlines and priorities are specified, the behavior of the agent defaults to that of a non real-time BDI agent. We perform a detailed case study of the use of AgentSpeak(RT) to demonstrate its advantages. This case study involves the development of an intelligent control system for a simple model of a nuclear power plant. We also prove some properties of the AgentSpeak(RT) architecture such as guaranteed reactivity delay of the AgentSpeak(RT) interpreter and probabilistic guarantees of successful execution of intentions by their deadlines. We extend the AgentSpeak(RT) architecture to allow the parallel execution of intentions. We present a multitasking approach to the parallel execution of intentions in the AgentSpeak(RT) architecture. We demonstrate advantages of parallel execution of intentions in AgentSpeak(RT) by showing how it improves behaviour of the intelligent control system for the nuclear power plant. We prove real-time guarantees of the extended AgentSpeak(RT) architecture. We present a characterisation of real-time task environments for an agent, and describe how it relates to AgentSpeak(RT) execution time profiles for a plan and an action. We also show a relationship between the estimated execution time of a plan in a particular environment and the syntactic complexity of an agent program.

APA, Harvard, Vancouver, ISO, and other styles

13

Message, Robin Henry. "Programming for humans : a new paradigm for domain-specific languages." Thesis, University of Cambridge, 2013. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.608120.

Full text

APA, Harvard, Vancouver, ISO, and other styles

14

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

15

Vorthmann, Scott A. "Syntax-directed editor support for incremental consistency maintenance." Diss., Georgia Institute of Technology, 1990. http://hdl.handle.net/1853/9241.

Full text

APA, Harvard, Vancouver, ISO, and other styles

16

Davidson, Joseph Ray. "An information theoretic approach to the expressiveness of programming languages." Thesis, University of Glasgow, 2016. http://theses.gla.ac.uk/7200/.

Full text

Abstract:

The conciseness conjecture is a longstanding notion in computer science that programming languages with more built-in operators, that is more expressive languages with larger semantics, produce smaller programs on average. Chaitin defines the related concept of an elegant program such that there is no smaller program in some language which, when run, produces the same output. This thesis investigates the conciseness conjecture in an empirical manner. Influenced by the concept of elegant programs, we investigate several models of computation, and implement a set of functions in each programming model. The programming models are Turing Machines, λ-Calculus, SKI, RASP, RASP2, and RASP3. The information content of the programs and models are measured as characters. They are compared to investigate hypotheses relating to how the mean program size changes as the size of the semantics change, and how the relationship of mean program sizes between two models compares to that between the sizes of their semantics. We show that the amount of information present in models of the same paradigm, or model family, is a good indication of relative expressivity and average program size. Models that contain more information in their semantics have smaller average programs for the set of tested functions. In contrast, the relative expressiveness of models from differing paradigms, is not indicated by their relative information contents. RASP and Turing Machines have been implemented as Field Programmable Gate Array (FPGA) circuits to investigate hardware analogues of the hypotheses above. Namely that the amount of information in the semantics for a model directly influences the size of the corresponding circuit, and that the relationship of mean circuit sizes between models is comparable to the relationship of mean program sizes. We show that the number of components in the circuits that realise the semantics and programs of the models correlates with the information required to implement the semantics and program of a model. However, the number of components to implement a program in a circuit for one model does not relate to the number of components implementing the same program in another model. This is in contrast to the more abstract implementations of the programs. Information is a computational resource and therefore follows the rules of Blum’s axioms. These axioms and the speedup theorem are used to obtain an alternate proof of the undecidability of elegance. This work is a step towards unifying the formal notion of expressiveness with the notion of algorithmic information theory and exposes a number of interesting research directions. A start has been made on integrating the results of the thesis with the formal framework for the expressiveness of programming languages.

APA, Harvard, Vancouver, ISO, and other styles

17

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

18

Owens, Darryl. "A generic framework facilitating automated quality assurance across programming languages of disparate paradigms." Thesis, Edge Hill University, 2016. http://repository.edgehill.ac.uk/7778/.

Full text

Abstract:

This research aims to outline a framework based on procedural and object-oriented Paradigms that facilitates generic automated quality assurance. Along with the outline, a skeleton framework has been developed to evaluate the research, and the final aim is to expand the footprint of the framework; theoretical inclusion of other programming paradigms has been discussed. This research developed a taxonomy of quality assurance techniques in order to identify potential candidates for generic quality assurance and also to minimise experimental requirements, as the taxonomy categories are generated based on implementation requirements; this means that a category can be deemed feasible within the scope of this framework if a single technique can be implemented. The novel aspects of this research are the taxonomy, paradigm-specific framework, and finally the theorised paradigm-generic framework. An experimental method has been used to provide evidence to support the claims made by this research, which is accompanied by a study of literature providing a foundation for all areas discussed. Although a paradigm-generic framework can be achieved, the internal representation used in this research showed that application of the logical paradigm would not be simple and has little benefit in the scope of automated quality assurance. This being said, procedural, object-oriented, and functional paradigms have been demonstrated as feasible with significant impact on programming language development and automated quality assurance of software.

APA, Harvard, Vancouver, ISO, and other styles

19

Kirby, Graham N. C. "Reflection and hyper-programming in persistent programming systems." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/1673.

Full text

Abstract:

In an orthogonally persistent programming system, data is treated in a manner independent of its persistence. This gives simpler semantics, allows the programmer to ignore details of long-term data storage and enables type checking protection mechanisms to operate over the entire lifetime of the data. The ultimate goal of persistent programming language research is to reduce the costs of producing software. The work presented in this thesis seeks to improve programmer productivity in the following ways: • by reducing the amount of code that has to be written to construct an application; • by increasing the reliability of the code written; and • by improving the programmer’s understanding of the persistent environment in which applications are constructed. Two programming techniques that may be used to pursue these goals in a persistent environment are type-safe linguistic reflection and hyper-programming. The first provides a mechanism by which the programmer can write generators that, when executed, produce new program representations. This allows the specification of programs that are highly generic yet depend in non-trivial ways on the types of the data on which they operate. Genericity promotes software reuse which in turn reduces the amount of new code that has to be written. Hyper-programming allows a source program to contain links to data items in the persistent store. This improves program reliability by allowing certain program checking to be performed earlier than is otherwise possible. It also reduces the amount of code written by permitting direct links to data in the place of textual descriptions. Both techniques contribute to the understanding of the persistent environment through supporting the implementation of store browsing tools and allowing source representations to be associated with all executable programs in the persistent store. This thesis describes in detail the structure of type-safe linguistic reflection and hyper-programming, their benefits in the persistent context, and a suite of programming tools that support reflective programming and hyper-programming. These tools may be used in conjunction to allow reflection over hyper-program representations. The implementation of the tools is described.

APA, Harvard, Vancouver, ISO, and other styles

20

Baird, Michael H. "An initial development and demonstration of a sentence-structured computer language for control application." Ohio : Ohio University, 1986. http://www.ohiolink.edu/etd/view.cgi?ohiou1183127167.

Full text

APA, Harvard, Vancouver, ISO, and other styles

21

Diatchki, Iavor Sotirov. "High-level abstractions for low-level programming /." Full text open access at:, 2007. http://content.ohsu.edu/u?/etd,227.

Full text

APA, Harvard, Vancouver, ISO, and other styles

22

Goff, Windell H. "Programming wizards generating syntax-free conceptual editors /." Morgantown, W. Va. : [West Virginia University Libraries], 1999. http://etd.wvu.edu/templates/showETD.cfm?recnum=536.

Full text

Abstract:

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

APA, Harvard, Vancouver, ISO, and other styles

23

Dean, Jeffrey A. "Whole-program optimization of object-oriented languages /." Thesis, Connect to this title online; UW restricted, 1996. http://hdl.handle.net/1773/6983.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Lee, Jinho. "Architecture for a low-level functional specification language supporting multimodeling and simulation." [Gainesville, Fla.] : University of Florida, 2005. http://purl.fcla.edu/fcla/etd/UFE0011609.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Farkas, Alex Miklós. "Program construction and evolution in a persistent integrated programming environment /." Title page, contents and abstract only, 1995. http://web4.library.adelaide.edu.au/theses/09PH/09phf229.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

26

Pittges, Jeff. "Metadata view graphs : a framework for query optimization and metadata management." Diss., Georgia Institute of Technology, 1995. http://hdl.handle.net/1853/9256.

Full text

APA, Harvard, Vancouver, ISO, and other styles

27

Coleman, Jason. "Thesis shmesis representing reduplication with directed graphs /." Diss., Connect to the thesis, 2004. http://hdl.handle.net/10066/1482.

Full text

APA, Harvard, Vancouver, ISO, and other styles

28

李詠康 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

29

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

30

Wu, Xiaoqing. "Component-based language implementation with object-oriented syntax and aspect-oriented semantics." Birmingham, Ala. : University of Alabama at Birmingham, 2007. http://www.mhsl.uab.edu/dt/2007p/wu.pdf.

Full text

Abstract:

Thesis (Ph. D.)--University of Alabama at Birmingham, 2007.
Additional advisors: Jeff Gray, Marjan Mernik, Alan Sprague, Murat Tanik. Description based on contents viewed June 25, 2007; title from title screen. Includes bibliographical references (p. 132-138).

APA, Harvard, Vancouver, ISO, and other styles

31

Munden, Gilliad E. "Concurrency Issues in Programmable Brick Languages." Fogler Library, University of Maine, 2000. http://www.library.umaine.edu/theses/pdf/MundenGE2000.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

32

Moss, William B. "Evaluating inherited attributes using Haskell and lazy evaluation." Diss., Connect to the thesis, 2005. http://hdl.handle.net/10066/1486.

Full text

APA, Harvard, Vancouver, ISO, and other styles

33

White, Steven John. "A portable natural language database query system." Thesis, University of British Columbia, 1985. http://hdl.handle.net/2429/25066.

Full text

Abstract:

With the increased use of computerized databases, the ability to allow users to access information using natural language is becoming more desirable. There are many natural language systems in existence today. The main problem with these systems is the amount of expertise and effort required to adapt them to a new domain. The design of a portable natural language front-end to a relational database is described in this thesis. It is designed so that a typical Database Administrator can implement a new domain in a reasonable amount of time. Database portability has been achieved by separating the domain dependent natural language definitions from the domain independent definitions. These domain dependent definitions are specified in the database schema, which is structured to extract the semantics contained in the structure of the actual database. A rich supply of standard definitions are available to both aid in the development of the database schema and to help force consistency amongst database domains.
Science, Faculty of
Computer Science, Department of
Graduate

APA, Harvard, Vancouver, ISO, and other styles

34

Pasalic, Emir. "The role of type equality in meta-programming /." Full text open access at:, 2004. http://content.ohsu.edu/u?/etd,216.

Full text

APA, Harvard, Vancouver, ISO, and other styles

35

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

36

Perlin, Hugo Alberto. "A contribution to semantic description of images and videos: an application of soft biometrics." Universidade Tecnológica Federal do Paraná, 2015. http://repositorio.utfpr.edu.br/jspui/handle/1/1808.

Full text

Abstract:

Fundação Araucária
Os seres humanos possuem uma alta capacidade de extrair informações de dados visuais, adquiridos por meio da visão. Através de um processo de aprendizado, que se inicia ao nascer e continua ao longo da vida, a interpretação de imagens passa a ser feita de maneira quase instintiva. Em um relance, uma pessoa consegue facilmente descrever com certa precisão os componentes principais que compõem uma determinada cena. De maneira geral, isto é feito extraindo-se características de baixo nível, como arestas, texturas e formas, e associando-as com significados de alto nível. Ou seja, realiza-se uma descrição semântica desta cena. Um exemplo disto é a capacidade de reconhecer outras pessoas e descrever suas características físicas e comportamentais. A área de visão computacional tem como principal objetivo desenvolver métodos capazes de realizar interpretação visual com desempenho similar aos humanos. Estes métodos englobam conhecimento de aprendizado de máquina e processamento de imagens. Esta tese tem como objetivo propor métodos de visão computacional que permitam a extração de informações de alto nível na forma de biometrias leves. Estas biometrias representam características inerentes ao corpo e ao comportamento humano. Porém, não permitem a identificação unívoca de uma pessoa. Para tanto, este problema foi abordado de duas formas, aprendizado não-supervisionado e supervisionado. A primeira busca agrupar as imagens através de um processo de aprendizado automático de extração de características, empregando técnicas de convoluções, computação evolucionária e clusterização. Nesta abordagem as imagens utilizadas contém faces e pessoas. A segunda abordagem emprega redes neurais convolucionais, que possuem a capacidade de operar sobre imagens cruas, aprendendo tanto o processo de extração de características quanto a classificação. Aqui as imagens são classificadas de acordo com gênero e roupas, divididas em parte superior e inferior do corpo humano. A primeira abordagem, quando testada com diferentes bancos de imagens, obteve uma acurácia de aproximadamente 80% para faces e não-faces e 70% para pessoas e não-pessoas. A segunda, testada utilizando imagens e vídeos, obteve uma acurácia de cerca de 70% para gênero, 80% para roupas da parte superior e 90% para a parte inferior. Os resultados destes estudos de casos, mostram que os métodos propostos são promissores, permitindo a realização de anotação automática de informações de alto nível. Isto abre possibilidades para o desenvolvimento de aplicações em diversas áreas, como busca de imagens e vídeos baseada em conteúdo e segurança por vídeo, reduzindo o esforço humano nas tarefas de anotação manual e monitoramento.
Humans have a high ability to extract visual data information acquired by sight. Trought a learning process, which starts at birth and continues throughout life, image interpretation becomes almost instinctively. At a glance, one can easily describe a scene with reasonable precision, naming its main components. Usually, this is done by extracting low-level features such as edges, shapes and textures, and associanting them to high level meanings. In this way, a semantic description of the scene is done. An example of this, is the human capacity to recognize and describe other people physical and behavioral characteristics, or biometrics. Soft-biometrics also represents inherent characteristics of human body and behaviour, but do not allow unique person identification. Computer vision area aims to develop methods capable of performing visual interpretation with performance similar to humans. This thesis aims to propose computer vison methods which allows high level information extraction from images in the form of soft biometrics. This problem is approached in two ways, unsupervised and supervised learning methods. The first seeks to group images via an automatic feature extraction learning , using both convolution techniques, evolutionary computing and clustering. In this approach employed images contains faces and people. Second approach employs convolutional neural networks, which have the ability to operate on raw images, learning both feature extraction and classification processes. Here, images are classified according to gender and clothes, divided into upper and lower parts of human body. First approach, when tested with different image datasets obtained an accuracy of approximately 80% for faces and non-faces and 70% for people and non-person. The second tested using images and videos, obtained an accuracy of about 70% for gender, 80% to the upper clothes and 90% to lower clothes. The results of these case studies, show that proposed methods are promising, allowing the realization of automatic high level information image annotation. This opens possibilities for development of applications in diverse areas such as content-based image and video search and automatica video survaillance, reducing human effort in the task of manual annotation and monitoring.

APA, Harvard, Vancouver, ISO, and other styles

37

Salah, Maher M. Mancoridis Spiros. "An environment for comprehending the behavior of software systems /." Philadelphia, Pa. : Drexel University, 2005. http://dspace.library.drexel.edu/handle/1860/516.

Full text

APA, Harvard, Vancouver, ISO, and other styles

38

Lopez, Gustavo. "The design and implementation of Kaleidoscope, a constraint imperative programming language /." Thesis, Connect to this title online; UW restricted, 1997. http://hdl.handle.net/1773/6928.

Full text

APA, Harvard, Vancouver, ISO, and other styles

39

Mansfield, Martin F. "Design of a generic parse tree for imperative languages." Virtual Press, 1992. http://liblink.bsu.edu/uhtbin/catkey/834617.

Full text

Abstract:

Since programs are written in many languages and design documents are not maintained (if they ever existed), there is a need to extract the design and other information that the programs represent. To do this without writing a separate program for each language, a common representation of the symbol table and parse tree would be required.The purpose of the parse tree and symbol table will not be to generate object code but to provide a platform for analysis tools. In this way the tool designer develops only one version instead of separate versions for each language. The generic symbol table and generic parse tree may not be as detailed as those same structures in a specific compiler but the parse tree must include all structures for imperative languages.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

40

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

41

Huang, Shan Shan. "Structural abstraction." Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29632.

Full text

Abstract:

Thesis (Ph.D)--Computing, Georgia Institute of Technology, 2010.
Committee Chair: Yannis Smaragdakis; Committee Member: Oege de Moor; Committee Member: Richard LeBlanc; Committee Member: Santosh Pande; Committee Member: Spencer Rugaber. Part of the SMARTech Electronic Thesis and Dissertation Collection.

APA, Harvard, Vancouver, ISO, and other styles

42

Kondo, Boubacar. "An investigation of parallel algorithms developed for graph problems and their implementation on parallel computers." Virtual Press, 1991. http://liblink.bsu.edu/uhtbin/catkey/770951.

Full text

Abstract:

With the recent development of VLSI (Very Large Scale Integration) technology, research has increased considerably on the development of efficient parallel algorithms for solutions of practical graph problems. Varieties of algorithms have already been implemented on different models of parallel computers. But not too much is known yet about the question of which model of parallel computer will efficiently and definitely fit every graph problem. In this investigation the study will focus on a comparative analysis of speedup and efficiency of parallel algorithms with parallel model of computation, and with respect to some sequential algorithms.
Department of Computer Science

APA, Harvard, Vancouver, ISO, and other styles

43

Edwards, Carleen Marie. "Representation and simulation of a high level language using VHDL." Thesis, This resource online, 1994. http://scholar.lib.vt.edu/theses/available/etd-11242009-020306/.

Full text

APA, Harvard, Vancouver, ISO, and other styles

44

Sos, Garrett Tim 1959. "Design of an object-oriented language syntax for UIL, the User Interface Language of the Space Station FREEDOM." Thesis, The University of Arizona, 1989. http://hdl.handle.net/10150/277182.

Full text

Abstract:

The design of a new computer language, called the User Interface Language (UIL), is analyzed and evaluated by coding a representative procedure. UIL will provide the man-machine interface for command procedures on the Space Station FREEDOM. The UIL procedure written is modeled after an operational procedure used in the Space Shuttle program. This work provides a concrete test case to verify that UIL can be used to implement procedures for the Space Station. The object oriented approach taken with UIL is based on the successful application of these concepts for a variety of other software tools in operation today. Three major enhancements are proposed in this thesis: event handlers, data structures, and class/object creation capabilities. The addition of these capabilities changes the character of UIL from an object manipulation language to an object based language. The new capabilities, if adopted, will profoundly change the future of UIL.

APA, Harvard, Vancouver, ISO, and other styles

45

Knight, James 1979. "Parameterized types for GOO." Thesis, Massachusetts Institute of Technology, 2002. http://hdl.handle.net/1721.1/29657.

Full text

Abstract:

Thesis (M.Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2002.
Includes bibliographical references (p. 65-66).
An often-useful addition to many programming languages is a generic type or parameterized type system. I have added support for a parameterized type system to the programming language "GOO". Besides the standard functionality, I have allowed the programmer to express some unique relationships between parameterized types that are generally inexpressible in a standard type system, in order to make the system applicable to a wider variety of situations. I have also added a unification system to the method dispatch in GOO in order to allow the relationship between the types of multiple arguments in a method signature to be expressed.
by James Knight.
M.Eng.

APA, Harvard, Vancouver, ISO, and other styles

46

Van, Riet F. A. "LF : a language for reliable embedded systems." Thesis, Stellenbosch : Stellenbosch University, 2001. http://hdl.handle.net/10019.1/52322.

Full text

Abstract:

Thesis (MSc)--University of Stellenbosch, 2001.
ENGLISH ABSTRACT: Computer-aided verification techniques, such as model checking, are often considered essential to produce highly reliable software systems. Modern model checkers generally require models to be written in eSP-like notations. Unfortunately, such systems are usually implemented using conventional imperative programming languages. Translating the one paradigm into the other is a difficult and error prone process. If one were to program in a process-oriented language from the outset, the chasm between implementation and model could be bridged more readily. This would lead to more accurate models and ultimately more reliable software. This thesis covers the definition of a process-oriented language targeted specifically towards embedded systems and the implementation of a suitable compiler and run-time system. The language, LF, is for the most part an extension of the language Joyce, which was defined by Brinch Hansen. Both LF and Joyce have features which I believe make them easier to use than other esp based languages such as occam. An example of this is a selective communication primitive which allows for both input and output guards which is not supported in occam. The efficiency of the implementation is important. The language was therefore designed to be expressive, but constructs which are expensive to implement were avoided. Security, however, was the overriding consideration in the design of the language and runtime system. The compiler produces native code. Most other esp derived languages are either interpreted or execute as tasks on host operating systems. Arguably this is because most implementations of esp and derivations thereof are for academic purposes only. LF is intended to be an implementation language. The performance of the implementation is evaluated in terms of practical metries such as the time needed to complete communication operations and the average time needed to service an interrupt.
AFRIKAANSE OPSOMMING: Rekenaar ondersteunde verifikasietegnieke soos programmodellering, is onontbeerlik in die ontwikkeling van hoogs betroubare programmatuur. In die algemeen, aanvaar programme wat modelle toets eSP-agtige notasie as toevoer. Die meeste programme word egter in meer konvensionele imperatiewe programmeertale ontwikkel. Die vertaling vanuit die een paradigma na die ander is 'n moelike proses, wat baie ruimte laat vir foute. Indien daar uit die staanspoor in 'n proses gebaseerde taal geprogrammeer word, sou die verwydering tussen model en program makliker oorbrug kon word. Dit lei tot akkurater modelle en uiteindelik tot betroubaarder programmatuur. Die tesis ondersoek die definisie van 'n proses gebaseerde taal, wat gemik is op ingebedde programmatuur. Verder word die implementasie van 'n toepaslike vertaler en looptyd omgewing ook bespreek. Die taal, LF, is grotendeels gebaseer op Joyce, wat deur Brinch Hansen ontwikkel is. Joyce en op sy beurt LF, is verbeterings op ander esp verwante tale soos occam. 'n Voorbeeld hiervan is 'n selektiewe kommunikasieprimitief wat die gebruik van beide toevoer- en afvoerwagte ondersteun. Omdat 'n effektiewe implementasie nagestreef word, is die taalontwerp om so nadruklik moontlik te wees, sonder om strukture in te sluit wat oneffektief is om te implementeer. Sekuriteit was egter die oorheersende oorweging in die ontwerp van die taal en looptyd omgewing. Die vertaler lewer masjienkode, terwyl die meeste ander implementasies van eSP-agtige tale geinterpreteer word of ondersteun word as prosesse op 'n geskikte bedryfstelsel- die meeste eSP-agtige tale word slegs vir akademiese doeleindes aangewend. LF is by uitstek ontwerp as implementasie taal. Die evaluasie van die stelsel se werkverrigting is gedoen aan die hand van praktiese maatstawwe soos die tyd wat benodig word vir kommunikasie, sowel as die gemiddelde tyd benodig vir die hantering van onderbrekings.

APA, Harvard, Vancouver, ISO, and other styles

47

Graunke, Kenneth William. "Extensible Scheduling in a Haskell-based Operating System." PDXScholar, 2010. https://pdxscholar.library.pdx.edu/open_access_etds/1.

Full text

Abstract:

This thesis presents Lighthouse, an experimental branch of the Haskell-based House operating system which integrates Li et al.'s Lightweight Concurrency framework. First and foremost, it improves House's viability as a "real operating system" by providing a new extensible scheduler framework which makes it easy to experiment with different scheduling policies. In particular, Lighthouse extends Concurrent Haskell with thread priority and implements a priority-based scheduler which significantly improves system responsiveness when compared with GHC's normal round-robin scheduler. Even while doing this, it improves on House's claim of being "written in Haskell" by moving a whole subsystem out of the complex C-based runtime system and into Haskell itself. In addition, Lighthouse also includes an alternate, simpler implementation of Lightweight Concurrency which takes advantage of House's unique setting (running directly on uniprocessor x86 hardware). This experience sheds light on areas that need further attention before the system can truly be viable---primarily interactions between blackholing and interrupt handling. In particular, this thesis uncovers a potential case of self-deadlock and suggests potential solutions. Finally, this work offers further insight into the viability of using high-level languages such as Haskell for systems programming. Although laziness and blackholing present unique problems, many parts of the system are still much easier to express in Haskell than traditional languages such as C.

APA, Harvard, Vancouver, ISO, and other styles

48

Liang, Donglin. "Developing practical program analyses for programs with pointers." Diss., Georgia Institute of Technology, 2002. http://hdl.handle.net/1853/8203.

Full text

APA, Harvard, Vancouver, ISO, and other styles

49

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

50

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

Dissertations / Theses on the topic 'Programming languages (Electronic computers) Computer graphics'

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