Browsing M.Sc. Computer Science by Title
Now showing items 1534 of 38

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 ... 
Generating finite integral relation algebras
(Brock University, 20110308)Relation algebras and categories of relations in particular have proven to be extremely useful as a fundamental tool in mathematics and computer science. Since relation algebras are Boolean algebras with some wellbehaved ... 
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 ... 
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 ... 
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 ... 
Genetic programming for the RoboCup Rescue Simulation System
(Brock University, 20110308)The Robocup Rescue Simulation System (RCRSS) is a dynamic system of multiagent interaction, simulating a largescale urban disaster scenario. Teams of rescue agents are charged with the tasks of minimizing civilian ... 
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 ... 
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, ... 
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 ... 
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 ... 
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 ... 
Particle swarm optimization for twoconnected networks with bounded rings
(Brock University, 20090128)The TwoConnected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle ... 
Properties and algorithms of the (n, k)arrangement graphs
(Brock University, 20100309)The (n, k)arrangement interconnection topology was first introduced in 1992. The (n, k )arrangement graph is a class of generalized star graphs. Compared with the well known nstar, the (n, k )arrangement graph is ... 
Properties and algorithms of the (n, k)star graphs
(Brock University, 20090128)The (n, k)star interconnection network was proposed in 1995 as an attractive alternative to the nstar topology in parallel computation. The (n, k )star has significant advantages over the nstar which itself was ... 
Properties and algorithms of the hyperstar graph and its related graphs
(Brock University, 20100309)The hyperstar interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some ... 
Quadtree representation and compression of spatial data
(Brock University, 20100309)Spatial data representation and compression has become a focus issue in computer graphics and image processing applications. Quadtrees, as one of hierarchical data structures, basing on the principle of recursive ... 
ReAlM  a system to manipulate relations
(Brock University, 20101026)Given a heterogeneous relation algebra R, it is well known that the algebra of matrices with coefficient from R is relation algebra with relational sums that is not necessarily finite. When a ... 
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 ... 
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 ...