Mackey functors on compact closed categories

We develop and extend the theory of Mackey functors as an application of enriched category theory. We define Mackey functors on a lextensive category \E and investigate the properties of the category of Mackey functors on \E. We show that it is a monoidal category and the monoids are Green functors. Mackey functors are seen as providing a setting in which mere numerical equations occurring in the theory of groups can be given a structural foundation. We obtain an explicit description of the objects of the Cauchy completion of a monoidal functor and apply this to examine Morita equivalence of Green functors

On Characterizing the Data Movement Complexity of Computational DAGs for Parallel Execution

Technology trends are making the cost of data movement increasingly dominant, both in terms of energy and time, over the cost of performing arithmetic operations in computer systems. The fundamental ratio of aggregate data movement bandwidth to the total computational power (also referred to the machine balance parameter) in parallel computer systems is decreasing. It is there- fore of considerable importance to characterize the inherent data movement requirements of parallel algorithms, so that the minimal architectural balance parameters required to support it on future systems can be well understood. In this paper, we develop an extension of the well-known red-blue pebble game to develop lower bounds on the data movement complexity for the parallel execution of computational directed acyclic graphs (CDAGs) on parallel systems. We model multi-node multi-core parallel systems, with the total physical memory distributed across the nodes (that are connected through some interconnection network) and in a multi-level shared cache hierarchy for processors within a node. We also develop new techniques for lower bound characterization of non-homogeneous CDAGs. We demonstrate the use of the methodology by analyzing the CDAGs of several numerical algorithms, to develop lower bounds on data movement for their parallel execution

Sequence variation in the haemagglutinin-neuraminidase gene of human parainfluenza virus type 3 isolates in the UK

The sequence variation in a 934 base-pair region of the gene encoding the haemagglutinin-neuraminidase of five human parainfluenza virus type 3 (HPIV3) isolates was determined together with that of a prototype UK strain. All of the clinical isolates were from the Manchester area of the UK and were obtained in 1990. 1991 and 1993. The gene segment was amplified by the polymerase chain reaction using HPIVB-specific oligonucleotide primers. The nucleotide homology of the strains was high, around 99% and specific differences in the UK sequences when compared with that of the US prototype strain were identified. In addition, a number of isolate-specific differences were seen. No correlation was detected between the observed nucleotide mutations and the year of isolation, which supports the hypothesis that HPIV3 shows cocirculation of a heterogeneous population of viruses rather than varying with time in a linear fashion. However, the data suggested that geographically-defined genetic lineages of HPIV3 may exist

Gender responsive participatory varietal selection for sustainable seed potato systems in Assam, India.

This report presents the results of the Participatory Varietal Selection (PVSs) implemented in 2018. A total of 116 people participated in the PVSs at the flowering stage and 139 people participated at the harvesting stages. Gender‐responsive approaches were employed to facilitate women’s active participation. More than 50% of participants were women, and gender segregated group discussions were held to create a comfortable environment for women to speak in public

On Characterizing the Data Access Complexity of Programs

Technology trends will cause data movement to account for the majority of energy expenditure and execution time on emerging computers. Therefore, computational complexity will no longer be a sufficient metric for comparing algorithms, and a fundamental characterization of data access complexity will be increasingly important. The problem of developing lower bounds for data access complexity has been modeled using the formalism of Hong & Kung's red/blue pebble game for computational directed acyclic graphs (CDAGs). However, previously developed approaches to lower bounds analysis for the red/blue pebble game are very limited in effectiveness when applied to CDAGs of real programs, with computations comprised of multiple sub-computations with differing DAG structure. We address this problem by developing an approach for effectively composing lower bounds based on graph decomposition. We also develop a static analysis algorithm to derive the asymptotic data-access lower bounds of programs, as a function of the problem size and cache size