期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
The Study of SMT Product Manufacturing Grid System 被引量:1
1
作者 李春泉 余涛 《上海交通大学学报》 EI CAS CSCD 北大核心 2007年第S2期131-138,共8页
Surface mount technology product manufacturing grid(SMT-MG) is a typical application which grid technology was applied to SMT product manufacturing.In this paper,for SMT-MG system,conception and intension of SMT-MG we... Surface mount technology product manufacturing grid(SMT-MG) is a typical application which grid technology was applied to SMT product manufacturing.In this paper,for SMT-MG system,conception and intension of SMT-MG were analyzed.Then six-layer architecture of SMT-MG was constructed and mesh three-dimensional matrix organization mode of SMT-MG was studied.Operation mechanism of SMT-MG was discussed emphatically which include adaptive evolution mechanism,PUSH/PULL driving mechanism,cooperation game mechanism,feedback,regulation and control mechanism,coordination mechanism and impetus mechanism.The study of SMT-MG must be useful for developing of electronic product manufacturing. 展开更多
关键词 SURFACE MOUNT technology(SMT) MANUFACTURING GRID system design
在线阅读 下载PDF
A Fast Algorithm for Support Vector Clustering
2
作者 吕常魁 姜澄宇 王宁生 《Journal of Southwest Jiaotong University(English Edition)》 2004年第2期136-140,共5页
Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for ... Support Vector Clustering (SVC) is a kernel-based unsupervised learning clustering method. The main drawback of SVC is its high computational complexity in getting the adjacency matrix describing the connectivity for each pairs of points. Based on the proximity graph model [3], the Euclidean distance in Hilbert space is calculated using a Gaussian kernel, which is the right criterion to generate a minimum spanning tree using Kruskal's algorithm. Then the connectivity estimation is lowered by only checking the linkages between the edges that construct the main stem of the MST (Minimum Spanning Tree), in which the non-compatibility degree is originally defined to support the edge selection during linkage estimations. This new approach is experimentally analyzed. The results show that the revised algorithm has a better performance than the proximity graph model with faster speed, optimized clustering quality and strong ability to noise suppression, which makes SVC scalable to large data sets. 展开更多
关键词 Support vector machines Support vector clustering Proximity graph Minimum spanning tree
在线阅读 下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部