• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 4347
  • 1626
  • 598
  • 349
  • 331
  • 215
  • 77
  • 65
  • 64
  • 57
  • 57
  • 57
  • 57
  • 57
  • 56
  • Tagged with
  • 10626
  • 3573
  • 1740
  • 1377
  • 1317
  • 1265
  • 1211
  • 1101
  • 1070
  • 1040
  • 976
  • 931
  • 823
  • 778
  • 648
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
731

The design and implementation of a language environment for evaluating the programming task

Ku, Cyril Shiu-Chin January 1982 (has links)
The thesis describes the requirement, design, and implementation of a software package that can be used to perform quantitative studies on certain aspects of a programming task. Of specific interest are experiments with the level of interactiveness of the human-computer interface relating to program construction and with language design principles relating to identifier scope rules. The software package for conducting these experiments is an interactive language environment called PEEP. Its base language is Pascal and its design is based on Johnston's semantic models of computation. Storage representations and implementation of these semantic models are described. These models depicting the compile-time structure, run-time structure, and realization of the static and the dynamic scoping rules. The evolution and current research of programming environments, user interface to PEEP, and future research on PEEP are also focuses of attention. / Master of Science
732

The extreme point mathematical programming problem

Sen, Suvrajeet January 1982 (has links)
This dissertation deals with a class of nonconvex mathematical programs called Extreme Point Mathematical Programs (EPMP). These problems are generalizations of certain Integer Programming problems and also find their application in other nonconvex programs like the Concave Minimization problem. The research addresses the design and analysis of algorithms for EPMP. However, most of the ideas are quite general and apply to a wider class of mathematical programs including the Generalized Lattice Point Problem. We obtain a variety of cutting plane algorithms and analyze the convergence of such algorithms. Insightful examples of nonconvergence are also provided. Two finitely convergent algorithms are also presented. One of these is a cutting plane based procedure while the other is a branch and bound scheme. Computational experience with both algorithms is given. / Ph. D.
733

A structured programming preprocessor for a variety of base languages

Love, Mary L January 2011 (has links)
Typescript, etc. / Digitized by Kansas Correctional Industries
734

Community of Programming Protocols

Powell, Dave, Cook, Paul 10 1900 (has links)
ITC/USA 2009 Conference Proceedings / The Forty-Fifth Annual International Telemetering Conference and Technical Exhibition / October 26-29, 2009 / Riviera Hotel & Convention Center, Las Vegas, Nevada / As new products are developed for the telemetry market, network interfaces are being used for set-up and control. This paper describes the programmability of various telemetry components that are now available and discusses the internal status functions that can be returned to the user or telemetry system via the same interface that are good indicators of system health. Possible control interfaces are discussed that could be used to interface many different components. Also discussed is the need for the Range Commanders Council to address the total programmability protocol issues related to connecting multiple components into a common setup and control bus.
735

An investigation into program comprehensibility measures

Takang, Ako-Mbark Armstrong January 1997 (has links)
This study deals with a number of issues concerned with the derivation, use and interpretation of traditional software measures that are currently used as measures of program comprehensibility. One of the approaches that has been been suggested as a way of dealing with the software maintenance crisis is the use of software measures to assist in the management of software maintenance activities. The use of these measures has also been extended to the estimation of program comprehensibility - the level of effort needed to comprehend a program for maintenance purposes. In this thesis, it is argued that, despite the wide and continuous use of such program comprehensibility measures, they manifest a number of weaknesses that have been largely ignored despite their implications for both program comprehension and software maintenance activities. These concerns are inherent in the following characteristics of the measures: (i) inability to reflect the holistic nature of comprehension; (ii) insensitivity to the dynamic nature of the comprehension process, and (ill) insensitivity to software maintenance objectives. Furthermore, it is suggested that in order for these measures to become much more widely acceptable, valid and more representative of the phenomenon of program comprehension, these issues need to be addressed. This investigation talres the form of three studies. First, a survey of the literature and selection of measures currently used to estimate program comprehensibility. Second, a questionnaire survey of the impact of various factors on program comprehension. Finally, an observation and an experiment on programmers working on maintenance tasks, paying particular attention on the comprehension process and its outcome. The findings from these studies are discussed in the light of the weaknesses of traditional software measures as indicators of program comprehensibility. This thesis concludes by examining the wider implications of these findings and makes recommendations for further work in the area
736

Functional programming and embedded systems

Wallace, Malcolm January 1995 (has links)
No description available.
737

Graphical application and visualization of lazy functional computation

Foubister, Sandra Periam January 1995 (has links)
No description available.
738

