pinecone/core-2020-05-10-deduplication huggingface dataset:
Estimating file-spread in delay tolerant networks under two-hop routing

We consider a Delay/Disruption Tolerant Network under two-hop routing. Our objective is to estimate and track the degree of spread of a message/file in the network. Indeed, having such real-time information is critical for on-line control of routing and energy expenditure. It also benefits the multi-casting application. With exponential inter-meeting times of mobile nodes: (i) for the estimation problem, we obtain exact expressions for the minimum mean-squared error (MMSE) estimator, and (ii) for the tracking problem, we first derive the diffusion approximations for the system dynamics and the measurements and then apply Kalman filtering. We also apply the solutions of the estimation and filtering problems to predict the time when a certain pre-defined fraction of nodes have received a copy of the message/file. Our analytical results are corroborated with extensive simulation results
Competition between wireless service providers sharing a radio resource

Part 7: Wireless Networks IInternational audienceWe present a model of competition on prices between two telecommunication service providers sharing an access resource, which can for example be the same WiFi spectrum. We obtain a two-level game corresponding to two time scales of decisions: at the smallest time scale, users play an association game by choosing their provider (or none) depending on price, provider reputation and congestion level, and at the largest time scale, providers compete on prices. We show that the association game always has an equilibrium, but that several can exist. The pricing game is then solved by assuming that providers are risk- averse and try to maximize the minimal revenue they can get at a user equilibrium. We illustrate what can be the outcome of this game and that there are situations for which providers can co-exist
Functional encryption for threshold functions (or fuzzy IBE) from lattices

Cryptosystems based on the hardness of lattice problems have recently acquired much importance due to their average-case to worst-case equivalence, their conjectured resistance to quantum cryptanalysis, their ease of implementation and increasing practicality, and, lately, their promising potential as a platform for constructing advanced functionalities.\ud
\ud
In this work, we construct “Fuzzy” Identity Based Encryption from the hardness of the Learning With Errors (LWE) problem. We note that for our parameters, the underlying lattice problems (such as gapSVP or SIVP) are assumed to be hard to approximate within supexponential factors for adversaries running in subexponential time. We give CPA and CCA secure variants of our construction, for small and large universes of attributes. All our constructions are secure against selective-identity attacks in the standard model. Our construction is made possible by observing certain special properties that secret sharing schemes need to satisfy in order to be useful for Fuzzy IBE. We also discuss some obstacles towards realizing lattice-based attribute-based encryption (ABE)
Variants of waters’ dual system primitives using asymmetric pairings

Waters, in 2009, introduced an important technique, called dual system encryption, to construct identity-based encryption (IBE) and related schemes. The resulting IBE scheme was described in the setting of symmetric pairing. A key feature of the construction is the presence of random tags in the ciphertext and decryption key. Later work by Lewko and Waters removed the tags and proceeding through composite-order pairings led to a more efficient dual system IBE scheme using asymmetric pairings whose security is based on non-standard but static assumptions. In this work, we have systematically simplified Waters 2009 IBE scheme in the setting of asymmetric pairing. The simplifications retain tags used in the original description. This leads to several variants, the first one of which is based on standard assumptions and in comparison to Waters’ original scheme reduces ciphertexts and keys by two elements each. Going through several stages of simplifications, we finally obtain a simple scheme whose security can be based on two standard assumptions and a natural and minimal extension of the decision Diffie-Hellman problem for asymmetric pairing groups. The scheme itself is also minimal in the sense that apart from the tags, both encryption and key generation use exactly one randomiser each. This final scheme is more efficient than both the previous dual system IBE scheme in the asymmetric setting due to Lewko and Waters and the more recent dual system IBE scheme due to Lewko. We extend the IBE scheme to hierarchical IBE (HIBE) and broadcast encryption (BE) schemes. Both primitives are secure in their respective full models and have better efficiencies compared to previously known schemes offering the same level and type of security
NTRUCCA : how to strengthen NTRUEncrypt to chosen-ciphertext security in the standard model

