Cogitator : a parallel, fuzzy, database-driven expert system

**Authors:**Baise, Paul**Date:**1994 , 2012-10-08**Subjects:**Expert systems (Computer science) , Artificial intelligence -- Computer programs , System design , Cogitator (Computer system)**Language:**English**Type:**Thesis , Masters , MSc**Identifier:**vital:4667 , http://hdl.handle.net/10962/d1006684 , Expert systems (Computer science) , Artificial intelligence -- Computer programs , System design , Cogitator (Computer system)**Description:**The quest to build anthropomorphic machines has led researchers to focus on knowledge and the manipulation thereof. Recently, the expert system was proposed as a solution, working well in small, well understood domains. However these initial attempts highlighted the tedious process associated with building systems to display intelligence, the most notable being the Knowledge Acquisition Bottleneck. Attempts to circumvent this problem have led researchers to propose the use of machine learning databases as a source of knowledge. Attempts to utilise databases as sources of knowledge has led to the development Database-Driven Expert Systems. Furthermore, it has been ascertained that a requisite for intelligent systems is powerful computation. In response to these problems and proposals, a new type of database-driven expert system, Cogitator is proposed. It is shown to circumvent the Knowledge Acquisition Bottleneck and posess many other advantages over both traditional expert systems and connectionist systems, whilst having non-serious disadvantages. , KMBT_223**Full Text:****Date Issued:**1994

**Authors:**Baise, Paul**Date:**1994 , 2012-10-08**Subjects:**Expert systems (Computer science) , Artificial intelligence -- Computer programs , System design , Cogitator (Computer system)**Language:**English**Type:**Thesis , Masters , MSc**Identifier:**vital:4667 , http://hdl.handle.net/10962/d1006684 , Expert systems (Computer science) , Artificial intelligence -- Computer programs , System design , Cogitator (Computer system)**Description:**The quest to build anthropomorphic machines has led researchers to focus on knowledge and the manipulation thereof. Recently, the expert system was proposed as a solution, working well in small, well understood domains. However these initial attempts highlighted the tedious process associated with building systems to display intelligence, the most notable being the Knowledge Acquisition Bottleneck. Attempts to circumvent this problem have led researchers to propose the use of machine learning databases as a source of knowledge. Attempts to utilise databases as sources of knowledge has led to the development Database-Driven Expert Systems. Furthermore, it has been ascertained that a requisite for intelligent systems is powerful computation. In response to these problems and proposals, a new type of database-driven expert system, Cogitator is proposed. It is shown to circumvent the Knowledge Acquisition Bottleneck and posess many other advantages over both traditional expert systems and connectionist systems, whilst having non-serious disadvantages. , KMBT_223**Full Text:****Date Issued:**1994

Real options valuation for South African nuclear waste management using a fuzzy mathematical approach

**Authors:**Montsho, Obakeng Johannes**Date:**2013 , 2013-06-06**Subjects:**Fuzzy mathematics , Real options (Finance) , Fuzzy sets , Business mathematics , Radioactive waste disposal -- South Africa**Language:**English**Type:**Thesis , Masters , MSc**Identifier:**vital:5398 , http://hdl.handle.net/10962/d1003051 , Fuzzy mathematics , Real options (Finance) , Fuzzy sets , Business mathematics , Radioactive waste disposal -- South Africa**Description:**The feasibility of capital projects in an uncertain world can be determined in several ways. One of these methods is real options valuation which arose from financial option valuation theory. On the other hand fuzzy set theory was developed as a mathematical framework to capture uncertainty in project management. The valuation of real options using fuzzy numbers represents an important refinement to determining capital projects' feasibility using the real options approach. The aim of this study is to determine whether the deferral of the decommissioning time (by a decade) of an electricity-generating nuclear plant in South Africa increases decommissioning costs. Using the fuzzy binomial approach, decommissioning costs increase when decommissioning is postponed by a decade whereas use of the fuzzy Black-Scholes approach yields the opposite result. A python code was developed to assist in the computation of fuzzy binomial trees required in our study and the results of the program are incorporated in this thesis. , KMBT_363 , Adobe Acrobat 9.54 Paper Capture Plug-in**Full Text:****Date Issued:**2013

**Authors:**Montsho, Obakeng Johannes**Date:**2013 , 2013-06-06**Subjects:**Fuzzy mathematics , Real options (Finance) , Fuzzy sets , Business mathematics , Radioactive waste disposal -- South Africa**Language:**English**Type:**Thesis , Masters , MSc**Identifier:**vital:5398 , http://hdl.handle.net/10962/d1003051 , Fuzzy mathematics , Real options (Finance) , Fuzzy sets , Business mathematics , Radioactive waste disposal -- South Africa**Description:**The feasibility of capital projects in an uncertain world can be determined in several ways. One of these methods is real options valuation which arose from financial option valuation theory. On the other hand fuzzy set theory was developed as a mathematical framework to capture uncertainty in project management. The valuation of real options using fuzzy numbers represents an important refinement to determining capital projects' feasibility using the real options approach. The aim of this study is to determine whether the deferral of the decommissioning time (by a decade) of an electricity-generating nuclear plant in South Africa increases decommissioning costs. Using the fuzzy binomial approach, decommissioning costs increase when decommissioning is postponed by a decade whereas use of the fuzzy Black-Scholes approach yields the opposite result. A python code was developed to assist in the computation of fuzzy binomial trees required in our study and the results of the program are incorporated in this thesis. , KMBT_363 , Adobe Acrobat 9.54 Paper Capture Plug-in**Full Text:****Date Issued:**2013

