pinecone/core-2020-05-10-deduplication huggingface dataset:
On probabilistic models for uncertain sequential pattern mining

We study uncertainty models in sequential pattern mining. We consider situations where there is uncertainty either about a source or an event. We show that both these types of uncertainties could be modelled using probabilistic databases, and give possible-worlds semantics for both. We then describe ”interestingness” criteria based on two notions of frequentness (previously studied for frequent itemset mining) namely expected support [C. Aggarwal et al. KDD’09;Chui et al., PAKDD’07,’08] and probabilistic frequentness [Bernecker et al., KDD’09]. We study the interestingness criteria from a complexity-theoretic perspective, and show that in case of source-level uncertainty, evaluating probabilistic frequentness is #P-complete, and thus no polynomial time algorithms are likely to exist, but evaluate the interestingness predicate in polynomial time in the remaining cases.Peer-reviewedPost-print6th International Conference, ADMA 2010, Chongqing, China, November 19-21, 201
Modelling behaviour requirements for automatic interpretation, simulation and deployment

In this paper we propose a high level approach to capture the behaviour  of an autonomous robotic or embedded system.  Using requirements engineering,  we construct models of the behaviour where system activities  are captured mainly by collaborating state machines while  the domain knowledge is captured by a non-monotonic logic.  We explain our infrastructure that enables interpretation, simulation,  automatic deployment, and testing of the models, minimising the  need for developers to code. The approach also minimises faults  introduced in the software development cycle and ensures a large  part of the software is independent of the particular robotic  platform.Griffith Sciences, School of Information and Communication TechnologyFull Tex
Adaptive management of composite services under percentile-based service level agreements

We present a brokering service for the adaptive management of composite services. The goal of this broker is to dynamically adapt at runtime the composite service configuration, to fulfill the Service Level Agreements (SLAs) negotiated with different classes of requestors, despite variations of the operating environment. Differently from most of the current approaches, where the performance guarantees are characterized only in terms of bounds on average QoS metrics, we consider SLAs that also specify upper bounds on the percentile of the service response time, which are expected to better capture user perceived QoS. The adaptive composite service management is based on a service selection scheme that minimizes the service broker cost while guaranteeing the negotiated QoS to the different service classes. The optimal service selection is determined by means of a linear programming problem that can be efficiently solved. As a result, the proposed approach is scalable and lends itself to an efficient implementation
Managing process model collections with AProMoRe

As organizations reach higher levels of Business Process Management maturity, they tend to collect numerous business process models. Such models may be linked with each other or mutually overlap, supersede one another and evolve over time. Moreover, they may be represented at different abstraction levels depending on the target audience and modeling purpose, and may be available in multiple languages (e.g. due to company mergers). Thus, it is common that organizations struggle with keeping track of their process models. This demonstration introduces AProMoRe (Advanced Process Model Repository) which aims to facilitate the management of (large) process model collections
Random Euclidean Addition Chain Generation and Its Application to Point Multiplication

International audienceEfficiency and security are the two main objectives of every elliptic curve scalar multiplication implementations. Many schemes have been proposed in order to speed up or secure its computation, usually thanks to efficient scalar representation [30,10,24], faster point operation formulae [8,25,13] or new curve shapes [2]. As an alternative to those general methods, authors have suggested to use scalar belonging to some subset with good computational properties [15,14,36,41,42], leading to faster but usually cryptographically weaker systems. In this paper, we use a similar approach. We propose to modify the key generation pro- cess using a small Euclidean addition chain c instead of a scalar k. This allows us to use a previous scheme, secure against side channel attacks, but whose efficiency relies on the computation of small chains computing the scalar. We propose two different ways to generate short Euclidean addition chains and give a first theoretical analysis of the size and dis- tribution of the obtained keys. We also propose a new scheme in the context of fixed base point scalar multiplication
Versatile Pret a Voter: Handling Multiple Election Methods with a Unified Interface

