Building machines that learn and think about morality

Lake et al. propose three criteria which, they argue, will bring artificial intelligence (AI) systems closer to human cognitive abilities. In this paper, we explore the application of these criteria to a particular domain of human cognition: our capacity for moral reasoning. In doing so, we explore a set of considerations relevant to the development of AI moral decision-making. Our main focus is on the relation between dual-process accounts of moral reasoning and model-free/model-based forms of machine learning. We also discuss how work in embodied and situated cognition could provide a valu- able perspective on future research

Applying a Life-Cycle Costs Approach to Water

This working paper presents findings and recommendations from the application of a life-cycle costs approach (LCCA) to water supply services in rural communities and small towns1 in four countries -- Andhra Pradesh (India), Burkina Faso, Ghana and Mozambique

Low Complexity Coefficient Selection Algorithms for Compute-and-Forward

Compute-and-Forward (C&F) has been proposed as an efficient strategy to reduce the backhaul load for the distributed antenna systems. Finding the optimal coefficients in C&F has commonly been treated as a shortest vector problem (SVP), which is N-P hard. The point of our work and of Sahraei's recent work is that the C&F coefficient problem can be much simpler. Due to the special structure of C&F, some low polynomial complexity optimal algorithms have recently been developed. However these methods can be applied to real valued channels and integer based lattices only. In this paper, we consider the complex valued channel with complex integer based lattices. For the first time, we propose a low polynomial complexity algorithm to find the optimal solution for the complex scenario. Then we propose a simple linear search algorithm which is conceptually suboptimal, however numerical results show that the performance degradation is negligible compared to the optimal method. Both algorithms are suitable for lattices over any algebraic integers, and significantly outperform the lattice reduction algorithm. The complexity of both algorithms are investigated both theoretically and numerically. The results show that our proposed algorithms achieve better performance-complexity trade-offs compared to the existing algorithms.Comment: 10 pages, 10 figure

FOREIGN TOBACCO OUTLOOK

Production Economics,

QUASI FROBENIUS LIE ALGEBRAS CONSTRUCTION OF N=4 SUPERCONFORMAL FIELD THEORIES

Manin triple construction of N=4 superconformal field theories is considered. The correspondence between quasi Frobenius finite-dimensional Lie algebras and N=4 superconformal field theories is established.Comment: 20 pages, PLAINTE