非合作流速与拥塞控制博弈的应用

针对Internet用户的贪婪行为,引入非合作博弈理论,为非合作网络中的流速与拥塞控制行为建立模型,论证了上述博弈模型中Nash均衡点的存在性和惟一性.在分析了求解Nash均衡点解析解的基础上,设计实现了一种分布式流速控制算法(FCAG-SL).仿真实验表明,FCAG-SL算法具有良好的收敛性,应用流可以获得比其他拥塞控制算法更高的效用和整个系统的效用,验证了算法的可行性和有效性.     

基于系统动力学的区块链技术扩散机制研究

区块链技术凭借其去中心化、去信任化及不可篡改等优势,一经提出便引起了学术界和业界的广泛关注.然而区块链技术发展中也遇到了如政府监管难、行业标准化不完善及违规违法行为频发等挑战.社会各界对于区块链技术发展前景各执己见,政府提出的各类扶植与管制政策对区块链技术发展的影响及其程度尚不明确.基于此,对区块链这一典型的共性技术扩...     

空域色噪声背景下双基地MIMO雷达角度估计

空域有色噪声会导致现有多输入多输出(multiple input multiple output, MIMO)雷达算法性能下降, 甚至完全失效。针对空域色噪声背景下双基地MIMO雷达联合波离角(direction of departure, DOD)和波达角(direction of arrival, DOA)估计问题, 分析了现有算法失效的原因。考虑到匹配滤波后无噪协方差矩阵的低秩特性、色噪声协方差矩阵的稀疏特性以及MIMO雷达数据的多维结构特性, 提出一种基于张量分析的角度估计算法。首先, 构造角度估计的协方差张量, 通过去除协方差张量中受噪声协方差影响的元素对色噪声进行抑制。其次,利用张量填充技术对无噪协方差矩阵进行恢复。然后,利用平行因子分解获得目标角度的方向矩阵。最后, 采用最小二乘算法对目标的DOA和DOD进行拟合。仿真结果表明, 所提算法对色噪声不敏感, 且无孔径损失。相比现有矩阵及张量分析算法, 所提算法具有更高的估计精度。     

可重构视频阵列处理器测试平台设计与实现

针对可重构视频阵列处理器的设计要求及传统测试方法测试视频编解码系统时速度慢、精度低和可观测性不强的问题。开发了基于Qt的用户界面,设计实现了以现场可编程门阵列(Field programmable gate-array,FPGA)为核心的软硬件协同测试平台。在PC端实现以软件仿真为基础的数据传输与图像重现,在FPGA端实现以可重构视频阵列处理器为基础的视频编解码算法并行映射。实验结果表明,在工作频率为100 MHz时,FPGA与PC之间可正确传输数据并满足算法测试时不同测试用例的更换需求,具有较好的可观测性。     

The industrial asymmetry of the stock price prediction with investor sentiment: Based on the comparison of predictive effects with SVR

As a representative emerging financial market, the Chinese stock market is more prone to volatility because of investor sentiment. It is reasonable to use efficient predictive methods to analyze the influence of investor sentiment on stock price forecasting. This paper conducts a comparative study about the predictive performance of artificial neural network, support vector regression (SVR) and autoregressive integrated moving average and selects SVR to study the asymmetry effect of investor sentiment on different industry index predictions. After studying the relevant financial indicators, the results divide the Shenwan first-class industries into two types and show that the industries affected by investor sentiment are composed of young companies with high growth and high operative pressure and there are a great number of investment bubbles in those companies.     

轨道分析解的改进方法及其应用

主要介绍一种通过改进各类轨道摄动项的表达形式,以优化计算效率的轨道分析解改进方法。以低地球轨道为例,阐述了轨道分析解改进后的具体算法,并通过数值仿真分析验证了算法的有效性和实用性。算法以第一类无奇点根数作为轨道状态量,采用开普勒轨道根数计算各类摄动力的长期、长周期和短周期项,通过较简单的组合形式计算无奇点根数的对应摄动项,实现在保持分析解精度和消除小偏心率奇点的同时,提高计算效率。仿真结果表明,分析解算法的模型精度在1E-5量级,符合一阶分析解理论精度的预期;同时计算速度达到传统分析解算法的4倍左右,可有效提升空间碎片轨道预报的计算效率,具有较强的工程应用价值。     

A New Upper Bound on the Order of Affine Sub-families of NFSRs

Journal of Systems Science and Complexity - Nonlinear feedback shift registers (NFSRs) are widely used as building blocks in the design of stream ciphers. Let NFSR(f) be an NFSR with the...     

基于故障风险标尺的复杂装备健康状态分类模型

针对复杂装备故障呈现出多重性、相关性及模糊性的特点,本文分析了装备健康状态演化规律,利用自适应模糊神经网络、故障模式、影响及危害性分析构建故障风险标尺,实现了对复杂装备故障风险程度的定量化描述及装备健康状态的分类。通过实验分析,本文提出的模型相比于传统的故障预测以及故障风险程度定量方法具有显著优势,实现了对装备从设计生产、部署使用以及退役报废全寿命周期的动态反馈,对提高复杂装备综合保障能力具有重要意义。     

Experimental studies on oxidizing removal of Cyclops of zooplankton

0 IntroductionCyclops couldn’t be effectively inactivated by theconventional disinfection such as chlorination due to itsstronger resistance to oxidation.In addition,the motilityof Cyclops makes it easily penetrate sand filter into theclean water tank in waterworks , even municipal servicepipe .Adult Cyclops , with body length of one to severalmillimeters, may be caught by naked eye to bring con-sumers unsanitary sense and may become disease trans-mission mediumas the host of pathogenic para…     

A buffer insertion and simultaneous sizing timing optimization algorithm

A path-based timing optimization algorithm for buffer insertion and simultaneous sizing is proposed. Firstly, candidate buffer insertion location and buffer size for each branch in a given routing path were obtained via localized timing optimization. Then, through evaluating each potential insertion against design objectives, potential optimal buffer insertion locations and sizes for the whole routing tree were determined. At last, by removing redundant buffer insertion operations which do not maximize S （ so ）, given timing requirements are finally fulfilled through minimum number of buffers.