Very large multidimensional arrays are commonly used in data intensive scientific computations as well as on-line analytical processing applications referred to as MOLAP. The storage organization of such arrays on disks is done by partitioning the large global array into fixed size sub-arrays called chunks or tiles that form the units of data transfer between disk and memory. Typical queries in...

“Hybrid Cloud Storage” (HCS) is a widely adopted framework that combines the functionality of public and private cloud storage models to provide services. This kind especially ideal for organizations seek reduce cost their infrastructure with use “Public as backend on-premises primary storage. Despite higher performance, hybrid has latency issues, related distance bandwidth storage, which may c...

Individual differences in memory performance in a domain of expertise have traditionally been accounted for by previously acquired chunks of knowledge and patterns. These accounts have been examined experimentally mainly in chess. The role of chunks (clusters of chess pieces recalled in rapid succession during recall of chess positions) and their relations to chess skill are, however, under deb...

In this paper the idea that large objects, such as video files, should not be cached or replaced in their entirety, but rather be partitioned in chunks and replacement decisions be applied at the chunk level is examined. It is shown, that a higher byte hit ratio (BHR) can be achieved through partial replacement. The price paid for the improved BHR performance is that the replacement algorithm, ...

In language communication, an utterance may be segmented as a concatenation of chunks that are reasonable in syntax, meaningful in semantics, and composed of several words. Usually, the order of words within chunks is fixed, and the order of chunks within an utterance is rather flexible. The improvement of spoken language translation could benefit from using bilingual chunks. This paper present...

Information-centric networking (ICN) is a promising paradigm to support in-network big data sharing. However, it suffers from the problem of the segmented cached chunks resulting in low throughput and the large Interest packet overhead (IPO). The existing work cannot address these problems well, largely due to their insufficient considerations on the interplay between caching and data transport...