Transforming specifications of observable behaviour into programs

A methodology for deriving programs from specifications of observable behaviour is described. The class of processes to which this methodology is applicable includes those whose state changes are fully definable by labelled transition systems, for example communicating processes without internal state changes. A logic program representation of such labelled transition systems is proposed, interpreters based on path searching techniques are defined, and the use of partial evaluation techniques to derive the executable programs is described

Diffuse Scattering on Graphs

We formulate and analyze difference equations on graphs analogous to time-independent diffusion equations arising in the study of diffuse scattering in continuous media. Moreover, we show how to construct solutions in the presence of weak scatterers from the solution to the homogeneous (background problem) using Born series, providing necessary conditions for convergence and demonstrating the process through numerous examples. In addition, we outline a method for finding Green's functions for Cayley graphs for both abelian and non-abelian groups. Finally, we conclude with a discussion of the effects of sparsity on our method and results, outlining the simplifications that can be made provided that the scatterers are weak and well-separated

Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

This paper demonstrates theoretically and empirically that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can reliably recover a signal with $m$ nonzero entries in dimension $d$ given ${rm O}(m ln d)$ random linear measurements of that signal. This is a massive improvement over previous results, which require ${rm O}(m^{2})$ measurements. The new results for OMP are comparable with recent results for another approach called Basis Pursuit (BP). In some settings, the OMP algorithm is faster and easier to implement, so it is an attractive alternative to BP for signal recovery problems

Imaging from the Inside Out: Inverse Scattering with Photoactivated Internal Sources

We propose a method to reconstruct the optical properties of a scattering medium with subwavelength resolution. The method is based on the solution to the inverse scattering problem with photoactivated internal sources. Numerical simulations of three-dimensional structures demonstrate that a resolution of approximately $\lambda/25$ is achievable

Characterisation of FAD-family folds using a machine learning approach

Flavin adenine dinucleotide (FAD) and its derivatives play a crucial role in biological processes. They are major organic cofactors and electron carriers in both enzymatic activities and biochemical pathways. We have analysed the relationships between sequence and structure of FAD-containing proteins using a machine learning approach. Decision trees were generated using the C4.5 algorithm as a means of automatically generating rules from biological databases (TOPS, CATH and PDB). These rules were then used as background knowledge for an ILP system to characterise the four different classes of FAD-family folds classified in Dym and Eisenberg (2001). These FAD-family folds are: glutathione reductase (GR), ferredoxin reductase (FR), p-cresol methylhydroxylase (PCMH) and pyruvate oxidase (PO). Each FADfamily was characterised by a set of rules. The “knowledge patterns” generated from this approach are a set of rules containing conserved sequence motifs, secondary structure sequence elements and folding information. Every rule was then verified using statistical evaluation on the measured significance of each rule. We show that this machine learning approach is capable of learning and discovering interesting patterns from large biological databases and can generate “knowledge patterns” that characterise the FADcontaining proteins, and at the same time classify these proteins into four different families

Integrative machine learning approach for multi-class SCOP protein fold classification

Classification and prediction of protein structure has been a central research theme in structural bioinformatics. Due to the imbalanced distribution of proteins over multi SCOP classification, most discriminative machine learning suffers the well-known ‘False Positives ’ problem when learning over these types of problems. We have devised eKISS, an ensemble machine learning specifically designed to increase the coverage of positive examples when learning under multiclass imbalanced data sets. We have applied eKISS to classify 25 SCOP folds and show that our learning system improved over classical learning methods

Towards a competency model for adaptive assessment to support lifelong learning

Adaptive assessment provides efficient and personalised routes to establishing the proficiencies of learners. We can envisage a future in which learners are able to maintain and expose their competency profile to multiple services, throughout their life, which will use the competency information in the model to personalise assessment. Current competency standards tend to over simplify the representation of competency and the knowledge domain. This paper presents a competency model for evaluating learned capability by considering achieved competencies to support adaptive assessment for lifelong learning. This model provides a multidimensional view of competencies and provides for interoperability between systems as the learner progresses through life. The proposed competency model is being developed and implemented in the JISC-funded Placement Learning and Assessment Toolkit (mPLAT) project at the University of Southampton. This project which takes a Service-Oriented approach will contribute to the JISC community by adding mobile assessment tools to the E-framework