pinecone/core-2020-05-10-deduplication huggingface dataset:
On Ontological Expressivity and Modelling Argumentation Schemes Using COGUI

International audienceKnowledge elicitation, representation and reasoning explanation by / to non computing experts has always been considered as a crafty task due to difficulty of expressing logical statements by non logicians. In this paper, we use the COGUI editor in order to elicit and represent Argumentation Schemes within an inconsis-tent knowledge base. COGUI is a visual, graph based knowledge representation editor compatible with main Semantic Web languages. COGUI allows for default reasoning on top of ontologies. We investigate its use for modelling and reasoning using Argumentation Schemes and discuss the advantages of such representation. We show how this approach can be useful in the practical setting of EcoBioCap where the different Argumentation Schemes can be used to lead reasoning
COSFIRE : a brain-inspired approach to visual pattern recognition

This is a Conference paper presented by the authors at the International Workshop, BrainComp 2013, Cetraro, Italy, July 8-11, 2013The primate visual system has an impressive ability to generalize\ud
and to discriminate between numerous objects and it is robust\ud
to many geometrical transformations as well as lighting conditions.\ud
The study of the visual system has been an active reasearch field in\ud
neuropysiology for more than half a century. The construction of computational\ud
models of visual neurons can help us gain insight in the processing\ud
of information in visual cortex which we can use to provide more\ud
robust solutions to computer vision applications. Here, we demonstrate\ud
how inspiration from the functions of shape-selective V4 neurons can be\ud
used to design trainable filters for visual pattern recognition. We call\ud
this approach COSFIRE, which stands for Combination of Shifted Filter\ud
Responses. We illustrate how a COSFIRE filter can be configured\ud
to be selective for the spatial arrangement of lines and/or edges that\ud
form the shape of a given prototype pattern. Finally, we demonstrate\ud
the effectiveness of the COSFIRE approach in three applications: the\ud
detection of vascular bifurcations in retinal fundus images, the localization\ud
and recognition of traffic signs in complex scenes and the recognition\ud
of handwritten digits. This work is a further step in understanding how\ud
visual information is processed in the brain and how information on pixel\ud
intensities is converted into information about objects. We demonstrate\ud
how this understanding can be used for the design of effective computer\ud
vision algorithms.peer-reviewe
Low-Weight Primes for Lightweight Elliptic Curve Cryptography on 8-bit AVR Processors

Small 8-bit RISC processors and micro-controllers based on the AVR instruction set architecture are widely used in the embedded domain with applications ranging from smartcards over control systems to wireless sensor nodes. Many of these applications require asymmetric encryption or authentication, which has spurred a body of research into implementation aspects of Elliptic Curve Cryptography (ECC) on the AVR platform. In this paper, we study the suitability of a special class of finite fields, the so-called Optimal Prime Fields (OPFs), for a "lightweight" implementation of ECC with a view towards high performance and security. An OPF is a finite field Fp defined by a prime of the form p = u*2^k + v, whereby both u and v are "small" (in relation to 2^k) so that they fit into one or two registers of an AVR processor. OPFs have a low Hamming weight, which allows for a very efficient implementation of the modular reduction since only the non-zero words of p need to be processed. We describe a special variant of Montgomery multiplication for OPFs that does not execute any input-dependent conditional statements (e.g. branch instructions) and is, hence, resistant against certain side-channel attacks. When executed on an Atmel ATmega processor, a multiplication in a 160-bit OPF takes just 3237 cycles, which compares favorably with other implementations of 160-bit modular multiplication on an 8-bit processor. We also describe a performance-optimized and a security-optimized implementation of elliptic curve scalar multiplication over OPFs. The former uses a GLV curve and executes in 4.19M cycles (over a 160-bit OPF), while the latter is based on a Montgomery curve and has an execution time of approximately 5.93M cycles. Both results improve the state-of-the-art in lightweight ECC on 8-bit processors
A Proof-of-Concept for Orthographic Named Entity Correction in Spanish Voice Queries

