Convergence analysis of the Newton algorithm and a pseudo-time marching scheme for diffuse correlation tomography

We propose a self-regularized pseudo-time marching scheme to solve the ill-posed, nonlinear inverse problem associated with diffuse propagation of coherent light in a tissuelike object. In particular, in the context of diffuse correlation tomography (DCT), we consider the recovery of mechanical property distributions from partial and noisy boundary measurements of light intensity autocorrelation. We prove the existence of a minimizer for the Newton algorithm after establishing the existence of weak solutions for the forward equation of light amplitude autocorrelation and its Frechet derivative and adjoint. The asymptotic stability of the solution of the ordinary differential equation obtained through the introduction of the pseudo-time is also analyzed. We show that the asymptotic solution obtained through the pseudo-time marching converges to that optimal solution provided the Hessian of the forward equation is positive definite in the neighborhood of optimal solution. The superior noise tolerance and regularization-insensitive nature of pseudo-dynamic strategy are proved through numerical simulations in the context of both DCT and diffuse optical tomography. (C) 2010 Optical Society of America.

Concise review: Humanized models of tumor immunology in the 21st century: Convergence of cancer research and tissue engineering

Despite positive testing in animal studies, more than 80% of novel drug candidates fail to proof their efficacy when tested in humans. This is primarily due to the use of preclinical models that are not able to recapitulate the physiological or pathological processes in humans. Hence, one of the key challenges in the field of translational medicine is to “make the model organism mouse more human.” To get answers to questions that would be prognostic of outcomes in human medicine, the mouse's genome can be altered in order to create a more permissive host that allows the engraftment of human cell systems. It has been shown in the past that these strategies can improve our understanding of tumor immunology. However, the translational benefits of these platforms have still to be proven. In the 21st century, several research groups and consortia around the world take up the challenge to improve our understanding of how to humanize the animal's genetic code, its cells and, based on tissue engineering principles, its extracellular microenvironment, its tissues, or entire organs with the ultimate goal to foster the translation of new therapeutic strategies from bench to bedside. This article provides an overview of the state of the art of humanized models of tumor immunology and highlights future developments in the field such as the application of tissue engineering and regenerative medicine strategies to further enhance humanized murine model systems.

Parametrized actor-critic algorithms for finite-horizon MDPs

Due to their non-stationarity, finite-horizon Markov decision processes (FH-MDPs) have one probability transition matrix per stage. Thus the curse of dimensionality affects FH-MDPs more severely than infinite-horizon MDPs. We propose two parametrized 'actor-critic' algorithms to compute optimal policies for FH-MDPs. Both algorithms use the two-timescale stochastic approximation technique, thus simultaneously performing gradient search in the parametrized policy space (the 'actor') on a slower timescale and learning the policy gradient (the 'critic') via a faster recursion. This is in contrast to methods where critic recursions learn the cost-to-go proper. We show w.p 1 convergence to a set with the necessary condition for constrained optima. The proposed parameterization is for FHMDPs with compact action sets, although certain exceptions can be handled. Further, a third algorithm for stochastic control of stopping time processes is presented. We explain why current policy evaluation methods do not work as critic to the proposed actor recursion. Simulation results from flow-control in communication networks attest to the performance advantages of all three algorithms.

Solving MDPs using two-timescale simulated annealing with multiplicative weights

We develop extensions of the Simulated Annealing with Multiplicative Weights (SAMW) algorithm that proposed a method of solution of Finite-Horizon Markov Decision Processes (FH-MDPs). The extensions developed are in three directions: a) Use of the dynamic programming principle in the policy update step of SAMW b) A two-timescale actor-critic algorithm that uses simulated transitions alone, and c) Extending the algorithm to the infinite-horizon discounted-reward scenario. In particular, a) reduces the storage required from exponential to linear in the number of actions per stage-state pair. On the faster timescale, a 'critic' recursion performs policy evaluation while on the slower timescale an 'actor' recursion performs policy improvement using SAMW. We give a proof outlining convergence w.p. 1 and show experimental results on two settings: semiconductor fabrication and flow control in communication networks.

Solution of MDPS using simulation-based value iteration

