Digital Repository

Browsing M.Sc. Computer Science by Title

DSpace/Manakin Repository

Browsing M.Sc. Computer Science by Title

Sort by: Order: Results:

  • Automatic evolution of conceptual building architectures 
    Coia, Corrado (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 ...
  • Bio-inspired optimization & sampling technique for side-chain packing in MCCE 
    Comte, Pascal (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 
    Sun, Jing. (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 ...
  • Comparison of classification ability of hyperball algorithms to neural network and k-nearest neighbour algorithms 
    Zibamanzar-Mofrad, Tanaby (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, ...
  • Decoding algorithms using side-effect machines 
    Brown, Joseph Alexander (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 ...
  • Evolution of architectural floor plans 
    Flack, Robert W. J. (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 
    Imada, Janine. (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 
    Aameri, Bahar (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 ...
  • Formalizing affordances in situation 
    Lenarcic, Adam (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 ...
  • Generating finite integral relation algebras 
    Zhang, Si (Brock University, 2011-03-08)
    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 well-behaved ...
  • Genetic programming for the RoboCup Rescue Simulation System 
    Runka, Andrew (Brock University, 2011-03-08)
    The Robocup Rescue Simulation System (RCRSS) is a dynamic system of multi-agent interaction, simulating a large-scale urban disaster scenario. Teams of rescue agents are charged with the tasks of minimizing civilian ...
  • Particle swarm optimization for two-connected networks with bounded rings 
    Foxwell, Earl Brendan. (Brock University, 2009-01-28)
    The Two-Connected 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 
    Li, Yifeng (Brock University, 2010-03-09)
    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 n-star, the (n, k )-arrangement graph is ...
  • Properties and algorithms of the (n, k)-star graphs 
    He, Liang. (Brock University, 2009-01-28)
    The (n, k)-star interconnection network was proposed in 1995 as an attractive alternative to the n-star topology in parallel computation. The (n, k )-star has significant advantages over the n-star which itself was ...
  • Properties and algorithms of the hyper-star graph and its related graphs 
    Zhang, Fan. (Brock University, 2010-03-09)
    The hyper-star 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 
    Yin, Xiang (Brock University, 2010-03-09)
    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 
    Ahmed, Zafor (Brock University, 2010-10-26)
    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 ...
  • Towards automated derivation in the theory of allegories 
    Glanfield, Joel. (Brock University, 2008-02-16)
    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 ...
  • Using genetic algorithms for the single allocation hub location problem 
    Naeem, Mohammad (Brock University, 2010-10-25)
    Hub location problem is an NP-hard problem that frequently arises in the design of transportation and distribution systems, postal delivery networks, and airline passenger flow. This work focuses on ...
  • Winâ Foy : functional object-oriented programming language 
    Foy, Grant. (Brock University, 2009-01-28)
    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 ...

Search The Repository


Browse

My Account

Statistics


About the Digital Repository