A Polynomial Algorithm for Computing Elementary Siphons in a Class of Petri Nets

A set of elementary siphons plays a key role in the development of deadlock prevention policies for automated manufacturing systems. This paper addresses the computation problem for elementary siphons in a subclass of Petri nets which are basic systems of simple sequential processes with resources (BS³PR) and can model many automated manufacturing systems. An algorithm for enumerating elementary siphons is established by the one‐to‐one relationship between maximal perfect resource‐transition circuits (MPCs) and strict minimal siphons. A set of MPCs is first computed, followed by a set of elementary siphons in a BS³PR. The presented algorithm is proved to have polynomial‐time complexity. An example is used to illustrate the algorithm.     

Group technology based adaptive cell formation using predator-prey genetic algorithm

In recent years, there has been a considerable growth of application of group technology in cellular manufacturing. This has led to investigation of the primary cell formation problem (CFP), both in classical and soft-computing domain. Compared to more well-known and analytical techniques like mathematical programming which have been used rigorously to solve CFPs, heuristic approaches have yet gained the same level of acceptance. In the last decade we have seen some fruitful attempts to use evolutionary techniques like genetic algorithm (GA) and Ant Colony Optimization to find solutions of the CFP. The primary aim of this study is to investigate the applicability of a fine grain variant of the predator-prey GA (PPGA) in CFPs. The algorithm has been adapted to emphasize local selection strategy and to maintain a reasonable balance between prey and predator population, while avoiding premature convergence. The results show that the algorithm is competitive in identifying machine-part clusters from the initial CFP matrix with significantly less number of iterations. The algorithm scaled efficiently for large size problems with competitive performance. Optimal cluster identification is then followed by removal of the bottleneck elements to give a final solution with minimum inter-cluster transition cost. The results give considerable impetus to study similar NP-complete combinatorial problems using fine-grain GAs in future.     

火车车轮成形新工艺的开发研究

在比较分析技术先进国家的火车车轮成形工艺流程后，采用试验研究和数值模拟相结合方法，研究开发出优化的新工艺。钢坯先在一台水压机上预成形制坯，再在另一台压机上模锻，经轧制扩径后冲孔压弯。这样的生产线效益最好     

电机智能制造发展现状及推进策略

随着电机制造要求逐步提高、自动化逐渐普及,智能制造将成为未来主流的生产制造模式。基于对传统电机制造现状和发展趋势的分析,厘清智能制造优势及智能制造推进误区,概括智能制造推进内容及策略。以江苏大中电机股份有限公司相关项目为例,介绍智能制造的侧重内容、实施步骤、原则及实施成果。结果表明：总体生产效率提高了35.75%,生产运营成本降低了26.21%,产品不良率降低了75.84%。在此基础上概括电机行业智能制造推进参考战略,为中小型电机行业发展提供支持。     

Graph-Based Dimensionality Reduction for Hyperspectral Imagery: A Review

Hyperspectral image(HSI) contains a wealth of spectral information, which makes fine classification of ground objects possible. In the meanwhile, overly redundant information in HSI brings many challenges. Specifically, the lack of training samples and the high computational cost are the inevitable obstacles in the design of classifier. In order to solve these problems, dimensionality reduction is usually adopted. Recently, graph-based dimensionality reduction has become a hot topic. In this paper, the graph-based methods for HSI dimensionality reduction are summarized from the following aspects. 1) The traditional graph-based methods employ Euclidean distance to explore the local information of samples in spectral feature space. 2) The dimensionality-reduction methods based on sparse or collaborative representation regard the sparse or collaborative coefficients as graph weights to effectively reduce reconstruction errors and represent most important information of HSI in the dictionary. 3) Improved methods based on sparse or collaborative graph have made great progress by considering global low-rank information, local intra-class information and spatial information. In order to compare typical techniques, three real HSI datasets were used to carry out relevant experiments, and then the experimental results were analysed and discussed.Finally, the future development of this research field is prospected.     

基于BC聚类的差分隐私保护推荐算法

为提高差分隐私保护下推荐算法的准确性,提出了一种考虑差分隐私保护的基于Bhattacharyya系数（BC）的聚类推荐算法.以BC作为项目相似性度量的标准,根据BC相似性对项目进行K-medoids聚类,并在聚类簇中进行私有项目邻居选择.最后,根据最近邻居集信息,对用户的评分进行预测和Top-n推荐.提出的方案有效地克服了已有方法中存在的相似性度量依赖于共同评分的问题,提高了相似性度量的准确性,有效避免了因隐私保护而造成的最近邻居集质量下降的问题.理论分析和实验测试的结果表明,该方法在实现隐私保护的同时还能有效保证推荐的高质量,较好地实现了隐私保护和数据效用之间的平衡,具有良好的应用潜力.     

模具敏捷制造系统研究

针对模具设计制造过程复杂、条件苛刻和单件或小批量生产的特点 ,论述了模具产业发展敏捷制造技术的必要性。提出了模具敏捷制造系统框架和基于STEP与特征技术实现信息集成与过程集成的运行机制。阐述了基于Internet/Intranet的开放式可视化协同工作平台的模具敏捷制造实施方案。     

基于多代理的制造执行系统的研究

制造执行系统作为连接计划管理系统（ERP/MRPⅡ）和生产控制系统的桥梁与纽带，对车间层生产调度的优化，生产过程的改进等方面起了重要的作用，文章对制造执行系统的制造模式进行研究的基础上，提出了基于多Agent的制造执行系统的应用框架结构，并对基于多Agent的制造执行系统的调度系统进行了研究，最后给出了制造执行系统的调度算法结构。     

银基电接触材料改性及制备工艺

概述了银基电接触材料的发展,介绍了Ag-Ni、Ag-C、Ag-WC和Ag-MO4个主要系列的银基电接触材料的特点及其改性方法,比较了不同银基电接触材料改性前后的优缺点。同时,叙述了粉末冶金法、合金内氧化法及预氧化合粉末法等银基电接触材料的制备工艺。最后指出,提高银基电接触材料的性能、发展新型的节银触头材料和复合触头材料是今后银基电接触材料的发展方向。     

酸洗镀锌化学处理槽制造工艺

对酸洗镀锌化学处理槽(预清洗槽、酸洗槽、漂洗槽)的制造方案、制造工艺，安装使用效果做了分析，该槽满足了安装生产使用要求，为产品的进一步深加工奠定了良好的基础。