pinecone/core-2020-05-10-deduplication huggingface dataset:
Evolving interesting maps for a first person shooter

We address the problem of automatically designing maps for first-person shooter (FPS) games. An efficient solution to this procedural content generation (PCG) problem could allow the design of FPS games of lower development cost with near-infinite replay value and capability to adapt to the skills and preferences of individual players. We propose a search-based solution, where maps are evolved to optimize a fitness function that is based on the players’ average fighting time. For that purpose, four different map representations are tested and compared. Results obtained showcase the clear advantage of some representations in generating interesting FPS maps and demonstrate the promise of the approach followed for automatic level design in that game genre.peer-reviewe
A Fuzzy Hierarchical Multiple Criteria Group Decision Support System - Decider - And Its Applications

Decider is a Fuzzy Hierarchical Multiple Criteria Group Decision Support System (FHMC-GDSS) designed for dealing with subjective, in particular linguistic, information and objective information simultaneously to support group decision making particularly on evaluation. In this chapter, the fuzzy aggregation decision model, functions and structure of Decider are introduced. The ideas to resolve decision and evaluation problems we have faced in the development and application of Decider are presented. Two real applications of the Decider system are briefly illustrated. Finally, we discuss our further research in this area
Verification of the Schorr-Waite Algorithm - From Trees to Graphs

16 pagesInternational audienceThis article proposes a method for proving the correctness of graph algorithms by manipulating their spanning trees enriched with additional references. We illustrate this concept with a proof of the correctness of a (pseudo-)imperative version of the Schorr-Waite algorithm by re finement of a functional one working on trees. It is composed of two orthogonal steps of re finement -- functional to imperative and tree to graph -- fi nally merged to obtain the result. Our imperative speci fications use monadic constructs and syntax sugar, making them close to common imperative languages. This work has been realized within the Isabelle/HOL proof assistant
Non-termination analysis of logic programs using types

In recent years techniques and systems have been developed to prove non-termination of logic programs for certain classes of queries. In previous work, we developed such a system based on mode-information and a form of loop checking performed at compile time. In the current paper we improve this technique by integrating type information in the analysis and by applying non-failure analysis and program specialization. It turns out that there are several classes of programs for which existing non-termination analyzers fail and for which our extended technique succeeds in proving non-termination.status: publishe
Towards computing revised models for FO theories

In many real-life computational search problems, one is not only interested in finding a solution, but also in maintaining it under varying circumstances. E.g., in the area of network configuration, an initial configuration of a computer network needs to be obtained, as well as a new configuration when one of the machines in the network breaks down. Currently, most such revision problems are solved manually, or with highly specialized software. 

A recent declarative approach to solve (hard) computational search problems involving a lot of domain knowledge, is by finite model generation. Here, the domain knowledge is specified as a logic theory T, and models of T correspond to solutions of the problem. In this paper, we extend this approach to also solve revision problems. In particular, our method allows to use the same theory to describe the search problem and the revision problem, and applies techniques from current model generators to find revised solutions.status: publishe
Citizen Science 2.0 : Data Management Principles to Harness the Power of the Crowd

Citizen science refers to voluntary participation by the general public in scientific endeavors. Although citizen science has a long tradition, the rise of online communities and user-generated web content has the potential to greatly expand its scope and contributions. Citizens spread across a large area will collect more information than an individual researcher can. Because citizen scientists tend to make observations about areas they know well, data are likely to be very detailed. Although the potential for engaging citizen scientists is extensive, there are challenges as well. In this paper we consider one such challenge – creating an environment in which non-experts in a scientific domain can provide appropriate and accurate data regarding their observations. We describe the problem in the context of a research project that includes the development of a website to collect citizen-generated data on the distribution of plants and animals in a geographic region. We propose an approach that can improve the quantity and quality of data collected in such projects by organizing data using instance-based data structures. Potential implications of this approach are discussed and plans for future research to validate the design are described
On Expanding, the Scope of Design Science in IS Research

Design Science Research (DSR) has sparked a renaissance of contributions to IS, but its rigor and value of DSR could be increased by expanding its scope beyond its engineering roots to bring all modes of scientific inquiry to bear – exploratory, theoretical , experimental, and applied science / engineering (AS/E). All DSR Cycle activities can be realized as instances of one or more of the four modes. The rigor of DSR can therefore be defended in terms of the goals, research products, and standards of rigor already established for each mode. There is, moreover, a synergy among the modes that can only be realized when all four are brought to bear, because each informs the other three. To exclude any mode of inquiry from DSR, therefore, is to impoverish knowledge about its objects of inquiry. Based on these insights, we propose a modified Cycles Model for DSR realized under the disciplines of the four modes of scientific inquiry
A design science research roadmap

