pinecone/core-2020-05-10-deduplication huggingface dataset:
Reconfiguration of list edge-colorings in a graph

We study the problem of reconfiguring one list edge-coloring of a graph into another list edge-coloring by changing one edge color at a time, while at all times maintaining a list edge-coloring, given a list of allowed colors for each edge. First we show that this problem is PSPACE-complete, even for planar graphs of maximum degree 3 and just six colors. Then we consider the problem restricted to trees. We show that any list edge-coloring can be transformed into any other under the sufficient condition that the number of allowed colors for each edge is strictly larger than the degrees of both its endpoints. This sufficient condition is best possible in some sense. Our proof yields a polynomial-time algorithm that finds a transformation between two given list edge-colorings of a tree with n vertices using O(n [superscript 2]) recolor steps. This worst-case bound is tight: we give an infinite family of instances on paths that satisfy our sufficient condition and whose reconfiguration requires Ω(n [superscript 2]) recolor steps.11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceeding
Integer Programming: Optimization and Evaluation Are Equivalent

We show that if one can find the optimal value of an integer linear programming problem in polynomial time, then one can find an optimal solution in polynomial time. We also present a proper generalization to (general) integer programs and to local search problems of the well-known result that optimization and augmentation are equivalent for 0/1-integer programs. Among other things, our results imply that PLS-complete problems cannot have “near-exact” neighborhoods, unless PLS = P.Link to conference publication published by Springer: http://dx.doi.org/10.1007/978-3-642-03367-4United States. Office of Naval Research (ONR grant N00014-01208-1-0029
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees

Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009.The following tree pattern matching problem is considered: Given two unordered labeled trees P and T, find all occurrences of P in T. Here P and T are called a pattern tree and a target tree, respectively. We first introduce a new problem called the pseudo-tree pattern matching problem. Then we show two efficient bit-parallel algorithms for the pseudo-tree pattern matching problem. One runs in O(L(P).n.l. [h/w]) time and O(n.l.[h/w]) space, and another one runs in O((L(P).n+h.2(l)).[h.l/W]) time and O((n + h.2(l)).[h.l/W]) space, where n is the number of nodes in T, h and l are the height of P and the number of leaves of P, respectively, and W is the length of a computer-word. The parameter L(P), called a recursive level of P, is defined to be the number of occurrences of the same label on a path from the root to a leaf. Hence we have L(P) <= h. Finally, we give an algorithm to extract all occurrences from pseud-occurrences in O(n.L(P).l(3/2)) time and O(n.L(P).l) space
Information theory tools for viewpoint selection, mesh saliency and geometry simplification

In this chapter we review the use of an information channel as a unified framework for viewpoint selection, mesh saliency and geometry simplification. Taking the viewpoint distribution as input and object mesh polygons as output vectors, the channel is given by the projected areas of the polygons over the different viewpoints. From this channel, viewpoint entropy and viewpoint mutual information can be defined in a natural way. Reversing this channel, polygonal mutual information is obtained, which is interpreted as an ambient occlusion-like quantity, and from the variation of this polygonal mutual information mesh saliency is defined. Viewpoint entropy, viewpoint Kullback-Leibler distance, and viewpoint mutual information are then applied to mesh simplification, and shown to compare well with a classical geometrical simplification method
Automatic conflict detection on contracts

Partially supported by the Nordunet3 project COSoDIS: “Contract-Oriented Software Development for Internet Services”.Many software applications are based on collaborating, yet competing, agents or virtual organisations exchanging services. Contracts, expressing obligations, permissions and prohibitions of the different actors, can be used to protect the interests of the organisations engaged in such service exchange. However, the potentially dynamic composition of services with different contracts, and the combination of service contracts with local contracts can give rise to unexpected conflicts, exposing the need for automatic techniques for contract analysis. In this paper we look at automatic analysis techniques for contracts written in the contract language CL. We present a trace semantics of CL suitable for conflict analysis, and a decision procedure for detecting conflicts (together with its proof of soundness, completeness and termination). We also discuss its implementation and look into the applications of the contract analysis approach we present. These techniques are applied to a small case study of an airline check-in desk.peer-reviewe
Regular Expressions with Numerical Constraints and Automata with Counters

Regular expressions with numerical constraints are an extension of regular expressions, allowing to bound numerically the number
of times that a subexpression should be matched. Expressions in this
extension describe the same languages as the usual regular expressions,
but are exponentially more succinct.
We de ne a class of  nite automata with counters and a deterministic
subclass of these. Deterministic  nite automata with counters can rec-
ognize words in linear time. Furthermore, we describe a subclass of the
regular expressions with numerical constraints, a polynomial-time test
for this subclass, and a polynomial-time construction of deterministic
 nite automata with counters from expressions in the subclass