A number of end-to-end veri¯able voting schemes have been introduced recently. These schemes aim to allow voters to verify that their votes have contributed in the way they intended to the tally and in addition allow anyone to verify that the tally has been generated correctly. These goals must be achieved while maintaining voter privacy and providing receipt-freeness. However, most of these end-to-end voting schemes are only designed to handle a single election method and the voter interface varies greatly between different schemes. In this paper, we introduce a scheme which handles many of the popular election methods that are currently used around the world. Our scheme not only ensures privacy, receipt-freeness and end-to-end veri¯ability, but also keeps the voter interface simple and consistent between various election methods
Visualizing activities for self-reflection and awareness

With the large uptake of online learning environments in educational institutions, students and teachers interact no longer solely face-to-face and are often geographically dispersed. Distance education can make it much harder for students to position themselves in the group of fellow students and to self-reflect on their work. The teacher can have similar problems by losing the general overview of the class, which makes it hard to discover potential pitfalls of students in time. To assist with this problem, we have developed a set of visualizations of learner activities to increase awareness and to support self-reflection. This paper discusses those visualizations and evaluates the usability and user satisfaction. From these studies, first preliminary results are available of the usefulness of the tool for the students. A planned future evaluation is discussed to evaluate the real usage and impact of the tool.status: publishe
On Optimizing Locally Linear Nearest Neighbour Reconstructions Using Prototype Reduction Schemes

Published version of an article from the Book: AI 2010: Advances in Artificial Intelligence, Spinger. Also available on Springerlink: http://dx.doi.org/10.1007/978-3-642-17432-2_16This paper concerns the use of Prototype Reduction Schemes (PRS) to optimize the computations involved in typical k-Nearest Neighbor (k-NN) rules. These rules have been successfully used for decades in statistical Pattern Recognition (PR) applications, and have numerous applications because of their known error bounds. For a given data point of unknown identity, the k-NN possesses the phenomenon that it combines the information about the samples from a priori target classes (values) of selected neighbors to, for example, predict the target class of the tested sample. Recently, an implementation of the k-NN, named as the Locally Linear Reconstruction (LLR) [11], has been proposed. The salient feature of the latter is that by invoking a quadratic optimization process, it is capable of systematically setting model parameters, such as the number of neighbors (specified by the parameter, k) and the weights. However, the LLR takes more time than other conventional methods when it has to be applied to classification tasks. To overcome this problem, we propose a strategy of using a PRS to efficiently compute the optimization problem. In this paper, we demonstrate, first of all, that by completely discarding the points not included by the PRS, we can obtain a reduced set of sample points, using which, in turn, the quadratic optimization problem can be computed far more expediently. The values of the corresponding indices are comparable to those obtained with the original training set (i.e., the one which considers all the data points) even though the computations required to obtain the prototypes and the corresponding classification accuracies are noticeably less. The proposed method has been tested on artificial and real-life data sets, and the results obtained are very promising, and has potential in PR applications
Encoding points on hyperelliptic curves over finite fields in deterministic polynomial time

We provide new hash functions into (hyper)elliptic curves over finite fields. These functions aim at instantiating in a secure manner cryptographic protocols where we need to map strings into points on algebraic curves, typically user identities into public keys in pairing-based IBE schemes. Contrasting with recent Icart's encoding, we start from “easy to solve by radicals” polynomials in order to obtain models of curves which in turn can be deterministically “algebraically parameterized”. As a result of this strategy, we obtain a low degree encoding map for Hessian elliptic curves, and for the first time, hashing functions for genus 2 curves. More generally, we present for any genus (more narrowed) families of hyperelliptic curves with this property. The image of these encodings is large enough to be “weak” encodings in the sense of Brier et al. As such they can be easily turned into admissible cryptographic hash functions
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn
  Graphs

