Conflict transformation and history teaching: social psychological theory and its contributions

The aim of this introductory chapter is to render intelligible how history teaching can be enriched with knowledge of social psychological theories that deal with the issue of conflict transformation and partcularly the notions of prejudice reduction and reconciliation. A major aim of history teaching is to engage students with historical texts, establish historical significance, identify continuity and change, analyse cause and consequence, take historical perspectives and understand the ethical dimensions of historical interpretations. Such teaching, enriched with social psychological theory, will enlarge the notion of historical literacy into a study of historical culture and historical consciousness in the classroom so that students become reflective of the role of collective memory and history teaching in processes of conflict transformation and understand the ways in which various forms of historical consciousness relate the past, present and future. This is what the editors of this volume call an interdisciplinary paradigm of transformative history teachin

On the minimum latency transmission scheduling in wireless networks with power control under SINR constraints

In order to alleviate interference and contention in a wireless network, we may exploit the existence of multiple orthogonalchannels or time slots, thus achieving a substantial improvement in performance. In this paper, we study a joint transmissionscheduling and power control problem that arises in wireless networks. The goal is to assign channels (or time slots)and transmitting powers to communication links such that all communication requests are processed correctly, specifiedquality-of-service requirements are met, and the number of required time slots is minimised. First, we formulate theproblem as a mixed-integer linear programming. Then, we show that the problem considered is non-deterministicpolynomial-time hard, and subsequently, we propose non-trivial bounding techniques to solve it. Optimisation methodsare also discussed, including a column generation approach, specifically designed to find bounds for the transmissionscheduling problem. Moreover, we develop optimisation techniques in which the bounding techniques are integrated inorder to derive the optimal solution to the problem faster. We close with an extensive computational study, which showsthat despite the complexity of the problem, the proposed methodology scales to problems of non-trivial size. Our algorithmscan therefore be used for static wireless networks where propagation conditions are almost constant and a centralised agentis available (e.g. cellular networks where the base station can act as a centralised agent or wireless mesh networks), andthey can also serve as a benchmark for the performance evaluation of heuristic, approximation or distributed algorithmsthat aim to find near-optimal solutions without information about the whole network

A new path-based cutting plane approach for the discrete time-cost tradeoff problem

Discrete time-cost tradeoff problem, Project scheduling, Cutting plane,

Empire and Imperialism in Education Since 1945: Secondary School History Textbooks

status: Published onlin