https://ir.unisa.ac.za/handle/10500/24188 2026-05-06T12:53:48Z https://ir.unisa.ac.za/handle/10500/24215 Rekenaar spraaksintese: die omskakeling van teks na klank Wagener, M.J. Verslag word gelewer oor die ontwikkeling en implementering van 'n stel letter-na-klank reels vir die omskakeling van Afrikaanse teks na foneme. 'n Inleidende oorsig van rekenaar spraaksintese en 'n kort beskrywing van die verskillende metodes van teks na klank transkripsie, word ook gegee. 1987-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24214 Polygon shading on vector type devices Scheepers, C.F. A method is presented whereby the interior of boundary-defined regions on vector type devices may be shaded using regular line, cross-hatch and dot patterns. Different shades are realized by changing shading parameters such as line width, distance between consecutive lines or dots, and orientation of patterns. The algorithm partitions any polygon (not necessarily convex), into mutually exclusive, pseudo-monotone polygons that can then be shaded independently using a fast procedure. The partitioning process is based on the topology of the polygon, and notions such as type-1 and type-2 critical points are introduced. Shading is frequently used in computer graphics applications, such as cartography, engineering graphics, art, animation and hidden-line removal. 1987-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24213 Set-oriented functional style of programming Mueller, C.S.M. A novel way of programming, which starts with specific details of a particular example and abstracts these details into generalised sets, is proposed. The whole program is constructed around the definition of these sets. Once the structure and type of the sets have been specified, the relationship between the sets is added to these set defintions. Thus, there is a move away from seeing the description of the data and relationships between the data as two separate parts, i.e., the data definition and the body of the block. This paper concentrates on the method used to develop programs, using a tutorial approach to illustrate the ease of programming, debugging and modifiablity. An interesting aspect of the method is how a program can be developed by studying the details in the problem domain using a procedural approach and abstracting them into a final declarative definition. 1987-01-01T00:00:00Z https://ir.unisa.ac.za/handle/10500/24211 A model for fault-tolerant computer systems Goosen, H.A.; Hoogendoorn, C.H.; Goosen Reliability is an important consideration in the design of computer systems. This is a result of the increasing complexity of computer systems and of the greater reliance placed on their continuous and correct operation. In this paper we describe a model which can be used for the analysis and design of fault-tolerant computer systems [1]. Techniques for the achievement of fault tolerance usually consist of the following activities [2],[3]: • The detection of faults in the system. • Confining the effects of faults in the system. • Recovering from the effects of faults. These activities all rely on a knowledge of the failure modes of the system. The model described in this paper provides a systematic way of progressing from the specification of a system to its failure modes. As a first step in the formulation of the model, we will take a look at the structure of a typical computer system. 1987-01-01T00:00:00Z