Convexity, Classification, and Risk Bounds

Many of the classification algorithms developed in the machine learning literature, including the support vector machine and boosting, can be viewed as minimum contrast methods that minimize a convex surrogate of the 0–1 loss function. The convexity makes these algorithms computationally efficient. The use of a surrogate, however, has statistical consequences that must be balanced against the computational virtues of convexity. To study these issues, we provide a general quantitative relationship between the risk as assessed using the 0–1 loss and the risk as assessed using any nonnegative surrogate loss function. We show that this relationship gives nontrivial upper bounds on excess risk under the weakest possible condition on the loss function—that it satisfies a pointwise form of Fisher consistency for classification. The relationship is based on a simple variational transformation of the loss function that is easy to compute in many applications. We also present a refined version of this result in the case of low noise, and show that in this case, strictly convex loss functions lead to faster rates of convergence of the risk than would be implied by standard uniform convergence arguments. Finally, we present applications of our results to the estimation of convergence rates in function classes that are scaled convex hulls of a finite-dimensional base class, with a variety of commonly used loss functions.

Stochastic models and simulation of ion channel dynamics

The behaviour of ion channels within cardiac and neuronal cells is intrinsically stochastic in nature. When the number of channels is small this stochastic noise is large and can have an impact on the dynamics of the system which is potentially an issue when modelling small neurons and drug block in cardiac cells. While exact methods correctly capture the stochastic dynamics of a system they are computationally expensive, restricting their inclusion into tissue level models and so approximations to exact methods are often used instead. The other issue in modelling ion channel dynamics is that the transition rates are voltage dependent, adding a level of complexity as the channel dynamics are coupled to the membrane potential. By assuming that such transition rates are constant over each time step, it is possible to derive a stochastic differential equation (SDE), in the same manner as for biochemical reaction networks, that describes the stochastic dynamics of ion channels. While such a model is more computationally efficient than exact methods we show that there are analytical problems with the resulting SDE as well as issues in using current numerical schemes to solve such an equation. We therefore make two contributions: develop a different model to describe the stochastic ion channel dynamics that analytically behaves in the correct manner and also discuss numerical methods that preserve the analytical properties of the model.

Variational Bayes and the reduced dependence approximation for the autologistic model on an irregular grid with applications

Discrete Markov random field models provide a natural framework for representing images or spatial datasets. They model the spatial association present while providing a convenient Markovian dependency structure and strong edge-preservation properties. However, parameter estimation for discrete Markov random field models is difficult due to the complex form of the associated normalizing constant for the likelihood function. For large lattices, the reduced dependence approximation to the normalizing constant is based on the concept of performing computationally efficient and feasible forward recursions on smaller sublattices which are then suitably combined to estimate the constant for the whole lattice. We present an efficient computational extension of the forward recursion approach for the autologistic model to lattices that have an irregularly shaped boundary and which may contain regions with no data; these lattices are typical in applications. Consequently, we also extend the reduced dependence approximation to these scenarios enabling us to implement a practical and efficient non-simulation based approach for spatial data analysis within the variational Bayesian framework. The methodology is illustrated through application to simulated data and example images. The supplemental materials include our C++ source code for computing the approximate normalizing constant and simulation studies.

A practical approach for identifying expected solution performance and robustness in operations research applications

A practical approach for identifying solution robustness is proposed for situations where parameters are uncertain. The approach is based upon the interpretation of a probability density function (pdf) and the definition of three parameters that describe how significant changes in the performance of a solution are deemed to be. The pdf is constructed by interpreting the results of simulations. A minimum number of simulations are achieved by updating the mean, variance, skewness and kurtosis of the sample using computationally efficient recursive equations. When these criterions have converged then no further simulations are needed. A case study involving several no-intermediate storage flow shop scheduling problems demonstrates the effectiveness of the approach.

Modeling ion channel dynamics through reflected stochastic differential equations

Ion channels are membrane proteins that open and close at random and play a vital role in the electrical dynamics of excitable cells. The stochastic nature of the conformational changes these proteins undergo can be significant, however current stochastic modeling methodologies limit the ability to study such systems. Discrete-state Markov chain models are seen as the "gold standard," but are computationally intensive, restricting investigation of stochastic effects to the single-cell level. Continuous stochastic methods that use stochastic differential equations (SDEs) to model the system are more efficient but can lead to simulations that have no biological meaning. In this paper we show that modeling the behavior of ion channel dynamics by a reflected SDE ensures biologically realistic simulations, and we argue that this model follows from the continuous approximation of the discrete-state Markov chain model. Open channel and action potential statistics from simulations of ion channel dynamics using the reflected SDE are compared with those of a discrete-state Markov chain method. Results show that the reflected SDE simulations are in good agreement with the discrete-state approach. The reflected SDE model therefore provides a computationally efficient method to simulate ion channel dynamics while preserving the distributional properties of the discrete-state Markov chain model and also ensuring biologically realistic solutions. This framework could easily be extended to other biochemical reaction networks. © 2012 American Physical Society.

Alternating direction implicit numerical method for the space and time fractional Bloch-Torrey equation in 3-D