Cryptographic Combinatorial Clock-Proxy Auctions

We present a cryptographic protocol for conducting efficient, provably correct and secrecy-preserving combinatorial clock-proxy auctions. The "clock phase" functions as a trusted auction despite price discovery: bidders submit encrypted bids, and prove for themselves that they meet activity rules, and can compute total demand and thus verify price increases without revealing any information about individual demands. In the sealed-bid "proxy phase", all bids are revealed the auctioneer via time-lapse cryptography and a branch-and-bound algorithm is used to solve the winner-determination problem. Homomorphic encryption is used to prove the correctness of the solution, and establishes the correctness of the solution to any interested party. Still an NP-hard optimization problem, the use of homomorphic encryption imposes additional computational time on winner-determination that is linear in the size of the branch-and-bound search tree, and thus roughly linear in the original (search-based) computational time. The result is a solution that avoids, in the usual case, the exponential complexity of previous cryptographically-secure combinatorial auctions.Engineering and Applied Science
XTaGe: a flexible generation system for complex XML collections

We introduce XTaGe (XML Tester and Generator), a system for the synthesis of XML collections meant for testing and micro benchmarking applications. In contrast with existing approaches, XTaGe focuses on complex collections, by providing a highly extensible framework to introduce controlled variability in XML structures. In this paper we present the theoretical foundation, internal architecture and main features of our generator; we describe its implementation, which includes a GUI to facilitate the specication of collections; we discuss how XTaGe's features compare with those in other XML generation systems; finally, we illustrate its usage by presenting a use case in the bioinformatics domai
Detecting projected outliers in high-dimensional data streams

In this paper, we study the problem of projected outlier detection in high dimensional data streams and propose a new technique, called Stream Projected Ouliter deTector (SPOT), to identify outliers embedded in subspaces. Sparse Subspace Template (SST), a set of subspaces obtained by unsupervised and/or supervised learning processes, is constructed in SPOT to detect projected outliers effectively. Multi-Objective Genetic Algorithm (MOGA) is employed as an effective search method for finding outlying subspaces from training data to construct SST. SST is able to carry out online self-evolution in the detection stage to cope with dynamics of data streams. The experimental results demonstrate the efficiency and effectiveness of SPOT in detecting outliers in high-dimensional data streams
Morphological exploration of shape spaces

International audienceThe aim of this paper is to propose efficient tools for analysing shape families using morphological operators. The developments include the definition of shape statistics (mean and variance of shapes, modes of shape variation) and the interpolation/extrapolation in shape geodesic paths. The main required ingredients for the operators and the algorithms here introduced are well known in mathematical morphology such as the median set, the watershed on distance functions or the interpolation function. In addition, the projection of shapes in spaces with reduced dimensions using PCA or ISOMAP techniques permits to apply morphological interpolation techniques in shape manifolds
Optimising decision trees using multi-objective particle swarm optimisation

Copyright © 2009 Springer-Verlag Berlin Heidelberg. The final publication is available at link.springer.comBook title: Swarm Intelligence for Multi-objective Problems in Data MiningSummary.

Although conceptually quite simple, decision trees are still among the most popular classifiers applied to real-world problems. Their popularity is due to a number of factors – core among these is their ease of comprehension, robust performance and fast data processing capabilities. Additionally feature selection is implicit within the decision tree structure.

This chapter introduces the basic ideas behind decision trees, focusing on decision trees which only consider a rule relating to a single feature at a node (therefore making recursive axis-parallel slices in feature space to form their classification boundaries). The use of particle swarm optimization (PSO) to train near optimal decision trees is discussed, and PSO is applied both in a single objective formulation (minimizing misclassification cost), and multi-objective formulation (trading off misclassification rates across classes).

Empirical results are presented on popular classification data sets from the well-known UCI machine learning repository, and PSO is demonstrated as being fully capable of acting as an optimizer for trees on these problems. Results additionally support the argument that multi-objectification of a problem can improve uni-objective search in classification problems
Mars climate engineering using orbiting solar reflectors

The manned mission is seen as a first step towards a Mars surface exploration base-station and, later, establishing permanent settlement. The location and use of Mars's natural resources is vital to enable cost-effective long-duration human exploration and exploitation missions as well as subsequent human colonization. Planet resources include various crust-lodged materials, a low-pressure natural atmosphere, assorted forms of utilizable energy, lower gravity than Earth's, and ground placement advantages relative to human operability and living standards. Power resources may include using solar and wind energy, importation of nuclear reactors and the harvesting of geothermal potential. In fact, a new branch of human civilization could be established permanently on Mars in the next century. But, meantime, an inventory and proper social assessment of Mars's prospective energy and material resources is required. This book investigates the possibilities and limitations of various systems supplying manned bases on Mars with energy and other vital resources. The book collects together recent proposals and innovative options and solutions. It is a useful source of condensed information for specialists involved in current and impending Mars-related activities and a good starting point for young researchers
Space as a resource in creative design practices