Proceedings of: 10th International Workshop on Adaptive Multimedia Retrieval. Took place  October 24-25, 2012, in Copenhaguen (Denmark).Automatic speech recognition (ASR) systems are not able to recognize entities that are not present in its vocabulary. The problem considered in this paper is the misrecognition of named entities in Spanish voice queries introducing a proof-of-concept for named entity correction that provides alternative entities to the ones incorrectly recognized or misrecognized by retrieving entities phonetically similar from a dictionary. This system is domain-dependent, using sports news, especially football news, regardless of the automatic speech recognition system used. The correction process exploits the query structure and its semantic information to detect where a named entity appears. The system finds the most suitable alternative entity from a dictionary previously generated with the existing named entities.This work has been partially supported by the Regional Government of
Madrid under the Research Network MA2VICMR (S2009/TIC-1542) and by the Spanish Center
for Industry Technological Development (CDTI, Ministry of Industry, Tourism and Trade)
through the BUSCAMEDIA Project (CEN-20091026).Publicad
Argument Ranking with Categoriser Function

Recently, ranking-based semantics is proposed to rank-order arguments from
the most acceptable to the weakest one(s), which provides a graded assessment
to arguments. In general, the ranking on arguments is derived from the strength
values of the arguments. Categoriser function is a common approach that assigns
a strength value to a tree of arguments. When it encounters an argument system
with cycles, then the categoriser strength is the solution of the non-linear
equations. However, there is no detail about the existence and uniqueness of
the solution, and how to find the solution (if exists). In this paper, we will
cope with these issues via fixed point technique. In addition, we define the
categoriser-based ranking semantics in light of categoriser strength, and
investigate some general properties of it. Finally, the semantics is shown to
satisfy some of the axioms that a ranking-based semantics should satisfy
On Semigroups of Large Particle Systems and their Scaling Asymptotic
  Behavior

We consider semigroups of operators for hierarchies of evolution equations of
large particle systems, namely, of the dual BBGKY hierarchy for marginal
observables and the BBGKY hierarchy for marginal distribution functions. We
establish that the generating operators of the expansions for one-parametric
families of operators of these hierarchies are the corresponding order
cumulants (semi-invariants) of semigroups for the Liouville equations. We also
apply constructed semigroups to the description of the kinetic evolution of
interacting stochastic Markovian processes, modeling the microscopic evolution
of soft active matter. For this purpose we consider the mean field asymptotic
behavior of the semigroup generated by the dual BBGKY hierarchy for marginal
observables. The constructed scaling limit is governed by the set of recurrence
evolution equations, namely, by the Vlasov-type dual hierarchy. Moreover, the
relationships of this hierarchy of evolution equations with the Vlasov-type
kinetic equation with initial correlations are established.Comment: 17 pages. arXiv admin note: text overlap with arXiv:1308.450
Piecewise deterministic Markov processes in biological models

We present a short introduction into the framework of piecewise deterministic
Markov processes. We illustrate the abstract mathematical setting with a series
of examples related to dispersal of biological systems, cell cycle models, gene
expression, physiologically structured populations, as well as neural activity.
General results concerning asymptotic properties of stochastic semigroups
induced by such Markov processes are applied to specific examples.Comment: in: Semigroup of Operators - Theory and Applications, J. Banasiak et
  al. (eds.), Springer Proceedings in Mathematics & Statistics 113, (2015), pp.
  235-25
Parameterized Model-Checking for Timed-Systems with Conjunctive Guards
  (Extended Version)

