Digital Repository

Browsing M.Sc. Computer Science by Title

DSpace/Manakin Repository

Browsing M.Sc. Computer Science by Title

Sort by: Order: Results:

  • 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 ...
  • Barry, William (Brock University, 2012-11-07)
    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 ...
  • 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 ...
  • Siddavaatam, Prathap (2013-04-15)
    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 ...
  • Derka, Martin (Brock University, 2012-09-18)
    Self-dual doubly even linear binary error-correcting codes, often referred to as Type II codes, are codes closely related to many combinatorial structures such as 5-designs. Extremal codes are codes that have the largest ...
  • Baniasadi, Maryam (Brock University, 2013-04-18)
    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 non-photorealistic (NPR) styles, by ...
  • 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 ...
  • Edalatmanesh, Mahmood (Brock University, 2013-09-12)
    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 ...
  • Peters, Darren (2013-04-11)
    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 ...
  • Mahmood, Shahid (2013-04-09)
    Rough Set Data Analysis (RSDA) is a non-invasive 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, ...
  • Das, Tuhin Kanti (Brock University, 2012-10-11)
    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 well-known Hoare Logic can be ...
  • Alizadeh Noori, Farhad (Brock University, 2012-09-18)
    Understanding the machinery of gene regulation to control gene expression has been one of the main focuses of bioinformaticians for years. We use a multi-objective genetic algorithm to evolve a specialized version of ...
  • Asobiela, Stephen Yamzuuga (Brock University, 2013-09-12)
    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 origin-destination ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • 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 ...
  • Atampore, Francis (Brock University, 2012-09-18)
    Relation algebras is one of the state-of-the-art 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 ...

Search The Repository


Browse

My Account

Statistics


About the Digital Repository