Based on longitudinal ethnographic fieldwork in two industrial design departments and two design companies, we explore the role of spatial arrangements for supporting creative design practices within different design studios. From our results, we show that designers explicitly make use of the physical space for:\ud
\ud
1) communicating and inspiring design ideas;\ud
\ud
2) exploring design solutions, and; \ud
\ud
3) managing design projects. \ud
\ud
We believe that these design practices could bring insightful implications for developing ubiquitous technologies to support the design profession
AirMouse: Finger Gesture for 2D and 3D Interaction

International audienceThis paper presents AirMouse, a new interaction technique based on finger gestures above the laptop's keyboard. At a reasonably low cost, the technique can replace the traditional methods for pointing in two or three dimensions. Moreover, the device-switching time is reduced and no additional surface than the one for the laptop is needed. In a 2D pointing evaluation, a vision-based implementation of the technique is compared with commonly used devices. The same implementation is also compared with the two most commonly used 3D pointing devices. The two user experiments show the benefits of the polyvalent technique: it is easy to learn, intuitive and efficient by providing good performance. In particular, our conducted experiment shows that performance with AirMouse is promising in comparison with a touchpad and with dedicated 3D pointing devices. It shows that AirMouse offers better performance as compared to FlowMouse, a previous solution using fingers above the keyboard
When joy matters: the importance of hedonic stimulation in collocated collaboration with large-displays

Hedonic aspects are increasingly considered as an important factor in\ud
user acceptance of information systems, especially for activities with high\ud
self-fulfilling value for the users. In this paper we report on the results of an experiment\ud
investigating the hedonic qualities of an interactive large-display\ud
workspace for collocated collaboration in sales-oriented travel advisory. The results\ud
show a higher hedonic stimulation quality of a touch-based large-display\ud
travel advisory workspace than that of a traditional workspace with catalogues.\ud
Together with the feedback of both customers and travel agents this suggests\ud
the adequacy of using touch-based large-displays with visual workspaces for\ud
supporting the hedonic stimulation of user experience in collocated collaboration\ud
settings. The relation of high perception of hedonic quality to positive emotional\ud
attitudes towards the use of a large-display workspace indicates that even\ud
in utilitarian activities (e.g. reaching sales goals for travel agents) hedonic\ud
aspects can play an important role. This calls for reconsidering the traditional\ud
divide of hedonic vs. utilitarian systems in current literature, to a more balanced\ud
view towards systems which provide both utilitarian and hedonic sources of\ud
value to the user
Improved Inapproximability Results for Maximum k-Colorable Subgraph

We study the maximization version of the fundamental graph coloring problem.
Here the goal is to color the vertices of a k-colorable graph with k colors so
that a maximum fraction of edges are properly colored (i.e. their endpoints
receive different colors). A random k-coloring properly colors an expected
fraction 1-1/k of edges. We prove that given a graph promised to be
k-colorable, it is NP-hard to find a k-coloring that properly colors more than
a fraction ~1-O(1/k} of edges. Previously, only a hardness factor of 1-O(1/k^2)
was known. Our result pins down the correct asymptotic dependence of the
approximation factor on k. Along the way, we prove that approximating the
Maximum 3-colorable subgraph problem within a factor greater than 32/33 is
NP-hard. Using semidefinite programming, it is known that one can do better
than a random coloring and properly color a fraction 1-1/k +2 ln k/k^2 of edges
in polynomial time. We show that, assuming the 2-to-1 conjecture, it is hard to
properly color (using k colors) more than a fraction 1-1/k + O(ln k/ k^2) of
edges of a k-colorable graph.Comment: 16 pages, 2 figure
On the optimality of gluing over scales

We show that for every $\alpha > 0$, there exist $n$-point metric spaces
(X,d) where every "scale" admits a Euclidean embedding with distortion at most
$\alpha$, but the whole space requires distortion at least $\Omega(\sqrt{\alpha
\log n})$. This shows that the scale-gluing lemma [Lee, SODA 2005] is tight,
and disproves a conjecture stated there. This matching upper bound was known to
be tight at both endpoints, i.e. when $\alpha = \Theta(1)$ and $\alpha =
\Theta(\log n)$, but nowhere in between.
  More specifically, we exhibit $n$-point spaces with doubling constant
$\lambda$ requiring Euclidean distortion $\Omega(\sqrt{\log \lambda \log n})$,
which also shows that the technique of "measured descent" [Krauthgamer, et.
al., Geometric and Functional Analysis] is optimal. We extend this to obtain a
similar tight result for $L_p$ spaces with $p > 1$.Comment: minor revision
Testing +/- 1-Weight Halfspaces

