Efficient architectures for sparsely-connected high capacity associative memory models

In physical implementations of associative memory, wiring costs play a significant role in shaping patterns of connectivity. In this study of sparsely-connected associative memory, a range of architectures is explored in search of optimal connection strategies that maximize pattern-completion performance, while at the same time minimizing wiring costs. It is found that architectures in which the probability of connection between any two nodes is based on relatively tight Gaussian and exponential distributions perform well and that for optimum performance, the width of the Gaussian distribution should be made proportional to the number of connections per node. It is also established from a study of other connection strategies that distal connections are not necessary for good pattern-completion performance. Convergence times and network scalability are also addressed in this study.     

连通图临界度定义的注记

本文递归地定义了连通图的临界度,并证明了几个定理,揭示了连通图临界度的特殊性质,说明所给出的递归定义与常规定义之间的关系.     

Interhemispheric connectivity and executive functioning in adults with Tourette syndrome.

The prefrontal cortex (PFC) is relatively smaller, and the corpus callosum (CC) larger, in adults with Tourette syndrome (TS). The authors explored the possible roles of the PFC and the CC in mediating interhemispheric interference and coordination in TS adults. They measured performance on M. Kinsbourne and J. Cook's (1971) verbal-manual interference task and on the bimanual Purdue Pegboard in 38 adults with TS and 34 healthy adults. Compared with controls, TS subjects were impaired on the bimanual Purdue Pegboard. On the dual task, right-hand performance did not differ between groups, but the normally expected left-hand advantage (opposite hemisphere condition) was absent in TS subjects. In the control group only, better left-hand performance accompanied larger PFC volumes but not CC cross-sectional area. PFC dysfunction might have precluded executive control of interference in the TS group. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Detecting the wheel pattern of a vehicle using stereo images

This paper presents a method for detecting the wheels of a vehicle in stereo image pairs. The method consists of two steps: (i) geometrical transformation; and (ii) circle extraction. The geometrical transformation uses the disparity values obtained from a stereo image pair to calculate the parameters of the plane containing wheels of the vehicle. By using these parameters, we transform any elliptical wheels contained in the plane to circular ones which can be extracted by the circle extraction algorithm. The circle extraction algorithm consists of (1) template matching and (2) Hough transform. In order to save computation and improve the results in the Hough transform, we employ two constraints (a) the neighbor-region edge connectivity and (b) the gradient direction of each edge point, to eliminate non-circular edge points. Experimental results show that these two constraints do eliminate non-circular edge points and preserve any circle embedded in edges. From the final results, we can observe that our method can detect and locate the wheels of a vehicle successfully.     

用多元回归方法模拟烷烃的碳－13化学位移

用多元回归方法对５９个直链或支链烷烃化合物进行碳－１３ＮＭＲ波谱模拟。在这个实验中提取一分子连接性指数和几何参数，取得了很好的效果。     

Digital connectedness: An algebraic approach

Let E be the incidence matrix of a graph G having m nodes; then the number of connected components of G is equal to m ? r, where r is the rank of E. In particular, if G represents an adjacency relation between points in a digital picture (or higher-dimensional array), this shows that the connected components of points can be counted by computing the rank of E. Two proofs of this result are given, one based on results from algebraic topology and the other based on a self-contained graph-theoretic argument. The former proof can be generalized to yield a method of counting holes.     

Definition and Application of Topological Index Based on Bond Connectivity

1　IntroductionSincethevalenceconnectivitytopologicalindexδvbasedonpeakatomswasputforwardbyRandic Kier[1] ,ithasbeengreatlyimprovedandwidelyusedinchemistry ,biology ,environmentalsciences ,pharmacology ,andsoon[2 -6] .Butitwasbasedonpeakatomstoconstructthemodel,lessconsiderationwasgiventotheconnectivityofatoms.Therefore ,thistopologicalindexisdifficulttobeappliedtoanorganicsysteminvolvingunsaturatedbondandhetero atom .Theoptimalmolecularconnectivitytopo logicalindexmustconsiderboththepeakato…     

Linear time algorithm for finding a picture''s connected components

An algorithm that identifies the connnected components of a thresholded digitized picture is presented. The time complexity of the algorithm is linear in the number of runs of object pixels in the picture.