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.

The Galerkin finite element approximation of the fractional cable equation

The cable equation is one of the most fundamental equations for modeling neuronal dynamics. Cable equations with a fractional order temporal derivative have been introduced to model electrotonic properties of spiny neuronal dendrites. In this paper, the fractional cable equation involving two integro-differential operators is considered. The Galerkin finite element approximations of the fractional cable equation are proposed. The main contribution of this work is outlined as follow: • A semi-discrete finite difference approximation in time is proposed. We prove that the scheme is unconditionally stable, and the numerical solution converges to the exact solution with order O(Δt). • A semi-discrete difference scheme for improving the order of convergence for solving the fractional cable equation is proposed, and the numerical solution converges to the exact solution with order O((Δt)2). • Based on the above semi-discrete difference approximations, Galerkin finite element approximations in space for a full discretization are also investigated. • Finally, some numerical results are given to demonstrate the theoretical analysis.

A second-order accurate numerical approximation for the Riesz space fractional advection-dispersion equation

In this paper, we consider a space Riesz fractional advection-dispersion equation. The equation is obtained from the standard advection-diffusion equation by replacing the ¯rst-order and second-order space derivatives by the Riesz fractional derivatives of order β 1 Є (0; 1) and β2 Є(1; 2], respectively. Riesz fractional advection and dispersion terms are approximated by using two fractional centered difference schemes, respectively. A new weighted Riesz fractional ¯nite difference approximation scheme is proposed. When the weighting factor Ѳ = 1/2, a second- order accurate numerical approximation scheme for the Riesz fractional advection-dispersion equation is obtained. Stability, consistency and convergence of the numerical approximation scheme are discussed. A numerical example is given to show that the numerical results are in good agreement with our theoretical analysis.

A novel numerical approximation for the space fractional advection-dispersion equation

In this paper, we consider a space fractional advection–dispersion equation. The equation is obtained from the standard advection–diffusion equation by replacing the first- and second-order space derivatives by the Riesz fractional derivatives of order β1 ∈ (0, 1) and β2 ∈ (1, 2], respectively. The fractional advection and dispersion terms are approximated by using two fractional centred difference schemes. A new weighted Riesz fractional finite-difference approximation scheme is proposed. When the weighting factor θ equals 12, a second-order accuracy scheme is obtained. The stability, consistency and convergence of the numerical approximation scheme are discussed. A numerical example is given to show that the numerical results are in good agreement with our theoretical analysis.

Numerical approximation for a variable-order nonlinear reaction–subdiffusion equation

Fractional reaction–subdiffusion equations are widely used in recent years to simulate physical phenomena. In this paper, we consider a variable-order nonlinear reaction–subdiffusion equation. A numerical approximation method is proposed to solve the equation. Its convergence and stability are analyzed by Fourier analysis. By means of the technique for improving temporal accuracy, we also propose an improved numerical approximation. Finally, the effectiveness of the theoretical results is demonstrated by numerical examples.

A closed-form approximation for pricing temperature-based weather derivatives

This paper develops analytical distributions of temperature indices on which temperature derivatives are written. If the deviations of daily temperatures from their expected values are modelled as an Ornstein-Uhlenbeck process with timevarying variance, then the distributions of the temperature index on which the derivative is written is the sum of truncated, correlated Gaussian deviates. The key result of this paper is to provide an analytical approximation to the distribution of this sum, thus allowing the accurate computation of payoffs without the need for any simulation. A data set comprising average daily temperature spanning over a hundred years for four Australian cities is used to demonstrate the efficacy of this approach for estimating the payoffs to temperature derivatives. It is demonstrated that expected payoffs computed directly from historical records are a particularly poor approach to the problem when there are trends in underlying average daily temperature. It is shown that the proposed analytical approach is superior to historical pricing.

Diffusivity of adatoms on plasma-exposed surfaces determined from the ionization energy approximation and ionic polarizability

