N. Kodagoda

Internal Structure and Semantic Web Link Structure Based Ontology Ranking

The semantic Web is an extension of the World Wide Web with new technologies and standards that enable interpretation and processing of data and useful information for extraction by a computer. The World Wide Web Consortium (W3C) recommends XML, XML schema, RDF, RDF schema and Web Ontology Language (OWL) as standards and tools for the implementation of the semantic Web. Ontologies work as the main component in knowledge representation for the semantic Web. It is a data model that represents a set of concepts and the relationships between those concepts within a domain. Building an ontology starting from scratch is not an easy task since it makes heavy demands on time in addition to expert knowledge related to the domain. However, we can use the existing ontologies to develop semantic Web applications. But, there are a large number of ontologies available and the ontology search engine will generate a bulk of results with different ontologies for search queries. Therefore, ranking of ontologies is needed to find the most appropriate and relevant ontologies. We consider the ranking techniques and algorithms attached to the semantic Web: (i) Swoogle Ranking (ii) Ontokhoj Ranking (iii) OntoQA Ranking (iv) AKTiveRank (v) OntoSearch Ranking (vi) content-based ontology ranking (vii) SemSearch Ranking (viii) ReConRank. Our effort considers most popularly used ranking techniques and algorithms attached to the semantic Web. We analyze the above ontology ranking techniques with algorithms and then mainly categorize into two groups. One group is based on the semantic Web link structure and the other one is based on internal structure of the ontology. We identify that some features are not addressed in ranking of ontologies selected by the above ranking techniques and algorithms. Therefore, we propose a ranking method that considers both internal structure and semantic Web link structure of ontologies to improve the ranking of ontologies. We finally evaluate the proposed ranking method. According to the results with evaluation, we allocate more weighting for internal structure and low weighting for semantic Web link structure to get the best ranking results.

Improvements for agile manifesto and make agile applicable for undergraduate research projects

The paper describes the use of Agile software development methodology for undergraduate research projects. The students are required to do a project which spans for two academic semesters. The main objective is to see the appropriateness of Scrum for the undergraduate projects which is a widely used agile method at present in the software industry. The paper discusses main agile principles in the students viewpoint to check how those are affected to meet the learning outcomes of the module by means of meeting the deadlines and getting constructive feedback from supervisors. The circulated survey results are analyzed thoroughly and discussed to prove the arguments made during the research time and the recommendations are provided to improve appropriateness hence required changes for the agile principles. Finally it is positive feedback from the students about using Agile for undergraduate projects to achieve the targets given to them.

A parallel version of the in-close algorithm

This research paper presents a new parallel algorithm for computing the formal concepts in a formal context. The proposed shared memory parallel algorithm Parallel-Task-In-Close3 parallelizes Andrewss In-Close3 serial algorithm. The paper presents the key parallelization strategy used and presents experimental results of the parallelization using the OpenMP framework.

Comparision Between Features of CbO based Algorithms for Generating Formal Concepts

Formal Concept Analysis provides the mathematical notations for representing concepts and concept hierarchies making use of order and lattice theory. This has now been used in numerous applications which include software engineering, linguistics, sociology, information sciences, information technology, genetics, biology and in engineering. The algorithms derived from Kustenskovs CbO were found to provide the most efficient means of computing formal concepts in several research papers. In this paper key enhancements to the original CbO algorithms are discussed in detail. The effects of these key features are presented in both isolation and combination. Eight different variations of the CbO algorithms highlighting the key features were compared in a level playing field by presenting them using the same notation and implementing them from the notation in the same way. The three main enhancements considered are the partial closure with incremental closure of intents, inherited canonicity test failures and using a combined depth first and breadth first search. The algorithms were implemented in an un-optimized way to focus on the comparison on the algorithms themselves and not on any efficiencies provided by optimizing code. The main contribution of this paper is the complete comparison of the three main enhancements used in recent variations of the CbO based algorithms. The main findings were that there is a significant performance improvement partial closure with incremental closure of intents is used in isolation. However, there is no significant performance improvement when the depth and breadth first search or the inherited canonicity test failure feature is used in isolation. The inherited canonicity test failure needs to be combined with the combined depth and breadth first feature to obtain a performance increase. Combining all the three enhancements brought the best performance.

Improvements to a complexity metric: CB measure

Controlling the complexity of software applications is an essential part of the software development process as it directly affects maintenance activities such as reusability, understandability, modifiability and testability. However, as stated by Tom DeMarco “You cannot control what you cannot measure”. Thus, over the years many complexity metrics have been proposed with the intention of controlling and minimizing the complexity associated with software. However, majority of these proposed complexity metrics are based on only one aspect of complexity. The CB measure introduced by Chhillar and Bhasin is one metric which relies on a number of complexity factors to decide on the complexity of a program. However, it also has some shortcomings and can be further improved. Thus, this paper attempts to propose some additional complexity factors that the CB measure has not considered, to further improve it. The paper also presents an extensive coverage about the software complexity metrics proposed in the literature.

A Fully Functional Shopping Mall Application -- SHOPPING EYE

In the modern world, shopping has become an essential day to day activity for most of the people. However, their busy life style has lessened the time to do shopping. This has made them to look for quicker and easier ways to do their shopping. Some of the difficulties that people have to go through when they do shopping include having to travel a long distance without knowing the availability of the items, difficulty in finding relevant shops inside a shopping mall, forgetting to buy some items which they intended to buy. In order to overcome the above mentioned problems a fully functional shopping mall application is proposed in this paper. It contains details about all the shops inside a mall, available items, customer wish lists and a map. It consists of a mobile application developed using Android and a Server side module which act as a main database server for connecting with customers and shop owners. Both the modules communicate through web services. In this project wireless communication technique -- Bluetooth is used to identify the vertical and horizontal position of the customer. Augmented reality based technique is used to tag the shops with its promotions, loyalty points etc.

AUTOMATED CODE ANALYSER

Automated Code Analyzer is a software tool which is capable of providing an automated software metrics support for its users. It evaluates the quality of source codes and formulates schedule estimations according to a specified hierarchical metrics based model. It also generates Quality notices, analyses the results of metrics calculations, presents the system observations on a particular code and provide guidelines to resolve the problems observed by the system. The proposed software was designed based on four core metrics categories, namely Object Oriented, Complexity Oriented, Size Oriented and Maintainability Oriented. Unlike the existing metric calculators, this tool is capable of diminishing the problems that exists in the field of software engineering in addition to providing valuable information of a given source code using metrics.