This paper proposes and synthesizes from previous design science(DS) methodological literature a structured and detailed DS Roadmap for the conduct of DS research. The Roadmap is a general guide for researchers to carry out DS research by suggesting reasonably detailed activities.Though\ud
highly tentative, it is believed the Roadmap usefully inter-relates many otherwise seemingly disparate, overlapping or conflicting concepts. It is hoped the DS Roadmap will aid in the planning, execution and communication of DS research,while also attracting constructive criticism, improvements and extensions. A key distinction of the Roadmap from other DS research methods is its breadth of coverage of DS research aspects and activities; its detail and scope. We demonstrate and evaluate the Roadmap by presenting two case studies in terms of the DS Roadmap
An empirical evaluation of extendible arrays

The final publication is\ud
available at link.springer.comWe study the performance of several alternatives for implementing extendible arrays, which allow random access to elements stored\ud
in them, whilst allowing the arrays to be grown and shrunk. The study\ud
not only looks at the basic operations of grow/shrink and accessing data, but also the effects of memory fragmentation on performance.Peer-reviewedPost-print10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greec
Dynamic Arc-Flags in Road Networks

International audienceIn this work we introduce a new data structure, named Road-Signs, which allows us to efficiently update the Arc-Flags of a graph in a dynamic scenario. Road-Signs can be used to compute Arc-Flags, can be efficiently updated and do not require large space consumption for many real-world graphs like, e.g., graphs arising from road networks. In detail, we define an algorithm to preprocess Road-Signs and an algorithm to update them each time that a weight increase operation occurs on an edge of the network. We also experimentally analyze the proposed algorithms in real-world road networks showing that they yields a significant speed-up in the updating phase of Arc-Flags, at the cost of a very small space and time overhead in the preprocessing phase
Time compactness tools for discretized evolution equations and applications to degenerate parabolic PDEs

International audienceWe discuss several techniques for proving compactness of sequences of approximate solutions to discretized evolution PDEs. While the well-known Aubin-Simon kind functional-analytic techniques were recently generalized to the discrete setting by Gallouët and Latché [15], here we discuss direct techniques for estimating the time translates of approximate solutions in the space $L^1$. One important result is the Kruzhkov time compactness lemma. Further, we describe a specific technique that relies upon the order-preservation property. Motivation comes from studying convergence of finite volume discretizations for various classes of nonlinear degenerate parabolic equations. These and other applications are briefly described
Hybrid finite volume discretization of linear elasticity models on general meshes

The original publication is available at www.springerlink.comInternational audienceThis paper presents a new discretization scheme for linear elasticity models using only one degree of freedom per face corresponding to the normal component of the displacement. The scheme is based on a piecewise constant gradient construction and a discrete variational formulation for the displacement field. The tangential components of the displacement field are eliminated using a second order linear interpolation. Our main motivation is the coupling of geomechanical models and porous media flows arising in reservoir or CO2 storage simulations. Our scheme guarantees by construction the compatibility condition between the displacement discretization and the usual cell-centered finite volume discretization of the Darcy flow model. In addition it applies on general meshes, possibly non conforming such as Corner Point Geometries commonly used in reservoir and CO2 storage simulations
Dispersive wave runup on non-uniform shores

8 pages, 6 figures, 18 references. This preprint is submitted to FVCA6 conference proceedings. Other author papers can be downloaded at http://www.lama.univ-savoie.fr/~dutykh/International audienceHistorically the finite volume methods have been developed for the numerical integration of conservation laws. In this study we present some recent results on the application of such schemes to dispersive PDEs. Namely, we solve numerically a representative of Boussinesq type equations in view of important applications to the coastal hydrodynamics. Numerical results of the runup of a moderate wave onto a non-uniform beach are presented along with great lines of the employed numerical method (see D. Dutykh et al. (2011) for more details)
Playing with Burgers's equation

International audienceThe 1D Burgers equation is used as a toy model to mimick the resulting behaviour of numerical schemes when replacing a conservation law by a form which is equivalent for smooth solutions, such as the total energy by the internal energy balance in the Euler equations. If the initial Burgers equation is replaced by a balance equation for one of its entropies (the square of the unknown) and discretized by a standard scheme, the numerical solution converges, as expected, to a function which is not a weak solution to the initial problem. However, if we first add to Burgers' equation a diffusion term scaled by a small positive parameter ǫ before deriving the entropy balance (this yields a non conservative diffusion term in the resulting equation), and then choose ǫ and the discretization parameters adequately and let them tend to zero, we observe that we recover a convergence to the correct solution
Discretization of the viscous dissipation term with the MAC scheme

