Institutional Repository

Browsing South African Computer Journal (SACJ) by Title

Browsing South African Computer Journal (SACJ) by Title

Sort by: Order: Results:

  • Object oriented programs and a stack based virtual machine 
    Waldron, JT (South African Computer Society (SAICSIT), 2000)
    Dynamic quantitative measurements of Bytecode and Stack Frame Usage by Eiffel and Java Programs in the Java Virtual Machine are made. Two Eiffel programs are dynamically analysed while executing on the JVM, and the results ...
  • An object-oriented framework for rapid client-side integration of information management systems 
    Schimkat, RD; Kuchlin, W; Krautter, R (South African Computer Society (SAICSIT), 1999)
    Reuse of software components offers the potential for significant savings in application development costs and time. This paper provides a characterization of reuse at different levels of client-based software in distributed ...
  • The object-oriented paradigm: Uncertainties and insecurities 
    Schach, Stephen R. (South African Computer Society (SAICSIT), 1994)
    The object-oriented paradigm is widely promoted as the optimal way to develop software. However, there is as yet no experimental evidence to back that assertion, and it is extremely unlikely that such evidence could be ...
  • OCTOLISP: An experiment with data structures 
    Dempster, Robert (South African Institute of Computer Scientists and Information Technologists, 1990)
    OCTOLISP is a functional programming language which provides the programmer with a number of explicit data structures, such as lists, stacks, vectors, sets, trees and forests. Each of these data structures also has a ...
  • On the generation of permutations 
    Naccache de Paz, D (South African Institute of Computer Scientists and Information Technologists, 1990)
    A new incremental algorithm for generating permutations on 1,2,..n (hereafter called "arrangements') is presented. The scheme generates arrangement k +1 by reversing a certain prefix of its predecessor and linking it to ...
  • On using the situation calculus dynamically rather than temporally 
    Labuschagne, W.A.; Miller, MG (South African Computer Society (SAICSIT), 1994)
    Yet another axiomatisation of the Yale shooting scenario is provided. The point illustrated by the axiomatisation is that, when using the situation calculus to represent knowledge about a dynamic system in which actions ...
  • Opening address: Vth SA Computer Symposium 
    Viljoen, HC (South African Institute of Computer Scientists and Information Technologists, 1990)
    You may know that I am sitting on two chairs at the present moment: one, at the University of Stellenbosch in the Chair of Electronic Engineering as Dean of Engineering; the other at the SABC as chairman of the Board of ...
  • Organizational computing technologies for supporting organizational activities 
    Lochovsky, FH (South African Computer Society (SAICSIT), 1994)
    Technologies for supporting organizational activities are becoming increasingly important as a means for organizations to achieve their business goals. Such technologies allow organizations to model, execute, and control ...
  • Orthogonal axial line placement in chains and trees of orthogonal rectangles 
    Sanders, ID; Watts, DC; Hall, AD (South African Computer Society (SAICSIT), 2000)
    Previous research has shown that the orthogonal axial line placement problem for orthogonal rectangles is NP-complete in general but also that there are restrictions of the problem for which polynomial time solutions can ...
  • Orthogonal ray guarding of adjacencies between orthogonal rectangles 
    Sanders, I; Lubinsky, D; Sears, M; Kourie, D (South African Computer Society (SAICSIT), 1999)
    Guarding and covering problems have great importance in Computational Geometry. In this article the notion of' a ray guard, a guard that can only 'see' along a single ray, is introduced. The problem of siting the fewest ...
  • Parallel distributed objects' structure and their synchronization in an APPC environment 
    Kisimov, V; Da Silva, I (South African Computer Society (SAICSIT), 1995)
    Over a period of a few hours, every computer participating in a distributed system has many unused resources. If these resources can be combined, a large amount of computational power can be generated. This paper offers ...
  • Parallel execution strategies for conventional logic problems: A review 
    Lutu, PEN (South African Computer Society (SAICSIT), 1994)
    Parallel execution strategies/or Prolog programs are reviewed. Three models, AOPM, APPNet and RAP are discussed in some detail. The AOPM and the APPNet are AND-OR parallel execution models and represent the two ends of the ...
  • A performance analyser for the numerical solution of general Markov chains 
    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 ...
  • PEST - A microcomputer Pascal base expert system shell 
    Sartori-Angus, AG; Neville, R (South African Institute of Computer Scientists and Information Technologists, 1991)
    The PEST System is a totally interactive, forward chaining, rule-based expert system shell. It was primarily, though not exclusively, designed for the development of scientifically related expert systems in Pascal, involving ...
  • PEW: A tool for the automated performance analysis of protocols 
    Wheeler, G; Kritzinger, Pieter S. (South African Computer Society (SAICSIT), 1992)
    The Protocol Engineering Workbench (PEW) is an integrated software system or tool for the analysis of communication protocols specified using the Estelle Formal Description Technique or FDT. The execution of systems specified ...
  • 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 ...
  • The physical correlates of local minima 
    Wessels, LFA; Barnard, E; Van Rooyen, E (South African Institute of Computer Scientists and Information Technologists, 1991)
    The training of neural-net classifiers is often hampered by the occurrence of local minima, which results in the attainment of inferior classification performance. We study the problem of local minima in order to devise ...
  • The placement of subprograms by an automatic programming system 
    Du Plessis, JP; Messerschmidt, HJ (South African Institute of Computer Scientists and Information Technologists, 1991)
    Programming in a procedural language such as Pascal usually involves the development of subprograms. An auto­matic programming system needs a systematic method to determine the placement (position) of a subprogram in a ...
  • Placing processes in a transputer-based Linda programming environment 
    Clayton, Peter G.; de-Heer-Menlah, FK; Wentworth, EP (South African Computer Society (SAICSIT), 1992)
    This paper presents a process placement algorithm, designed for use in a transputer-based implementation of the Linda programming environment. A static, heuristic approach is adopted, which takes cognisance of the special ...
  • A pluralistic approach to systems development 
    Lai, LSL (South African Computer Society (SAICSIT), 1995)
    It is believed that revolutionary developments in information technology may allow developing countries to leapfrog obsta­cles to development if they can successfully apply the new technology. However, many organizations ...

Search UnisaIR


Browse

My Account