EUELC project : a multi-centre, multipurpose study to investigate early stage NSCLC, and to establish a biobank for ongoing collaboration

The European Early Lung Cancer (EUELC) project aims to determine if specific genetic alterations occurring in lung carcinogenesis are detectable in the respiratory epithelium. In order to pursue this objective, nonsmall cell lung cancer (NSCLC) patients with a very high risk of developing progressive lung cancer were recruited from 12 centres in eight European countries: France, Germany, southern Ireland, Italy, the Netherlands, Poland, Spain and the UK. In addition, NSCLC patients were followed up every 6 months for 36 months. A European Bronchial Tissue Bank was set up at the University of Liverpool (Liverpool, UK) to optimise the use of biological specimens. The molecular - pathological investigations were subdivided into specific work packages that were delivered by EUELC Partners. The work packages encompassed mutational analysis, genetic instability, methylation profiling, expression profiling utilising immunohistochemistry and chip-based technologies, as well as in-depth analysis of FHIT and RARβ genes, the telomerase catalytic subunit hTERT and genotyping of susceptibility genes in specific pathways. The EUELC project engendered a tremendous collaborative effort, and it enabled the EUELC Partners to establish protocols for assessing molecular biomarkers in early lung cancer with the view to using such biomarkers for early diagnosis and as intermediate end-points in future chemopreventive programmes. Copyright©ERS Journals Ltd 2009.

Channel tracking in SDMA-based multi-user MIMO-OFDM communications systems

Capacity of current and future high data rate wireless communications depend significantly on how well changes in the wireless channel are predicted and tracked. Generally, this can be estimated by transmitting known symbols. However, this increases overheads if the channel varies over time. Given today’s bandwidth demand and the increased necessity for mobile wireless devices, the contributions of this research are very significant. This study has developed a novel and efficient channel tracking algorithm that can recursively update the channel estimation for wireless broadband communications reducing overheads, therefore increasing the speed of wireless communication systems.

A novel hybrid evolutionary algorithm based on ACO and SA for distribution feeder reconfiguration with regard to DGs

This paper presents an efficient hybrid evolutionary optimization algorithm based on combining Ant Colony Optimization (ACO) and Simulated Annealing (SA), called ACO-SA, for distribution feeder reconfiguration (DFR) considering Distributed Generators (DGs). Due to private ownership of DGs, a cost based compensation method is used to encourage DGs in active and reactive power generation. The objective function is summation of electrical energy generated by DGs and substation bus (main bus) in the next day. The approach is tested on a real distribution feeder. The simulation results show that the proposed evolutionary optimization algorithm is robust and suitable for solving DFR problem.

A Satellite Selection Algorithm for Achieving High Reliability of Ambiguity Resolution with GPS and Beidou Constellations

Reliability of carrier phase ambiguity resolution (AR) of an integer least-squares (ILS) problem depends on ambiguity success rate (ASR), which in practice can be well approximated by the success probability of integer bootstrapping solutions. With the current GPS constellation, sufficiently high ASR of geometry-based model can only be achievable at certain percentage of time. As a result, high reliability of AR cannot be assured by the single constellation. In the event of dual constellations system (DCS), for example, GPS and Beidou, which provide more satellites in view, users can expect significant performance benefits such as AR reliability and high precision positioning solutions. Simply using all the satellites in view for AR and positioning is a straightforward solution, but does not necessarily lead to high reliability as it is hoped. The paper presents an alternative approach that selects a subset of the visible satellites to achieve a higher reliability performance of the AR solutions in a multi-GNSS environment, instead of using all the satellites. Traditionally, satellite selection algorithms are mostly based on the position dilution of precision (PDOP) in order to meet accuracy requirements. In this contribution, some reliability criteria are introduced for GNSS satellite selection, and a novel satellite selection algorithm for reliable ambiguity resolution (SARA) is developed. The SARA algorithm allows receivers to select a subset of satellites for achieving high ASR such as above 0.99. Numerical results from a simulated dual constellation cases show that with the SARA procedure, the percentages of ASR values in excess of 0.99 and the percentages of ratio-test values passing the threshold 3 are both higher than those directly using all satellites in view, particularly in the case of dual-constellation, the percentages of ASRs (>0.99) and ratio-test values (>3) could be as high as 98.0 and 98.5 % respectively, compared to 18.1 and 25.0 % without satellite selection process. It is also worth noting that the implementation of SARA is simple and the computation time is low, which can be applied in most real-time data processing applications.

