<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:dc="http://purl.org/dc/elements/1.1/">
<title>South African Computer Journal 1992(7)</title>
<link href="https://ir.unisa.ac.za/handle/10500/23880" rel="alternate"/>
<subtitle/>
<id>https://ir.unisa.ac.za/handle/10500/23880</id>
<updated>2026-05-09T05:07:11Z</updated>
<dc:date>2026-05-09T05:07:11Z</dc:date>
<entry>
<title>Network partitions in distributed databases</title>
<link href="https://ir.unisa.ac.za/handle/10500/24042" rel="alternate"/>
<author>
<name>Viktor, HL</name>
</author>
<author>
<name>Rennhackkamp, MH</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24042</id>
<updated>2018-05-24T01:00:44Z</updated>
<published>1992-01-01T00:00:00Z</published>
<summary type="text">Network partitions in distributed databases
Viktor, HL; Rennhackkamp, MH
The technology of distributed databases is based on two other technologies which have developed a solid foundation: computer networks and centralized databases. A distributed database designer should therefore address database-related as well as network-related issues.&#13;
Provision has to be made for the detection of and recovery from failure of the database as well as the network components. One type of failure resulting from distribution is network partitions. During a network failure the sites of the distributed database are subdivided into two or more disjoint groups. These groups continue processing newly submitted transactions without any knowledge of the operations at the sites in the other partition groups. Since data may be replicated, the various copies of a data item may be updated inconsistently at the different partition groups.&#13;
When handling continued transaction processing during network partitions, a trade-off is made between the level of availability and the consistency provided by the system. Pessimistic partition processing strategies ensure database consistency by reducing availability. The token lists pessimistic partition processing strategy, which utilizes a reliable&#13;
broadcasting facility, proved to be the best for the system under consideration.
</summary>
<dc:date>1992-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Animating neural network training</title>
<link href="https://ir.unisa.ac.za/handle/10500/24041" rel="alternate"/>
<author>
<name>van der Poel, E</name>
</author>
<author>
<name>Cloete, I</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24041</id>
<updated>2018-05-24T01:01:03Z</updated>
<published>1992-01-01T00:00:00Z</published>
<summary type="text">Animating neural network training
van der Poel, E; Cloete, I
In Artificial Neural Network (ANN) simulation it is usually necessary to examine the behaviour of the ANN and detect problems if they occur. However, due to the large volume and high dimensionality of data generated during ANN simulation, interpretation of results is difficult. By using visualisation techniques, such as simple animated faces, problems that occur during the training of a back-propagation neural network can be detected and analyzed. The dynamic behaviour of the network is also better understood when using animation as part of the visualization process.
</summary>
<dc:date>1992-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Mechanising execution sequence semantics in HOL</title>
<link href="https://ir.unisa.ac.za/handle/10500/24040" rel="alternate"/>
<author>
<name>Tredoux, G</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24040</id>
<updated>2018-05-24T01:00:46Z</updated>
<published>1992-01-01T00:00:00Z</published>
<summary type="text">Mechanising execution sequence semantics in HOL
Tredoux, G
The mechanization in Higher Order Logic of a general- purpose operational semantics for programming languages is described. The mechanization allows the sound derivation of Dijkstra-style axiomatic semantics. A small programming language fragment is presented as an illustration.
</summary>
<dc:date>1992-01-01T00:00:00Z</dc:date>
</entry>
<entry>
<title>Automatically linking words and concepts in an Afrikaans dictionary</title>
<link href="https://ir.unisa.ac.za/handle/10500/24039" rel="alternate"/>
<author>
<name>Theron, PZ</name>
</author>
<author>
<name>Cloete, I</name>
</author>
<id>https://ir.unisa.ac.za/handle/10500/24039</id>
<updated>2018-05-24T01:01:11Z</updated>
<published>1992-01-01T00:00:00Z</published>
<summary type="text">Automatically linking words and concepts in an Afrikaans dictionary
Theron, PZ; Cloete, I
The problem of automatic acquisition of lexical-semantic relations for Afrikaans nouns from a dictionary is addressed. The acquisition process is improved over previous approaches by implementing both typographic constraints in patterns, and by automating the acquisition of syntactic patterns. Results for the noun taxonomy relation IS-A and semantic feature IS-HUMAN show that ambiguity can successfully be resolved with the patterns obtained.
</summary>
<dc:date>1992-01-01T00:00:00Z</dc:date>
</entry>
</feed>
