This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solve...This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.展开更多
In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary...In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.展开更多
针对结构化P2P(Peer to Peer)网络资源高效搜索问题,提出了一种基于新路由表的双向搜索chord路由算法。该算法为解决chord算法路由表中存在着大量冗余信息,查找资源效率低下等缺点,提出了一个新的路由表构造公式。该公式首次加入路由因...针对结构化P2P(Peer to Peer)网络资源高效搜索问题,提出了一种基于新路由表的双向搜索chord路由算法。该算法为解决chord算法路由表中存在着大量冗余信息,查找资源效率低下等缺点,提出了一个新的路由表构造公式。该公式首次加入路由因子概念,充分考虑了网络中节点个数和资源个数对路由表的影响,在不增加路由表项的前提下,不仅基本删除了路由表的冗余项,还实现了chord环的双向查找以减少平均查找跳数。实验仿真结果表明,该算法基本消除了路由表中的冗余信息,减少了平均查找跳数,有效地提高了资源的查找效率。展开更多
在滤波器组多载波(Filter Bank Multicarrier,FBMC)系统中,通常采用部分传输序列(Partial Transfer Sequence,PTS)方法来降低系统的峰均功率比(Peak-to-Average Power Ratio,PAPR),然而该方法在传输过程中需要携带边带信息,会降低频谱...在滤波器组多载波(Filter Bank Multicarrier,FBMC)系统中,通常采用部分传输序列(Partial Transfer Sequence,PTS)方法来降低系统的峰均功率比(Peak-to-Average Power Ratio,PAPR),然而该方法在传输过程中需要携带边带信息,会降低频谱利用率.对此提出了两点改进:在搜索最佳相位因子时,提出了新多层搜索方法,避免了相位因子的重复搜索,降低了计算复杂度;通过加入改进星座映射(Active Constellation Extension,ACE)方法,在接收端可以不需要边带信息即可快速解调出原始数据,虽然PAPR有所增加,但却显著提高了频谱利用率.通过计算和仿真验证了两个改进方案的有效性.展开更多
基金the National Science and Tech-nology Council,Taiwan for their financial support(Grant Number NSTC 111-2221-E-019-048).
文摘This study sets up two new merit functions,which are minimized for the detection of real eigenvalue and complex eigenvalue to address nonlinear eigenvalue problems.For each eigen-parameter the vector variable is solved from a nonhomogeneous linear system obtained by reducing the number of eigen-equation one less,where one of the nonzero components of the eigenvector is normalized to the unit and moves the column containing that component to the right-hand side as a nonzero input vector.1D and 2D golden section search algorithms are employed to minimize the merit functions to locate real and complex eigenvalues.Simultaneously,the real and complex eigenvectors can be computed very accurately.A simpler approach to the nonlinear eigenvalue problems is proposed,which implements a normalization condition for the uniqueness of the eigenvector into the eigenequation directly.The real eigenvalues can be computed by the fictitious time integration method(FTIM),which saves computational costs compared to the one-dimensional golden section search algorithm(1D GSSA).The simpler method is also combined with the Newton iterationmethod,which is convergent very fast.All the proposed methods are easily programmed to compute the eigenvalue and eigenvector with high accuracy and efficiency.
基金Supported by the National High Technology Research and Development Program(No.2011AA010803)the National Natural Science Foundation of China(No.U1204602)
文摘In order to improve the attack efficiency of the New FORK-256 function, an algorithm based on Grover's quantum search algorithm and birthday attack is proposed. In this algorithm, finding a collision for arbitrary hash function only needs O(2m/3) expected evaluations, where m is the size of hash space value. It is proved that the algorithm can obviously improve the attack efficiency for only needing O(2 74.7) expected evaluations, and this is more efficient than any known classical algorithm, and the consumed space of the algorithm equals the evaluation.
文摘针对结构化P2P(Peer to Peer)网络资源高效搜索问题,提出了一种基于新路由表的双向搜索chord路由算法。该算法为解决chord算法路由表中存在着大量冗余信息,查找资源效率低下等缺点,提出了一个新的路由表构造公式。该公式首次加入路由因子概念,充分考虑了网络中节点个数和资源个数对路由表的影响,在不增加路由表项的前提下,不仅基本删除了路由表的冗余项,还实现了chord环的双向查找以减少平均查找跳数。实验仿真结果表明,该算法基本消除了路由表中的冗余信息,减少了平均查找跳数,有效地提高了资源的查找效率。
文摘在滤波器组多载波(Filter Bank Multicarrier,FBMC)系统中,通常采用部分传输序列(Partial Transfer Sequence,PTS)方法来降低系统的峰均功率比(Peak-to-Average Power Ratio,PAPR),然而该方法在传输过程中需要携带边带信息,会降低频谱利用率.对此提出了两点改进:在搜索最佳相位因子时,提出了新多层搜索方法,避免了相位因子的重复搜索,降低了计算复杂度;通过加入改进星座映射(Active Constellation Extension,ACE)方法,在接收端可以不需要边带信息即可快速解调出原始数据,虽然PAPR有所增加,但却显著提高了频谱利用率.通过计算和仿真验证了两个改进方案的有效性.