This article proposes a three-timescale simulation based algorithm for solution of infinite horizon Markov Decision Processes (MDPs). We assume a finite state space and discounted cost criterion and adopt the value iteration approach. An approximation of the Dynamic Programming operator T is applied to the value function iterates. This 'approximate' operator is implemented using three timescales, the slowest of which updates the value function iterates. On the middle timescale we perform a gradient search over the feasible action set of each state using Simultaneous Perturbation Stochastic Approximation (SPSA) gradient estimates, thus finding the minimizing action in T. On the fastest timescale, the 'critic' estimates, over which the gradient search is performed, are obtained. A sketch of convergence explaining the dynamics of the algorithm using associated ODEs is also presented. Numerical experiments on rate based flow control on a bottleneck node using a continuous-time queueing model are performed using the proposed algorithm. The results obtained are verified against classical value iteration where the feasible set is suitably discretized. Over such a discretized setting, a variant of the algorithm of [12] is compared and the proposed algorithm is found to converge faster.

Effect of boundary condition description on convergence of solution in a boundary-value problem

It is well known that the numerical accuracy of a series solution to a boundary-value problem by the direct method depends on the technique of approximate satisfaction of the boundary conditions and on the stage of truncation of the series. On the other hand, it does not appear to be generally recognized that, when the boundary conditions can be described in alternative equivalent forms, the convergence of the solution is significantly affected by the actual form in which they are stated. The importance of the last aspect is studied for three different techniques of computing the deflections of simply supported regular polygonal plates under uniform pressure. It is also shown that it is sometimes possible to modify the technique of analysis to make the accuracy independent of the description of the boundary conditions.

Convergence correction in colloid scattering

The error introduced in depolarisation measurements due to the convergence of the incident beam has been investigated theoretically as well as experimentally for the case of colloid scattering, where the particles are not small compared to the wavelength of light. Assuming the scattering particles to be anisotropic rods, it is shown that, when the incident unpolarised light is condensed by means of a lens with a circular aperture, the observed depolarisation ratio ϱ u is given by ϱ u = ϱ u0 + 5/3 θ2 where ϱ u0 is the true depolarisation for incident parallel light, and θ the semi-angle of convergence. Appropriate formulae are derived when the incident beam is polarised vertically and horizontally. Experiments performed on six typical colloids support the theoretical conclusions. Other immediate consequences of the theory are also discussed.

Growth and Convergence: The case of China

Growth and Convergence: The Case of China Since the initiation of economic reforms in 1978, China has become one of the world’s fast-growing economies. The rapid growth, however, has not been shared equally across the different regions in China. The prominent feature of substantial differences in incomes and growth rates across the different Chinese regions has attracted the attention of many researchers. This book focuses on issues related to economic growth and convergence across the Chinese regions over the past three decades. The book has eight chapters. Apart from an introduction chapter and a concluding chapter, all the other chapters each deal with some certain aspects of the central issue of regional growth and convergence across China over the past three decades. The whole book is organized as follows. Chapter 1 provides an introduction to the basic issues involved in this book. Chapter 2 tests economic growth and convergence across 31 Chinese provinces during 1981-2005, based on the theoretical framework of the Solow growth model. Chapter 3 investigates the relationship between openness to foreign economic activities, such as foreign trade and foreign direct investment, and the regional economic growth in the case of China during 1981-2005. Chapter 4, based on data of 31 Chinese provinces over the period 1980-2004, presents new evidence on the effects of structural shocks and structural transformation on growth and convergence among the Chinese regions. Chapter 5, by building up an empirical model that takes account of different potential effects of foreign direct investment, focuses on the impacts of foreign direct investment on China’s regional economic performance and growth. Chapter 6 reconsiders the growth and convergence problem of the Chinese regions in an alternative theoretical framework with endogenous saving behavior and capital mobility across regions. Chapter 7, by building up a theoretical model concerning comparative advantage and transaction efficiency, focuses on one of the potential mechanisms through which China achieves its fast economic growth over the past few decades. Chapter 8 concludes the book by summarizing the results from the previous chapters and suggesting directions for further studies.

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Let G - (V, E) be a weighted undirected graph having nonnegative edge weights. An estimate (delta) over cap (u, v) of the actual distance d( u, v) between u, v is an element of V is said to be of stretch t if and only if delta(u, v) <= (delta) over cap (u, v) <= t . delta(u, v). Computing all-pairs small stretch distances efficiently ( both in terms of time and space) is a well-studied problem in graph algorithms. We present a simple, novel, and generic scheme for all-pairs approximate shortest paths. Using this scheme and some new ideas and tools, we design faster algorithms for all-pairs t-stretch distances for a whole range of stretch t, and we also answer an open question posed by Thorup and Zwick in their seminal paper [J. ACM, 52 (2005), pp. 1-24].

Convergence feedback and unstable low frequency oscillations in a simple coupled ocean‐atmosphere model

