Scalable framework for blockchain-based shared manufacturing

Shared Manufacturing is a new mode of social manufacturing based on the principles of a sharing economy. This paper presents a scalable framework for blockchain-based Shared Manufacturing that preserves the transparency and immutability characteristics of transaction records, which is critical to building trust between entities in blockchain-based systems. We define a blockchain-based protocol for the service execution according to the design principles of the sharing economy. We present a scalable integration of blockchain technology into the concept of Shared Manufacturing by employing cross-chain solutions. We discuss existing cross chain technologies regarding the requirements of Shared Manufacturing and propose hybrid approach. We compare implementations of the proposed framework on two different blockchain networks: Ethereum public network and Xdai sidechain network. We conduct user-oriented test to explore the performance (cost and time) of the implementations in realistic situations in order to justify the use of the sidechain technology. Results indicate that the implementation on the sidechains provides greater scalability than the implementation on the public blockchain network.     

云存储安全增强系统的设计与实现

云存储是一种新型的网络存储形式,并逐步为大家所接受,企业和个人用户都开始使用云存储作为其网络存储媒介。目前很多著名的IT企业都推出了云存储服务,其中Amazon公司推出的SimpleStorageService（S3）就是商用云存储服务的典型代表。随着云存储的广泛使用,云存储中数据的安全问题,如数据泄漏和数据篡改,也成了用户广泛关注的问题。文章基于Amazons3的云存储服务,设计并实现了一款云存储安全增强系统,对用户上传至Amazons3的数据进行加密保护,使得文件以密文形式存储于Amazons3,可以有效防止数据在传输和存储过程中的泄漏;同时系统还对从s3下栽的文件进行完整性校验,检测其内容与上传时是否一致,以防止文件被篡改;最后,系统还提供了多用户访问控制支持,多个用户可以共享同一个S3账号,同时保证各自存储的内容互相隔离,禁止一个用户非授权访问其他用户存储的文件。     

基于P2P的云计算模型及其安全性分析

文章通过将P2P技术和云计算相结合,提出了一种可靠的、可扩展的、低成本的文件共享模型PA-Cloud。该文介绍了PA-Cloud的文件下载和更新过程,并对系统的安全性进行了分析。通过对PA-Cloud进行对比实验表明,PA-Cloud可以有效提高系统的可扩展性,降低服务提供商的成本。     

云计算安全：概念、现状与关键技术

随着云计算的广泛应用,云计算安全问题逐渐凸显出来。文章首先阐述了云计算安全相关概念,并对云计算的安全问题和云计算安全特征进行分析,然后对云计算安全的现状和典型的云计算安全体系架构进行了介绍,并对云计算安全的关键技术进行分析,最后给出了结论。     

云计算安全需求分析研究

云计算是当下发展迅速的信息技术之一。由于其外包式的服务方式,云计算中的安全问题受到人们格外关注。只有妥善地保障云计算的安全,才不会掣肘云计算的发展和推广。鉴于云计算的复杂性和多面性,文章着眼云计算有别于传统技术的新特点、新趋势,首先提出了考量云计算安全需求的多维视角,随后围绕云计算具体实施过程中的若干关键技术,对云计算中的安全需求进行了细致全面的分析和阐释。     

基于SaaS的矿震远程预警系统关键技术初探

现有的矿震预警系统都是以独立形式运行于各矿区,相互之间没有关联,重复投资严重,且矿震数据海量繁杂,仅依靠现场分析无法满足实时预警需求。文章基于感知矿山物联网示范工程(夹河矿),对采用云计算SaaS模式构建的矿震远程预警系统关键技术进行了相关研究:首先给出了系统整体框架,然后重点探讨了该系统所涉及的三个关键技术,包括基于SaaS的矿震预警专家分析软件架构、多源SaaS数据库构建技术以及基于MapReduce的并发数据过滤接收技术。现场应用表明,所构建的系统已基本具备全国统一远程矿震预警系统的架构,能满足多矿区远程矿震预警的基本要求。     

基于云自适应遗传算法的NoC路径分配研究

路径分配是NoC设计流程中的两个关键步骤之一;路径分配的结果对NoC系统的性能尤其是通讯延时有着很重要的影响;多约束条件下的NoC路径分配问题是NP完全问题,要求出其最优解比较困难,目前常用的方法是利用启发式算法求得其较优解;文中提出一种基于云自适应遗传算法的NoC路径分配解决方案,该算法利用云模型对传统遗传算法加以改进,采取新的方法自动调整遗传算法过程中的交叉概率pc和变异概率pm,将适应度与云模型的3个参数Ex、En、He相互结合,从而达到优化遗传算法的目的;将此算法应用于2D-Mesh拓扑结构的NoC中,以平衡链路负载和联合优化为实验目标,以优化静态通讯分配结果;实验证明,文章所采取的算法在平衡链路负载和联合优化方面均取得了良好的效果。     

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.     

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

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