A VLSI architecture for a half-edge-based corner detector

Corner detection is a low-level feature detection operator that is of great use in image processing applications, for example, optical flow and structure from motion by image correspondence. The detection of corners is a computationally intensive operation. Past implementations of corner detection techniques have been restricted to software. In this paper we propose an efficient very large-scale integration (VLSI) architecture for detection of corners in images. The corner detection technique is based on the half-edge concept and the first directional derivative of Gaussian. Apart from the location of the corner points, the algorithm also computes the corner orientation and the corner angle and outputs the edge map of the image. The symmetrical properties of the masks are utilized to reduce the number of convolutions effectively, from eight to two. Therefore, the number of multiplications required per pixel is reduced from 1800 to 392. Thus, the proposed architecture yields a speed-up factor of 4.6 over conventional convolution architectures. The architecture uses the principles of pipelining and parallelism and can be implemented in VLSI.     

On the learning control of a robot manipulator

This paper derives a learning control law to achieve trajectory following for a robot manipulator. The controller consists of two parts, a computed torque servo for the rigid body terms that can be modelled and a learning law for the unmodelled dynamics. An advantage of this method is that bounds can be assigned to the position and velocity tracking errors.     

Learning to Predict Non-Deterministically Generated Strings

In this article we present an algorithm that learns to predict non-deterministically generated strings. The problem of learning to predict non-deterministically generated strings was raised by Dietterich and Michalski (1986). While their objective was to give heuristic techniques that could be used to rapidly and effectively learn to predict a somewhat limited class of strings, our objective is to give an algorithm which, though impractical, is capable of learning to predict a very general class. Our algorithm is meant to provide a general framework within which heuristic techniques can be effectively employed.     

Extending boosting for large scale spoken language understanding

We propose three methods for extending the Boosting family of classifiers motivated by the real-life problems we have encountered. First, we propose a semisupervised learning method for exploiting the unlabeled data in Boosting. We then present a novel classification model adaptation method. The goal of adaptation is optimizing an existing model for a new target application, which is similar to the previous one but may have different classes or class distributions. Finally, we present an efficient and effective cost-sensitive classification method that extends Boosting to allow for weighted classes. We evaluated these methods for call classification in the AT&;T VoiceTone^® spoken language understanding system. Our results indicate that it is possible to obtain the same classification performance by using 30% less labeled data when the unlabeled data is utilized through semisupervised learning. Using model adaptation we can achieve the same classification accuracy using less than half of the labeled data from the new application. Finally, we present significant improvements in the “important” (i.e., higher weighted) classes without a significant loss in overall performance using the proposed cost-sensitive classification method.     

Age of acquisition: Its neural and computational mechanisms.

The acquisition of new skills over a life span is a remarkable human ability. This ability, however, is constrained by age of acquisition (AoA); that is, the age at which learning occurs significantly affects the outcome. This is most clearly reflected in domains such as language, music, and athletics. This article provides a perspective on the neural and computational mechanisms underlying AoA in language acquisition. The authors show how AoA modulates both monolingual lexical processing and bilingual language acquisition. They consider the conditions under which syntactic processing and semantic processing may be differentially sensitive to AoA effects in second-language acquisition. The authors conclude that AoA effects are pervasive and that the neural and computational mechanisms underlying learning and sensorimotor integration provide a general account of these effects. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

缝纫设备输送动力装置的分析

文章介绍了几种缝纫设备输送动力装置的送布原理，认为应针对不同的面料特性及经制工艺要求，选用合适的设备输送系统。     

圆盘锯机性能提升途径

圆盘锯机在线材厂投入使用时不能满足生产的需要：锯切周期太长，锯片使用性能差，经过对设备进行技术改造和对设备操作规程进行优化，以及在操作上加强管理，使之关键指标大幅度提升，为圆盘锯机的使用改善提供了新的思路。     

David W. Johnson: Award for Distinguished Contributions of Applications of Psychology to Education and Training.

Provides the biography of David W. Johnson and announces that he has won the Award for Distinguished Contributions of Applications of Psychology to Education and Training for programmatic research, comprehensive research reviews, and revision of theory over four decades of persistence that have provided the knowledge foundation for cooperative learning, constructive controversy, conflict resolution, and peer mediation training. A selected bibliography is also provided. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

小提花横机常见选针出故障的原因及处理方法

介绍了选针片式小提花横机常见选针故障的各种原因，并对不同原因导致的选针故障提出了针对性解决方法。     

Revising threshold functions

A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in terms of the resource one is interested in) is polynomial in the syntactic distance between the initial and the target concept, but only polylogarithmic in the number of variables in the universe. We give an efficient revision algorithm in the model of learning with equivalence and membership queries for threshold functions, and some negative results showing, for instance, that threshold functions cannot be revised efficiently from either type of query alone. The algorithms work in a general revision model where both deletion and addition type revision operators are allowed.