Sequence assembly from short reads is an important problem in biology. It is
known that solving the sequence assembly problem exactly on a bi-directed de
Bruijn graph or a string graph is intractable. However finding a Shortest
Double stranded DNA string (SDDNA) containing all the k-long words in the reads
seems to be a good heuristic to get close to the original genome. This problem
is equivalent to finding a cyclic Chinese Postman (CP) walk on the underlying
un-weighted bi-directed de Bruijn graph built from the reads. The Chinese
Postman walk Problem (CPP) is solved by reducing it to a general bi-directed
flow on this graph which runs in O(|E|2 log2(|V |)) time. In this paper we show
that the cyclic CPP on bi-directed graphs can be solved without reducing it to
bi-directed flow. We present a ?(p(|V | + |E|) log(|V |) + (dmaxp)3) time
algorithm to solve the cyclic CPP on a weighted bi-directed de Bruijn graph,
where p = max{|{v|din(v) - dout(v) > 0}|, |{v|din(v) - dout(v) < 0}|} and dmax
= max{|din(v) - dout(v)}. Our algorithm performs asymptotically better than the
bidirected flow algorithm when the number of imbalanced nodes p is much less
than the nodes in the bi-directed graph. From our experimental results on
various datasets, we have noticed that the value of p/|V | lies between 0.08%
and 0.13% with 95% probability
A Dichotomy Theorem for the Approximate Counting of Complex-Weighted
  Bounded-Degree Boolean CSPs

We determine the computational complexity of approximately counting the total
weight of variable assignments for every complex-weighted Boolean constraint
satisfaction problem (or CSP) with any number of additional unary (i.e., arity
1) constraints, particularly, when degrees of input instances are bounded from
above by a fixed constant. All degree-1 counting CSPs are obviously solvable in
polynomial time. When the instance's degree is more than two, we present a
dichotomy theorem that classifies all counting CSPs admitting free unary
constraints into exactly two categories. This classification theorem extends,
to complex-weighted problems, an earlier result on the approximation complexity
of unweighted counting Boolean CSPs of bounded degree. The framework of the
proof of our theorem is based on a theory of signature developed from Valiant's
holographic algorithms that can efficiently solve seemingly intractable
counting CSPs. Despite the use of arbitrary complex weight, our proof of the
classification theorem is rather elementary and intuitive due to an extensive
use of a novel notion of limited T-constructibility. For the remaining degree-2
problems, in contrast, they are as hard to approximate as Holant problems,
which are a generalization of counting CSPs.Comment: A4, 10pt, 20 pages. This revised version improves its preliminary
  version published under a slightly different title in the Proceedings of the
  4th International Conference on Combinatorial Optimization and Applications
  (COCOA 2010), Lecture Notes in Computer Science, Springer, Vol.6508 (Part I),
  pp.285--299, Kailua-Kona, Hawaii, USA, December 18--20, 201
Approximating Multilinear Monomial Coefficients and Maximum Multilinear
  Monomials in Multivariate Polynomials

This paper is our third step towards developing a theory of testing monomials
in multivariate polynomials and concentrates on two problems: (1) How to
compute the coefficients of multilinear monomials; and (2) how to find a
maximum multilinear monomial when the input is a $\Pi\Sigma\Pi$ polynomial. We
first prove that the first problem is \#P-hard and then devise a $O^*(3^ns(n))$
upper bound for this problem for any polynomial represented by an arithmetic
circuit of size $s(n)$. Later, this upper bound is improved to $O^*(2^n)$ for
$\Pi\Sigma\Pi$ polynomials. We then design fully polynomial-time randomized
approximation schemes for this problem for $\Pi\Sigma$ polynomials. On the
negative side, we prove that, even for $\Pi\Sigma\Pi$ polynomials with terms of
degree $\le 2$, the first problem cannot be approximated at all for any
approximation factor $\ge 1$, nor {\em "weakly approximated"} in a much relaxed
setting, unless P=NP. For the second problem, we first give a polynomial time
$\lambda$-approximation algorithm for $\Pi\Sigma\Pi$ polynomials with terms of
degrees no more a constant $\lambda \ge 2$. On the inapproximability side, we
give a $n^{(1-\epsilon)/2}$ lower bound, for any $\epsilon >0,$ on the
approximation factor for $\Pi\Sigma\Pi$ polynomials. When terms in these
polynomials are constrained to degrees $\le 2$, we prove a $1.0476$ lower
bound, assuming $P\not=NP$; and a higher $1.0604$ lower bound, assuming the
Unique Games Conjecture
Evacuation of rectilinear polygons

