Game-­theoretic Resource Allocation with Real-­time Probabilistic Surveillance Information

Game-theoretic security resource allocation problems have generated significant interest in the area of designing and developing security systems. These approaches traditionally utilize the Stackelberg game model for security resource scheduling in order to improve the protection of critical assets. The basic assumption in Stackelberg games is that a defender will act first, then an attacker will choose their best response after observing the defender’s strategy commitment (e.g., protecting a specific asset). Thus, it requires an attacker’s full or partial observation of a defender’s strategy. This assumption is unrealistic in real-time threat recognition and prevention. In this paper, we propose a new solution concept (i.e., a method to predict how a game will be played) for deriving the defender’s optimal strategy based on the principle of acceptable costs of minimax regret. Moreover, we demonstrate the advantages of this solution concept by analyzing its properties.

Phytoremediation assessment of Gomphrena globosa and Zinnia elegans grown in arsenic-contaminated hydroponic conditions as a safe and feasible alternative to be applied in arsenic-contaminated soils of the Bengal Delta

Several agricultural fields show high contents of arsenic because of irrigation with arsenic- contaminated groundwater. Vegetables accumulate arse- nic in their edible parts when grown in contaminated soils. Polluted vegetables are one of the main sources of arsenic in the food chain, especially for people living in rural arsenic endemic villages of India and Bangladesh. The aim of this study was to assess the feasibility of floriculture in the crop rotation system of arsenic en- demic areas of the Bengal Delta. The effects of different arsenic concentrations (0, 0.5, 1.0, and 2.0 mg As L−1) and types of flowering plant (Gomphrena globosa and Zinnia elegans) on plant growth and arsenic accumula- tion were studied under hydroponic conditions. Total arsenic was quantified using atomic absorption spec- trometer with hydride generation (HG-AAS). Arsenic was mainly accumulated in the roots (72 %), followed by leaves (12 %), stems (10 %), and flowers (<1 %). The flowering plants studied did not show as high phytoremediation capacities as other wild species, suchas ferns. However, they behaved as arsenic tolerant plants and grew and bloomed well, without showing any phytotoxic signs. This study proves that floriculture could be included within the crop rotation system in arsenic-contaminated agricultural soils, in order to im- prove food safety and also food security by increasing farmer’s revenue.

Local Conventions in Game Play in an Evolving Dual Social Network Framework

People usually perform economic interactions within the social setting of a small group, while they obtain relevant information from a broader source. We capture this feature with a dynamic interaction model based on two separate social networks. Individuals play a coordination game in an interaction network, while updating their strategies using information from a separate influence network through which information is disseminated. In each time period, the interaction and influence networks co-evolve, and the individuals’ strategies are updated through a modified naive learning process. We show that both network structures and players’ strategies always reach a steady state, in which players form fully connected groups and converge to local conventions. We also analyze the influence exerted by a minority group of strongly opinionated players on these outcomes.

Improvisation, Indeterminacy and Game-Mediated Participation in Network Music Performance

This chapter focuses on the relationship between improvisation and indeterminacy. We discuss the two practices by referring to play theory and game studies and situate it in recent network music performance. We will develop a parallel with game theory in which indeterminacy is seen as a way of articulating situations where structural decisions are left to the discernment of the performers and discuss improvisation as a method of play. The improvisation-indeterminacy relationship is discussed in the context of network music performance, which employs digital networks in the exchange of data between performers and hence relies on topological structures with varying degrees of openness and flexibility. Artists such as Max Neuhaus and The League of Automatic Music Composers initiated the development of a multitude of practices and technologies exploring the network as an environment for music making. Even though the technologies behind “the network” have shifted dramatically since Neuhaus’ use of radio in the 1960’s, a preoccupation with distribution and sharing of artistic agency has remained at the centre of networked practices. Gollo Föllmer, after undertaking an extensive review of network music initiatives, produced a typology that comprises categories as diverse as remix lists, sound toys, real/virtual space installations and network performances. For Föllmer, “the term ‘Net music’ comprises all formal and stylistic kinds of music upon which the specifics of electronic networks leave considerable traces, whereby the electronic networks strongly influence the process of musical production, the musical aesthetic, or the way music is received” (2005: 185).

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.

On the Assumption of Bivariate Normality in Selection Models: A Copula Approach Applied to Estimating HIV Prevalence

Background: Heckman-type selection models have been used to control HIV prevalence estimates for selection bias when participation in HIV testing and HIV status are associated after controlling for observed variables. These models typically rely on the strong assumption that the error terms in the participation and the outcome equations that comprise the model are distributed as bivariate normal.
Methods: We introduce a novel approach for relaxing the bivariate normality assumption in selection models using copula functions. We apply this method to estimating HIV prevalence and new confidence intervals (CI) in the 2007 Zambia Demographic and Health Survey (DHS) by using interviewer identity as the selection variable that predicts participation (consent to test) but not the outcome (HIV status).
Results: We show in a simulation study that selection models can generate biased results when the bivariate normality assumption is violated. In the 2007 Zambia DHS, HIV prevalence estimates are similar irrespective of the structure of the association assumed between participation and outcome. For men, we estimate a population HIV prevalence of 21% (95% CI = 16%–25%) compared with 12% (11%–13%) among those who consented to be tested; for women, the corresponding figures are 19% (13%–24%) and 16% (15%–17%).
Conclusions: Copula approaches to Heckman-type selection models are a useful addition to the methodological toolkit of HIV epidemiology and of epidemiology in general. We develop the use of this approach to systematically evaluate the robustness of HIV prevalence estimates based on selection models, both empirically and in a simulation study.

