31 resultados para Branch and bounds
Resumo:
The contribution of the relative volumes of mineral and collagen to the nanomechanical behavior of articular calcified cartilage is explored using nanoindentation, quantitative backscattered electron imaging, and finite element analysis. Elastic modulus generally increases with mineral volume fraction. In highly mineralized tissues, the mineral occupation of water space significantly increases modulus with addition of little mineral. Mineral and organic phases were modeled using Hashin-Shtrikman composite bounds, calculated as a function of mineral volume fraction. Modulus values fall between the Hashin-Shtrikman bounds, indicating some intermediate degree of mineral phase connectivity. Such connectivity in ACC is greater than that achieved in bone and results from uniform collagen orientation and large volume of water space available for mineral occupation.
Resumo:
POMDP algorithms have made significant progress in recent years by allowing practitioners to find good solutions to increasingly large problems. Most approaches (including point-based and policy iteration techniques) operate by refining a lower bound of the optimal value function. Several approaches (e.g., HSVI2, SARSOP, grid-based approaches and online forward search) also refine an upper bound. However, approximating the optimal value function by an upper bound is computationally expensive and therefore tightness is often sacrificed to improve efficiency (e.g., sawtooth approximation). In this paper, we describe a new approach to efficiently compute tighter bounds by i) conducting a prioritized breadth first search over the reachable beliefs, ii) propagating upper bound improvements with an augmented POMDP and iii) using exact linear programming (instead of the sawtooth approximation) for upper bound interpolation. As a result, we can represent the bounds more compactly and significantly reduce the gap between upper and lower bounds on several benchmark problems. Copyright © 2011, Association for the Advancement of Artificial Intelligence. All rights reserved.
Resumo:
This paper describes recent improvements to the Cambridge Arabic Large Vocabulary Continuous Speech Recognition (LVCSR) Speech-to-Text (STT) system. It is shown that wordboundary context markers provide a powerful method to enhance graphemic systems by implicit phonetic information, improving the modelling capability of graphemic systems. In addition, a robust technique for full covariance Gaussian modelling in the Minimum Phone Error (MPE) training framework is introduced. This reduces the full covariance training to a diagonal covariance training problem, thereby solving related robustness problems. The full system results show that the combined use of these and other techniques within a multi-branch combination framework reduces the Word Error Rate (WER) of the complete system by up to 5.9% relative. Copyright © 2011 ISCA.
Resumo:
This paper reports the design and numerical analysis of a three-dimensional biochip plasma blood separator using computational fluid dynamics techniques. Based on the initial configuration of a two-dimensional (2D) separator, five three-dimensional (3D) microchannel biochip designs are categorically developed through axial and plenary symmetrical expansions. These include the geometric variations of three types of the branch side channels (circular, rectangular, disc) and two types of the main channel (solid and concentric). Ignoring the initial transient behaviour and assuming that steady-state flow has been established, the behaviour of the blood fluid in the devices is algebraically analysed and numerically modelled. The roles of the relevant microchannel mechanisms, i.e. bifurcation, constriction and bending channel, on promoting the separation process are analysed based on modelling results. The differences among the different 3D implementations are compared and discussed. The advantages of 3D over 2D separator in increasing separation volume and effectively depleting cell-free layer fluid from the whole cross section circumference are addressed and illustrated. © 2011 John Wiley & Sons, Ltd.
Resumo:
This paper describes the design and development cycle of a 3D biochip separator and the modelling analysis of flow behaviour in the biochip microchannel features. The focus is on identifying the difference between 2D and 3D implementations as well as developing basic forms of 3D microfluidic separators. Five variants, based around the device are proposed and analysed. These include three variations of the branch channels (circular, rectangular, disc) and two variations of the main channel (solid and concentric). Ignoring the initial transient behaviour and assuming steady state flow has been established, the efficiencies of the flow between the main and side channels for the different designs are analysed and compared with regard to relevant biomicrofluidic laws or effects (bifurcation law, Fahraeus effect, cell-free phenomenon, bending channel effect and laminar flow behaviour). The modelling results identify flow features in microchannels, a constriction and bifurcations and show detailed differences in flow fields between the various designs. The manufacturing process using injection moulding for the initial base case design is also presented and discussed. The work reported here is supported as part of the UK funded 3D-MINTEGRATION project. © 2010 IEEE.
Resumo:
This paper presents new methods for computing the step sizes of the subband-adaptive iterative shrinkage-thresholding algorithms proposed by Bayram & Selesnick and Vonesch & Unser. The method yields tighter wavelet-domain bounds of the system matrix, thus leading to improved convergence speeds. It is directly applicable to non-redundant wavelet bases, and we also adapt it for cases of redundant frames. It turns out that the simplest and most intuitive setting for the step sizes that ignores subband aliasing is often satisfactory in practice. We show that our methods can be used to advantage with reweighted least squares penalty functions as well as L1 penalties. We emphasize that the algorithms presented here are suitable for performing inverse filtering on very large datasets, including 3D data, since inversions are applied only to diagonal matrices and fast transforms are used to achieve all matrix-vector products.