On the String Actions for the Generalized Two-dimensional Yang-Mills Theories

We study the structures of partition functions of the large $N$ generalized two-dimensional Yang-Mills theories ($gYM_2$) by recasting the higher Casimirs. We clarify the appropriate interpretations of them and try to extend the Cordes-Moore-Ramgoolam's topological string model describing the ordinary $YM_2$ \cite{CMR} to those describing $gYM_2$. We present the expressions of the appropriate operators to reproduce the higher Casimir terms in $gYM_2$. The concept of ''deformed gravitational descendants'' will be introduced for this purpose.Comment: 12 pages, no figures, version to be published in Mod.Phys.Lett.

'Who do "they" cheer for?' Cricket, diaspora, hybridity and divided loyalties amongst British Asians

This article explores the relationship between British Asians' sense of nationhood, citizenship, ethnicity and some of their manifestations in relation to sports fandom: specifically in terms of how cricket is used as a means of articulating diasporic British Asian identities. Norman Tebbit's 'cricket test' is at the forefront of this article to tease out the complexities of being British Asian in terms of supporting the English national cricket team. The first part of the article locates Tebbit's 'cricket test' within the wider discourse of multiculturalism. The analysis then moves to focus on the discourse of sports fandom and the concept of 'home team advantage' arguing that sports venues represent significant sites for nationalist and cultural expression due to their connection with national history. The article highlights how supporting 'Anyone but England', thereby rejecting ethnically exclusive notions of 'Englishness' and 'Britishness', continues to be a definer of British Asians' cultural identities. The final section situates these trends within the discourse of hybridity and argues that sporting allegiances are often separate from considerations of national identity and citizenship. Rather than placing British Asians in an either/or situation, viewing British 'Asianness' in hybrid terms enables them to celebrate their traditions and histories, whilst also being proud of their British citizenship. © The Author(s) 2011

On the parity complexity measures of Boolean functions

The parity decision tree model extends the decision tree model by allowing the computation of a parity function in one step. We prove that the deterministic parity decision tree complexity of any Boolean function is polynomially related to the non-deterministic complexity of the function or its complement. We also show that they are polynomially related to an analogue of the block sensitivity. We further study parity decision trees in their relations with an intermediate variant of the decision trees, as well as with communication complexity.Comment: submitted to TCS on 16-MAR-200

Between law and the nation state:Novel representations of the refugee

Given the degraded profile of the refugee in contemporary discourse, it is tempting to seek alternatives from a rich tradition of literary tropes of exile. However, this article argues that the romanticized figure of the literary exile ends up denying, albeit in positive terms, a genuine refugee voice, as much as the current impersonal hegemonic concept of the refugee as found in law. Ultimately, the spell in which refugees find themselves trapped today can be broken only by opening up a space of politics in which the refugee herself can be heard

Parallel Sort-Based Matching for Data Distribution Management on Shared-Memory Multiprocessors

In this paper we consider the problem of identifying intersections between two sets of d-dimensional axis-parallel rectangles. This is a common problem that arises in many agent-based simulation studies, and is of central importance in the context of High Level Architecture (HLA), where it is at the core of the Data Distribution Management (DDM) service. Several realizations of the DDM service have been proposed; however, many of them are either inefficient or inherently sequential. These are serious limitations since multicore processors are now ubiquitous, and DDM algorithms -- being CPU-intensive -- could benefit from additional computing power. We propose a parallel version of the Sort-Based Matching algorithm for shared-memory multiprocessors. Sort-Based Matching is one of the most efficient serial algorithms for the DDM problem, but is quite difficult to parallelize due to data dependencies. We describe the algorithm and compute its asymptotic running time; we complete the analysis by assessing its performance and scalability through extensive experiments on two commodity multicore systems based on a dual socket Intel Xeon processor, and a single socket Intel Core i7 processor.Comment: Proceedings of the 21-th ACM/IEEE International Symposium on Distributed Simulation and Real Time Applications (DS-RT 2017). Best Paper Award @DS-RT 201