876 resultados para Almost Convergence
Resumo:
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.
Resumo:
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.
Resumo:
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
Resumo:
Information extraction or knowledge discovery from large data sets should be linked to data aggregation process. Data aggregation process can result in a new data representation with decreased number of objects of a given set. A deterministic approach to separable data aggregation means a lesser number of objects without mixing of objects from different categories. A statistical approach is less restrictive and allows for almost separable data aggregation with a low level of mixing of objects from different categories. Layers of formal neurons can be designed for the purpose of data aggregation both in the case of deterministic and statistical approach. The proposed designing method is based on minimization of the of the convex and piecewise linear (CPL) criterion functions.
Resumo:
This paper is partially supported by project ISM-4 of Department for Scientific Research, “Paisii Hilendarski” University of Plovdiv.
Resumo:
A boundary-value problems for almost nonlinear singularly perturbed systems of ordinary differential equations are considered. An asymptotic solution is constructed under some assumption and using boundary functions and generalized inverse matrix and projectors.
Resumo:
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.
Resumo:
*This research was supported by the National Science Foundation Grant DMS 0200187 and by ONR Grant N00014-96-1-1003
Resumo:
The general iteration method for nonexpansive mappings on a Banach space is considered. Under some assumption of fast enough convergence on the sequence of (“almost” nonexpansive) perturbed iteration mappings, if the basic method is τ−convergent for a suitable topology τ weaker than the norm topology, then the perturbed method is also τ−convergent. Application is presented to the gradient-prox method for monotone inclusions in Hilbert spaces.
Resumo:
* This work was supported by National Science Foundation grant DMS 9404431.
Resumo:
Mathematics Subject Classification: Primary 47A60, 47D06.
Resumo:
2000 Mathematics Subject Classification: 44A15, 44A35, 46E30
Resumo:
Mathematics Subject Classification: 30B10, 30B30; 33C10, 33C20