The construction and evaluation of a word pronunciation test for grades four, five, and six

Thesis (Ed.M.)--Boston Universit

An operational map of the Polish Coastal Front 1970

The map of the Operational Plan for the Coastal Front, from Poland 1970 forms the basis for this paper. The map portraits the blueprint of the combined operational war plans for the Polish military in the late 1960’s and 70’s. It details the offensive against NATO countries and their forces in Northern Europe. As such, this map is clearly designed as an operational map produced to outline and regulate, not just the actual plan of the offensive, but also to produce a narrative about the Polish army as capable of undertaking such a massive enterprise. We argue, with a point of departure in this particular map, that the regional, operational scale of military maps can be understood as performative maps, outlining not just plans and structuring space, but often also narratives

A study of general and security Stackelberg game formulations

International audienceIn this paper, we analyze different mathematical formulations for general Stackelberg games (GSGs) and Stackelberg security games (SSGs). We consider GSGs in which a single leader commits to a utility maximizing strategy knowing that one of p possible followers optimizes its own utility taking this leader strategy into account. SSGs are a type of GSG that arise in security applications where the strategies of the leader consist in protecting subsets of targets and the strategies of the p followers consist in attacking a single target. We compare existing mixed integer linear programming (MILP) formulations for GSGs, sorting them according to the tightness of their linear programming (LP) relaxations. We show that SSG formulations are projections of GSG formulations and exploit this link to derive a new SSG MILP formulation that i) has the tightest LP relaxation known among SSG MILP formulations and ii) its LP relaxation coincides with the convex hull of feasible solutions in the case of a single follower. We present computational experiments empirically comparing the difficulty of solving the formulations in the general and security settings. The new SSG MILP formulation is computationally efficient, in particular as the problem size increases