Contextualisation and authenticity in TBLT: voices from Chinese classrooms

In view of ongoing debates about the future of TBLT in EFL contexts (Thomas & Reinders, 2015; Zheng & Borg, 2014), we present a detailed case study of teacher beliefs and practices regarding TBLT conducted in a secondary school in mainland China with a long history of communicative and task-based teaching approaches. We used a mixed-methods approach to gather a broad range of triangulated data, combining individual interviews, material analysis and observations coded using a novel task-focused version of the COLT scheme (Littlewood, 2011; Spada & Fröhlich, 1995). Quantitative and qualitative findings revealed positive beliefs about TBLT principles in general, reflecting strong institutional support for communicative teaching. However, there was marked variability between beliefs and practices in using tasks, especially with beginner-level learners. Most teachers demonstrated an intrinsic lack of confidence in using tasks as more than a communicative ‘add-on’ to standard form-focused teaching. We argue this demonstrates a need for building teacher autonomy (Aoki, 2002; Benson, 2007), in implementing TBLT, even in supportive settings, to support successful authentic contextualising TBLT principles in different EFL contexts.

Rethinking the literature on the performance of Chinese multinational enterprises

We synthesize the literature on Chinese multinational enterprises (MNEs) and find that much of the prior research is based on as few as a dozen case studies of Chinese firms. They are so case-specific that it has led to a misplaced call for new theories to explain Chinese firms’ internationalization. In an attempt to better relate theory with empirical evidence, we examine the largest 500 Chinese manufacturing firms. We aim to find out the number of Chinese manufacturing firms to be true MNEs by definition, and to examine their financial performance relative to global peers using the financial benchmarking method. We develop our theoretical perspectives from new internalization theory. We find that there are only 49 Chinese manufacturing firms to be true MNEs, whereas the rest is purely domestic firms. Their performance is poor relative to global peers. Chinese MNEs have home country bound firm-specific advantages (FSAs), which are built upon home country-specific advantages (home CSAs). They have not yet developed advanced management capabilities through recombination with host CSAs. Essentially, they acquire foreign firms to increase their sales in domestic market, but they fail to be competitive internationally and to achieve superior performance in overseas operations. Our findings have important strategic implications for managers, public policy makers, and academic research.

The multiple team formation problem using sociometry

The Team Formation problem (TFP) has become a well-known problem in the OR literature over the last few years. In this problem, the allocation of multiple individuals that match a required set of skills as a group must be chosen to maximise one or several social positive attributes. Speci�cally, the aim of the current research is two-fold. First, two new dimensions of the TFP are added by considering multiple projects and fractions of people's dedication. This new problem is named the Multiple Team Formation Problem (MTFP). Second, an optimization model consisting in a quadratic objective function, linear constraints and integer variables is proposed for the problem. The optimization model is solved by three algorithms: a Constraint Programming approach provided by a commercial solver, a Local Search heuristic and a Variable Neighbourhood Search metaheuristic. These three algorithms constitute the first attempt to solve the MTFP, being a variable neighbourhood local search metaheuristic the most effi�cient in almost all cases. Applications of this problem commonly appear in real-life situations, particularly with the current and ongoing development of social network analysis. Therefore, this work opens multiple paths for future research.

Continuous and High-Level In Vivo Delivery of Endostatin From Recombinant Cells Encapsulated in TheraCyte (R) Immunoisolation Devices