In this work we extend the Emerson and Kahlon's cutoff theorems for process
skeletons with conjunctive guards to Parameterized Networks of Timed Automata,
i.e. systems obtained by an \emph{apriori} unknown number of Timed Automata
instantiated from a finite set $U_1, \dots, U_n$ of Timed Automata templates.
In this way we aim at giving a tool to universally verify software systems
where an unknown number of software components (i.e. processes) interact with
continuous time temporal constraints. It is often the case, indeed, that
distributed algorithms show an heterogeneous nature, combining dynamic aspects
with real-time aspects. In the paper we will also show how to model check a
protocol that uses special variables storing identifiers of the participating
processes (i.e. PIDs) in Timed Automata with conjunctive guards. This is
non-trivial, since solutions to the parameterized verification problem often
relies on the processes to be symmetric, i.e. indistinguishable. On the other
side, many popular distributed algorithms make use of PIDs and thus cannot
directly apply those solutions
Network Analytics ER Model - Towards a Conceptual View of Network Analytics

This paper proposes a conceptual modelling paradigm for network analysis applications, called the Network Analytics ER model (NAER). Not only data requirements but also query requirements are captured by the conceptual description of network analysis applications. This unified analytical framework allows us to flexibly build a number of topology schemas on the basis of the underlying core schema, together with a collection of query topics that describe topological results of interest. In doing so, we can alleviate many issues in network analysis, such as performance, semantic integrity and dynamics of analysis
A computer-guided approach to website Schema.org design

