The behavior of Distributed Shared Memory Systems is dictated by the Memory Consistency Model. Several Memory Consistency Models have been proposed in the literature and they fit basically in two categories: uniform and hybrid models. To provide a better understanding on the semantics of the memory models, researchers have proposed formalisms to define them. Unfortunately, most of the work has ...

Unlabeled data exploitation and interpretability are usually both required in reality. They, however, conducted independently, very few works try to connect the two. For unlabeled exploitation, state-of-the-art semi-supervised learning (SSL) results have been achieved via encouraging consistency of model output on perturbation, that is, assumption. However, it remains hard for users understand ...

This paper is on the general discussion of memory consistency model like Strict Consistency, Sequential Consistency, Processor Consistency, Weak Consistency etc. Then the techniques for implementing distributed shared memory Systems and Synchronization Primitives in Software Distributed Shared Memory Systems are discussed. The analysis involves the performance measurement of the protocol concer...

Given a distributed system with several shared objects and many processes concurrently updating and reading them, it is convenient that the system achieves convergence on the value of these objects. Such property can be guaranteed depending on the consistency model being employed. Causal Consistency is a weak consistency model that is easy and cheap to implement. However, due to the lack of rea...

In this paper, we consider First-order fuzzy differential equations with initial value conditions. The convergence, consistency and stability of difference method for approximating the solution of fuzzy differential equations involving generalized H-differentiability, are studied. Then the local truncation error is defined and sufficient conditions for convergence, consistency and stability of ...

In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits th...

We show that all consistent learning methods—i.e., that asymptotically achieve the lowest possible expected loss for any distribution on (X,Y )—are necessarily localizable, by which we mean that they do not significantly change their response at a particular point when we show them only the part of the training set that is close to that point. This is true in particular for methods that appear ...

Interval constraint solvers use local consistencies— among which one worth mentioning is box consistency— for computing verified solutions of real constraint systems. Though among the most efficient ones, the algorithm for enforcing box consistency suffers from the use of timeconsuming operators. This paper first introduces boxφ consistency, a weakening of box consistency; this new notion then ...

background:  multiple  sclerosis  (ms) patients permanently confronted  with serious challenges from treatment regimen. developing  a new  questionnaire in ms management, through  evaluation  of patients’ perspectives   and  knowledge   regarding   treatment  will help  to  identify the  sources  of tension, and  to  build  a therapeutic   alliance.   we   purposed   to   describe    ms patient...