We give two results on guessing unbounded subsets of λ+. The first is a positive result and applies to the situation of λ regular and at least equal to א3, while the second is a negative consistency result which applies to the situation of λ a singular strong limit with 2 > λ+. The first result shows that in ZFC there is a guessing of unbounded subsets of S + λ . The second result is a consiste...

Programming with replicated objects is difficult. Developers must face the fundamental trade-off between consistency and performance head on, while struggling with the complexity of distributed storage stacks. We introduce Correctables, a novel abstraction that hides most of this complexity, allowing developers to focus on the task of balancing consistency and performance. To aid developers wit...

An ultimate goal for modern Internet services is the development of scalable, high-performance, highly-available and fault-tolerant systems. Replication is an important approach to achieve this goal. However, replication introduces the issue of consistency among replicas, which is further complicated by network partitions. Generally, higher consistency levels result in lower system availability...

Most existing Distributed File Systems (DFSs) implement a single consistency model to maintain one-copy equivalence. The functionality of that consistency model is based on a balance between environmental constraints and the targeted level of consistency. Such systems efficiently maintain consistency while the environmental capabilities remain constant, e.g., presuming uninterrupted connectivit...

introduction: to assess the efficacy of foeniculum vulgar, menthe longifolia and garlic in iranian children. methods and matherials: nine databases such as medline, scopus and the cochrane central register of controlled trials as well as domestic  database (persian) such as sid, iranmedex, magiran, medlib, irandoc, and google scholar were searched using keywords such as  “child” and “complement...

Many classification algorithms produce confidence measures in the form of conditional probability of labels given the features of the target instance. It is desirable to be make these confidence measures calibrated or consistent, in the sense that they correctly capture the belief of the algorithm in the label output. For instance, if the algorithm outputs a label with confidence measure p for ...

Cloud storage solutions promise high scalability and low cost. Existing solutions, however, differ in the degree of consistency they provide. Our experience using such systems indicates that there is a non-trivial trade-off between cost, consistency and availability. High consistency implies high cost per transaction and, in some situations, reduced availability. Low consistency is cheaper but ...