User sensitive research in e-learning: exploring the role of individual user characteristics

The increasing need for active and accessible learning in the inclusive knowledge society drives the demand for e-learning that engages users much more effectively than ever before. In this context, it is crucial to conduct research that embraces innovation in user sensitive design, or else influential individual user differences may be overlooked. The objective of this paper is to explore the creation of successful e-learning systems that are able to increase users’ learning performance and enhance their personal learning experiences. The paper reports two converging and complimentary approaches, namely case studies and experimentation. First, case studies are used to explore the extent to which effective e-learning systems comply with eight specific factors. Of the eight, accessibility, individual differences and student modeling turn out to be the weakest points in current practice. Second, an empirical study investigates the influences of user individual user differences on users’ learning outcomes in an e-learning environment. The experiment found that individual differences in motivation to learn and expectations about e-learning significantly impacted users’ learning achievements. Third, based on these studies, improvements in research methodology are identified towards greater consideration of user sensitive research issues, thus enabling us to outline improved experimental procedures. Further experiment results should provide us with better insights into the arguments needed to carefully assess benefits of developing and involving a user model in an e-learning application. Consequently, evaluation and justification could now encompass both system performance as well as user performance.     

C-PSA: Constrained Pareto simulated annealing for constrained multi-objective optimization

In recent years, evolutionary algorithms (EAs) have been extensively developed and utilized to solve multi-objective optimization problems. However, some previous studies have shown that for certain problems, an approach which allows for non-greedy or uphill moves (unlike EAs), can be more beneficial. One such approach is simulated annealing (SA). SA is a proven heuristic for solving numerical optimization problems. But owing to its point-to-point nature of search, limited efforts has been made to explore its potential for solving multi-objective problems. The focus of the presented work is to develop a simulated annealing algorithm for constrained multi-objective problems. The performance of the proposed algorithm is reported on a number of difficult constrained benchmark problems. A comparison with other established multi-objective optimization algorithms, such as infeasibility driven evolutionary algorithm (IDEA), Non-dominated sorting genetic algorithm II (NSGA-II) and multi-objective Scatter search II (MOSS-II) has been included to highlight the benefits of the proposed approach.     

Feature-based statistical analysis of combustion simulation data

We present a new framework for feature-based statistical analysis of large-scale scientific data and demonstrate its effectiveness by analyzing features from Direct Numerical Simulations (DNS) of turbulent combustion. Turbulent flows are ubiquitous and account for transport and mixing processes in combustion, astrophysics, fusion, and climate modeling among other disciplines. They are also characterized by coherent structure or organized motion, i.e. nonlocal entities whose geometrical features can directly impact molecular mixing and reactive processes. While traditional multi-point statistics provide correlative information, they lack nonlocal structural information, and hence, fail to provide mechanistic causality information between organized fluid motion and mixing and reactive processes. Hence, it is of great interest to capture and track flow features and their statistics together with their correlation with relevant scalar quantities, e.g. temperature or species concentrations. In our approach we encode the set of all possible flow features by pre-computing merge trees augmented with attributes, such as statistical moments of various scalar fields, e.g. temperature, as well as length-scales computed via spectral analysis. The computation is performed in an efficient streaming manner in a pre-processing step and results in a collection of meta-data that is orders of magnitude smaller than the original simulation data. This meta-data is sufficient to support a fully flexible and interactive analysis of the features, allowing for arbitrary thresholds, providing per-feature statistics, and creating various global diagnostics such as Cumulative Density Functions (CDFs), histograms, or time-series. We combine the analysis with a rendering of the features in a linked-view browser that enables scientists to interactively explore, visualize, and analyze the equivalent of one terabyte of simulation data. We highlight the utility of this new framework for combustion science; however, it is applicable to many other science domains.     

On challenges of model transformation from UML to Alloy

The Unified Modeling Language (UML) is the de facto language used in the industry for software specifications. Once an application has been specified, Model Driven Architecture (MDA) techniques can be applied to generate code from such specifications. Since implementing a system based on a faulty design requires additional cost and effort, it is important to analyse the UML models at earlier stages of the software development lifecycle. This paper focuses on utilizing MDA techniques to deal with the analysis of UML models and identify design faults within a specification. Specifically, we show how UML models can be automatically transformed into Alloy which, in turn, can be automatically analysed by the Alloy Analyzer. The proposed approach relies on MDA techniques to transform UML models to Alloy. This paper reports on the challenges of the model transformation from UML class diagrams and OCL to Alloy. Those issues are caused by fundamental differences in the design philosophy of UML and Alloy. To facilitate better the representation of Alloy concepts in the UML, the paper draws on the lessons learnt and presents a UML profile for Alloy.     

Supplier behavior modeling and winner determination using parallel MDP