The role of convergence feedback on the stability of a coupled ocean‐atmosphere system is studied using model III of Hirst (1986). It is shown that the unstable coupled mode found by Hirst is greatly modified by the convergence feedback. If the convergence feedback strength exceeds a critical value, several new unstable intraseasonal modes are also introduced. These modes have very weak dependence on the wave number. These results may explain the behaviour of some coupled models and to some extent provide a mechanism for the observed aperiodicity of the El‐Nino and Southern Oscillation (ENSO) events.

Producing interactivity : Does media convergence promote interactivity and audience participation?

This study investigates the process of producing interactivity in a converged media environment. The study asks whether more media convergence equals more interactivity. The research object is approached through semi-structured interviews of prominent decision makers within the Finnish media. The main focus of the study are the three big ones of the traditional media, radio, television and the printing press, and their ability to adapt to the changing environment. The study develops theoretical models for the analysis of interactive features and convergence. Case-studies are formed from the interview data and they are evaluated against the models. As a result the cases arc plotted and compared on a four-fold table. The cases are Radio Rock, NRJ, Biu Brother, Television Chat, Olivia and Sanoma News. It is found out that the theoretical models can accurately forecast the results of the case studies. The models are also able to distinguish different aspects of both interactivity and convergence so that a case, which at a first glance seems not to be very interactive is in the end found out to receive second highest scores on the analysis. The highest scores are received by Big Brother and Sanoma News. Through the theory and the analysis of the research data it is found out that the concepts of interactivity and convergence arc intimately intertwined and very hard in many cases to separate from each other. Hence the answer to the main question of this study is yes, convergence does promote interactivity and audience participation. The main theoretical background for the analysis of interactivity follows the work of Came Fleeter, Spiro Kiousis and Sally McMillan. Heeler's six-dimensional definition of interactivity is used as the basis for operationalizing interactivity. The actor-network theory is used as the main theoretical framework to analyze convergence. The definition and operationalization of the actor-network theory into a model of convergence follows the work of Michel Callon. Bruno Latour and especially John Law and Felix Stalder.

Accretion of Chaplygin gas upon black holes: formation of faster outflowing winds

We study the accretion of modified Chaplygin gas upon different types of black holes. Modified Chaplygin gas is one of the best candidates for a combined model of dark matter and dark energy. In addition, from a field theoretical point of view the modified Chaplygin gas model is equivalent to that of a scalar field having a self-interacting potential. We formulate the equations related to both spherical accretion and disc accretion, and respective winds. The corresponding numerical solutions of the flow, particularly of velocity, are presented and analysed. We show that the accretion-wind system of modified Chaplygin gas dramatically alters the wind solutions, producing faster winds, upon changes in physical parameters, while accretion solutions qualitatively remain unaffected. This implies that modified Chaplygin gas is more prone to produce outflow which is the natural consequence of the dark energy into the system.

Transverse plane wave analysis of short elliptical chamber mufflers: An analytical approach

Short elliptical chamber mufflers are used often in the modern day automotive exhaust systems. The acoustic analysis of such short chamber mufflers is facilitated by considering a transverse plane wave propagation model along the major axis up to the low frequency limit. The one dimensional differential equation governing the transverse plane wave propagation in such short chambers is solved using the segmentation approaches which are inherently numerical schemes, wherein the transfer matrix relating the upstream state variables to the downstream variables is obtained. Analytical solution of the transverse plane wave model used to analyze such short chambers has not been reported in the literature so far. This present work is thus an attempt to fill up this lacuna, whereby Frobenius solution of the differential equation governing the transverse plane wave propagation is obtained. By taking a sufficient number of terms of the infinite series, an approximate analytical solution so obtained shows good convergence up to about 1300 Hz and also covers most of the range of muffler dimensions used in practice. The transmission loss (TL) performance of the muffler configurations computed by this analytical approach agrees excellently with that computed by the Matrizant approach used earlier by the authors, thereby offering a faster and more elegant alternate method to analyze short elliptical muffler configurations. (C) 2010 Elsevier Ltd. All rights reserved.

Convergence of Power Control in a Random Channel Environment

In this paper, we study the Foschini Miljanic algorithm, which was originally proposed in a static channel environment. We investigate the algorithm in a random channel environment, study its convergence properties and apply the Gerschgorin theorem to derive sufficient conditions for the convergence of the algorithm. We apply the Foschini and Miljanic algorithm to cellular networks and derive sufficient conditions for the convergence of the algorithm in distribution and validate the results with simulations. In cellular networks, the conditions which ensure convergence in distribution can be easily verified.