Symposium - Organisational transformation in policing: Leadership and change in extreme contexts

Nearly 4000 people died in Northern Ireland’s long running conflict, 314 of them police officers (Brewer and Magee 1991, Brewer 1996, Hennessey 1999, Guelke and Milton-Edwards 2000). The republican and loyalist ceasefires of 1994 were the first significant signal that NI society was moving beyond the ‘troubles’ and towards a normalised political environment. The Belfast (Good Friday) Agreement of 1998 cemented that movement (Hennessey 1999). Policing was a key and seemingly unresolvable element of the conflict, seen as unrepresentative and partisan. Its reform or ‘recasting’ in a new dispensation was an integral part of the conflict transformation endeavour(Ellison 2010). As one of the most controversial elements of the conflicted past, it had remained outside the Agreement and was subject to a specific commission of interest (1999), generally known as the Patten Commission. The Commission’s far reaching proposals included a change of name, badge and uniform, the introduction of 50/50 recruitment (50% Roman Catholic and 50% other), a new focus on human rights, a new district command and headquarter structure, a review of ‘Special Branch’ and covert techniques, a concern for ‘policing with the community’ and a significant voluntary severance process to make room for new recruits, unconnected with the past history of the organisation(Murphy 2013).

This paper reflects upon the first data collection phase of a long term processual study of organisational change within the Royal Ulster Constabulary / Police Service of Northern Ireland. This phase (1996-2002) covers early organisational change initiation (including the pre-change period) and implementation including the instigation of symbolic changes (name, badge, and crest) and structural changes (new HQ structure and District Command structure). It utilises internal documentation including messages from the organisations leaders, interviews with forty key informants (identified through a combination of snow-balling from referrals by initial contacts, and key interviews with significant individuals), as well as external documentation and commentary on public perceptions of the change. Using a processual lens (Langley, Smallman et al. 2013) it seeks to understand this initial change phase and its relative success in a highly politicised environment.

By engaging key individuals internally and externally, setting up a dedicated change team, adopting a non normative, non urgent, calming approach to dissent, communicating in orthodox and unorthodox ways with members, acknowledging the huge emotional strain of letting go of the organisation’s name and all it embodied, and re-emphasising the role of officers as ‘police first’, rather than ‘RUC first’, the organisations leadership remained in control of a volatile and unhappy organisational body and succeeded in moving it on through this initial phase, even while much of the political establishment lambasted them externally. Three years into this change process the organisation had a new name, a new crest, new structures, procedures and was deeply engaged in embedding the joint principles of human rights and community policing within its re-woven fabric. While significant problems remained, the new Police Service of Northern Ireland had successfully begun a long journey to full community acceptance in a post conflict context.

This case illustrates the significant challenges of leading change under political pressure, with external oversight and no space for failure(Hannah, Uhl-Bien et al. 2009). It empirically reflects the reality of change implementation as messy, disruptive and unpredictable and highlights the significance of political skill and contextual understanding to success in the early stages(Buchanan and Boddy 1992). The implications of this for change theory and the practice of change implementation are explored (Eisenhardt and Graebner 2007) and some conclusions drawn about what such an extreme case tells us about change generally and change implementation under pressure.

Optimised search heuristics: combining metaheuristics and exact methods to solve scheduling problems

Tese dout., Matemática, Investigação Operacional, Universidade do Algarve, 2009

Intelligent predictive control for thermal comfort and energy savings in public buildings

This talk addresses the problem of controlling a heating ventilating and air conditioning system with the purpose of achieving a desired thermal comfort level and energy savings. The formulation uses the thermal comfort, assessed using the predicted mean vote (PMV) index, as a restriction and minimises the energy spent to comply with it. This results in the maintenance of thermal comfort and on the minimisation of energy, which in most operating conditions are conflicting goals requiring some sort of optimisation method to find appropriate solutions over time. In this work a discrete model based predictive control methodology is applied to the problem. It consists of three major components: the predictive models, implemented by radial basis function neural networks identifed by means of a multi-objective genetic algorithm [1]; the cost function that will be optimised to minimise energy consumption and provide adequate thermal comfort; and finally the optimisation method, in this case a discrete branch and bound approach. Each component will be described, with a special emphasis on a fast and accurate computation of the PMV indices [2]. Experimental results obtained within different rooms in a building of the University of Algarve will be presented, both in summer [3] and winter [4] conditions, demonstrating the feasibility and performance of the approach. Energy savings resulting from the application of the method are estimated to be greater than 50%.

Scalable and Efficient Configuration of TimeDivision Multiplexed Resources

