Programming a Pipelined Image Processor

Real-time computer vision systems often make use of dedicated image processing hardware to perform the pixel-oriented operations typical of early vision. This type of hardware is notoriously difficult to program, limiting the types of experiments that can be performed and posing a serious obstacle to research progress. This paper describes a pair of programming tools that we have developed to simplify the task of building real-time early vision systems using special-purpose hardware. The system allows users to describe computations in terms of coarse-grained dataflow graphs constructed using an interactive graphical tool. At initialization time it compiles these graphs into efficient executable programs for the underlying hardware. The system has been implemented on a popular commercial pipelined image processor. We describe the computational model that the system supports, the facilities it provides for building real-vision applications, and the algorithms used to generate effective execution schedules for the target machine.     

圆锯片综合特性检测系统的硬件设计

圆锯片综合特性检测系统是根据国内外学者的圆锯片适张研究成果和频谱分析、坐标映射的理论,综合计算机技术、传感器技术、信号调理技术和数据采集处理技术来开发的,检测系统软件是Visual C 开发,在Win32环境下运行.整个检测系统操作简便、人机界面友好、具有较强数据管理功能,能在工业现场条件下快速、准确、无损地检测圆锯片适张状态.     

Overcoming opposition and resistance: Differential functions of expertness and attractiveness in career counseling.

