Inj0在Top上的Monadicity

本文主要证明了全体内射Ｔ₀－空间及强代数映射构成的范畴Ｉｎｊ₀恰是Ｅｉｌｅｎｂｅｒｇ－Ｍｏｏｒｅ范畴Ｔｏｐ^Ｔ,这里Ｔ是Ｔｏｐ与Ｓｌａｔ之间的一对偶伴随导出的ｍｏｎａｄ,由此推出Ｉｎｊ₀在Ｔｏｐ上是ｍｏｎａｄｉｃ的．     

向量集值映射的共轭对偶

借助抽象算子将共轭映射的概念的到抽象空间,引入了集值映射的共轭映射和次梯度,据此讨论了集值映射共轭对偶的全局稳定性。     

自均衡相位特性的超导滤波器小型化设计

提出了一种具有多个传输零点的高温超导滤波器小型化设计方法。该滤波器由十个慢波交叉指结构谐振器和三个自均衡CQ跨线结构组成,其中一个CQ结构通过产生一对实轴上的传输零点实现相位均衡,另外两个CQ结构通过产生两对虚轴上的传输零点实现滤波器的高频率选择性。滤波器中心频率为1,720MHz,带宽为10MHz,通带外陡峭度为40d B/MHz,通带内回波损耗为23d B,且在60%的通带内具有平坦的群时延响应。在Mg O衬底上采用DBCO高温超导薄膜制作十阶超导滤波器,并在77K温度下进行测试,最终得到了良好的带外抑制性能和平坦的群时延特性。测试结果与仿真结果基本一致,说明所提出的设计方法是有效的。     

Halpern Iteration in CAT（k） Spaces

In this paper we show that an iterative sequence generated by the Halpern algorithm converges to a fixed point in the case of complete CAT(κ) spaces. Similar results for Hadamard manifolds were obtained in [Li, C., López, G., Martín-Márquez, V.: Iterative algorithms for nonexpansive mappings on Hadamard manifolds. Taiwanese J. Math., 14, 541–559 (2010)], but we study a much more general case. Moreover, we discuss the Halpern iteration procedure for set-valued mappings.     

一致光滑Banach空间中Ф-半压缩映射具误差Mann迭代收敛定理的注释

文章在一致光滑Banach空间,获得了广义LipschitzΦ-半压缩映射带误差的Mann迭代收敛定理.该结果改进并拓广了文献[1,7,10-12]中相应的结果.     

一种双重变换的二维图像加密算法

提出了一种改进的双重加密算法,利用新构造的位置置乱方法将二维矩阵中行和列映射到一维向量中,然后采用Logistic映射产生一组伪随机序列,将伪随机序列由小到大进行排序,对排序后的位置以集合序列的形式记录下来,形成密钥流;最后对一维向量按照密钥流形成的索引值进行重新排列,重排后的一维向量转换为与原始图像矩阵大小相同即得到加密图像。实验结果表明,该算法具有密钥空间大,加密后直方图分布具有白噪声的特性,提高了图像传输的安全性。     

一维六方压电准晶三角形孔边裂纹反平面问题

通过引入合适的数值保角映射,利用Stroh型公式研究一维六方压电准晶中正三角形孔边裂纹的反平面问题,给出在电非渗透边界条件下三角形孔边裂纹尖端的场强度因子和能量释放率。通过数值算例,讨论场强度因子和能量释放率随缺陷几何尺寸和力电荷载的变化规律。结果表明:随孔边裂纹长度的增加,场强度因子先急剧增加后减小,并趋于定值1,正三角形孔洞的尺寸对其影响可忽略不计;声子场和相位子场机械载荷总是促进裂纹扩展,而电位移对裂纹的扩展极大地依赖于声子场和相位子场载荷的大小。     

偏序Menger PSM-空间中的耦合重合点定理

引入Menger概率S-度量空间的概念,研究其拓扑性质,基于混合g-单调映射的概念,在偏序Menger PSM-空间中,证明了自映象对满足?-压缩条件下的耦合重合点和耦合公共不动点定理和推论,并给出例子验证新结果的有效性.     

不分明化sp-拓扑空间及范畴FSPTop的拓扑性

基于连续逻辑值语义,研究了不分明化sp-拓扑空间,讨论了不分明化的sp-开集,sp-邻域,sp-闭包及sp-内部等性质,给出了不分明化sp-连续映射的概念,引入了范畴FSPTop,证明了范畴FSPTop是范畴Set上的拓扑范畴。     

A fast image encryption algorithm based on only blocks in cipher text

In this paper, a fast image encryption algorithm is proposed, in which the shuffling and diffusion is performed simul- taneously. The cipher-text image is divided into blocks and each block has k x k pixels, while the pixels of the plain-text are scanned one by one. Four logistic maps are used to generate the encryption key stream and the new place in the cipher image of plain image pixels, including the row and column of the block which the pixel belongs to and the place where the pixel would be placed in the block. After encrypting each pixel, the initial conditions of logistic maps would be changed ac- cording to the encrypted pixel＇s value; after encrypting each row of plain image, the initial condition would also be changed by the skew tent map. At last, it is illustrated that this algorithm has a faster speed, big key space, and better properties in withstanding differential attacks, statistical analysis, known plaintext, and chosen plaintext attacks.