Consumer-electronics systems are becoming increasingly complex as the number of integrated applications is growing. Some of these applications have real-time requirements, while other non-real-time applications only require good average performance. For cost-efficient design, contemporary platforms feature an increasing number of cores that share resources, such as memories and interconnects. However, resource sharing causes contention that must be resolved by a resource arbiter, such as Time-Division Multiplexing. A key challenge is to configure this arbiter to satisfy the bandwidth and latency requirements of the real-time applications, while maximizing the slack capacity to improve performance of their non-real-time counterparts. As this configuration problem is NP-hard, a sophisticated automated configuration method is required to avoid negatively impacting design time. The main contributions of this article are: 1) An optimal approach that takes an existing integer linear programming (ILP) model addressing the problem and wraps it in a branch-and-price framework to improve scalability. 2) A faster heuristic algorithm that typically provides near-optimal solutions. 3) An experimental evaluation that quantitatively compares the branch-and-price approach to the previously formulated ILP model and the proposed heuristic. 4) A case study of an HD video and graphics processing system that demonstrates the practical applicability of the approach.

Models and algorithms for the capacitated location-routing problem

Le problème de localisation-routage avec capacités (PLRC) apparaît comme un problème clé dans la conception de réseaux de distribution de marchandises. Il généralisele problème de localisation avec capacités (PLC) ainsi que le problème de tournées de véhicules à multiples dépôts (PTVMD), le premier en ajoutant des décisions liées au routage et le deuxième en ajoutant des décisions liées à la localisation des dépôts. Dans cette thèse on dévelope des outils pour résoudre le PLRC à l’aide de la programmation mathématique. Dans le chapitre 3, on introduit trois nouveaux modèles pour le PLRC basés sur des flots de véhicules et des flots de commodités, et on montre comment ceux-ci dominent, en termes de la qualité de la borne inférieure, la formulation originale à deux indices [19]. Des nouvelles inégalités valides ont été dévelopées et ajoutées aux modèles, de même que des inégalités connues. De nouveaux algorithmes de séparation ont aussi été dévelopés qui dans la plupart de cas généralisent ceux trouvés dans la litterature. Les résultats numériques montrent que ces modèles de flot sont en fait utiles pour résoudre des instances de petite à moyenne taille. Dans le chapitre 4, on présente une nouvelle méthode de génération de colonnes basée sur une formulation de partition d’ensemble. Le sous-problème consiste en un problème de plus court chemin avec capacités (PCCC). En particulier, on utilise une relaxation de ce problème dans laquelle il est possible de produire des routes avec des cycles de longueur trois ou plus. Ceci est complété par des nouvelles coupes qui permettent de réduire encore davantage le saut d’intégralité en même temps que de défavoriser l’apparition de cycles dans les routes. Ces résultats suggèrent que cette méthode fournit la meilleure méthode exacte pour le PLRC. Dans le chapitre 5, on introduit une nouvelle méthode heuristique pour le PLRC. Premièrement, on démarre une méthode randomisée de type GRASP pour trouver un premier ensemble de solutions de bonne qualité. Les solutions de cet ensemble sont alors combinées de façon à les améliorer. Finalement, on démarre une méthode de type détruir et réparer basée sur la résolution d’un nouveau modèle de localisation et réaffectation qui généralise le problème de réaffectaction [48].

Error and complexity of random walk Monte Carlo radiosity

The author studies the error and complexity of the discrete random walk Monte Carlo technique for radiosity, using both the shooting and gathering methods. The author shows that the shooting method exhibits a lower complexity than the gathering one, and under some constraints, it has a linear complexity. This is an improvement over a previous result that pointed to an O(n log n) complexity. The author gives and compares three unbiased estimators for each method, and obtains closed forms and bounds for their variances. The author also bounds the expected value of the mean square error (MSE). Some of the results obtained are also shown

Attitudes of rural branch managers in Madhya Pradesh, India, toward their role as providers of financial services to the poor

Discussions on banking reforms to reduce financial exclusion have referred little to possible attitudinal constraints, on the part of staff at both branch and institutional levels, inhibiting the provision of financial services to the poor. The research project, funded by the ESCOR (now Social Science Research) Small Grants Committee, has focused on this aspect of financial exclusion. The research commenced in May 2001 and was completed in April 2002. Profiles of the rural bank branch managers, including personal background, professional background and workplace, are presented. Attitudes of managers toward aspects of their work environment and the rural poor are examined, using results from both quantitative and qualitative analysis. Finally, the emerging policy implications are discussed. These include bank reforms to address human resource management, the work environment, intermediate bank management and organization, and the client interface.

Advertising America: VOA and Italy

With President Truman’s ‘Campaign of Truth’ in the Fifties, Voice of America (VOA) established itself as one of the most important information programmes of the US government. The 20 million dollar budget allocated to VOA in those years enabled it to employ about 1,900 people and to broadcast in 45 different languages. Italy, with its strong and threatening Communist Party, was one of VOA’s main targets. Audience research however (performed by the United States Information Agency’s Italian branch and by the Italian opinion poll company Doxa) shows that the Italians always preferred their own national network RAI. The US government therefore started to target the RAI, with the aim of placing VOA-produced programmes directly on the Italian network in order to reach a mass audience. This article looks into what went on both ‘on’ and ‘off the air’, analyzing how various Italian ‘target groups’ were addressed by VOA. Drawing on documents from the National Archives and Records Administration in both Washington DC and New York City, and from the Doxa archives in Milan, the study examines how the American government prepared itself to conquer the Italian network RAI.

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.

