Institutional Repository

Browsing South African Computer Journal (SACJ) by Title

Browsing South African Computer Journal (SACJ) by Title

Sort by: Order: Results:

  • 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 ...
  • The practice of clausification in automatic theorem proving 
    Sutcliffe, G; Melville, S (South African Computer Society (SAICSIT), 1996)
    In the process of resolution based Automatic Theorem Proving, problems expressed in First Order Form (FOF) are transformed by a clausifier to Clause Normal Form (CNF). This research examines and compares clausifiers. ...
  • A pragmatic approach to bitemporal databases: conceptualisation, representation and visualisation 
    Njovu, C; Gray, WA (South African Computer Society (SAICSIT), 1999)
    In this paper, we describe a pragmatic approach to bitemporal data modelling, logical representation and visualisation. Our proposed approach, herein referred to as the Bitemporal Object, State and Event Modelling Approach ...
  • A pragmatic approach to development information to provide service on a wide scale 
    Mncube, SS (South African Computer Society (SAICSIT), 1996)
    The rapid technological growth in our time has produced an explosion of information. This, in tum, has spawned information systems based on the use of computers and automated systems. These mechanised devices with their ...
  • Predicting the performance of shared multiprocessor caches 
    Goosen, HA; Cheriton, DR (South African Institute of Computer Scientists and Information Technologists, 1990)
    We investigate the performance of shared caches in a shared-memory multiprocessor executing parallel programs, and formulate simple models for estimating the load placed on the bus by such a shared cache. We·analyze three ...
  • Preliminary investigation of the RAMpage memory hierarchy 
    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 ...
  • Problem analysis using small problem frames 
    Jackson, MA (South African Computer Society (SAICSIT), 1998)
    The notion of a problem frame is introduced and explained, and its use in analysing and structuring problems is illustrated. A problem frame characterises a class of simple problem. Realistic problems are seen as compositions ...
  • Programming using induction 
    Mueller, C.S.M. (South African Institute of Computer Scientists and Information Technologists, 1990)
    Induction has been used as a major tool in mathematics in proving theorems. This paper explores whether it has an equally important role in formulating programs. There are those who advocate that induction should be used ...
  • Progressing towards object orientation in South Africa 
    Jansen van Rensburg, M (South African Computer Society (SAICSIT), 1999)
    This article provides a description of the current state of Object Orientation in South African companies. It forms part of an MSc research report, looking at the pitfalls and guidelines in the transition to 00. The problems ...
  • Qualitative reasoning: an introduction 
    Bradshaw, J (South African Computer Society (SAICSIT), 1992)
    This paper serves as an introduction to the areas of qualitative reasoning. The three main streams of qualitative reasoning are described: the component centered approach, the process centered approach and the constraint ...
  • Quantifier elimination in second order predicate logic 
    Gabbay, D; Ohlbach, HJ (South African Computer Society (SAICSIT), 1992)
    An algorithm is presented which eliminates second-order quantifiers over predicate variables in formulae of type 3Pi , ...,Pn 1/; where 1/J is an arbitrary formula of first-order predicate logic. The resulting formula is ...

Search UnisaIR


Browse

My Account