pinecone/core-2020-05-10-deduplication huggingface dataset:
Towards Network Games with Social Preferences

Many distributed systems can be modeled as network games: a collection of
selfish players that communicate in order to maximize their individual
utilities. The performance of such games can be evaluated through the costs of
the system equilibria: the system states in which no player can increase her
utility by unilaterally changing her behavior. However, assuming that all
players are selfish and in particular that all players have the same utility
function may not always be appropriate. Hence, several extensions to
incorporate also altruistic and malicious behavior in addition to selfishness
have been proposed over the last years. In this paper, we seek to go one step
further and study arbitrary relationships between participants. In particular,
we introduce the notion of the social range matrix and explore the effects of
the social range matrix on the equilibria in a network game. In order to derive
concrete results, we propose a simplistic network creation game that captures
the effect of social relationships among players.Comment: 12 page
Asynchronous deterministic rendezvous in bounded terrains

Two mobile agents (robots) have to meet in an a priori unknown bounded
terrain modeled as a polygon, possibly with polygonal obstacles. Agents are
modeled as points, and each of them is equipped with a compass. Compasses of
agents may be incoherent. Agents construct their routes, but the actual walk of
each agent is decided by the adversary: the movement of the agent can be at
arbitrary speed, the agent may sometimes stop or go back and forth, as long as
the walk of the agent in each segment of its route is continuous, does not
leave it and covers all of it. We consider several scenarios, depending on
three factors: (1) obstacles in the terrain are present, or not, (2) compasses
of both agents agree, or not, (3) agents have or do not have a map of the
terrain with their positions marked. The cost of a rendezvous algorithm is the
worst-case sum of lengths of the agents' trajectories until their meeting. For
each scenario we design a deterministic rendezvous algorithm and analyze its
cost. We also prove lower bounds on the cost of any deterministic rendezvous
algorithm in each case. For all scenarios these bounds are tight
Constrained variable clustering and the best basis problem in functional
  data analysis

Functional data analysis involves data described by regular functions rather
than by a finite number of real valued variables. While some robust data
analysis methods can be applied directly to the very high dimensional vectors
obtained from a fine grid sampling of functional data, all methods benefit from
a prior simplification of the functions that reduces the redundancy induced by
the regularity. In this paper we propose to use a clustering approach that
targets variables rather than individual to design a piecewise constant
representation of a set of functions. The contiguity constraint induced by the
functional nature of the variables allows a polynomial complexity algorithm to
give the optimal solution
Mixed mode data clustering: an approach based on tectrachoric correlations

In this paper we face the problem of clustering mixedmode data by assuming that the observed binary variables aregenerated from latent continuous variables. We perform a principalcomponents analysis on the matrix of tetrachoric correlations and wethen estimate the scores of each latent variable and construct adata matrix with continuous variables to be used in fully Guassianmixture models or in the k-means cluster analysis. The calculationof the expected a posteriori (EAP) estimates may proceed by simplyconsidering a limited number of quadrature points. Results on asimulation study and on a real data set are reported
An overview of quality of experience measurement challenges for video applications in IP Networks

