A general method to determine sampling windows for nonlinear mixed effects models with an application to population pharmacokinetic studies

Optimal design methods have been proposed to determine the best sampling times when sparse blood sampling is required in clinical pharmacokinetic studies. However, the optimal blood sampling time points may not be feasible in clinical practice. Sampling windows, a time interval for blood sample collection, have been proposed to provide flexibility in blood sampling times while preserving efficient parameter estimation. Because of the complexity of the population pharmacokinetic models, which are generally nonlinear mixed effects models, there is no analytical solution available to determine sampling windows. We propose a method for determination of sampling windows based on MCMC sampling techniques. The proposed method attains a stationary distribution rapidly and provides time-sensitive windows around the optimal design points. The proposed method is applicable to determine sampling windows for any nonlinear mixed effects model although our work focuses on an application to population pharmacokinetic models.

Nonlinear H_infinity control of UAVs for collision avoidance in gusty environments

This paper proposes a nonlinear H_infinity controller for stabilization of velocities, attitudes and angular rates of a fixed-wing unmanned aerial vehicle (UAV) in a windy environment. The suggested controller aims to achieve a steady-state flight condition in the presence of wind gusts such that the host UAV can be maneuvered to avoid collision with other UAVs during cruise flight with safety guarantees. This paper begins with building a proper model capturing flight aerodynamics of UAVs. Then a nonlinear controller is developed with gust attenuation and rapid response properties. Simulations are conducted for the Shadow UAV to verify performance of the proposed con- troller. Comparative studies with the proportional-integral-derivative (PID) controllers demonstrate that the proposed controller exhibits great performance improvement in a gusty environment, making it suitable for integration into the design of flight control systems for cruise flight of UAVs.

The persistence of phase-separation in LiFePO4 with two-dimensional Li+ transport : the Cahn-Hilliard-reaction equation and the role of defects

We examine the solution of the two-dimensional Cahn-Hilliard-reaction (CHR) equation in the xy plane as a model of Li+ intercalation into LiFePO4 material. We validate our numerical solution against the solution of the depth-averaged equation, which has been used to model intercalation in the limit of highly orthotropic diffusivity and gradient penalty tensors. We then examine the phase-change behaviour in the full CHR system as these parameters become more isotropic, and find that as the Li+ diffusivity is increased in the x direction, phase separation persists at high currents, even in small crystals with averaged coherency strain included. The resulting voltage curves decrease monotonically, which has previously been considered a hallmark of crystals that fill homogeneously.

Tactically-driven nonmonotone travelling waves

Models of cell invasion incorporating directed cell movement up a gradient of an external substance and carrying capacity-limited proliferation give rise to travelling wave solutions. Travelling wave profiles with various shapes, including smooth monotonically decreasing, shock-fronted monotonically decreasing and shock-fronted nonmonotone shapes, have been reported previously in the literature. The existence of tacticallydriven shock-fronted nonmonotone travelling wave solutions is analysed for the first time. We develop a necessary condition for nonmonotone shock-fronted solutions. This condition shows that some of the previously reported shock-fronted nonmonotone solutions are genuine while others are a consequence of numerical error. Our results demonstrate that, for certain conditions, travelling wave solutions can be either smooth and monotone, smooth and nonmonotone or discontinuous and nonmonotone. These different shapes correspond to different invasion speeds. A necessary and sufficient condition for the travelling wave with minimum wave speed to be nonmonotone is presented. Several common forms of the tactic sensitivity function have the potential to satisfy the newly developed condition for nonmonotone shock-fronted solutions developed in this work.

National Institute for Clinical Studies Report for Phase 1, Evidence Uptake Network : Best Practice Community Care for Clients with Chronic Venous Leg Ulcers

Chronic leg ulcers cause significant pain, cost, decreased quality of life and morbidity for a considerable segment of the older population (Graham et al., 2003a). At any given time the prevalence of patients with open leg ulcers receiving treatment is between 0.11% - 0.18% (Briggs & Closs 2003). Chronic leg ulcers occur in approximately 1 - 2% of the over 60 population in the US, UK, Europe and Australia (Baker & Stacey 1994; Johnson 1995; Lees & Lambert 1992; Margolis et al. 2002). Considerable research has been undertaken to determine the best treatment practices that will aid in the management and the healing of these ulcers, and practical and effective strategies and techniques for healing venous leg ulcers have been trialled to demonstrate their beneficial effects (Nelson et al. 2004; Cullum et al. 2001)...

Mesopic rod and S-cone interactions revealed by modulation thresholds

We analyzed mesopic rod and S-cone interactions in terms of their contributions to the blue-yellow opponent pathway. Stimuli were generated using a 4-primary colorimeter. Mixed rod and S-cone modulation thresholds (constant L-, M-cone excitation) were measured as a function of their phase difference. Modulation amplitude was equated using threshold units and contrast ratios. This study identified three interaction types: (1) A linear and antagonistic rod:S-cone interaction, (2) probability summation (3) and a previously unidentified mutual nonlinear reinforcement. Linear rod:S-cone interactions occur within the blue-yellow opponent pathway. Probability summation involves signaling by different post-receptoral pathways. The origin of the nonlinear reinforcement is possibly at the photoreceptors.

An extension to the rank constraint for improving the reliability of stereo matching algorithms using the rank transform

