pinecone/core-2020-05-10-deduplication huggingface dataset:
Classic Nintendo Games Are (Computationally) Hard

We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokemon. Our results apply to generalized versions of Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games; all Metroid games; and all Pokemon role-playing games. In addition, we prove PSPACE-completeness of the Donkey Kong Country games and several Legend of Zelda games.National Science Foundation (U.S.) (Grant CCF-0829672)National Science Foundation (U.S.) (Grant CCF-1065125)National Science Foundation (U.S.) (Grant CCF-6922462
Normal, Abby Normal, Prefix Normal

A prefix normal word is a binary word with the property that no substring has
more 1s than the prefix of the same length. This class of words is important in
the context of binary jumbled pattern matching. In this paper we present
results about the number $pnw(n)$ of prefix normal words of length $n$, showing
that $pnw(n) =\Omega\left(2^{n - c\sqrt{n\ln n}}\right)$ for some $c$ and
$pnw(n) = O \left(\frac{2^n (\ln n)^2}{n}\right)$. We introduce efficient
algorithms for testing the prefix normal property and a "mechanical algorithm"
for computing prefix normal forms. We also include games which can be played
with prefix normal words. In these games Alice wishes to stay normal but Bob
wants to drive her "abnormal" -- we discuss which parameter settings allow
Alice to succeed.Comment: Accepted at FUN '1
How to go Viral: Cheaply and Quickly

Given a social network represented by a graph $G$, we consider the problem of
finding a bounded cardinality set of nodes $S$ with the property that the
influence spreading from $S$ in $G$ is as large as possible. The dynamics that
govern the spread of influence is the following: initially only elements in $S$
are influenced; subsequently at each round, the set of influenced elements is
augmented by all nodes in the network that have a sufficiently large number of
already influenced neighbors. While it is known that the general problem is
hard to solve --- even in the approximate sense --- we present exact polynomial
time algorithms for trees, paths, cycles, and complete graphs.Comment: An extended abstract of this paper will appear in Proceedings of
  Seventh International conference on Fun with Algorithms (FUN 2014), Lectures
  Notes in Computer Science, Springe
Communication-aware algorithms for target tracking in wireless sensor
  networks

This paper introduces algorithms for target tracking in wireless sensor
networks (WSNs) that enable reduction of data communication cost. The objective
of the considered problem is to control movement of a mobile sink which has to
reach a moving target in the shortest possible time. Consumption of the WSN
energy resources is reduced by transferring only necessary data readings
(target positions) to the mobile sink. Simulations were performed to evaluate
the proposed algorithms against existing methods. The experimental results
confirm that the introduced tracking algorithms allow the data communication
cost to be considerably reduced without significant increase in the amount of
time that the sink needs to catch the target.Comment: 11 pages, 4 figure
Manufacturing of coir fiber - reinforced polymer composites by hot compression technique

This present chapter describes the manufacturing technique and properties of coir fibre-reinforced polypropylene composites manufactured using a hot press machine. The effects of basic chromium sulphate and sodium bicarbonate treatment on the physical and mechanical properties were also evaluated. Chemical treatment and fibre loading generally improved the mechanical properties. Five-hour basic chromium sulphate and sodium bicarbonate-treated coir-polypropylene had the best set of properties among all manufactured composites. Chemical treatment also improved water absorption characteristics. This proves that chemical treatment reduced the hydrophilicity of the coir fibre. Overall the hot compression technique was proved to be successful in manufacturing good quality coir reinforced polypropylene composites
An Integrative Design Framework for New Service Development

Service innovation is focused on customer value creation. At its core, customer-centric service innovation in an increasingly digital world is technology-enabled, human-centered, and process-oriented. This requires a cross-disciplinary, holistic approach to new service design and development (NSD). This paper defines a service strategy-aligned integrative design framework for NSD. It correlates the underlying theories and principles of disparate but interrelated aspects of service design thinking: service strategy, concept, design, experience and architecture into a coherent framework for NSD, consistent with the brand value. Application of the framework to NSD is envisioned to be iterative and holistic, accentuated on continuous organizational and customer learning. The preliminary frameworks efficacy is illustrated using a simplified telecom case example
Normative requirements for business process compliance

Norms regulate the behaviour of their subjects and define what is legal and what is illegal. Norms typically describe the conditions under which they are applicable and the normative effects as a results of their applications. On the other hand, process models specify how a business operation or service is to be carried out to achieve a desired outcome. Norms can have significant impact on how business operations are conducted and they can apply to the whole or part of a business process. For example, they may impose conditions on the different aspects of a process (e.g., perform tasks in a specific sequence (control-flow), at a specific time or within a certain time frame (temporal aspect), by specific people (resources)). We propose a framework that provides the formal semantics of the normative requirements for determining whether a business process complies with a normative document (where a normative document can be understood in a very broad sense, ranging from internal policies to best practice policies, to statutory acts). We also present a classification of normal requirements based on the notion of different types of obligations and the effects of violating these obligations
Mapping-free and assembly-free discovery of inversion breakpoints from raw NGS reads

International audienceWe propose a formal model and an algorithm for detecting inversion breakpoints without a reference genome, directly from raw NGS data. This model is characterized by a fixed size topological pattern in the de Bruijn Graph. We describe precisely the possible sources of false pos- itives and false negatives and we additionally propose a sequence-based filter giving a good trade-off between precision and recall of the method. We implemented these ideas in a prototype called TakeABreak. Ap- plied on simulated inversions in genomes of various complexity (from E. coli to a human chromosome dataset), TakeABreak provided promising results with a low memory footprint and a small computational time
Modeling the geometry of the endoplasmic reticulum network

Conference ProceedingFirst International Conference, AlCoB 2014, held in July 2014 in Tarragona, Spain.We have studied the network geometry of the endoplasmic reticulum by means of graph theoretical and integer programming models. The purpose is to represent this structure as close as possible by a class of finite, undirected and connected graphs the nodes of which have to be either of degree three or at most of degree three. We determine plane graphs of minimal total edge length satisfying degree and angle constraints, and we show that the optimal graphs are close to the ER network geometry. Basically, two procedures are formulated to solve the optimization problem: a binary linear program, that iteratively constructs an optimal solution, and a linear program, that iteratively exploits additional cutting planes from different families to accelerate the solution process. All formulations have been implemented and tested on a series of real-life and randomly generated cases. The cutting plane approach turns out to be particularly efficient for the real-life testcases, since it outperforms the pure integer programming approach by a factor of at least 10. © 2014 Springer International Publishing
Narrowing the complexity gap for colouring (C_s,P_t)-free graphs.

Let k be a positive integer. The k-Colouring problem is to decide whether a graph has a k-colouring. The k-Precolouring Extension problem is to decide whether a colouring of a subset of a graph’s vertex set can be extended to a k-colouring of the whole graph. A k-list assignment of a graph is an allocation of a list — a subset of {1,…,k} — to each vertex, and the List k -Colouring problem asks whether the graph has a k-colouring in which each vertex is coloured with a colour from its list. We prove a number of new complexity results for these three decision problems when restricted to graphs that do not contain a cycle on s vertices or a path on t vertices as induced subgraphs (for fixed positive integers s and t)
The hospitals / residents problem with couples

The Hospitals / Residents problem with Couples (\ud
hrc\ud
) is a\ud
generalisation of the classical Hospitals / Residents problem (\ud
hr\ud
) that\ud
is important in practical applications because it models the case where\ud
couples submit joint preference lists over pairs of (typically geographi-\ud
cally close) hospitals. In this paper we give a new NP-completeness result\ud
for the problem of deciding whether a stable matching exists, in highly\ud
restricted instances of\ud
hrc\ud
, and also an inapproximability bound for find-\ud
ing a matching with the minimum number of blocking pairs in equally\ud
restricted instances of\ud
hrc\ud
. Further, we present a full description of the\ud
first Integer Programming model for finding a maximum cardinality sta-\ud
ble  matching  in  an  instance  of\ud
hrc\ud
and  we  describe  empirical  results\ud
when this model applied to randomly generated instances of\ud
hrc
Natural language processing and information systems : 19th International Conference on Applications of Natural Language to Information Systems, NLDB 2014, Montpellier, France, June 18-20, 2014. Proceedings

Présentation de l'éditeur : This book constitutes the refereed proceedings of the 19th International Conference on Applications of Natural Language to Information Systems, NLDB 2014, held in Montpellier, France, in June 2014. The 13 long papers, 8 short papers, 14 poster papers, and 7 demo papers presented together with 2 invited talks in this volume were carefully reviewed and selected from 73 submissions. The papers cover the following topics: syntactic, lexical and semantic analysis; information extraction; information retrieval; and sentiment analysis and social network
Complex question answering: homogeneous or heterogeneous, which ensemble is better?

This paper applies homogeneous and heterogeneous ensembles to perform the complex question answering task. For the homogeneous ensemble, we employ Support Vector Machines (SVM) as the learning algorithm and use a Cross-Validation Committees (CVC) approach to form several base models. We use SVM, Hidden Markov Models (HMM), Conditional Random Fields (CRF), and Maximum Entropy (MaxEnt) techniques to build different base models for the heterogeneous ensemble. Experimental analyses demonstrate that both ensemble methods outperform conventional systems and heterogeneous ensemble is better
A Linear Interpolation Algorithm for Spectral Filter Array Demosaicking

International audienceLinear interpolation methods have the characteristics of low computational complexity which makes them widely developed in CFA (color filter array) demosaicking. However, the trichromatic nature of colour images enables CFA demosaicking algorithms to take advantage of the luminance-chrominance representation to interpolate the colour planes efficiently and effectively. It seems, however, this does not apply to multispectral images in a straightforward manner. In this paper, we first propose a linear interpolation method for SFA (spectral filter array) demosaicking drawing on the mathematical analysis of mosaicking, demosaicking processes and the idea of residual interpolation. We then compare the performance of the proposed method with that of five other techniques by means of the SSIM index. The result shows that our new algorithm has a good performance with less computing time
Contribution of Color Information in Visual Saliency Model for Videos

International audienceMuch research has been concerned with the contribution of the low level features of a visual scene to the deployment of visual attention. Bottom-up saliency models have been developed to predict the location of gaze according to these features. So far, color besides to brightness, contrast and motion is considered as one of the primary features in computing bottom-up saliency. However, its contribution in guiding eye movements when viewing natural scenes has been debated. We investigated the contribution of color information in a bottom-up visual saliency model. The model efficiency was tested using the experimental data obtained on 45 observers who were eye tracked while freely exploring a large data set of color and grayscale videos. The two datasets of recorded eye positions, for grayscale and color videos, were compared with a luminance-based saliency model. We incorporated chrominance information to the model. Results show that color information improves the performance of the saliency model in predicting eye positions
Idiosyncratic deals for older workers: increased heterogeneity among older workers enhance the need for i-Deals

The rapid aging of the workforce throughout the Western world and parts of Asia,\ud
including Japan and China, poses many challenges on contemporary organizations\ud
(European Commission, 2010 ; Wang & Shultz, 2010 ). The Babyboom generation,\ud
consisting of workers born between 1945 and 1965, constitutes a large part of the\ud
current workforce. Due to decreased fertility rates, there are fewer younger workers\ud
entering the labor market, as a consequence of which the percentage of older workers\ud
is rapidly increasing (Truxillo & Fraccaroli, 2013 ). Consequently, organizations are\ud
increasingly aware that the employee population is changing, and that strategies to\ud
employ, motivate, and retain workers have to be adapted accordingly. It is no longer\ud
suffi cient for organizations to focus on employing younger workers (e.g., through\ud
designing traineeships for graduates), because the infl ux of younger workers in the\ud
labor market is stagnating, which is in particular present in certain sectors, such as\ud
technical occupations and health care (Polat, Bal, & Jansen, 2012 ). Hence, organizations\ud
increasingly will have to rely on older workers, and try to retain older\ud
workers, and motivate them to stay longer in the workforce. Similarly, governments\ud
across Europe are also increasing offi cial retirement ages, and making it fi nancially\ud
less attractive for older workers to retire early (European Commission)
Phase transitions related to the pigeonhole principle

Since Paris introduced them in the late seventies (Paris1978), densities turned out to be useful for studying independence results. Motivated by their simplicity and surprising strength we investigate the combinatorial complexity of two such densities which are strongly related to the pigeonhole principle. The aim is to miniaturise Ramsey's Theorem for $1$-tuples. The first principle uses an unlimited amount of colours, whereas the second has a fixed number of two colours. We show that these principles give rise to Ackermannian growth. After parameterising these statements with respect to a function f:N->N, we investigate for which functions f Ackermannian growth is still preserved
Ontology in Coq for a Guided Message Composition

International audienceNatural language generation is based on messages that represent meanings , and goals that are the usual starting points for communicate. How to help people to provide this conceptual input or, in other words, how to communicate thoughts to the computer? In order to express something, one needs to have something to express as an idea, a thought or a concept. The question is how to represent this. In 2009, Michael Zock, Paul Sabatier and Line Jakubiec-Jamet suggested the building of a resource composed of a linguistically motivated ontology, a dictionary and a graph generator. The ontology guides the user to choose among a set of concepts (or words) to build the message from; the dictionary provides knowledge of how to link the chosen elements to yield a message (compositional rules); the graph generator displays the output in visual form (message graph representing the user's input). While the goal of the ontology is to generate (or analyse) sentences and to guide message composition (what to say), the graph's function is to show at an intermediate level the result of the encoding process. The Illico system already proposes a way to help a user for generating (or analyzing) sentences and guiding their composition. Another system, the Drill Tutor, is an exercise generator whose goal is to help people to become fluent in a foreign language. It helps people (users have to make choices from the interface in order to build their messages) to produce a sentence expressing a message from an idea (or a concept) to its linguistic realization (or a correct sentence given in a foreign language). These two systems led us to consider the representation of the conceptual information into a symbolic language; this representation is encoded in a logic system in order to automatically check conceptual well-formedness of messages. This logic system is the Coq system used here only for its high level language. Coq is based on a typed λ-calculus. It is used for analysing conceptual input interpreted as types and also for specifying general definitions representing messages. These definitions are typed and they will be instanciated for type-checking the conceptual well-formedness of messages. 2 Line Jakubiec-Jame
Learning Two-input Linear and Nonlinear Analog Functions with a Simple
  Chemical System

The current biochemical information processing systems behave in a
predetermined manner because all features are defined during the design phase.
To make such unconventional computing systems reusable and programmable for
biomedical applications, adaptation, learning, and self-modification based on
external stimuli would be highly desirable. However, so far, it has been too
challenging to implement these in wet chemistries. In this paper we extend the
chemical perceptron, a model previously proposed by the authors, to function as
an analog instead of a binary system. The new analog asymmetric signal
perceptron learns through feedback and supports Michaelis-Menten kinetics. The
results show that our perceptron is able to learn linear and nonlinear
(quadratic) functions of two inputs. To the best of our knowledge, it is the
first simulated chemical system capable of doing so. The small number of
species and reactions and their simplicity allows for a mapping to an actual
wet implementation using DNA-strand displacement or deoxyribozymes. Our results
are an important step toward actual biochemical systems that can learn and
adapt.Comment: 13 pages, 4 figures, 2 table
Symbol correspondences for spin systems

The present monograph explores the correspondence between quantum and
classical mechanics in the particular context of spin systems, that is,
SU(2)-symmetric mechanical systems. Here, a detailed presentation of quantum
spin-j systems, with emphasis on the SO(3)-invariant decomposition of their
operator algebras, is followed by an introduction to the Poisson algebra of the
classical spin system and a similarly detailed presentation of its
SO(3)-invariant decomposition. Subsequently, this monograph proceeds with a
detailed and systematic study of general quantum-classical symbol
correspondences for spin-j systems and their induced twisted products of
functions on the 2-sphere. This original systematic presentation culminates
with the study of twisted products in the asymptotic limit of high spin
numbers. In the context of spin systems, it shows how classical mechanics may
or may not emerge as an asymptotic limit of quantum mechanics.Comment: Research Monograph, 171 pages (book format, preliminary version
Proposals for future BPM research directions

Business Process Management has substantially matured over the last two decades. The techniques, methods and systems available to scope, model, analyze, implement, execute, monitor and even mine a process have been scientifically researched and can be in most cases deployed in practice. In fact, many of these BPM capabilities are nowadays a commodity. However, an opportunity-rich environment and rapidly emerging digital disruptions require new BPM capabilities. In light of this context, this paper proposes three future research and development directions for BPM academics and professionals. First, Ambidextrous BPM demands the shift of focus from exploitative to explorative BPM. Second, Value-driven BPM postulates a stronger focus on the desired outcomes as opposed to the available BPM methods. Third, Customer Process Management suggests complementing the dominating internal view of BPM with a stronger, design-inspired view on the process experiences of external stakeholders
Constrained N-body problems

We consider a problem of mass points interacting gravitationally whose motion
is subjected to certain holonomic constraints. The motion of points is
restricted to certain curves and surfaces. We illustrate the complicated
behaviour of trajectories of these systems using Poincar\'e cross sections. For
some models we prove the non-integrability analysing properties of the
differential Galois group of variational equations along certain particular
solutions of considered systems. Also some integrable cases are identified.Comment: Applied Non-Linear Dynamical Systems, ed. Jan Awrejcewicz,
  Proceedings in Mathematics, 201
Efficient template attacks

This is the accepted manuscript version. The final published version is available from http://link.springer.com/chapter/10.1007/978-3-319-08302-5_17.Template attacks remain a powerful side-channel technique to eavesdrop on tamper-resistant hardware. They model the probability distribution of leaking signals and noise to guide a search for secret data values. In practice, several numerical obstacles can arise when implementing such attacks with multivariate normal distributions. We propose efficient methods to avoid these. We also demonstrate how to achieve significant performance improvements, both in terms of information extracted and computational cost, by pooling covariance estimates across all data values. We provide a detailed and systematic overview of many different options for implementing such attacks. Our experimental evaluation of all these methods based on measuring the supply current of a byte-load instruction executed in an unprotected 8-bit microcontroller leads to practical guidance for choosing an attack algorithm.Omar Choudary is a recipient of the Google Europe Fellowship in
Mobile Security, and this research is supported in part by this Google Fellowship