Endostatin (ES) is a potent inhibitor of angiogenesis and tumor growth. Continuous ES delivery of ES improves the efficacy and potency of the antitumoral therapy. The TheraCyte (R) system is a polytetrafluoroethylene (PTFE) semipermeable membrane macroencapsulation system for implantation of genetically engineered cells specially designed for the in vivo delivery of therapeutic proteins, such as ES, which circumvents the problem of limited half-life and variation in circulating levels. In order to enable neovascularization at the tissues adjacent to the devices prior to ES secretion by the cells inside them, we designed a scheme in which empty TheraCyte (R) devices were preimplanted SC into immunodeficient mice. Only after healing (17 days later) were Chinese hamster ovary cells expressing ES injected into the preimplanted devices. In another model for device implantation, the cells expressing ES where loaded into the immunoisolation devices prior to implantation into the animals, and the TheraCyte (R) were then immediately implanted SC into the mice. Throughout the 2-month study, constant high ES levels of up to 3.7 mu g/ml were detected in the plasma of the mice preimplanted with the devices, while lower but also constant levels of ES (up to 2.1 mu g/ml plasma) were detected in the mice that had received devices preloaded with the ES-expressing cells. Immunohistochemistry using anti-ES antibody showed reaction within the device and outside it, demonstrating that ES, secreted by the confined recombinant cells, permeated through the membrane and reached the surrounding tissues.

ROOT PROBLEM FOR CONVENIENT MAPS

In this paper we study when the minimal number of roots of the so-called convenient maps horn two-dimensional CW complexes into closed surfaces is zero We present several necessary and sufficient conditions for such a map to be root free Among these conditions we have the existence of specific fittings for the homomorphism induced by the map on the fundamental groups, existence of the so-called mutation of a specific homomorphism also induced by the map, and existence of particular solutions of specific systems of equations on free groups over specific subgroups

Continuity of the dynamics in a localized large diffusion problem with nonlinear boundary conditions

This paper is concerned with singular perturbations in parabolic problems subjected to nonlinear Neumann boundary conditions. We consider the case for which the diffusion coefficient blows up in a subregion Omega(0) which is interior to the physical domain Omega subset of R(n). We prove, under natural assumptions, that the associated attractors behave continuously as the diffusion coefficient blows up locally uniformly in Omega(0) and converges uniformly to a continuous and positive function in Omega(1) = (Omega) over bar\Omega(0). (C) 2009 Elsevier Inc. All rights reserved.

Dynamics in dumbbell domains II. The limiting problem

In this work we continue the analysis of the asymptotic dynamics of reaction-diffusion problems in a dumbbell domain started in [J.M. Arrieta, AN Carvalho, G. Lozada-Cruz, Dynamics in dumbbell domains I. Continuity of the set of equilibria, J. Differential Equations 231 (2) (2006) 551-597]. Here we study the limiting problem, that is, an evolution problem in a ""domain"" which consists of an open, bounded and smooth set Omega subset of R(N) with a curve R(0) attached to it. The evolution in both parts of the domain is governed by a parabolic equation. In Omega the evolution is independent of the evolution in R(0) whereas in R(0) the evolution depends on the evolution in Omega through the continuity condition of the solution at the junction points. We analyze in detail the linear elliptic and parabolic problem, the generation of linear and nonlinear semigroups, the existence and structure of attractors. (C) 2009 Elsevier Inc. All rights reserved.

Reduced gradient method combined with augmented Lagrangian and barrier for the optimal power flow problem

A new approach for solving the optimal power flow (OPF) problem is established by combining the reduced gradient method and the augmented Lagrangian method with barriers and exploring specific characteristics of the relations between the variables of the OPF problem. Computer simulations on IEEE 14-bus and IEEE 30-bus test systems illustrate the method. (c) 2007 Elsevier Inc. All rights reserved.

The constrained compartmentalized knapsack problem: mathematical models and solution methods

The constrained compartmentalized knapsack problem can be seen as an extension of the constrained knapsack problem. However, the items are grouped into different classes so that the overall knapsack has to be divided into compartments, and each compartment is loaded with items from the same class. Moreover, building a compartment incurs a fixed cost and a fixed loss of the capacity in the original knapsack, and the compartments are lower and upper bounded. The objective is to maximize the total value of the items loaded in the overall knapsack minus the cost of the compartments. This problem has been formulated as an integer non-linear program, and in this paper, we reformulate the non-linear model as an integer linear master problem with a large number of variables. Some heuristics based on the solution of the restricted master problem are investigated. A new and more compact integer linear model is also presented, which can be solved by a branch-and-bound commercial solver that found most of the optimal solutions for the constrained compartmentalized knapsack problem. On the other hand, heuristics provide good solutions with low computational effort. (C) 2011 Elsevier BM. All rights reserved.

