Institutional Repository

Browsing Quaestiones Informaticae (QI) by Type "Article"

Browsing Quaestiones Informaticae (QI) by Type "Article"

Sort by: Order: Results:

  • Abstracts of Old mutual conference for Ph.D and M.Sc students In Computer Science, Stellenbosch, 2-3 October 1987 
    Unknown author (Computer Society of South Africa (on behalf of SAICSIT), 1987)
  • An Adaptive Response Algorithm 
    Pirow, Peter (Computer Society of South Africa (on behalf of SAICSIT), 1984)
    In five years of watching students operate terminals I have observed that the response time of the terminal has much to do with the comfort of the user. I have also observed this phenomenon in the business environment. ...
  • Add: The Automated Database Design Tool 
    Berman, Sonia (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. ...
  • An Algorithm for Merging Disk Files in Place 
    Roets, P. P. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    An algorithm is presented for sorting a random access file in place. The algorithm is unique in the sense that no auxiliary storage, apart from a number of buffers in the machine's high-speed memory, is required. In ...
  • An Algorithm for the Approximation of Surfaces and for the Packing of Volumes 
    Christensen, A. H. J. (A. H. J. Christensen (1979) An Algorithm for the Approximation of Surfaces and for the Packing of Volumes. Computer Society of South Africa (on behalf of SAICSIT), 1979)
    An algorithm is presented here that approximates a given swface A by a set of regular or semi-regular faces forming a polyhedron C. If the faces are all square, C assumes the aspect of a 'blocked' swface. It is also ...
  • An Alternative Development of the Vienna Data Structures 
    Philips, N.C.K. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    This paper presents an axiomatic specification of a data type which is shown to be equivalent to the Vienna data structures. The advantage of this alternative approach is its obvious simplicity.
  • An Analytical Model of a Mixed-Workload MVS Computer System 
    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 ...
  • The application of scientific method to information systems analysis 
    Atkinson, C.R.; Lay, P.M.Q. (Computer Society of South Africa (on behalf of SAICSIT), 1989)
    17zis paper addresses the challenging question of the rigour of the systems analysis process. First of all it discusses the nature of analysis, concluding that, contradictory to cu"ent opinion, it can best be described ...
  • An approach to defining abstractions, refinements and enrichments 
    Kourie, D.G. (Computer Society of South Africa (on behalf of SAICSIT), 1989)
    A proposal for defining abstractions and refinements is given in terms of three-valued logic applied to a domain of discourse consisting of a property and an entity set. Definitions for several related concepts flow ...
  • A CAI model of space and time with special reference to field battles 
    Anderssen, E.C.; von Solms, S. H. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    A computer aided instruction facility is presented, in which the simulation of field battles introduces history students to the dynamic relationships between space and time in a historical perspective. Information on a ...
  • Case-Grammar Representation of Programming Languages 
    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 ...
  • A classification of partitioning rules for information system design 
    Mende, J. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In designing a computer-based information system one can partition the transformation process in many alternative ways. To find the optimal partition, a designer needs explicit rules which predict the most successful ...
  • Common approach to some informational systems 
    Orlowska, M.E. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    In this paper we consider relationships between a complete system [6], an L-system [3], a stochastic system [13] and an N-system [8]. We introduce a notion of the induction of one system by another. We prove the important ...
  • A comparison of academic and practitioner perceptions of the changing role of the systems analyst: an empirical study 
    Crossman, T.D. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    Changes in technology introduce new job responsibilities and demand new skills profiles from personnel involved in application software development. Inability to perfonn competently within these job responsibilities can ...
  • A Comparison of Methods used to Represent Graphs on a Computer 
    Sutcliffe, Geoff (Computer Society of South Africa (on behalf of SAICSIT), 1985)
    In general graph theorists have a limited knowledge of computers and computing, and are unaware of the possible variations of representation available, and in what circumstances which representation would be better. To ...
  • Concurrency: An Easier Way to Program 
    Mueller, C.S.M. (Computer Society of South Africa (on behalf of SAICSIT), 1984)
    Why concurrency in itself should be seen as a method of programming, is discussed. Current approaches to concurrent programming are evaluated in terms of e~e qt programming. The properties required to decompose the ...
  • A Consideration of Formalisms in Computing 
    Short, R. (Computer Society of South Africa (on behalf of SAICSIT), 1985)
    Formalisms comprise the essential bricks and mortar that we need in order to construct information systems. Not surprisingly therefore the invention and refinement of formalisms has formed and continues to form a ...
  • A Context Sensitive Metalanguage for Intelligent Editors 
    Kaplan, S.M. (Computer Society of South Africa (on behalf of SAICSIT), 1984)
    The notion of and mot1vat1on for intelligent editor systems 1s introduced, spec1f1cally a language independent intelligent editor called "PASTOR" We also introduce and discuss the metalanguage used in the editor for grammar ...
  • A "cooperating expert's" framework for business expert system design 
    Finnie, G.R. (Computer Society of South Africa (on behalf of SAICSIT), 1989)
    Expert system development environments based on current language constructs such as rules and frames have been criticised for approaching the task of problem solving from too low a level of abstraction. This paper describes ...
  • A CSP Description of some Parallel Sorting Algorithms 
    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 ...

Search UnisaIR


Browse

My Account