关于半收敛问题的探讨

针对实际CT系统中的不完全数据图像重建算法半收敛问题,分析了迭代外插算法收敛性与引入的参数因子、已知的检测数据的关系,并给出了改进的迭代外插算法.数值实验结果表明迭代外插算法迭代过程有时是发散的,存在半收敛问题,而改进的迭代外插算法是收敛的.     

带子矩阵约束的二次逆特征值问题的最小二乘埃尔米特广义斜哈密顿矩阵迭代解

针对带子矩阵约束的二次逆特征值问题的最小二乘埃尔米特广义斜哈密顿结构矩阵解问题,给出了一种共枙梯度迭代算法。首先提出了带子矩阵约束的二次逆特征值问题的最小二乘问题及其最佳逼近问题;然后分别给出了基于共轭梯度的迭代算法,证明了算法的收敛性。对于任意初始约束矩阵,在不存在舍入误差的情况下,用该迭代算法可以在有限步迭代中得到迭代解。最后,给出了一个数值实例,数值实例证明了所提算法的有效性。     

求解鞍点问题的一种修正对称SOR-like算法

在SOR-like迭代算法的基础上,通过选取预处理矩阵和待定参数来加速该迭代算法,构造了一种求解鞍点问题的修正对称SOR-like迭代算法,简记为MSSOR-like算法,并研究了新算法的收敛性.数值实验表明新算法是可行且有效的.     

中心对称线性互补问题的一类迭代算法

在考虑中心对称矩阵可约性的基础上,运用矩阵分裂理论,分别提出求解中心对称线性互补问题的对三角分裂松驰迭代算法和对三角分裂松驰迭代算法,并对2种算法进行收敛分析和数值实验.结果表明,当线性互补问题的系数矩阵对角元为正的H-矩阵时,2种算法都全局收敛,所得迭代阵的谱半径都为0.5,比传统的Jacobi分裂迭代算法和Gauss-seidel迭代算法的收敛速度都好.新算法节约了计算量与计算机的存贮空间,较大地提高了计算效率.     

基于迭代收缩算法的稀疏人脸识别

为了获得更加理想的人脸识别效果,提出一种基于迭代收缩算法的稀疏人脸识别方法.首先在研究现有的迭代软阈值算法的基础上,将迭代广义迭代收缩算法用于解决lp-数非凸稀疏模型求解问题,然后将该算法用于人脸识别,最后采用仿真实验测试算法的性能.实验结果表明,该算法的精确度明显优于其他算法.     

一种改进的快速迭代阈值选择算法

针对迭代阈值选择算法每次迭代计算灰度阈值的过程存在大量重复计算的问题,提出了基于均值累计和频次累计的快速迭代阈值选择算法。对快速迭代阈值选择算法和迭代阈值选择算法阈值计算的时间开销及图像二值化分割进行了实验分析,结果表明:文中提出的快速迭代阈值选择算法可有效的对实验图像进行二值化,该算法可显著降低迭代过程的时间开销。当图像尺寸达到10 000*10 000时,快速迭代阈值选择算法的时间消耗可降低至迭代阈值选择算法的10%,验证了快速迭代阈值算法的有效性。     

一类网络k-中心选址问题的改进算法

为解决基于城市道路交通网络的应急设施选址问题,建立了此问题的网络k-中心选址抽象模型。针对此模型在分析研究已有算法的基础上,设计了一种具有多项式时间的改进置换迭代算法,证明了算法迭代的有效性,分析了算法的计算复杂度,并利用实例进行了对比分析。实例分析表明,改进的置换迭代算法降低了受限p-中心的并行迭代算法中的网络中心置换的条件,而算法的效率有明显的提高。     

基于平移预条件技术的改进超松弛迭代图像复原

