交通网络设计问题的人工鱼群算法

人工鱼群算法是一种新的群体智能优化算法,可较好地避免局部极值并取得全局极值,但针对离散优化问题却存在开发平衡及探索能力差等缺点。为此,设计一种自适应变异的人工鱼群算法,在迭代过程中添加变异算子并自动调节视野范围和拥挤度因子。将该算法应用于多等级选择的离散型交通网络二层规划模型设计中,上下层模型分别采用人工鱼群算法及Frank-Wolfe算法进行求解,从而为求解这类模型提供新方法。仿真结果表明,该算法具有较好的稳定性和收敛速度,能够应用于大型城市交通网络设计中。     

Iterative methods for solving extended general mixed variational inequalities

In this paper, we introduce and consider a new class of mixed variational inequalities involving four operators, which are called extended general mixed variational inequalities. Using the resolvent operator technique, we establish the equivalence between the extended general mixed variational inequalities and fixed point problems as well as resolvent equations. We use this alternative equivalent formulation to suggest and analyze some iterative methods for solving general mixed variational inequalities. We study the convergence criteria for the suggested iterative methods under suitable conditions. Our methods of proof are very simple as compared with other techniques. The results proved in this paper may be viewed as refinements and important generalizations of the previous known results.     

Halpern-type iterations for strongly relatively nonexpansive mappings in Banach spaces

In this paper, we note that the main convergence theorem in Zhang et al. (2011) [21] is incorrect and we prove a correction. We also modify Halpern’s iteration for finding a fixed point of a strongly relatively nonexpansive mapping in a Banach space. Consequently, two strong convergence theorems for a relatively nonexpansive mapping and for a mapping of firmly nonexpansive type are deduced. Using the concept of duality theorems, we obtain analogue results for strongly generalized nonexpansive mappings and for mappings of firmly generalized nonexpansive type. In addition, we study two strong convergence theorems concerning two types of resolvents of a maximal monotone operator in a Banach space.     

The order of convexity of some general integral operators

The main object of the present paper is to discuss some extensions of certain integral operators and to obtain their order of convexity. Several other closely related results are also considered.     

Some preserving subordination and superordination of analytic functions involving the Liu-Owa integral operator

In this paper, we obtain some subordination and superordination-preserving results of analytic functions involving the Liu-Owa integral operator. Sandwich-type result is also obtained.     

基于混合交叉因子的蚁群聚类优化

为解决蚁群聚类易陷入局部最优问题,综合分析了仿生智能聚类的特点,提出了一种混合交叉因子的蚁群聚类方法。该算法采用结合分阶段调整策略和启发式多点交叉策略的混合交叉因子,其中分阶段调整策略动态调整交叉点规模,显著降低交叉操作的无效性概率;启发式策略建立在适应度的基础上能有效地保留父代优秀基因。同时引用随机变异因子,进一步减少陷入局部优化的可能性。结合实例对算法进行了分析,结果表明了该算法在鲁棒性和聚类效果上都有所提高。     

Distortion-free secret image sharing mechanism using modulus operator

The (t, n)-threshold has been extended to secret image sharing due to its practicability. In this article, we provide a novel version that employs the modulus operator to embed the secret share into a host image. The simulator shows that the modulus operator is useful for decreasing shadow image distortion. Using Rabin's signature cryptosystem, participants can detect if a cheater exists in the cooperation. In particular, the new mechanism permits involved members to restore a lossless secret image and to reconstruct a distortion-free host image.     

灰色预测中缓冲算子的组合性质及应用

通过研究同性缓冲算子作用样本数据序列所得灰色预测模型的预测精度问题, 发现同类缓冲算子对于相同样本数据序列的预测值一致, 对于具体预测问题, 某个缓冲算子在此类问题中有效, 用到另一类问题上可能失效. 为此, 提出一种同性缓冲算子的组合方法, 通过对同性缓冲算子的有效组合可以得到一种新的缓冲算子, 该缓冲算子不但能够提高模型的预测精度, 而且可以扩大缓冲算子的适用范围. 实例验证表明, 所提出的组合方法是有价值的.