The key assumption of activated complex theory (ACT), that the AC is in thermodynamic equilibrium with the reactants, needs to be reconsidered. This is because the formation of the AC is slower than its collapse to product. However, this can be remedied by assuming that the AC is formed in a rapid pre-equilibrium as a thermally activated species, which collapses to products in a slow step invol...

based on the controversial beliefs among l2 teachers about effective corrective feedback (cf) strategies, recast and prompts as 2 kinds of cf have drawn the attention of l2 researchers(e.g., braidi, 2002; iwashita, 2003; loewen & philp, 2006; panova & lyster, 2002; sheen, 2004). despite these numbers of studies, debate continues to exist about their usefulness as a cf technique. whereas...

Wedescribe a polynomial-size conic quadratic reformulation for amachine-job assignment problemwith separable convex cost. Because the conic strengthening is based only on the objective of the problem, it can also be applied to other problems with similar cost functions. Computational results demonstrate the effectiveness of the conic reformulation. © 2009 Elsevier B.V. All rights reserved.

We introduce a strong form of Oliver’s p-group conjecture and derive a reformulation in terms of the modular representation theory of a quotient group. The Sylow p-subgroups of the symmetric group Sn and of the general linear group GLn(Fq) satisfy both the strong conjecture and its reformulation.

Let (QP) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear equality constraints. In this paper, we present QCR, a general method to reformulate (QP) into an equivalent 0-1 program with a convex quadratic objective function. The reformulated problem can then be efficiently solved by a classical branch-and-bound algorithm, based on continuous relaxatio...

We propose a set of reformulation rules for models of constraint satisfaction problems that are written in our high-level constraint programming language ESRA, which is more expressive than OPL and is compiled into OPL. These automatable rules achieve models that are often very similar to what a human modeller would have tried, such as switching from a pure constraint program to an integer line...

Query reformulation techniques based on semantic knowledge have been used in two ways in database management systems, namely for query optimization and for data integration. For the former approach, the main goal of query reformulation is to rewrite a user query into another one that uses less time and/or less resources during the execution. The main goal of the latter approach is to translate ...