School of Computing: Recent submissions

  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Pretorius, L (South African Computer Society (SAICSIT), 1998)
    We introduce a number of typed lambda calculi, show how type theory may be used as basis for a proof assistant, and illustrate this with the Coq proof assistant.
  • Paijmans, H (South African Computer Society (SAICSIT), 1998)
    A number of methods for feature reduction and feature selection in text classification and information retrieval systems are compared. These include feature sets that are constructed by Latent Semantic Indexing, 'local ...
  • Machanick, P; Salverda, P (South African Computer Society (SAICSIT), 1998)
    The RAMpage memory hierarchy addresses the growing concern about the memory wall - the possibility that the CPU­-DRAM speed gap will ultimately limit the benefits of rapid improvement in CPU speed. Reducing references to ...
  • Cooper, A.K. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Geographical information consists of non-spatial information (alphanumeric) and spatial information (vector and raster), the relationships between the non-spatial information and the spatial information, as well as ...
  • Knottenbelt, W; Kritzinger, P (South African Computer Society (SAICSIT), 1998)
    Despite many advances in queueing theory and other modelling paradigms, one persistenty discovers real life stochastic systems which do not yield neatly to existing methods for their performance analysis. In most such ...
  • Cloete, E; Venter, LM (South African Computer Society (SAICSIT), 1998)
    Conventional image compression strategies present a number of uncomfortable limitations. Many of the impediments can be overcome by Fractal Image Compression (FIC). FIC is rooted strongly in mathematics. In comparison to ...
  • Venter, B.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    An operating system provides, among other things, an operational definition of a process. The concept of a process is one of the fundamental concepts of Computer Science, and the designer of an operating system must strive ...
  • Venter, B.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    The current generation of widely-used, multi-user, general-purpose operating systems have evolved from versions that were designed when many of the issues that are important today were unimportant or not even thought of. ...
  • Clarke, MC; Finnie, GR (South African Computer Society (SAICSIT), 1998)
    A modified version of Lee's instrument for measuring attitudes to computers was administered to two groups of first-year university students separated by a period of twelve years. Factor analysis was applied to these two ...
  • De Villiers, D.P.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In this paper the Send/Receive and Take/Grant logical security models are formalised using results from formal language theory. By using the graph rewriting facilities of NLC-grammars, and by extending these facilities ...
  • Machanick, Philip (South African Computer Society (SAICSIT), 1997)
    Experience in industry suggests that reuse does not happen without retraining, despite the fact that many experienced software engineers accept that reuse ought to be more efficient than coding from scratch. A possible ...
  • Kotze, P; De Villiers, R (South African Computer Society (SAICSIT), 1997)
    The research reported in this paper aims to integrate software engineering approaches with instructional factors in the requirements analysis, design and production phases of instructional software development. The integration ...
  • Schlingloff, B (South African Computer Society (SAICSIT), 1997)
    These tutorial notes contain an introduction to the logical theory and computational aspects of computer aided verification of finite state reactive systems with linear and branching temporal logic model checking. As a ...
  • Peleska, J; Siegel, M (South African Computer Society (SAICSIT), 1997)
    This article focuses on test automation for safety-critical reactive systems. In the first part of the paper we introduce a methodology for specification, design and verification of fault-tolerant systems allowing to ...

Search UnisaIR


Browse

My Account