Institutional Repository

Browsing SAICSIT Digital Archive by Title

Browsing SAICSIT Digital Archive by Title

Sort by: Order: Results:

  • A family tree of circumscriptive logics 
    Halland, KJ; Labuschagne, W.A. (South African Computer Society (SAICSIT), 1995)
    The relationships between the best-known forms of circumscription are elucidated with the aid of an hypothetical ancestor, which we choose to call naive circumscription.
  • The feasibility problem in the simplex algorithm 
    Scott, TG; Hattingh, JM; Steyn, T (1996)
    The simplex method is one way of solving a linear programming problem (LP-problem). The simplex method needs a basic feasible solution to start the solution process. This requires an available non-singular basis. Normally ...
  • Feature extraction in neural networks: an application in handwritten character recognition 
    Moodley, D; Ram, V (1996)
    This paper examines and provides an overview of feature extraction techniques that are currently used in neural networks for image recognition. These include moment invariants, Zemike moments, Fourier descriptor techniques, ...
  • A file server for a multi-transputer UNIX system 
    Hoffman, PK; Smit, G de V (South African Institute of Computer Scientists and Information Technologists, 1990)
    The DISTRIX operating system is a multiprocessor UNIX-like distributed operating system. It consists of a number of satellite processors connected to central servers. The system is based on the MINIX operating system, ...
  • Finding a cheap matching 
    Smith, T.H.C. (Computer Society of South Africa (on behalf of SAICSIT), 1988)
    We propose an edge exchange algorithm/or finding a cheaper 1-matchingfrom a given ]-matching as well as a heuristic algorithm/or constructing a relatively cheap ]-matching from the optimal solution of a relaxation of the ...
  • Finding adjacencies in non-overlapping polygons 
    Adler, J; Christelis, GD; Deneys, JA; Konidaris, GD; Lewis, G; Lipson, AG; Phillips, RL; Scott-Dawkins, DK; Shell, DA; Strydom, BV; Trakman, WM; Van Gool, LD (2001)
    Two polygons are adjacent if they have edges which share a common edge segment. In this paper we consider the problem of finding adjacencies in a set of n non-overlapping polygons. Using the fact that adjacent edges must ...
  • Finding All Primes Less Than Some Maximum C.C.Handley University of Natal Durban4001 
    Handley, C.C. (Computer Society of South Africa (on behalf of SAICSIT), 1986)
    The problem of finding all prime numbers less than some specified maximum is frequently set as an exercise to beginning programmers, particular students doing their first programming course at University. Several ...
  • Finding regular paths in acyclic graphs 
    Wood, PT (South African Institute of Computer Scientists and Information Technologists, 1990)
    Increasing the expressive power of relational query languages by providing some form of recursion is currently a topic of much research. For many recursive queries in relational databases, a relation can be represented ...
  • Finite-state computational morphology - treatment of the Zulu noun 
    Pretorius, L; Bosch, SE (2001)
    Morphological analysis is a basic enabling application for further kinds of natural lan guage processing, including part-of-speech tagging, parsing, translation and other high-level applications. Automated morphological ...
  • The fixpoint theorem in the El-Calculus 
    Postma, SW; McGee, A (South African Institute of Computer Scientists and Information Technologists, 1990)
    The οr.1-calculus is presented as an extension to the standard 1-calculus, and a r.1-term called the strong conditional is discussed. The strong conditional is shown to be non-monotomic, and an extension is made to the ...
  • A formal model for object bases 
    Patsouris, PA; Korostenski, M; Kissimov, V (South African Computer Society (SAICSIT), 1999)
    We introduce FMOB: a formal model for Objectbases. The term "Objectbase" represents better the widely used "object­ oriented database". FMOB consists of ( 1) objects (classes and their instances) with extended encapsulation ...
  • Formal usability testing - informing design 
    Van Greunen, D; Wesson, J (2001)
    The goal of this paper is to discuss the role of usability testing in software development in South Africa. Throughout the software industry software engineers develop user interfaces (Ul) with little or no support from ...
  • Formal verification with natural language specifications: guidelines, experiments and lessons so far 
    Holt, A (South African Computer Society (SAICSIT), 1999)
    The industrial take-up of formal verification techniques remains limited. Allowing specifications to be expressed in natural language (perhaps augmented with diagrams) offers the prospect of increasing the usability of ...
  • Four major success criteria for information system design 
    Mende, J. (South African Institute of Computer Scientists and Information Technologists, 1990)
    Both in the advancement of Information Systems theory and in practical development projects, significant errors of omission can occur unless one is aware of all aspects of the concept "information system success". At least ...
  • Fractal image compression 
    Cloete, E; Venter, LM (South African Computer Society (SAICSIT), 1998)
    Conventional image compression strategies present a number of uncomfortable limitations. Many of the impediments can be overcome by Fractal Image Compression (FIC). FIC is rooted strongly in mathematics. In comparison to ...
  • 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 ...
  • A framework for executing multiple computational intelligent programs 
    Viktor, HL; Cloete, I (1996)
    Computational intelligent programs are capable of discovering interesting relationships contained in "raw" data. These programs, including artificial neural networks, set covering algorithms and decision trees, have been ...
  • A framework for information systems and national development research 
    Licker, PS (1998)
    This paper develops a multidimensional framework to look at the role that information systems can play in the field of National Development. While there are already several frameworks, these are aimed at the employment ...
  • The FRD Special programme on collaborative software research and development. Draft call for proposals 
    Krzesinski, T (South African Computer Society (SAICSIT), 1994)
    The foundation for Research Development (FRD) is evaluating the need for a new Special Programme in Computer Science. An initial meeting was held in August 1993 at the FRD to discuss the new programme. A Steering Committee ...
  • From batch to distributed image processing: remote sensing for mineral exploration 1972-1992 
    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, ...

Search UnisaIR


Browse

My Account