School of Computing: Recent submissions

  • Die meting van sukses van naampassingsalgoritmes in 'n genealogiese databasis 
    De Kock, G de V (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Norms to measure the success of surname matching algorithms for use in a South African Genealogical Database are proposed. Surnames in the database can be grouped in equivalence classes. These algorithms are taken from ...
  • Finding a cheap matching 
    Smith, T.H.C. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ...
  • Learning the first step in requirements specification 
    Short, R.M.C. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Learning about the domain into which an information system will fit is an essential part of the system development process. In this paper it is argued that the first stage of the development process should be learning ...
  • The parallel conditional 
    Postma, Stef W.; Philips, N.C.K. (S W Postma and N C K Phillips (1988) The parallel conditional. Computer Society of South Africa (on behalf of SAICSIT), 1988)
    The parallel conditional is a new but natural programming language construct. It is particularly suited to evaluation on parallel maclunes and generalizes other well known conditionals.
  • A proposed computer network for researchers 
    McDonald, T (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In contrast to other countries, South Africa has sadly lacked a computer network for researchers. This paper starts with previous efforts to establish a national network for researchers and gives possible reasons for ...
  • Experiences in CSP trace generation 
    Kourie, D.G.; Van den Heever, R.J. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Experiences and insights gained from implementing and using a Prolog trace generator for CSP specifications are discussed. The use of Prolog as an implementation language is evaluated. The value of trace generation as ...
  • Ranking information system problems in a user environment 
    Bruwer, P.J.S. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In a previous research project (Bruwer [ 1 J) a methodology to identify information system problems from a user point of view, was presented. This methodology was also illustrated by means of empirical data collected ...
  • Frame clipping of polygons 
    Anderssen, E.C.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    A polygon clipping algorithm is presented for the clipping of closed geographical areas such as dams or forests, against a surrounding rectangular windowframe. The algorithm employs a line clipping procedure which divides ...
  • Rekenaar spraaksintese: die omskakeling van teks na klank - 'n prestasiemeting 
    Wagener, M.J.; De Kock, G de V (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Verslag word gelewer oor 'n prestasiemeting van 'n stel letter-na-klank reels vir die omskakeling van Afrikaanse teks na foneme. Die prestasie van die stel reels word getoets deur gebruik te maak van 'n verteenwoordigende ...
  • Modelling distributed database concurrency control overheads 
    Rennhackkamp, M.H.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Numerous concurrency control methods have been proposed for distributed databases. Various crz·teria are used to compare these methods. The comparisons range from qualitative overviews through quantitative analyses to ...
  • pGCL: formal reasoning for random algorithms 
    Morgan, C; McI, A (South African Computer Society (SAICSIT), 1998)
    Dijkstra's guarded-command language GCL contains explicit 'demonic' nondeterminism, representing abstraction from (or ignorance of ) which of two program fragments will be executed. We introduce probabilistic nondeterminism ...
  • A logic for the design of multiprogramming systems 
    Misra, J (South African Computer Society (SAICSIT), 1998)
    This paper presents a short introduction to the UNITY logic, a fragment of linear temporal logic. The logic was designed to specify safety and progress properties of reactive systems. A version of the UNITY ...
  • Problem analysis using small problem frames 
    Jackson, MA (South African Computer Society (SAICSIT), 1998)
    The notion of a problem frame is introduced and explained, and its use in analysing and structuring problems is illustrated. A problem frame characterises a class of simple problem. Realistic problems are seen as compositions ...
  • Teaching math more effectively, through the design of calculational proofs 
    Gries, D; Schneider, FB (South African Computer Society (SAICSIT), 1998)
  • Traversable trees and forests 
    Postma, Stef W. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Two topics are studied, related and generalised in this paper - the Knuth transform of an arbitrary tree to a binary tree, and Pfaltz' s definition of a data structure as a graph with assignments. Trees are defined in ...
  • Where do software architectures come from? Systematic development from domains and requirements. A re-assessment of software engineering? 
    Bjorner, D (South African Computer Society (SAICSIT), 1998)
    In this paper we show how details of a software design emerges in two steps: software architecture and program organisation and from first having established careful descriptions of the application domain and of functional ...
  • On syntax and semantics related to incomplete information databases 
    Orlowska, M.E. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    We propose a mathematical model of a database with incomplete information, which we call the N-system. Basically speaking, such a system stores information concerning properties of some objects. The information may be ...
  • A classification of partitioning rules for information system design 
    Mende, J. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In designing a computer-based information system one can partition the transformation process in many alternative ways. To find the optimal partition, a designer needs explicit rules which predict the most successful ...
  • Recursive specifications and formal logic. What benefits for intelligent tutoring systems? 
    Tcheeko, L (South African Computer Society (SAICSIT), 1998)
    The pedagogical assessment of a tutoring system relies upon a proof of convergence: for such a tutor the correction of student mistakes must not forever delay the teaching process. Such a tutor must provide uniform diagnosis ...
  • Specific acquisition of collective belief knowledge for socially motivated multiagent systems 
    Ram, V (South African Computer Society (SAICSIT), 1998)
    Shared beliefs and knowledge are an integral part of an organisation's identity and a prerequisite for collective func­tioning. Multiagent systems that support or emulate cooperative problem solving in such a context cannot ...

Search UnisaIR


Browse

My Account