Browsing M.Sc. Computer Science by Issue Date
Now showing items 120 of 40

Towards automated derivation in the theory of allegories
(Brock University, 20080216)We provide an algorithm that automatically derives many provable theorems in the equational theory of allegories. This was accomplished by noticing properties of an existing decision algorithm that could be extended ... 
Evolutionary synthesis of stochastic gene network models using featurebased search spaces
(Brock University, 20090128)A featurebased 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, ... 
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)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 ... 
Winâ Foy : functional objectoriented programming language
(Brock University, 20090128)This thesis will introduce a new strongly typed programming language utilizing Self types, named Win*Foy, along with a suitable user interface designed specifically to highlight language features. The need for such a ... 
Bounds on edit metric codes with combinatorial DNA constraints
(Brock University, 20100309)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 ... 
Decoding algorithms using sideeffect machines
(Brock University, 20100309)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 ... 
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 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 ... 
Using genetic algorithms for the single allocation hub location problem
(Brock University, 20101025)Hub location problem is an NPhard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on ... 
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 ... 
Bioinspired optimization & sampling technique for sidechain packing in MCCE
(Brock University, 20101026)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 ... 
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 ... 
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 ... 
Extending relAPS to first order logic
(Brock University, 20110308)RelAPS is an interactive system assisting in proving relationalgebraic theorems. The aim of the system is to provide an environment where a user can perform a relationalgebraic proof similar to doing it using pencil ... 
Evolution of architectural floor plans
(Brock University, 20111013)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 ... 
Automatic Structure Generation using Genetic Programming and Fractal Geometry
(Brock University, 20120209)Three dimensional model design is a wellknown and studied field, with numerous realworld applications. However, the manual construction of these models can often be timeconsuming to the average user, despite the ... 
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 ... 
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 ...