Recent Submissions

  • Properties and Algorithms of the KCube Graphs 

    Zhao, Li (Brock University, 2014-03-24)
    The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube ...
  • New Contig Creation Algorithm for the de novo DNA Assembly Problem 

    Goodarzi, Mohammad (Brock University, 2014-02-25)
    DNA assembly is among the most fundamental and difficult problems in bioinformatics. Near optimal assembly solutions are available for bacterial and small genomes, however assembling large and complex genomes especially the ...
  • Region Connection Calculus: Composition Tables and Constraint Satisfaction Problems 

    Ghosh, Manas (Brock University, 2013-11-05)
    Qualitative spatial reasoning (QSR) is an important field of AI that deals with qualitative aspects of spatial entities. Regions and their relationships are described in qualitative terms instead of numerical values. This ...
  • Passive Solar Building Design Using Genetic Programming 

    Oraei Gholami, Mohammad Mahdi (Brock University, 2013-10-28)
    Passive solar building design is the process of designing a building while considering sunlight exposure for receiving heat in winter and rejecting heat in summer. The main goal of a passive solar building design is to ...
  • Hyperspectral Mineral Identification using SVM and SOM 

    Iranzad, Arash (Brock University, 2013-10-28)
    Remote sensing techniques involving hyperspectral imagery have applications in a number of sciences that study some aspects of the surface of the planet. The analysis of hyperspectral images is complex because of the large ...
  • Multi-Objective Genetic Algorithms for the Single Allocation Hub Location Problem 

    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 ...
  • Heuristics for the Critical Node Detection Problem in Large Complex Networks 

    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 ...
  • Automatic Inference of Graph Models for Complex Networks with Genetic Programming 

    Bailey, Alexander (Brock University, 2013-07-26)
    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 Non-Photorealistic Rendering 

    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 ...
  • Generating Relation Algebras for Qualitative Spatial Reasoning 

    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 ...
  • Improving Short DNA Sequence Alignment with Parallel Computing 

    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 ...
  • Improving the Scalability of Reduct Determination in Rough Sets 

    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, ...
  • Construction of I-Deletion-Correcting Ternary Codes 

    Li, Zhiyuan (2013-04-08)
    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 Varshamov-Tenengolts codes (VT codes) and ...
  • Equational Reasoning about Object-Oriented Programs 

    Hossain, Md. Nour (2013-04-08)
    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 

    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 ...
  • Enabling and Measuring Complexity in Evolving Designs using Generative Representations for Artificial Architecture 

    Harrington, Adrian (Brock University, 2012-11-07)
    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 tree-based ...
  • A System for Models of First Order Theories 

    AbdalBari, Anwar (2012-10-12)
    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 First-Order Dynamic Logic 

    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 ...
  • Generator Matrix Based Search for Extremal Self-Dual Binary Error-Correcting Codes 

    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 ...
  • RelMDD-A Library for Manipulating Relations Based on MDDs 

    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 ...

View more