图像复原问题常常可转化为大型线性系统的求解问题.为解决超松弛迭代算法在求解大型稀疏线性系统时的收敛不稳定问题,提出了一种改进的超松弛迭代算法.通过平移预条件技术将超松弛迭代的迭代矩阵进行改进以避免奇异,研究了改进算法的收敛性和松弛参数的取值范围.在两个实际图像复原问题上的数值实验结果表明,改进算法是稳定和有效的.     

压缩的Grassmann-Rayleigh商迭代

Grassmann-Rayleigh商迭代是Rayleigh商迭代的推广形式,它能计算一个p-维不变子空间,当子空间中部分Ritz值比其它Ritz值收敛更快时,算法奇异.针对算法奇异的问题,提出了一种压缩的Grassmann-Rayleigh商迭代,新算法在保持算法立方次的收敛速度的同时克服了算法奇异的问题并节省了计算...     

一个求解P*(κ)线性互补问题的高阶Dikin型仿射尺度算法

对于P*(κ)线性互补问题提出了一个新算法———高阶Dikin型仿射尺度算法.算法的每步迭代,基于线性规划Dikin原始———对偶算法思想来求解一个线性方程组得到迭代方向,再适当选取步长,使算法具有多项式迭代复杂性.     

Security and privacy issues in electronic health network

Electronic health network(EHN) is an information system providing functions involved in e-health. In this paper, we devise mechanisms covering three important security and privacy issues of EHN including trust management, privacy preserving, and data sharing. First, we propose an authenticated key agreement scheme based on hierarchical identity-based signature(HIBS). We abstract a hierarchical architecture from the social network architecture of EHN. To support large-scale scenarios, we introduce a virtual signature generation phase into traditional HIBS, thus our scheme will be efficient even the depth is quite big. Second, we propose a fast data searching scheme based on symmetric searchable encryption(SSE). To improve the searching efficiency, we introduce a two-level cache structure into the traditional SSE. Third, we propose an access control scheme based on hierarchical identitybased encryption(HIBE). To make it a fine-grained scheme, we organize the data owner’s file in hierarchy and introduce a virtual key generation phase to traditional HIBE. Also, the scheme can provide delegation and revocation functions easily. Besides, our schemes guarantee known-key secrecy, forward secrecy, and antidirection secrecy and possess the resistance capability to collude-attack. Evaluation results show that our scheme indeed achieves the security and efficiency.     

一种改进的定向代理签名方案

在通常的代理签名方案中，任何人都可以验证代理签名的有效性。在定向代理签名方案中，由原始签名人指定一个人作为签名的接收者，以此来防止签名的滥用。当代理签名人产生签名后，只有指定的接收者可以对签名进行验证，进而接受签名。分析了Dai等定向代理签名方案，它不满足不可伪造性，即原始签名人可以成功伪造代理签名人的代理签名。为此，提出了改进的定向代理签名方案，该方案具有不可伪造性，从而有效地防止原始签名人对代理签名人进行恶意攻击，并将其推广到代理多签名方案中。     

An Identity-Based Strong Designated Verifier Proxy Signature Scheme

0 IntroductionIn 1996 ,Jakobsson, Sako and Impagliazzo introduced anew pri mitive called designated verifier proofs[1]. Suchproofs enable a prover Signy to designate who will be con-vinced by a proof .Furthermore,Jakobsson,Sako and Impa-gliazzo proposed a designated verifier signature. Designatedverifier signatures provide authentication of a message, with-out having the non-repudiation property of traditional signa-tures . They convince one-and only one-specified recipient thatthey are va…     

Analysis and Improvement on a Hash-Based Authentication Scheme for Multi-Server Architecture

In order to meet people's demand for various types of network services, researchers have conducted extensive research on authentication schemes for multi-server architecture. Although various schemes have been proposed, most of them still have safety defects and fail to meet safety requirements. Recently, Haq et al presented an efficient Hash-based authenticated key agreement scheme for multi-server scheme and claimed that their scheme can withstand all well-known attacks. However, we find that their scheme is vulnerable to replay attack, tracking attack and malicious server impersonation user attack. Then we propose an improved scheme. We also analyze the security of the improved scheme and compare with Haq et al's scheme in security and computational efficiency. Furthermore, we use the AVISPA(Automated Validation of Internet Security Protocols and Applications) tool to verify the security of the improved scheme.     