International audienceWe propose a discretization for the MAC scheme of the viscous dissipation term τ (u) : ∇u (where τ (u) stands for the shear stress tensor associated to the velocity field u), which is suitable for the approximation of this term in a conservation equation for a scalar variable. This discretization enjoys the property that the integral over the computational domain Ω of the (discrete) dissipation term is equal to what is obtained when taking the inner product of the (discrete) momentum balance equation by u and integrating over Ω. As a consequence, it may be used as an ingredient to obtain an unconditionally stable scheme for the compressible Navier-Stokes equations. It is also shown, in some model cases, to ensure the strong convergence in L1 of the dissipation term
The equivalence of sampling and searching

In a sampling problem, we are given an input x\in\left\{ 0,1\right\} ^{n} , and asked to sample approximately from a probability distribution \mathcal{D}_{x}strings. In a search problem, we are given an input x\in\left\{ 0,1\right\} ^{n} , and asked to find a member of a nonempty set A x with high probability. (An example is finding a Nash equilibrium.) In this paper, we use tools from Kolmogorov complexity to show that sampling and search problems are “essentially equivalent.” More precisely, for any sampling problem S, there exists a search problem R S such that, if \mathcal{C} is any “reasonable” complexity class, then R S is in the search version of \mathcal{C} if and only if S is in the sampling version. What makes this nontrivial is that the same R S works for every \mathcal{C}.
As an application, we prove the surprising result that SampP = SampBQP if and only if FBPP = FBQP. In other words, classical computers can efficiently sample the output distribution of every quantum circuit, if and only if they can efficiently solve every search problem that quantum computers can solve.6th International Computer Science Symposium in Russia, CSR 2011, St. Petersburg, Russia, June 14-18, 2011. ProceedingsNational Science Foundation (U.S.) (grant 0844626)United States. Defense Advanced Research Projects Agency (YFA grant)Alfred P. Sloan Foundatio
A Polynomial-Time Algorithm for Finding a Minimal Conflicting Set Containing a Given Row

International audienceA binary matrix has the Consecutive Ones Property (C1P) if there exists a permutation of its columns (i.e. a sequence of column swappings) such that in the resulting matrix the 1s are consecutive in every row. A Minimal Conﬂicting Set (MCS) of rows is a set of rows R that does not have the C1P, but such that any proper subset of R has the C1P. In [5], Chauve et al. gave a O(∆2 mmax(4,∆+1) (n + m + e)) time algorithm to decide if a row of a m × n binary matrix with at most ∆ 1s per row belongs to at least one MCS of rows. Answering a question raised in [2], [5] and [25], we present the ﬁrst polynomial-time algorithm to decide if a row of a m × n binary matrix belongs to at least one MCS of rows
Mobility Prediction Based Neighborhood Discovery in Mobile Ad Hoc Networks

Part 5: Mobility ModelingInternational audienceHello protocol is the basic technique for neighborhood discovery in wireless ad hoc networks. It requires nodes to claim their existence/ aliveness by periodic 'hello' messages. Central to a hello protocol is the determination of 'hello' message transmission rate. No fixed optimal rate exists in the presence of node mobility. The rate should in fact adapt to it, high for high mobility and low for low mobility. In this paper, we propose a novel mobility prediction based hello protocol, named ARH (Autoregressive Hello protocol). Each node predicts its own position by an ever-updated autoregression-based mobility model, and neighboring nodes predict its position by the same model. The node transmits 'hello' message (for location update) only when the predicted location is too different from the true location (causing topology distortion), triggering mobility model correction on both itself and each of its neighbors. ARH evolves along with network dynamics, and seamlessly tunes itself to the optimal configuration on the fly using local knowledge only. Through simulation, we demonstrate the effectiveness and efficiency of ARH, in comparison with the only competitive protocol TAP (Turnover based Adaptive hello Protocol) [9]. With a small model order, ARH achieves the same high neighborhood discovery performance as TAP, with dramatically reduced message overhead (about 50% lower 'hello' rate)
Points of Interest Coverage with Connectivity Constraints using Wireless Mobile Sensors

Part 7: Network Topology ConfigurationInternational audienceThe coverage of Points of Interest (PoI) is a classical requirement in mobile wireless sensor applications. Optimizing the sensors self-deployment over a PoI while maintaining the connectivity between the sensors and the sink is thus a fundamental issue. This article addresses the problem of autonomous deployment o f mobile sensors that need to cover a predefined PoI with a connectivity constraints and provides the solution to it using Relative Neighborhood Graphs (RNG). Our deployment scheme minimizes the number of sensors used for connectivity thus increasing the number of monitoring sensors. Analytical results, simulation results and real implementation are provided to show the efficiency of our algorithm
ETICA workshop on computer ethics: Exploring normative issues.

