BLID: an Application of Logical Information Systems in Bioinformatics

Ferr?, S. and King, R. D. (2004) BLID: an Application of Logical Information Systems in Bioinformatics. In P. Eklund (editor), 2nd International Conference on Formal Concept Analysis (ICFCA), Feb 2004. LNCS 2961, Springer.

Theory and practice in strategic planning for health information systems

Bradshaw, K. & Urquhart, C. (2005). Theory and practice in strategic planning for health information systems. In: D. Wainwright (Ed.), UK Academy for Information Systems 10th conference 2005, 22-24 March 2005 (CD-ROM). Newcastle upon Tyne: Northumbria University.

Confidentiality issues in information systems in social care

Cooper, J. & Urquhart, C. (2004). Confidentiality issues in information systems in social care. In K. Grant, D.A. Edgar & M. Jordan (Eds.), Reflections on the past, making sense of today and predicting the future of information systems, 9th annual UKAIS (UK Academy of Information Systems) conference proceedings, Annual conference, 5-7 May 2004, Glasgow Caledonian University (CD-ROM). Glasgow: Glasgow Caledonian University for UKAIS Sponsorship: AHRC

Can Graduating Students Design Software Systems?

Eckerdal, A. Ratcliffe, M. McCartney, R. Mostr?m, J.E. Zander, C. Can Graduating Students Design Software Systems? Proc. 37th SIGCSE Technical Symposium on Computer Science Education. 2006

Flocking in Simulation and Robots - A Review

Pattison,T. and Wilson,M.S., 'Flocking in Simulation and Robots - A Review', Towards Intelligent Mobile Robots; Proceedings of the 4th annual British conference on autonomous mobile robotics and autonomous systems (TIMR'03), 2003, pp 90-99

Diminishing Returns of Engineering Effort in Telerobotic Systems

Wilson, M.S. and Neal, M.J., 'Diminishing Returns of Engineering Effort in Telerobotic Systems', IEEE Transactions on Systems, Man and Cybernetics - Part A:Systems and Humans, 2001, September, volume 31, number 5, pp 459-465, IEEE Robotics and Automation Society, ed. Dautenhahn,K., Special Issue on Socially Intelligent Agents - The Human in the Loop

Telerobotic Sheepdogs: how useful is autonomous behaviour?

Wilson,M.S. and Neal,M.J., 'Telerobotic Sheepdogs: how useful is autonomous behaviour?', Proceedings of the 6th International Conference on Simulation of Adaptive Behaviour, ed. Meyer,J.A. and Berthoz,A. and Floreano,D. and Roitblat,H.L. and Wilson,S.W., pp 125-134, 2000, MIT Press

Developmental Learning for Autonomous Robots

M.H. Lee, Q. Meng and F. Chao, 'Developmental Learning for Autonomous Robots', Robotics and Autonomous Systems, 55(9), pp 750-759, 2007.

Automated cross-modal mapping in robotic eye/hand systems using plastic radial basis function networks

Q. Meng and M. H Lee, Automated cross-modal mapping in robotic eye/hand systems using plastic radial basis function networks, Connection Science, 19(1), pp 25-52, 2007.

Biologically inspired automatic construction of cross-modal mapping in robotic eye/hand systems

Q. Meng and M.H. Lee, 'Biologically inspired automatic construction of cross-modal mapping in robotic eye/hand systems', IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2006,) ,4742-49, Beijing, 2006.

Non-commutative symbolic coding

Gohm, Rolf; Kummerer, B.; Lang, T., (2006) 'Non-commutative symbolic coding', Ergodic Theory and Dynamical Systems 26(5) pp.1521-1548 RAE2008

Mermera: Non-Coherent Distributed Shared Memory for Parallel Computing

