Purpose: To investigate and identify the patterns of interaction between searchers and search engine during Web searching. Design: We examined 2,465,145 interactions from 534,507 users of Dogpile.com submitted on May 6, 2005. We compared query reformulation patterns. We investigated the type of query modifications and query modification transitions within sessions. Findings: We identified three...

A reformulation of a mathematical program is a formulation which shares some properties with, but is in some sense better than, the original program. Reformulations are important with respect to the choice and efficiency of the solution algorithms; furthermore, it is desirable that reformulations can be carried out automatically. Reformulation techniques are very common in mathematical programm...

We propose generalized disjunctive programming models for the short-term scheduling problem of single stage batch plants with parallel units. Three different concepts of continuous-time representation are explored, immediate and general precedence, as well as multiple time grids. The GDP models are then reformulated using both big-M and convex hull reformulations, and the resulting mixed-intege...

While some recent work in tutorial dialogue has touched upon tutor reformulations of student contributions, there has not yet been an attempt to characterize the intentions of reformulations in this educational context nor an attempt to determine which types of reformulation actually contribute to student learning. In this paper we take an initial look at tutor reformulations of student contrib...

The learned helplessness hypothesis is criticized and reformulated. The old hypothesis, when applied to learned helplessness in humans, has two major problems: (a) It does not distinguish between cases in which outcomes are uncontrollable for all people and cases in which they are uncontrollable only for some people (univervsal vs. personal helplessness), and (b) it does not explain when helple...

In this paper, we consider CVaR-based formulation and approximation method proposed by Chen and Lin [5] for a class of stochastic variational inequality problems (for short, SVIP). Different from the work mentioned above, we regard the regularized gap function for SVIP as a loss function for SVIPs and obtain a restrained deterministic minimization reformulation for SVIPs. We show that the refor...

We present a structured reformulation of the seminal algorithm for automatic generation of test cases for a context-free grammar. Our reformulation simplifies the algorithm in several ways. First, we provide a structured reformulation so that it is obvious where to proceed at each step. Second, we partition the intricate third phase into five functions, so that the discussion and comprehension ...

This paper introduces the ontology mapping approach of a system that automatically integrates data sources into an ontology-based data integration system (OBDI). In addition to the target and source ontologies, the mapping algorithm requires a SPARQL query to determine the ontology mapping. Further, the mapping algorithm is dynamic: running each time a query is processed and producing only a pa...