The IKBALS project: multi-modal reasoning in legal knowledge based systems

In attempting to build intelligent litigation support tools, we have moved beyond first generation, production rule legal expert systems. Our work integrates rule based and case based reasoning with intelligent information retrieval. When using the case based reasoning methodology, or in our case the specialisation of case based retrieval, we need to be aware of how to retrieve relevant experience. Our research, in the legal domain, specifies an approach to the retrieval problem which relies heavily on an extended object oriented/rule based system architecture that is supplemented with causal background information. We use a distributed agent architecture to help support the reasoning process of lawyers. Our approach to integrating rule based reasoning, case based reasoning and case based retrieval is contrasted to the CABARET and PROLEXS architectures which rely on a centralised blackboard architecture. We discuss in detail how our various cooperating agents interact, and provide examples of the system at work. The IKBALS system uses a specialised induction algorithm to induce rules from cases. These rules are then used as indices during the case based retrieval process. Because we aim to build legal support tools which can be modified to suit various domains rather than single purpose legal expert systems, we focus on principles behind developing legal knowledge based systems. The original domain chosen was theAccident Compensation Act 1989 (Victoria, Australia), which relates to the provision of benefits for employees injured at work. For various reasons, which are indicated in the paper, we changed our domain to that ofCredit Act 1984 (Victoria, Australia). This Act regulates the provision of loans by financial institutions. The rule based part of our system which provides advice on the Credit Act has been commercially developed in conjunction with a legal firm. We indicate how this work has lead to the development of a methodology for constructing rule based legal knowledge based systems. We explain the process of integrating this existing commercial rule based system with the case base reasoning and retrieval architecture.

Multi-scale bio-inspired place recognition

This paper presents a novel place recognition algorithm inspired by the recent discovery of overlapping and multi-scale spatial maps in the rodent brain. We mimic this hierarchical framework by training arrays of Support Vector Machines to recognize places at multiple spatial scales. Place match hypotheses are then cross-validated across all spatial scales, a process which combines the spatial specificity of the finest spatial map with the consensus provided by broader mapping scales. Experiments on three real-world datasets including a large robotics benchmark demonstrate that mapping over multiple scales uniformly improves place recognition performance over a single scale approach without sacrificing localization accuracy. We present analysis that illustrates how matching over multiple scales leads to better place recognition performance and discuss several promising areas for future investigation.

Improvement of a dynamic accumulator at ICICS 07 and its application in multi-user keyword-based retrieval on encrypted data

A dynamic accumulator is an algorithm, which merges a large set of elements into a constant-size value such that for an element accumulated, there is a witness confirming that the element was included into the value, with a property that accumulated elements can be dynamically added and deleted into/from the original set. Recently Wang et al. presented a dynamic accumulator for batch updates at ICICS 2007. However, their construction suffers from two serious problems. We analyze them and propose a way to repair their scheme. We use the accumulator to construct a new scheme for common secure indices with conjunctive keyword-based retrieval.

Perturbing event logs to identify cost reduction opportunities: a genetic algorithm-based approach

