Designing Redress: A Study About Grievances Against Public Bodies

How grievances against public bodies are resolved is important not only for the individuals concerned and the decision-makers complained about but also to the whole system of government. People need to have confidence that when things go wrong, they will be put right. There is a general public interest in that being done in accordance with constitutional principles and in ways that are effective and efficient. Over many years, a great variety of different ?mechanisms? for dealing with grievances have been created, ranging from internal complaints processes through to the work of external bodies (including ombudsmen, tribunals and courts). This project has focused on how mechanisms are designed. The study explores how different mechanisms can be thought of as relating to each other. It also looks at the various reasons why mechanisms have to be designed. Drawing on interviews with people involved in the design process and analysis of public information, a map of where the activity of designing redress has been created. Evaluating the ?administrative justice landscape?, two particular deficiencies emerge: there is no strong political or official leadership in relation to how mechanisms ought to be designed and the system is fragmented, with many different people, in various organisations all contributing to design activities. Might a toolkit of guiding principles for designing redress be one way of achieving a better design process and outcomes? A number of principles are proposed in this report, and the authors hope to engage stakeholders in a debate about how this might best be taken forward

A note on 5-cycle double covers

The strong cycle double cover conjecture states that for every circuit $C$ of a bridgeless cubic graph $G$, there is a cycle double cover of $G$ which contains $C$. We conjecture that there is even a 5-cycle double cover $S$ of $G$ which contains $C$, i.e. $C$ is a subgraph of one of the five 2-regular subgraphs of $S$. We prove a necessary and sufficient condition for a 2-regular subgraph to be contained in a 5-cycle double cover of $G$

Colourings of cubic graphs inducing isomorphic monochromatic subgraphs

A $k$-bisection of a bridgeless cubic graph $G$ is a $2$-colouring of its vertex set such that the colour classes have the same cardinality and all connected components in the two subgraphs induced by the colour classes (monochromatic components in what follows) have order at most $k$. Ban and Linial conjectured that every bridgeless cubic graph admits a $2$-bisection except for the Petersen graph. A similar problem for the edge set of cubic graphs has been studied: Wormald conjectured that every cubic graph $G$ with $|E(G)| \equiv 0 \pmod 2$ has a $2$-edge colouring such that the two monochromatic subgraphs are isomorphic linear forests (i.e. a forest whose components are paths). Finally, Ando conjectured that every cubic graph admits a bisection such that the two induced monochromatic subgraphs are isomorphic. In this paper, we give a detailed insight into the conjectures of Ban-Linial and Wormald and provide evidence of a strong relation of both of them with Ando's conjecture. Furthermore, we also give computational and theoretical evidence in their support. As a result, we pose some open problems stronger than the above mentioned conjectures. Moreover, we prove Ban-Linial's conjecture for cubic cycle permutation graphs. As a by-product of studying $2$-edge colourings of cubic graphs having linear forests as monochromatic components, we also give a negative answer to a problem posed by Jackson and Wormald about certain decompositions of cubic graphs into linear forests.Comment: 33 pages; submitted for publicatio

Inclusive One Jet Production With Multiple Interactions in the Regge Limit of pQCD

DIS on a two nucleon system in the regge limit is considered. In this framework a review is given of a pQCD approach for the computation of the corrections to the inclusive one jet production cross section at finite number of colors and discuss the general results.Comment: 4 pages, latex, aicproc format, Contribution to the proceedings of "Diffraction 2008", 9-14 Sep. 2008, La Londe-les-Maures, Franc

Logarithmic corrections in the free energy of monomer-dimer model on plane lattices with free boundaries

Using exact computations we study the classical hard-core monomer-dimer models on m x n plane lattice strips with free boundaries. For an arbitrary number v of monomers (or vacancies), we found a logarithmic correction term in the finite-size correction of the free energy. The coefficient of the logarithmic correction term depends on the number of monomers present (v) and the parity of the width n of the lattice strip: the coefficient equals to v when n is odd, and v/2 when n is even. The results are generalizations of the previous results for a single monomer in an otherwise fully packed lattice of dimers.Comment: 4 pages, 2 figure

Association study of suicidal behavior and affective disorders with a genetic polymorphism in ABCG1, a positional candidate on chromosome 21q22.3

The gene that codes for the ABC transporter ABCG1 is located in a chromosomal susceptibility region (21q22.3) for affective disorders. Genetic variations in ABCG1 have been associated with affective disorders in Japanese males. In this study, we investigated the distribution of a G2457A polymorphism in patients with affective disorders, suicide attempters with various psychiatric diagnoses and healthy subjects, We initially found a trend towards a modest association with affective disorders in males (p = 0.046 for allele frequencies and p = 0.046 for AA versus GG). We conducted a replication study with independent patients and controls, There was no association with affective disorders, either in the replication or in the combined group, Furthermore, we found no association with suicidal behavior, These findings do not support the hypothesis that ABCG1 is a susceptibility gene for affective disorders or suicidal behavior. Copyright (C) 2000 S. Karger AG, Basel

Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $x(t)$ than $x(s)$. This notion of greedy embedding was defined by Papadimitriou and Ratajczak (Theor. Comput. Sci. 2005), where authors conjectured that every 3-connected planar graph has a greedy embedding (possibly planar and convex) in the Euclidean plane. Recently, greedy embedding conjecture has been proved by Leighton and Moitra (FOCS 2008). However, their algorithm do not result in a drawing that is planar and convex for all 3-connected planar graph in the Euclidean plane. In this work we consider the planar convex greedy embedding conjecture and make some progress. We derive a new characterization of planar convex greedy embedding that given a 3-connected planar graph $G = (V,E)$, an embedding x: V \to \bbbr^2 of $G$ is a planar convex greedy embedding if and only if, in the embedding $x$, weight of the maximum weight spanning tree ($T$) and weight of the minimum weight spanning tree (\func{MST}) satisfies \WT(T)/\WT(\func{MST}) \leq (\card{V}-1)^{1 - \delta}, for some $0 < \delta \leq 1$.Comment: 19 pages, A short version of this paper has been accepted for presentation in FCT 2009 - 17th International Symposium on Fundamentals of Computation Theor

Filosofía de la dominación y filosofía de la liberación

Ningun

Better Synchronizability Predicted by Crossed Double Cycle

In this brief report, we propose a network model named crossed double cycles, which are completely symmetrical and can be considered as the extensions of nearest-neighboring lattices. The synchronizability, measured by eigenratio $R$, can be sharply enhanced by adjusting the only parameter, crossed length $m$. The eigenratio $R$ is shown very sensitive to the average distance $L$, and the smaller average distance will lead to better synchronizability. Furthermore, we find that, in a wide interval, the eigenratio $R$ approximately obeys a power-law form as $R\sim L^{1.5}$.Comment: 4 pages, 5 figure

Fundamental Cycles and Graph Embeddings

In this paper we present a new Good Characterization of maximum genus of a graph which makes a common generalization of the works of Xuong, Liu, and Fu et al. Based on this, we find a new polynomially bounded algorithm to find the maximum genus of a graph