The increase in multimedia content on the Internet has created a renewed interest in quality assessment. There is however a main difference from the traditional quality assessment approaches, as now, the focus relies on the user perceived quality, opposed to the network centered approach classically proposed. In this paper we overview the most relevant challenges to perform Quality of Experience (QoE) assessment in IP networks and highlight the particular considerations necessary when compared to alternative mechanisms, already deployed, such as Quality of Service (QoS). To assist on the handling of such challenges we first discuss the different approaches to Quality of Experience assessment along with\ud
the most relevant QoE metrics, and then we discuss how they are used to provide\ud
objective results about user satisfaction.Peer ReviewedPostprint (author’s final draft
Quality of experience enforcement in wireless networks

In this paper we present a Multimedia Wireless Management System, which can be used on-line to assess and guarantee the quality of multimedia traffic in a wireless network. The proposed platform uses both network and application layer metrics to build up a scalable quality assessment of multimedia traffic. Moreover, the system provides traffic provisioning capabilities by coordinating the network access and usage both from the wireless node and from the network access point. These two combined features permit our platform to guarantee a\ud
satisfactory multimedia user experience in wireless environments. We evaluate our proposal by issuing an experimental deployment in a testbed and performing\ud
a series of tests under different network situations to demonstrate the Quality of\ud
Experience guaranties of our system. The results show that the quality of video\ud
perceived by end-users is considerably improved compared to the typical wireless\ud
network.Peer ReviewedPostprint (author’s final draft
Fair Quality of Experience (QoE) Measurements Related with Networking Technologies

[Invited Talk] Eighth International Conference on Wired/Wireless Internet Communications (June 1-3, Luleå, Sweden)Proceeding of: 8th International Conference, WWIC 2010, Lulea, Sweden, June 1-3, 2010This paper addresses the topic of Fair QoE measurements in networking. The research of new solutions in networking is oriented to improve the user experience. Any application or service can be im- proved and the deployment of new solutions is mandatory to get the user satisfaction. However, different solutions exist; thus, it is necessary to select the most suitable ones. Nevertheless, this selection is difficult to make since the QoE is subjective and the comparison among different technologies is not trivial. The aim of this paper is to give an overview on how to perform fair QoE measurements to facilitate the study and re- search of new networking solutions and paradigms. However, previously to address this problem, an overview about how networking affects to the QoE is provided.This work has been funded by the CONTENT NoE from the European Commission (FP6- 2005-IST-41) and by the Ministry of Science and Innovation under the CON- PARTE project (MEC, TEC2007-67966-C03-03/TCM) and T2C2 project grant (TIN2008-06739-C04-01).Publicad
Live Traffic Monitoring with Tstat: Capabilities and Experiences

Network monitoring has always played a key role in understanding telecommunication networks since the pioneering time of the Internet. Today, monitoring traffic has become a key element to characterize network usage and users' activities, to understand how complex applications work, to identify anomalous or malicious behaviors, etc. In this paper we present our experience in engineering and deploying Tstat, a passive monitoring tool that has been developed in the past ten years. Started as a scalable tool to continuously monitor packets that flow on a link, Tstat has evolved into a complex application that gives to network researchers and operators the possibility to derive extended and complex measurements. Tstat offers the capability to track traffic flows, it integrates advanced behavioral classifiers that identify the application that has generated a flow, and automatically derives performance indexes that allow to easily characterize both network usage and users' activity. After describing Tstat capabilities and internal design, in this paper we present some examples of measurements collected deploying Tstat at the edge of our campus network for the past year
Matrices as arrows! A biproduct approach to typed linear algebra

Motivated by the need to formalize generation of fast running code for linear algebra applications, we show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the kernel operation of matrix algebra, ranging from its divide-and-conquer version to the conventional, iterative one.
From errant attempts to learn how particular products and coproducts emerge from biproducts, we not only rediscovered block-wise matrix com- binators but also found a way of addressing other operations calculation- ally such as e.g. Gaussian elimination. A strategy for addressing vector- ization along the same lines is also given.FCT,  Mondrian Project funded by contract PTDC/EIA-CCO/108302/2008
Generic point-free lenses

Lenses are one the most popular approaches to define bidirectional transformations between data models. A bidirectional transformation with view-update, denoted a lens, encompasses the definition of a forward transformation projecting concrete models into abstract views, together with a backward transformation instructing how to translate an abstract view to an update over concrete models. In this paper we show that most of the standard point-free combinators can be lifted to lenses with suitable backward semantics, allowing us to use the point-free style to define powerful bidirectional transformations by composition. We also demonstrate how to define generic lenses over arbitrary inductive data types by lifting standard recursion patterns, like folds or unfolds. To exemplify the power of this approach, we “lensify” some standard functions over naturals and lists, which are tricky to define directly “by-hand” using explicit recursion
Designing for light-weight collaboration: the case of interactive citizens' advisory services

This paper reports on the design of a collaborative system to support citizens' advisory services. Recent research on the adoption of collaborative technologies indicates that: a) successful collaborative technologies diffuse from the private sector to the business sector and not vice versa, b) collaborative processes evolve and therefore cannot be prestructured in detail, and c) creative collaboration can be characterized as creating and sharing mental models. We demonstrate how these insights informed our design of a citizens' advisory system and provide data from an evaluation in a German city. Implications for the design of our collaborative system are offered
What do children favor as embodied pedagogical agents?

Embodied Pedagogical Agents (EPA) are increasingly employed in educational applications, for a variety of users and purposes. However, studies have shown that visual appearance, communicative style, and pedagogical roles of agents impact their acceptance, trust, and user interaction. In this paper, we present a study where 86 primary school children (aged 7-11) chose an EPA to 'accompany' them in their learning of multiplications in the ITS application, Multiplintest. The children used two versions of the software, one with an instructor EPA, and another with a learning companion EPA. Additionally, the children selected a visual appearance for each EPA: simplified or detailed, and naturalistic (humanoid-shaped) or stylized (smiley-shaped). Investigations of the possible relationships between pedagogical roles and visual appearance with respect to user preference are outlined, along with the study limitations, and considerations for future work
A Simple Reactive Obstacle Avoidance Algorithm and Its Application in Singapore Harbor

Autonomous surface craft (ASC) are increasingly attractive as a means for performing harbor operations including monitoring and inspection. However, due to the presence of many fixed and moving structures such as pilings, moorings, and vessels, harbor environments are extremely dynamic and cluttered. In order to move autonomously in such conditions ASC’s must be capable of detecting stationary and moving objects and plan their paths accordingly. We propose a simple and scalable online navigation scheme, wherein the relative motion of surrounding obstacles is estimated by the ASC, and the motion plan is modified accordingly at each time step. Since the approach is model-free and its decisions are made at a high frequency, the system is able to deal with highly dynamic scenarios. We deployed ASC’s in the Selat Pauh region of Singapore Harbor to test the technique using a short-range 2-D laser sensor; detection in the rough waters we encountered was quite poor. Nonetheless, the ASC’s were able to avoid both stationary as well as mobile obstacles, the motions of which were unknown a priori. The successful demonstration of obstacle avoidance in the field validates our fast online approach.Massachusetts Institute of Technology. Singapore-MIT Alliance in Research and Technology (SMART
A Subdivision Approach to Planar Semi-algebraic Sets

International audienceSemi-algebraic sets occur naturally when dealing with implicit models and boolean operations between them. In this work we present an algorithm to efficiently and in a certified way compute the connected components of semi-algebraic sets given by intersection or union of conjunctions of bi-variate equalities and inequalities. For any given precision, this algorithm can also provide a polygonal and isotopic approximation of the exact set. The idea is to localize the boundary curves by subdividing the space and then deduce their shape within small enough cells using only boundary information. Then a systematic traversal of the boundary curve graph yields polygonal regions isotopic to the connected components of the semi-algebraic set. Space subdivision is supported by a kd-tree structure and localization is done using Bernstein representation. We conclude by demonstrating our C++ implementation in the CAS Mathemagix
Behavior Effect of Hint Selection Penalties and Availability in an Intelligent Tutoring System

Proceedings of: Tenth International Confererence on Intelligent Tutoring Systems: Bridges to Learning (ITS 2010). Pittsburg, USA, June 14-18, 2010.his paper presents empirical results about the behavior effect of two different hinting strategies applied on exercises within an ITS: having some penalty on the scoring for viewing hints or not having any effect on the scoring; and hints directly available or only available as a result to an incorrect attempt. We analyze the students' behavior differences when these hinting techniques changed, taking into account the type and difficulty of the presented exercises.Work partially funded by the Learn3 project TIN2008-05163/TSI within the Spanish “Plan Nacional de I+D+I”, and the Madrid regional community project eMadrid S2009/TIC-1650.Publicad
Shinren : Non-monotonic trust management for distributed systems

The open and dynamic nature of modern distributed systems and pervasive environments presents signiﬁcant challenges to security management. One solution may be trust management which utilises the notion of trust in order to specify and interpret security policies and make decisions on security-related actions. Most trust management systems assume monotonicity where additional information can only result in the increasing of trust. The monotonic assumption oversimpliﬁes the real world by not considering negative information, thus it cannot handle many real world scenarios. In this paper we present Shinren, a novel non-monotonic trust management system based on bilattice theory and the anyworld assumption. Shinren takes into account negative information and supports reasoning with incomplete information, uncertainty and inconsistency. Information from multiple sources such as credentials, recommendations, reputation and local knowledge can be used and combined in order to establish trust. Shinren also supports prioritisation which is important in decision making and resolving modality conﬂicts that are caused by non-monotonicity
Logics for contravariant simulations

Covariant-contravariant simulation and conformance simulation are two generalizations of the simple notion of simulation which aim at capturing the fact that it is not always the case that “the larger the number of behaviors, the better”. Therefore, they can be considered to be more adequate to express the fact that a system is a correct implementation of some specification. We have previously shown that these two more elaborated notions fit well within the categorical framework developed to study the notion of simulation in a generic way. Now we show that their behaviors have also simple and natural logical characterizations, though more elaborated than those for the plain simulation semantics
Exploiting the Hierarchical Structure of Rule-Based Specifications for Decision Planning

Rule-based specifications have been very successful as a declarative approach in many domains, due to the handy yet solid foundations offered by rule-based machineries like term and graph rewriting. Realistic problems, however, call for suitable techniques to guarantee scalability. For instance, many domains exhibit a hierarchical structure that can be exploited conveniently. This is particularly evident for composition associations of models. We propose an explicit representation of such structured models and a methodology that exploits it for the description and analysis of model- and rule-based systems. The approach is presented in the framework of rewriting logic and its efficient implementation in the rewrite engine Maude and is illustrated with a case study.\ud
The Highest Expected Reward Decoding for HMMs with Application to
  Recombination Detection

Hidden Markov models are traditionally decoded by the Viterbi algorithm which
finds the highest probability state path in the model. In recent years, several
limitations of the Viterbi decoding have been demonstrated, and new algorithms
have been developed to address them
\citep{Kall2005,Brejova2007,Gross2007,Brown2010}.
  In this paper, we propose a new efficient highest expected reward decoding
algorithm (HERD) that allows for uncertainty in boundaries of individual
sequence features. We demonstrate usefulness of our approach on jumping HMMs
for recombination detection in viral genomes
Mod/Resc Parsimony Inference

We address in this paper a new computational biology problem that aims at
understanding a mechanism that could potentially be used to genetically
manipulate natural insect populations infected by inherited, intra-cellular
parasitic bacteria. In this problem, that we denote by \textsc{Mod/Resc
Parsimony Inference}, we are given a boolean matrix and the goal is to find two
other boolean matrices with a minimum number of columns such that an
appropriately defined operation on these matrices gives back the input. We show
that this is formally equivalent to the \textsc{Bipartite Biclique Edge Cover}
problem and derive some complexity results for our problem using this
equivalence. We provide a new, fixed-parameter tractability approach for
solving both that slightly improves upon a previously published algorithm for
the \textsc{Bipartite Biclique Edge Cover}. Finally, we present experimental
results where we applied some of our techniques to a real-life data set.Comment: 11 pages, 3 figure
Sampled Longest Common Prefix Array

When augmented with the longest common prefix (LCP) array and some other
structures, the suffix array can solve many string processing problems in
optimal time and space. A compressed representation of the LCP array is also
one of the main building blocks in many compressed suffix tree proposals. In
this paper, we describe a new compressed LCP representation: the sampled LCP
array. We show that when used with a compressed suffix array (CSA), the sampled
LCP array often offers better time/space trade-offs than the existing
alternatives. We also show how to construct the compressed representations of
the LCP array directly from a CSA.Comment: This is a slightly extended version of the paper that was presented
  at CPM 2010. The implementation is available at
  http://www.cs.helsinki.fi/group/suds/rlcsa
A Minimal Periods Algorithm with Applications

Kosaraju in ``Computation of squares in a string'' briefly described a
linear-time algorithm for computing the minimal squares starting at each
position in a word. Using the same construction of suffix trees, we generalize
his result and describe in detail how to compute in O(k|w|)-time the minimal
k-th power, with period of length larger than s, starting at each position in a
word w for arbitrary exponent $k\geq2$ and integer $s\geq0$. We provide the
complete proof of correctness of the algorithm, which is somehow not completely
clear in Kosaraju's original paper. The algorithm can be used as a sub-routine
to detect certain types of pseudo-patterns in words, which is our original
intention to study the generalization.Comment: 14 page
Succinct Dictionary Matching With No Slowdown

The problem of dictionary matching is a classical problem in string matching:
given a set S of d strings of total length n characters over an (not
necessarily constant) alphabet of size sigma, build a data structure so that we
can match in a any text T all occurrences of strings belonging to S. The
classical solution for this problem is the Aho-Corasick automaton which finds
all occ occurrences in a text T in time O(|T| + occ) using a data structure
that occupies O(m log m) bits of space where m <= n + 1 is the number of states
in the automaton. In this paper we show that the Aho-Corasick automaton can be
represented in just m(log sigma + O(1)) + O(d log(n/d)) bits of space while
still maintaining the ability to answer to queries in O(|T| + occ) time. To the
best of our knowledge, the currently fastest succinct data structure for the
dictionary matching problem uses space O(n log sigma) while answering queries
in O(|T|log log n + occ) time. In this paper we also show how the space
occupancy can be reduced to m(H0 + O(1)) + O(d log(n/d)) where H0 is the
empirical entropy of the characters appearing in the trie representation of the
set S, provided that sigma < m^epsilon for any constant 0 < epsilon < 1. The
query time remains unchanged.Comment: Corrected typos and other minor error
Universal Continuous Variable Quantum Computation in the Micromaser

We present universal continuous variable quantum computation (CVQC) in the
micromaser. With a brief history as motivation we present the background theory
and define universal CVQC. We then show how to generate a set of operations in
the micromaser which can be used to achieve universal CVQC. It then follows
that the micromaser is a potential architecture for CVQC but our proof is
easily adaptable to other potential physical systems.Comment: 12 pages, 4 figures, accepted for a presentation at the 9th
  International Conference on Unconventional Computation (UC10) and LNCS
  proceedings