Browsing M.Sc. Computer Science by Title
Now showing items 1-20 of 59
-
An Abstract Algebraic Theory of L-Fuzzy Relations for Relational Databases
Classical relational databases lack proper ways to manage certain real-world situations including imprecise or uncertain data. Fuzzy databases overcome this limitation by allowing each entry in the table to be a fuzzy set ... -
Automatic evolution of conceptual building architectures
(2012-04-03)This thesis describes research in which genetic programming is used to automatically evolve shape grammars that construct three dimensional models of possible external building architectures. A completely automated ... -
Automatic Inference of Graph Models for Complex Networks with Genetic Programming
(Brock University, 2013-07-26)Complex networks can arise naturally and spontaneously from all things that act as a part of a larger system. From the patterns of socialization between people to the way biological systems organize themselves, complex ... -
Automatic Structure Generation using Genetic Programming and Fractal Geometry
(Brock University, 2012-02-09)Three dimensional model design is a well-known and studied field, with numerous real-world applications. However, the manual construction of these models can often be time-consuming to the average user, despite the ... -
Bio-inspired optimization & sampling technique for side-chain packing in MCCE
(Brock University, 2010-10-26)The prediction of proteins' conformation helps to understand their exhibited functions, allows for modeling and allows for the possible synthesis of the studied protein. Our research is focused on ... -
Bounds on edit metric codes with combinatorial DNA constraints
(Brock University, 2010-03-09)The design of a large and reliable DNA codeword library is a key problem in DNA based computing. DNA codes, namely sets of fixed length edit metric codewords over the alphabet {A, C, G, T}, satisfy certain combinatorial ... -
Characterizing Dynamic Optimization Benchmarks for the Comparison of Multi-Modal Tracking Algorithms
Population-based metaheuristics, such as particle swarm optimization (PSO), have been employed to solve many real-world optimization problems. Although it is of- ten sufficient to find a single solution to these problems, ... -
Comparison of classification ability of hyperball algorithms to neural network and k-nearest neighbour algorithms
(2012-04-03)The main focus of this thesis is to evaluate and compare Hyperbalilearning algorithm (HBL) to other learning algorithms. In this work HBL is compared to feed forward artificial neural networks using back propagation learning, ... -
Construction of I-Deletion-Correcting Ternary Codes
(2013-04-08)Finding large deletion correcting codes is an important issue in coding theory. Many researchers have studied this topic over the years. Varshamov and Tenegolts constructed the Varshamov-Tenengolts codes (VT codes) and ... -
Decoding algorithms using side-effect machines
(Brock University, 2010-03-09)Bioinformatics applies computers to problems in molecular biology. Previous research has not addressed edit metric decoders. Decoders for quaternary edit metric codes are finding use in bioinformatics problems ... -
Disease-Gene Association Using a Genetic Algorithm
(Brock University, 2014-10-09)Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments ... -
Disease-Gene Association Using Genetic Programming
As a result of mutation in genes, which is a simple change in our DNA, we will have undesirable phenotypes which are known as genetic diseases or disorders. These small changes, which happen frequently, can have extreme ... -
Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture
(Brock University, 2012-11-07)As the complexity of evolutionary design problems grow, so too must the quality of solutions scale to that complexity. In this research, we develop a genetic programming system with individuals encoded as tree-based ... -
Equational Reasoning about Object-Oriented Programs
(2013-04-08)Formal verification of software can be an enormous task. This fact brought some software engineers to claim that formal verification is not feasible in practice. One possible method of supporting the verification process ... -
Evolution of architectural floor plans
(Brock University, 2011-10-13)Layout planning is a process of sizing and placing rooms (e.g. in a house) while a t t empt ing to optimize various criteria. Often the r e are conflicting c r i t e r i a such as construction ... -
Evolutionary synthesis of stochastic gene network models using feature-based search spaces
(Brock University, 2009-01-28)A feature-based fitness function is applied in a genetic programming system to synthesize stochastic gene regulatory network models whose behaviour is defined by a time course of protein expression levels. Typically, ... -
Extending relAPS to first order logic
(Brock University, 2011-03-08)RelAPS is an interactive system assisting in proving relation-algebraic theorems. The aim of the system is to provide an environment where a user can perform a relation-algebraic proof similar to doing it using pencil ... -
Feature Selection and Classification Using Age Layered Population Structure Genetic Programming
The curse of dimensionality is a major problem in the fields of machine learning, data mining and knowledge discovery. Exhaustive search for the most optimal subset of relevant features from a high dimensional dataset is ... -
Formalizing affordances in situation
(2012-04-03)The representation of a perceptual scene by a computer is usually limited to numbers representing dimensions and colours. The theory of affordances attempted to provide a new way of representing an environment, with ... -
GA approach for finding Rough Set decision rules based on bireducts
Feature selection plays an important role in knowledge discovery and data mining nowadays. In traditional rough set theory, feature selection using reduct - the minimal discerning set of attributes - is an important area. ...