Institutional Repository

Quaestiones Informaticae (QI)

Quaestiones Informaticae (QI)

Recent Submissions

  • Wulf, S. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    The need for modelling techniques to allow blocking of tasks prior to admission to the computer system in queueing network models is described. A detailed algorithm which presents a technique to enforce blocking by priority ...
  • Van Rooyen, H.O.; Weiermans, D.J. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Nebula modell_ing is_ a generalised structural modelling technique which applies to any finite set of objects (entities) and n-ary relat1onsh1ps (n ~2). A nebula model can be presented in either diagrammatic or tabular ...
  • Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Details are given of an implementation of Grimbleby's algorithm for the common spanning tree problem with running times up to 50% less than for the original implementation. An explanation is given as to why implementations ...
  • Mann, R.J. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    A basic description of the facilities of the computer modelling package, AUTO-CONFIGURATER, is presented together with detailed procedures to calculate the required input parameters from monitor statistics. Techniques to ...
  • Cuthbertson, A.J.; Van Niekerk, I.J.; Turton, T. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    This paper describes the research that was undertaken in designing a disk space management system. The system has strong similarities to the management of real storage in a virtual storage environment. These similarities ...
  • Currin, Desmond C. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Generalized network problems involve the optimization of a flow through a network. In contrast to normal networks, generalized networks include multipliers which alter the flow as it passes through the arcs. This enables ...
  • Bruwer, P.J.S. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Performance evaluation techniques can contribute substantially to the successful management of the information services function in an organization. Unfortunately the design and implementation of computer-based ...
  • Berman, S (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    An automated database design tool called ADD has been developed at the University of Cape Town. This system obtains a requirements specification from a user and from this generates a relation scheme and a Codasyl schema. ...
  • Wulf, S. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    An overall methodology for database design is presented. This includes creation of a data dictionary and relational analysis. An algorithm is presented to create a conceptual schema or logical database design from the set ...
  • Visser, P. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    This paper presents a summary of tutorial material on accepted management techniques and philosophies as applied to the development of large software systems, based upon the documentation for such systems.
  • Van Niekerk, J.C. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    The operational approach to the analysis of the single server model is discusses. Firstly Buzen's operational equivalent to the stochastic birth/death Markov model is presented, whereafter generalisations of the model are ...
  • Schach, S. R. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    Three levels of traces for data structures (as opposed to simple variables) are defined. A machine-code core dump is essentially a low level trace. A high level trace reflects the high level language in which the data ...
  • Van Rooyen, Martha H. (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    SCRAP is a high-level language that provides facilities for systems progrc~ff)ming, but can equally well be used for applications programming. The prominent features of the language are a well-defined syntax, a modular ...
  • Popelas, Judy Mallino; Calingaert, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    The correction of errors in programs can be based on an analysis, that subordinates syntactic relationships to functional relationships among elements of a program. For this purpose, case grammars, originally developed ...
  • Hetzel, Bill; Calingaert, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1983)
    A controlled experiment was designed and conducted to compare three methods for detecting errors in computer programs: disciplined, structured reading; specification or black-box testing; and a refined form of typical ...
  • Postma, S. W. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Quadlisp is a symbol manipulation language for sophisticated users, and it is an improper extension of Lisp 1.5 (in the same sense that Pascal is an improper extension of Algol). Elements from Lisp thus are basic to the ...
  • Pirow, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    The basic 'model' usually applied to the structure of MIS is that of Anthony. This paper investigates the use of the Paterson model as an alternative. This is approached from the theoretical standpoint, and reference is ...
  • Linck, M. H. (Linck, M.H. (1982) A CSP Description of some Parallel Sorting Algorithms,. Computer Society of South Africa (on behalf of SAICSIT), 1982)
    Hoare's CSP notation is used to describe 3 parallel sorting algorithms. The first algorithm uses n/2 processes working in parallel, the second uses an array of n parallel processes and the third algorithm is a parallel ...
  • Finnie, G. R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    A computer architecture is described which is suitable for the execution of structured languages (such as Pascal or Algol) at the intermediate language level. The design is heavily stack oriented and consists basically ...
  • Becker, Ronald I; Perl, Yehoshua; Schach, Stephen R. (Computer Society of South Africa (on behalf of SAICSIT), 1982)
    An implementation of an algorithm for finding a min-max partition of a weighted tree T with n vertices into q subtrees by means of k = q-1 cuts is presented. The implementation is shown to have asymptotic complexity ...

View more