We consider the problem of testing whether a Boolean function f:{ − 1,1} [superscript n]   →{ − 1,1} is a ±1-weight halfspace, i.e. a function of the form f(x) = sgn(w [subscript 1]  x [subscript 1] + w [subscript 2]  x [subscript 2 ]+ ⋯ + w [subscript n]   x [subscript n]  ) where the weights w   i   take values in { − 1,1}. We show that the complexity of this problem is markedly different from the problem of testing whether f is a general halfspace with arbitrary weights. While the latter can be done with a number of queries that is independent of n [7], to distinguish whether f is a ±-weight halfspace versus ε-far from all such halfspaces we prove that nonadaptive algorithms must make Ω(logn) queries. We complement this lower bound with a sublinear upper bound showing that $O(\sqrt{n}\cdot $poly$(\frac{1}{\epsilon}))$ queries suffice
Learning knowledge management concepts via the use of a scenario building tool on an e-learning platform

As e-learning or blended learning is more and more popular these days, but with the lack of certain tools, most of the e-learning objects are just simple PowerPoint files, PDF files, Word documents, HTML files or simple Flash files uploaded to a Learning Management System. On many occasions, instructors cannot devote sufficient energy nor time to develop more interesting flash or animations for their subjects. In this paper, we proposed a scenario building and execution tool that supports the learning and application of knowledge harnessing and sharing techniques for knowledge management subjects. This system takes a Web 2.0 approach which ultimately not only instructors but learners can also contribute to scenario building and executions.Department of Industrial and Systems EngineeringDepartment of Industrial and Systems EngineeringAuthor name used in this publication: Teresa B. Y. LiewAuthor name used in this publication: Patrick S. W. FongAuthor name used in this publication: Adela LauRefereed conference paper2009-2010 > Academic research: refereed > Refereed conference paperpreprint_postprin
A distributed exact solution to compute inter-domain multi-constrained paths

International audienceThe fundamental Quality of Service (QoS) routing problem, which consists in determining paths subject to multiple QoS constraints, has been extensively investigated in the intra-domain context. However, few solutions exist for the inter-domain case, despite the importance of this problem to enable the delivery of services with QoS across domain boundaries.We propose a method that distributes the operations to compute inter-domain constrained paths. This method relies on a per-domain formulation that is compatible with the path computation element framework. It enables us to propose the first algorithm that guarantees to find optimal paths subject to an arbitrary number of constraints. These paths ensure the best QoS performance with respect to the constraints
Implementation and evaluation of the enhanced header compression (IPHC) for 6LoWPAN

6LoWPAN defines how to carry IPv6 packets over IEEE 802.15.4\ud
low power wireless or sensor networks. Limited bandwidth, memory and energy\ud
resources require a careful application of IPv6 in a LoWPAN. The\ud
IEEE 802.15.4 standard defines a maximum frame size of 127 bytes that decreases\ud
to 102 bytes considering the header overhead. A further reduction is due\ud
to the security, network and transport protocols header overhead that, in case of\ud
IPv6 and UDP, leave only 33 bytes for application data. A compression algorithm\ud
is necessary in order to reduce the overhead and save space in data payload.\ud
This paper describes and compares the proposed IPv6 header compression\ud
mechanisms for 6LoWPAN environments.Postprint (published version
Context aware programmable trackers for the next generation Internet

This work introduces and proposes the concept of context
aware programmable trackers for the next generation Internet. The pro-
posed solution gives ground for the development of advanced applications
based on the P2P paradigm and will foster collaborative efforts among
several network entities (e.g. P2P applications and ISPs). The proposed
concept of context aware programmable trackers allows that several peer
selection strategies might be supported by a P2P tracker entity able to
improve the peer selection decisions according with pre-defined objectives
and external inputs provided by specific services. The flexible, adaptive
and enhanced peer selection semantics that might be achieved by the
proposed solution will contribute for devising novel P2P based services
and business models for the future Internet
Data sharing in DHT based P2P systems

International audienceThe evolution of peer-to-peer (P2P) systems triggered the building of large scale distributed applications. The main application domain is data sharing across a very large number of highly autonomous participants. Building such data sharing systems is particularly challenging because of the "extreme" characteristics of P2P infrastructures: massive distribution, high churn rate, no global control, potentially untrusted participants... This article focuses on declarative querying support, query optimization and data privacy on a major class of P2P systems, that based on Distributed Hash Table (P2P DHT). The usual approaches and the algorithms used by classic distributed systems and databases forproviding data privacy and querying services are not well suited to P2P DHT systems. A considerable amount of work was required to adapt them for the new challenges such systems present. This paper describes the most important solutions found. It also identies important future research trends in data management in P2P DHT systems