We investigate the problem of creating fast evacuation plans for buildings
that are modeled as grid polygons, possibly containing exponentially many
cells. We study this problem in two contexts: the ``confluent'' context in
which the routes to exits remain fixed over time, and the ``non-confluent''
context in which routes may change. Confluent evacuation plans are simpler to
carry out, as they allocate contiguous regions to exits; non-confluent
allocation can possibly create faster evacuation plans. We give results on the
hardness of creating the evacuation plans and strongly polynomial algorithms
for finding confluent evacuation plans when the building has two exits. We also
give a pseudo-polynomial time algorithm for non-confluent evacuation plans.
Finally, we show that the worst-case bound between confluent and non-confluent
plans is 2-2/(k+1).Comment: 15 pages, 7 figures; to appear in COCOA 201
Scheduling Packets with Values and Deadlines in Size-bounded Buffers

Motivated by providing quality-of-service differentiated services in the
Internet, we consider buffer management algorithms for network switches. We
study a multi-buffer model. A network switch consists of multiple size-bounded
buffers such that at any time, the number of packets residing in each
individual buffer cannot exceed its capacity. Packets arrive at the network
switch over time; they have values, deadlines, and designated buffers. In each
time step, at most one pending packet is allowed to be sent and this packet can
be from any buffer. The objective is to maximize the total value of the packets
sent by their respective deadlines. A 9.82-competitive online algorithm has
been provided for this model (Azar and Levy. SWAT 2006), but no offline
algorithms have been known yet. In this paper, We study the offline setting of
the multi-buffer model. Our contributions include a few optimal offline
algorithms for some variants of the model. Each variant has its unique and
interesting algorithmic feature. These offline algorithms help us understand
the model better in designing online algorithms.Comment: 7 page
The Networked Common Goods Game

We introduce a new class of games called the networked common goods game
(NCGG), which generalizes the well-known common goods game. We focus on a
fairly general subclass of the game where each agent's utility functions are
the same across all goods the agent is entitled to and satisfy certain natural
properties (diminishing return and smoothness). We give a comprehensive set of
technical results listed as follows.
  * We show the optimization problem faced by a single agent can be solved
efficiently in this subclass. The discrete version of the problem is however
NP-hard but admits an fully polynomial time approximation scheme (FPTAS).
  * We show uniqueness results of pure strategy Nash equilibrium of NCGG, and
that the equilibrium is fully characterized by the structure of the network and
independent of the choices and combinations of agent utility functions.
  * We show NCGG is a potential game, and give an implementation of best/better
response Nash dynamics that lead to fast convergence to an
$\epsilon$-approximate pure strategy Nash equilibrium.
  * Lastly, we show the price of anarchy of NCGG can be as large as
$\Omega(n^{1-\epsilon})$ (for any $\epsilon>0$), which means selfish behavior
in NCGG can lead to extremely inefficient social outcomes
Bounded Search Tree Algorithms for Parameterized Cograph Deletion:
  Efficient Branching Rules by Exploiting Structures of Special Graph Classes

