School of Computing: Recent submissions

  • Ideologies of information systems and technology 
    Introna, LD (South African Computer Society (SAICSIT), 1994)
    In this paper some views and ideologies of information systems and technology will be explored. Some of these views and ideologies are clearly understood and have a high level of support. There are however more subtle ...
  • EDI in South Africa : An assessment of the costs and benefits 
    Harrington, G (South African Computer Society (SAICSIT), 1994)
    EDI is a method of exchanging common business documentation between organisations by replacing paper transactions with electronic messages. The use of EDI can eliminate or significantly reduce the problems associated with ...
  • Ensuring successful IT utilisation in developing countries 
    Gardner, BR (South African Computer Society (SAICSIT), 1994)
    It is generally accepted that Information Technology (IT) has the potential to promote development and alleviate some of the common problems in the developing countries. However, it would appear that few developing countries ...
  • Effect of system and team size on 4GL software development productivity 
    Finnie, G.R.; Wittig, GE (South African Computer Society (SAICSIT), 1994)
    Modelling the effect of size on software development issues has been the object of considerable research in the software engineering community. The size metrics form an integral part of software project cost estimation ...
  • An evaluation of substring algorithms that determine similarity between surnames 
    De Kock, G de V; Du Plessis, C (South African Computer Society (SAICSIT), 1994)
    The problem investigated in this study is, given a surname, determine similar surnames in a genealogical database. There exist a number of algorithms to determine the similarity between two strings based on their common ...
  • What is information systems? 
    Crossman, T.D. (South African Computer Society (SAICSIT), 1994)
    This paper is an attempt to answer the question 'What is Information Systems?' While the characteristics of both a science and a non-science can be identified in Information Systems (IS), it is argued here that it is not ...
  • Metadata and security management in a persistent store 
    Berman, Sonia (South African Computer Society (SAICSIT), 1994)
    Since its emergence in the early eighties, persistence has become an important branch of Computer Science. Many persistent systems have now been developed and a wide variety of related issues have been well researched. Two ...
  • Markovian analysis of DQDB MAC protocol 
    Bause, F; Kritzinger, P; Sczittnick, M (South African Computer Society (SAICSIT), 1994)
    The Distributed Queue Dual Bus (DQDB) protocol or IEEE 802.6 has been accepted as the international standard for Metropolitan Area Networks (MAN). This paper describes a combined MIG/I and Markov model for the steady state ...
  • Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001 
    Handley, C.C. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The problem of finding all prime numbers less than some specified maximum is frequently set as an exercise to beginning programmers, particular students doing their first programming course at University. Several ...
  • A persistent programming language: preliminary Report 
    Berman, Sonia (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    A persistent programming language PPL is currently being designed at the University of Cape Town. The language treats persistence (permanent storage) as an orthogonal property of data and is consistent in its treatment of ...
  • A summation problem 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    This paper suggests a method to minimize the roundoff errors of adding N positive nimbers. The idea of construction can be easily applied to a linear recurrence process.
  • Some remarks on deleting a node from a binary tree 
    Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
  • An Alternative Development of the Vienna Data Structures 
    Philips, N.C.K. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    This paper presents an axiomatic specification of a data type which is shown to be equivalent to the Vienna data structures. The advantage of this alternative approach is its obvious simplicity.
  • Research directions in information systems 
    Mende, J. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The success of a research project depends upon the inputs and outputs selected by the researcher, a poor choice entailing useless results or wasted efforts.To avoid this one might consider the following alternatives: t. ...
  • Modeller : a DSS for experimental study of Human-computer interaction 
    Finnie, G.R. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    This paper describes the structure of a simple nonprocedural financial modelling system designed to collect a variety of statistics on aspects of novice interaction with decision support systems. Some findings on the use ...
  • The SECD Machine : An Introduction 
    Dempster, Robert (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The S(tack), E(nvironment), C(ontrol) and D(ump) machine was invented by Landin (1964) to perform the mechanical evaluation of symbolic expressions. The evaluation of an expression invariably involves the application of ...
  • Ways of Assessing Programming Skills 
    Bishop, J.M. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The programming skills taught in first year computer science courses are more difficult to assess than the skills in older science courses because of the very large numbers of students involved coupled with material ...
  • Introduction to computability theory 
    Zucker, J; Pretorius, L (South African Computer Society (SAICSIT), 1993)
    These are notes for a short introductory course on Computability Theory (or recursive function theory). The basic notion of computability is defined in terms of a simple imperative programming language.
  • A working relational model: The derivation of the Dijkstra-Scholten predicate transformer semantics from Tarski's axioms for the Peirce-Schroder calculus of relations 
    Maddux, RD (South African Computer Society (SAICSIT), 1993)
    The definitions for Dijkstra's predicate transformer semantics can be justified by considering the meaning of a program as a binary relation on states (which holds between two states if there is a terminating computation ...
  • Denotational semantics and domain theory 
    Goslett, J.; Hulley, H; Melton, A (South African Computer Society (SAICSIT), 1993)
    This tutorial is an introduction to denotational semantics and domain theory. For this reason the presentation is not entirely rigorous, with some proofs being omitted and certain simplifying assumptions being made. Instead, ...

Search UnisaIR


Browse

My Account