New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem

During the last two decades, there has been intensive and fast development in Multivariate Public Key Cryptography(MPKC), which is considered to be an important candidate for post-quantum cryptography. However,it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme(especially an encryption scheme) employing the existing trapdoor construction. In this paper, we propose a new key-exchange scheme and an MPKC scheme based on the Morphism of Polynomials(MP) problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem,namely the Decisional Multivariate Diffie-Hellman(DMDH) problem derived from the MP problem. The proposed key agreement is one of several non-number-theory-based protocols, and is a candidate for use in the post-quantum era. More importantly, by slightly modifying the protocol, we offer an original approach to designing a secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency,and seems competitive with traditional MPKC schemes.     

一种安全高效的椭圆曲线代理签名方案

张宁等人于2005年提出一个安全的基于椭圆曲线的代理签名方案．通过对此方案的研究，提出一个新的安全且高效的代理签名方案．新方案除了具备原方案的所有优点外，还具备签名速度快的特性．     

一种安全高效的椭圆曲线代理签名方案

张宁等人于2005年提出一个安全的基于椭圆曲线的代理签名方案．通过对此方案的研究，提出一个新的安全且高效的代理签名方案．新方案除了具备原方案的所有优点外，还具备签名速度快的特性．     

Attack on an Efficient Certificateless Aggregate Signature without Pairing

A Certificateless Aggregate Signature(CLAS) scheme was proposed by Qu and Mu recently, which was published in "Int J. Electronic Security and Digital Forensics, 2018, 10(2)". They used discrete logarithm to ensure the scheme's security. However,we show by formulating an attack that their CLAS scheme cannot defend against Type I adversary. Furthermore, we point out an error that exists in the signature simulation of their security proof.After that we give a correct signature simulation for the security proof. Finally, to resist the Type I attack, we present two methods for improving Qu et al's CLAS scheme. Moreover, the second improving method can elevate the trust level of Qu et al's CLAS scheme to the highest trust level: Level 3.     

基于AOS算法的彩色图像测地活动轮廓模型的改进与实现

测地活动轮廓模型作为一种图像分割方法,具有许多优点,但其数值实现较为复杂.本文首先讨论了测地活动轮廓模型及其AOS算法,其次将该算法应用于彩色图像的轮廓提取,并提出了一个改进的边界检测方法,最后给出了AOS算法的一个具体实现.实验结果表明,改进的边界检测方法与已有的方法相比,在效率上和效果上有较大提高,而结合AOS算法后,在算法效率上又有了进一步的提升.     

A Cross-Layer Cooperative Jamming Scheme for Social Internet of Things

In this paper, we design a friendly jammer selection scheme for the social Internet of Things(IoT). A typical social IoT is composed of a cellular network with underlaying Device-to-Device(D2D) communications. In our scheme, we consider signal characteristics over a physical layer and social attribute information of an application layer simultaneously. Using signal characteristics, one of the D2D gadgets is selected as a friendly jammer to improve the secrecy performance of a cellular device. In return, the selected D2D gadget is allowed to reuse spectrum resources of the cellular device. Using social relationship, we analyze and quantify the social intimacy degree among the nodes in IoT to design an adaptive communication time threshold. Applying an artificial intelligence forecasting model, we further forecast and update the intimacy degree, and then screen and filter potential devices to effectively reduce the detection and calculation costs. Finally, we propose an optimal scheme to integrate the virtual social relationship with actual communication systems. To select the optimal D2D gadget as a friendly jammer, we apply Kuhn-Munkres(KM) algorithm to solve the maximization problem of social intimacy and cooperative jamming.Comprehensive numerical results are presented to validate the performance of our scheme.