Aggressiveness as a component of fighting ability in pigs using a game-theoretical framework

Understanding animal contests has benefited greatly from employing the concept of fighting ability, termed resource-holding potential (RHP), with body size/weight typically used as a proxy. However, victory does not always go to the larger/heavier contestant and the existing RHP approach thereby fails to accurately predict contest outcome. Aggressiveness, typically studied as a personality trait, might explain part of this discrepancy. We investigated whether aggressiveness forms a component of RHP, examining effects on contest outcome, duration and phases, plus physiological measures of costs (lactate and glucose). Furthermore, using the correct theoretical framework, we provide the first study to investigate whether individuals gather and use information on aggressiveness as part of an assessment strategy. Pigs, Sus scrofa, were assessed for aggressiveness in resident-intruder tests whereby attack latency reflects aggressiveness. Contests were then staged between size-matched animals diverging in aggressiveness. Individuals with a short attack latency in the resident-intruder test almost always initiated the first bite and fight in the subsequent contest. However, aggressiveness had no direct effect on contest outcome, whereas bite initiation did lead to winning in contests without an escalated fight. This indirect effect suggests that aggressiveness is not a component of RHP, but rather reflects a signal of intent. Winner and loser aggressiveness did not affect contest duration or its separate phases, suggesting aggressiveness is not part of an assessment strategy. A greater asymmetry in aggressiveness prolonged contest duration and the duration of displaying, which is in a direction contrary to assessment models based on morphological traits. Blood lactate and glucose increased with contest duration and peaked during escalated fights, highlighting the utility of physiological measures as proxies for fight cost. Integrating personality traits into the study of contest behaviour, as illustrated here, will enhance our understanding of the subtleties of agonistic interactions.

Solar coronal magnetic fields derived using seismology techniques applied to omnipresent sunspot waves

Sunspots on the surface of the Sun are the observational signatures of intense manifestations of tightly packed magnetic field lines, with near-vertical field strengths exceeding 6,000 G in extreme cases1. It is well accepted that both the plasma density and the magnitude of the magnetic field strength decrease rapidly away from the solar surface, making high-cadence coronal measurements through traditional Zeeman and Hanle effects difficult as the observational signatures are fraught with low-amplitude signals that can become swamped with instrumental noise2, 3. Magneto-hydrodynamic (MHD) techniques have previously been applied to coronal structures, with single and spatially isolated magnetic field strengths estimated as 9–55 G (refs 4,5,6,7). A drawback with previous MHD approaches is that they rely on particular wave modes alongside the detectability of harmonic overtones. Here we show, for the first time, how omnipresent magneto-acoustic waves, originating from within the underlying sunspot and propagating radially outwards, allow the spatial variation of the local coronal magnetic field to be mapped with high precision. We find coronal magnetic field strengths of 32 ± 5 G above the sunspot, which decrease rapidly to values of approximately 1 G over a lateral distance of 7,000 km, consistent with previous isolated and unresolved estimations. Our results demonstrate a new, powerful technique that harnesses the omnipresent nature of sunspot oscillations to provide magnetic field mapping capabilities close to a magnetic source in the solar corona.

A Scheme Design of Cloud + End Technology in Demand Side Management

Demand Side Management (DSM) plays an important role in Smart Grid. It has large scale access points, massive users, heterogeneous infrastructure and dispersive participants. Moreover, cloud computing which is a service model is characterized by resource on-demand, high reliability and large scale integration and so on and the game theory is a useful tool to the dynamic economic phenomena. In this study, a scheme design of cloud + end technology is proposed to solve technical and economic problems of the DSM. The architecture of cloud + end is designed to solve technical problems in the DSM. In particular, a construct model of cloud + end is presented to solve economic problems in the DSM based on game theories. The proposed method is tested on a DSM cloud + end public service system construction in a city of southern China. The results demonstrate the feasibility of these integrated solutions which can provide a reference for the popularization and application of the DSM in china.

Exact and heuristic methods for solving Boolean games

Boolean games are a framework for reasoning about the rational behavior of agents whose goals are formalized using propositional formulas. Compared to normal form games, a well-studied and related game framework, Boolean games allow for an intuitive and more compact representation of the agents’ goals. So far, Boolean games have been mainly studied in the literature from the Knowledge Representation perspective, and less attention has been paid on the algorithmic issues underlying the computation of solution concepts. Although some suggestions for solving specific classes of Boolean games have been made in the literature, there is currently no work available on the practical performance. In this paper, we propose the first technique to solve general Boolean games that does not require an exponential translation to normal-form games. Our method is based on disjunctive answer set programming and computes solutions (equilibria) of arbitrary Boolean games. It can be applied to a wide variety of solution concepts, and can naturally deal with extensions of Boolean games such as constraints and costs. We present detailed experimental results in which we compare the proposed method against a number of existing methods for solving specific classes of Boolean games, as well as adaptations of methods that were initially designed for normal-form games. We found that the heuristic methods that do not require all payoff matrix entries performed well for smaller Boolean games, while our ASP based technique is faster when the problem instances have a higher number of agents or action variables.