NTRUEncrypt is a fast and practical lattice-based public-key encryption scheme, which has been standardized by IEEE, but until recently, its security analysis relied only on heuristic arguments. Recently, Stehlé and Steinfeld showed that a slight variant (that we call pNE) could be proven to be secure under chosen-plaintext attack (IND-CPA), assuming the hardness of worst-case problems in ideal lattices. We present a variant of pNE called NTRUCCA, that is IND-CCA2 secure in the standard model assuming the hardness of worst-case problems in ideal lattices, and only incurs a constant factor overhead in ciphertext and key length over the pNE scheme. To our knowledge, our result gives the first IND-CCA2 secure variant of NTRUEncrypt in the standard model, based on standard cryptographic assumptions.\ud
\ud
As an intermediate step, we present a construction for an All-But-One (ABO) lossy trapdoor function from pNE, which may be of independent interest. Our scheme uses the lossy trapdoor function framework of Peikert and Waters, which we generalize to the case of (k − 1)-of-k-correlated input distributions
Orchestrating Tuple-based Languages

The World Wide Web can be thought of as a global computing architecture supporting the deployment of distributed networked applications. Currently, such applications can be programmed by resorting mainly to two distinct paradigms: one devised for orchestrating distributed services, and the other designed for coordinating distributed (possibly mobile) agents. In this paper, the issue of designing a pro-\ud
gramming language aiming at reconciling orchestration and coordination is investigated. Taking as starting point the orchestration calculus Orc and the tuple-based coordination language Klaim, a new formalism is introduced combining concepts and primitives of the original calculi.\ud
To demonstrate feasibility and effectiveness of the proposed approach, a prototype implementation of the new formalism is described and it is then used to tackle a case study dealing with a simplified but realistic electronic marketplace, where a number of on-line stores allow client\ud
applications to access information about their goods and to place orders
EU democracy and e-democracy: can the two be reconciled?

For many observers neither EU-democracy nor e-democracy exist in any meaningful sense. With regard to the latter this is certainly the case, though this does not mean that we are not witnessing innovative experimentation with information and communication technologies (ICT) in the democratic realm. This chapter focuses on the prospects for e-democratic experimentation in the EU political setting. Drawing on normative democratic theory we look at four dimensions of e-democratic innovation: ICT techniques aimed at improving mechanisms of (1) representation, (2) participation and (3) deliberation and (4) opening new channels of contestation. The aim of the chapter is to survey some recent e-democratic innovations within the framework of these four broader normative visions and, in doing so, investigate the potential impact of ICT driven innovation on EU democratisation
Modeling and control of modern wind turbine systems: An introduction

This chapter provides an introduction to the modeling and control of power
generation from wind turbine systems. In modeling, the focus is on the
electrical components: electrical machine (e.g. permanent-magnet synchronous
generators), back-to-back converter (consisting of machine-side and grid-side
converter sharing a common DC-link), mains filters and ideal (balanced) power
grid. The aerodynamics and the torque generation of the wind turbine are
explained in simplified terms using a so-called power coefficient. The overall
control system is considered. In particular, the phase-locked loop system for
grid-side voltage orientation, the nonlinear speed control system for the
generator (and turbine), and the non-minimum phase DC-link voltage control
system are discussed in detail; based on a brief derivation of the underlying
machine-side and grid-side current control systems. With the help of the power
balance of the wind turbine, the operation management and the control of the
power flow are explained. Concluding simulation results illustrate the overall
system behavior of a controlled wind turbine with a permanent-magnet
synchronous generator.Comment: 75 pages, 46 figures, 5 tables, English translation of book chapter
  "Modellierung und Regelung von modernen Windkraftanlagen: Eine Einf\"uhrung",
  pp. 1540-1614 in Dierk Schr\"oder, "Elektrische Antriebe - Regelung von
  Antriebssystemen", Springer-Vieweg, 201
Inapproximability of (1,2)-Exemplar Distance

International audienceGiven two genomes possibly with duplicate genes, the exemplar distance problem is that of removing all but one copy of each gene in each genome, so as to minimize the distance between the two reduced genomes according to some measure. Let (s, t)-Exemplar Distance denote the exemplar distance problem on two genomes G1 and G2 where each gene occurs at most s times in G1 and at most t times in G2. We show that the simplest non-trivial variant of the exemplar distance problem, (1,2)-Exemplar Distance, is already hard to approximate for a wide variety of distance measures, including popular genome rearrangement measures such as adjacency disruptions and signed reversals, and classic string edit distance measures such as Levenshtein and Hamming distance
Steady State Visual Evoked Potential based Computer Gaming - The Maze

We introduce a game, called "The Maze", as a brain-computer interface (BCI) application in which an avatar is navigated through a maze by analyzing the player's steady-state visual evoked potential (SSVEP) responses recorded with electroencephalography (EEG). The same computer screen is used for displaying the game environment and for the visual stimulation. The algorithms for EEG data processing and SSVEP detection are discussed in depth. We propose the system parameter values, which provide an acceptable trade-off between the game control accuracy and interactivity.status: publishe
Smart material interfaces : a vision

