搜索资源列表
polar-3gpp-matlab
- This code is intended to provide a reference model for the standard and has been written with a focus on correctness, rather than on simulation speed. This code is also intended to provide a platform for research on enha
class09
- 自己实现的一个LCS最长公共子序列算法，参考算法导论第三版进行实现(An LCS longest common subsequence algorithm to achieve their own, refer to the third edition of Introduction to Algorithms were realized)
SX12xxDrivers-V2.1.0(lora注释)
- lora 通讯 国际通用准协议代码 能够透传数据，最远距离能够达到20公里，内容为标准的c语言编写的协议范本(Lora communication international general quasi-protocol code can transmit data, the longest distance can reach 20 kilometers, the content of the standard C languag
GMT 0005-2012 随机性检测规范PDF
- 国密随机数规范，用于国密局随机数检测，按照规范开发(GM 0005 doc [01] Frequency [02] Block Frequency [03] Cumulative Sums [04] Runs [05] Longest Run of Ones [06] Rank [07] Discrete Fo
FIFO先进先出调度算法（含代码截图）
- 最简单的分页替换算法就是先进先出算法，当每次有新的分页需要调入时，会选择调入内存时间最久的分页换出。有两种实现的方法：第一种是记录每个分页被调入到页框的时间，当每次需要换出分页时，会找到调入时间最早的一页，也就是在主存储器中存在最久的分页。另外一种方式就是利用FIFO队列来实现，当要进行分页替换时，就把队列最前端的分页换出，再把要调入的分页放到队列的末端。(The simplest paging replacement algorith