30 resultados para mixed groups

em Cambridge University Engineering Department Publications Database


Relevância:

40.00% 40.00%

Publicador:

Resumo:

To explore the relational challenges for general practitioner (GP) leaders setting up new network-centric commissioning organisations in the recent health policy reform in England, we use innovation network theory to identify key network leadership practices that facilitate healthcare innovation.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In the chiral nematic phase, flexoelectricity can give rise to an interesting electrooptic switching effect, known as flexoelectro-optic switching. Flexoelectro-optic switching gives a fast v-shaped switching regime. Previous studies show that symmetric bimesogens are particularly suited for flexoelectro-optic switching. By introducing two ester linking groups into the molecular structure of a symmetric bimesogen, it was hypothesised that the flexoelectric properties will be enhanced significantly because of the resulting increase in the dipole moment of the molecules. This was found to be the correct; however, the inclusion of ester linking groups reduced the liquid crystallinity of the material.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we describe models and algorithms for detection and tracking of group and individual targets. We develop two novel group dynamical models, within a continuous time setting, that aim to mimic behavioural properties of groups. We also describe two possible ways of modeling interactions between closely using Markov Random Field (MRF) and repulsive forces. These can be combined together with a group structure transition model to create realistic evolving group models. We use a Markov Chain Monte Carlo (MCMC)-Particles Algorithm to perform sequential inference. Computer simulations demonstrate the ability of the algorithm to detect and track targets within groups, as well as infer the correct group structure over time. ©2008 IEEE.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we address the problem of the separation and recovery of convolutively mixed autoregressive processes in a Bayesian framework. Solving this problem requires the ability to solve integration and/or optimization problems of complicated posterior distributions. We thus propose efficient stochastic algorithms based on Markov chain Monte Carlo (MCMC) methods. We present three algorithms. The first one is a classical Gibbs sampler that generates samples from the posterior distribution. The two other algorithms are stochastic optimization algorithms that allow to optimize either the marginal distribution of the sources, or the marginal distribution of the parameters of the sources and mixing filters, conditional upon the observation. Simulations are presented.

Relevância:

20.00% 20.00%

Publicador: