College of Science, Engineering and Technology: Recent submissions

  • Three packaging rules for information systems design 
    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 ...
  • An approximate solution method for multiclass queueing networks with state dependent routing and window flow control 
    Krzesinski, AE (1987)
    A Multidass Queueing Network (MQN) Q ( N, .M ) consisting of M centres with index set .M and population vector N is partitioned into two subnetworks Q ( fJ -V , .M -1) ) and Q (V , V ) . The centres in Q (V , · V ) are ...
  • Improving a control and sequencing language 
    Fair, CA; Smit, GD (1991)
    In a process control environment, batch processes, as opposed to continuous pro­cesses, are characterised by multi-product manufacturing lines producing relatively small quantities which often involves frequent product ...
  • An implementation of Linda tuple space under the Helios operating system 
    Clayton, PG; Wentworth, EP; Wells, GC; de-Heer-Menlah, FK (1991)
    We discuss the implementation of Rhoda, our Linda-like Tuple Space server which runs under the Helios operating system. The approach analyses and partitions tuple space at compile time in order to reduce the run time ...
  • Concurrency control mechanisms for multidatabase systems 
    Deacon, A (1991)
    In conventional systems, transaction management has been thoroughly investigated and is now considered to be well understood. Transaction management in multidatabase systems, however, is less well understood. A multidatabase ...
  • An extensible system and a programming tool for workstation computers 
    Wirth, N (1987)
  • Petri net topologies for a specification language 
    Watson, AG (1987)
    This paper presents a formal technique for enforcing deterministic exec­ution in Petri nets, and proceeds to demonstrate how the resultant topology may be used to enforce partial sequencing so that various ...
  • A new general-purpose operating system 
    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. ...
  • Polygon shading on vector type devices 
    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 ...
  • Sums and products of square-zero matrices 
    Hattingh, Christiaan Johannes (2018-03)
    Which matrices can be written as sums or products of square-zero matrices? This question is the central premise of this dissertation. Over the past 25 years a signi - cant body of research on products and linear combinations ...
  • The design and use of a Prolog trace generator for CSP 
    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 ...
  • Hidden surface elimination in raster graphics using visigrams 
    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 ...
  • The representation of chemical structures by random context structure grammars 
    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 ...
  • The ELSIM language: an FSM-based language for the ELSIM SEE 
    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 ...
  • Ada for multi-microprocessors: some problems and solutions 
    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 ...
  • A generalised expression structure 
    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 ...
  • A semantic data model approach to logical data independence 
    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 ...
  • SPS-ALGOL: Semantic constructs in a persistent programming language 
    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 ...
  • A writing support tool for distance students 
    Barrow, J (1995)
    This paper describes SuperText, a computer program designed to support productive expository writing processes among students at a distance teaching university . Being able to write well is an important communication ...
  • Critical success factors for implementing CASE at a selection of companies in South Africa 
    Addison, TM; Hamersma, S (1995)
    We discuss the implementation of Rhoda, our Linda-like Tuple Space server which runs under the Helios operating system. The approach analyses and partitions tuple space at compile time in order to reduce the run time- ...

Search UnisaIR


Browse

My Account