Organisations are constantly seeking new ways to improve operational efficiencies. This research study investigates a novel way to identify potential efficiency gains in business operations by observing how they are carried out in the past and then exploring better ways of executing them by taking into account trade-offs between time, cost and resource utilisation. This paper demonstrates how they can be incorporated in the assessment of alternative process execution scenarios by making use of a cost environment. A genetic algorithm-based approach is proposed to explore and assess alternative process execution scenarios, where the objective function is represented by a comprehensive cost structure that captures different process dimensions. Experiments conducted with different variants of the genetic algorithm evaluate the approach's feasibility. The findings demonstrate that a genetic algorithm-based approach is able to make use of cost reduction as a way to identify improved execution scenarios in terms of reduced case durations and increased resource utilisation. The ultimate aim is to utilise cost-related insights gained from such improved scenarios to put forward recommendations for reducing process-related cost within organisations.

Enhanced stochastic mobility prediction with multi-output Gaussian processes

Outdoor robots such as planetary rovers must be able to navigate safely and reliably in order to successfully perform missions in remote or hostile environments. Mobility prediction is critical to achieving this goal due to the inherent control uncertainty faced by robots traversing natural terrain. We propose a novel algorithm for stochastic mobility prediction based on multi-output Gaussian process regression. Our algorithm considers the correlation between heading and distance uncertainty and provides a predictive model that can easily be exploited by motion planning algorithms. We evaluate our method experimentally and report results from over 30 trials in a Mars-analogue environment that demonstrate the effectiveness of our method and illustrate the importance of mobility prediction in navigating challenging terrain.

Towards a multi-element simulation of heavily over-consolidated bagasse using a material subroutine

A better understanding of the behaviour of prepared cane and bagasse, and the ability to model the mechanical behaviour of bagasse as it is squeezed in a milling unit to extract juice, would help identify how to improve the current process. There are opportunities to decrease bagasse moisture from a milling unit. The behaviour of bagasse in chutes is poorly understood. Previous investigations have shown that juice flow through bagasse obeys Darcy’s permeability law, that the grip of the rough surface of the grooves on the bagasse can be represented by the Mohr-Coulomb failure criterion for soils, and that the internal mechanical behaviour of the bagasse is critical state behaviour similar to that for sand and clay. Progress has been made in the last 11 years towards implementing a mechanical model for bagasse in finite element software. The objective is to be able to correctly simulate various simple mechanical loading conditions measured in the laboratory. Combining these behaviours together is thought to have a high probability of reproducing the complicated stress conditions in a milling unit. This paper reports on progress made towards modelling the fifth and final (and most challenging) of the simple loading conditions: the shearing of heavily over-consolidated bagasse, using a specific model for bagasse in a multi-element simulation.

Space vector modulated cascade multi-level inverter for PMSG wind generation systems

Modulation and control of a cascade multilevel inverter, which has a high potential in future wind generation applications, are presented. The inverter is a combination of a high power, three level “bulk inverter” and a low power “conditioning inverter”. To minimize switching losses, the bulk inverter operates at a low frequency producing square wave outputs while high frequency conditioning inverter is used to suppress harmonic content produced by the bulk inverter output. This paper proposes an improved Space Vector Modulation (SVM) algorithm and a neutral point potential balancing technique for the inverter. Furthermore, a maximum power tracking controller for the Permanent Magnet Synchronous Generator (PMSG) is described in detail. The proposed SVM technique eliminates most of the computational burdens on the digital controller and renders a greater controllability under varying DC-link voltage conditions. The DC-link capacitor voltage balancing of both bulk and conditioning inverters is carried out using Redundant State Selection (RSS) method and is explained in detail. Experimental results are presented to verify the proposed modulation and control techniques.

Brief interventions to reduce ecstasy use : a multi-site randomized controlled trial