Vegetative and productive aspects of organically grown coffee cultivars under shaded and unshaded systems

Although Coffea arabica species has its origin in the African understories, there is great resistance on the part of the Brazilian producers for growing this species under agroforestry systems as they fear that shading reduces production. This study aimed at evaluating some vegetative traits and the productivity of organically grown coffee (Coffea arabica L.) cultivars under shaded and unshaded systems. Twelve treatments consisting of two cultivation systems (shaded and unshaded) and six coffee cultivars were arranged in randomized blocks with four replicates, in a split-plot scheme. Shading was provided by banana (Musa sp.) and coral bean plants (Erythrinaverna). Shading delayed fruit maturation. Late maturation cultivars, such as the Icatu and the Obatã, matured early in both cultivation systems, while medium and early maturation cultivars presented late maturation. Cultivation in the shaded system increased the leaf area and the number of lower branches, decreased the number of productive nodes per branch, and increased the distance between the nodes and the number of leaves present in the branches. Cultivation in the unshaded system presented greater number of plants with branch blight in relation to plants grown in the shade. The productivity of the cultivars was not different, at 30.0 processed bags per hectare in the shaded system, and 25.8 processed bags per hectare in the unshaded system. The most productive cultivars in the shaded system were the Tupi, the Obatã, and the Catuaí, while no differences between cultivars were obtained in the unshaded system.

Global optimization approach for the H2-norm model reduction problem

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem for continuous-time linear systems, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through Linear Matrix Inequalities formulations. Examples illustrate the results.

Otimização global para os problemas de redução H2 de modelos e redução H2 da ordem do controlador

A branch and bound algorithm is proposed to solve the H2-norm model reduction problem and the H2-norm controller reduction problem, with conditions assuring convergence to the global optimum in finite time. The lower and upper bounds used in the optimization procedure are obtained through linear matrix inequalities formulations. Examples illustrate the results.

Global optimization for the ℋ∞-norm model reduction problem

A branch and bound algorithm is proposed to solve the [image omitted]-norm model reduction problem for continuous and discrete-time linear systems, with convergence to the global optimum in a finite time. The lower and upper bounds in the optimization procedure are described by linear matrix inequalities (LMI). Also proposed are two methods with which to reduce the convergence time of the branch and bound algorithm: the first one uses the Hankel singular values as a sufficient condition to stop the algorithm, providing to the method a fast convergence to the global optimum. The second one assumes that the reduced model is in the controllable or observable canonical form. The [image omitted]-norm of the error between the original model and the reduced model is considered. Examples illustrate the application of the proposed method.

Women's contribution to equality in Latin America and the Caribbean

Includes bibliography

Collecting and evaluation of germplasm of spiked pepper from Brazilian Amazon

Piper aduncum L. é uma planta que ocorre na Amazônia Brasileira com elevado teor de óleo essencial e que apresenta propriedades biológicas utilizáveis na agricultura e saúde humana. Com o objetivo de avaliar germoplasma visando ao melhoramento genético e cultivo econômico, realizaram-se coletas (inflorescências, estacas, folhas e ramos finos) em dez municípios da Amazônia Brasileira (Manaus, Marabá, Goianésia, Moju, Belém, Santa Izabel, Americano, Bonito, Santarém Novo e Aveiro). Tomaram-se dados do ambiente, populações e de doze caracteres morfoagronômicos (número de folhas por ramo, comprimento da folha, largura da folha, circunferência do ramo mais velho, altura da planta, número de ramos ortotrópicos, número de ramos plagiotrópicos, comprimento do entrenó, número de espigas por ramo, rendimento de óleo, teor e produção de dilapiol). As inflorescências e estacas foram identificadas e encaminhadas para a UFRA em Belém-PA e, as folhas e ramos finos, para o Museu Paraense Emílio Goeldi-MPEG, para extração do óleo essencial (hidrodestilação). Utilizaram-se estimadores de média, desvio padrão, coeficiente de variação e amplitude total para estudo da variabilidade fenotípica. As matrizes prevalenceram em ambientes antropizados, solos argilosos, condições de drenagem variáveis, terrenos planos e clima Ami, como também predominaram populações definíveis pela agregação dos indivíduos, em terra alta e a pleno sol, serrapilheira, tamanho das populações e presença de plântulas no chão muito variáveis. Os caracteres de maior variabilidade foram número de ramos ortotrópicos, número de espigas por ramo, circunferência do ramo mais velho (morfológicos), teor e produção de dilapiol (agronômicos). Concluiu-se que a espécie apresenta adaptação a diferentes ambientes com relação à vegetação, solo, clima, relevo e drenagem, facilitando o cultivo e domesticação. Há variabilidade morfoagronômica favorecendo a seleção e fitomelhoramento.