M.Sc. Computer Science
Browse by
Recent Submissions

MultiObjective Genetic Algorithms for the Single Allocation Hub Location Problem
(Brock University, 20130912)Hub Location Problems play vital economic roles in transportation and telecommunication networks where goods or people must be efficiently transferred from an origin to a destination point whilst direct origindestination ... 
Heuristics for the Critical Node Detection Problem in Large Complex Networks
(Brock University, 20130912)Complex networks have recently attracted a significant amount of research attention due to their ability to model real world phenomena. One important problem often encountered is to limit diffusive processes spread over ... 
Automatic Inference of Graph Models for Complex Networks with Genetic Programming
(Brock University, 20130726)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 ... 
Genetic Programming for NonPhotorealistic Rendering
(Brock University, 20130418)This thesis focuses on developing an evolutionary art system using genetic programming. The main goal is to produce new forms of evolutionary art that filter existing images into new nonphotorealistic (NPR) styles, by ... 
Generating Relation Algebras for Qualitative Spatial Reasoning
(20130415)Basic relationships between certain regions of space are formulated in natural language in everyday situations. For example, a customer specifies the outline of his future home to the architect by indicating which rooms ... 
Improving Short DNA Sequence Alignment with Parallel Computing
(20130411)Variations in different types of genomes have been found to be responsible for a large degree of physical diversity such as appearance and susceptibility to disease. Identification of genomic variations is difficult and ... 
Improving the Scalability of Reduct Determination in Rough Sets
(20130409)Rough Set Data Analysis (RSDA) is a noninvasive data analysis approach that solely relies on the data to find patterns and decision rules. Despite its noninvasive approach and ability to generate human readable rules, ... 
Construction of IDeletionCorrecting Ternary Codes
(20130408)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 VarshamovTenengolts codes (VT codes) and ... 
Equational Reasoning about ObjectOriented Programs
(20130408)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 ... 
Generating Aesthetically Pleasing Images in a Virtual Environment using Particle Swarm Optimization
(Brock University, 20121107)This research focuses on generating aesthetically pleasing images in virtual environments using the particle swarm optimization (PSO) algorithm. The PSO is a stochastic population based search algorithm that is inspired ... 
Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture
(Brock University, 20121107)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 treebased ... 
A System for Models of First Order Theories
(20121012)If you want to know whether a property is true or not in a specific algebraic structure,you need to test that property on the given structure. This can be done by hand, which can be cumbersome and erroneous. In addition, ... 
An Interactive Theorem Prover for FirstOrder Dynamic Logic
(Brock University, 20121011)Dynamic logic is an extension of modal logic originally intended for reasoning about computer programs. The method of proving correctness of properties of a computer program using the wellknown Hoare Logic can be ... 
Generator Matrix Based Search for Extremal SelfDual Binary ErrorCorrecting Codes
(Brock University, 20120918)Selfdual doubly even linear binary errorcorrecting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5designs. Extremal codes are codes that have the largest ... 
RelMDDA Library for Manipulating Relations Based on MDDs
(Brock University, 20120918)Relation algebras is one of the stateoftheart means used by mathematicians and computer scientists for solving very complex problems. As a result, a computer algebra system for relation algebras called RelView has ... 
A MultiObjective Genetic Algorithm with Side Effect Machines for Motif Discovery
(Brock University, 20120918)Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multiobjective genetic algorithm to evolve a specialized version of ... 
Automatic evolution of conceptual building architectures
(20120403)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 ... 
Formalizing affordances in situation
(20120403)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 ... 
Comparison of classification ability of hyperball algorithms to neural network and knearest neighbour algorithms
(20120403)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, ... 
The Salmon Algorithm  A New Population Based Search Metaheuristic
(Brock University, 20120302)This thesis introduces the Salmon Algorithm, a search metaheuristic which can be used for a variety of combinatorial optimization problems. This algorithm is loosely based on the path finding behaviour of salmon swimming ...