Recently, some authors have considered a new diffusion model–space and time fractional Bloch-Torrey equation (ST-FBTE). Magin et al. (2008) have derived analytical solutions with fractional order dynamics in space (i.e., _ = 1, β an arbitrary real number, 1 < β ≤ 2) and time (i.e., 0 < α < 1, and β = 2), respectively. Yu et al. (2011) have derived an analytical solution and an effective implicit numerical method for solving ST-FBTEs, and also discussed the stability and convergence of the implicit numerical method. However, due to the computational overheads necessary to perform the simulations for nuclear magnetic resonance (NMR) in three dimensions, they present a study based on a two-dimensional example to confirm their theoretical analysis. Alternating direction implicit (ADI) schemes have been proposed for the numerical simulations of classic differential equations. The ADI schemes will reduce a multidimensional problem to a series of independent one-dimensional problems and are thus computationally efficient. In this paper, we consider the numerical solution of a ST-FBTE on a finite domain. The time and space derivatives in the ST-FBTE are replaced by the Caputo and the sequential Riesz fractional derivatives, respectively. A fractional alternating direction implicit scheme (FADIS) for the ST-FBTE in 3-D is proposed. Stability and convergence properties of the FADIS are discussed. Finally, some numerical results for ST-FBTE are given.

Numerical analysis of the time variable fractional order mobile-immobile advection-dispersion model

Many physical processes exhibit fractional order behavior that varies with time or space. The continuum of order in the fractional calculus allows the order of the fractional operator to be considered as a variable. In this paper, we consider the time variable fractional order mobile-immobile advection-dispersion model. Numerical methods and analyses of stability and convergence for the fractional partial differential equations are quite limited and difficult to derive. This motivates us to develop efficient numerical methods as well as stability and convergence of the implicit numerical methods for the fractional order mobile immobile advection-dispersion model. In the paper, we use the Coimbra variable time fractional derivative which is more efficient from the numerical standpoint and is preferable for modeling dynamical systems. An implicit Euler approximation for the equation is proposed and then the stability of the approximation are investigated. As for the convergence of the numerical scheme we only consider a special case, i.e. the time fractional derivative is independent of time variable t. The case where the time fractional derivative depends both the time variable t and the space variable x will be considered in the future work. Finally, numerical examples are provided to show that the implicit Euler approximation is computationally efficient.

Numerical techniques for the variable order time fractional diffusion equation

In this paper we consider the variable order time fractional diffusion equation. We adopt the Coimbra variable order (VO) time fractional operator, which defines a consistent method for VO differentiation of physical variables. The Coimbra variable order fractional operator also can be viewed as a Caputo-type definition. Although this definition is the most appropriate definition having fundamental characteristics that are desirable for physical modeling, numerical methods for fractional partial differential equations using this definition have not yet appeared in the literature. Here an approximate scheme is first proposed. The stability, convergence and solvability of this numerical scheme are discussed via the technique of Fourier analysis. Numerical examples are provided to show that the numerical method is computationally efficient. Crown Copyright © 2012 Published by Elsevier Inc. All rights reserved.

The development of ground impact models for the analysis of the risks associated with Unmanned Aircraft Operations over inhabited areas

With the emergence of Unmanned Aircraft Systems (UAS) there is a growing need for safety standards and regulatory frameworks to manage the risks associated with their operations. The primary driver for airworthiness regulations (i.e., those governing the design, manufacture, maintenance and operation of UAS) are the risks presented to people in the regions overflown by the aircraft. Models characterising the nature of these risks are needed to inform the development of airworthiness regulations. The output from these models should include measures of the collective, individual and societal risk. A brief review of these measures is provided. Based on the review, it was determined that the model of the operation of an UAS over inhabited areas must be capable of describing the distribution of possible impact locations, given a failure at a particular point in the flight plan. Existing models either do not take the impact distribution into consideration, or propose complex and computationally expensive methods for its calculation. A computationally efficient approach for estimating the boundary (and in turn area) of the impact distribution for fixed wing unmanned aircraft is proposed. A series of geometric templates that approximate the impact distributions are derived using an empirical analysis of the results obtained from a 6-Degree of Freedom (6DoF) simulation. The impact distributions can be aggregated to provide impact footprint distributions for a range of generic phases of flight and missions. The maximum impact footprint areas obtained from the geometric template are shown to have a relative error of typically less than 1% compared to the areas calculated using the computationally more expensive 6DoF simulation. Computation times for the geometric models are on the order of one second or less, using a standard desktop computer. Future work includes characterising the distribution of impact locations within the footprint boundaries.

A sequential Monte Carlo approach to the sequential design for discriminating between rival continuous data models

Here we present a sequential Monte Carlo approach to Bayesian sequential design for the incorporation of model uncertainty. The methodology is demonstrated through the development and implementation of two model discrimination utilities; mutual information and total separation, but it can also be applied more generally if one has different experimental aims. A sequential Monte Carlo algorithm is run for each rival model (in parallel), and provides a convenient estimate of the marginal likelihood (of each model) given the data, which can be used for model comparison and in the evaluation of utility functions. A major benefit of this approach is that it requires very little problem specific tuning and is also computationally efficient when compared to full Markov chain Monte Carlo approaches. This research is motivated by applications in drug development and chemical engineering.

