pinecone/core-2020-05-10-deduplication huggingface dataset:
Extracting culture or injecting nature? Rewilding in a transatlantic perspective

Of the many challenges facing ecological restoration, the one most often receiving attention is the issue of selecting a goal or target state. In the project of repairing degraded natural systems, do we aim to bring back a pristine, wild state or else a more humanized, pastoral state? Re-wilding is the general label of the former goal, whereas re-gardening might be the best descriptor of the latter effort. To put this in a transatlantic context, North Americans may be much more comfortable rewilding, whereas Europeans are adept at gardening and regardening. Wilderness is traditionally an American thing, and many say that “real” wilderness simply doesn’t exist in Europe, even in northern Scandinavia—and hasn’t for a long time. The puzzle, however, is that today Europeans are increasingly joining Americans in rewilding. Perhaps restorationists on both sides of the Atlantic are simply naturing, re-naturing or new naturing, by bringing back better forms of nature, with little regard to how wild it may be. Has restoration’s transatlantic divide simply dissolved
A Biologically Plausible SOM Representation of the Orthographic Form of 50,000 French Words

International audienceRecently, an important aspect of human visual word recognition has been characterized. The letter position is encoded in our brain using an explicit representation of order based on letter pairs: the open-bigram coding [15]. We hypothesize that spelling has evolved in order to minimize reading errors. Therefore, word recognition using bigrams — instead of letters — should be more efficient. First, we study the influence of the size of the neighborhood, which defines the number of bigrams per word, on the performance of the matching between bigrams and word. Our tests are conducted against one of the best recognition solutions used today by the industry, which matches letters to words. Secondly, we build a cortical map representation of the words in the bigram space — which implies numerous experiments in order to achieve a satisfactory projection. Third, we develop an ultra-fast version of the self-organizing map in order to achieve learning in minutes instead of months
Probability ridges and distortion flows: Visualizing multivariate time series using a variational Bayesian manifold learning method

