College of Science, Engineering and Technology: Recent submissions

  • Foss, RJ; Rehmet, GM; Watkins, RC (South African Computer Society (SAICSIT), 1992)
    This paper describes the development of a memory resident version of the Xinu operating system for the IBM PC range of computers. The operating system co-resides with the MS-DOS operating system. The need for the operating ...
  • 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 ...
  • Brand, M; Wood, PT (South African Computer Society (SAICSIT), 1992)
    Unlike the relational model, there is no universally accepted object-oriented data model. This has led to systems being defined in an ad-hoc manner, with the resultant difficulty of determining exactly what features are ...
  • Apteker, RT; Bishop, JM (South African Computer Society (SAICSIT), 1992)
    Graphic User Interfaces (GUls) are the key ingredient in the development of a new era of computer software. Pioneered at Xerox, launched at Apple, pursued by Microsoft, and challenged by a host of others, the age of the ...
  • De Villiers, PJA; Visser, WC (South African Computer Society (SAICSIT), 1992)
    Designing a concurrent reactive system which can be proven correct is a challenging task. A promising technique involves building a validation model which can be shown to have important correctness properties. This paper ...
  • Sparg, S.B.; Berman, Sonia (South African Computer Society (SAICSIT), 1992)
    Existing persistent languages cannot express the structure and semantics of the data they work on precisely and simply. As a result programs are more difficult to write and the integrity of the data is compromised. This ...
  • Putter, P; Roos, JD (South African Computer Society (SAICSIT), 1992)
    This paper proposes a general building block for distributed systems. This building block is referred to as a generic distributed system entity (GDE). The purpose of the GDE is to create a generic entity which can be used ...
  • Pendock, N (South African Computer Society (SAICSIT), 1992)
    The routine use of satellite remotely sensed imagery for a variety of applications is twenty years old this year. In addition to these digital photographs of the earth's surface, subterranean views are made using gravity, ...
  • Paterson-Jones, RA; Wood, PT (South African Computer Society (SAICSIT), 1992)
    HILOG is a new logic programming language with a higher-order syntax allowing the elegant expression of many tasks requiring meta-predicates in Prolog. We are in the process of developing a compiler and programming environment ...
  • O'Donovan, BC (South African Computer Society (SAICSIT), 1992)
    Designers of both computerized information systems and instructional systems are faced with a need to find more effective methods of identifying and supplying the information that the users of these systems require. Both ...
  • Melton, A; Shenoi, S (South African Computer Society (SAICSIT), 1992)
    It is often the case that a major concern with databases is security. In this paper we introduce a new model for database security. The basic idea of this new model is that answers to queries are based on equivalent data ...
  • Mcleod, G (South African Computer Society (SAICSIT), 1992)
    Organizations have used systems planning and development methodologies for some time now. Results are mixed, with some reporting substantial benefits, and others abandoning the process without achieving the desired benefits. ...
  • Lewis, L (South African Computer Society (SAICSIT), 1992)
    Statecharts were developed by Harel to specify complex reactive systems. Statecharts proved to be rich in modelling power and convenience [9] and well suited to mechanical implementation. However, the semantic definition ...
  • Kriel, CF; Krzesinski, AE (South African Computer Society (SAICSIT), 1992)
    This paper defines the the Multiserver Station With Dynamic Concurrency Constraints. The MSDCC station consists of B parallel identical exponential servers. The customers requesting service at the MSDCC station belong to ...
  • Kourie, D.G.; van den Heever, WJ; Oosthuizen, GD (South African Computer Society (SAICSIT), 1992)
    This paper describes how a machine translation system, LEXICA, has been used and adapted to translate from African languages to English. Results with Tswana provide comprehensible translations that, although not necessarily ...
  • Postma, Stef 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 ...

Search UnisaIR


Browse

My Account