因特网上基于.NET的通用计算资源共享环境

为了高效与方便地聚集异构环境下的网络资源,提出一种基于.NET的通用计算资源共享环境GCRSE。GCRSE在体系结构上利用了节点功能角色的方式,由服务器功能实体、自愿机功能实体和客户机功能实体组成。它利用.NET的Web services技术,通过网页的方式提交、执行与传输并行分布式应用相关的任务和子任务。在编程模型上支持普通的主—从模式的编程模式和具有子任务递归迭代的分治模式编程。自愿机端的心跳消息和面向子任务的容错方式可以达到可靠性高的效果。GCRSE的测试环境通过局域网内的若干台自愿机组成,选择了具有数据依赖的分布式旅行商(TSP)问题进行测试,结果表明对于分布式计算中大量的子任务GCRSE环境可以很快地完成,具有高效性、可扩展性和通用性的特点。     

Scalable Synthesis of Hierarchical Antimony/Carbon Micro-/Nanohybrid Lithium/Sodium-Ion Battery Anodes Based on Dimethacrylate Monomer

A facile scalable synthesis of hierarchical Sb/C micro-/nanohybrid has been addressed in this work,which possesses the advantages of both micrometer and nanometer scale structures as lithium-ion battery anode.Difunctional methacrylate monomers are used as solvent and carbon source as well.Liquid precursor of antimony(III) n-butoxide is dissolved in the resin monomer solution,and further incorporated into the cross-linking polymer network via photo polymerization.Through calcination in argon/hydrogen atmosphere,antimony nanoparticles are in situ formed by carbothermal reduction,and homogeneously embedded in the in situ formed micrometer sized carbon matrix.The morphology,structure,crystallinity,spatial dispersion,composition,and electrochemical performance of the Sb/C micro-/nanohybrid are systematically investigated.The cyclic and rate performance of the Sb/C micro-/nanohybrid anode have been effectively improved compared to the pure carbon anode.A reversible capacity of 362 m Ah g~(-1) is achieved with a reasonable mass loading density after 300 cycles at 66 m A g~(-1),corresponding to capacity retention of 79%.With reducing mass loading density,the reversible capacity reaches 793 m Ah g~(-1) after 100 cycles.Moreover,the electrochemical performance of Sb/C micro-/nanohybrid as sodium-ion battery anode is also investigated in this study.     

集中式认知网络分簇算法研究

认知网络按照一定的准则划分为若干个簇,簇内共享一条信道用于交换控制信息,这种以分簇的方式实现按区域共享信道是认知无线电频谱共享问题的解决方法之一。针对认知网络空闲信道的特性,提出了一种考虑可用信道、地理位置以及数据库统计值的新的分簇算法,该算法以最大化簇内吞吐量和维持簇结构稳定为设计目的;讨论了几个关键的簇维护和管理问题。仿真结果表明,提出的分簇算法在产生的簇总数量以及簇的重构次数上可以获得一个较好的综合性能。     

超大尺寸激光测距大型测控网络研制

为了解决超大尺寸激光测距过程中所面临的测量任务大、测量点数多、数据庞大和巨型数据处理困难等问题,设计了超大尺寸激光测距大型测控网络的研制方案。提出将云计算平台与大型测控网络相结合,使得若干台具有串口通信功能的仪器协同工作,获得更强大的测量能力,实现了多种无线网络融合,并解决海量数据的存储及数据处理问题。实验结果表明:系统内存设定为2G,虚拟机硬盘设定为500G,当数据存储量超过500G时不会出现不能继续存储的问题,测量数据可以准确地被存储到云平台;一次性处理数据量超过2G时不会出现内存不足的问题,能够实现巨型数据的处理问题;Matlab和虚拟机结合能够很好的完成复杂运算任务,快速准确地确定被测关键点坐标。     

Research on Knowledge Sharing and Transfer in Remanufacturing Engineering Management Based on SECI Model

