The current prospects in wired and wireless access networks, it is becoming increasingly important to address potential convergence in order to offer integrated broadband services. These systems will need to offer higher data transmission capacities and long battery life, which is the catalyst for an everincreasing variety of air interface technologies targeting local area to wide area connectivity. Current integrated industrial networks do not offer application aware context delivery and enhanced services for optimised networks. Application aware services provide value-added functionality to business applications by capturing, integrating, and consolidating intelligence about users and their endpoint devices from various points in the network. This thesis mainly intends to resolve the issues related to ubiquitous application aware service, fair allocation of radio access, reduced energy consumption and improved capacity. A technique that measures and evaluates the data rate demand to reduce application response time and queuing delay for multi radio interfaces is proposed. The technique overcomes the challenges of network integration, requiring no user intervention, saving battery life and selecting the radio access connection for the application requested by the end user. This study is split in two parts. The first contribution identifies some constraints of the services towards the application layer in terms of e.g. data rate and signal strength. The objectives are achieved by application controlled handover (ACH) mechanism in order to maintain acceptable data rate for real-time application services. It also looks into the impact of the radio link on the application and identifies elements and parameters like wireless link quality and handover that will influence the application type. It also identifies some enhanced traditional mechanisms such as distance controlled multihop and mesh topology required in order to support energy efficient multimedia applications. The second contribution unfolds an intelligent application priority assignment mechanism (IAPAM) for medical applications using wireless sensor networks. IAPAM proposes and evaluates a technique based on prioritising multiple virtual queues for the critical nature of medical data to improve instant transmission. Various mobility patterns (directed, controlled and random waypoint) has been investigated and compared by simulating IAPAM enabled mobile BWSN. The following topics have been studied, modelled, simulated and discussed in this thesis: 1. Application Controlled Handover (ACH) for multi radios over fibre 2. Power Controlled Scheme for mesh multi radios over fibre using ACH 3. IAPAM for Biomedical Wireless Sensor Networks (BWSN) and impact of mobility over IAPAM enabled BWSN. Extensive simulation studies are performed to analyze and to evaluate the proposed techniques. Simulation results demonstrate significant improvements in multi radios over fibre performance in terms of application response delay and power consumption by upto 75% and 15 % respectively, reduction in traffic loss by upto 53% and reduction in delay for real time application by more than 25% in some cases.

Context-aware systems can dynamically adapt to user situations to provide smarter services. In general, context refers to the information that can be used to characterize these situations, and context models are deployed to specify contextual information described in context-aware systems. However, even though user context is highly dynamic, existing context models either focus on modeling static views of context or lack appropriate design abstractions to deal with dynamic aspects and interactions involving contextual elements such location, time, user roles, social relationships, and changing preferences. Moreover, virtual environments have not been modelled by most of the existing context models even though online interaction is very common and popular. This thesis presents a dynamic user-centric context model that can be used to model the aspects of context-aware systems that are subject to frequent change. Four case studies are proposed to illustrate the applicability of the approach taken by this thesis, and they are in the domains of mobile e-healthcare, mobile commerce, mobile tourism, and mobile augmented reality gaming. Benefits of the proposed model include avoiding the development of context-aware systems from scratch, enabling future use of model-driven approaches, and reducing implementation effort.

Current trends in society and technology make interruption a central human computer interaction problem. Many intelligent computer systems exist, but one that determines when best to interact with a user at appropriate times as s/he performs computer-based tasks does not. In this work, an Interaction Algorithm was designed, developed and evaluated that draws from a user model and real-time observations of the user’s actions as s/he works on computer-based tasks to determine ideal times to interact with the user. This research addresses the complex problem of determining the precise time to interrupt a user and how to best support him/her during and after the interruption task. Many sub-problems have been taken into account such as determining the task difficulty, the intent of the user as s/he is performing the task and how to incorporate personal user characteristics. This research is quite timely as the number of interruptions people experience on a daily basis has grown considerably over the last decade and this growth has not shown any signs of subsiding. Furthermore, with the exponential growth of mobile computing, interruptions are permeating the user experience. Thus, systems must be developed to manage interruptions by reasoning about ideal timings of interactions and determining appropriate notification formats. This research shed light on this problem as described below: 1. The algorithm developed uses a user model in its’ reasoning computations. Most of the research in this area has focused on task-based contextual information when designing systems that reason about interruptions. Researchers support additional work should be done in this area by including subjective preferences. 2. The algorithm’s performance is quite promising at 96% accuracy in several models created. 3. The algorithm was implemented using an advanced machine learning technology—an Adaptive Neural-Fuzzy Inference System—which is a novel contribution. 4. The algorithm developed does not rely on any user involvement. In other systems, users laboriously review video sessions after working with the system and record interruption annotations so that the system can learn. 5. This research shed light on reasoning about ideal interruption points for free-form tasks. Currently, this is an unsolved problem.

