Topic Maps for Specifying Algorithm Taxonomies : a case Study using Transitive Closure Algorithms

Show simple item record

dc.contributor.advisor Kourie, Derrick G.
dc.contributor.coadvisor Watson, Bruce William
dc.contributor.coadvisor Cleophas, L.G.W.A. (Loek)
dc.contributor.postgraduate Pieterse, Vreda
dc.date.accessioned 2017-03-07T10:19:18Z
dc.date.available 2017-03-07T10:19:18Z
dc.date.created 2017-05-05
dc.date.issued 2016
dc.description Thesis (PhD)--University of Pretoria, 2016. en_ZA
dc.description.abstract The need for storing and retrieving knowledge about algorithms is addressed by creating a specialised information management scheme. This scheme is operationalised in terms of a topic map of algorithms. Metadata are specified for the adequate and precise description of algorithms. The specification describes both the data elements (called attributes) that are relevant to algorithms as well as the relationship of attributes to one another. In addition, a process is formalised for gathering data about algorithms and capturing it in the proposed topic map. The proposed process model and representation scheme are then illustrated by applying them to gather and represent information about transitive closure algorithms. To ensure that this thesis is self-contained, several themes about transitive closures are covered comprehensively. These include the mathematical domain-specific knowledge about transitive closures, methods for calculating the transitive closure of binary relations and techniques that can be applied in transitive closure algorithms. The work presented in this thesis has a multidisciplinary character. It contributes to the domains of formal aspects, algorithms, mathematical sciences, information sciences and software engineering. It has a strong formal foundation. The confirmation of the correctness of algorithms as well as reasoning regarding the complexity of algorithms are key aspects of this thesis. The content of this thesis revolves around algorithms: their attributes; how they relate to one another; and how new versions of the algorithms may be discovered. The introduction of new mathematical concepts and notational elements as well as new rigorous proofs contained in the thesis, extend the mathematical science domain. The main problem addressed in this thesis is an information management need. The technology, namely topic maps, used here to address the problem originated in the information science domain. It is applied in a new context that ultimately has the potential to lead to the automation of aspects of software implementation. This influences the traditional software engineering life cycle and quality of software products. en_ZA
dc.description.availability Unrestricted en_ZA
dc.description.degree PhD en_ZA
dc.description.department Computer Science en_ZA
dc.identifier.citation Pieterse, V 2016, Topic Maps for Specifying Algorithm Taxonomies : a case Study using Transitive Closure Algorithms, PhD Thesis, University of Pretoria, Pretoria, viewed yymmdd <http://hdl.handle.net/2263/59307> en_ZA
dc.identifier.other A2017 en_ZA
dc.identifier.uri http://hdl.handle.net/2263/59307
dc.language.iso en en_ZA
dc.publisher University of Pretoria
dc.rights © 2017 University of Pretoria. All rights reserved. The copyright in this work vests in the University of Pretoria. No part of this work may be reproduced or transmitted in any form or by any means, without the prior written permission of the University of Pretoria. en_ZA
dc.subject Computer Science en_ZA
dc.subject UCTD
dc.title Topic Maps for Specifying Algorithm Taxonomies : a case Study using Transitive Closure Algorithms en_ZA
dc.type Thesis en_ZA


Files in this item

This item appears in the following Collection(s)

Show simple item record