Department of Computing & Information Technology
Permanent URI for this community
Browse
Browsing Department of Computing & Information Technology by Title
Now showing 1 - 20 of 93
Results Per Page
Sort Options
Item Analysis of teacher absenteeism in secondary schools(2012-03-19) Umraw, AlanItem The analysis, design and development of a financial management system(2012-02-27) Jarvis, JacekItem Application of limited business intelligence in an object oriented sales and inventory system(2012-03-19) Flemming, RyanItem An Approach to fingerprint analysis, feature extraction and pattern matching(2012-03-26) Phillips, LauriceItem Auditing implementation in an oracle database with monitoring application(2012-03-19) Bowen, Johanne MarciaItem Auditing in a payment system(2012-03-26) Ram-Atwaroo, NeelaItem Item Automated design and drawing of graphs(2008-11-21T15:08:19Z) Bernard, MargaretItem Better Global Polynomial Approximation for Image Rectification(2011-06-14) Ward, ChristopherWhen using images to locate objects, there is the problem of correcting for distortion and misalignment in the images. An elegant way of solving this problem is to generate an error correcting function that maps points in an image to their corrected locations. We generate such a function by fitting a polynomial to a set of sample points. The objective is to identify a polynomial that passes "sufficiently close" to these points with "good" approximation of intermediate points. In the past, it has been difficult to achieve good global polynomial approximation using only sample points. We report on the development of a global polynomial approximation algorithm for solving this problem.Item Better Global Polynomial Approximation for Image Rectification(2009-11-10T15:41:40Z) Ward, ChristopherWhen using images to locate objects, there is the problem of correcting for distortion and misalignment in the images. An elegant way of solving this problem is to generate an error correcting function that maps points in an image to their corrected locations. We generate such a function by fitting a polynomial to a set of sample points. The objective is to identify a polynomial that passes "sufficiently close" to these points with "good" approximation of intermediate points. In the past, it has been difficult to achieve good global polynomial approximation using only sample points. We report on the development of a global polynomial approximation algorithm for solving this problem.Item Burrokeet(2010-11-19T16:42:25Z) Gardler, Ross; Singh, Rajendra G.; Cummings, Thompson; Ramanan, Anil; Mohammed, Shareeda; Bernard, Margaret; Rudder, AndrewThis item relates to the development and deployment of an open-source Learning Content Management System called Burrokeet.Item A Case study on the implementation and testing of a Linux cluster environment in a University department(2012-03-26) Seegobin, Naresh RienzieItem COMPARING A NOVEL QOS ROUTING ALGORITHM TO STANDARD(2010-11-19T16:42:41Z) Sivakumar, Shyamala; Phillips, Bill; Robertson, William; Goodridge S., WayneThe problem of finding QoS paths involving several combinations of network metrics is NP-complete. This motivates the use of heuristic approaches for finding feasible QoS paths. Many constraint based routing algorithms find QoSpaths by first pruning resources that do not satish the requirements of the trafic flow and then running a shortest path algorithm on the residual graph. This approach results in a QoS path that biases thefirst metric used in the search process. In addition, it can be shown that this approach may not alwaysfind the optimal path. Our research introduces a QoS routing algorithm that is based on a decision support system that is used to compute QoS paths. We demonstrate the feasibility of this approach by comparing it to standard pruning techniques.Item Computational intelligence-based personalization of interactive web systems(2011-06-14) Rambharose, Tricia; Nikov, AlexanderThe main Computational Intelligence (CI) models for personalization of interactive web systems are identified as Fuzzy Systems, Genetic Algorithms, Neural Networks, Artificial Immune Systems and Swarm Intelligence which includes Particle Swarm Optimization, Ant Colony Optimization, Bee Colony Optimization and Wasp Colony Optimization. These models are reviewed and compared regarding their inception, functions, performance and application to personalization of interactive web systems. A taxonomy for personalization of interactive web systems based on CI methods is proposed. It uses two approaches to personalize web-based systems as profile generation and profile exploitation. Based on this taxonomy a general procedure and recommendations for personalization of interactive web systems are suggested. Future directions for application of CI modelling for personalization are discussed.Item Computer Based Learning(2012-03-26) Ali, Lila YasminItem A Control Structure for Intelligent Emotion-Oriented eCommerce Systems(Proceedings of the World Congress on Engineering 2010, 2010) Leon, Simone; Nikov, Alexander; Chadee, DerekItem Creating sharable learning objects from existing digital course content(31st Annual International Symposium on Computer Architecture Conference Proceedings, IEEE Computer Society, 2004) Singh, Rajendra G.; Bernard, Margaret; Gardler, RossItem Customising an open source application for use as a school website generator(2012-03-26) Mouget, EduardItem A data warehouse for retail sales : A Caribbean experience(2012-03-26) Chung, Roger Anthony Kevin