Plasmodium vivax is one of the most geographically widespread malaria parasites in the world, primarily found across South-East Asia, Latin America, and parts of Africa. One of the significant characteristics of the P. vivax parasite is its ability to remain dormant in the human liver as hypnozoites and subsequently reactivate after the initial infection (i.e. relapse infections). Mathematical modelling approaches have been widely applied to understand P. vivax dynamics and predict the impact of intervention outcomes. Models that capture P. vivax dynamics differ from those that capture P. falciparum dynamics, as they must account for relapses caused by the activation of hypnozoites. In this article, we provide a scoping review of mathematical models that capture P. vivax transmission dynamics published between January 1988 and May 2023. The primary objective of this work is to provide a comprehensive summary of the mathematical models and techniques used to model P. vivax dynamics. In doing so, we aim to assist researchers working on mathematical epidemiology, disease transmission, and other aspects of P. vivax malaria by highlighting best practices in currently published models and highlighting where further model development is required. We categorise P. vivax models according to whether a deterministic or agent-based approach was used. We provide an overview of the different strategies used to incorporate the parasite's biology, use of multiple scales (within-host and population-level), superinfection, immunity, and treatment interventions. In most of the published literature, the rationale for different modelling approaches was driven by the research question at hand. Some models focus on the parasites' complicated biology, while others incorporate simplified assumptions to avoid model complexity. Overall, the existing literature on mathematical models for P. vivax encompasses various aspects of the parasite's dynamics. We recommend that future research should focus on refining how key aspects of P. vivax dynamics are modelled, including spatial heterogeneity in exposure risk and heterogeneity in susceptibility to infection, the accumulation of hypnozoite variation, the interaction between P. falciparum and P. vivax, acquisition of immunity, and recovery under superinfection.

Autonomous electric mobility on demand (AEMoD) services are anticipated to be the future of private transportation, serving tens-of-thousands of requests per minute in large cities. To cope with this massive demand, a decentralized (i.e., zone-based) and multi-class management framework of AEMoD fleets was recently introduced. Yet, the inter-zone management of such approach has not been investigated. This paper thus fills this gap by studying the fleet re-balancing problem, with possible in-route charging, in decentralized multiclass AEMoD systems. A queuing model for multi-class re-balancing and possible in-route charging is developed on top of the system's decentralized fleet management. The stability conditions of this model are first derived, then the optimal inter-zone multi-class re-balancing and in-route charging decisions are derived so as to minimize the maximum response time in each deficient zone. Closed-form solutions are derived using Lagrangian analysis and simulations in a realistic setting in the city of Seattle are employed to illustrate the merits of our proposed re-balancing scheme as opposed to different baseline rebalancing approaches.

UPC extends ISO C into a Partioned Global Address Space (PGAS) programming language. UPC allows programmers to exploit data locality and parallelism in their applications, while maintaining ease of use. UPC is running ubiquitously across nearly all HPC platforms and has been gaining rising support from the community. UPC is relatively very easy to use for irregular access patterns which can enable many new applications that are hard to express in other paradigms. In this BoF, the UPC consortium will share with the community the progress made in applications, specifications, tools, and implementations of UPC. Future plans will be also presented. The First half of the BOF will follow a panel format, where the members will represent the UPC consortium and will speak to different aspects of the UPC developments. The second half will be a question and answer session to promote the exchange of ideas.

One of the most important pragmatic advantages of functional languages is that concurrency in a program is implicit -- there is no need for special constructs to express parallelism as is required in most conventional languages. Furthermore, it is fairly easy for compilers to automatically determine the concurrency as a step toward decomposing a program for execution on a suitable parallel architecture. Yet it is often the case that one knows precisely the optimal decomposition for execution on a particular machine, and one can never expect a compiler to determine such optimal mappings in all cases. This paper is concerned with ways to allow the programmer to explicitly express this mapping of program to machine, by using annotations that, given a few minor constraints, cannot alter the functional semantics of the program. We show through several detailed examples the expressiveness and conciseness of the resulting para-functional programming methodology, using an experimental language called ParAlfl based on our ideas. We also give a formal denotational description of the mapping semantics using a notion of execution trees.This research was supported in part by NSF Grants DCR-8403304 and DCR-8451415, and a Faculty Development Award from IBM.