On the cutting stock problem under stochastic demand

This paper addresses the one-dimensional cutting stock problem when demand is a random variable. The problem is formulated as a two-stage stochastic nonlinear program with recourse. The first stage decision variables are the number of objects to be cut according to a cutting pattern. The second stage decision variables are the number of holding or backordering items due to the decisions made in the first stage. The problem`s objective is to minimize the total expected cost incurred in both stages, due to waste and holding or backordering penalties. A Simplex-based method with column generation is proposed for solving a linear relaxation of the resulting optimization problem. The proposed method is evaluated by using two well-known measures of uncertainty effects in stochastic programming: the value of stochastic solution-VSS-and the expected value of perfect information-EVPI. The optimal two-stage solution is shown to be more effective than the alternative wait-and-see and expected value approaches, even under small variations in the parameters of the problem.

Sustainable vegetable crop supply problem

We consider an agricultural production problem, in which one must meet a known demand of crops while respecting ecologically-based production constraints. The problem is twofold: in order to meet the demand, one must determine the division of the available heterogeneous arable areas in plots and, for each plot, obtain an appropriate crop rotation schedule. Rotation plans must respect ecologically-based constraints such as the interdiction of certain crop successions, and the regular insertion of fallows and green manures. We propose a linear formulation for this problem, in which each variable is associated with a crop rotation schedule. The model may include a large number of variables and it is, therefore, solved by means of a column-generation approach. We also discuss some extensions to the model, in order to incorporate additional characteristics found in field conditions. A set of computational tests using instances based on real-world data confirms the efficacy of the proposed methodology. (C) 2009 Elsevier B.V. All rights reserved.

GRASP heuristic with path-relinking for the multi-plant capacitated lot sizing problem

This paper addresses the independent multi-plant, multi-period, and multi-item capacitated lot sizing problem where transfers between the plants are allowed. This is an NP-hard combinatorial optimization problem and few solution methods have been proposed to solve it. We develop a GRASP (Greedy Randomized Adaptive Search Procedure) heuristic as well as a path-relinking intensification procedure to find cost-effective solutions for this problem. In addition, the proposed heuristics is used to solve some instances of the capacitated lot sizing problem with parallel machines. The results of the computational tests show that the proposed heuristics outperform other heuristics previously described in the literature. The results are confirmed by statistical tests. (C) 2009 Elsevier B.V. All rights reserved.

An approach for solving the lot-sizing problem of a market-driven foundry

Foundries can be found all over Brazil and they are very important to its economy. In 2008, a mixed integer-programming model for small market-driven foundries was published, attempting to minimize delivery delays. We undertook a study of that model. Here, we present a new approach based on the decomposition of the problem into two sub-problems: production planning of alloys and production planning of items. Both sub-problems are solved using a Lagrangian heuristic based on transferences. An important aspect of the proposed heuristic is its ability to take into account a secondary practice objective solution: the furnace waste. Computational tests show that the approach proposed here is able to generate good quality solutions that outperform prior results. Journal of the Operational Research Society (2010) 61, 108-114. doi:10.1057/jors.2008.151

Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths

This paper deals with the classical one-dimensional integer cutting stock problem, which consists of cutting a set of available stock lengths in order to produce smaller ordered items. This process is carried out in order to optimize a given objective function (e.g., minimizing waste). Our study deals with a case in which there are several stock lengths available in limited quantities. Moreover, we have focused on problems of low demand. Some heuristic methods are proposed in order to obtain an integer solution and compared with others. The heuristic methods are empirically analyzed by solving a set of randomly generated instances and a set of instances from the literature. Concerning the latter. most of the optimal solutions of these instances are known, therefore it was possible to compare the solutions. The proposed methods presented very small objective function value gaps. (C) 2008 Elsevier Ltd. All rights reserved.