No description available.

In this thesis, we focused on two problems in mobile application development: contextualization and large-scale testing. We identified the limitations of current contextualization and testing solutions. On one hand, advanced-remote-computing- based mobilization does not provide context awareness to the mobile applications it mobilized, so we presented contextify to provide context awareness to them without rewriting the applications or changing their source code. Evaluation results and user surveys showed that contextify-contextualized applications reduce users' time and effort to complete tasks. On the other hand, current mobile application testing solutions cannot conduct tests at the UI level and in a large-scale manner simultaneously, so we presented and implemented automated cloud computing (ACT) to achieve this goal. Evaluation results showed that ACT can support a large number of users and it is stable, cost-efficiency as well as time-efficiency.

Studies show that software developers spend about 19% of their development time in web surfing. While collecting necessary information using traditional web search, they face several practical challenges. First, it does not consider context (i.e., surroundings, circumstances) of the programming problems during search unless the developers do so in search query formulation, and forces the developers to frequently switch between their working environment (e.g., IDE) and the web browser. Second, technical details (e.g., stack trace) of an encountered exception often contain a lot of information, and they cannot be directly used as a search query given that the traditional search engines do not support long queries. Third, traditional search generally returns hundreds of search results, and the developers need to manually analyze the result pages one by one in order to extract a working solution. Both manual analysis of a page for content relevant to the encountered exception (and its context) and working an appropriate solution out are non-trivial tasks. Traditional code search engines share the same set of limitations of the web search ones, and they also do not help much in collecting the code examples that can be used for handling the encountered exceptions. In this thesis, we present a context-aware and IDE-based approach that helps one overcome those four challenges above. In our first study, we propose and evaluate a context-aware meta search engine for programming errors and exceptions. The meta search collects results for any encountered exception in the IDE from three popular search engines- Google, Bing and Yahoo and one programming Q & A site- StackOverflow, refines and ranks the results against the detailed context of the encountered exception, and then recommends them within the IDE. From this study, we not only explore the potential of the context-aware and meta search based approach but also realize the significance of appropriate search queries in searching for programming solutions. In the second study, we propose and evaluate an automated query recommendation approach that exploits the technical details of an encountered exception, and recommends a ranked list of search queries. We found the recommended queries quite promising and comparable to the queries suggested by experts. We also note that the support for the developers can be further complemented by post-search content analysis. In the third study, we propose and evaluate an IDE-based context-aware content recommendation approach that identifies and recommends sections of a web page that are relevant to the encountered exception in the IDE. The idea is to reduce the cognitive effort of the developers in searching for content of interest (i.e., relevance) in the page, and we found the approach quite effective through extensive experiments and a limited user study. In our fourth study, we propose and evaluate a context-aware code search engine that collects code examples from a number of code repositories of GitHub, and the examples contain high quality handlers for the exception of interest. We validate the performance of each of our proposed approaches against existing relevant literature and also through several mini user studies. Finally, in order to further validate the applicability of our approaches, we integrate them into an Eclipse plug in prototype--ExcClipse. We then conduct a task-oriented user study with six participants, and report the findings which are significantly promising.

This thesis develops a generalized approach for decoupling how a context model is defined and executed from how context-aware data is acquired and managed within a given middleware system. Decoupling the model specification from the data will likely provide more avenues of context-aware investigations due to an increased flexibility in the choice of a middleware system for handling context data. We provide a detailed description of the approach developed for this decoupling task, called Inspect, Adapt, Model, and Integrate (IAMI). By engaging the steps we show that a context model need not be specifically tied to a given context-aware middleware. This successful decoupling will likely add to the future development of context-aware systems by allowing researchers to build upon existing frameworks as opposed to repeatedly engaging in ground-up development. Moreover, we submit that this decoupling is important in that the number of possible ways of representing and expressing a context model is potentially infinite, but the choice of context-aware middleware systems is limited.