Time-dependent natural phenomena and artificial processes can often be quantitatively expressed as multivariate time series (MTS). As in any other process of knowledge extraction from data, the analyst can benefit from the exploration of the characteristics of MTS through data visualization. This visualization often becomes difficult to interpret when MTS are modelled using nonlinear techniques. Despite their flexibility, nonlinear models can be rendered useless if such interpretability is lacking. In this brief paper, we model MTS using Variational Bayesian Generative Topographic Mapping Through Time (VB-GTM-TT), a variational Bayesian variant of a constrained hidden Markov model of the manifold learning family defined for MTS visualization. We aim to increase its interpretability by taking advantage of two results of the probabilistic definition of the model: the explicit estimation of probabilities of transition between states described in the visualization space and the quantification of the nonlinear mapping distortion.Peer ReviewedPostprint (author's final draft
Graphical querying of model-driven spreadsheets

This paper presents a graphical interface to query modeldriven spreadsheets, based on experience with previous work and empirical studies in querying systems, to simplify query construction for typical end-users with little to no knowledge of SQL. We briefly show our previous text based model-driven querying system. Afterwards, we detail our graphical model-driven querying interface, explaining each part of the interface and showing an example. To validate our work, we executed
an empirical study, comparing our graphical querying approach to an alternative querying tool, which produced positive results
The 4C spectrum of fundamental behavioral relations for concurrent systems

The design of concurrent software systems, in particular process-aware information systems, involves behavioral modeling at various stages. Recently, approaches to behavioral analysis of such systems have been based on declarative abstractions defined as sets of behavioral relations. However, these relations are typically defined in an ad-hoc manner. In this paper, we address the lack of a systematic exploration of the fundamental relations that can be used to capture the behavior of concurrent systems, i.e., co-occurrence, conflict, causality, and concurrency. Besides the definition of the spectrum of behavioral relations, which we refer to as the 4C spectrum, we also show that our relations give rise to implication lattices. We further provide operationalizations of the proposed relations, starting by proposing techniques for computing relations in unlabeled systems, which are then lifted to become applicable in the context of labeled systems, i.e., systems in which state transitions have semantic annotations. Finally, we report on experimental results on efficiency of the proposed computations
A different approach in an AAL ecosystem: a mobile assistant for the caregiver

Currently the Ambient Assisted Living and the Ambient Intelligence areas are very prolific. There is a demand of security and comfort that should be ensured at people’s homes. The AAL4ALL (ambient assisted living for all) pro-ject aims to develop a unified ecosystem and a certification process, allowing the development of fully compatible devices and services. The UserAccess emerges from the AAL4ALL project, being a demonstration of its validity. The UserAc-cess architecture, implementation, interfaces and test scenario are presented, along with the sensor platform specially developed for the AAL4ALL project.Project "AAL4ALL", co-financed by the European Community Fund FEDER, through COMPETE - Programa Operacional Factores de Competitividade (POFC). Foundation for Science and Technology (FCT), Lisbon, Portugal, through Project PEst-C/CTM/LA0025/2013 and the project PEst-OE/EEI/UI0752/2014.
Project CAMCoF - Context-aware Multimodal Communication Framework funded by ERDF -European Regional Development Fund through the COMPETE Programme (operational programme for competitiveness) and by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project FCOMP-01-0124-FEDER-028980
A Proposal for Processing and Fusioning Multiple Information Sources in Multimodal Dialog Systems

Proceedings of: PAAMS 2014 International Workshops. Agent-based Approaches for the Transportation Modelling and Optimisation (AATMO' 14 ) & Intelligent Systems for Context-based Information Fusion (ISCIF' 14). Salamanca, Spain, June 4-6, 2014.Multimodal dialog systems can be defined as computer systems that process two or more user input modes and combine them with multimedia system output. This paper is focused on the multimodal input, providing a proposal to process and fusion the multiple input modalities in the dialog manager of the system, so that a single combined input is used to select the next system action. We describe an application of our technique to build multimodal systems that process user's spoken utterances, tactile and keyboard inputs, and information related to the context of the interaction. This information is divided in our proposal into external and internal context, user's internal, represented in our contribution by the detection of their intention during the dialog and their emotional state.This work was supported in part by Projects MINECO TEC2012-37832-C02-01, CICYT TEC2011-28626-C02-02, CAM CONTEXTS (S2009/TIC-1485)
Understanding decision quality through satisfaction

"PAAMS 2014 International Workshops, Salamanca, Spain, June 4-6, 2014. Proceedings"One of the most important factors to determine the success of an or-ganization is the quality of decisions made. In order to improve the decisions taken and to strengthen the competitiveness of organizations, systems such as Group Decision Support Systems (GDSSs) have been strongly developed and studied in recent decades. The amount of GDSSs incorporating automatic nego-tiation mechanisms, such as argumentation, is increasing nowadays. The evalu-ation of these mechanisms and the understanding of their real benefits for the organizations is still a hard challenge. In this article, we propose a model that allows a GDSS to measure the participant’s satisfaction with the decision, con-sidering aspects such as problem evaluation, personality, emotions and expecta-tions. This model is intended to enable the understanding of the decision’s qual-ity achieved with an argumentation system and to evaluate its capability to po-tentiate the decision’s quality. The proposed model validates all the assump-tions found in the literature regarding the participant’s satisfaction.This work is supported by FEDER Funds through the “Programa Operacional Fac-tores de Competitividade - COMPETE” program and by National Funds through FCT “Fundação para a Ciência e a Tecnologia” under the project: FCOMP-01-0124-FEDER-PEst-OE/EEI/UI0760/2011 and SFRH/BD/89697/2012
Context aware collaborative computing model for natural disaster management systems

Nowadays, natural disaster management is considered one of the critical issues, where many governments are spending a huge amount of money to master it. And to help these governmental bodies in managing this kind of situation, we used the concept of collaborative computing, to introduce an approach for mobiles to collaborate in order to act as helper agents for other ones with limited resources. Our approach is called the Disaster Pool. And in this paper we highlighted the importance of collaborative computing, have a quick look on previous work, and discuss our approach and the implemented code
Design and evaluation of a smart library using the APEX framework

User experience is a key point for successful ubiquitous computing (ubicomp) environments. The envisaged design should be explored as soon as possible to anticipate potential user problems, thus reducing re-design costs. The development of ubicomp environments' prototypes might help, providing feedback on the users' reaction to the environments. This paper describes the design and evaluation of ubicomp environments using APEX, a rapid prototyping framework providing user experience via a 3D application server and connected physical devices. APEX prototypes allow users to explore and experience many characteristics of a proposed design, in a virtual world. The paper focus in particular the design and evaluation of a smart library in the APEX framework
Towards a framework for adaptive web applications

We have developed a framework to support adaptive elements in Web pages. In particular we focus on adaptive menus. Developers are able to define rules for menu adaptation according to the features of the device and browser in use. This paper briefly describes the selected adaptation patterns and their implementation.This work is funded by ERDF - European Regional Development
Fund through the COMPETE Programme (operational programme
for competitiveness) and by National Funds through the FCT - Fundação para
a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology)
within project FCOMP-01-0124-FEDER-015095
Low-Cost Eye-Trackers: Useful for Information Systems Research?

