Allocation in Practice

How do we allocate scarcere sources? How do we fairly allocate costs? These are two pressing challenges facing society today. I discuss two recent projects at NICTA concerning resource and cost allocation. In the first, we have been working with FoodBank Local, a social startup working in collaboration with food bank charities around the world to optimise the logistics of collecting and distributing donated food. Before we can distribute this food, we must decide how to allocate it to different charities and food kitchens. This gives rise to a fair division problem with several new dimensions, rarely considered in the literature. In the second, we have been looking at cost allocation within the distribution network of a large multinational company. This also has several new dimensions rarely considered in the literature.Comment: To appear in Proc. of 37th edition of the German Conference on Artificial Intelligence (KI 2014), Springer LNC

GAMES: A new Scenario for Software and Knowledge Reuse

Games are a well-known test bed for testing search algorithms and learning methods, and many authors have presented numerous reasons for the research in this area. Nevertheless, they have not received the attention they deserve as software projects. In this paper, we analyze the applicability of software and knowledge reuse in the games domain. In spite of the need to find a good evaluation function, search algorithms and interface design can be said to be the primary concerns. In addition, we will discuss the current state of the main statistical learning methods and how they can be addressed from a software engineering point of view. So, this paper proposes a reliable environment and adequate tools, necessary in order to achieve high levels of reuse in the games domain

Pros and cons gamification and gaming in classroom

The aim of the current work is to assess the challenges that gamification in education are facing nowadays. Benefits and disadvantages of using gamification in classroom are both discussed to offer a clearer view on the impact of using gamification within learning process. Exploratory study cases are provided to investigate the relation between motivation and engagement of the students and gamification in training. Following this idea, a survey was conducted to assess how students behavior and motivation is affected by introducing a single, specific gamification element during a semester learning process. To stimulate competition among students, a ranking type plugin was introduced within the university learning management system used for extramural education. The results prove that motivation decreases by comparison to the previous semester.Comment: 7 pages, 3 figure

Synthetic Semiotics: on modelling and simulating the \ud emergence of sign processes

Based on formal-theoretical principles about the \ud sign processes involved, we have built synthetic experiments \ud to investigate the emergence of communication based on \ud symbols and indexes in a distributed system of sign users, \ud following theoretical constraints from C.S.Peirce theory of \ud signs, following a Synthetic Semiotics approach. In this paper, we summarize these computational experiments and results regarding associative learning processes of symbolic sign modality and cognitive conditions in an evolutionary process for the emergence of either symbol-based or index-based communication

Tailoring temporal description logics for reasoning over temporal conceptual models

Temporal data models have been used to describe how data can evolve in the context of temporal databases. Both the Extended Entity-Relationship (EER) model and the Unified Modelling Language (UML) have been temporally extended to design temporal databases. To automatically check quality properties of conceptual schemas various encoding to Description Logics (DLs) have been proposed in the literature. On the other hand, reasoning on temporally extended DLs turn out to be too complex for effective reasoning ranging from 2ExpTime up to undecidable languages. We propose here to temporalize the ‘light-weight’ DL-Lite logics obtaining nice computational results while still being able to represent various constraints of temporal conceptual models. In particular, we consider temporal extensions of DL-Lite^N_bool, which was shown to be adequate for capturing non-temporal conceptual models without relationship inclusion, and its fragment DL-Lite^N_core with most primitive concept inclusions, which are nevertheless enough to represent almost all types of atemporal constraints (apart from covering)