Training to address attitudes and behaviour of rural bank managers in Madhya Pradesh, India: a programme to facilitate financial inclusion

Given their physical presence in India, banks are arguably well-placed to improve financial inclusion in rural areas. However, uncertain repayment capacities and high transaction costs mean formal financial institutions are often reluctant to lend to the rural poor. Conversely, high transaction costs in dealing with banks are also incurred by clients, through, for example, lengthy, cumbersome and potentially ignominious procedures. Negative attitudes towards poor clients can be an important component of such transaction costs. An applied research project funded by the Enterprise Development Innovation Fund (EDIF-DFID) developed an innovative training programme designed to encourage more positive attitudes of bank staff towards poor clients, and towards their own role in rural poverty alleviation and development. This paper examines the development of the training programme, its implementation, and the results of its evaluation. It is shown that training can bring about attitudinal change, which in turn is reflected in behaviour and social impact. Copyright © 2007 John Wiley & Sons, Ltd.

Complexity of Monte Carlo algorithms for a class of integral equations

In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.

Design of a minimum variance multiple input-multiple output neuro self-tuning proportional-integral-derivative controller for non-linear dynamic systems

In this study a minimum variance neuro self-tuning proportional-integral-derivative (PID) controller is designed for complex multiple input-multiple output (MIMO) dynamic systems. An approximation model is constructed, which consists of two functional blocks. The first block uses a linear submodel to approximate dominant system dynamics around a selected number of operating points. The second block is used as an error agent, implemented by a neural network, to accommodate the inaccuracy possibly introduced by the linear submodel approximation, various complexities/uncertainties, and complicated coupling effects frequently exhibited in non-linear MIMO dynamic systems. With the proposed model structure, controller design of an MIMO plant with n inputs and n outputs could be, for example, decomposed into n independent single input-single output (SISO) subsystem designs. The effectiveness of the controller design procedure is initially verified through simulations of industrial examples.

Hammerstein model identification algorithm using Bezier-Bernstein approximation

A new identification algorithm is introduced for the Hammerstein model consisting of a nonlinear static function followed by a linear dynamical model. The nonlinear static function is characterised by using the Bezier-Bernstein approximation. The identification method is based on a hybrid scheme including the applications of the inverse of de Casteljau's algorithm, the least squares algorithm and the Gauss-Newton algorithm subject to constraints. The related work and the extension of the proposed algorithm to multi-input multi-output systems are discussed. Numerical examples including systems with some hard nonlinearities are used to illustrate the efficacy of the proposed approach through comparisons with other approaches.

Effects of vitamin E and fish oil inclusion in broiler diets on meat fatty acid composition and on the flavour of a composite sample of breast meat

BACKGROUND: Enriching poultry meat with long-chain n-3 polyunsaturated fatty acids (LC n-3 PUFA) can increase low population intakes of LC n-3 PUFA, but fishy taints can spoil reheated meat. This experiment determined the effect of different amounts of LC n-3 PUFA and vitamin E in the broiler diet on the fatty acid composition and sensory characteristics of the breast meat. Ross 308 broilers (120) were randomly allocated to one of five treatments from 21 to 42 days of age. Diets contained (g kg−1) 0, 9 or 18 LC n-3 PUFA (0LC, 9LC, 18LC), and 100, 150 or 200 mg LD--tocopherol acetate kg−1 (E). The five diets were 0LC100E, 9LC100E, 18LC100E, 18LC150E, 18LC200E, with four pens per diet, except 18LC100E (eight pens). Breast meat was analysed for fatty acids (uncooked) and sensory analysis by R-index (reheated). RESULTS: LC n-3 PUFA content (mg kg−1 meat) was 514 (0LC100E) and 2236 (9LC and 18LC). Compared with 0LC100E, meat from 18LC100E and 18LC150E tasted significantly different, while 23% of panellists detected fishy taints in 9LC100E and 18LC200E. CONCLUSION: Chicken meat can be enriched with nutritionally meaningful amounts of LC n-3 PUFA, but > 100 mg dl--tocopherol acetate kg−1 broiler diet is needed to protect reheated meat from oxidative deterioration. Copyright © 2010 Society of Chemical Industry

Condition number estimates for combined potential integral operators in acoustics and their boundary element discretisation

