A high contrast and capacity efficient visual cryptography scheme for the encryption of multiple secret images

The visual secret sharing for multiple secrets (VSSM) allows for the encryption of a greater number of secret images into a given image area. Previous researches on VSSM schemes incur a very serious pixel expansion that will damage capable of increasing the capacity of secret image encryption. Moreover, the most of VSSM schemes will decrease the contrast of recover images while the amount of secret image encryption increases. These drawbacks limit applicability of the existing VSSM schemes. In this paper, we propose a highly efficient encryption algorithm to cope with this problem. The proposed algorithm adopts a novel hybrid encryption approach that includes a VC-based encryption and a camouflaging process. The experimental results demonstrate that the proposed approach not only can increase the capacity efficient for VSSM schemes, but also maintains an excellent level of contrast in the recovered secret images.     

Quantum secret sharing protocol with four state Grover algorithm and its proof-of-principle experimental demonstration

In this article, we propose a three-party quantum secret sharing protocol with four-state Grover algorithm. The protocol has several advantages. It uses only four initial states which simplifies its experimental implementation. It has a higher encoding capacity, each two-qubit state provides two bits of information. We have experimentally demonstrated the protocol in a nuclear magnetic resonance quantum information processor successfully.     

Monotonicity and the Aumann–Shapley cost-sharing method in the discrete case

We give an axiomatization of the Aumann–Shapley cost-sharing method in the discrete case by means of monotonicity and no merging or splitting (Sprumont, 2005). Monotonicity has not yet been employed to characterize this method in such a case, by contrast with the case in which goods are perfectly divisible, for which Monderer and Neyman (1988) and Young (1985b) characterize the Aumann–Shapley price mechanism.     

An integrated revenue sharing and quantity discounts contract for coordinating a supply chain dealing with short life-cycle products

This paper develops a combined contract model for coordinating a two stage supply chain where the demand at the retailer’s end is price sensitive and stock dependent. It has been shown that proposed coordination mechanism achieves perfect coordination and win–win situation for both the members of the supply chain. Further, an extensive sensitivity analysis is performed to examine the impact of various parameters on supply chain performance. It has been found that stock dependency factor has positive impact on order quantity and subsequently on supply chain performance. The paper has also made a comparative statics analysis to see the impact of certain parameters on the pricing and replenishment policies of the retailer.     

基于提前期压缩的两阶段供应链的契约协调

研究了基于提前期压缩的信息对称和信息不对称两种情况下的供应链协调问题,重点解决了在信息不对称时采用线性转移支付策略解决供应链的不协调问题.当压缩提前期时,制造商的成本增加,成本的增加值信息对销售商有对称和不对称两种情况.在信息对称时采用收益共享契约可以实现供应链的协调;在信息不对称,采用收益共享契约时,为了激励制造商,销售商不得不对制造商生产成本的不确定性付出成本,导致利润下降,而制造商由于拥有私有信息而使得利润增加,所以整个供应链并没有达到集中决策时的水平,只得到了帕累托改善的次优结果.创新点在于采用线性转移支付策略实现了供应链的协调,达到了帕累托最优,解决了收益共享契约不能实现供应链协调的问题.最后通过算例进行了说明.     

高校大型仪器共享平台的设计与实现

高校大型仪器共享平台是推动高校教学资源社会化管理、提升使用效益和社会价值的重要途径之一。文中分析了当前高校大型仪器使用中存在的主要问题,结合大型仪器共享平台设计的总体目标,运用数据库、ASP.NET等技术设计平台的总体框架、预约实验和检测、分析统计等模块。     

基于Howell designs的完备秘密共享方案

在完备秘密共享方案中,非授权集得不到有关秘密的任何信息.1998年,Chaudhry等提出了一种由Room方的临界集产生的完备秘密共享方案.基于此,提出一种从Howell designs的临界集得到的完备秘密共享方案.将一个Howell design的一个临界集作为秘密,秘密分发者按照Karnin-Greene-Hellman算法计算出伪部分依次发给每个参与者.授权集中每个参与者得到的伪部分合在一起,就能重构此Howell design的临界集即秘密.     

高校图书馆馆际合作模式研究

网络信息时代,人们对信息资源的需求越来越多,开展广泛的馆际合作与资源共享是我国图书馆事业发展的重要策略。指出馆际间的协作是实现资源共享的必要条件,对馆际合作的模式与实现资源共享的方式进行了探讨。     

高校档案信息化建设探析

为实现国家信息化建设中提出的＂以人为本,惠及全民＂从而达到人人共享信息资源的目标,高校档案信息化建设应通过制定统一标准,完善高校档案数字化工作规范,加强各高校档案数据库建设,利用现代信息技术和互联网系统,建立分布式档案管理系统,构建教育信息资源与服务平台,实现档案信息资源共享,促进高校档案利用效益达到最大化。