Understanding ground deformation mechanisms during multi-propped excavation in soft clay

To maximize the utility of high land cost in urban development, underground space is commonly exploited, both to reduce the load acting on the ground and to increase the space available. The execution of underground constructions requires the use of appropriate retaining wall and bracing systems. Inadequate support systems have always been a major concern, as any excessive ground movement induced during excavation could cause damage to neighboring structures, resulting in delays, disputes and cost overruns. Experimental findings on the effect of wall stiffness, depth of the stiff stratum away from the wall toe and wall toe fixity condition are presented and discussed. © 2012 Taylor & Francis Group.

Multi-objective design and optimisation of bypass outlet-guide vanes

This paper describes the development of an automated design optimization system that makes use of a high fidelity Reynolds-Averaged CFD analysis procedure to minimize the fan forcing and fan BOGV (bypass outlet guide vane) losses simultaneously taking into the account the down-stream pylon and RDF (radial drive fairing) distortions. The design space consists of the OGV's stagger angle, trailing-edge recambering, axial and circumferential positions leading to a variable pitch optimum design. An advanced optimization system called SOFT (Smart Optimisation for Turbomachinery) was used to integrate a number of pre-processor, simulation and in-house grid generation codes and postprocessor programs. A number of multi-objective, multi-point optimiztion were carried out by SOFT on a cluster of workstations and are reported herein.

Effects of multi-scattering on the performance of a single-beam acoustic manipulation device.

The effects of multiple scattering on acoustic manipulation of spherical particles using helicoidal Bessel-beams are discussed. A closed-form analytical solution is developed to calculate the acoustic radiation force resulting from a Bessel-beam on an acoustically reflective sphere, in the presence of an adjacent spherical particle, immersed in an unbounded fluid medium. The solution is based on the standard Fourier decomposition method and the effect of multi-scattering is taken into account using the addition theorem for spherical coordinates. Of particular interest here is the investigation of the effects of multiple scattering on the emergence of negative axial forces. To investigate the effects, the radiation force applied on the target particle resulting from a helicoidal Bessel-beam of different azimuthal indexes (m = 1 to 4), at different conical angles, is computed. Results are presented for soft and rigid spheres of various sizes, separated by a finite distance. Results have shown that the emergence of negative force regions is very sensitive to the level of cross-scattering between the particles. It has also been shown that in multiple scattering media, the negative axial force may occur at much smaller conical angles than previously reported for single particles, and that acoustic manipulation of soft spheres in such media may also become possible.

Robust multiplexed MPC for distributed multi-agent systems

This paper extends the authors' earlier work which adapted robust multiplexed MPC for application to distributed control of multi-agent systems with non-interacting dynamics and coupled constraint sets in the presence of persistent unknown, but bounded disturbances. Specifically, we propose exploiting the single agent update nature of the multiplexed approach, and fix the update sequence to enable input move-blocking and increased discretisation rates. This permits a higher rate of individual policy update to be achieved, whilst incurring no additional computational cost in the corresponding optimal control problems to be solved. A disturbance feedback policy is included between updates to facilitate finding feasible solutions. The new formulation inherits the property of rapid response to disturbances from multiplexing the control and numerical results show that fixing the update sequence does not incur any loss in performance. © 2011 IFAC.

The most persistent soft-clique in a set of sampled graphs

When searching for characteristic subpatterns in potentially noisy graph data, it appears self-evident that having multiple observations would be better than having just one. However, it turns out that the inconsistencies introduced when different graph instances have different edge sets pose a serious challenge. In this work we address this challenge for the problem of finding maximum weighted cliques. We introduce the concept of most persistent soft-clique. This is subset of vertices, that 1) is almost fully or at least densely connected, 2) occurs in all or almost all graph instances, and 3) has the maximum weight. We present a measure of clique-ness, that essentially counts the number of edge missing to make a subset of vertices into a clique. With this measure, we show that the problem of finding the most persistent soft-clique problem can be cast either as: a) a max-min two person game optimization problem, or b) a min-min soft margin optimization problem. Both formulations lead to the same solution when using a partial Lagrangian method to solve the optimization problems. By experiments on synthetic data and on real social network data we show that the proposed method is able to reliably find soft cliques in graph data, even if that is distorted by random noise or unreliable observations. Copyright 2012 by the author(s)/owner(s).

Beyond dataset bias: Multi-task unaligned shared knowledge transfer

Many visual datasets are traditionally used to analyze the performance of different learning techniques. The evaluation is usually done within each dataset, therefore it is questionable if such results are a reliable indicator of true generalization ability. We propose here an algorithm to exploit the existing data resources when learning on a new multiclass problem. Our main idea is to identify an image representation that decomposes orthogonally into two subspaces: a part specific to each dataset, and a part generic to, and therefore shared between, all the considered source sets. This allows us to use the generic representation as un-biased reference knowledge for a novel classification task. By casting the method in the multi-view setting, we also make it possible to use different features for different databases. We call the algorithm MUST, Multitask Unaligned Shared knowledge Transfer. Through extensive experiments on five public datasets, we show that MUST consistently improves the cross-datasets generalization performance. © 2013 Springer-Verlag.

Quantitative convergence analysis of multi-agent systems

We introduce a characterization of contraction for bounded convex sets. For discrete-time multi-agent systems we provide an explicit upperbound on the rate of convergence to a consensus under the assumptions of contractiveness and (weak) connectedness (across an interval.) Convergence is shown to be exponential when either the system or the function characterizing the contraction is linear. Copyright © 2007 IFAC.

Calibrating the Gaussian multi-target tracking model

We present novel batch and online (sequential) versions of the expectation-maximisation (EM) algorithm for inferring the static parameters of a multiple target tracking (MTT) model. Online EM is of particular interest as it is a more practical method for long data sets since in batch EM, or a full Bayesian approach, a complete browse of the data is required between successive parameter updates. Online EM is also suited to MTT applications that demand real-time processing of the data. Performance is assessed in numerical examples using simulated data for various scenarios. For batch estimation our method significantly outperforms an existing gradient based maximum likelihood technique, which we show to be significantly biased. © 2014 Springer Science+Business Media New York.