整函数权分担一个值

This paper deals with some uniqueness problems of entire functions concerning differential polynomials that share one value with finite weight in a different form. We obtain some theorems which generalize some results given by Banerjee, Fang and Hua, Zhang and Lin, Zhang, etc.     

Highway toll pricing

For a tolled highway where consecutive segments allow vehicles to enter and exit unrestrictedly, we propose a simple toll pricing method. It is shown that the method is the unique method satisfying the classical axioms of Additivity and Dummy in the cost sharing literature, and the axioms of Toll Upper Bound for Local Traffic and Routing-proofness. We also show that the toll pricing method is the only method satisfying Routing-proofness Axiom and Cost Recovery Axiom. The main axiom in the characterizations is Routing-proofness which says that no vehicle can reduce its toll charges by exiting and re-entering intermediately. In the special case when there is only one unit of traffic (vehicle) for each (feasible) pair of entrance and exit, we show that our toll pricing method is the Shapley value of an associated game to the problem. In the case when there is one unit of traffic entering at each entrance but they all exit at the last exit, our toll pricing method coincides with the well-known airport landing fee solution-the Sequential Equal Contribution rule of Littlechild and Owen (1973).     

Value-sharing and uniqueness problems for non-Archimedean differential polynomials in several variables

We consider differential polynomials of Fermat–Waring type, const-ructed using polynomials of Yi’s type for meromorphic functions in a non-Archimedean field. Similarly to the Hayman Conjecture, we prove that the considered differential polynomials assume all values. We established also a uniqueness theorem for these differential polynomials.     

Pricing in a supply chain for auction bidding under information asymmetry

We examine a supply chain in which a manufacturer participates in a sealed-bid lowest price procurement auction through a distributor. This form of supply chain is common when a manufacturer is active in an overseas market without establishing a local subsidiary. To gain a strategic advantage in the division of profit, the manufacturer and distributor may intentionally conceal information about the underlying cost distribution of the competition. In this environment of information asymmetry, we determine the equilibrium mark-up, the ex-ante expected mark-up and expected profit of the manufacturer and the equilibrium bid of the distributor. In unilateral communication, we demonstrate the informed agent’s advantage resulting to higher mark-up. Under information sharing, we show that profit is equally shared among the supply chain partners and we explicitly derive the mark-up when the underlying cost distribution is uniform in [0, 1]. The model and findings are illustrated by a numerical example.     

Tests for specific nonparametric relations between two distribution functions with applications

Let (X,Y) be a random vector and let G and H be the marginal distributions of X and Y, respectively. In this paper, we propose two tests, one of Kolmogorov‐Smirnov type and the other of Wilcoxon type, for the null hypothesis Ψ(G) = H against the alternative Ψ(G) < H, where Ψ() is a function such that Ψ(G) is a distribution function. The tests are based on the empirical distribution functions of the observations on X and Y, which are dependent. We obtain their asymptotic null distributions. A suspected relationship between the distribution functions of two dependent outcomes can be specified as a hypothesis to be tested in examples like the load sharing models, record values, and auction bidding models. As an application, we consider in detail the problem of testing the effect of load sharing in two component parallel systems.     

Constructions of projective linear codes by the intersection and difference of sets

Projective linear codes are a special class of linear codes whose dual codes have minimum distance at least 3. Projective linear codes with only a few weights are useful in authentication codes, secret sharing schemes, data storage systems and so on. In this paper, two constructions of q-ary linear codes are presented with defining sets given by the intersection and difference of two sets. These constructions produce several families of new projective two-weight or three-weight linear codes. As applications, our projective codes can be used to construct secret sharing schemes with interesting access structures, strongly regular graphs and association schemes with three classes.     

组织公平对知识共享行为的影响及其对策研究——以河北省国有企业为例

员工间知识共享行为作为企业知识资源的积累和更新的重要来源为企业发展提供了动力源泉,另一方面员工间知识共享行为又受到组织环境、员工观念、技术环境等多方面制约。本文以河北省国有企业员工为研究对象,以组织公平为前因变量,组织嵌入为中介变量,知识共享行为为因变量构建理论模型,并且检验了三者之间的关系。研究结果显示:组织公平、组织嵌入对知识共享行为存在显著正向影响,其中组织嵌入在组织公平与知识共享行为之间存在部分中介作用。     

最小化碳排放的共享单车迁移问题

本文考虑共享单车迁移问题, 它可看作是经典旅行售货商问题的一个新颖变形, 不同的是其目标函数为最小化碳排放。其中, 碳排放利用单车负载与其行驶路程的乘积进行刻画。我们提出了两个启发式算法：贪心和基于TSP的算法, 每个算法的核心思想均是优先减少单车负载。从理论上证明算法的可行性并给出数据实验以验证算法的实际性能。数据实验结果表明贪心算法优于基于TSP的算法, 这为共享单车企业进行日常单车分配提供了理论依据。     

一种基于双偏振分束器的量子秘密共享方案

提出一个基于双偏振分束器的单量子比特全光纤量子秘密共享方案, 该方案具有自动补偿光纤及光学器件的双折射效应和相位抖动的功能, 在干涉对比度测试和稳定性测试时, 该方案在5 km通信距离中, 获得的干涉对比度优于993%, 且可长时间保持稳定. 关键词： 量子秘密共享 偏振分束器 单光子干涉