Benders decomposition uses a strategy of “learning from one’s mistakes.” The aim of this paper is to extend this strategy to a much larger class of problems. The key is to generalize the linear programming dual used in the classical method to an “inference dual.” Solution of the inference dual takes the form of a logical deduction that yields Benders cuts. The dual is therefore very different f...

An effective strategy to exploit the supervising side information for discovering predictive topic representations is to impose discriminative constraints induced by such information on the posterior distributions under a topic model. This strategy has been adopted by a number of supervised topic models, such as MedLDA, which employs max-margin posterior constraints. However, unlike the likelih...

Humans have the arguably unique ability to understand the mental representations of others. For success in both competitive and cooperative interactions, however, this ability must be extended to include representations of others' belief about our intentions, their model about our belief about their intentions, and so on. We developed a "stag hunt" game in which human subjects interacted with a...

the induction machines drives becomes more and more important used in many industrial applications. Their attractiveness is largely due to their simplicity, ruggedness and low cost manufacture, easy maint00enance, high power efficiency and high reliability, are susceptible to various types of electrical and/or mechanical faults that can lead to unexpected motor failure and consequently impulsiv...

We observe an undirected graph G without multiple edges and self-loops, which is to represent a protein-protein interaction (PPI) network. We assume that G evolved under the duplication-mutation with complementarity (DMC) model from a seed graph, G0, and we also observe the binary forest Γ that represents the duplication history of G. A posterior density for the DMC model parameters is establis...

9 This article develops a general Bayes inference model for accelerated life testing assuming failure times at each stress level are exponentially distributed. Using the approach, Bayes 11 point estimates as well as probability statements for use-stress life parameters may be inferred from the following testing scenarios: regular life testing, 7xed-stress testing, step-stress testing, 13 pro7le...

The Extended Linking Strategy (ELS) is a hyper-style strategy whose underlying principle is to control and perform (extend) a series of standard resolution on clauses. However it may be treated as a unique inference rule that serially links several resolution steps into one. We define links and clause chains, and introduce the ideas of ELS with left merging (LELS). We also presented the soundne...

If a rewrite-based inference system is guaranteed to terminate on the axioms of a theory T and any set of ground literals, then any theorem-proving strategy based on that inference system is a rewrite-based decision procedure for T -satisfiability. In this paper, we consider the class of theories defining recursive data structures, that might appear out of reach for this approach, because they ...

We present an efficient strategy for the application of the inference rules of a completion procedure for finitely presented groups. This procedure has been proposed by Cremanns and Otto and uses a combinatorial structure called word-cycle. Our strategy is complete in the sense that a set of persistent word-cycles can be used to solve the reduced word problem of the finitely presented group giv...