Power systems for future missions

A comprehensive scenario of future missions was developed and applicability of different power technologies to these missions was assessed. Detailed technology development roadmaps for selected power technologies were generated. A simple methodology to evaluate economic benefits of current and future power system technologies by comparing Life Cycle Costs of potential missions was developed. The methodology was demonstrated by comparing Life Cycle Costs for different implementation strategies of DIPS/CBC technology to a selected set of missions

False-Name Manipulation in Weighted Voting Games is Hard for Probabilistic Polynomial Time

False-name manipulation refers to the question of whether a player in a weighted voting game can increase her power by splitting into several players and distributing her weight among these false identities. Analogously to this splitting problem, the beneficial merging problem asks whether a coalition of players can increase their power in a weighted voting game by merging their weights. Aziz et al. [ABEP11] analyze the problem of whether merging or splitting players in weighted voting games is beneficial in terms of the Shapley-Shubik and the normalized Banzhaf index, and so do Rey and Rothe [RR10] for the probabilistic Banzhaf index. All these results provide merely NP-hardness lower bounds for these problems, leaving the question about their exact complexity open. For the Shapley--Shubik and the probabilistic Banzhaf index, we raise these lower bounds to hardness for PP, "probabilistic polynomial time", and provide matching upper bounds for beneficial merging and, whenever the number of false identities is fixed, also for beneficial splitting, thus resolving previous conjectures in the affirmative. It follows from our results that beneficial merging and splitting for these two power indices cannot be solved in NP, unless the polynomial hierarchy collapses, which is considered highly unlikely

Learning Mazes with Aliasing States: An LCS Algorithm with Associative Perception

Learning classifier systems (LCSs) belong to a class of algorithms based on the principle of self-organization and have frequently been applied to the task of solving mazes, an important type of reinforcement learning (RL) problem. Maze problems represent a simplified virtual model of real environments that can be used for developing core algorithms of many real-world applications related to the problem of navigation. However, the best achievements of LCSs in maze problems are still mostly bounded to non-aliasing environments, while LCS complexity seems to obstruct a proper analysis of the reasons of failure. We construct a new LCS agent that has a simpler and more transparent performance mechanism, but that can still solve mazes better than existing algorithms. We use the structure of a predictive LCS model, strip out the evolutionary mechanism, simplify the reinforcement learning procedure and equip the agent with the ability of associative perception, adopted from psychology. To improve our understanding of the nature and structure of maze environments, we analyze mazes used in research for the last two decades, introduce a set of maze complexity characteristics, and develop a set of new maze environments. We then run our new LCS with associative perception through the old and new aliasing mazes, which represent partially observable Markov decision problems (POMDP) and demonstrate that it performs at least as well as, and in some cases better than, other published systems

Next nearest neighbour Ising models on random graphs

This paper develops results for the next nearest neighbour Ising model on random graphs. Besides being an essential ingredient in classic models for frustrated systems, second neighbour interactions interactions arise naturally in several applications such as the colour diversity problem and graphical games. We demonstrate ensembles of random graphs, including regular connectivity graphs, that have a periodic variation of free energy, with either the ratio of nearest to next nearest couplings, or the mean number of nearest neighbours. When the coupling ratio is integer paramagnetic phases can be found at zero temperature. This is shown to be related to the locked or unlocked nature of the interactions. For anti-ferromagnetic couplings, spin glass phases are demonstrated at low temperature. The interaction structure is formulated as a factor graph, the solution on a tree is developed. The replica symmetric and energetic one-step replica symmetry breaking solution is developed using the cavity method. We calculate within these frameworks the phase diagram and demonstrate the existence of dynamical transitions at zero temperature for cases of anti-ferromagnetic coupling on regular and inhomogeneous random graphs.Comment: 55 pages, 15 figures, version 2 with minor revisions, to be published J. Stat. Mec

Green's functions for parabolic systems of second order in time-varying domains

We construct Green's functions for divergence form, second order parabolic systems in non-smooth time-varying domains whose boundaries are locally represented as graph of functions that are Lipschitz continuous in the spatial variables and 1/2-H\"older continuous in the time variable, under the assumption that weak solutions of the system satisfy an interior H\"older continuity estimate. We also derive global pointwise estimates for Green's function in such time-varying domains under the assumption that weak solutions of the system vanishing on a portion of the boundary satisfy a certain local boundedness estimate and a local H\"older continuity estimate. In particular, our results apply to complex perturbations of a single real equation.Comment: 25 pages, 0 figur

Local behavior of p-harmonic Green's functions in metric spaces

We describe the behavior of p-harmonic Green's functions near a singularity in metric measure spaces equipped with a doubling measure and supporting a Poincar\'e inequality

A log analysis study of 10 years of ebook consumption in academic library collections

Even though libraries have been offering eBooks for more than a decade, very little is known about eBook access and consumption in academic library collections. This paper addresses this gap with a log analysis study of eBook access at the library of the University of Waikato. This in-depth analysis covers a period spanning 10 years of eBook use at this university. We draw conclusions about the use of eBooks at this institution and compare the results with other published studies of eBook usage at tertiary institutes

Deciphering the regulatory landscapte of fetal and adult γδ T-cell development at single-cell resolution

γδ T cells with distinct properties develop in the embryonic and adult thymus and have been identified as critical players in a broad range of infections, antitumor surveillance, autoimmune diseases, and tissue homeostasis. Despite their potential value for immunotherapy, differentiation of γδ T cells in the thymus is incompletely understood. Here, we establish a high‐resolution map of γδ T‐cell differentiation from the fetal and adult thymus using single‐cell RNA sequencing. We reveal novel sub‐types of immature and mature γδ T cells and identify an unpolarized thymic population which is expanded in the blood and lymph nodes. Our detailed comparative analysis reveals remarkable similarities between the gene networks active during fetal and adult γδ T‐cell differentiation. By performing a combined single‐cell analysis of Sox13, Maf, and Rorc knockout mice, we demonstrate sequential activation of these factors during IL ‐17‐producing γδ T‐cell (γδT17) differentiation. These findings substantially expand our understanding of γδ T‐cell ontogeny in fetal and adult life. Our experimental and computational strategy provides a blueprint for comparing immune cell differentiation across developmental stages