The rank transform is one non-parametric transform which has been applied to the stereo matching problem The advantages of this transform include its invariance to radio metric distortion and its amenability to hardware implementation. This paper describes the derivation of the rank constraint for matching using the rank transform Previous work has shown that this constraint was capable of resolving ambiguous matches thereby improving match reliability A new matching algorithm incorporating this constraint was also proposed. This paper extends on this previous work by proposing a matching algorithm which uses a dimensional match surface in which the match score is computed for every possible template and match window combination. The principal advantage of this algorithm is that the use of the match surface enforces the left�right consistency and uniqueness constraints thus improving the algorithms ability to remove invalid matches Experimental results for a number of test stereo pairs show that the new algorithm is capable of identifying and removing a large number of in incorrect matches particularly in the case of occlusions

An accurate and reliable stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints,including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing a significant proportion of invalid matches. The accuracy of matching in the vicinity of edges is also improved.

A hybrid stereo matching algorithm incorporating the rank constraint

A fundamental problem faced by stereo vision algorithms is that of determining correspondences between two images which comprise a stereo pair. This paper presents work towards the development of a new matching algorithm, based on the rank transform. This algorithm makes use of both area-based and edge-based information, and is therefore referred to as a hybrid algorithm. In addition, this algorithm uses a number of matching constraints, including the novel rank constraint. Results obtained using a number of test pairs show that the matching algorithm is capable of removing most invalid matches. The accuracy of matching in the vicinity of edges is also improved.

A constraint to improve the reliability of stereo matching using the rank transform

The rank transform is a non-parametric technique which has been recently proposed for the stereo matching problem. The motivation behind its application to the matching problem is its invariance to certain types of image distortion and noise, as well as its amenability to real-time implementation. This paper derives an analytic expression for the process of matching using the rank transform, and then goes on to derive one constraint which must be satisfied for a correct match. This has been dubbed the rank order constraint or simply the rank constraint. Experimental work has shown that this constraint is capable of resolving ambiguous matches, thereby improving matching reliability. This constraint was incorporated into a new algorithm for matching using the rank transform. This modified algorithm resulted in an increased proportion of correct matches, for all test imagery used.

Evaluation of new and existing confidence measures for stereo matching

This paper outlines existing matching diagnostics, which may be used for identifying invalid matches and estimating the probability of a correct match. In addition, it proposes a new diagnostic for error prediction which can be used with the rank and census transforms. Both the existing and the new diagnostics have been evaluated and compared for a number of test images. In each case, a confidence estimate was computed for every location of the disparity map, and disparities having a low confidence estimate removed from the disparity map. Collectively, these confidence estimates may be termed a confidence map. Such information would be useful for potential applications of stereo vision such as automation and navigation.

Fast and robust stereo matching algorithms for mining automation

The mining environment, being complex, irregular, and time-varying, presents a challenging prospect for stereo vision. For this application, speed, reliability, and the ability to produce a dense depth map are of foremost importance. This paper evaluates a number of matching techniques for possible use in a stereo vision sensor for mining automation applications. Area-based techniques have been investigated because they have the potential to yield dense maps, are amenable to fast hardware implementation, and are suited to textured scenes. In addition, two nonparametric transforms, namely, rank and census, have been investigated. Matching algorithms using these transforms were found to have a number of clear advantages, including reliability in the presence of radiometric distortion, low computational complexity, and amenability to hardware implementation.

Fast and robust stereo matching algorithms for mining automation

The mining environment, being complex, irregular and time varying, presents a challenging prospect for stereo vision. The objective is to produce a stereo vision sensor suited to close-range scenes consisting primarily of rocks. This sensor should be able to produce a dense depth map within real-time constraints. Speed and robustness are of foremost importance for this investigation. A number of area based matching metrics have been implemented, including the SAD, SSD, NCC, and their zero-meaned versions. The NCC and the zero meaned SAD and SSD were found to produce the disparity maps with the highest proportion of valid matches. The plain SAD and SSD were the least computationally expensive, due to all their operations taking place in integer arithmetic, however, they were extremely sensitive to radiometric distortion. Non-parametric techniques for matching, in particular, the rank and the census transform, have also been investigated. The rank and census transforms were found to be robust with respect to radiometric distortion, as well as being able to produce disparity maps with a high proportion of valid matches. An additional advantage of both the rank and the census transform is their amenability to fast hardware implementation.

Non-parametric techniques for fast and robust stereo matching

The mining environment presents a challenging prospect for stereo vision. Our objective is to produce a stereo vision sensor suited to close-range scenes consisting mostly of rocks. This sensor should produce a dense depth map within real-time constraints. Speed and robustness are of foremost importance for this application. This paper compares a number of stereo matching algorithms in terms of robustness and suitability to fast implementation. These include traditional area-based algorithms, and algorithms based on non-parametric transforms, notably the rank and census transforms. Our experimental results show that the rank and census transforms are robust with respect to radiometric distortion and introduce less computational complexity than conventional area-based matching techniques.

A generic implementation framework for stereo matching algorithms

Traditional area-based matching techniques make use of similarity metrics such as the Sum of Absolute Differences(SAD), Sum of Squared Differences (SSD) and Normalised Cross Correlation (NCC). Non-parametric matching algorithms such as the rank and census rely on the relative ordering of pixel values rather than the pixels themselves as a similarity measure. Both traditional area-based and non-parametric stereo matching techniques have an algorithmic structure which is amenable to fast hardware realisation. This investigation undertakes a performance assessment of these two families of algorithms for robustness to radiometric distortion and random noise. A generic implementation framework is presented for the stereo matching problem and the relative hardware requirements for the various metrics investigated.