Research investigating cognitive aspects of information systems is often
dependent on detail-rich data. Eye-trackers promise to provide respective data,
but the associated costs are often beyond the researchers' budget. Recently,
eye-trackers have entered the market that promise eye-tracking support at a
reasonable price. In this work, we explore whether such eye-trackers are of use
for information systems research and explore the accuracy of a low-cost
eye-tracker (Gazepoint GP3) in an empirical study. The results show that
Gazepoint GP3 is well suited for respective research, given that experimental
material acknowledges the limits of the eye-tracker. To foster replication and
comparison of results, all data, experimental material as well as the source
code developed for this study are made available online
Investigating Differences between Graphical and Textual Declarative
  Process Models

Declarative approaches to business process modeling are regarded as well
suited for highly volatile environments, as they enable a high degree of
flexibility. However, problems in understanding declarative process models
often impede their adoption. Particularly, a study revealed that aspects that
are present in both imperative and declarative process modeling languages at a
graphical level-while having different semantics-cause considerable troubles.
In this work we investigate whether a notation that does not contain graphical
lookalikes, i.e., a textual notation, can help to avoid this problem. Even
though a textual representation does not suffer from lookalikes, in our
empirical study it performed worse in terms of error rate, duration and mental
effort, as the textual representation forces the reader to mentally merge the
textual information. Likewise, subjects themselves expressed that the graphical
representation is easier to understand
Similarity analysis within product line scoping: An evaluation of a semi-automatic approach

Abstract. Introducing a product line approach in an organization requires a systematic scoping phase to decide what products and features should be included. Product line scoping is a non-trivial activity and traditionally consumes a lot of time and resources. This issue highlights the need to complement traditional scoping activities with semi-automatic approaches that allow to initially estimate the potential for reuse with small efforts. In this paper we present an evaluation of a tool-supported approach that enables the semi-automatic analysis of existing products in order to calculate their similarity. This approach is tailored to be used within the configuration-based systems domain, where we have used it to identify similarity within two types of industrial standard software products. The results of this evaluation highlight that our approach provides accurate\ud
results and leads to time savings compared to manual similarity analysis
Risk accelerators in disasters : insights from the typhoon Haiyan response on humanitarian information management and decision support

Published version of a chapter in the book: Advanced Information Systems Engineering. Also available from the publisher at: http://dx.doi.org/10.1007/978-3-319-07881-6_2Modern societies are increasingly threatened by disasters that require rapid response through ad-hoc collaboration among a variety of actors and organizations. The complexity within and across today's societal, economic and environmental systems defies accurate predictions and assessments of damages, humanitarian needs, and the impact of aid. Yet, decision-makers need to plan, manage and execute aid response under conditions of high uncertainty while being prepared for further disruptions and failures. This paper argues that these challenges require a paradigm shift: instead of seeking optimality and full efficiency of procedures and plans, strategies should be developed that enable an acceptable level of aid under all foreseeable eventualities. We propose a decision- and goal-oriented approach that uses scenarios to systematically explore future developments that may have a major impact on the outcome of a decision. We discuss to what extent this approach supports robust decision-making, particularly if time is short and the availability of experts is limited. We interlace our theoretical findings with insights from experienced humanitarian decision makers we interviewed during a field research trip to the Philippines in the aftermath of Typhoon Haiyan
Indexing and efficient instance-based retrieval of process models using untanglings

Process-Aware Information Systems (PAISs) support executions of operational processes that involve people, resources, and software applications on the basis of process models. Process models describe vast, often infinite, amounts of process instances, i.e., workflows supported by the systems. With the increasing adoption of PAISs, large process model repositories emerged in companies and public organizations. These repositories constitute significant information resources. Accurate and efficient retrieval of process models and/or process instances from such repositories is interesting for multiple reasons, e.g., searching for similar models/instances, filtering, reuse, standardization, process compliance checking, verification of formal properties, etc. This paper proposes a technique for indexing process models that relies on their alternative representations, called untanglings. We show the use of untanglings for retrieval of process models based on process instances that they specify via a solution to the total executability problem. Experiments with industrial process models testify that the proposed retrieval approach is up to three orders of magnitude faster than the state of the art
What Shall I Do Next? Intention Mining for Flexible Process Enactment

