Global Sensitivity Analysis for MAP Inference in Graphical Models

We study the sensitivity of a MAP configuration of a discrete probabilistic graphical model with respect to perturbations of its parameters. These perturbations are global, in the sense that simultaneous perturbations of all the parameters (or any chosen subset of them) are allowed. Our main contribution is an exact algorithm that can check whether the MAP configuration is robust with respect to given perturbations. Its complexity is essentially the same as that of obtaining the MAP configuration itself, so it can be promptly used with minimal effort. We use our algorithm to identify the largest global perturbation that does not induce a change in the MAP configuration, and we successfully apply this robustness measure in two practical scenarios: the prediction of facial action units with posed images and the classification of multiple real public data sets. A strong correlation between the proposed robustness measure and accuracy is verified in both scenarios.

New Complexity Results for MAP in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. It is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure), which extends previous complexity results. Furthermore, a Fully Polynomial Time Approximation Scheme for MAP in networks with bounded treewidth and bounded number of states per variable is developed. Approximation schemes were thought to be impossible, but here it is shown otherwise under the assumptions just mentioned, which are adopted in most applications.

New Results for the MAP Problem in Bayesian Networks

This paper presents new results for the (partial) maximum a posteriori (MAP) problem in Bayesian networks, which is the problem of querying the most probable state configuration of some of the network variables given evidence. First, it is demonstrated that the problem remains hard even in networks with very simple topology, such as binary polytrees and simple trees (including the Naive Bayes structure). Such proofs extend previous complexity results for the problem. Inapproximability results are also derived in the case of trees if the number of states per variable is not bounded. Although the problem is shown to be hard and inapproximable even in very simple scenarios, a new exact algorithm is described that is empirically fast in networks of bounded treewidth and bounded number of states per variable. The same algorithm is used as basis of a Fully Polynomial Time Approximation Scheme for MAP under such assumptions. Approximation schemes were generally thought to be impossible for this problem, but we show otherwise for classes of networks that are important in practice. The algorithms are extensively tested using some well-known networks as well as random generated cases to show their effectiveness.

NP-hardness of MAP in Ternary Tree Bayesian Networks

This paper strengthens the NP-hardness result for the (partial) maximum a posteriori (MAP) problem in Bayesian networks with topology of trees (every variable has at most one parent) and variable cardinality at most three. MAP is the problem of querying the most probable state configuration of some (not necessarily all) of the network variables given evidence. It is demonstrated that the problem remains hard even in such simplistic networks.

Anytime Marginal MAP Inference

This paper presents a new anytime algorithm for the marginal MAP problem in graphical models of bounded treewidth. We show asymptotic convergence and theoretical error bounds for any fixed step. Experiments show that it compares well to a state-of-the-art systematic search algorithm.

‘Plugging the Gap’: Shared Education and the promotion of community relations through schools in Northern Ireland

Although there is no consensus amongst educationalists as to the role schools play as drivers of hostilities in divided societies, there is broad agreement that they can facilitate more positive intergroup relations. In Northern Ireland the promotion of school based inter-group contact has been offered as a means through which this can happen. Until 2007, the approach was twofold, reflected on the one hand in short-term contact opportunities for pupils in predominantly Catholic and Protestant schools, and on the other, in support for integrated schools which educate Catholics and Protestants together. In 2007 the Shared Education Programme was introduced to ‘bridge the gap’ between short-term opportunities for contact, and ‘full immersion’ integrated schools. Informed by contact theory, shared education offers curriculum based interaction between pupils attending all school types, aimed at promoting the type of contact likely to reduce negative social attitudes and ultimately contribute to social harmony. In this paper, we examine the impact of shared education thus far. Our analysis suggests that whilst shared education is generally effective in promoting positive assessments of other group members, there is a danger that programme impact may be inhibited by the foregrounding of educational over reconciliation priorities. Appreciating that the downplaying reconciliation objectives may have been necessary when the programme was established in order to maximize recruitment to it, we argue that if the full potential of shared education is to be realized, moving forward, it is important for schools to engage with issues of group differences.

Gender and Politics in Northern Ireland: the representation gap revisited

This article examines the nature of gender politics in Northern Ireland since the 1998 Good Friday/Belfast Agreement. Taking gender justice as a normative democratic framework, the article argues that despite the promise of women's equal participation in public and political life written into the Agreement, parties have delivered varied responses to integrating women, women's interests and perspectives into politics and policy platforms. This contrasts with general patterns supporting women's increased participation in social and political life. The article discusses women's descriptive and substantive representation through electoral outcomes and party manifestos, using the demands of successive women's manifestos as a benchmark. It concludes that while parties have given less recognition and inclusion to women than one might have expected in a new political context, the push for democratic accountability will ensure that gender politics will continue to have a place on the political agenda for some time to come.

Physical map and cosmid contig encompassing a new interstitial deletion of the X-linked lymphoproliferative syndrome region

The X-linked lymphoproliferative syndrome (XLP) is an inherited immuno-deficiency to Epstein-Barr virus infection that has been mapped to chromosome Xq25. Molecular analysis of XLP patients from ten different families identified a small interstitial constitutional deletion in 1 patient (XLP-D). This deletion, initially defined by a single marker, DF83, known to map to interval Xq24-q26.1, is nested within a previously reported and much larger deletion in another XLP patient (XLP-739). A cosmid minilibrary was constructed from a single mega-YAC and used to establish a contig encompassing the whole XLP-D deletion and a portion of the XLP-739 deletion. Based on this contig, the size of the XLP-D deletion can be estimated at 130 kb. The identification of this minimal deletion, within which at least a portion of the XLP gene is likely to reside, should greatly facilitate efforts in isolating the gene.

An Investigation of Compressor Map Width Enhancement and the Inducer Flow Field Using Various Configurations of Shroud Bleed Slot

This paper describes an investigation of various shroud bleed slot configurations of a centrifugal compressor using CFD with a manual multi-block structured grid generation method. The compressor under investigation is used in a turbocharger application for a heavy duty diesel engine of approximately 400hp. The baseline numerical model has been developed and validated against experimental performance measurements. The influence of the bleed slot flow field on a range of operating conditions between surge and choke has been analysed in detail. The impact of the returning bleed flow on the incidence at the impeller blade leading edge due to its mixing with the main through-flow has also been studied. From the baseline geometry, a number of modifications to the bleed slot width have been proposed, and a detailed comparison of the flow characteristics performed. The impact of slot variations on the inlet incidence angle has been investigated, highlighting the improvement in surge and choked flow capability. Along with this, the influence of the bleed slot on stabilizing the blade passage flow by the suction of the tip and over-tip vortex flow by the slot has been considered near surge.

A Case Study of OpenMP applied to Map/Reduce-style Computations

As data analytics are growing in importance they are also quickly becoming one of the dominant application domains that require parallel processing. This paper investigates the applicability of OpenMP, the dominant shared-memory parallel programming model in high-performance computing, to the domain of data analytics. We contrast the performance and programmability of key data analytics benchmarks against Phoenix++, a state-of-the-art shared memory map/reduce programming system. Our study shows that OpenMP outperforms the Phoenix++ system by a large margin for several benchmarks. In other cases, however, the programming model is lacking support for this application domain.