The proliferation of inexpensive workstations and networks has prompted several researchers to use such distributed systems for parallel computing. Attempts have been made to offer a shared-memory programming model on such distributed memory computers. Most systems provide a shared-memory that is coherent in that all processes that use it agree on the order of all memory events. This dissertation explores the possibility of a significant improvement in the performance of some applications when they use non-coherent memory. First, a new formal model to describe existing non-coherent memories is developed. I use this model to prove that certain problems can be solved using asynchronous iterative algorithms on shared-memory in which the coherence constraints are substantially relaxed. In the course of the development of the model I discovered a new type of non-coherent behavior called Local Consistency. Second, a programming model, Mermera, is proposed. It provides programmers with a choice of hierarchically related non-coherent behaviors along with one coherent behavior. Thus, one can trade-off the ease of programming with coherent memory for improved performance with non-coherent memory. As an example, I present a program to solve a linear system of equations using an asynchronous iterative algorithm. This program uses all the behaviors offered by Mermera. Third, I describe the implementation of Mermera on a BBN Butterfly TC2000 and on a network of workstations. The performance of a version of the equation solving program that uses all the behaviors of Mermera is compared with that of a version that uses coherent behavior only. For a system of 1000 equations the former exhibits at least a 5-fold improvement in convergence time over the latter. The version using coherent behavior only does not benefit from employing more than one workstation to solve the problem while the program using non-coherent behavior continues to achieve improved performance as the number of workstations is increased from 1 to 6. This measurement corroborates our belief that non-coherent shared memory can be a performance boon for some applications.

Amorphous Placement and Informed Diffusion for Timely Monitoring by Autonomous, Resource-Constrained, Mobile Sensors

Personal communication devices are increasingly equipped with sensors for passive monitoring of encounters and surroundings. We envision the emergence of services that enable a community of mobile users carrying such resource-limited devices to query such information at remote locations in the field in which they collectively roam. One approach to implement such a service is directed placement and retrieval (DPR), whereby readings/queries about a specific location are routed to a node responsible for that location. In a mobile, potentially sparse setting, where end-to-end paths are unavailable, DPR is not an attractive solution as it would require the use of delay-tolerant (flooding-based store-carry-forward) routing of both readings and queries, which is inappropriate for applications with data freshness constraints, and which is incompatible with stringent device power/memory constraints. Alternatively, we propose the use of amorphous placement and retrieval (APR), in which routing and field monitoring are integrated through the use of a cache management scheme coupled with an informed exchange of cached samples to diffuse sensory data throughout the network, in such a way that a query answer is likely to be found close to the query origin. We argue that knowledge of the distribution of query targets could be used effectively by an informed cache management policy to maximize the utility of collective storage of all devices. Using a simple analytical model, we show that the use of informed cache management is particularly important when the mobility model results in a non-uniform distribution of users over the field. We present results from extensive simulations which show that in sparsely-connected networks, APR is more cost-effective than DPR, that it provides extra resilience to node failure and packet losses, and that its use of informed cache management yields superior performance.

Object Matching in Distributed Video Surveillance Systems by LDA-Based Appearance Descriptors

Establishing correspondences among object instances is still challenging in multi-camera surveillance systems, especially when the cameras’ fields of view are non-overlapping. Spatiotemporal constraints can help in solving the correspondence problem but still leave a wide margin of uncertainty. One way to reduce this uncertainty is to use appearance information about the moving objects in the site. In this paper we present the preliminary results of a new method that can capture salient appearance characteristics at each camera node in the network. A Latent Dirichlet Allocation (LDA) model is created and maintained at each node in the camera network. Each object is encoded in terms of the LDA bag-of-words model for appearance. The encoded appearance is then used to establish probable matching across cameras. Preliminary experiments are conducted on a dataset of 20 individuals and comparison against Madden’s I-MCHR is reported.

Non-Rigid Shape from Image Streams

We present a framework for estimating 3D relative structure (shape) and motion given objects undergoing nonrigid deformation as observed from a fixed camera, under perspective projection. Deforming surfaces are approximated as piece-wise planar, and piece-wise rigid. Robust registration methods allow tracking of corresponding image patches from view to view and recovery of 3D shape despite occlusions, discontinuities, and varying illumination conditions. Many relatively small planar/rigid image patch trackers are scattered throughout the image; resulting estimates of structure and motion at each patch are combined over local neighborhoods via an oriented particle systems formulation. Preliminary experiments have been conducted on real image sequences of deforming objects and on synthetic sequences where ground truth is known.