计算机网络缓存侧信道能够间接体现计算机内部状态以及数据传输情况,其受攻击时,用户端信息数据存在泄露风险,因此提出一种基于马尔科夫的计算机网络缓存侧信道攻击检测方法。构建隐马尔科夫模型,对计算机网络缓存侧信道状态改变的概率...计算机网络缓存侧信道能够间接体现计算机内部状态以及数据传输情况,其受攻击时,用户端信息数据存在泄露风险,因此提出一种基于马尔科夫的计算机网络缓存侧信道攻击检测方法。构建隐马尔科夫模型,对计算机网络缓存侧信道状态改变的概率进行计算。通过Baum‐Welch算法估计隐马尔科夫模型最优参数,并计算缓存侧信道状态观测序列输出概率。比较缓存侧信道观测序列输出概率与设定的阈值,判断该序列为计算机网络缓存侧信道攻击信号的可能性,并引入平均信息熵判断计算机缓存侧信道状态是否存在异常,完成计算机网络缓存侧信道攻击检测。通过实验验证得出,该方法用于计算机网络缓存侧信道攻击检测的准确率高,误报率低,在遭受DDoS攻击(Distributed denial of service)时的检测时间较短,对计算机网络缓存侧信道攻击的防御与保护产生了积极影响。展开更多
This paper proposes the alternating direction method of multipliers-based infinity-norm(ADMIN) with threshold(ADMIN-T) and with percentage(ADMIN-P) detection algorithms,which make full use of the distribution of the s...This paper proposes the alternating direction method of multipliers-based infinity-norm(ADMIN) with threshold(ADMIN-T) and with percentage(ADMIN-P) detection algorithms,which make full use of the distribution of the signal to interference plus noise ratio(SINR) for an uplink massive MIMO system.The ADMIN-T and ADMIN-P detection algorithms are improved visions of the ADMIN detection algorithm,in which an appropriate SINR threshold in the ADMIN-T detection algorithm and a certain percentage in the ADMIN-P detection algorithm are designed to reduce the overall computational complexity.The detected symbols are divided into two parts by the SINR threshold which is based on the cumulative probability density function(CDF) of SINR and a percentage,respectively.The symbols in higher SINR part are detected by MMSE.The interference of these symbols is then cancelled by successive interference cancellation(SIC).Afterwards the remaining symbols with low SINR are iteratively detected by ADMIN.The simulation results show that the ADMIIN-T and the ADMIN-P detection algorithms provide a significant performance gain compared with some recently proposed detection algorithms.In addition,the computational complexity of ADMIN-T and ADMIN-P are significantly reduced.Furthermore,in the case of same number of transceiver antennas,the proposed algorithms have a higher performance compared with the case of asymmetric transceiver antennas.展开更多
With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical netwo...With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical networks,this paper proposes a bee colony optimization algorithm for routing and wavelength assignment based on directional guidance(DBCO-RWA)in satellite optical networks.In D-BCORWA,directional guidance based on relative position and link load is defined,and then the link cost function in the path search stage is established based on the directional guidance factor.Finally,feasible solutions are expanded in the global optimization stage.The wavelength utilization,communication success probability,blocking rate,communication hops and convergence characteristic are simulated.The results show that the performance of the proposed algorithm is improved compared with existing algorithms.展开更多
The 3x + 1 problem, is a math problem that has baffled mathematicians for over 50 years. It’s easy to explain: take any positive number, if it’s even, divide it by 2;if it’s odd, multiply it by 3 and add 1. Repeat ...The 3x + 1 problem, is a math problem that has baffled mathematicians for over 50 years. It’s easy to explain: take any positive number, if it’s even, divide it by 2;if it’s odd, multiply it by 3 and add 1. Repeat this process with the resulting number, and the conjecture says that you will eventually reach 1. Despite testing all starting values up to an enormous number, no one has proved the conjecture is true for all possible starting values. The problem’s importance lies in its simplicity and difficulty, inspiring new ideas in mathematics and advancing fields like number theory, dynamical systems, and computer science. Proving or disproving the conjecture would revolutionize our understanding of math. The presence of infinite sequences is a matter of question. To investigate and solve this conjecture, we are utilizing a novel approach involving the fields of number theory and computer science.展开更多
This scientific paper is a comparative analysis of two mathematical conjectures. The newly proposed -3(-n) - 1 Remer conjecture and how it is related to and a proof of the more well known 3n + 1 Collatz conjecture. An...This scientific paper is a comparative analysis of two mathematical conjectures. The newly proposed -3(-n) - 1 Remer conjecture and how it is related to and a proof of the more well known 3n + 1 Collatz conjecture. An overview of both conjectures and their respective iterative processes will be presented. Showcasing their unique properties and behavior to each other. Through a detailed comparison, we highlight the similarities and differences between these two conjectures and discuss their significance in the field of mathematics. And how they prove each other to be true.展开更多
文摘计算机网络缓存侧信道能够间接体现计算机内部状态以及数据传输情况,其受攻击时,用户端信息数据存在泄露风险,因此提出一种基于马尔科夫的计算机网络缓存侧信道攻击检测方法。构建隐马尔科夫模型,对计算机网络缓存侧信道状态改变的概率进行计算。通过Baum‐Welch算法估计隐马尔科夫模型最优参数,并计算缓存侧信道状态观测序列输出概率。比较缓存侧信道观测序列输出概率与设定的阈值,判断该序列为计算机网络缓存侧信道攻击信号的可能性,并引入平均信息熵判断计算机缓存侧信道状态是否存在异常,完成计算机网络缓存侧信道攻击检测。通过实验验证得出,该方法用于计算机网络缓存侧信道攻击检测的准确率高,误报率低,在遭受DDoS攻击(Distributed denial of service)时的检测时间较短,对计算机网络缓存侧信道攻击的防御与保护产生了积极影响。
基金This work was supported in part by the National Natural Science Foundation of China(NSFC)under grant numbers 61671047,61775015 and U2006217.
文摘This paper proposes the alternating direction method of multipliers-based infinity-norm(ADMIN) with threshold(ADMIN-T) and with percentage(ADMIN-P) detection algorithms,which make full use of the distribution of the signal to interference plus noise ratio(SINR) for an uplink massive MIMO system.The ADMIN-T and ADMIN-P detection algorithms are improved visions of the ADMIN detection algorithm,in which an appropriate SINR threshold in the ADMIN-T detection algorithm and a certain percentage in the ADMIN-P detection algorithm are designed to reduce the overall computational complexity.The detected symbols are divided into two parts by the SINR threshold which is based on the cumulative probability density function(CDF) of SINR and a percentage,respectively.The symbols in higher SINR part are detected by MMSE.The interference of these symbols is then cancelled by successive interference cancellation(SIC).Afterwards the remaining symbols with low SINR are iteratively detected by ADMIN.The simulation results show that the ADMIIN-T and the ADMIN-P detection algorithms provide a significant performance gain compared with some recently proposed detection algorithms.In addition,the computational complexity of ADMIN-T and ADMIN-P are significantly reduced.Furthermore,in the case of same number of transceiver antennas,the proposed algorithms have a higher performance compared with the case of asymmetric transceiver antennas.
基金supported in part by the National Key Research and Development Program of China under Grant 2021YFB2900604in part by the National Natural Science Foundation of China(NSFC)under Grant U22B2033,61975234,61875230。
文摘With the development of satellite communication,in order to solve the problems of shortage of on-board resources and refinement of delay requirements to improve the communication performance of satellite optical networks,this paper proposes a bee colony optimization algorithm for routing and wavelength assignment based on directional guidance(DBCO-RWA)in satellite optical networks.In D-BCORWA,directional guidance based on relative position and link load is defined,and then the link cost function in the path search stage is established based on the directional guidance factor.Finally,feasible solutions are expanded in the global optimization stage.The wavelength utilization,communication success probability,blocking rate,communication hops and convergence characteristic are simulated.The results show that the performance of the proposed algorithm is improved compared with existing algorithms.
文摘The 3x + 1 problem, is a math problem that has baffled mathematicians for over 50 years. It’s easy to explain: take any positive number, if it’s even, divide it by 2;if it’s odd, multiply it by 3 and add 1. Repeat this process with the resulting number, and the conjecture says that you will eventually reach 1. Despite testing all starting values up to an enormous number, no one has proved the conjecture is true for all possible starting values. The problem’s importance lies in its simplicity and difficulty, inspiring new ideas in mathematics and advancing fields like number theory, dynamical systems, and computer science. Proving or disproving the conjecture would revolutionize our understanding of math. The presence of infinite sequences is a matter of question. To investigate and solve this conjecture, we are utilizing a novel approach involving the fields of number theory and computer science.
文摘This scientific paper is a comparative analysis of two mathematical conjectures. The newly proposed -3(-n) - 1 Remer conjecture and how it is related to and a proof of the more well known 3n + 1 Collatz conjecture. An overview of both conjectures and their respective iterative processes will be presented. Showcasing their unique properties and behavior to each other. Through a detailed comparison, we highlight the similarities and differences between these two conjectures and discuss their significance in the field of mathematics. And how they prove each other to be true.