Many fixed-parameter tractable algorithms using a bounded search tree have
been repeatedly improved, often by describing a larger number of branching
rules involving an increasingly complex case analysis. We introduce a novel and
general search strategy that branches on the forbidden subgraphs of a graph
class relaxation. By using the class of $P_4$-sparse graphs as the relaxed
graph class, we obtain efficient bounded search tree algorithms for several
parameterized deletion problems. We give the first non-trivial bounded search
tree algorithms for the cograph edge-deletion problem and the trivially perfect
edge-deletion problems. For the cograph vertex deletion problem, a refined
analysis of the runtime of our simple bounded search algorithm gives a faster
exponential factor than those algorithms designed with the help of complicated
case distinctions and non-trivial running time analysis [21] and computer-aided
branching rules [11].Comment: 23 pages. Accepted in Discrete Mathematics, Algorithms and
  Applications (DMAA
XML Reconstruction View Selection in XML Databases: Complexity Analysis
  and Approximation Scheme

Query evaluation in an XML database requires reconstructing XML subtrees
rooted at nodes found by an XML query. Since XML subtree reconstruction can be
expensive, one approach to improve query response time is to use reconstruction
views - materialized XML subtrees of an XML document, whose nodes are
frequently accessed by XML queries. For this approach to be efficient, the
principal requirement is a framework for view selection. In this work, we are
the first to formalize and study the problem of XML reconstruction view
selection. The input is a tree $T$, in which every node $i$ has a size $c_i$
and profit $p_i$, and the size limitation $C$. The target is to find a subset
of subtrees rooted at nodes $i_1,\cdots, i_k$ respectively such that
$c_{i_1}+\cdots +c_{i_k}\le C$, and $p_{i_1}+\cdots +p_{i_k}$ is maximal.
Furthermore, there is no overlap between any two subtrees selected in the
solution. We prove that this problem is NP-hard and present a fully
polynomial-time approximation scheme (FPTAS) as a solution
Temperature effects on full scale FRP bridge using innovative composite components

Numerous large-scale demonstrator projects around the world have shown the viability of composite materials for bridge applications. Most of the projects have been directed towards the better understanding of bridge behaviour in strength and serviceability. However, the behaviour under different environmental conditions and longer term effects on durability are yet to be fully understood. This paper presents the results of an investigation on effects of temperature change into the structural behaviour of a FRP demonstrator trial bridge. It was installed at the University of Southern Queensland, Toowoomba Campus using innovative sandwich composites. It has been found that temperatures in different locations of the bridge vary for different locations within the bridge. The variation is found to reverse during day and night time. Based on the measured temperature variation, some important recommendations are provided on the effects of temperature for innovative fibre composite bridge
Challenges in the design and delivery of an online postgraduate course in fibre composites

Practicing engineers seek to enhance their careers through upgrading skills. Coursework based postgraduate programs are being offered by various institutions targeting these engineers. While face-to-face lectures are feasible in certain circumstances, these courses are ideally suited for web-based delivery, due its flexibility in learning and teaching. Due to industry driven demand, a postgraduate certificate program was introduced recently at the University of Southern Queensland (USQ), Toowoomba, Australia. One of the courses that was introduced as part this program was Mechanics and Technology of Fibre Composites (ENG8803).  With the expertise developed over the years at USQ through the Centre of Excellence in Engineered Fibre Composites (CEEFC) and the experience of providing online and distance courses at USQ, this was an ideal course within the postgraduate program. One of the major challenges faced in the design and delivery of such courses is the need to cater for a diverse student cohort with varying industry experience. This course was successfully delivered for the first time in 2008 and employed a variety of online assessment tools. The experiences of the author in developing the course on fibre composites within the graduate program and an evaluation on the effectiveness of the diverse assessment strategies from a student learning perspective are presented in this paper. Enhancement to the course materials through multi-media resources will be discussed
On the Grundy number of a graph

International audienceThe Grundy number of a graph $G$, denoted by $\Gamma (G)$, is the largest $k$ such that $G$ has a greedy $k$-colouring, that is a colouring with $k$ colours obtained by applying the greedy algorithm according to some ordering of the vertices of $G$. Trivially $\Gamma(G)\leq \Delta(G)+1$. In this paper, we show that deciding if $\Gamma(G)\leq \Delta(G)$ is NP-complete. We then show that deciding if $\Gamma(G)\geq |V(G)|-k$ is fixed parameter tractable with respect to the parameter $k$