Schema.org offers to web developers the opportunity to enrich a website’s content with microdata and schema.org. For large websites, implementing microdata can take a lot of time. In general, it is necessary to perform two main activities, for which we lack methods and tools. The first consists in designing what we call the website schema.org, which is the fragment of schema.org that is relevant to the website. The second consists in adding the corresponding microdata tags to the web pages. In this paper, we describe an approach to the design of a website schema.org. The approach consists in using a human-computer task-oriented dialogue, whose purpose is to arrive at that design. We describe a dialogue generator that is domain-independent, but that can be adapted to specific domains. We propose a set of six evaluation criteria that we use to evaluate our approach, and that could be used in future approaches.Peer ReviewedPostprint (author’s final draft
Design principles for plasmonic nanoparticle devices

For all applications of plasmonics to technology it is required to tailor the resonance to the optical system in question. This chapter gives an understanding of the design considerations for nanoparticles needed to tune the resonance. First the basic concepts of plasmonics are reviewed with a focus on the physics of nanoparticles. An introduction to the  amp; 64257;nite element method is given with emphasis on the suitability of the method to nanoplasmonic device simulation. The effects of nanoparticle shape on the spectral position and lineshape of the plasmonic resonance are discussed including retardation and surface curvature effects. The most technologically mportant plasmonic materials are assessed for device applicability and the importance of substrates in light scattering is explained. Finally the application of plasmonic nanoparticles to photovoltaic devices is discusse
Design Principles for Plasmonic Nanoparticle Devices

For all applications of plasmonics to technology it is required to tailor the
resonance to the optical system in question. This chapter gives an
understanding of the design considerations for nanoparticles needed to tune the
resonance. First the basic concepts of plasmonics are reviewed with a focus on
the physics of nanoparticles. An introduction to the finite element method is
given with emphasis on the suitability of the method to nanoplasmonic device
simulation. The effects of nanoparticle shape on the spectral position and
lineshape of the plasmonic resonance are discussed including retardation and
surface curvature effects. The most technologically important plasmonic
materials are assessed for device applicability and the importance of
substrates in light scattering is explained. Finally the application of
plasmonic nanoparticles to photovoltaic devices is discussed.Comment: 29 pages, 15 figures, part of an edited book: "Linear and Non-Linear
  Nanoplasmonics
A Storage-Efficient and Robust Private Information Retrieval Scheme Allowing Few Servers

International audienceSince the concept of locally decodable codes was introduced by Katz and Trevisan in 2000, it is well-known that information the-oretically secure private information retrieval schemes can be built using locally decodable codes. In this paper, we construct a Byzantine ro-bust PIR scheme using the multiplicity codes introduced by Kopparty et al. Our main contributions are on the one hand to avoid full replica-tion of the database on each server; this significantly reduces the global redundancy. On the other hand, to have a much lower locality in the PIR context than in the LDC context. This shows that there exists two different notions: LDC-locality and PIR-locality. This is made possible by exploiting geometric properties of multiplicity codes
Attribute-based signatures with user-controlled linkability

In this paper, we introduce Attribute-Based Signatures with User-Controlled Linkability (ABS-UCL). Attribute-based signatures allow a signer who has enough credentials/attributes to anonymously sign a message w.r.t. some public policy revealing neither the attributes used nor his identity. User-controlled linkability is a new feature which allows a user to make some of his signatures directed at the same recipient linkable while still retaining anonymity. Such a feature is useful for many real-life applications. We give a general framework for constructing ABS-UCL and present an efficient instantiation of the construction that supports multiple attribute authorities
Privacy-Enhanced Participatory Sensing with Collusion Resistance and Data Aggregation

Participatory sensing enables new paradigms and markets for information collection based on the ubiquitous availability of smartphones, but also introduces privacy challenges for participating users and their data. In this work, we review existing security models for privacy-preserving participatory sensing and propose several improvements that are both of theoretical and practical significance. We first address an important drawback of prior work, namely the lack of consideration of collusion attacks that are highly relevant for such multi-user settings. We explain why existing security models are insufficient and why previous protocols become insecure in the presence of colluding parties. We remedy this problem by providing new security and privacy definitions that guarantee meaningful forms of collusion resistance. We propose new collusion-resistant participatory sensing protocols satisfying our definitions: a generic construction that uses anonymous identity-based encryption (IBE) and its practical instantiation based on the Boneh-Franklin IBE scheme. We then extend the functionality of participatory sensing by adding the ability to perform aggregation on the data submitted by the users, without sacrificing their privacy. We realize this through an additively-homomorphic IBE scheme which in turn is constructed by slightly modifying the Boneh-Franklin IBE scheme. From a practical point of view, the resulting scheme is suitable for calculations with small sensor readings/values such as temperature measurements, noise levels, or prices, which is sufficient for many applications of participatory sensing
Relationships between CCZ and EA equivalence classes and corresponding code invariants

Llibre publicat amb motiu de la 8th International Conference, Melbourne, VIC, Australia, November 24-28, 2014The purpose of this paper is to provide a brief survey of CCZ and EA equivalence for functions f : G → N where G and N are finite and N is m abelian, and, for the case f : Z_p^m→ Z_p^m, to investigate two codes derived from f, inspired by these equivalences. In particular we show the dimension of the kernel of each code determines a new invariant of the corresponding equivalence class. We present computational results for p=2 and small m
Minimum Spanning Tree Verification under Uncertainty

In the verification under uncertainty setting, an algorithm is given, for each input item, an uncertainty area that is guaranteed to contain the exact input value, as well as an assumed input value. An update of an input item reveals its exact value. If the exact value is equal to the assumed value, we say that the update verifies the assumed value. We consider verification under uncertainty for the minimum spanning tree (MST) problem for undirected weighted graphs, where each edge is associated with an uncertainty area and an assumed edge weight. The objective of an algorithm is to compute the smallest set of updates with the property that, if the updates of all edges in the set verify their assumed weights, the edge set of an MST can be computed. We give a polynomial-time optimal algorithm for the MST verification problem by relating the choices of updates to vertex covers in a bipartite auxiliary graph. Furthermore, we consider an alternative uncertainty setting where the vertices are embedded in the plane, the weight of an edge is the Euclidean distance between the endpoints of the edge, and the uncertainty is about the location of the vertices. An update of a vertex yields the exact location of that vertex. We prove that the MST verification problem in this vertex uncertainty setting is NP-hard. This shows a surprising difference in complexity between the edge and vertex uncertainty settings of the MST verification problem.Peer-reviewedPost-print40th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2014), Le Domaine de Chalè
Induced disjoint paths in circular-arc graphs in linear time.

