Institutional Repository

Browsing Quaestiones Informaticae (QI) by Author "von Solms, S. H."

Browsing Quaestiones Informaticae (QI) by Author "von Solms, S. H."

Sort by: Order: Results:

  • 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 ...
  • Database Design: Choice of a Methodology 
    King, M. C. F.; Naude, G.; von Solms, S. H. (Computer Society of South Africa (on behalf of SAICSIT), 1979)
    Aspects are discussed of the pract.Ical applicat.Ion of recent relatlonal theory The relevant defirut.Ions, extracted from vanous papers, have been restated usmg a common notat.Ion An attempt is made to descnbe unambiguously ...
  • Frame clipping of polygons 
    Anderssen, E.C.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    A polygon clipping algorithm is presented for the clipping of closed geographical areas such as dams or forests, against a surrounding rectangular windowframe. The algorithm employs a line clipping procedure which divides ...
  • Generating relations using formal grammars 
    von Solms, S. H. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    Grammars generating 2-dimensional arrays have been studied by many people [1, 2, 3, 4). One effort was Random Context Array Grammars [4], where different types of context conditions placed on the production, were used ...
  • Modelling distributed database concurrency control overheads 
    Rennhackkamp, M.H.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    Numerous concurrency control methods have been proposed for distributed databases. Various crz·teria are used to compare these methods. The comparisons range from qualitative overviews through quantitative analyses to ...
  • Protection Graph Rewriting Grammars and the Take/Grant Security Model 
    Von Solms, S.H.; De Villiers, D.P. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    The operations in the Take/Grant Protection Model are formalised using theory and results from the discipline of formal languages. A Protection Graph Rewriting Grammar is defined, which generates protection graphs consistent ...
  • Random context structure grammars 
    Ehlers, E.M.; von Solms, S. H. (Computer Society of South Africa (on behalf of SAICSIT), 1987)
    Random Context Structure Grammars are defined. The language generated by a Random Context Structure Grammar is a set of three-dimensional digital structures. A hierarchy of Random Context Grammars is discussed briefly. ...
  • Using NLC-Grammars to Formalise the Take/Grant and Send/Receive Security Models 
    De Villiers, D.P.; Von Solms, S.H. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    In this paper the Send/Receive and Take/Grant logical security models are formalised using results from formal language theory. By using the graph rewriting facilities of NLC-grammars, and by extending these facilities ...

Search UnisaIR


Browse

My Account