Towards Information Management System for Licensing in Higher Education: An Ontology-Based Approach

Higher education licensing, i.e. the process of granting permissions to provide certain educational services, is an important process of public administration. Government al bodies handle licensing requests submitted by education providers regularly. Such requests are supplemented with large amounts of information that demonstrates the actual situation in an education provider. At present this process is paper based and in volves a lot of manual labor. This situation is similar for other types of education, e. g. primary and secondary, as well as form any countries. We, therefore, aim to computerize this process by creating a universal licensing information system (LIS). We base our approach on a domain ontology that defines the main concepts in the licensing process. In this paper we show how licensing process works now and propose the ways to make it more efficient. Then, we envisage the usage models of LIS, identify its main business actors and use cases, and provide a high-level architecture of the system. Finally, we present a fragment of the domain ontology in higher education domain

Implications of query caching for JXTA peers

This dissertation studies the caching of queries and how to cache in an efficient way, so that retrieving previously accessed data does not need any intermediary nodes between the data-source peer and the querying peer in super-peer P2P network. A precise algorithm was devised that demonstrated how queries can be deconstructed to provide greater flexibility for reusing their constituent elements. It showed how subsequent queries can make use of more than one previous query and any part of those queries to reconstruct direct data communication with one or more source peers that have supplied data previously. In effect, a new query can search and exploit the entire cached list of queries to construct the list of the data locations it requires that might match any locations previously accessed. The new method increases the likelihood of repeat queries being able to reuse earlier queries and provides a viable way of by-passing shared data indexes in structured networks. It could also increase the efficiency of unstructured networks by reducing traffic and the propensity for network flooding. In addition, performance evaluation for predicting query routing performance by using a UML sequence diagram is introduced. This new method of performance evaluation provides designers with information about when it is most beneficial to use caching and how the peer connections can optimize its exploitation