Hypothesized that counselor expertness would be effective in overcoming opposition to the content of counseling, whereas counselor attractiveness would be effective in overcoming resistance to the counseling process. Two studies of career counseling were conducted: a laboratory analog with 36 vocationally undecided undergraduates and a field study with 45 high school sophomores taking a career planning course. In both studies, counselor role (expert or attractive) was crossed with Ss' initial level of resistance in a repeated measures design. Pre- and postmeasures of Ss' attitudes toward vocational exploration (the content of counseling) and attitudes toward counseling were used to assess change in opposition and resistance, respectively. A behavioral compliance measure of opposition was added in Study 2. Study 1 supported only the resistance hypothesis. Study 2 supported both the opposition and resistance hypotheses and thus demonstrated the differential functioning of expertness and attractiveness. Implications for interpersonal influence research and for the practice of career counseling are discussed. (22 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Anisotropie embrittlement in high-hardness ESR 4340 steel forgings

ESR 4340 steel forgings tempered to a hardness of HRC 55 exhibit a severe loss of tensile ductility in the short transverse direction which is strain-rate and humidity dependent. The anisotropy is also reflected in blunt-notch Charpy impact energy, but is absent in the sharp-crack fracture toughness. Brittle behavior is associated with regions of smooth intergranular fracture which are aligned with microstructural banding. Scanning Auger microprobe analysis indicates some intergranular segregation of phosphorus and sulfur in these regions. The anisotropic embrittlement is attributed to an interaction of nonequilibrium segregation on solidification with local equilibrium segregation at grain boundaries during austenitizing. This produces defective regions of enhanced intergranular impurity segregation which are oriented during forging. The regions are prone to brittle fracture under impact conditions and abnormal sensitivity to environmental attack during low strain-rate deformation. A relatively sparse distribution of these defects (∼10cm⁻³) accounts for the discrepancy between smooth bar and blunt-notch testsvs sharp-crack tests. Isotropie properties are restored by homogenization treatment. For application of these steels at extreme hardness levels, homogenization treatment is essential.     

Spark环境下基于多维布隆过滤器的星型连接算法

为了适应联机分析处理(OLAP)系统中实时数据高性能分析需求不断提高的需求,提出一种能够适合Spark环境并结合多维Bloom Filter(MDBF)的星型连接算法SMDBFSJ。首先,根据多个维表构建MDBF,利用其占用空间小的特点,广播到所有节点;然后,在本地节点完成事实表过滤操作,事实表不需要在节点间移动数据;最后,过滤后的事实表与维表采用重划分方式进行连接,进而得到最终结果。SMDBFSJ算法避免了事实表数据移动,通过MDBF减小了需要广播的数据量,充分结合了广播连接和重划分连接的优势。实验结果表明了该算法的有效性,在单机和集群环境下,该算法相比重划分连接均获得了3倍左右的性能提升。     

A Computer Algebra Primer and Homework Exercises for use in an Intermediate Macroeconomics Course – A Student/Teacher Collaboration

We discuss using computer algebras systems (CAS) in an undergraduate intermediate macroeconomics class. The criteria used in choosing a CAS are considered. One criterion was that students would bear little or no financial. The lessons learned in implementing a CAS – things that worked well and those that did not work so well – are noted. We also discuss the need for communications with information technology staff for successful implementation. An erratum to this article can be found at     

Prediction of the multimeric assembly of staphylococcal enterotoxin A with cell-surface protein receptors

Staphylococcal enterotoxin A (SEA) cross-links two class II major histocompatibility complex (MHC) molecules and forms a multimeric assembly with T-cell receptors (TcRs). The X-ray crystal structure of SEA has been solved, yet details describing molecular recognition and association remain unclear. We present a structural model for the interactions of SEA with cell-surface proteins. Molecular docking calculations predicting SEA association with the class II MHC molecule HLA-DR1 were performed by using a rigid-body docking method. Docked orientations were evaluated by a Poisson-Boltzmann model for the electrostatic free energy of binding and the hydrophobic effect calculated from molecular surface areas. We found that the best-scoring SEA conformers for the DR1alpha interface display a binding mode similar to that determined crystallographically for staphylococcal enterotoxin B bound to HLA-DR1. For the zinc-binding site of SEA, docking DR1beta yielded several orientations exhibiting tetrahedral-like coordination geometries. Combining the two interfaces, tetramers were modeled by docking an alphabeta TcR with trimolecular complexes DR1beta-SEA-DR1alpha and SEA-betaDR1alpha-SEA. Our results indicate that the complex DR1beta-SEA-DR1alpha provides a more favorable assembly for the engagement of TcRs, forming SEA molecular contacts that are in accord with reported mutagenesis studies. In contrast, the cooperative association of two SEA molecules on a single DR1 molecule sterically inhibits interactions with TcRs. We suggest that signal transduction stimulated by SEA through large-scale assembly is limited to four or five TcR-(DR1beta-SEA-DR1alpha) tetramers and requires the dimerization of class II MHC molecules, while TcR dimerization is unlikely.     

Efficient Pose Clustering Using a Randomized Algorithm

Pose clustering is a method to perform object recognition by determining hypothetical object poses and finding clusters of the poses in the space of legal object positions. An object that appears in an image will yield a large cluster of such poses close to the correct position of the object. If there are m model features and n image features, then there are O(m ³ n ³ ) hypothetical poses that can be determined from minimal information for the case of recognition of three-dimensional objects from feature points in two-dimensional images. Rather than clustering all of these poses, we show that pose clustering can have equivalent performance for this case when examining only O(mn) poses, due to correlation between the poses, if we are given two correct matches between model features and image features. Since we do not usually know two correct matches in advance, this property is used with randomization to decompose the pose clustering problem into O(n ² ) problems, each of which clusters O(mn) poses, for a total complexity of O(mn ³ ) . Further speedup can be achieved through the use of grouping techniques. This method also requires little memory and makes the use of accurate clustering algorithms less costly. We use recursive histograming techniques to perform clustering in time and space that is guaranteed to be linear in the number of poses. Finally, we present results demonstrating the recognition of objects in the presence of noise, clutter, and occlusion.     

Phase Transitions on Fixed Connected Graphs and Random Graphs in the Presence of Noise

In this paper, we study the phase transition behavior emerging from the interactions among multiple agents in the presence of noise. We propose a simple discrete-time model in which a group of non-mobile agents form either a fixed connected graph or a random graph process, and each agent, taking bipolar value either +1 or -1, updates its value according to its previous value and the noisy measurements of the values of the agents connected to it. We present proofs for the occurrence of the following phase transition behavior: At a noise level higher than some threshold, the system generates symmetric behavior (vapor or melt of magnetization) or disagreement; whereas at a noise level lower than the threshold, the system exhibits spontaneous symmetry breaking (solid or magnetization) or consensus. The threshold is found analytically. The phase transition occurs for any dimension. Finally, we demonstrate the phase transition behavior and all analytic results using simulations. This result may be found useful in the study of the collective behavior of complex systems under communication constraints.     

PRACTICAL INCONSISTENCY MANAGEMENT FOR CRITICAL-TASKS DECISION-SUPPORT SYSTEMS

Abstract

In this paper, the problem of logical consistency in critical-tasks decision systems is addressed. It is shown how local search techniques can be used to check the (in)consistency of very large propositional knowledge bases (KBs). Using new heuristic findings. we can now implement efficient forms of diagnostic reasoning in the context of very large ICBs modeling deep models of complex devices and including patterns of default reasoning.