检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]山西大学电子信息工程系,山西太原030013 [2]山西大学电力工程系,山西太原030013
出 处:《计算机仿真》2016年第4期304-307,共4页Computer Simulation
摘 要:在对高速无线局域网中大数据传输的内存安全监测方法研究过程中,采用当前的算法进行安全监测时感知节点容易受到外界因素的干扰,存在监测误差大的问题。为解决上述问题,提出了一种改进TOP-K算法的高速无线局域网中大数据传输内存安全监测方法。上述方法先利用TOP-K算法分析了无线局域网中大数据传输时过滤器的鲁棒性,设定鲁棒过滤器的最优阈值,约束了表述形式,并建立了高速无线局域网络大数据传输模型,依据无线局域网中大数据传输期望的最优值和感知的时空相关性,计算大数据传输的过滤器失败概率,同时以无线局域网中大数据传输的内存安全为优化目标对鲁棒过滤器的最优阈值进行验证,促使感知数据大于大数据传输的内存监测阈值概率的紧上界,融合于抽样的近似簇原理监测高速无线局域网中大数据传输的内存。仿真结果证明,改进TOP-K算法的高速无线局域网中大数据传输的内存安全监测精确度高,具有良好的安全稳定性。The paper proposed a method for memory safety monitoring based on modified TOP - K algorithm. The firstly, we used the TOP - K to analyze the robustness of filter during the large data transmission in high - speed wireless. By setting the optimal threshold of robust filter and restraining the expression form, we established the mod- el of large data transmission. In terms of spatial - temporal correlation of optimal and perceptive date of large data transmission, we could calculate the failure probability of filter. Meanwhile, the optimal threshold of robust filter was verified in the aim of transmission safety. It prompted the perceptive data larger than the sharp upper bound of thresh- old value probability of memory monitoring. The memory of large date transmission was monitored based on approxi- mate cluster theory integrated with sampling. The simulation results show that memory safety monitoring based on modified TOP - K algorithm has high precision, safety and stability.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.248.120