Behavioral uncertainty of a supplier is a major challenge to a buyer operating in e-procurement setting. Modeling suppliers’ behavior from past transactions, estimation of possible future performance and integrating this knowledge with the winner determination process can bring a new dimension to procurement process automation. We propose a states-space model to capture the uncertainty involved in long-term supplier behavior. The states represent the performance level of a supplier. This behavioral aspect is then integrated with the winner determination process of a multi-attribute reverse auction for efficient supplier selection using parallel MDP. We also propose an implementation framework to collect the feedback on supplier, generate an aggregate performance score and integrate it with the winner determination process. The performance aggregation and winner determination with help of Markov decision process effectively uses the past performance information. In addition, it updates performance information in regular invervals and allevates the problem of maintaining a long history. We compare the MDP-based selection with that of performance score-based selection through a simulation experiment. It is observed that our scheme gives better buyer utility, selects best suppliers and fetches better quality product. The benefits realized through these attributes to the buyer increases the efficiency of the MDP-based selection process.     

A bounded distance metric for comparing tree structure

Comparing tree-structured data for structural similarity is a recurring theme and one on which much effort has been spent. Most approaches so far are grounded, implicitly or explicitly, in algorithmic information theory, being approximations to an information distance derived from Kolmogorov complexity. In this paper we propose a novel complexity metric, also grounded in information theory, but calculated via Shannon's entropy equations. This is used to formulate a directly and efficiently computable metric for the structural difference between unordered trees. The paper explains the derivation of the metric in terms of information theory, and proves the essential property that it is a distance metric. The property of boundedness means that the metric can be used in contexts such as clustering, where second-order comparisons are required. The distance metric property means that the metric can be used in the context of similarity search and metric spaces in general, allowing trees to be indexed and stored within this domain. We are not aware of any other tree similarity metric with these properties.     

Energy efficient redundant configurations for real-time parallel reliable servers

Modular redundancy and temporal redundancy are traditional techniques to increase system reliability. In addition to being used as temporal redundancy, with technology advancements, slack time in a system can also be used by energy management schemes to save energy. In this paper, we consider the combination of modular and temporal redundancy to achieve energy efficient reliable real-time service provided by multiple servers. We first propose an efficient adaptive parallel recovery scheme that appropriately processes service requests in parallel to increase the number of faults that can be tolerated and thus system reliability. Then we explore schemes to determine the optimal redundant configurations of the parallel servers to minimize system energy consumption for a given reliability goal or to maximize system reliability for a given energy budget. Our analysis results show that small requests, optimistic approaches, and parallel recovery favor lower levels of modular redundancy, while large requests, pessimistic approaches and restricted serial recovery favor higher levels of modular redundancy.

New statistical methods for investigating submarine pockmarks

We investigate the applicability of some novel spatial analysis techniques, developed for studies of astrophysical datasets, to the analysis of spatial point data in sedimentary basins. The techniques are evaluated and compared with standard methods using two test areas that contain large numbers of submarine pockmarks developed in distributed arrays. The familiar Ripley K and Voronoi tesselation techniques are used, and the results are then compared with those obtained using more novel techniques, the correlation length and minimal spanning tree. The correlation length technique is found to identify the precise distances at which clustering occurs more accurately, making a physical interpretation more clear than is possible using the Ripley K. The minimal spanning tree is found to be powerful at identifying the space-filling nature of the pockmark distribution, and has the advantage of being immune to edge effects. The use of these two novel techniques permits more information to be extracted from the datasets, and demonstrates clear statistically significant differences between them, which are not detectable using standard techniques.     

Modeling expert problem solving in a game of chance: a Yahtzee© case study

Although developments on software agents have led to useful applications in automation of routine tasks such as electronic mail filtering, there is a scarcity of research that empirically evaluates the performance of a software agent versus that of a human reasoner, whose problem-solving capabilities the agent embodies. In the context of a game of a chance, namely Yahtzee©, we identified strategies deployed by expert human reasoners and developed a decision tree for agent development. This paper describes the computer implementation of the Yahtzee game as well as the software agent. It also presents a comparison of the performance of humans versus an automated agent. Results indicate that, in this context, the software agent embodies human expertise at a high level of fidelity.     

Registration techniques for using imperfect and partially calibrated devices in planar multi-projector displays

Multi-projector displays today are automatically registered, both geometrically and photometrically, using cameras. Existing registration techniques assume pre-calibrated projectors and cameras that are devoid of imperfections such as lens distortion. In practice, however, these devices are usually imperfect and uncalibrated. Registration of each of these devices is often more challenging than the multi-projector display registration itself. To make tiled projection-based displays accessible to a layman user we should allow the use of uncalibrated inexpensive devices that are prone to imperfections. In this paper, we make two important advances in this direction. First, we present a new geometric registration technique that can achieve geometric alignment {\em in the presence of severe projector lens distortion} using a relatively inexpensive low-resolution camera. This is achieved via a closed-form model that relates the projectors to cameras, in planar multi-projector displays, using rational Bezier patches. This enables us to geometrically calibrate a 3000 x 2500 resolution planar multi-projector display made of 3 x 3 array of nine severely distorted projectors using a low resolution (640 x 480) VGA camera. Second, we present a photometric self-calibration technique for a projector-camera pair. This allows us to photometrically calibrate the same display made of nine projectors using a photometrically uncalibrated camera. To the best of our knowledge, this is the first work that allows geometrically imperfect projectors and photometrically uncalibrated cameras in calibrating multi-projector displays.