Summarizes the management of change in a high profile public service with more than its fair share of political influences. Demonstrates the scale of change possible, given a clear strategy and a strong managerial commitment. Argues that this leads to high productivity, quality and value for money, with a strong element of organizational loyalty and ownership of the end product.

High-order triangle-based discontinuous Galerkin (DG) methods for hyperbolic equations on a rotating sphere are presented. The DG method can be characterized as the fusion of finite elements with finite volumes. This DG formulation uses high-order Lagrange polynomials on the triangle using nodal sets up to 15th order. The finite element-type area integrals are evaluated using order 2N Gauss cub...

We prove that a type-definable Lascar strong type has finite diameter. We answer also some other questions from [1] on Lascar strong types. We give some applications on subgroups of type-definable groups. In this paper T is a complete theory in language L and we work within a monster model C of T . For a0, a1 ∈ C let a0Θa1 iff 〈a0, a1〉 extends to an indiscernible sequence 〈an, n < ω〉. We define...

Authenticated Key Exchange protocols enable several parties to establish a shared cryptographically strong key over an insecure network using various authentication means, such as strong cryptographic keys or short (i.e., low-entropy) common secrets. The latter example is definitely the most interesting in practice, since no additional device is required, but just a human-memorable password, fo...

In the realm of iterated prisoners' dilemma equipped with evolutional generation of strategies, a model has been proposed by Lindgren that allows elongation of genes, represented by onedimensional binary arrays, by three kinds of mutations: duplications, splittings, and point mutations, and the strong strategies are set to survive according to their performance at the change of generations. The...

5 We give an optimal degree condition for a tripartite graph to have 6 a spanning subgraph consisting of complete graphs of order 3. This 7 result is used to give an upper bound of 2∆ for the strong chromatic 8 number of n vertex graphs with ∆ ≥ n/6. 9