Institutional Repository

Browsing SAICSIT Proceedings: 1979-2001 by Issue Date

Browsing SAICSIT Proceedings: 1979-2001 by Issue Date

Sort by: Order: Results:

  • Ehlers, EM Von Solms, SH (1987)
    A representation of chemical molecules by Random Context Structure Grammars is proposed. Random Context Structure Grammars generate three-dimensional digital structures. Random Context Structure Grammars and Random Context ...
  • Kourie, DG (1987)
    The role of traces in the context of formal description techniques is discussed, as well as issues arising in the generation of these traces by means of software. A trace generator (written in Prolog) for systems described ...
  • Van Biljon, WR (1987)
    The expression structure of programming languages is examined. Two weaknesses are identified. The first pertains to the inability, or limited ability, to redefine operators or to define new operators. The second pertains ...
  • Berman, S (1987)
    Semantic data models were originally introduced as a tool for data description and design. SDMI (Semantic Data Model Interface) investigates their use in another role - as the basis for a data manipulation language - and ...
  • Cooper, AK (1987)
    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 the ...
  • Mueller, CSM (1987)
    A novel way of programming, which starts with specific details of a particular example and abstracts these details into generalised sets, is proposed. The whole program is constructed around the definition of these sets. ...
  • Mulders, MA Serwy, DA Van Biljon, WR (1987)
    An implementation of a Graham-Glanville type pattern-matching code generator for the NRIMS systems programming language SCRAP is discussed. The simple heuristic algorithm on which the pattern matcher is based is presented ...
  • Kritzinger, PS (1987)
    Performance analyses of data communication systems do not always rely on a detailed analysis of the underlying protocols. Those analyses which do, usually rely on an analysis of the protocol state transition graph. These ...
  • Bishop, JM (1987)
    This paper looks at ways of obtaining a distributed version of an Ada program. Since current approaches require a large investment in system software, we propose instead the use of an Adapter, which can be a manual methodology ...
  • Du Plessis, L Borman, C (1987)
    A formal requirements specification language, the ELSIM language, is presented. The language uses conceptual models for modelling data processing, and control characteristics and behaviour of real-time systems, and is ...
  • Berman, S (1987)
    Persistent data is defined as that which survives on secon­dary store after program execution terminates. In a persistent programming language there is no distinction what ­ever between persistent data and ...
  • Gorringe, HP (1987)
    In any form of display where three-dimensional images are required to be projected onto a two-dimensional display the hidden surface or hidden line removal certainly helps to enhance the realism of the final image. This ...
  • Philips, MJ (1987)
    The difficulties encountered by users without experience of the use of multiple databases are described, as well as an approach which allow such users to make worthwhile use of these systems, encompassing potentially ...
  • Rennhackkamp, MH (1987)
    Numerous concurrency control methods have been proposed for distributed databases. Various criteria are used to compare these methods. The comparisons range from qualitative overviews through quantitative analyses ...
  • Scheepers, CF (1987)
    A method is presented whereby the interior of boundary-defined regions on vector type devices may be shaded using regular line, cross-hatch and dot patterns. Different shades are realized by changing ...
  • Morris, MA (1987)
    Difference equation methods are used to develop redundant (n-version) programs required for high reliability computing systems. The n-version programs are developed by exploiting the iterative nature of real time software. The ...
  • Orlowska, ME (1987)
    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 ...
  • Venter, BH (1987)
    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. ...
  • Mende, J (1987)
    After identifying the processing functions required in a computer based information system, the designer needs to combine them into an optimal se t of load un its. Some “packaging” arrangements yield a better system than ...

Search UnisaIR


Browse

My Account