指针推进移动性管理策略中指针链长度的概率

为了降低移动通信网络中位置跟踪操作的代价,指针推进策略被提出.显然,指针链长度的确定对这一策略的有效应用是至为重要的.已有论文假定移动台在位置区的逗留时间服从指数分布的条件下,对指针链的长度进行研究,但指数分布的特殊性,限制了其研究结果的应用.本文推广了上述结果,研究了移动台在位置区的逗留时间服从一般概率分布的指针推进策略,通过构造向量马氏过程,利用密度演化方法,导出了指针链长度的概率公式,这个公式可用于对各种指针推进策略性能的评价.     

计算机模拟溃坝洪水问题的程序设计

随着计算机性能的提高，计算机模拟技术日益复杂，在研究使用计算机模拟洪水的演进，以期给出准确的预警，最大限度减少损失和人员伤亡方面也取得一定进步。本文尝试用MATLAB程序模拟溃坝洪水，并在最后给出一个算例。     

Ensemble clustering by means of clustering embedding in vector spaces

Ensemble clustering is a recently evolving research direction in cluster analysis and has found several different application domains. In this work the complex ensemble clustering problem is reduced to the well-known Euclidean median problem by clustering embedding in vector spaces. The Euclidean median problem is solved by the Weiszfeld algorithm and an inverse transformation maps the Euclidean median back into the clustering domain. In the experiment study different evaluation strategies are considered. The proposed embedding strategy is compared to several state-of-art ensemble clustering algorithms and demonstrates superior performance.     

Positive state controllability of positive linear systems

Controllability of positive systems by positive inputs arises naturally in applications where both external and internal variables must remain positive for all time. In many applications, particularly in population biology, the need for positive inputs is often overly restrictive. Relaxing this requirement, the notion of positive state controllability of positive systems is introduced. A connection between positive state controllability and positive input controllability of a related system is established and used to obtain Kalman-like controllability criteria. In doing so we aim to encourage further study in this underdeveloped area.     

一种改进的小波域图像修复算法

针对全变分小波图像修复算法在平滑区易产生阶梯效应并且噪声抑制不充分的缺陷,提出一种新颖的小波域图像修复模型。通过优化一个全变分和图像梯度的二范数的能量泛函来实现小波域的图像修复,使得在去除噪声的同时较好地保留了图像的边缘,在平滑区域削弱了阶梯效应,并利用有限差分法对所建立的扩散方程进行数值求解。实验结果表明:所提方法对于不同丢失比例的图像以及噪声图像都取得了较好的修复效果,尤其当小波系数丢失率较高时更为明显。     

Total-FETI domain decomposition method for solution of elasto-plastic problems

In this paper we present an algorithm for the parallel solution of the rate-independent elasto-plastic problems with kinematic hardening. We assume the von Mises plastic criterion and the associated plastic flow rule. The time discretization is based on the implicit Euler method. The corresponding one-time-step problem is formulated in the incremental form with respect to the unknown displacement and discretized spatially by the finite element method. We use an ‘external’ algorithm based on a linearization of the elasto-plastic stress–strain relation by the corresponding tangential operator and we parallelize the arising linearized problem by the Total-FETI method. The numerical experiments were carried out using our novel C/C++ library FLLOP (FETI Light Layer On top of PETSc) at HECToR supercomputer located at EPCC, UK.     

脑MR图像分割和偏移场矫正的耦合水平集模型

脑核磁共振(MR)图像因需要偏移场矫正,传统分割方法很难获得准确的分割结果。针对这一问题,首先构造一组基函数拟合偏移场以保证偏移场的光滑特性,再将其融入到高斯概率密度函数中,结合统计分类准则建立脑MR图像的分割和偏移场矫正的能量方程,最后将该能量方程引入到三相位水平集的变分框架中得到脑MR图像的分割和偏移场矫正的耦合模型。实验表明该方法在得到准确的分割结果同时还可以得到较好的恢复结果。     

基于完全加权关联规则挖掘和查询扩展的信息检索

将完全加权关联规则挖掘技术应用于信息检索,提出一种基于完全加权关联规则挖掘和查询扩展的信息检索模型,重点阐述模型的设计思想及其算法和实现的关键技术.实验结果表明,该模型有效,能提高信息检索性能,有很高的实际应用价值和推广前景.     

基于双种群的小生境差分进化算法

将非线性方程组的求解问题转化为函数优化问题,当方程组有多个解时,它的适应值函数就是具有多个最优解的多峰函数.为此,提出了基于双种群的小生境差分进化算法.在该算法中,进化在两个不同的子群间并行进行,通过使用不同的变异策略,实现种群在解空间具有尽可能分散的探索能力的同时在局部具有尽可能细致的搜索能力.通过子群重组实现子群间的信息交换,然后引入小生境淘汰机制.对典型测试函数的优化结果表明,该算法能找到全部解,而且精度好.     

对一种向前安全群签名体制的密码学方法

对陈少真等提出的一种有效取消的向前安全群签名方案进行了密码学分析,首先指出该群签名体制存在错误的模运算及冗余数据,效率不高。其次,指出该群签名体制是不安全的,群管理员可以伪造能够通过验证的群签名。