In the last several years the number of computer network attacks has increased rapidly, while at the same time the attacks have become more and more complex and sophisticated. Intrusion detection systems (IDSs) have become essential security appliances for detecting and reporting these complex and sophisticated attacks. Security officers and analysts need to analyze intrusion alerts in order to extract the underlying attack scenarios and attack intelligence. These allow taking appropriate responses and designing adequate defensive or prevention strategies. Intrusion analysis is a resource intensive, complex and expensive process for any organization. The current generation of IDSs generate low level intrusion alerts that describe individual attack events. In addition, existing IDSs tend to generate massive amount of alerts with high rate of redundancies and false positives. Typical IDS sensors report attacks independently and are not designed to recognize attack plans or discover multistage attack scenarios. Moreover, not all the attacks executed against the target network will be detected by the IDS. False negatives, which correspond to the attacks missed by the IDS, will either make the reconstruction of the attack scenario impossible or lead to an incomplete attack scenario. Because of the above mentioned reasons, intrusion analysis is a challenging task that mainly relies on the analyst experience and requires manual investigation. In this dissertation, we address the above mentioned challenges by proposing a new framework that allows automatic intrusion analysis and attack intelligence extraction by analyzing the alerts and attacks semantics using both machine learning and knowledge-representation approaches. Particularly, we use ontological engineering, semantic correlation, and clustering methods to design a new automated intrusion analysis framework. The proposed alert analysis approach addresses many of the gaps observed in the existing intrusion analysis techniques, and introduces when needed new metrics to measure the quality of the alerts analysis process. We evaluated experimentally our framework using different benchmark intrusion detection datasets, yielding excellent performance results. / Graduate

A learner in an informal learning environment, such as a museum, encounters various challenges. After initial assessment, a set of methods were proposed that may enhance a learner’s experience in a museum using computer aided technologies. The most important insight was the need to support the museum visitor in three phases of activity: prior to the visit, during the visit, and after the visit. We hypothesized that software tools that could help connect these three phases would be helpful and valuable supports for the visitor. To test and evaluate our hypothesis, a system called “The Museum Explorer” was built and instantiated using the collection in the Museum of Antiquities located at the University of Saskatchewan. An evaluation of the Museum Explorer was conducted. Results show that the Museum Explorer was largely successful in achieving our goals. The Museum Explorer is an integrated solution for visitors in museums across the pre-visit, visit, and post-visit phases. The Museum Explorer was designed to provide a means to connect and transfer user experience across the major phases of a museum visit. For each phase of a visitor’s experience, a set of tools was built that provides intelligent and interactive communication features. To assist visitors selecting artefacts to visit, a recommender system allows users to select a set of constraints. To better manage interactivity, features and functions were offered based on context. A study was conducted with volunteer museum visitors. Results from the study show that the Museum Explorer is a useful support. Analysis of the usage data captured by the Museum Explorer has revealed some interesting facts about users’ preferences in the domain that can be used by future researchers.

Knowing the semantic category of a robot's current position not only facilitates the robot's navigation, but also greatly improves its ability to serve human needs and to interpret the scene. Visual Place Categorization (VPC) is addressed in this dissertation, which refers to the problem of predicting the semantic category of a place using visual information collected from an autonomous robot platform. Census Transform (CT) histogram and Histogram Intersection Kernel (HIK) based visual codebooks are proposed to represent an image. CT histogram encodes the stable spatial structure of an image that reflects the functionality of a location. It is suitable for categorizing places and has shown better performance than commonly used descriptors such as SIFT or Gist in the VPC task. HIK has been shown to work better than the Euclidean distance in classifying histograms. We extend it in an unsupervised manner to generate visual codebooks for the CT histogram descriptor. HIK codebooks help CT histogram to deal with the huge variations in VPC and improve system accuracy. A computational method is also proposed to generate HIK codebooks in an efficient way. The first significant VPC dataset in home environments is collected and is made publicly available, which is also used to evaluate the VPC system based on the proposed techniques. The VPC system achieves promising results for this challenging problem, especially for important categories such as bedroom, bathroom, and kitchen. The proposed techniques achieved higher accuracies than competing descriptors and visual codebook generation methods.