In this paper, we introduce a vision called Smart Material Interfaces (SMIs), which takes advantage of the latest generation of engineered materials that has a special property defined “smart”. They are capable of changing their physical properties, such as shape, size and color, and can be controlled by using certain stimuli (light, potential difference, temperature and so on). We describe SMIs in relation to Tangible User Interfaces (TUIs) to convey the usefulness and a better understanding of SMIs
Multiple Instance Learning for Group Record Linkage

Record linkage is the process of identifying records that refer  to the same entities from different data sources. While most research  efforts are concerned with linking individual records, new approaches  have recently been proposed to link groups of records across databases.  Group record linkage aims to determine if two groups of records in two  databases refer to the same entity or not. One application where group  record linkage is of high importance is the linking of census data that  contain household information across time. In this paper we propose a  novel method to group record linkage based on multiple instance learning.  Our method treats group links as bags and individual record links as  instances. We extend multiple instance learning from bag to instance  classification to reconstruct bags from candidate instances. The classified  bag and instance samples lead to a significant reduction in multiple group  links, thereby improving the overall quality of linked data. We evaluate  our method with both synthetic data and real historical census data.Full Tex
Unsupervised multi-label text classification using a world knowledge ontology

The development of text classification techniques has been
largely promoted in the past decade due to the increasing availability and widespread use of digital documents. Usually, the performance of text classification relies on the quality of categories and the accuracy of classifiers learned from samples. When training samples are unavailable
or categories are unqualified, text classification performance would be degraded. In this paper, we propose an unsupervised multi-label text classification method to classify documents using a large set of categories stored in a world ontology. The approach has been promisingly evaluated by compared with typical text classication methods, using a real-world document collection and based on the ground truth encoded by human experts.
Derivatives of Multilinear Functions of Matrices

Perturbation or error bounds of functions have been of great interest for a
long time. If the functions are differentiable, then the mean value theorem and
Taylor's theorem come handy for this purpose. While the former is useful in
estimating $\|f(A+X)-f(A)\|$ in terms of $\|X\|$ and requires the norms of the
first derivative of the function, the latter is useful in computing higher
order perturbation bounds and needs norms of the higher order derivatives of
the function.
  In the study of matrices, determinant is an important function. Other scalar
valued functions like eigenvalues and coefficients of characteristic polynomial
are also well studied. Another interesting function of this category is the
permanent, which is an analogue of the determinant in matrix theory. More
generally, there are operator valued functions like tensor powers,
antisymmetric tensor powers and symmetric tensor powers which have gained
importance in the past. In this article, we give a survey of the recent work on
the higher order derivatives of these functions and their norms. Using Taylor's
theorem, higher order perturbation bounds are obtained. Some of these results
are very recent and their detailed proofs will appear elsewhere.Comment: 17 page
Comparative Evaluation of Symmetric SVD Algorithms for Real-time Face
  and Eye Tracking

Computation of singular value decomposition (SVD) has been a topic of concern
by many numerical linear algebra researchers. Fast SVD has been a very
effective tool in computer vision in a number of aspects, such as: face
recognition, eye tracking etc. At the present state of the art fast and
fixed-point power efficient SVD algorithm needs to be developed for real-time
embedded computing. The work in this paper is the genesis of an attempt to
build an on-board real-time face and eye tracking system for human drivers to
detect loss of attention due to drowsiness or fatigue. A major function of this
on-board system is quick customization. This is carried out when a new driver
comes in. The face and eye images are recorded while instructing the driver for
making specific poses. The eigen faces and eigen eyes are generated at several
resolution levels and stored in the on-board computer. The discriminating eigen
space of face and eyes are determined and stored in the on-board flash memory
for detection and tracking of face and eyes and classification of eyes (open or
closed) as well. Therefore, fast SVD of image covariance matrix at various
levels of resolution needs to be carried out to generate the eigen database. As
a preliminary step, we review the existing symmetric SVD algorithms and
evaluate their feasibility for such an application. In this article, we compare
the performance of (1) Jacobi's, (2) Hestenes', (3) Golub-Kahan, (4)
Tridiagonalization and Symmetric QR iteration and (5) Tridiagonalization and
Divide and Conquer algorithms. A case study has been demonstrated as an
example.Comment: 20 pages, 4 figures, book chapte
Removal Operations in nD Generalized Maps for Efficient Homology Computation

