In grid workflow systems, existing representative checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, often select some unnecessary checkpoints and ignore some necessary ones. Consequently, overall temporal verification efficiency and effectiveness can be severely impacted. In this paper, we propose a new strate...

Redundant marking of grammatical relations seems to be commonplace across languages, and has been shown benefit learning as well robust information transmission. At the same time, languages also exhibit trade-offs between strategies such case or word order, suggesting that redundancy may dis-preferred in line with a tendency towards communicative efficiency. In present paper, we assess redundan...

Open domain question answering (QA) systems have to bridge the potential vocabulary mismatch between a question and its candidate answers. One can view this as a recall problem and address it accordingly. Recall oriented strategies to QA may generate considerable amounts of noise. To combat this, many open domain QA systems contain an explicit filtering or re-ranking component, which often chec...

In grid workflow systems, existing typical checkpoint selection strategies, which are used to select checkpoints for verifying fixed-time constraints at run-time execution stage, are not effective and/or efficient for fixed-time constraint verification because they often ignore some necessary checkpoints and select some unnecessary checkpoints. To improve such status, in this paper, we develop ...

Large and complex data is challenging for most existing discovery algorithms, for several reasons. First of all, such data leads to enormous hypothesis spaces, making exhaustive search infeasible. Second, many variants of essentially the same pattern exist, due to (numeric) attributes of high cardinality, correlated attributes, and so on. This causes top-k mining algorithms to return highly red...

This paper proposes a framework for software-implemented, adaptive fault tolerance in a real-time context. It extends previous work in two main ways: by including features that explicitly address the realtime constraints; and by a flexible and adaptable control strategy for managing redundancy within application software modules. This redundancy-management design is introduced as an intermediat...

We consider the setting of prediction with expert advice with an additional assumption that each expert generates its losses i.i.d. according to some distribution. We first identify a class of “admissible” strategies, which we call permutation invariant, and show that every strategy outside this class will perform not better than some permutation invariant strategy. We then show that when the l...

This paper proposes a framework for software implemented, adaptive fault tolerance in a real-time context. It extends previous work in two main ways: by including features that explicitly address the real-time constraints; and by a exible and adaptable control strategy for managing redundancy within application software modules. This redundancy management design is introduced as an intermediate...

in this paper, we study different methods of solving joint redundancy-availability optimization for series-parallel systems with multi-state components. we analyzed various effective factors on system availability in order to determine the optimum number and version of components in each sub-system and consider the effects of improving failure rates of each component in each sub-system and impr...