We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers for these formulations, and also on the norms of the classical acoustic single- and double-layer potential operators. These bounds to some extent make explicit the dependence of condition numbers on the wave number $k$, the geometry of the scatterer, and the coupling parameter. For example, with the usual choice of coupling parameter they show that, while the condition number grows like $k^{1/3}$ as $k\to\infty$, when the scatterer is a circle or sphere, it can grow as fast as $k^{7/5}$ for a class of `trapping' obstacles. In this paper we prove further bounds, sharpening and extending our previous results. In particular we show that there exist trapping obstacles for which the condition numbers grow as fast as $\exp(\gamma k)$, for some $\gamma>0$, as $k\to\infty$ through some sequence. This result depends on exponential localisation bounds on Laplace eigenfunctions in an ellipse that we prove in the appendix. We also clarify the correct choice of coupling parameter in 2D for low $k$. In the second part of the paper we focus on the boundary element discretisation of these operators. We discuss the extent to which the bounds on the continuous operators are also satisfied by their discrete counterparts and, via numerical experiments, we provide supporting evidence for some of the theoretical results, both quantitative and asymptotic, indicating further which of the upper and lower bounds may be sharper.

A neural network enhanced generalized minimum variance self-tuning proportional, integral and derivative control algorithm for complex dynamic systems

A neural network enhanced proportional, integral and derivative (PID) controller is presented that combines the attributes of neural network learning with a generalized minimum-variance self-tuning control (STC) strategy. The neuro PID controller is structured with plant model identification and PID parameter tuning. The plants to be controlled are approximated by an equivalent model composed of a simple linear submodel to approximate plant dynamics around operating points, plus an error agent to accommodate the errors induced by linear submodel inaccuracy due to non-linearities and other complexities. A generalized recursive least-squares algorithm is used to identify the linear submodel, and a layered neural network is used to detect the error agent in which the weights are updated on the basis of the error between the plant output and the output from the linear submodel. The procedure for controller design is based on the equivalent model, and therefore the error agent is naturally functioned within the control law. In this way the controller can deal not only with a wide range of linear dynamic plants but also with those complex plants characterized by severe non-linearity, uncertainties and non-minimum phase behaviours. Two simulation studies are provided to demonstrate the effectiveness of the controller design procedure.

Self-tuning proportional, integral and derivative controller based on genetic algorithm least squares

A self-tuning proportional, integral and derivative control scheme based on genetic algorithms (GAs) is proposed and applied to the control of a real industrial plant. This paper explores the improvement in the parameter estimator, which is an essential part of an adaptive controller, through the hybridization of recursive least-squares algorithms by making use of GAs and the possibility of the application of GAs to the control of industrial processes. Both the simulation results and the experiments on a real plant show that the proposed scheme can be applied effectively.

Fine root biomass and turnover in southern taiga estimated by root inclusion nets

Fine roots play an important part in forest carbon, nutrient and water cycles. The turnover of fine roots constitutes a major carbon input to soils. Estimation of fine root turnover is difficult, labour intensive and is often compounded by artefacts created by soil disturbance. In this work, an alternative approach of using inclusion nets installed in an undisturbed soil profile was used to measure fine root production and was compared to the in-growth core method. There was no difference between fine root production estimated by the two methods in three southern taiga sites with contrasting soil conditions and tree species composition in the Central Forest State Biosphere Reserve, Russia. Expressed as annual production over standing biomass, Norway spruce fine root turnover was in the region of 0.10 to 0.24 y-1. The inclusion net technique is suitable for field based assessment of fine root production. There are several advantages over the in-growth core method, due to non-disturbance of the soil profile and its potential for very high rate of replication.

A new frequency-uniform coercive boundary integral equation for acoustic scattering

A new boundary integral operator is introduced for the solution of the soundsoft acoustic scattering problem, i.e., for the exterior problem for the Helmholtz equation with Dirichlet boundary conditions. We prove that this integral operator is coercive in L2(Γ) (where Γ is the surface of the scatterer) for all Lipschitz star-shaped domains. Moreover, the coercivity is uniform in the wavenumber k = ω/c, where ω is the frequency and c is the speed of sound. The new boundary integral operator, which we call the “star-combined” potential operator, is a slight modification of the standard combined potential operator, and is shown to be as easy to implement as the standard one. Additionally, to the authors' knowledge, it is the only second-kind integral operator for which convergence of the Galerkin method in L2(Γ) is proved without smoothness assumptions on Γ except that it is Lipschitz. The coercivity of the star-combined operator implies frequency-explicit error bounds for the Galerkin method for any approximation space. In particular, these error estimates apply to several hybrid asymptoticnumerical methods developed recently that provide robust approximations in the high-frequency case. The proof of coercivity of the star-combined operator critically relies on an identity first introduced by Morawetz and Ludwig in 1968, supplemented further by more recent harmonic analysis techniques for Lipschitz domains.

Modelling and control of Hammerstein system using B-spline approximation and the inverse of De Boor algorithm

In this article a simple and effective controller design is introduced for the Hammerstein systems that are identified based on observational input/output data. The nonlinear static function in the Hammerstein system is modelled using a B-spline neural network. The controller is composed by computing the inverse of the B-spline approximated nonlinear static function, and a linear pole assignment controller. The contribution of this article is the inverse of De Boor algorithm that computes the inverse efficiently. Mathematical analysis is provided to prove the convergence of the proposed algorithm. Numerical examples are utilised to demonstrate the efficacy of the proposed approach.