A combinatorial analysis of barred preferential arrangements

**Authors:**Nkonkobe, Sithembele**Date:**2016**Language:**English**Type:**Thesis , Doctoral , PhD**Identifier:**http://hdl.handle.net/10962/36228 , vital:24530**Description:**For a non-negative integer n an ordered partition of a set Xn with n distinct elements is called a preferential arrangement (PA). A barred preferential arrangement (BPA) is a preferential arrangement with bars in between the blocks of the partition. An integer sequence an associated with the counting PA's of Xn has been intensely studied over a century and a half in many different contexts. In this thesis we develop a unified combinatorial framework to study the enumeration of BPAs and a special subclass of BPAs. The results of the study lead to a positive settlement of an open problem and a conjecture by Nelsen. We derive few important identities pertaining to the number of BPAs and restricted BPAs of an n element set using generating- functionology. Later we show that the number of restricted BPAs of Xn are intricately related to well-known numbers such as Eulerian numbers, Bell numbers, Poly-Bernoulli numbers and the number of equivalence classes of fuzzy subsets of Xn under some equivalent relation.**Full Text:****Date Issued:**2016

**Authors:**Nkonkobe, Sithembele**Date:**2016**Language:**English**Type:**Thesis , Doctoral , PhD**Identifier:**http://hdl.handle.net/10962/36228 , vital:24530**Description:**For a non-negative integer n an ordered partition of a set Xn with n distinct elements is called a preferential arrangement (PA). A barred preferential arrangement (BPA) is a preferential arrangement with bars in between the blocks of the partition. An integer sequence an associated with the counting PA's of Xn has been intensely studied over a century and a half in many different contexts. In this thesis we develop a unified combinatorial framework to study the enumeration of BPAs and a special subclass of BPAs. The results of the study lead to a positive settlement of an open problem and a conjecture by Nelsen. We derive few important identities pertaining to the number of BPAs and restricted BPAs of an n element set using generating- functionology. Later we show that the number of restricted BPAs of Xn are intricately related to well-known numbers such as Eulerian numbers, Bell numbers, Poly-Bernoulli numbers and the number of equivalence classes of fuzzy subsets of Xn under some equivalent relation.**Full Text:****Date Issued:**2016

Counting of finite fuzzy subsets with applications to fuzzy recognition and selection strategies

**Authors:**Talwanga, Matiki**Date:**2015**Subjects:**Möbius transformations , Fuzzy sets , Functions, Zeta , Partitions (Mathematics)**Language:**English**Type:**Thesis , Doctoral , PhD**Identifier:**vital:5431 , http://hdl.handle.net/10962/d1018186**Description:**The counting of fuzzy subsets of a finite set is of great interest in both practical and theoretical contexts in Mathematics. We have used some counting techniques such as the principle of Inclusion-Exclusion and the Mõbius Inversion to enumerate the fuzzy subsets of a finite set satisfying different conditions. These two techniques are interdependent with the M¨obius inversion generalizing the principle of Inclusion-Exclusion. The enumeration is carried out each time we redefine new conditions on the set. In this study one of our aims is the recognition and identification of fuzzy subsets with same features, characteristics or conditions. To facilitate such a study, we use some ideas such as the Hamming distance, mid-point between two fuzzy subsets and cardinality of fuzzy subsets. Finally we introduce the fuzzy scanner of elements of a finite set. This is used to identify elements and fuzzy subsets of a set. The scanning process of identification and recognition facilitates the choice of entities with specified properties. We develop a procedure of selection under the fuzzy environment. This allows us a framework to resolve conflicting issues in the market place.**Full Text:****Date Issued:**2015

**Authors:**Talwanga, Matiki**Date:**2015**Subjects:**Möbius transformations , Fuzzy sets , Functions, Zeta , Partitions (Mathematics)**Language:**English**Type:**Thesis , Doctoral , PhD**Identifier:**vital:5431 , http://hdl.handle.net/10962/d1018186**Description:**The counting of fuzzy subsets of a finite set is of great interest in both practical and theoretical contexts in Mathematics. We have used some counting techniques such as the principle of Inclusion-Exclusion and the Mõbius Inversion to enumerate the fuzzy subsets of a finite set satisfying different conditions. These two techniques are interdependent with the M¨obius inversion generalizing the principle of Inclusion-Exclusion. The enumeration is carried out each time we redefine new conditions on the set. In this study one of our aims is the recognition and identification of fuzzy subsets with same features, characteristics or conditions. To facilitate such a study, we use some ideas such as the Hamming distance, mid-point between two fuzzy subsets and cardinality of fuzzy subsets. Finally we introduce the fuzzy scanner of elements of a finite set. This is used to identify elements and fuzzy subsets of a set. The scanning process of identification and recognition facilitates the choice of entities with specified properties. We develop a procedure of selection under the fuzzy environment. This allows us a framework to resolve conflicting issues in the market place.**Full Text:****Date Issued:**2015

- «
- ‹
- 1
- ›
- »