Studies examining the ability of motivational enhancement therapy (MET) to augment education provision among ecstasy users have produced mixed results and none have examined whether treatment fidelity was related to ecstasy use outcomes. The primary objectives of this multi-site, parallel, two-group randomized controlled trial were to determine if a single-session of MET could instill greater commitment to change and reduce ecstasy use and related problems more so than an education-only intervention and whether MET sessions delivered with higher treatment fidelity are associated with better outcomes. The secondary objective was to assess participants’ satisfaction with their assigned interventions. Participants (N = 174; Mage = 23.62) at two Australian universities were allocated randomly to receive a 15-minute educational session on ecstasy use (n = 85) or a 50-minute session of MET that included an educational component (n = 89). Primary outcomes were assessed at baseline, and then at 4-, 16-, and 24-weeks post-baseline, while the secondary outcome measure was assessed 4-weeks post-baseline by researchers blind to treatment allocation. Overall, the treatment fidelity was acceptable to good in the MET condition. There were no statistical differences at follow-up between the groups on the primary outcomes of ecstasy use, ecstasy-related problems, and commitment to change. Both interventions groups reported a 50% reduction in their ecstasy use and a 20% reduction in the severity of their ecstasy-related problems at the 24-week follow up. Commitment to change slightly improved for both groups (9% - 17%). Despite the lack of between-group statistical differences on primary outcomes, participants who received a single session of MET were slightly more satisfied with their intervention than those who received education only. MI fidelity was not associated with ecstasy use outcomes. Given these findings, future research should focus on examining mechanisms of change. Such work may suggest new methods for enhancing outcomes.

An efficient and robust system for multi-person event detection in real world indoor surveillance scenes

Due to the popularity of security cameras in public places, it is of interest to design an intelligent system that can efficiently detect events automatically. This paper proposes a novel algorithm for multi-person event detection. To ensure greater than real-time performance, features are extracted directly from compressed MPEG video. A novel histogram-based feature descriptor that captures the angles between extracted particle trajectories is proposed, which allows us to capture motion patterns of multi-person events in the video. To alleviate the need for fine-grained annotation, we propose the use of Labelled Latent Dirichlet Allocation, a “weakly supervised” method that allows the use of coarse temporal annotations which are much simpler to obtain. This novel system is able to run at approximately ten times real-time, while preserving state-of-theart detection performance for multi-person events on a 100-hour real-world surveillance dataset (TRECVid SED).

Robust clustering of multi-type relational data via a heterogeneous manifold ensemble

High-Order Co-Clustering (HOCC) methods have attracted high attention in recent years because of their ability to cluster multiple types of objects simultaneously using all available information. During the clustering process, HOCC methods exploit object co-occurrence information, i.e., inter-type relationships amongst different types of objects as well as object affinity information, i.e., intra-type relationships amongst the same types of objects. However, it is difficult to learn accurate intra-type relationships in the presence of noise and outliers. Existing HOCC methods consider the p nearest neighbours based on Euclidean distance for the intra-type relationships, which leads to incomplete and inaccurate intra-type relationships. In this paper, we propose a novel HOCC method that incorporates multiple subspace learning with a heterogeneous manifold ensemble to learn complete and accurate intra-type relationships. Multiple subspace learning reconstructs the similarity between any pair of objects that belong to the same subspace. The heterogeneous manifold ensemble is created based on two-types of intra-type relationships learnt using p-nearest-neighbour graph and multiple subspaces learning. Moreover, in order to make sure the robustness of clustering process, we introduce a sparse error matrix into matrix decomposition and develop a novel iterative algorithm. Empirical experiments show that the proposed method achieves improved results over the state-of-art HOCC methods for FScore and NMI.

Multi-modal deformable medical image registration

Non-rigid image registration is an essential tool required for overcoming the inherent local anatomical variations that exist between images acquired from different individuals or atlases. Furthermore, certain applications require this type of registration to operate across images acquired from different imaging modalities. One popular local approach for estimating this registration is a block matching procedure utilising the mutual information criterion. However, previous block matching procedures generate a sparse deformation field containing displacement estimates at uniformly spaced locations. This neglects to make use of the evidence that block matching results are dependent on the amount of local information content. This paper presents a solution to this drawback by proposing the use of a Reversible Jump Markov Chain Monte Carlo statistical procedure to optimally select grid points of interest. Three different methods are then compared to propagate the estimated sparse deformation field to the entire image including a thin-plate spline warp, Gaussian convolution, and a hybrid fluid technique. Results show that non-rigid registration can be improved by using the proposed algorithm to optimally select grid points of interest.