SAICSIT Digital Archive: Recent submissions

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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.
  • Aik-Koen, Heng (Computer Society of South Africa (on behalf of SAICSIT), 1986)
  • 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.
  • 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. ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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.
  • 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 ...
  • 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, ...
  • Remenyi, DSJ (South African Computer Society (SAICSIT), 1993)
    This paper takes a business or commercial perspective of the key issues in Information Management for the mid-1990s. It focuses on how organisations may use information systems to improve their efficiency and effectiveness ...
  • Ram, V (South African Computer Society (SAICSIT), 1993)
    The use of Expert Systems technology in management decision making domains is increasing rapidly as business environments worldwide grow more turbulent and as the cost of development tools decrease. Research effort in this ...
  • Eisinger, N; Ohlbach, HJ (South African Computer Society (SAICSIT), 1993)
    A general theory of deduction systems is presented The theory is illustrated with deduction systems based on the resolution calculus, in particular with clause graphs. This theory distinguishes four constituents of a ...

Search UnisaIR


Browse

My Account