Microscopic surface diffusivity theory based on atomic ionization energy concept is developed to explain the variations of the atomic and displacement polarizations with respect to the surface diffusion activation energy of adatoms in the process of self-assembly of quantum dots on plasma-exposed surfaces. These polarizations are derived classically, while the atomic polarization is quantized to obtain the microscopic atomic polarizability. The surface diffusivity equation is derived as a function of the ionization energy. The results of this work can be used to fine-tune the delivery rates of different adatoms onto nanostructure growth surfaces and optimize the low-temperature plasma based nanoscale synthesis processes.

Approximation of Bayesian predictive p-values with regression ABC

In the Bayesian framework a standard approach to model criticism is to compare some function of the observed data to a reference predictive distribution. The result of the comparison can be summarized in the form of a p-value, and it's well known that computation of some kinds of Bayesian predictive p-values can be challenging. The use of regression adjustment approximate Bayesian computation (ABC) methods is explored for this task. Two problems are considered. The first is the calibration of posterior predictive p-values so that they are uniformly distributed under some reference distribution for the data. Computation is difficult because the calibration process requires repeated approximation of the posterior for different data sets under the reference distribution. The second problem considered is approximation of distributions of prior predictive p-values for the purpose of choosing weakly informative priors in the case where the model checking statistic is expensive to compute. Here the computation is difficult because of the need to repeatedly sample from a prior predictive distribution for different values of a prior hyperparameter. In both these problems we argue that high accuracy in the computations is not required, which makes fast approximations such as regression adjustment ABC very useful. We illustrate our methods with several samples.

Analytical approximation solutions for 3-D optical waveguides: Review

The rectangular dielectric waveguide is the most commonly used structure in integrated optics, especially in semi-conductor diode lasers. Demands for new applications such as high-speed data backplanes in integrated electronics, waveguide filters, optical multiplexers and optical switches are driving technology toward better materials and processing techniques for planar waveguide structures. The infinite slab and circular waveguides that we know are not practical for use on a substrate because the slab waveguide has no lateral confinement and the circular fiber is not compatible with the planar processing technology being used to make planar structures. The rectangular waveguide is the natural structure. In this review, we have discussed several analytical methods for analyzing the mode structure of rectangular structures, beginning with a wave analysis based on the pioneering work of Marcatili. We study three basic techniques with examples to compare their performance levels. These are the analytical approach developed by Marcatili, the perturbation techniques, which improve on the analytical solutions and the effective index method with examples.

Optimal hydrothermal load flow: Formulation and a successive approximation solution for fixed head systems

This paper deals with the optimal load flow problem in a fixed-head hydrothermal electric power system. Equality constraints on the volume of water available for active power generation at the hydro plants as well as inequality constraints on the reactive power generation at the voltage controlled buses are imposed. Conditions for optimal load flow are derived and a successive approximation algorithm for solving the optimal generation schedule is developed. Computer implementation of the algorithm is discussed, and the results obtained from the computer solution of test systems are presented.

Bias reduction using stochastic approximation

The paper studies stochastic approximation as a technique for bias reduction. The proposed method does not require approximating the bias explicitly, nor does it rely on having independent identically distributed (i.i.d.) data. The method always removes the leading bias term, under very mild conditions, as long as auxiliary samples from distributions with given parameters are available. Expectation and variance of the bias-corrected estimate are given. Examples in sequential clinical trials (non-i.i.d. case), curved exponential models (i.i.d. case) and length-biased sampling (where the estimates are inconsistent) are used to illustrate the applications of the proposed method and its small sample properties.

A Fuzzy Approximation Scheme for Sequential Learning in Pattern Recognition

An adaptive learning scheme, based on a fuzzy approximation to the gradient descent method for training a pattern classifier using unlabeled samples, is described. The objective function defined for the fuzzy ISODATA clustering procedure is used as the loss function for computing the gradient. Learning is based on simultaneous fuzzy decisionmaking and estimation. It uses conditional fuzzy measures on unlabeled samples. An exponential membership function is assumed for each class, and the parameters constituting these membership functions are estimated, using the gradient, in a recursive fashion. The induced possibility of occurrence of each class is useful for estimation and is computed using 1) the membership of the new sample in that class and 2) the previously computed average possibility of occurrence of the same class. An inductive entropy measure is defined in terms of induced possibility distribution to measure the extent of learning. The method is illustrated with relevant examples.