Uniqueness of entire functions that share one value

Using Nevanlinna’s value distribution theory, we study the uniqueness of entire functions that share only one value and prove some theorems which are related to one famous problem of Hayman [W.K. Hayman, Research Problems in Functions Theory, Athlone Press, London, 1967].     

Uniqueness of meromorphic functions and differential polynomials

In this paper, we study the uniqueness theorem of meromorphic functions concerning differential polynomials, and obtain two theorems, which improve and generalize the related results of Fang, S.S. Bhoosnurmath and R.S. Dyavanal and Xiao-Yu Zhang and Wei-Chuan Lin.     

Uniqueness theorems for entire functions concerning fixed points

This paper is devoted to studying the uniqueness problem of entire functions sharing one value or fixed points. We improve some results given by Fang and extend some results given by Fang and Qiu and by Lin and Yi.     

Uniqueness of meromorphic functions whose certain nonlinear differential polynomials share a polynomial

In this paper, we get two uniqueness theorems of meromorphic functions whose certain nonlinear differential polynomials share a polynomial. The results in this paper extend the corresponding results given by Fang (2002) in [7]. Our reasoning in this paper will correct a defective reasoning in the proof of Theorem 4 in Bhoosnurmath and Dyavanal (2007) [8]. An example is provided to show that some conditions of the main results in this paper are necessary.     

On the multiple values and uniqueness of meromorphic functions on annuli

The purpose of this article is to deal with the multiple values and uniqueness of meromorphic functions on annuli. We prove a general theorem on the multiple values and uniqueness of meromorphic functions on annuli, from which an analog of Nevanlinna’s famous five-value theorem is proposed.     

Certain classes of meromorphic multivalent functions

In this paper, we introduce and investigate two new classes of meromorphic multivalent functions. Such results as subordination properties, coefficient inequalities, convolution properties and integral representations are proved. Several sufficient conditions for meromorphic multivalent starlikeness and convexity are also derived.     

Uniqueness of meromorphic functions sharing a small function and its applications

In this paper, we shall study the uniqueness problems of meromorphic functions sharing a small function. Our results improve or generalize many previous results on value sharing of meromorphic functions.     

Essential secret image sharing scheme with the same size of shadows

Secret image sharing is a method to decompose a secret image into shadow images (shadows) so that only qualified subset of shadows can be used to reconstruct the secret image. Usually all shadows have the same importance. Recently, an essential SIS (ESIS) scheme with different importance of shadows was proposed. All shadows are divided into two group: essential shadows and non-essential shadows. In reconstruction, the involved shadows should contain at least a required number of shadows, including at least a required number of essential shadows. However, there are two problems in previous ESIS scheme: unequal size of shadows and concatenation of sub-shadow images. These two problems may lead to security vulnerability and complicate the reconstruction. In this paper, we propose a novel ESIS scheme based on derivative polynomial and Birkhoff interpolation. A single shadow with the same-size is generated for each essential and non-essential participant. The experimental results demonstrate that our scheme can avoid above two problems effectively.     

Meromorphic functions in the unit disc that share slowly growing functions in an angular domain

In this paper, we investigate the uniqueness of meromorphic functions in the unit disc that share five distinct meromorphic functions of slow growth in an angular domain.     

基于线性单向函数的可验证的多秘密共享方案

基于Shamir的门限秘密共享方案和线性单向函数的安全性以及离散对数问题的困难性,提出了一个可验证的多秘密共享方案。该方案中每个参与者只需保护一个秘密份额,就可共享多个秘密。秘密恢复之前,参与者可验证其他参与者所提供的影子份额的正确性。秘密恢复后,参与者的秘密份额不会泄露,可重复使用,并且所需的公开参数较少,秘密分发过程不需要安全信道。     

不完全虹膜模式唯一性实验研究*

在虹膜识别中,常见的情况就是虹膜信息的不完整,许多文献已经表明在虹膜信息完全的情况下,虹膜的模式是唯一的,模式之间具有差异性,能够通过它的独立特征数来表示模式之间的可分性。但是实际中,虹膜模式受到的影响导致了虹膜模式的信息不完全,有的甚至只有很少的虹膜区域,究竟在小区域内虹膜是否还具有特征的唯一性,是虹膜识别能否实际应用需要考虑的问题。研究结果表明,部分虹膜区域仍具有相当多的独立特征,但随着虹膜区域的减小,错误拒绝率会增加。     

