Institutional Repository

Browsing SAICSIT Proceedings: 1979-2001 by Issue Date

Browsing SAICSIT Proceedings: 1979-2001 by Issue Date

Sort by: Order: Results:

  • 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 ...
  • 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 ...
  • 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 ...
  • 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. ...
  • Machanick, P (1991)
    Parallel simulation, if it is to become a mainstream technology, must become reasonably accessible to programmer s without unusual skills. Since low-cost shared memory machines are becoming an increasing possibility a ...
  • Krzesinski, AE; Schassberger, R (1991)
    The MultiServer centre with Hierarchical Concurrency Constraints (MSHCC) is an exponential multiserver with a queueing discipline which imposes restrictions on the number of customers of different types and subtypes that ...
  • 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 ...
  • Melville, S (1991)
    CommunIcations networks with sporadically available links pose particular problems in terms of delay analysis. This paper presents an approach to determining the effectiveness of various routing strategies when applied ...
  • 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 ...
  • 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 ...
  • Wagener, MJ (1991)
    The design of a speech synthesis system for the generation of speech from text is presented. The system accepts any Afrikaans sentence and then derives segmental and suprasegmental informa­tion through various linguistic ...
  • Webster, MR; Harley, RG; Levy, DC; Woodward, DR (1991)
    This paper describes a software development environment currently being built at the University of Natal that provides a powerful and easy to use engineering tool for the design, simulation and implementation of high ...
  • Rennhackkamp, M (1991)
    There is, as yet, no single formal definition for the object-oriented approach. The object-oriented paradigm is described in terms of the concepts accentuated by the approach, namely classes, objects, methods, messages and ...
  • MacGregor, KJ; Campbell, RH (1991)
    An object-orientated framework for the design of distributed virtual memory consistency is presented. It is shown that custom designed protocols for different types of applications are easy to construct and use within this ...
  • Oosthuizen, GD; Avenant, C (1991)
    Recently, there have been various attempts to combine the strengths of similarity-based learning (SBL) and explanation-based learning (EBL) in a single learning system. We describe a graph-based learning method called ...
  • De Villiers, PJA (1991)
    A model checker automatically determines whether a model of a re­active system satisfies its specification.Temporal logic is used to spec­ify the intended behaviour of a reactive system which is modelled as a transition ...
  • Venter, BH (1991)
    Most statically typed Algol-style languages were designed to conform with the view that a value belongs to one and only one type. The adoption of this view bought compiler simplicity at the ex­pense of language expressivity. ...
  • Wood, PT (1991)
    The next generation of query languages for database systems should have the ability to express recursive queries, the efficient evaluation of which will be crucial to the success of these systems. One such query language ...
  • Viktor, HL; Rennhackkamp, MH (1991)
    The most frequently used local database system failure recovery techniques are logging, shadowing and differential files. In a distributed database these, local system failure recovery techniques may be utilized for recovery ...
  • Brink, C; Rewitzky, I (1991)
    Dijkstra's weakest precondition semantics, as presented in textbook form by Gries, may be viewed as an equational algebra. The problem then is to find a reasonable (set-theoric) model of this algebra. This paper provides one.

Search UnisaIR


Browse

My Account