The ETICA project aims to identify emerging information and communication technologies. These technologies are then analysed and evaluated from an ethical perspective. The aim of this analysis is to suggest possible governance arrangements that will allow paying proactive attention to such ethical issues. During the ETICA workshop at the summer school, participants were asked to choose one of the 11 technologies that ETICA had identified. For each of these technologies there was a detailed description developed by work package 1 of the project. Workshop participants were asked to reflect on the ethical issues they saw as relevant and likely to arise from the technology. This paper discusses the ethical views of the workshop participants and contrasts them with the findings of the ethical analysis within the ETICA project
Parameterized models for on-line and off-line use

The Monadic Constraint Programming framework leverages 
Haskell’s rich static type system and powerful abstraction mechanisms to 
implement an embedded domain specific language (EDSL) for constraint 
programming. 
In this paper we show how the same constraint model expressed in the 
EDSL can be processed in various modes by external constraint solvers. 
We distinguish between on-line and off-line use of solvers. In off-line 
mode, the model is not solved; instead it is compiled to lower-level code 
that will search for solutions when compiled and run. For on-line use, the 
search can be handled by either the framework or in the external solver. 
Off-line mode requires recompilation after each change to the model. To 
avoid repeated recompilation, we separate model from data by means of 
parameters that need not be known at compile time. Parametrization 
poses several challenges, which we resolve by embedding the EDSL more 
deeply.status: publishe
Reducing Latency in Internet Access Links with Mechanisms in Endpoints and within the Network

Excessive and unpredictable end-to-end latency is a major problem for today’s Internet performance, affecting a range of applications from real-time multimedia to web traffic. This is mainly attributed to the interaction between the TCP congestion control mechanism and the unmanaged large buffers deployed across the Internet. This dissertation investigates transport and link layer solutions to solve the Internet’s latency problem on the access links. These solutions operate on the sender side, within the network or use signaling between the sender and the network based on Explicit Congestion Notification (ECN). By changing the sender’s reaction to ECN, a method proposed in this dissertation reduces latency without harming link utilization. Real-life experiments and simulations show that this goal is achieved while maintaining backward compatibility and being gradually deployable on the Internet. This mechanism’s fairness to legacy traffic is further improved by a novel use of ECN within the network
Iterative Packing for Demand and Hypergraph Matching

Iterative rounding has enjoyed tremendous success in elegantly resolving open
questions regarding the approximability of problems dominated by covering
constraints. Although iterative rounding methods have been applied to packing
problems, no single method has emerged that matches the effectiveness and
simplicity afforded by the covering case. We offer a simple iterative packing
technique that retains features of Jain's seminal approach, including the
property that the magnitude of the fractional value of the element rounded
during each iteration has a direct impact on the approximation guarantee. We
apply iterative packing to generalized matching problems including demand
matching and $k$-column-sparse column-restricted packing ($k$-CS-PIP) and
obtain approximation algorithms that essentially settle the integrality gap for
these problems. We present a simple deterministic $2k$-approximation for
$k$-CS-PIP, where an $8k$-approximation was the best deterministic algorithm
previously known. The integrality gap in this case is at least $2(k-1+1/k)$. We
also give a deterministic $3$-approximation for a generalization of demand
matching, settling its natural integrality gap.Comment: 13 pages. Appeared in the 15th conference on Integer Programming and
  Combinatorial Optimization (IPCO 2011); available at Springer via
  http://dx.doi.org/10.1007/978-3-642-20807-2_2
Making "Google Docs" User Interface More Accessible for Blind People

Groupware systems are increasingly embedded in our everyday life, both at the office and at home. Thus groupware systems should offer easy interaction for all, including the differently-abled. In this paper we describe the design and implementation of a modified version of Google Docs (http://docs.google.com) interfaces for collaborative editing of documents. Although consisting of only a few Web pages (login, document list, text editing) this modified version shows how it would be possible to enhance interaction via screen reader and voice synthesizer with this popular groupware system, while maintaining its appealing ?look&feel?
An analysis of ASP methodology

Much research in logic programming and non-monotonic reasoning originates from dissatisfaction with classical logic as a knowledge representation language, and with classical deduction as a mode for automated reasoning. Discarding these classical roots has generated many interesting and fruitful ideas. However, to ensure the lasting impact of the results that have been achieved, it is important that they should not remain disconnected from their classical roots. Ultimately, a clear picture
should emerge of what the achievements of answer set programming mean in the context of classical logic, so that they may be given their proper place in the canon of science. In this paper, a look at different aspects of ASP, in an effort to identify precisely the limitations of classical logic that they exposed and investigate how the ASP approaches can be transferred back to the classical setting. Among the issues we thus address are the closed world assumption, "classical" and default negation, default reasoning with exceptions, definitions, lp-functions and the
interpolation technique and the strong introspection operator. We investigate the ASP-methodology to encode knowledge using these language constructs and come across a dichotomy in the ASP-methodology.status: publishe