Robust stability of sequential multi-input multi-output quantitative feedback theory designs

This paper re-examines the stability of multi-input multi-output (MIMO) control systems designed using sequential MIMO quantitative feedback theory (QFT). In order to establish the results, recursive design equations for the SISO equivalent plants employed in a sequential MIMO QFT design are established. The equations apply to sequential MIMO QFT designs in both the direct plant domain, which employs the elements of plant in the design, and the inverse plant domain, which employs the elements of the plant inverse in the design. Stability theorems that employ necessary and sufficient conditions for robust closed-loop internal stability are developed for sequential MIMO QFT designs in both domains. The theorems and design equations facilitate less conservative designs and improved design transparency.

Robust bucket position tracking for a large hydraulic excavator

The device we study is the excavation arm of a large hydraulic mining shovel having a multi-loop kinematic form. We describe an iterative algorithm that allows the position of the bucket to be tracked from measurements of the linear actuator extensions. The important characteristic of this algorithm is that it is numerically well-behaved when the linkage is close to singular configurations. While we focus on a specific device, the algorithm is easy to adapt to other multi-loop linkages. (C) 2004 Elsevier Ltd. All rights reserved.

Distillability of Werner states using entanglement witnesses and robust semidefinite programs

We use robust semidefinite programs and entanglement witnesses to study the distillability of Werner states. We perform exact numerical calculations that show two-undistillability in a region of the state space, which was previously conjectured to be undistillable. We also introduce bases that yield interesting expressions for the distillability witnesses and for a tensor product of Werner states with an arbitrary number of copies.

Anisotropy-based robust performance analysis of finite horizon linear discrete time varying systems

We consider a problem of robust performance analysis of linear discrete time varying systems on a bounded time interval. The system is represented in the state-space form. It is driven by a random input disturbance with imprecisely known probability distribution; this distributional uncertainty is described in terms of entropy. The worst-case performance of the system is quantified by its a-anisotropic norm. Computing the anisotropic norm is reduced to solving a set of difference Riccati and Lyapunov equations and a special form equation.

General practice in Australia 2020: "robust and ready" or "rudderless and reeling"?

The future role and structure of Australian general practice remains uncertain, despite a decade of seemingly constant change following the release of the National Health Strategy papers. Some of the suggested change strategies (such as rural Practice Incentive Payments and practice accreditation) have been implemented; others (such as general practitioner involvement with area health authorities in delivering national goals and targets for communities) still await attention. An overarching vision for our health care system in 2020 and general practice's role within it are still to be clearly enunciated. Australia is at variance with other Western countries, such as the United Kingdom, Canada and New Zealand, which have spent significant time refocusing their health systems to deal with an ageing population with an increased burden of chronic disease. Health bureaucrats and governments need to invest strategically in operational primary care now. This will require the active commitment of general practice's national bodies to articulate and actively promote a shared vision for Australian general practice.

Matching commercial clips from TV streams using a unique, robust and compact signature

One of critical challenges in automatic recognition of TV commercials is to generate a unique, robust and compact signature. Uniqueness indicates the ability to identify the similarity among the commercial video clips which may have slight content variation. Robustness means the ability to match commercial video clips containing the same content but probably with different digitalization/encoding, some noise data, and/or transmission and recording distortion. Efficiency is about the capability of effectively matching commercial video sequences with a low computation cost and storage overhead. In this paper, we present a binary signature based method, which meets all the three criteria above, by combining the techniques of ordinal and color measurements. Experimental results on a real large commercial video database show that our novel approach delivers a significantly better performance comparing to the existing methods.

Face recognition robust to head pose from one sample image

Most face recognition systems only work well under quite constrained environments. In particular, the illumination conditions, facial expressions and head pose must be tightly controlled for good recognition performance. In 2004, we proposed a new face recognition algorithm, Adaptive Principal Component Analysis (APCA) [4], which performs well against both lighting variation and expression change. But like other eigenface-derived face recognition algorithms, APCA only performs well with frontal face images. The work presented in this paper is an extension of our previous work to also accommodate variations in head pose. Following the approach of Cootes et al, we develop a face model and a rotation model which can be used to interpret facial features and synthesize realistic frontal face images when given a single novel face image. We use a Viola-Jones based face detector to detect the face in real-time and thus solve the initialization problem for our Active Appearance Model search. Experiments show that our approach can achieve good recognition rates on face images across a wide range of head poses. Indeed recognition rates are improved by up to a factor of 5 compared to standard PCA.

Refinement-robust fairness

We motivate and study the robustness of fairness notions under refinement of transitions and places in Petri nets. We show that the classical notions of weak and strong fairness are not robust and we propose a hierarchy of increasingly strong, refinement-robust fairness notions. That hierarchy is based on the conflict structure of transitions, which characterizes the interplay between choice and synchronization in a fairness notion. Our fairness notions are defined on non-sequential runs, but we show that the most important notions can be easily expressed on sequential runs as well. The hierarchy is further motivated by a brief discussion on the computational power of the fairness notions.