International audienceBesides the benefits of flexible processes, practical implementations of process aware information systems have also revealed difficulties encountered by process participants during enactment. Several support and guidance solutions based on process mining have been proposed, but they lack a suitable semantics for human reasoning and decisions making as they mainly rely on low level activities. Applying design science, we created FlexPAISSeer, an intention mining oriented approach, with its component artifacts: 1) IntentMiner which discovers the intentional model of the executable process in an unsupervised manner; 2) In-tentRecommender which generates recommendations as intentions and confidence factors, based on the mined intentional process model and probabilistic calculus. The artifacts were evaluated in a case study with a Netherlands software company, using a Childcare system that allows flexible data-driven process enactment
An extensible framework for analysing resource behaviour using event logs

Business processes depend on human resources and managers must regularly evaluate the performance of their employees based on a number of measures, some of which are subjective in nature. As modern organisations use information systems to automate their business processes and record information about processes’ executions in event logs, it now becomes possible to get objective information about resource behaviours by analysing data recorded in event logs. We present an extensible framework for extracting knowledge from event logs about the behaviour of a human resource and for analysing the dynamics of this behaviour over time. The framework is fully automated and implements a predefined set of behavioural indicators for human resources. It also provides a means for organisations to define their own behavioural indicators, using the conventional Structured Query Language, and a means to analyse the dynamics of these indicators. The framework's applicability is demonstrated using an event log from a German bank
Playing Dominoes Is Hard, Except by Yourself

Dominoes is a popular and well-known game possibly dating back three millennia. Players are given a set of domino tiles, each with two labeled square faces, and take turns connecting them into a growing chain of dominoes by matching identical faces. We show that single-player dominoes is in P, while multiplayer dominoes is hard: when players cooperate, the game is NP-complete, and when players compete, the game is PSPACE-complete. In addition, we show that these hardness results easily extend to games involving team play
Fun with Fonts: Algorithmic Typography

Over the past decade, we have designed five typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in hinged dissections, geometric tours, origami design, physical simulation, and protein folding. In particular, most of these typefaces include puzzle fonts, where reading the intended message requires solving a series of puzzles which illustrate the challenge of the underlying algorithmic problem
Counting Houses of Pareto Optimal Matchings in the House Allocation Problem

\ud
\ud
In an instance of the house allocation problem two sets A and B are given. The set A is referred to as applicants and the set B is referred to as houses. We denote by m and n the size of A and B respectively. In the house allocation problem, we assume that every applicant a ∈ A has a preference list over every house b ∈ B. We call an injective mapping τ from A to B a matching. A blocking coalition of τ is a subset A′ of A such that there exists a matching τ′ that differs from τ only on elements of A′, and every element of A′ improves in τ′, compared to τ according to its preference list. If there exists no blocking coalition, we call the matching τ an Pareto optimal matching (POM).\ud
\ud
A house b ∈ B is reachable if there exists a Pareto optimal matching using b. The set of all reachable houses is denoted by E *. We show\ud
|E∗|≤∑i=1,…,m⌊mi⌋=Θ(mlogm).\ud
This is asymptotically tight. A set E ⊆ B is reachable (respectively exactly reachable) if there exists a Pareto optimal matching τ whose image contains E as a subset (respectively equals E). We give bounds for the number of exactly reachable sets.We find that our results hold in the more general setting of multi-matchings, when each applicant a of A is matched with ℓ a elements of B instead of just one. Further, we give complexity results and algorithms for corresponding algorithmic questions. Finally, we characterize unavoidable houses, i.e., houses that are used by all POM’s. This yields efficient algorithms to determine all unavoidable elements.\u
Swapping Labeled Tokens on Graphs

Consider a puzzle consisting of n tokens on an n-vertex graph, where each token has a distinct starting vertex and a distinct target vertex it wants to reach, and the only allowed transformation is to swap the tokens on adjacent vertices. We prove that every such puzzle is solvable in O(n [superscript 2]) token swaps, and thus focus on the problem of minimizing the number of token swaps to reach the target token placement. We give a polynomial-time 2-approximation algorithm for trees, and using this, obtain a polynomial-time 2α-approximation algorithm for graphs whose tree α-spanners can be computed in polynomial time. Finally, we show that the problem can be solved exactly in polynomial time on complete bipartite graphs.Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 24.3660)Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 24106010)Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 24700130)Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 25106502)Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 25106504)Japan. Ministry of Education, Culture, Sports, Science and Technology (Japan Society for the Promotion of Science ELC Project Grant 25330003