几种图像数据隐藏方法的比较研究

近年来,图像数据隐藏技术得到了突飞猛进的发展,得到了很多鼓舞人心的成果。在图像隐藏技术中,使用最多的图像嵌入规则有三种:加法嵌入规则、乘法嵌入规则以及基于融合技术的图像嵌入规则。本文对这三种图像嵌入规则的性能进行了分析和研究,通过比较我们发现,如果将图像隐藏过程看作是一个水印信道模型,则基于融合技术的图像嵌入规则所能隐藏的信息量远远高于另两种嵌入规则,而乘法嵌入规则其水印信道容量不受原始图像DCT系数标准差变化的影响,因此,在原始图像DCT系数标准差不稳定的情况下,采用乘法嵌入规则是一个好的选择。     

基于代数等价路径的一致P-函数非线性互补问题的可行内点算法

对一致P-函数非线性互补问题，提出了一种新的基于代数等价路径的可行内点算法，并讨论了计算复杂性．该算法可以在任一内部可行点启动，并且全局收敛；当初始点靠近中心路径时，此算法便成为中心路径跟踪算法，特别对于单调线性互补问题，总迭代次数为O（√nL），其中L是问题的输入长度。     

Isolated complex singularities and their CR links

In this paper, we discuss some recent studies on the complex structure of an isolated normal singularity by using the information from its link. We also give some open problems to be further pursued. Dedicated to Professor Sheng GONG on the occasion of his 75th birthday     

提高综合滤波器鉴别率的一种有效方法

提出一种提高综合滤波器鉴别率的有效方法，其做法是：对样本集在等相关峰条件下求解综合滤波器的同时，使样本集的互补样本满足零件相关峰条件，此方法把训练模式类同所有其它模式类在映射空间的距离拉大，有效地提高了综合滤波器的鉴别率，以取自同一手指纹为样本集，求解综合鉴别函数后，建立了指纹的实时模式识别系统，实验结果表明本文提出的改进方法对提高综合滤波器的鉴别率是非常有效的。     

物像互遮掩的彩虹全息记录

提出了一种使多个物体的再现像间有相互遮掩效果的彩虹全息记录方法。在主全息图记录光路中设置系列互补的挡光屏，对不同的物体分别进行记录；所得到的彩虹全息图再现时，左右移动观察，将看到不同物体的再现像在视场中逐渐交替出现，沿挡光屏边缘相互遮掩。给出了挡光屏的设置参数，并完成了“天狗袭日”彩虹全息图的设计和制作，获得了满意的效果。     

New smooth C-functions for symmetric cone complementarity problems

In this paper, with the help of the Jordan-algebraic technique we introduce two new complementarity functions (C-functions) for symmetric cone complementary problems, and show that they are continuously differentiable and strongly semismooth everywhere. The work was partly supported by the National Natural Science Foundation of China (10671010, 70471002).     

A Lower Bound on the Greedy Weights of Product Codes

A greedy 1-subcode is a one-dimensional subcode of minimum (support) weight. A greedy r-subcode is an r-dimensional subcode with minimum support weight under the constraint that it contain a greedy (r - 1)-subcode. The r-th greedy weight e _r is the support weight of a greedy r-subcode. The greedy weights are related to the weight hierarchy. We use recent results on the weight hierarchy of product codes to develop a lower bound on the greedy weights of product codes.     

Families of Dot-Product Snarks on Orientable Surfaces of Low Genus

We introduce a generalized dot product and provide some embedding conditions under which the genus of a graph does not rise under a dot product with the Petersen graph. Using these conditions, we disprove a conjecture of Tinsley and Watkins on the genus of dot products of the Petersen graph and show that both Grünbaum’s Conjecture and the Berge-Fulkerson Conjecture hold for certain infinite families of snarks. Additionally, we determine the orientable genus of four known snarks and two known snark families, construct a new example of an infinite family of snarks on the torus, and construct ten new examples of infinite families of snarks on the 2-holed torus; these last constructions allow us to show that there are genus-2 snarks of every even order n ≥ 18.     

混合互补判断矩阵一致性研究

给出混合互补判断矩阵一致性的定义和判别加性一致性的方法.定义了核算子、核矩阵,对带有精确数、三角模糊数和梯形模糊数的混合互补判断矩阵给出基于核矩阵的一致性调整方法,调整量可以是精确数也可以是模糊数.最后给出一个应用实例.     

Using Fox Derivatives in Treating Groups of the Form F/[R′, F]

For a factor group with respect to periodic part of a group of the form F/[R′, F], an embedding in the matrix group is defined. The criteria for a matrix to belong to an image of this group and for elements to be conjugate are specified. Some statements having a direct bearing on groups of the form in question are proved. Application of the results obtained allows us to refine the answer in [7] to a question by O. Chapuis concerning the universal classification of ∀-free soluble groups with two generators. Supported by RFBR grant No. 02-01-00293 and by FP “Universities of Russia” grant No. UR.04.01.227. __________ Translated from Algebra i Logika, Vol. 45, No. 1, pp. 114–125, January–February, 2006.