International audienceIn this paper, we present an efficient way for computing homology generators of nD generalized maps. The algorithm proceeds in two steps: (1) cell removals reduces the number of cells while preserving homology; (2) homology generator computation is performed on the reduced object by reducing incidence matrices into their Smith-Agoston normal form. In this paper, we provide a definition of cells that can be removed while preserving homology. Some results on 2D and 3D homology generators computation are presented
The future internet. Future Internet Assembly 2012: From promises to reality

Irrespective of whether we use economic or societal metrics, the Internet is one of the most important technical infrastructures in existence today. It will serve as a catalyst for much of our innovation and prosperity in the future. A competitive Europe will require Internet connectivity and services beyond the capabilities offered by current technologies. Future Internet research is therefore a must.\ud
The Future Internet Assembly (FIA) is a successful and unique bi-annual conference that brings together participants of over 150 projects from several distinct but interrelated areas in the EU Framework Programme 7.\ud
The 20 full papers included in this volume were selected from 40 submissions, and are preceded by a vision paper describing the FIA Roadmap. The papers have been organized into topical sections on the foundations of Future Internet, the applications of Future Internet, Smart Cities, and Future Internet infrastructures
Design principles for the future internet architecture

Design principles play a central role in the architecture of the Internet as driving most engineering decisions at conception level and operational level. This paper is based on the EC Future Internet Architecture (FIArch) Group results and identifies some of the design principles that we expect to govern the future architecture of the Internet. We believe that it may serve as a starting point and comparison for most research and development projects that target the so-called Future Internet Architecture
From internet architecture research to standards

Many Internet architectural research initiatives have been undertaken over last twenty years. None of them actually reached their intended goal: the evolution of the Internet architecture is still driven by its protocols not by genuine architectural evolutions. As this approach becomes the main limiting factor of Internet growth and application deployment, this paper proposes an alternative research path starting from the root causes (the progressive depletion of the design principles of the Internet) and motivates the need for a common architectural foundation. For this purpose, it proposes a practical methodology to incubate architectural research results as part of the standardization process
Mobile security with location-aware role-based access control

Published version of an article from the book: Security and privacy in mobile information and communication systems. Also available on SpringerLink: http://dx.doi.org/10.1007/978-3-642-30244-2_15This paper describes how location-aware Role-Based Access
Control (RBAC) can be implemented on top of the Geographically eXtensible
Access Control Markup Language (GeoXACML). It furthermore
sketches how spatial separation of duty constraints (both static and dynamic)
can be implemented using GeoXACML on top of the XACML
RBAC profile. The solution uses physical addressing of geographical locations
which facilitates easy deployment of authorisation profiles to the
mobile device. Location-aware RBAC can be used to implement location
dependent access control and also other security enhancing solutions on
mobile devices, like location dependent device locking, firewall, intrusion
prevention or payment anti-fraud systems
Sharing Statistics for SPARQL Federation Optimization, with Emphasis on Benchmark Quality

Federation of semantic data on SPARQL endpoints will allow data to remain distributed so that it can be controlled by local curators and swiftly updated. There are considerable performance problems, which the present work proposes to address, mainly by computation and exposure of statistical digests to assist selectivity estimation. For an objective evaluation as well as comparison of engines, benchmarks that exhaustively covers the parameter space is required. We propose an investigation into this problem using statistical experimental planning.

The Semantic Web: Research and Applications. Lecture Notes in Computer Science Volume 7295, 2012, pp 828-832. The final publication is available at Springe
Professor Da Ruan, Distinguished Visitor at Complutense University, Madrid

This short note is written as a contribution to the memory of Prof. Da Ruan. We shall try to reflect how he was entitled to stay two months (April-May 2011) as “Distinguisher Visitor” at Complutense University, Madrid, based upon his past collaborations without team, and pointing out some of the projects we jointly developed and launched during such a period. Beside the strictly scientific arguments towards his academic excellence, we want to stress his continuous support to explore new initiatives from a sincere and friendly collaboration
Picture-hanging puzzles

We show how to hang a picture by wrapping rope around n nails, making a polynomial number of twists, such that the picture falls whenever any k out of the n nails get removed, and the picture remains hanging when fewer than k nails get removed. This construction makes for some fun mathematical magic performances. More generally, we characterize the possible Boolean functions characterizing when the picture falls in terms of which nails get removed as all monotone Boolean functions. This construction requires an exponential number of twists in the worst case, but exponential complexity is almost always necessary for general functions.National Science Foundation (U.S.) (NSF grant CCF-1018388