Categories are not invariant. This paper attempts to explore the dynamic nature of semantic category, in particular, that of fashion language, based on the cognitive theory of Dawkins’ memetics, a new theory of cultural evolution. Semantic attributes of linguistic memes decrease or proliferate in replication and spreading, which involves a dynamic development of semantic category. More specific...

With the evolution of geographically distributed data centers in Cloud Computing landscape along with amount being processed these centers, which is growing at an exponential rate, processing massive applications become important topic. Since a given task may require many datasets for its execution and are spread over several different finding efficient way to manage storage across nodes system...

To the existing data replication approaches, we add more dynamics about occasional data absence whereby files are replicated in advance in order to make all sites as suitable for job executions as possible. Occasional node or edge absence resulting in data absence is inevitable in wireless network environments. This approach offers several advantages to wireless grids, such as improved fault-to...

Failures are usual rather exceptional in cloud computing environment. To access from the nearby site, the often used data should get replicated to multiple locations to compose the users to advance the system accessibility. A challenging task in cloud computing is to decide a sensible number and right location of replicas. At this point, we propose an adapted dynamic data replication approach t...

Given the lower bound of (n(d 1)=d) for range query time complexity on n d-dimensional point data, we investigate whether little replication can improve the query and update times significantly. We propose linear-space index structures that minimize the query and update times; the query time we achieve is O(n ) for any > 0, and, the update time is O(logn).

To provide performant access to data from high energy physics experiments such as the Large Hadron Collider (LHC), controlled replication of files among grid sites is required. Dynamic replication in response to jobs may also be useful, and has been investigated using the grid simulator OptorSim. In this paper, results from simulation of the LHC Computing Grid in 2008, in a physics analysis sce...

In this paper, we present a distributed algorithm for dynamic data replication of an object in a distributed system. The algorithm changes the replication scheme, i.e., number of replicas and their location in the distributed system, to optimize the amount of communication. In other words, the algorithm dynamically adapts the replication scheme of an object to the pattern of read-write requests...