The development of convergence and accommodation

Aim: To review current literature on the development of convergence and accommodation. The accommodation and vergence systems provide the foundation upon which bifoveal binocular single vision develops. Deviations from their normal development not only are implicated in the aetiology of convergence anomalies, accommodative anomalies and strabismus, but may also be implicated in failure of the emmetropisation process. Method: This review considers the problems of researching the development of accommodation and vergence in infants and how infant research has had to differ from adult methods. It then reviews and discusses the implications of current research into the development of both systems and their linkages. Results: Vergence and accommodation develop rapidly in the first months of life, with accommodation changing from relatively fixed myopic focus in the neonatal period to adult-like responses by 4 months of age. Vergence develops gradually and becomes more accurate after 4 months of age, but has been demonstrated in infants well before the age that binocular disparity detection mechanisms are thought to develop. Hypotheses for this early vergence mechanism are discussed. The relationship between accommodation and vergence shows much more variability in infants than adult literature has found, but this apparent adult/infant difference may be partly attributed to methodological differences rather than maturational change alone. Conclusions: Variability and flexibility characterise infant responses. This variability may enable infants to develop a flexible and robust binocular system for later life. Studies of infant visual cue use may give clues to the aetiology of strabismus and refractive error.

Minimum stable convergence criteria for stochastic diffusion search

An analysis of Stochastic Diffusion Search (SDS), a novel and efficient optimisation and search algorithm, is presented, resulting in a derivation of the minimum acceptable match resulting in a stable convergence within a noisy search space. The applicability of SDS can therefore be assessed for a given problem.

Algorithmic statistical analysis of electrophysiological data for the investigation of structure-activity relationship in single neurons

We are developing computational tools supporting the detailed analysis of the dependence of neural electrophysiological response on dendritic morphology. We approach this problem by combining simulations of faithful models of neurons (experimental real life morphological data with known models of channel kinetics) with algorithmic extraction of morphological and physiological parameters and statistical analysis. In this paper, we present the novel method for an automatic recognition of spike trains in voltage traces, which eliminates the need for human intervention. This enables classification of waveforms with consistent criteria across all the analyzed traces and so it amounts to reduction of the noise in the data. This method allows for an automatic extraction of relevant physiological parameters necessary for further statistical analysis. In order to illustrate the usefulness of this procedure to analyze voltage traces, we characterized the influence of the somatic current injection level on several electrophysiological parameters in a set of modeled neurons. This application suggests that such an algorithmic processing of physiological data extracts parameters in a suitable form for further investigation of structure-activity relationship in single neurons.

Convergence analysis of stochastic diffusion search

In this paper we present a connectionist searching technique - the Stochastic Diffusion Search (SDS), capable of rapidly locating a specified pattern in a noisy search space. In operation SDS finds the position of the pre-specified pattern or if it does not exist - its best instantiation in the search space. This is achieved via parallel exploration of the whole search space by an ensemble of agents searching in a competitive cooperative manner. We prove mathematically the convergence of stochastic diffusion search. SDS converges to a statistical equilibrium when it locates the best instantiation of the object in the search space. Experiments presented in this paper indicate the high robustness of SDS and show good scalability with problem size. The convergence characteristic of SDS makes it a fully adaptive algorithm and suggests applications in dynamically changing environments.

Convergence analysis of chip- and fractionally spaced LMS adaptive multiuser CDMA detectors

This paper analyzes the convergence behavior of the least mean square (LMS) filter when used in an adaptive code division multiple access (CDMA) detector consisting of a tapped delay line with adjustable tap weights. The sampling rate may be equal to or higher than the chip rate, and these correspond to chip-spaced (CS) and fractionally spaced (FS) detection, respectively. It is shown that CS and FS detectors with the same time-span exhibit identical convergence behavior if the baseband received signal is strictly bandlimited to half the chip rate. Even in the practical case when this condition is not met, deviations from this observation are imperceptible unless the initial tap-weight vector gives an extremely large mean squared error (MSE). This phenomenon is carefully explained with reference to the eigenvalues of the correlation matrix when the input signal is not perfectly bandlimited. The inadequacy of the eigenvalue spread of the tap-input correlation matrix as an indicator of the transient behavior and the influence of the initial tap weight vector on convergence speed are highlighted. Specifically, a initialization within the signal subspace or to the origin leads to very much faster convergence compared with initialization in the a noise subspace.