方差阴影图中的光渗现象消除算法

方差阴影图算法使用概率的方法计算像素被遮挡的上限概率,通过对深度图滤波的方法来有效地减少阴影图算法中的走样问题,但在深度比较复杂的场景中方差阴影图算法会出现光渗现象,即在应该是阴影的区域却有了亮度.文中使用最小-最大阴影图来辅助消除方差阴影图中的光渗现象,在对深度纹理进行滤波的同时生成一个最小-最大阴影图;在实时绘制场景时,利用最小-最大阴影图来辅助判断当前片元是否完全处在阴影区域内部,由此生成更真实、更准确的阴影.该算法可以很容易地添加到已有的方差阴影图算法的片元处理程序中,并且不会对原有阴影的柔和边界以及绘制的帧率产生影响.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

Min-Max Moving Horizon Estimation for a Class of Hybrid Systems

In this paper, a strategy for min-max Moving Horizon Estimation (MHE) of a class of uncertain hybrid systems is proposed. The class of hybrid systems being considered are Piecewise Affine systems (PWA) with both continuous valued and logic components. Furthermore, we consider the case when there is a (possibly structured) norm bounded uncertainty in each subsystem. Sufficient conditions on the time horizon and the penalties on the state at the beginning of the estimation horizon to guarantee convergence of the MHE scheme will be provided. The MHE scheme will be implemented as a mixed integer semidefinite optimisation for which an efficient algorithm was recently introduced.

Fuzzy min-max neural networks for categorical data: application to missing data imputation

The fuzzy min–max neural network classifier is a supervised learning method. This classifier takes the hybrid neural networks and fuzzy systems approach. All input variables in the network are required to correspond to continuously valued variables, and this can be a significant constraint in many real-world situations where there are not only quantitative but also categorical data. The usual way of dealing with this type of variables is to replace the categorical by numerical values and treat them as if they were continuously valued. But this method, implicitly defines a possibly unsuitable metric for the categories. A number of different procedures have been proposed to tackle the problem. In this article, we present a new method. The procedure extends the fuzzy min–max neural network input to categorical variables by introducing new fuzzy sets, a new operation, and a new architecture. This provides for greater flexibility and wider application. The proposed method is then applied to missing data imputation in voting intention polls. The micro data—the set of the respondents’ individual answers to the questions—of this type of poll are especially suited for evaluating the method since they include a large number of numerical and categorical attributes.

Computational properties of min/max autocorrelation factors

Minimum/maximum autocorrelation factor (MAF) is a suitable algorithm for orthogonalization of a vector random field. Orthogonalization avoids the use of multivariate geostatistics during joint stochastic modeling of geological attributes. This manuscript demonstrates in a practical way that computation of MAF is the same as discriminant analysis of the nested structures. Mathematica software is used to illustrate MAF calculations from a linear model of coregionalization (LMC) model. The limitation of two nested structures in the LMC for MAF is also discussed and linked to the effects of anisotropy and support. The analysis elucidates the matrix properties behind the approach and clarifies relationships that may be useful for model-based approaches. (C) 2003 Elsevier Science Ltd. All rights reserved.

Relative entropy rate based multiple hidden Markov Model Approximation

This paper proposes a novel relative entropy rate (RER) based approach for multiple HMM (MHMM) approximation of a class of discrete-time uncertain processes. Under different uncertainty assumptions, the model design problem is posed either as a min-max optimisation problem or stochastic minimisation problem on the RER between joint laws describing the state and output processes (rather than the more usual RER between output processes). A suitable filter is proposed for which performance results are established which bound conditional mean estimation performance and show that estimation performance improves as the RER is reduced. These filter consistency and convergence bounds are the first results characterising multiple HMM approximation performance and suggest that joint RER concepts provide a useful model selection criteria. The proposed model design process and MHMM filter are demonstrated on an important image processing dim-target detection problem.

Incidental walking activity is sufficient to induce time-dependent conditioning of the Achilles tendon

