Data sharing mechanism of various mineral resources based on blockchain

Basins with various mineral resources coexisting and enriching often occupy an important strategic position. The exploration of various mineral resources is repetitive at present due to unshared data and imperfect management mechanism. This situation greatly increases the cost of energy exploitation in the country. Traditional data-sharing mode has several disadvantages, such as high cost, difficulty in confirming the right of data, and lack of incentive mechanism, which make achieving real data sharing difficult. In this paper, we propose a data-sharing mechanism based on blockchain and provide implementation suggestions and technical key points. Compared with traditional data-sharing methods, the proposed data-sharing mechanism can realize data sharing, ensure data quality, and protect intellectual property. Moreover, key points in the construction are stated in the case study section to verify the feasibility of the data-sharing system based on blockchain proposed in this paper.     

全球3G市场管制政策分析

主要对各国3G许可证与使用技术标准的抽绑政策．各国对2G／3G网络漫游的管制规定。以及3G网络之间共享的种类及实施方式等方面做了详尽的讲解，并进行比较和分析。     

On Finding the Multicast Protection Tree Considering SRLG in WDM Optical Networks

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm –multicast with SRLG sharing (MSS)– to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.     

国内3G网络共享问题之研究

随着国内3G时代的来临，3G网络共享问题越来越受到人们的关注。本文结合国内移动通信的现状，着重分析了3G网络共享的模式及经济效益，论述了3G网络共享的相应策略。     

硬件握手双向选通型串行通信共享器的设计

本文介绍了ＩＢＭ－ＰＣ系列计算机通过ＲＳ－２３２Ｃ串行口与多个单片微机组成的分布式系统中一种可双向选通串行通信共享器的设计方法。给出通信共享器的设计电路；并对电路工作原理进行了详细剖析。     

节能降耗提高矿山效益

节能降耗是每一个矿山提高经济效益的有效途径。我们采取提高球磨机处理能力，降低单耗；利用“分时计价”政策，采用“避峰作业”；使用新设备等措施节能降耗，提高矿山经济效益。     

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure

We present some new lower bounds on the optimal information rate and on the optimal average information rate of secret sharing schemes with homogeneous access structure. These bounds are found by using some covering constructions and a new parameter, the k-degree of a participant, that is introduced in this paper. Our bounds improve the previous ones in almost all cases.     

基于多智能体的数控机床资源共享技术研究

以数控铣床为对象，应用多智能体技术，以解决传统的资源共享所面lI缶的透明度低和效率低下的问题。首先，在分析功能模型的基础上，提出并实现了资源共享的四层网络拓扑结构；其次，构造了面向设备资源共享功能的智能体信息流模型，以实现四层结构之间的交互；其三，定义了智能体状态函数，并以此为依据，建立了智能体协商机制。所开发的原型系统表明，以上成果有效地提高了数控机床资源共享的透明度和效率。     

Verifiable Distributed Oblivious Transfer and Mobile Agent Security

The mobile agent is a fundamental building block of the mobile computing paradigm. In mobile agent security, oblivious transfer (OT) from a trusted party can be used to protect the agent’s privacy and the hosts’ privacy. In this paper, we introduce a new cryptographic primitive called Verifiable Distributed Oblivious Transfer (VDOT), which allows us to replace a single trusted party with a group of threshold trusted servers. The design of VDOT uses a novel technique called consistency verification of encrypted secret shares. VDOT protects the privacy of both the sender and the receiver against malicious attacks of the servers. We also show the design of a system to apply VDOT to protect the privacy of mobile agents. Our design partitions an agent into the general portion and the security-sensitive portion. We also implement the key components of our system. As far as we know, this is the first effort to implement a system that protects the privacy of mobile agents. Our preliminary evaluation shows that protecting mobile agents not only is possible, but also can be implemented efficiently. This work was supported in part by the DoD University Research Initiative (URI) program administered by the Office of Naval Research under grant N00014-01-1-0795. Sheng Zhong was supported by ONR grant N00014-01-1-0795 and NSF grants ANI-0207399 and CCR-TC-0208972. Yang Richard Yang was supported in part by NSF grant ANI-0207399. A preliminary version of this paper was presented at the DialM-POMC Joint Workshop on Foundations of Mobile Computing in 2003. Sheng Zhong received his Ph.D. in computer science from Yale University in the year of 2004. He holds an assistant professor position at SUNY Buffalo and is currently on leave for postdoctoral research at the Center for Discrete Mathematics and Theoretical Computer Science (DIMACS). His research interests, on the practical side, are security and incentives in data mining, databases, and wireless networks. On the theoretical side, he is interested in cryptography and game theory. Yang Richard Yang is an Assistant Professor of Computer Science at Yale University. His research interests include computer networks, mobile computing, wireless networking, sensor networks, and network security. He leads the LAboratory of Networked Systems (LANS) at Yale. His recent awards include a Schlumberger Fellowship and a CAREER Award from the National Science Foundation. He received his B.E. degree from Tsinghua University (1993), and his M.S. and Ph.D. degrees from the University of Texas at Austin (1998 and 2001).