As a future internet candidate, named Data Network (NDN) provides more efficient communication than TCP/IP network. Unlike TCP/IP, consumer requests in NDN are sent based on content, not the address. The previous study evaluated performance using simulator. In this research, we modeled system virtual nodes, making model relevant to real NDN. an essential component every router, content store (C...

RLE is very effective data compression algorithm for last many years. In this paper we proposed a modified and enhanced variation of RLE data compression algorithm. This replacement strategy will help to avoid long length strings with frequent different characters.

This article presents a single case study on the feasibility of using a low-cost and portable vision-based system (a Microsoft Kinect sensor) to monitor changes in movement patterns before and after a total hip replacement surgery. The primary subject was a male older adult with total hip replacement who performed two different functional tasks: walking and sit-to-stand. The tasks were recorded...

The cache replacement policy is one of the most important factors that affect the cache performance. With the trend of increasing associativity in second-level caches, implementing an efficient replacement algorithm becomes more important than just eliminating conflict misses. The LRU cache replacement algorithm has been known to work well in a single processor system by reducing the cache miss...

the cu, pb, zn, ag-au deposit of amensif is located on the northern flank of the western high atlas. this deposit is hosted in lower cambrian carbonate bars and is structurally controlled by ne-sw to e-w trending fault structures and is spatially associated with the permian 273 ma azegour granite. ore reserves are around 0.5 mt and grades are 3.21% zn, 0.58% pb, 0.86% cu with 83.31 ppm ag and 0...

We prove that the product replacement graph on generating k-tuples of a simple group contains a large connected component if k ≥ 3. This is related to the recent conjecture of Diaconis and Graham. As an application, we also prove that the output of the product replacement algorithm (see [CLMNO]) in this case does not have a strong bias.

We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a system, we show that the total cost of any replacement algorithm is bounded by the total costs of evicted blocks plus the total cost of the optimal off-line algorithm (OPT). We propose two off-line heuristics: MIN-d ...