The Induced Disjoint Paths problem is to test whether a graph G with k distinct pairs of vertices (si,ti) contains paths P1,…,Pk such that Pi connects si and ti for i=1,…,k, and Pi and Pj have neither common vertices nor adjacent vertices (except perhaps their ends) for 1≤i<j≤k. We present a linear-time algorithm that solves Induced Disjoint Paths and finds the corresponding paths (if they exist) on circular-arc graphs. For interval graphs, we exhibit a linear-time algorithm for the generalization of Induced Disjoint Paths where the pairs (si,ti) are not necessarily distinct
Distributedly Testing Cycle-Freeness

International audienceWe tackle \emph{local distributed testing} of graph properties. This framework is well suited to contexts in which data dispersed among the nodes of a network can be collected by some central authority (like in, e.g., sensor networks). In local distributed testing, each node can provide the central authority with just a few information about what it perceives from its neighboring environment, and, based on the collected information, the central authority is aiming at deciding whether  or not the network satisfies some property. We analyze in depth the prominent example of checking \emph{cycle-freeness}, and establish tight bounds on the amount of information to be transferred by each node to the central authority for deciding cycle-freeness. In particular, we show that distributedly testing cycle-freeness requires at least $\lceil{\log d}\rceil-1$ bits of information per node in graphs with maximum degree~$d$, even for connected graphs. Our proof is based on a novel version of the seminal result by Naor and Stockmeyer (1995) enabling to reduce the study of certain kinds of algorithms to order-invariant algorithms, and on an appropriate use of the  known fact that every free group can be linearly ordered
Deciding the Bell number for hereditary graph properties

The paper [J. Balogh, B. Bollob\'{a}s, D. Weinreich, A jump to the Bell
number for hereditary graph properties, J. Combin. Theory Ser. B 95 (2005)
29--48] identifies a jump in the speed of hereditary graph properties to the
Bell number $B_n$ and provides a partial characterisation of the family of
minimal classes whose speed is at least $B_n$. In the present paper, we give a
complete characterisation of this family. Since this family is infinite, the
decidability of the problem of determining if the speed of a hereditary
property is above or below the Bell number is questionable. We answer this
question positively by showing that there exists an algorithm which, given a
finite set $\mathcal{F}$ of graphs, decides whether the speed of the class of
graphs containing no induced subgraphs from the set $\mathcal{F}$ is above or
below the Bell number. For properties defined by infinitely many minimal
forbidden induced subgraphs, the speed is known to be above the Bell number.Comment: 19 pages; v2, v3: minor improvements in expositio
Sampling Plans for Control-Inspection Schemes Under Independent and
  Dependent Sampling Designs With Applications to Photovoltaics

The evaluation of produced items at the time of delivery is, in practice,
usually amended by at least one inspection at later time points. We extend the
methodology of acceptance sampling for variables for arbitrary unknown
distributions when additional sampling infor- mation is available to such
settings. Based on appropriate approximations of the operating characteristic,
we derive new acceptance sampling plans that control the overall operating
characteristic. The results cover the case of independent sampling as well as
the case of dependent sampling. In particular, we study a modified panel
sampling design and the case of spatial batch sampling. The latter is advisable
in photovoltaic field monitoring studies, since it allows to detect and analyze
local clusters of degraded or damaged modules. Some finite sample properties
are examined by a simulation study, focusing on the accuracy of estimation
Adaptive Estimation for Lévy processes

This chapter is concerned with nonparametric estimation of the Lévy density of a Lévy process. The sample path is observed at $n$ equispaced instants with sampling interval $\Delta$. We develop several nonparametric adaptive methods of estimation based on deconvolution, projection and kernel. The asymptotic framework is: $n$ tends to infinity, $\Delta=\Delta_n$ tends to $0$ while $n\Delta_n$ tends to infinity (high frequency). Bounds for the ${\mathbb L}^2$-risk of estimators are given. Rates of convergence are discussed. Estimation of the drift and Gaussian component coefficients is studied. A specific method for the estimating the jump density of compound Poisson processes is presented. Examples and simulation results illustrate the performance of estimators