Algorithm for finding all k nearest neighbors

A very simple algorithm for computing all k nearest neighbors in 2-D is presented. The method does not rely on complicated forms of tessellation, it only requires simple data binning for fast range searching. Its applications range from scattered data interpolation to reverse engineering.     

Scaffolded writing and rewriting in the discipline: A web-based reciprocal peer review system

This paper describes how SWoRD (scaffolded writing and rewriting in the discipline), a web-based reciprocal peer review system, supports writing practice, particularly for large content courses in which writing is considered critical but not feasibly included. To help students gain content knowledge as well as writing and reviewing skills, SWoRD supports the whole cycle of writing, reviews, back-reviews, and rewriting by scaffolding the journal publication process as its authentic practice model. In addition, SWoRD includes algorithms that compute individual reviewer’s review accuracy, which is in turn used to support the various drawbacks of reciprocal peer reviews (e.g., variation in motivation or ability of reviewers). Finally, this paper describes an empirical evaluation showing that the SWoRD approach is effective in improving writing quality in content classes.     

Expert performance: Its structure and acquisition.

Counter to the common belief that expert performance reflects innate abilities and capacities, recent research in different domains of expertise has shown that expert performance is predominantly mediated by acquired complex skills and physiological adaptations. For elite performers, supervised practice starts at very young ages and is maintained at high daily levels for more than a decade. The effects of extended deliberate practice are more far-reaching than is commonly believed. Performers can acquire skills that circumvent basic limits on working memory capacity and sequential processing. Deliberate practice can also lead to anatomical changes resulting from adaptations to intense physical activity. The study of expert performance has important implications for our understanding of the structure and limits of human adaptation and optimal learning. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Memory knowledge and memory monitoring in adulthood.

Age differences in 2 specific processing dimensions of metamemory, namely memory knowledge and memory monitoring, were examined. Young and old Ss recalled lists of words paired with letter, rhyme, and meaning cues over 2 trials. On both trials, Ss made predictions of recall likelihood on presentation of each word-cue pair. No age differences in initial predictions (i.e., prior memory knowledge) were apparent, whereas age-based performance differences were observed. On Trial 2, both young and old Ss significantly revised their predictions; however, old adults monitored only global discrepancies between previous expectation and performance. Young adults raised and lowered expectations across cue types in accordance with their previous performance. Age differences in processing speed accounted for some but not all of the memory-monitoring differences. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Infants' predictive reaching for moving objects in the dark.

Infants were presented with a moving object under 2 lighting conditions to investigate the role of vision in early reaching. The motion of the target object also allowed for an analysis of the infants' ability to use a predictive style of reaching. Infants were tested twice, at 5 and 7.5 months of age, with a moving object in the light and the same object painted with luminescent paint in the dark. Infants successfully contacted the glowing object on about half of their attempts at both ages, although 7.5 month-olds reached more often. Infants also took into account the motion of the target object by aiming their reaches ahead of the object and by reaching with their contralateral hand. These results suggest that proprioceptive feedback and sight of the target allow for successful reaching with limited visual information, even in relatively complex reaching tasks. The infants' success also demonstrates their ability to adapt their movements and reaching strategy to the speed and trajectory of the target object in order to reach predictively. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Empirical efficiency and volume relationships for HPGe detectors

We have extended the empirical work of Vano et al.[1] relating the slope of the detector efficiency curve to the active volume for Ge detectors. The analysis was carried out using Monte Carlo techniques and covered a wide range of incident energies (200 keV-20 MeV) and active volumes (19.6 cm³–396 cm³). It is shown that the expression of Vano et al.[1] is only valid over the energy range 200 keV-3 MeV for active volumes <50 cm³. The upper bound decreases to 2 MeV for volumes of a few hundred cm³. The usable energy range can, however, be extended to 6 MeV by introducing higher order terms into the polynomial. Above this energy, the shape of the efficiency curve is better described by a non-linear function since linear forms fail simultaneously to fit large active volumes and high energies. We therefore propose a composite function which reduces to the form given in Vano et al. in the low energy/active volume limit. By comparison with the Monte Carlo results, it is estimated that relative efficiencies can be calculated to within 6% over the energy range 200 keV-20 MeV and active volumes 20 cm³–400 cm³. Since the largest errors occur for the smallest volumes, we recommend that for energies <3 MeV a two-fold approach be followed, i.e. using the expression of Vano et al.[1] for active volumes less than 50 cm³ and the proposed non-linear form for larger volumes. For high energy work (E > 3 MeV), we advocate the non-linear form. In this way, average errors can be kept 3%. Finally, we point out that the real power of the expression of Vano et al. lies not in predicting efficiencies, but active volumes.     

A parametric interpolator with confined chord errors, acceleration and deceleration for NC machining

Parametric interpolation has many advantages over linear interpolation in machining curves. Real time parametric interpolation research so far has addressed achieving a uniform feed rate, confined chord errors and jerk limited trajectory planning. However, simultaneous consideration of confined chord errors that respect the acceleration and deceleration capabilities of the machine has not been attempted. In this paper, the offline detection of feed rate sensitive corners is proposed. The velocity profile in these zones is planned so that chord errors are satisfied while simultaneously accommodating the machine's acceleration and deceleration limits. Outside the zone of the feed rate sensitive corners, the feed rate is planned using the Taylor approximation. Simulation results indicate that the offline detection of feed rate sensitive corners improves parametric interpolation. For real time interpolation, the parametric curve information can be augmented with the detected feed rate sensitive corners that are stored in 2×2 matrices.     

Determination of optimal feedback terminal controllers for general boundary conditions using generating functions

Given a nonlinear system and a performance index to be minimized, we present a general approach to expressing the finite time optimal feedback control law applicable to different types of boundary conditions. Starting from the necessary conditions for optimality represented by a Hamiltonian system, we solve the Hamilton-Jacobi equation for a generating function for a specific canonical transformation. This enables us to obtain the optimal feedback control for fundamentally different sets of boundary conditions only using a series of algebraic manipulations and partial differentiations. Furthermore, the proposed approach reveals an insight that the optimal cost functions for a given dynamical system can be decomposed into a single generating function that is only a function of the dynamics plus a term representing the boundary conditions. This result is formalized as a theorem. The whole procedure provides an advantage over methods rooted in dynamic programming, which require one to solve the Hamilton-Jacobi-Bellman equation repetitively for each type of boundary condition. The cost of this favorable versatility is doubling the dimension of the partial differential equation to be solved.