On the Consistency of the Normalized Eight-Point Algorithm

A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data (Chojnacki, W., et al. in IEEE Trans. Pattern Anal. Mach. Intell. 25(9):1172–1177, 2003) relies upon adoption of a certain model for statistical data distribution. Under this model, the cost function that underlies the algorithm operating on the normalized data is statistically more advantageous than the cost function that underpins the algorithm using unnormalized data. Here we extend this explanation by introducing a more refined, structured model for data distribution. Under the extended model, the normalized eight-point algorithm turns out to be approximately consistent in a statistical sense. The proposed extension provides a link between the existing statistical rationalization of the normalized eight-point algorithm and the approach of Mühlich and Mester for enhancing total least squares estimation methods via equilibration. The paper forms part of a wider effort to rationalize and interrelate foundational methods in vision parameter estimation.     

Modeling language acquisition in atypical phenotypes.

An increasing number of connectionist models have been proposed to explain behavioral deficits in developmental disorders. These simulations motivate serious consideration of the theoretical implications of the claim that a developmental disorder fits within the parameter space of a particular computational model of normal development. The authors examine these issues in depth with respect to a series of new simulations investigating past-tense formation in Williams syndrome. This syndrome and the past-tense domain are highly relevant because both have been used to make strong theoretical claims about the processes underlying normal language acquisition. The authors conclude that computational models have great potential to advance psychologists' understanding of developmental deficits because they focus on the developmental process itself as a pivotal causal factor in producing atypical phenotypic outcomes. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Impact of Elaboration on Socially Desirable Responding and the Validity of Biodata Measures.

The current study investigated the impact of requiring respondents to elaborate on their answers to a biodata measure on mean scores, the validity of the biodata item composites, subgroup mean differences, and correlations with social desirability. Results of this study indicate that elaborated responses result in scores that are much lower than nonelaborated responses to the same items by an independent sample. Despite the lower mean score on elaborated items, it does not appear that elaboration affects the size of the correlation between social desirability and responses to biodata items or that it affects criterion-related validity or subgroup mean differences in a practically significant way. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Online Calculation and Prediction of the Strip Temperature in a Hot Strip Finishing Mill

The paper deals with a physical model for the calculation of the strip temperature in a hot rolling mill. Beside the heat transfer from the strip to the environment in the different mill sections a sub‐model for the material properties of steel including phase transitions is introduced. For the application in a process automation system an online adaptation of the model to the current state of the mill is indispensable. The adaptation is explained in detail.     

Temporal Specificity of Extinction in Autoshaping.

Three experiments investigated the effects of varying the conditioned stimulus (CS) duration between training and extinction. Ring doves (Streptopelia risoria) were autoshaped on a fixed CS-unconditioned stimulus (US) interval and extinguished with CS presentations that were longer, shorter, or the same as the training duration. During a subsequent test session, the training CS duration was reintroduced. Results suggest that the cessation of responding during an extinction session is controlled by generalization of excitation between the training and extinction CSs and by the number of nonreinforced CS presentations. Transfer of extinction to the training CS is controlled by the similarity between the extinction and training CSs. Extinction learning is temporally specific. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Equivalence of models for polynomial learnability

In this paper we consider several variants of Valiant's learnability model that have appeared in the literature. We give conditions under which these models are equivalent in terms of the polynomially learnable concept classes they define. These equivalences allow comparisons of most of the existing theorems in Valiant-style learnability and show that several simplifying assumptions on polynomial learning algorithms can be made without loss of generality. We also give a useful reduction of learning problems to the problem of finding consistent hypotheses, and give comparisons and equivalences between Valiant's model and the prediction learning models of Haussler, Littlestone, and Warmuth (in “29th Annual IEEE Symposium on Foundations of Computer Science,” 1988).     

Minimum effort factor approach for sensor-based control of a four-joint 6-dof redundant manipulator

A sensor-driven control model and a minimum effort control algorithm in terms of time and energy expended during the execution of a movement strategy are described and validated for a multijointed cooperating robotic manipulator. Considering smooth, human-like (anthropomorphic) movements, using joint motion profiles achievable in real time as well as sensory information from all joints, and evaluating the total work expended by each manipulator joint during the execution of a movement strategy, a minimum effort motion trajectory is synthesized to precisely and efficiently position the robotic arm end-effector. This sensor-based approach significantly reduces the computational requirements for such cooperative motion. The minimum effort control algorithm generates several human-like arm movement strategies and selects the best strategy on the basis of expendable effort. The algorithm has an inherent basis to deal with obstacles in an efficient way. Detailed examples are described from the simulation studies. © 1994 John Wiley & Sons, Inc.     

Chemical mechanical polishing of polymer films

Strategies to reduce capacitance effects associated with shrinking integrated circuit (IC) design rules include incorporating low resistivity metals and insulators with low dielectric values, or “low-κ” materials. Using such materials in current IC fabrication schemes necessitates the development of reliable chemical mechanical polishing (CMP) processes and process consumables tailored for them. Here we present results of CMP experiments performed on FLARE™ 2.0 using a specialized zirconium oxide (ZrO₂) polishing slurry. FLARE™ 2.0 is a poly(arylene) ether from AlliedSignal, Inc. with a nominal dielectric constant of 2.8. In addition, we provide insight into possible removal mechanisms during the CMP of organic polymers by examining the performance of numerous abrasive slurries. Although specific to a limited number of polymers, the authors suggest that the information presented in this paper is relevant to the CMP performance of many polymer dielectric materials.     

Seeking the truth about ad hoc join costs

In this paper, we re-examine the results of prior work on methods for computing ad hoc joins. We develop a detailed cost model for predicting join algorithm performance, and we use the model to develop cost formulas for the major ad hoc join methods found in the relational database literature. We show that various pieces of “common wisdom” about join algorithm performance fail to hold up when analyzed carefully, and we use our detailed cost model to derive op timal buffer allocation schemes for each of the join methods examined here. We show that optimizing their buffer allocations can lead to large performance improvements, e.g., as much as a 400% improvement in some cases. We also validate our cost model's predictions by measuring an actual implementation of each join algorithm considered. The results of this work should be directly useful to implementors of relational query optimizers and query processing systems. Edited by M. Adiba. Received May 1993 / Accepted April 1996