Primate head-free saccade generator implements a desired (post-VOR) eye position command by anticipating intended head motion

Primate head-free saccade generator implements a desired (post-VOR) eye position command by anticipating intended head motion. J. Neurophysiol. 78: 2811-2816, 1997. When we glance between objects, the brain ultimately controls gaze direction in space. However, it is currently unclear how this is allocated into separate commands for eye and head movement. To determine the role of desired final eye position commands, and their coordination with intended head movement, we trained three monkeys to make large gaze shifts while wearing opaque goggles with a monocular 8 degrees aperture. Animals eventually developed a new set of context-dependent eye-head coordination strategies, in particular expanding the head range and compressing the eye-in-head range toward the aperture (while wearing the goggles). However, when we shifted the location of the aperture to a different subsection of the normal head-free oculomotor range (by covering the original aperture and creating a new one), eye-head saccades failed to acquire visual targets, because they continued to drive the eye ultimately toward the now occluded original aperture. Even when a head-stationary saccade acquired the new aperture, subsequent head-free saccades drove the eye eccentrically toward a point that anticipated the intended head movement, such that the subsequent vestibuloocular reflex slow phase brought the eye onto the location of the original aperture. Animals could only acquire the new aperture consistently after several days of retraining. These results suggest that 1) eye-head coordination is achieved by a plastic, context-dependent neural operator that uses information about initial eye/head position and intended movement to compute desired combinations of final eye/head position and 2) acquisition of these positions involves sophisticated anticipatory compensations for subsequent movement components, akin to those observed previously in complex oral and manual behaviors.     

Sequence variants in the pancreatic islet beta-cell inwardly rectifying K+ channel Kir6.2 (Bir) gene: identification and lack of role in Caucasian patients with NIDDM

The septate gregarine parasites of flour beetles (Tribolium spp.) include Gregarina minuta Ishii, 1914, a relatively small species in which both primite and satellite possess an obvious protomerite, and a larger species that lacks the satellite protomerite. The latter species has been placed in the genera Didymophyes and Hirmocystis by various authors, but studies reported here demonstrate that this species, herein described as Gregarina triboliorum, exhibits early pairing and produces oocyst chains, both characteristics of the genus Gregarina. The oocysts of this new species are described for the first time. In addition, experimental infections using oocyst from single gametocysts reveal that oocyst chain number is variable but is typically 1, 2, or 4. Prior experiments involving a related beetle, Tenebrio molitor, demonstrated extreme host specificity within the 4 Gregarina species parasitizing larval and adult hosts. However, G. triboliorum is not limited either stadially or specially, infecting both adults and larvae of Tribolium confusum and Tribolium castaneum.     

An adaptive nonlinear predictor with orthogonal escalator structurefor short-term load forecasting

An adaptive Hammerstein model with an orthogonal escalator structure as well as a lattice structure for joint process is developed for short-term load forecasting from one hour to several hours in the future. The method uses a Hammerstein nonlinear time-varying functional relationship between load and temperature. Parameters in both linear and nonlinear parts of the predictor are updated systematically using a scalar orthogonalization procedure. Matrix operations are avoided, thereby allowing better model-tracking ability, numerical properties, and performance. Prediction results using actual load-temperature data demonstrate that this algorithm performs better than the commonly used matrix-oriented recursive least-squares algorithm for one-hour-ahead forecasts