Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with \"least
recently used\" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses. Platform: |
Size: 8260 |
Author:洋场河 |
Hits:
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with "least
recently used" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses. Platform: |
Size: 8192 |
Author:洋场河 |
Hits:
Description: 设计一个虚拟存储区和内存工作区,并使用下列算法计算页面失效次数.
（1） 进先出的算法（FIFO）
（2） 最近最少使用的算法（LRU）
（3） 最佳淘汰算法(OPT)
在本实验中，页地址流长度为320，页面失效次数为每次访问相应指令时，该指令所对应的页不在内存的次数。
-Design of a virtual memory storage area and work area, and use the following algorithm for calculating the number of page failure. (1) into the algorithm, first-out (FIFO) (2) at least recently used algorithm (LRU) (3) the best out of algorithm (OPT ) In this experiment, the page address stream length of 320, the page number for each failure to visit the corresponding instructions, the instructions corresponding to the number of pages is not memory. Platform: |
Size: 2048 |
Author:lishuai |
Hits:
Description: 本课题的目的是要实现缺页处理程序，这需要在适当的时候将某些页面替换出/入。为了减少缺页和将页面从内存淘汰到磁盘的次数，要求你实现五种页面替换算法。
NRU（Not Recently Used）算法 SC（Second Chance）算法
Clock算法 Working Set算法 Aging算法
-The purpose of this project is to achieve the missing page handling procedures, which needs to be at an appropriate time to replace some of the pages of entry/exit. In order to reduce the missing pages and pages of memory out to disk from the number, asking you to achieve the five page replacement algorithm. NRU (Not Recently Used) algorithm SC (Second Chance) algorithm Clock algorithm Aging Algorithm Working Set Algorithm Platform: |
Size: 572416 |
Author:gavinfeng |
Hits:
Description: 2.设计一个虚拟存储区和内存工作区，并使用下述算法计算访问命中率。
1) 最佳置换算法（Optimal）
2) 先进先出法（Fisrt In First Out）
3) 最近最久未使用（Least Recently Used）
4) 最不经常使用法（Least Frequently Used）
5) 最近未使用法（No Used Recently）
其中，命中率＝１－页面失效次数／页地址流长度。
试对上述算法的性能加以较各：页面个数和命中率间的关系；同样情况下的命中率比较。
-2. To design a virtual memory storage area and work area, and access using the following algorithm to calculate the hit rate. 1) The best replacement algorithm (Optimal) 2) FIFO (Fisrt In First Out) 3) most recently from lack of use (Least Recently Used) 4) the least frequently used method (Least Frequently Used) 5) does not use a recently (No Used Recently) where hit rate = 1- invalid page number/page address stream length. Test the performance of the algorithms to be compared with each: the page number and the relationship between hit rate the same hit rate in case of comparison. Platform: |
Size: 2048 |
Author:zhongkeli |
Hits:
Description: 强壮的人脸识别系统，发表于cvpr2011年，程序是应用matlab实现-Recently the sparse representation (or coding) based classifi cation (SRC) has been successfully used in face recognition. In SRC, the testing image is represented as
a sparse linear combination of the training samples, and
the representation fi delity is measured by the � 2-norm or
� 1-norm of coding residual. Such a sparse coding model
actually assumes that the coding residual follows Gaus-
sian or Laplacian distribution, which may not be accurate
enough to describe the coding errors in practice. In this
paper, we propose a new scheme, namely the robust sparse
coding (RSC), by modeling the sparse coding as a sparsity-
constrained robust regression problem. The RSC seeks for
the MLE (maximum likelihood estimation) solution of the
sparse coding problem, and it is much more robust to out-
liers (e.g., occlusions, corruptions, etc.) than SRC. An
effi cient iteratively reweighted sparse coding algorithm is
proposed to solve the RSC model. Extensive Platform: |
Size: 1216512 |
Author:刘大明 |
Hits:
Description: 人脸识别的稀疏表示识别方法将稀疏表示的保真度表示为余项的L2范数，但最大似然估计理论证明这样的假设要求余项服从高斯分布，实际中这样的分布可能并不成立，特别是当测试图像中存在噪声、遮挡和伪装等异常像素，这就导致传统的保真度表达式所构造的稀疏表示模型对上述这些情况缺少足够的鲁棒性。而最大似然稀疏表示识别模型则基于最大似然估计理论，将保真度表达式改写为余项的最大似然分布函数，并将最大似然问题转化为一个加权优化问题-Recently the sparse representation (or coding) based classification (SRC) has been successfully used in face recognition. In SRC, the testing image is represented as a sparse linear combination of the training samples, and the representation fidelity is measured by the 𝑙 2-norm or 𝑙 1-norm of coding residual. Such a sparse coding model actually assumes that the coding residual follows Gaussian or Laplacian distribution, which may not be accurate enough to describe the coding errors in practice. In this paper, we propose a new scheme, namely the robust sparse coding (RSC), by modeling the sparse coding as a sparsityconstrained
robust regression problem. The RSC seeks for the MLE (maximum likelihood estimation) solution of the
sparse coding problem, and it is much more robust to outliers (e.g., occlusions, corruptions, etc.) than SRC. An efficient iteratively reweighted sparse coding algorithm is
proposed to solve the RSC model. Platform: |
Size: 18704384 |
Author:徐波 |
Hits:
Description: 本课题的目的是要实现缺页处理程序，这需要在适当的时候将某些页面替换出/入。为了减少缺页和将页面从内存淘汰到磁盘的次数，要求你实现五种页面替换算算法。NRU（Not Recently Used）算法SC（Second Chance）算法Clock算法Working Set算法Aging算法
-The purpose of this project is to achieve the page fault handler, this need at the appropriate time to replace some of the pages with entry/exit. Eliminated from memory to the disk number of times in order to reduce the missing pages and page asking you to five kinds of page replacement operator algorithm. NRU (Not Recently Used) algorithm SC Second Chance algorithm Clock algorithm Aging Working Set algorithm algorithm Platform: |
Size: 538624 |
Author:nanyi5452 |
Hits:
Description: 1.实现一个内存管理的伙伴算法，实现内存块申请时的分配和释放后的回收。
实验准备
用随机函数仿真进程进行内存申请，并且以较为随机的次序进行释放。对其碎片进行统计，当申请分配内存失败时区分实际空间不足和由于碎片而不能满足。
2.设计一个虚拟存储区和内存工作区，并使用下述算法计算访问命中率。
1) 最佳置换算法（Optimal）
2) 先进先出法（Fisrt In First Out）
3) 最近最久未使用（Least Recently Used）
4) 最不经常使用法（Least Frequently Used）
5) 最近未使用法（No Used Recently）
其中，命中率＝１－页面失效次数／页地址流长度。
试对上述算法的性能加以较各：页面个数和命中率间的关系；同样情况下的命中率比较。-1. A partner of the memory management algorithm to achieve a recovery after the application of the memory block allocation and release. Experimental preparation random function simulation process memory application, and released in a more random order. Statistics, when applications allocate memory failed to distinguish between the actual lack of space and because of the debris and can not meet its debris. Design a virtual memory storage area and workspace, access to the hit rate and use the following algorithm. 1) The best replacement algorithm (Optimal) 2) first-in, first-out method (Fisrt In First Out), 3) Recently the most-recently-used (Least Recently Used) 4) is not the most frequently used method (Least Frequently Used) 5) unused method recently (No Used Recently) which hit rate = 1- the number of page faults/page address stream length. The test of the performance of the above algorithm to be compared to the relationship between: page number and hit rate compare the hit rate in Platform: |
Size: 136192 |
Author:kk |
Hits:
Description: 对于串行FLASH芯片的存取操作，内核能够通过直接对芯片的读写来实现，但是较慢的芯片响应速度会使用读写响应时间加长，吞吐率降低。因此，内核通过保持一个称为数据缓冲区高速缓冲的内部数据缓冲区来减小对芯片的存取频度。高速缓冲含有最近被使用过的串行Flash的数据。
当从芯片中读数据的时候，内核试图先从高速缓冲中读取。如果数据已经在该高速缓冲中，则内核可以不必从芯片中读取数据。如果数据不在该高速缓冲中，则内核从芯片上读数据，并将其缓冲起来，这样下次使用时就不需要再从芯片中读取了。
但是，由于串行Flash的容量都比较大，将Flash的所有内容都缓冲在内存中是不可行的，只能将部分Flash的内容缓冲起来。所使用的算法试图把尽可能多的有效数据保存在高速缓冲中。-FLASH chip for serial access operation, the kernel can write directly on the chip to achieve, but the slower the response speed will use the chip to read and write response time longer, throughput decreases. Thus, by maintaining the internal kernel data buffer called the cache data buffer to reduce the chip access frequency. Cache containing recently been used serial Flash data.
When reading data the chip when trying to start the kernel cache read. If the data is already in the cache, then the kernel does not have to read the data the chip. If the data is not in the cache, then the kernel data read the chip, and buffer up, so the next time you use do not need to read the chip.
However, due to the relatively large capacity Serial Flash, Flash content will all have a buffer is not feasible, can only be part of the contents of the buffer up in Flash memory. The algorithm used to attempt as much valid data stored in the cache in. Platform: |
Size: 13312 |
Author:东东摩 |
Hits:
Description: LRC校验算法C语言程序
近日用到关于LRC检验算法，网上找了很多资料，其描述方式实在不敢恭维，为方便使用者特写下详细的计算过程，希望对你有所帮助。-LRC verification algorithm C language program
Recently used on the LRC test algorithm, the Internet to find a lot of information, the description of the way it is not flattering, for the convenience of the user features a detailed calculation process, I hope to help you. Platform: |
Size: 4096 |
Author:wenshaohua |
Hits:
Description: 老王最近承包了某市的造路工程，假设该市有 n 个地点，老王的任务就是连通这 n 个
地点。当然，由于各种原因，连通任意两个地点的代价是不一样的，于是老王请你帮忙设计
出一个算法，计算连通这 n 个地点所用的最小代价。
-Wang recently contracted a city road construction, assume that the city has n locations, Pharaoh s task is communication with the n
location. Of course, for various reasons, the communication costs of any two locations are not the same, so please help design Pharaoh
An algorithm to calculate the minimum cost of communicating these n locations used. Platform: |
Size: 1024 |
Author:ZSH |
Hits:
Search - not recently used algorithm