Target spatial frequency determines the response to conflicting defocus- and convergence-driven accommodative stimuli

Asthenopia, or visual fatigue, is a frequent complaint from observers of stereoscopic three-dimensional displays. It has been proposed that asthenopia is a consequence of anomalous oculomotor responses generated by conflict between accommodative and convergence stimuli. The hypothesis was examined by measuring accommodation and convergence continuously with a Shin-Nippon SRW5000 infrared autorefractor and a limbus tracking device. Subjects viewed a high contrast Maltese Cross target at three levels of Gaussian filter target blur under conditions of relatively low- and high-conflict between accommodation and convergence stimuli, the latter inducing the sensation of stereopsis. Under the low-conflict conditions accommodation was stable, but convergence-driven accommodation was dominant when the target was extremely blurred. Under the high-conflict conditions the role of convergence-driven accommodation increased systematically with the degree of target blur. It is proposed that defocus-driven accommodation becomes weak when the target comprises low spatial frequency components. Large accommodative overshoots to step stimuli that are not blurred or only mildly blurred were consistently observed and are attributed to the initial accommodative response being convergence-driven. Whereas the possibility that high-conflict conditions are a cause of asthenopia has been previously reported, this is the first evidence that they specifically affect accommodative responses while viewing stereoscopic displays. © 2005 Elsevier Ltd. All rights reserved.

Classical and technological convergence:beyond the Solow-Swann model

Recent investigations into cross-country convergence follow Mankiw, Romer, and Weil (1992) in using a log-linear approximation to the Swan-Solow growth model to specify regressions. These studies tend to assume a common and exogenous technology. In contrast, the technology catch-up literature endogenises the growth of technology. The use of capital stock data renders the approximations and over-identification of the Mankiw model unnecessary and enables us, using dynamic panel estimation, to estimate the separate contributions of diminishing returns and technology transfer to the rate of conditional convergence. We find that both effects are important.

A Statistical Convergence Aplication for the Hopfield Networks

When Recurrent Neural Networks (RNN) are going to be used as Pattern Recognition systems, the problem to be considered is how to impose prescribed prototype vectors ξ^1,ξ^2,...,ξ^p as fixed points. The synaptic matrix W should be interpreted as a sort of sign correlation matrix of the prototypes, In the classical approach. The weak point in this approach, comes from the fact that it does not have the appropriate tools to deal efficiently with the correlation between the state vectors and the prototype vectors The capacity of the net is very poor because one can only know if one given vector is adequately correlated with the prototypes or not and we are not able to know what its exact correlation degree. The interest of our approach lies precisely in the fact that it provides these tools. In this paper, a geometrical vision of the dynamic of states is explained. A fixed point is viewed as a point in the Euclidean plane R2. The retrieving procedure is analyzed trough statistical frequency distribution of the prototypes. The capacity of the net is improved and the spurious states are reduced. In order to clarify and corroborate the theoretical results, together with the formal theory, an application is presented

A Note on the “Constructing” of Nonstationary Methods for Solving Nonlinear Equations with Raised Speed of Convergence

This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.

Topological Dichotomy and Unconditional Convergence

In this paper, we give a criterion for unconditional convergence with respect to some summability methods, dealing with the topological size of the set of choices of sign providing convergence. We obtain similar results for boundedness. In particular, quasi-sure unconditional convergence implies unconditional convergence.

Uniform Convergence of the Newton Method for Aubin Continuous Maps

* This work was supported by National Science Foundation grant DMS 9404431.

On the Uniform Convergence of Partial Dunkl Integrals in Besov-Dunkl Spaces

2000 Mathematics Subject Classification: 44A15, 44A35, 46E30

Theorems on the Convergence of Series in Generalized Lommel-Wright Functions

Mathematics Subject Classification: 30B10, 30B30; 33C10, 33C20

On The Critical Points of some Iteration Methods for Solving Algebraic Equations. Global Convergence Properties

In this work we give su±cient conditions for k-th approximations of the polynomial roots of f(x) when the Maehly{Aberth{Ehrlich, Werner-Borsch-Supan, Tanabe, Improved Borsch-Supan iteration methods fail on the next step. For these methods all non-attractive sets are found. This is a subsequent improvement of previously developed techniques and known facts. The users of these methods can use the results presented here for software implementation in Distributed Applications and Simulation Environ- ments. Numerical examples with graphics are shown.

Quasi-Monte Carlo Methods for some Linear Algebra Problems. Convergence and Complexity

We present quasi-Monte Carlo analogs of Monte Carlo methods for some linear algebra problems: solving systems of linear equations, computing extreme eigenvalues, and matrix inversion. Reformulating the problems as solving integral equations with a special kernels and domains permits us to analyze the quasi-Monte Carlo methods with bounds from numerical integration. Standard Monte Carlo methods for integration provide a convergence rate of O(N^(−1/2)) using N samples. Quasi-Monte Carlo methods use quasirandom sequences with the resulting convergence rate for numerical integration as good as O((logN)^k)N^(−1)). We have shown theoretically and through numerical tests that the use of quasirandom sequences improves both the magnitude of the error and the convergence rate of the considered Monte Carlo methods. We also analyze the complexity of considered quasi-Monte Carlo algorithms and compare them to the complexity of the analogous Monte Carlo and deterministic algorithms.

Acceleration of Convergence in Dontchev’s Iterative Method for Solving Variational Inclusions

2000 Mathematics Subject Classification: 47H04, 65K10.

On the Convergence of (0,1,2) Interpolation

2000 Mathematics Subject Classification: 41A05.