In this paper, an application mode and method of knowledge management in remanufacturing engineering management is established based on Nonaka’s SECI model. The relationships between knowledge transfer, knowledge sharing and remanufacturing engineering management are highlighted. It is noticeable that a great deal of knowledge transfer and sharing activities, which can improve the performance of remanufacturing engineering management constantly, are involved in remanufacturing engineering.     

适用于社交网络的隐私保护兴趣度匹配方案

针对社交网络中用户通过兴趣度匹配进行交友而产生的敏感信息泄露问题,设计了基于隐私属性的隐私保护兴趣度匹配方案。该方案利用Bloom Filters来获取双方兴趣爱好集合元素的交集,确定双方兴趣爱好的匹配程度,满足匹配要求的双方可以根据意愿互相添加为好友;方案基于半诚实模型,采用密码协议来保护数据的安全性,防止恶意用户非法获取用户敏感信息,避免造成信息的滥用和泄露。理论分析及运算结果均表明,该方案运行时间具有线性复杂度,并且可以支持较大规模数据集,可有效应用于信息种类繁杂、数据内容庞大的网络环境,满足用户实时高效的现实需求。     

基于二元对称多项式的公平秘密共享方案

基于二元对称多项式,提出一种新的公平[(t,n)]门限秘密共享方案,能够确保：所有参与者都合法且诚实时,均能恢复正确的秘密;存在欺骗者时,所有参与者都无法恢复正确的秘密。该方案利用二元对称多项式不仅为任意两个参与者提供会话密钥;结合离散对数,在确保每个share持有者拥有较少share的情况下,使得Dealer可以选取足够长的秘密序列,从而确保方案的公平性。此外,方案在异步环境下也能实现公平秘密恢复。与Harn方案相比,该方案更加公平和灵活。     

动态分等级量子比特共享协议

量子秘密共享是量子密码研究的一个重要分支,针对多方共享量子比特情况进行研究,提出一个新的动态量子比特共享协议。此协议中,参与共享的成员是分等级的,量子信息的管理者在无需建立新的量子信道的情况下可对秘密重构系统中的参与者进行裁员。裁员后,管理者通过量子操作可以对量子信息进行更新,而剩余的有效参与者无需对自己手中的粒子执行额外操作就可完成新信息重构。此外,还讨论了协议的正确性、安全性及共享成员的等级性。     

Information sharing in capacity constrained supply chains under lost sales

We present a modelling approach for quantifying the value of information in supply chains using Markov decision processes (MDP). The case where information sharing occurs is modelled using a completely observable MDP. A restricted observation MDP is used to model the case where no information sharing occurs. We illustrate the use of this framework on a two-stage capacity-constrained supply chain consisting of a supplier and a retailer. We quantify the value of information sharing in this setting and construct several performance measures to identify the benefits to both the retailer and supplier as a result of the information sharing partnership.     

SWMRD: a Semantic Web-based manufacturing resource discovery system for cross-enterprise collaboration

As supply chains are becoming ever more global and agile in the modern manufacturing era, enterprises are increasingly dependent upon the efficient and effective discovery of shared manufacturing resources provided by their partners, wherever they are. Enterprises are thus faced with increasing challenges caused by the technical difficulties and ontological issues in manufacturing interoperability and integration over heterogeneous computing platforms. This paper presents a prototype intelligent system SWMRD (Semantic Web-based manufacturing resource discovery) for distributed manufacturing collaboration across ubiquitous virtual enterprises. Ontology-based annotation to the distributed manufacturing resources via a new, multidisciplinary manufacturing ontology is proposed on the semantic web to convert resources into machine understandable knowledge, which is a prelude to the meaningful resource discovery for cross-enterprise multidisciplinary collaboration. An ontology-based multi-level knowledge retrieval model is devised to extend the traditional information retrieval approaches based on keyword search, with integrated capabilities of graph search, semantic search, fuzzy search and automated reasoning to realise the intelligent discovery of manufacturing resources, e.g. to facilitate more flexible, meaningful, accurate and automated resource discovery. A case study for intelligent discovery of manufacturing resources is used to demonstrate the practicality of the developed system.