Granular Computing has emerged as a unified and coherent framework of designing, processing, and interpretation of information granules. Information granules are formalized within various frameworks such as sets (interval mathematics), fuzzy sets, rough sets, shadowed sets, probabilities (probability density functions), to name several the most visible approaches. In spite of the apparent diver...

Partners in VOs can share large amount of data. Sharing of individual data items is straightforward, but sharing components of complex data structures stored in heterogeneous systems is often a challenge. Sharing is typically governed by rules and policies that need to be translated into access right / privilege control and data granularity control. Simultaneous control of privileges and data g...

In this paper we develop a theory for timed systems which relate to time granularity. We use the well known equivalence of bisimulation to study the eeect of changing granularity. We identify situations where measuring time more accurately has no eeect on the equivalence. Similarly we also present a few situations where measuring time less accurately has no eeect on the equivalence. We also pre...

the gastrointestinal tract is the most frequently involved extranodal location for malt* lymphomas, but malt lymphomas of the large intestine are rarely observed. a treatment for colorectal malt lymphoma has not yet been established. in colonic malt lymphomas, the literature suggests that surgical resection of localized lesion may be the best choice. in the present case, combination of multi-ag...

Most real-world dynamic systems are composed of different components that often evolve at very different rates. In traditional temporal graphical models, such as dynamic Bayesian networks, time is modeled at a fixed granularity, generally selected based on the rate at which the fastest component evolves. Inference must then be performed at this fastest granularity, potentially at significant co...

Many applications, that need mass storage, manipulate data sets with KB – MB size objects. In contrast, mass storage devices work most efficiently for the storage and transfer of large files in the MB – GB range. Reflecting these device characteristics, mass storage systems typically have a file level granularity. To overcome the impedance mismatch between small objects and large files, we prop...

In this paper we introduce the concept of knowledge granularity and study its in uence on an agent's action selection process. Action selection is critical to an agent performing a task in a dynamic, unpredictable environment. Knowledge representation is central to the agent's action selection process. It is important to study what kind of knowledge the agent should represent and the preferred ...

This paper discusses how different ways of introducing “extra” actions in refinement (such as weak refinement, action refinement, stuttering steps) relate to the underlying refinement relations used (e.g. trace refinement, failures refinement). In particular, we aim to show how the choices in those two dimensions are interdependent. The paper is not intended to be polemic (“my formalism/refinem...