Numerical simulation of red blood cells’ motion : a review

The micro-circulation of blood plays an important role in human body by providing oxygen and nutrients to the cells and removing carbon dioxide and wastes from the cells. This process is greatly affected by the rheological properties of the Red Blood Cells (RBCs). Changes in the rheological properties of the RBCs are caused by certain human diseases such as malaria and sickle cell diseases. Therefore it is important to understand the motion and deformation mechanism of RBCs in order to diagnose and treat this kind of diseases. Although, many methods have been developed to explore the behavior of the RBCs in micro-channels, they could not explain the deformation mechanism of the RBCs properly. Recently developed Particle Methods are employed to explain the RBCs’ behavior in micro-channels more comprehensively. The main objective of this study is to critically analyze the present methods, used to model the RBC behavior in micro-channels, in order to develop a computationally efficient particle based model to describe the complete behavior of the RBCs in micro-channels accurately and comprehensively

Utilizing least significant bit-planes of RONI pixels for medical image watermarking

We propose a computationally efficient image border pixel based watermark embedding scheme for medical images. We considered the border pixels of a medical image as RONI (region of non-interest), since those pixels have no or little interest to doctors and medical professionals irrespective of the image modalities. Although RONI is used for embedding, our proposed scheme still keeps distortion at a minimum level in the embedding region using the optimum number of least significant bit-planes for the border pixels. All these not only ensure that a watermarked image is safe for diagnosis, but also help minimize the legal and ethical concerns of altering all pixels of medical images in any manner (e.g, reversible or irreversible). The proposed scheme avoids the need for RONI segmentation, which incurs capacity and computational overheads. The performance of the proposed scheme has been compared with a relevant scheme in terms of embedding capacity, image perceptual quality (measured by SSIM and PSNR), and computational efficiency. Our experimental results show that the proposed scheme is computationally efficient, offers an image-content-independent embedding capacity, and maintains a good image quality

Autonomous forced landing system for light general aviation aircraft in unknown environments

This paper presents a system which enhances the capabilities of a light general aviation aircraft to land autonomously in case of an unscheduled event such as engine failure. The proposed system will not only increase the level of autonomy for the general aviation aircraft industry but also increase the level of dependability. Safe autonomous landing in case of an engine failure with a certain level of reliability is the primary focus of our work as both safety and reliability are attributes of dependability. The system is designed for a light general aviation aircraft but can be extended for dependable unmanned aircraft systems. The underlying system components are computationally efficient and provides continuous situation assessment in case of an emergency landing. The proposed system is undergoing an evaluation phase using an experimental platform (Cessna 172R) in real world scenarios.

A security system based on human iris identification using wavelet transform

A security system based on the recognition of the iris of human eyes using the wavelet transform is presented. The zero-crossings of the wavelet transform are used to extract the unique features obtained from the grey-level profiles of the iris. The recognition process is performed in two stages. The first stage consists of building a one-dimensional representation of the grey-level profiles of the iris, followed by obtaining the wavelet transform zerocrossings of the resulting representation. The second stage is the matching procedure for iris recognition. The proposed approach uses only a few selected intermediate resolution levels for matching, thus making it computationally efficient as well as less sensitive to noise and quantisation errors. A normalisation process is implemented to compensate for size variations due to the possible changes in the camera-to-face distance. The technique has been tested on real images in both noise-free and noisy conditions. The technique is being investigated for real-time implementation, as a stand-alone system, for access control to high-security areas.

Mechanism based emulation of dynamic simulation models : concept and application in hydrology

Many model-based investigation techniques, such as sensitivity analysis, optimization, and statistical inference, require a large number of model evaluations to be performed at different input and/or parameter values. This limits the application of these techniques to models that can be implemented in computationally efficient computer codes. Emulators, by providing efficient interpolation between outputs of deterministic simulation models, can considerably extend the field of applicability of such computationally demanding techniques. So far, the dominant techniques for developing emulators have been priors in the form of Gaussian stochastic processes (GASP) that were conditioned with a design data set of inputs and corresponding model outputs. In the context of dynamic models, this approach has two essential disadvantages: (i) these emulators do not consider our knowledge of the structure of the model, and (ii) they run into numerical difficulties if there are a large number of closely spaced input points as is often the case in the time dimension of dynamic models. To address both of these problems, a new concept of developing emulators for dynamic models is proposed. This concept is based on a prior that combines a simplified linear state space model of the temporal evolution of the dynamic model with Gaussian stochastic processes for the innovation terms as functions of model parameters and/or inputs. These innovation terms are intended to correct the error of the linear model at each output step. Conditioning this prior to the design data set is done by Kalman smoothing. This leads to an efficient emulator that, due to the consideration of our knowledge about dominant mechanisms built into the simulation model, can be expected to outperform purely statistical emulators at least in cases in which the design data set is small. The feasibility and potential difficulties of the proposed approach are demonstrated by the application to a simple hydrological model.