Basic Properties of the (t, n)-Threshold Visual Secret Sharing Scheme with Perfect Reconstruction of Black Pixels

In this paper we consider the (t, n)-threshold visual secret sharing scheme (VSSS) in which black pixels in a secret black-white images is reproduced perfectly as black pixels when we stack arbitrary t shares. This paper provides a new characterization of the (t, n)-threshold visual secret sharing scheme with such a property (hereafter, we call such a VSSS the (t, n)-PBVSSS for short). We use an algebraic method to characterize basis matrices of the (t, n)-PBVSSS in a certain class of matrices. We show that the set of all homogeneous polynomials each element of which yields basis matrices of the (t, n)-PBVSSS becomes a set of lattice points in an (n−t+1)-dimensional linear space. In addition, we prove that the optimal basis matrices in the sense of maximizing the relative difference among all the basis matrices in the class coincides with the basis matrices given by Blundo, Bonis and De Santis [3] for all n≥ t ≥ 2.     

The inventory models under conditional trade credit in a supply chain system

In several recent investigations dealing with the economic order quantity with permissible delay in payments, the following assumptions are made:     

一种完整的非对称公钥叛逆者追踪方案

利用不经意多项式估值协议,该文提出了一种新的非对称公钥叛逆者追踪方案。当参与共谋的叛逆者数量不超过预先设置的范围时,与现有的非对称公钥追踪方案相比,该方案能够以完全的黑盒子追踪方式准确地确定出全部叛逆者;借助于密钥更新,该方案具有完善的撤销性,能够撤销任意数量的叛逆者。此外,与已有方案相比该方案显著降低了追踪时的计算量并且有着更高的传输效率。     

集成电路知识产权司法鉴定——之商业秘密

本文所讨论的范围主要集中在与集成电路芯片技术相关的案件，这些与芯片技术相关的案件中涉及最多的是专利和商业秘密的问题。本文将对集成电路领域有关商业秘密类型案件的司法鉴定问题进行介绍和探讨。     

二层信用策略下部分延期付款的库存模型

当前二层信用期相关文献考虑的都是零售商提供给其顾客相同的信用期,但现实中零售商往往会根据物品的种类不同提供给顾客不同的信用期.为研究此问题,建立了优化供货周期使零售商平均相关成本最小的库存模型,证明了最优供货周期的存在性,并给出实例加以说明.     

On the Contrast in Visual Cryptography Schemes

A visual cryptography scheme is a method to encode a secret image SI into shadow images called shares such that certain qualified subsets of shares enable the ``visual' recovery of the secret image. The ``visual' recovery consists of xeroxing the shares onto transparencies, and then stacking them. The shares of a qualified set will reveal the secret image without any cryptographic computation. In this paper we analyze the contrast of the reconstructed image in k out of n visual cryptography schemes. (In such a scheme any k shares will reveal the image, but no set of k-1 shares gives any information about the image.) In the case of 2 out of n threshold schemes we give a complete characterization of schemes having optimal contrast and minimum pixel expansion in terms of certain balanced incomplete block designs. In the case of k out of n threshold schemes with we obtain upper and lower bounds on the optimal contrast. Received 27 September 1996 and revised 13 February 1998     

On the complexity of project scheduling to minimize exposed time

We consider project scheduling where the project manager’s objective is to minimize the time from when an adversary discovers the project until the completion of the project. We analyze the complexity of the problem identifying both polynomially solvable and NP-hard versions of the problem. The complexity of the problem is seen to be dependent on the nature of renewable resource constraints, precedence constraints, and the ability to crash activities in the project.     

Optimal credit period and lot size for deteriorating items with expiration dates under two-level trade credit financing

In a supplier-retailer-buyer supply chain, the supplier frequently offers the retailer a trade credit of S periods, and the retailer in turn provides a trade credit of R periods to her/his buyer to stimulate sales and reduce inventory. From the seller’s perspective, granting trade credit increases sales and revenue but also increases opportunity cost (i.e., the capital opportunity loss during credit period) and default risk (i.e., the percentage that the buyer will not be able to pay off her/his debt obligations). Hence, how to determine credit period is increasingly recognized as an important strategy to increase seller’s profitability. Also, many products such as fruits, vegetables, high-tech products, pharmaceuticals, and volatile liquids not only deteriorate continuously due to evaporation, obsolescence and spoilage but also have their expiration dates. However, only a few researchers take the expiration date of a deteriorating item into consideration. This paper proposes an economic order quantity model for the retailer where: (a) the supplier provides an up-stream trade credit and the retailer also offers a down-stream trade credit, (b) the retailer’s down-stream trade credit to the buyer not only increases sales and revenue but also opportunity cost and default risk, and (c) deteriorating items not only deteriorate continuously but also have their expiration dates. We then show that the retailer’s optimal credit period and cycle time not only exist but also are unique. Furthermore, we discuss several special cases including for non-deteriorating items. Finally, we run some numerical examples to illustrate the problem and provide managerial insights.     

A note on “Seller’s optimal credit period and cycle time in a supply chain for deteriorating items with maximum lifetime”

In 2014, Wang et al. (2014) extended the model of Lou and Wang (2012) to incorporate the credit period dependent demand and default risk for deteriorating items with maximum lifetime. However, the rates of demand, default risk and deterioration in the model of Wang et al. (2014) are assumed to be specific functions of credit period which limits the contributions. In this note, we first generalize the theoretical results of Wang et al. (2014) under some certain conditions. Furthermore, we also present some structural results instead of a numerical analysis on variation of optimal replenishment and trade credit strategies with respect to key parameters.