一个新的梯形秘密共享方案

提出了一个新的梯形秘密共享方案,该方案基于离散对数和单向函数,克服了李艳俊等人方案的不足。     

A polynomial rule for the problem of sharing delay costs in PERT networks

In this paper we define the weighted serial cost sharing rule for the cost allocation problem. We apply this new rule to the problem of sharing delay costs in a PERT network. This rule belongs to the Core and is the Weighted Shapley Value for a particular game. Furthermore, we present a characterization of this rule and a polynomial algorithm for its calculation.     

门限多重秘密共享方案

基于Shamir的门限方案、RSA密码体制以及Hash函数,提出了一个新的门限多重秘密共享方案.参与者的秘密份额是由各参与者自己选择,并且只需维护一份秘密份额即可实现对多个秘密的共享,每个参与者也可以是秘密分发者,只要正确选择参数不会影响到各个参与者所共享的秘密安全性.在秘密恢复过程中,秘密恢复者能够验证其它参与者是否进行了欺骗.方案的安全性是基于Shamir的门限方案、RSA密码体制以及Hash函数的安全性.分析结果表明,该方案是一个安全、实用的秘密共享方案.     

基于Hash函数的无分发者的多秘密共享方案

基于单向抗碰撞Hash函数提出了一个理想的多访问结构的多秘密共享方案。方案中每个参与者只需持有一个子密钥即可用来恢复多个主密钥。为了避免分发者的不诚实行为所导致的破坏,参与者各自选择其子密钥,主密钥由一个指定的算法生成,即该方案是一个无分发者的秘密共享方案,任何人都无法进行独裁。方案只用到了Hash函数和异或运算,避开了模乘法、模方幂以及求逆等高度复杂的运算,方案具有可验证性。     

基于VNF实例共享的服务功能链部署算法

针对服务功能链(SFC)部署过程中存在虚拟网络功能(VNF)实例部署成本和转发路径成本难以权衡的问题,提出了基于VNF实例共享的SFC部署算法。首先针对多链SFC建立VNF和虚拟链路映射模型,并预估路径部署长度上限,保证SFC时延需求;其次,在路径部署长度限制范围内,尽可能使VNF实例共享最大化,以平衡链路转发成本和VNF部署成本,最终得到SFC部署策略。与已有的SPH(shortest path heuristic)和GUS(greedy on used server)部署算法相比,所提算法所得的总运营成本分别降低6.6%和12.15%,且当SFC数量增多时,该算法的服务接受率可达89.33%。仿真实验结果表明,提出算法可以在保证用户服务质量的同时有效降低SFC部署成本。     

适应值共享对遗传算法选择概率的影响分析

研究了采用遗传算法进行多蜂函数优化时引入适应值共享机制对选择概率的影响。引入种群共享因子这一参数，描述个体选择概率、小生境中多个个体的选择概率之和在适应值比例选择策略下的变化情况。分析和仿真实验表明，适应值共享可在一定程度上保持种群多样性，适应值函数的取值范围将对优化结果产生较大的影响。     

基于适应值共享的多生境排挤遗传算法

针对优化多模函数时单纯使用共享和排挤机制的遗传算法所存在的缺陷,提出了基于适应值共享的多生境排挤遗传算法。基本思想是：按照共享的思想在对个体的适应值进行调整的同时,将排挤选择和相似个体中适应度最差个体被替换的策略分别应用于选择算子和群体的进化中。理论分析和数值实验表明,该算法很好地维持了种群多样性,对于各类多峰函数具有较强的搜索能力。     

一个可验证的多秘密共享门限方案

利用Shamir[(t,n)]门限方案、有限域上的模运算和Lagrange插值多项式提出了一个可验证的多秘密共享门限方案。该方案中,每一个密钥对应的极小访问结构是一个门限访问结构,这样的访问结构实现了在重构阶段可重构部分密钥,而且重构的参与者越多可重构的密钥就越多;与以前的可验证的[(t,n)]门限多秘密共享方案相比,该方案更具有实用性。     

一个可验证的多重秘密共享方案

利用双变量单向函数提出了一种多重秘密共享体制。由于该方案的秘密份额由共享者自己选择,秘密分发者不需要向他们传送任何秘密信息,所以不需要安全信道。同时,各共享者可以验证其他共享者秘密伪份额的正确性并且秘密份额可以重复使用,离线验证。