pinecone/core-2020-05-10-deduplication huggingface dataset:
Semantically inactive multiplicatives and words as types

The literature on categorial type logic includes proposals for semantically inactive additives, quantifiers, and modalities (Morrill 1994[17]; Hepple 1990[2]; Moortgat 1997[9]), but to our knowledge there has been no proposal for semantically inactive multiplicatives. In this paper we formulate such a proposal (thus filling a gap in the typology of categorial connectives) in the context of the displacement calculus Morrill et al. (2011[16]), and we give a formulation of words as types whereby for every expression w there is a corresponding type W(w). We show how this machinary can treat the syntax and semantics of collocations involving apparently contentless words such as expletives, particle verbs, and (discontinuous) idioms. In addition, we give an account in these terms of the only known examples treated by Hybrid Type Logical Grammar (HTLG henceforth; Kubota and Levine 2012[4]) beyond the scope of unaugmented displacement calculus: gapping of particle verbs and discontinuous idioms.Peer ReviewedPostprint (author’s final draft
An ACG View on G-TAG and Its g-Derivation

International audienceG-TAG is a Tree Adjoining Grammar (TAG) based formalism which was specifically designed for the task of text generation. Contrary to TAG, the derivation structure becomes primary, as pivot between the conceptual representation and the surface form. This is a shared feature with the encoding of TAG into Abstract Categorial Grammars. This paper propose to study G-TAG from an ACG perspective. We rely on the reversibility property of ACG that makes both parsing and generation fall within a common morphism inversion process. Doing so, we show how to overcome some limitations of G-TAG regarding predicative adjunction and how to propose alternative approaches to some phenomena
Supervised vs. Unsupervised Learning for Intentional Process Model Discovery

International audienceLearning humans' behavior from activity logs requires choos- ing an adequate machine learning technique regarding the situation at hand. This choice impacts signi cantly results reliability. In this paper, Hidden Markov Models (HMMs) are used to build intentional process models (Maps) from activity logs. Since HMMs parameters require to be learned, the main contribution of this paper is to compare supervised and unsupervised learning approaches of HMMs. After a theoretical compari- son of both approaches, they are applied on two controlled experiments to compare the Maps thereby obtained. The results demonstrate using su- pervised learning leads to a poor performance because it imposes binding conditions in terms of data labeling, introduces inherent humans' biases, provides unreliable results in the absence of ground truth, etc. Instead, unsupervised learning obtains e cient Maps with a higher performance and lower humans' effort
How Advanced Change Patterns Impact the Process of Process Modeling

Process model quality has been an area of considerable research efforts. In
this context, correctness-by-construction as enabled by change patterns
provides promising perspectives. While the process of process modeling (PPM)
based on change primitives has been thoroughly investigated, only little is
known about the PPM based on change patterns. In particular, it is unclear what
set of change patterns should be provided and how the available change pattern
set impacts the PPM. To obtain a better understanding of the latter as well as
the (subjective) perceptions of process modelers, the arising challenges, and
the pros and cons of different change pattern sets we conduct a controlled
experiment. Our results indicate that process modelers face similar challenges
irrespective of the used change pattern set (core pattern set versus extended
pattern set, which adds two advanced change patterns to the core patterns set).
An extended change pattern set, however, is perceived as more difficult to use,
yielding a higher mental effort. Moreover, our results indicate that more
advanced patterns were only used to a limited extent and frequently applied
incorrectly, thus, lowering the potential benefits of an extended pattern set
Towards Process-Aware Cross-Organizational Human Resource Management

Finding human resources with the required set of skills, experience, and availability to execute an activity at a specific moment, is a socio-technical challenge for enterprises that use business-process aware systems. On an intra-organizational level, there exists an increasing body of knowledge for automated human-resource management. However, the recent pervasiveness of service-oriented cloud computing combined with mobile devices and big data, has resulted in the emergence of crossorganizational ecosystems in which workforce is distributed. Consequently, human-resource management has to consider more requirements compared to a purely intra-organizational setting. This position paper addresses the gap and describes a set of challenges in the management of human resources in service outsourcing scenarios based on process views and automatic process-view matching. The contribution is a specification of research directions that must be pursued so that resource management successfully adopts the special requirements for scaling to a cross-organizational level. Keywords: human resource management, process matching, process view, resource allocation, resource assignment, service outsourcin
Efficacy of a virtual environment for training ball passing skills in rugby

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-662-43790-2_6We have designed a configurable virtual environment to train rugby ball passing skills. Seeking to validate the system’s ability to correctly aid training, two experiments were performed. Ten participants took part in ball passing activities, which were used to compare the combinations of different user positions relative to the physical screen, the use of stereoscopic presentation and the use of a floor screen to extend the field of view of the virtual scene. Conversely to what was expected, the results indicate that the participants did not respond well to simulated target distances, and only the users physical distance from the screen had an effect on the distance thrown
Reputation-based Cooperation in the Clouds

The popularity of the cloud computing paradigm is opening new opportunities for collaborative computing. In this paper we tackle a fundamental problem in open-ended cloud-based distributed computing platforms, i.e., the quest for potential collaborators. We assume that cloud participants are willing to share their computational resources for shared distributed computing problems, but they are not willing to disclose the details of their resources. Lacking such information, we advocate to rely on reputation scores obtained by evaluating the interactions among participants. More specifically, we propose a methodology to assess, at design time, the impact of different (reputation-based) collaborator selection strategies on the system performance. The evaluation is performed through statistical analysis on a volunteer cloud simulator
Goal-Oriented Monitoring Adaptation : methodology and patterns

This paper argues that autonomic systems need to make their distributed monitoring adaptive in order to improve their “comprehensive” resulting quality; that means both the Quality of Service (QoS), and the Quality of Information (QoI). Thus, we propose a methodology to design monitoring adaptation based on high level objectives (goals) related to the management of quality requirements. One of the advantages of adopting a methodological approach, is that monitoring reconfiguration will be conducted through a consistent adaptation logic. Starting from a model-guided monitoring framework, we introduce our methodology to assist human administrators in eliciting the appropriate quality goals piloting the monitoring. Moreover, some monitoring adaptation patterns falling into reconfiguration dimensions are suggested and exploited in a cloud provider case-study illustrating the adaptation of Quality-Oriented monitoring
Ultrasonically assisted machining of Titanium alloys

This is a book chapter, it was published in the book Machining of Titanium Alloys [© Springer Verlag]. The definitive version is available at: http://link.springer.com/chapter/10.1007/978-3-662-43902-9_6#. The original publication is available at www.springerlink.comIn this chapter we discuss the nuances of a non-conventional machining technique known as ultrasonically assisted machining, which has been used to demonstrate tractable benefits in the machining of titanium alloys. We also demonstrate how further improvements may be achieved by combining this machining technique with the well known advantages of hot machining in metals and alloys
Self similar sets, entropy and additive combinatorics

This article is an exposition of recent results on self-similar sets,
asserting that if the dimension is smaller than the trivial upper bound then
there are almost overlaps between cylinders. We give a heuristic derivation of
the theorem using elementary arguments about covering numbers. We also give a
short introduction to additive combinatorics, focusing on inverse theorems,
which play a pivotal role in the proof. Our elementary approach avoids many of
the technicalities in the original proof but also falls short of a complete
proof. In the last section we discuss how the heuristic argument is turned into
a rigorous one.Comment: 21 pages, 2 figures; submitted to Proceedings of AFRT 2012. v5: more
  typos correcte
Changing the Business Model of a Distance Teaching University

Reference: Koper, E.J.R. (2014) Changing the Business Model of a Distance Teaching University. In R. Huang, Kinshuk, Price, J.K. (eds.), ICT in Education in Global Context: emerging trends report 2013-2014, Lecture Notes in Educational Technology, Heidelberg: Springer Verlag, pp. 185-203
ISBN 978-3-662-43927-2, chapter 11, DOI: 10.1007/978-3-662-43927-2_11In distance educaton teachers and students do not have classroom contact, but the educaton is mainly delivered through distance media. This dependency on technology makes these insttutes extremely sensible for changes in technologies: from tme to tme fundamental shifs in the business model are needed in order to maintain the quality of their ofering. In this chapter a case study is presented of a business model change of the Open University of the Netherlands in the period 2008 – 2013. The triggers for change and the new business model are presented. The implementaton of the business model is discussed in terms of adaptatons in course development (including the use of Open Educatonal Resources), course delivery, ICT infrastructure, and a revised model for the implementaton of innovatons
Improving Key Recovery to 784 and 799 Rounds of Trivium Using Optimized Cube Attacks

International audienceDinur and Shamir have described cube attacks at EUROCRYPT '09 and they have shown how efficient they are on the stream cipher Trivium up to 767 rounds. These attacks have been extended to distinguishers but since this seminal work, no better results on the complexity of key recovery attacks on Trivium have been presented. It appears that the time complexity to compute cubes is expensive and the discovery of linear superpoly also requires the computation of many cubes. In this paper, we increase the number of attacked initialization rounds by improving the time complexity of computing cube and we show attacks that go beyond this bound. We were able to find linear superpoly up to 784 rounds, which leads to an attack requiring 2 39 queries. Using quadratic superpoly, we were also able to provide another attack up to 799 rounds which complexity is 2 40 queries and 2 62 for the exhaustive search part. To achieve such results, we find a way to reduce the density of the polynomials, we look for quadratic relations and we extensively use the Moebius transform to speed up computations for various purposes
Exhausting Demirci-Selçuk Meet-in-the-Middle Attacks Against Reduced-Round AES

International audienceIn this paper, we revisit Demirci and Selçuk meet-in-the-middle attacks on AES. We find a way to automatically model SPN block cipher and meet-in-the-middle attacks that allows to perform exhaustive search of this kind of attacks. This search uses the tool developed by Bouillaguet, Derbez and Fouque at CRYPTO 2011 as a subroutine to solve specific systems. We also take into account ideas introduced by Dunkelman, Keller and Shamir at ASIACRYPT 2010 which can be seen as a new tradeoff of the classical time/memory tradeoff used by Demirci and Selçuk. As a result, we automatically recover all the recent improved attacks of Derbez, Fouque and Jean on AES and we show new improved attacks against 8-rounds of AES-192 and AES-256
ELITE: zEro Links Identity managemenT systEm

International audienceModern day biometric systems, such as those used by governments to issue biometric-based identity cards, maintain a deterministic link between the identity of the user and her biometric information. However, such a link brings in serious privacy concerns for the individual. Sensitive information about the individual can be retrieved from the database by using her biometric information. Individuals, for reasons of privacy therefore, may not want such a link to be maintained. Deleting the link, on the other hand, is not feasible because the information is used for purposes of identification or issuing of identity cards. In this work, we address this dilemma by hiding the biometrics information, and keeping the association between biometric information and identity probabilistic. We extend traditional Bloom filters to store the actual information and propose the SOBER data structure for this purpose. Simultaneously, we address the challenge of verifying an individual under the multitude of traits assumption, so as to guarantee that impersonation is always detected. We discuss real-world impersonation use cases, analyze the privacy limits, and compare our scheme to existing solutions
Privacy-Preserving Multiple Keyword Search on Outsourced Data in the Clouds

International audienceHonest but curious cloud servers can make inferences about the stored encrypted documents and the profile of a user once it knows the keywords queried by her and the keywords contained in the documents. We propose two progressively refined privacy-preserving conjunctive symmetric searchable encryption (PCSSE) schemes that allow cloud servers to perform conjunctive keyword searches on encrypted documents with different privacy assurances. Our scheme generates randomized search queries that prevent the server from detecting if the same set of keywords are being searched by different queries. It is also able to hide the number of keywords in a query as well as the number of keywords contained in an encrypted document. Our searchable encryption scheme is efficient and at the same time it is secure against the adaptive chosen keywords attack
The Bose-Hubbard model is QMA-complete

The Bose-Hubbard model is a system of interacting bosons that live on the
vertices of a graph. The particles can move between adjacent vertices and
experience a repulsive on-site interaction. The Hamiltonian is determined by a
choice of graph that specifies the geometry in which the particles move and
interact. We prove that approximating the ground energy of the Bose-Hubbard
model on a graph at fixed particle number is QMA-complete. In our QMA-hardness
proof, we encode the history of an n-qubit computation in the subspace with at
most one particle per site (i.e., hard-core bosons). This feature, along with
the well-known mapping between hard-core bosons and spin systems, lets us prove
a related result for a class of 2-local Hamiltonians defined by graphs that
generalizes the XY model. By avoiding the use of perturbation theory in our
analysis, we circumvent the need to multiply terms in the Hamiltonian by large
coefficients
Canadians Should Travel Randomly

We study online algorithms for the Canadian Traveller Problem (CTP) introduced by Papadimitriou and Yannakakis in 1991. In this problem, a traveller knows the entire road network in advance, and wishes to travel as quickly as possible from a source vertex s to a destination vertex t, but discovers online that some roads are blocked (e.g., by snow) once reaching them. It is PSPACE-complete to achieve a bounded competitive ratio for this problem. Furthermore, if at most k roads can be blocked, then the optimal competitive ratio for a deterministic online algorithm is 2k + 1, while the only randomized result known is a lower bound of k + 1.
In this paper, we show for the first time that a polynomial time randomized algorithm can beat the best deterministic algorithms, surpassing the 2k + 1 lower bound by an o(1) factor. Moreover, we prove the randomized algorithm achieving a competitive ratio of (1 + [√2 over 2])k + 1 in pseudo-polynomial time. The proposed techniques can also be applied to implicitly represent multiple near-shortest s-t paths.NSC Grant 102-2221-E-007-075-MY3Japan Society for the Promotion of Science (KAKENHI 23240002
Determining majority in networks with local interactions and very small local memory.

We study here the problem of determining the majority type in an arbitrary connected network, each vertex of which has initially two possible types (states). The vertices may have a few additional possible states and can interact in pairs only if they share an edge. Any (population) protocol is required to stabilize in the initial majority, i.e. its output function must interpret the local state of each vertex so that each vertex outputs the initial majority type. We first provide a protocol with 4 states per vertex that always computes the initial majority value, under any fair scheduler. Under the uniform probabilistic scheduler of pairwise interactions, we prove that our protocol stabilizes in expected polynomial time for any network and is quite fast on the clique. As we prove, this protocol is optimal, in the sense that there does not exist any population protocol that always computes majority with fewer than 4 states per vertex. However this does not rule out the existence of a protocol with 3 states per vertex that is correct with high probability (whp). To this end, we examine an elegant and very natural majority protocol with 3 states per vertex, introduced in [2] where its performance has been analyzed for the clique graph. In particular, it determines the correct initial majority type in the clique very fast and whp under the uniform probabilistic scheduler. We study the performance of this protocol in arbitrary networks. We prove that, when the two initial states are put uniformly at random on the vertices, the protocol of [2] converges to the initial majority with probability higher than the probability of converging to the initial minority. In contrast, we present an infinite family of graphs, on which the protocol of [2] can fail, i.e. it can converge to the initial minority type whp, even when the difference between the initial majority and the initial minority is n − Θ(ln n). We also present another infinite family of graphs in which the protocol of [2] takes an expected exponential time to converge. These two negative results build upon a very positive result concerning the robustness of the protocol of [2] on the clique, namely that if the initial minority is at most  n7, the protocol fails with exponentially small probability. Surprisingly, the resistance of the clique to failure causes the failure in general graphs. Our techniques use new domination and coupling arguments for suitably defined processes whose dynamics capture the antagonism between the states involved
Lower Bounds for Oblivious Subspace Embeddings

An oblivious subspace embedding (OSE) for some \(\epsilon\),\(\delta \in (0,1/3)\) and d ≤ m ≤ n is a distribution \(\mathcal{D}\) over \(\mathbb{R}^{m×n}\) such that \(\underset {\Pi \sim \mathcal{D}} {Pr} (\forall x \in W, (1−\epsilon)|| x ||_2≤ || \Pi x ||_2≤(1+\epsilon)|| x||_2)≥1−\delta\) for any linear subspace \(W \subset \mathbb{R}^n\) of dimension d. We prove any OSE with \(\delta < 1/3\) has \(m = \Omega((d + log(1/\delta))/\epsilon^2)\), which is optimal. Furthermore, if every \(\Pi\) in the support of \(\mathcal{D}\) is sparse, having at most s non-zero entries per column, we show tradeoff lower bounds between m and s.Engineering and Applied Science
The tropical shadow-vertex algorithm solves mean payoff games in
  polynomial time on average

We introduce an algorithm which solves mean payoff games in polynomial time
on average, assuming the distribution of the games satisfies a flip invariance
property on the set of actions associated with every state. The algorithm is a
tropical analogue of the shadow-vertex simplex algorithm, which solves mean
payoff games via linear feasibility problems over the tropical semiring
$(\mathbb{R} \cup \{-\infty\}, \max, +)$. The key ingredient in our approach is
that the shadow-vertex pivoting rule can be transferred to tropical polyhedra,
and that its computation reduces to optimal assignment problems through
Pl\"ucker relations.Comment: 17 pages, 7 figures, appears in 41st International Colloquium, ICALP
  2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
A Nivat Theorem for Weighted Timed Automata and Weighted Relative
  Distance Logic

Weighted timed automata (WTA) model quantitative aspects of real-time systems
like continuous consumption of memory, power or financial resources. They
accept quantitative timed languages where every timed word is mapped to a
value, e.g., a real number. In this paper, we prove a Nivat theorem for WTA
which states that recognizable quantitative timed languages are exactly those
which can be obtained from recognizable boolean timed languages with the help
of several simple operations. We also introduce a weighted extension of
relative distance logic developed by Wilke, and we show that our weighted
relative distance logic and WTA are equally expressive. The proof of this
result can be derived from our Nivat theorem and Wilke's theorem for relative
distance logic. Since the proof of our Nivat theorem is constructive, the
translation process from logic to automata and vice versa is also constructive.
This leads to decidability results for weighted relative distance logic.Comment: The final version appeared in the Proceedings of the 41st
  International Colloquium on Automata, Languages, and Programming (ICALP 2014
Randomized Rumor Spreading in Dynamic Graphs

International audienceWe consider the well-studied rumor spreading model in which nodes contact a random neighbor in each round in order to push or pull the rumor. Unlike most previous works which focus on static topologies, we look at a dynamic graph model where an adversary is allowed to rewire the connections between vertices before each round, giving rise to a sequence of graphs, G1, G2, . . . Our first result is a bound on the rumor spreading time in terms of the conductance of those graphs. We show that if the degree of each node does not change much during the protocol (that is, by at most a constant factor), then the spread completes within t rounds for some t such that the sum of conductances of the graphs G1 up to Gt is O(log n). This result holds even against an adaptive adversary whose decisions in a round may depend on the set of informed vertices before the round, and implies the known tight bound with conductance for static graphs. Next we show that for the alternative expansion measure of vertex expansion, the situation is different. An adaptive adversary can delay the spread of rumor significantly even if graphs are regular and have high expansion, unlike in the static graph case where high expansion is known to guarantee fast rumor spreading. However, if the adversary is oblivious, i.e., the graph sequence is decided before the protocol begins, then we show that a bound close to the one for the static case holds for any sequence of regular graphs