Controlling the software development process through the techniques of software process modelling and formal methods

Proudlock, Kimberley M. January 1994 (has links)
Over the years the computing industry has enjoyed increasing levels of integration within the software which it employs: data integration; tool integration; human computer interface integration; etc. as well as the environment in which the software is used, ie. integration across a heterogeneous environment. In fact, it is the case that environments have been developed to further enhance the development of integrated software. 1bese are generally referred to as software development environments, or software factories. However, until recent years no comparable effort had been placed upon the achievement of similarly high levels of integration relating to the process by which that software is developed. Whilst environments offer the ability to share data, utilise the same tools, and present a common interface for using the tools, little regard had been given to how such integrated environments would be used by the members of the software development team in order to realise an integrated end product. It is now recognised that integration is required in the actual process of software development. Whilst software development methods such as SSADM and Yourdon go some way to achieve this, by specifying the tasks and activities required of a software development process, they are not sufficient to realise an integrated development process and hence an integrated end product. Achieving such integration within the process of developing software is the subject of the research reported in this thesis. Investigations into effecting Activity Integration, by which it is referred, reveal that current thinking is to model the activities of the software development process, providing an accurate representation of how the activities specified within that software development process would be carried out within a specific development environment. In doing so accurately depicting: tasks which depend on the completion of others; tasks which are independent of those around it; in addition to features such as iteration and selection. The product of this activity is generally referred to as a Software Process Model. Software process models have the capability of guiding members of a software development team through the activities of the software development process. It is thought that such guidance endows software process models with an advantage over existing techniques. Traditionally manuals are created to instruct developers in the use of a particular tool. Consequently in an environment consisting of many tools, many manuals are required. Additional guidance is required in the actual process of software development, method support. Again this is traditionally in the form of a manual, typically written for the purpose of instructing on all aspects of the complete method. In reality an organisation is likely to tailor the method of software development to meet the needs of an individual software development project. Accordingly what currently exists may be summed up as a 'ragbag' of manuals in addition to instructions on a general method. It is not surprising that activity integration is rarely achieved.In this work the analysis phase of the approach to software development advocated by SSADM will be represented as an informally specified software process model. To illustrate fully this modelling activity the environment is assumed to be one in which development takes place in a distributed fashion, necessitating modelling of the features inherent within such an environment, namely: sequence; selection; concurrency and iteration. Software process models will be shown to offer the capability of providing an accurate representation of how the activities of the analysis phase of SSADM may be executed within a distributed development environment. Furthermore, they will be shown to offer the flexibility to tailor a general method to meet the needs of a specific development project, in doing so providing the capability for the realisation of activity integration. However, this informal modelling technique will be shown to be inadequate for the realisation of activity integration. Although the resultant software process model is able to add considerable visibility and clarity to the 1Mb of the software development process, due to its informal nature it is not able to offer guarantees that the modelled process will be adhered to, a requirement for effecting activity integration. To overcome this issue, formal specification techniques are investigated. It will be shown that formal specification techniques, as a result of their rigorous, mathematical basis, when used to specify the 1Mb and activities of a software process model, are able to provide guarantees that the modelled process will be adhered to, and hence that activity integration will be realised. Furthermore, the ability to reason about a design and to prove properties of it, offered by formal techniques, enables guarantees to be made that the eventual implementation will be able to meet its intended aims.
739

A computational model and knowledge based system for well completion design

Dunn-Norman, Shari January 1990 (has links)
No description available.
740

A portable natural language interface from Arabic to SQL

Al-Johar, Badr January 1999 (has links)
In recent years, natural language interface systems have been built based on the Front End and the Back End architecture which gives a guarantee of modularity and portability to the system as a whole. An Arabic Front End has been built that takes an input sentence, producing syntactic and semantic representations, which it maps into First Order Logic. Expressing the meaning of the user's question in terms of high level world concepts makes the natural language interface independent of the database structure. It is then easier to port the interface Front End to a database for a different domain. The syntactic treatments are based on Generalised Phrase Structure Grammar (GPSG) whereas the semantics are expressed in formal semantics theory. The focus is mainly to provide syntactic and semantic analyses for Arabic queries based on correct Arabic linguistic principles. The proposed treatments are proved and tested by building a prototype system. The prototype is implemented using one of the existing systems called Squirrel. An Arabic morphological analyser is also proposed and implemented to distinguish between two types of morphemes: internal morphemes which are a part of the word's pattern, and external morphemes which are independent words attached to the word but which are not part of the word's pattern. So, the system focuses on the extraction of morphemes from the various inflexions or forms of any Arabic word.

Page generated in 0.1022 seconds