The Achilles tendon has been seen to exhibit time-dependent conditioning when isometric muscle actions were of a prolonged duration, compared to those involved in dynamic activities, such as walking. Since, the effect of short duration muscle activation associated with dynamic activities is yet to be established, the present study aimed to investigate the effect of incidental walking activity on Achilles tendon diametral strain. Eleven healthy male participants refrained from physical activity in excess of the walking required to carry out necessary daily tasks and wore an activity monitor during the 24 h study period. Achilles tendon diametral strain, 2 cm proximal to the calcaneal insertion, was determined from sagittal sonograms. Baseline sonographic examinations were conducted at ∼08:00 h followed by replicate examinations at 12 and 24 h. Walking activity was measured as either present (1) or absent (0) and a linear weighting function was applied to account for the proximity of walking activity to tendon examination time. Over the course of the day the median (min, max) Achilles tendon diametral strain was −11.4 (4.5, −25.4)%. A statistically significant relationship was evident between walking activity and diametral strain (P < 0.01) and this relationship improved when walking activity was temporally weighted (AIC 131 to 126). The results demonstrate that the short yet repetitive loads generated during activities of daily living, such as walking, are sufficient to induce appreciable time-dependant conditioning of the Achilles tendon. Implications arise for the in vivo measurement of Achilles tendon properties and the rehabilitation of tendinopathy.

Design and implementation of the Exercise for Health trial – a pragmatic exercise intervention for women with breast cancer

Background Exercise for Health was a pragmatic, randomised, controlled trial comparing the effect of an eight-month exercise intervention on function, treatment-related side effects and quality of life following breast cancer, compared with usual care. The intervention commenced six weeks post-surgery, and two modes of delivering the same intervention was compared with usual care. The purpose of this paper is to describe the study design, along with outcomes related to recruitment, retention and representativeness, and intervention participation. Methods: Women newly diagnosed with breast cancer and residing in a major metropolitan city of Queensland, Australia, were eligible to participate. Consenting women were randomised to a face-to-face-delivered exercise group (FtF, n=67), telephone-delivered exercise group (Tel, n=67) or usual care group (UC, n=60) and were assessed pre-intervention (5-weeks post-surgery), mid-intervention (6 months post-surgery) and 10 weeks post-intervention (12 months post-surgery). Each intervention arm entailed 16 sessions with an Exercise Physiologist. Results: Of 318 potentially eligible women, 63% (n=200) agreed to participate, with a 12-month retention rate of 93%. Participants were similar to the Queensland breast cancer population with respect to disease characteristics, and the randomisation procedure was mostly successful at attaining group balance, with the few minor imbalances observed unlikely to influence intervention effects given balance in other related characteristics. Median participation was 14 (min, max: 0, 16) and 13 (min, max: 3, 16) intervention sessions for the FtF and Tel, respectively, with 68% of those in Tel and 82% in FtF participating in at least 75% of sessions. Discussion: Participation in both intervention arms during and following treatment for breast cancer was feasible and acceptable to women. Future work, designed to inform translation into practice, will evaluate the quality of life, clinical, psychosocial and behavioural outcomes associated with each mode of delivery.

Design of flight avoidance manoeuvre alphabets for mixed centralised-decentralised separation management

This paper investigates a mixed centralised-decentralised air traffic separation management system, which combines the best features of the centralised and decentralised systems whilst ensuring the reliability of the air traffic management system during degraded conditions. To overcome communication band limits, we propose a mixed separation manager on the basis of a robust decision (or min-max) problem that is posed on a reduced set of admissible flight avoidance manoeuvres (or a FAM alphabet). We also present a design method for selecting an appropriate FAM alphabet for use in the mixed separation management system. Simulation studies are presented to illustrate the benefits of our proposed FAM alphabet based mixed separation manager.

Fast and accurate quantification using Genetic Algorithm optimized H-1-C-13 refocused constant-time INEPT

Using Genetic Algorithm, a global optimization method inspired by nature's evolutionary process, we have improved the quantitative refocused constant-time INEPT experiment (Q-INEPT-CT) of Makela et al. (JMR 204 (2010) 124-130) with various optimization constraints. The improved `average polarization transfer' and `min-max difference' of new delay sets effectively reduces the experimental time by a factor of two (compared with Q-INEPT-CT, Makela et al.) without compromising on accuracy. We also discuss a quantitative spectral editing technique based on average polarization transfer. (C) 2013 Elsevier Inc. All rights reserved.

A Remark on the A Posteriori Error Analysis of Discontinuous Galerkin Methods for the Obstacle Problem

We revisit the a posteriori error analysis of discontinuous Galerkin methods for the obstacle problem derived in 25]. Under a mild assumption on the trace of obstacle, we derive a reliable a posteriori error estimator which does not involve min/max functions. A key in this approach is an auxiliary problem with discrete obstacle. Applications to various discontinuous Galerkin finite element methods are presented. Numerical experiments show that the new estimator obtained in this article performs better.