Abstract A Way to Incorporate Neural Networks into Expert Systems (2009)
It is well known that both major directions of AI research Neural Networks and Expert Systems exhibit their strengths and weaknesses in almost complementary way. While neural networks are not good in...
There exist various tools for knowledge representation, modelling, and simulation in Artificial Intelligence. We have designed and built a software tool (expert system shell) called McESE (McMaster...
INDUCING PARAMETERS OF A DECISION TREE FOR EXPERT SYSTEM SHELL MCESE BY GENETIC ALGORITHM (2008)
classification, data analysis. There exist various tools for knowledge representation, modelling, and simulation in Artificial Intelligence. We have designed and built a software tool (expert system...
McESE- McMaster EXPERT SYSTEM ENVIRONMENT (2008)
McESE is an expert system environment (a software tool) designed to help create problem-specific shells with incomplete and uncertain knowledge, fast and compact expert system applications in a...
F. Franek, W. F. Smyth, X. Xiao
Abstract. The space requirement of Crochemore’s repetitions algorithm is generally estimated to be about 20mn bytes of memory, where n is the length of the input string and m the number of bytes...
Abstract Simulation of Petri Nets in Rule-Based Expert System Shell (2008)
There exist various tools for knowledge representation and modelling in artificial intelligence. We have designed and built a software tool called McESE (McMaster Expert System Environment) that...
Reconstructing a Suffix Array (2008)
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix...
Ramsey problem on Multiplicities of Complete Subgraphs in Nearly Quasirandom Graphs. (2008)
Let kt(G) be the number of cliques of order t in the graph G. For a graph G with n vertices let ct(G) = kt(G)+kt ( ¯ G) ( n. Let ct(n) = t) Min{ct(G) : |G | = n} and let ct = limn→ ∞ ct(n). An...
Abstract. Simulation of Neural Nets in McESE. (2008)
=F=> T, where F is so-called certainty value propagation function (CVPF), and it takes as its arguments the certainty values of the left-hand side terms T1,..., Tn, and returns a certainty value...
Two-factorizations of small complete graphs (2008)
Abstract. We enumerate 2-factorizations of K9 of all types, as well as those of several types for K11. 1.
Introduction. On a Class of Linear Spaces with 16 Points (2008)
A class in a language school for recent immigrants consists of 16 girls, of whom 4 are Chinese, 4 are Czech, 4 are Cuban, and 4 are Congolese. The girls study in groups of three, no two of the same
Reconstructing a Suffix Array (2008)
Abstract. For certain problems (for example, computing repetitions and repeats, data compression applications) it is not necessary that the suffixes of a string represented in a suffix tree or suffix...
F. Franek, W. F. Smyth, X. Xiao
Abstract. The space requirement of Crochemore’s repetitions algorithm is generally estimated to be about 20MN bytes of memory, where N is the length of the input string and M the number of bytes...
Technical Report containing detail proofs for paper: Sorting suffixes of two-pattern strings (2004)
First, for completeness, we present the actual paper: Recently, several authors presented linear recursive algorithms for sorting suffixes of a string. All these algorithms employ a similar...
On large sets of v-1 L-intersecting Steiner triple systems of order v (2002)
Franek, F., Grannell, M.J., Griggs, T.S., Rosa, A.
This paper presents four new recursive constructions for large sets of v–1 STS(v). These facilitate the production of several new infinite families of such large sets. In particular, we obtain for...
Completing the spectrum of 2-chromatic S(2, 4, v) (2002)
Franek, F., Griggs, T.S., Lindner, C.C, Rosa, A.
We construct 2-chromatic S(2,4,v) for v=37,40, and 73. This completes the proof of the existence of 2-chromatic Steiner systems S(2,4,v) [equivalently, of Steiner systems S(2,4,v) with a blocking...