pinecone/core-2020-05-10-deduplication huggingface dataset:
Schema Normalization for Improving Schema Matching

Schema matching is the problem of finding relationships among concepts across heterogeneous data sources (heterogeneous in format and in structure). Starting from the \hidden meaning" associated to schema labels (i.e. class/attribute names) it is possible to discover relationships among the elements of different schemata. Lexical annotation (i.e. annotation w.r.t. a thesaurus/lexical resource) helps in associating a “meaning" to schema labels. However, accuracy of semi-automatic lexical annotation methods on real-world schemata suffers from the abundance of non-dictionary words such as compound nouns and word abbreviations.In this work, we address this problem by proposing a method to perform schema labels normalization which increases the number of comparable labels. Unlike other solutions, the method semi-automatically expands abbreviations and annotates compound terms, without a minimal manual effort. We empirically prove that our normalization method helps in the identification of similarities among schema elements of different data sources, thus improving schema matching accuracy
Parallel hybrid particle swarm optimization and applications in geotechnical engineering.

A novel parallel hybrid particle swarm optimization algorithm named hmPSO is presented. The new algorithm combines particle swarm optimization (PSO) with a local search method which aims to accelerate the rate of convergence. The PSO provides initial guesses to the local search method and the local search accelerates PSO with its solutions. The hybrid global optimization algorithm adjusts its searching space through the local search results. Parallelization is based on the client-server model, which is ideal for asynchronous distributed computations. The server, the center of data exchange, manages requests and coordinates the time-consuming objective function computations undertaken by individual clients which locate in separate processors. A case study in geotechnical engineering demonstrates the effectiveness and efficiency of the proposed algorithm
Strongly secure authenticated key exchange without NAXOS' approach

4th International Workshop on Security, IWSEC 2009; Toyama; Japan; 28 October 2009 through 30 October 2009LaMacchia, Lauter and Mityagin [15] proposed the extended Canetti-Krawczyk (eCK) model and an AKE protocol, called NAXOS. Unlike previous security models, the adversary in the eCK model is allowed to obtain ephemeral secret information related to the test session, which makes the security proof difficult. To overcome this NAXOS combines an ephemeral private key x with a static private key a to generate an ephemeral public key X; more precisely X∈=∈g H(x,a). As a result, no one is able to query the discrete logarithm of X without knowing both the ephemeral and static private keys. In other words, the discrete logarithm of an ephemeral public key, which is typically the ephemeral secret, is hidden via an additional random oracle. In this paper, we show that it is possible to construct eCK-secure protocol without the NAXOS' approach by proposing two eCK-secure protocols. One is secure under the GDH assumption and the other under the CDH assumption; their efficiency and security assurances are comparable to the well-known HMQV [12] protocol. Furthermore, they are at least as secure as protocols that use the NAXOS' approach but unlike them and HMQV, the use of the random oracle is minimized and restricted to the key derivation function. © 2009 Springer-Verlag Berlin Heidelberg
Designing a workflow system using coloured petri nets

Traditional workflow systems focus on providing support for the control-flow perspective of a business process, with other aspects such as data management and work distribution receiving markedly less attention. A guide to desirable workflow characteristics is provided by the well-known workflow patterns which are derived from a comprehensive survey of contemporary tools and modelling formalisms. In this paper we describe the approach taken to designing the newYAWL workflow system, an offering that aims to provide comprehensive support for the control-flow, data and resource perspectives based on the workflow patterns. The semantics of the newYAWL workflow language are based on Coloured Petri Nets thus facilitating the direct enactment and analysis of processes described in terms of newYAWL language constructs. As part of this discussion, we explain how the operational semantics for each of the language elements are embodied in the newYAWL system and indicate the facilities required to support them in an operational environment. We also review the experiences associated with developing a complete operational design for an offering of this scale using formal techniques
Soundness of workflow nets with reset arcs

Petri nets are often used to model and analyze workflows. Many workflow languages have been mapped onto Petri nets in order to provide formal semantics or to verify correctness properties. Typically, the so-called Workflow nets are used to model and analyze workflows and variants of the classical soundness property are used as a correctness notion. Since many workflow languages have cancelation features, a mapping to workflow nets is not always possible. Therefore, it is interesting to consider workflow nets with reset arcs. Unfortunately, soundness is undecidable for workflow nets with reset arcs. In this paper, we provide a proof and insights into the theoretical limits of workflow verification
Introduction to Holographic Superconductors

These lectures give an introduction to the theory of holographic
superconductors. These are superconductors that have a dual gravitational
description using gauge/gravity duality. After introducing a suitable
gravitational theory, we discuss its properties in various regimes: the probe
limit, the effects of backreaction, the zero temperature limit, and the
addition of magnetic fields. Using the gauge/gravity dictionary, these
properties reproduce many of the standard features of superconductors. Some
familiarity with gauge/gravity duality is assumed. A list of open problems is
included at the end.Comment: 34 pages, 10 figures, to appear in the proceedings of the 5th Aegean
  Summer School, "From Gravity to Thermal Gauge Theories: the AdS/CFT
  Correspondence"; v2: references adde
Perturbations of anti-de Sitter black holes

I review perturbations of black holes in asymptotically anti-de Sitter space.
I show how the quasi-normal modes governing these perturbations can be
calculated analytically and discuss the implications on the hydrodynamics of
gauge theory fluids per the AdS/CFT correspondence. I also discuss phase
transitions of hairy black holes with hyperbolic horizons and the dual
superconductors emphasizing the analytical calculation of their properties.Comment: 25 pages, 4 figures, prepared for the proceedings of the 5th Aegean
  Summer School "From Gravity to Thermal Gauge Theories: the AdS/CFT
  Correspondence," Milos, Greece, September 2009
Improved Holographic QCD

We provide a review to holographic models based on Einstein-dilaton gravity
with a potential in 5 dimensions. Such theories, for a judicious choice of
potential are very close to the physics of large-N YM theory both at zero and
finite temperature. The zero temperature glueball spectra as well as their
finite temperature thermodynamic functions compare well with lattice data. The
model can be used to calculate transport coefficients, like bulk viscosity, the
drag force and jet quenching parameters, relevant for the physics of the
Quark-Gluon Plasma.Comment: LatEX, 65 pages, 28 figures, 9 Tables. Based on lectures given at
  several Schools. To appear in the proceedinds of the 5th Aegean School
  (Milos, Greece
The dynamics of quark-gluon plasma and AdS/CFT

In these pedagogical lectures, we present the techniques of the AdS/CFT
correspondence which can be applied to the study of real time dynamics of a
strongly coupled plasma system. These methods are based on solving
gravitational Einstein's equations on the string/gravity side of the AdS/CFT
correspondence. We illustrate these techniques with applications to the
boost-invariant expansion of a plasma system. We emphasize the common
underlying AdS/CFT description both in the large proper time regime where
hydrodynamic dynamics dominates, and in the small proper time regime where the
dynamics is far from equilibrium. These AdS/CFT methods provide a fascinating
arena interrelating General Relativity phenomenae with strongly coupled gauge
theory physics.Comment: 35 pages, 3 figures. Lectures at the 5th Aegean summer school, `From
  gravity to thermal gauge theories: the AdS/CFT correspondence'. To appear in
  the proceedings in `Lecture Notes in Physics
AdS/CFT on the brane

It is widely recognized that the AdS/CFT correspondence is a useful tool to
study strongly coupled field theories. On the other hand, Randall-Sundrum (RS)
braneworld models have been actively discussed as a novel cosmological
framework. Interestingly, the geometrical set up of braneworlds is quite
similar to that in the AdS/CFT correspondence. Hence, it is legitimate to seek
a precise relation between these two different frameworks. In this lecture, I
will explain how the AdS/CFT correspondence is related to the RS braneworld
models. There are two different versions of RS braneworlds, namely, the
single-brane model and the two-brane model. In the case of the single-brane
model, we reveal the relation between the geometrical and the AdS/CFT
correspondence approach using the gradient expansion method. It turns out that
the high energy and the Weyl term corrections found in the geometrical approach
correspond to the CFT matter correction found in the AdS/CFT correspondence
approach. In the case of two-brane system, we also show that the AdS/CFT
correspondence plays an important role in the sense that the low energy
effective field theory can be described by the conformally coupled
scalar-tensor theory where the radion plays the role of the scalar field. We
also discuss dilatonic braneworld models from the point of view of the AdS/CFT
correspondence.Comment: 37 pages, 3 figures, lectures presented at the Fifth Aegean Summer
  Schoo
Condensed matter and AdS/CFT

I review two classes of strong coupling problems in condensed matter physics,
and describe insights gained by application of the AdS/CFT correspondence. The
first class concerns non-zero temperature dynamics and transport in the
vicinity of quantum critical points described by relativistic field theories. I
describe how relativistic structures arise in models of physical interest,
present results for their quantum critical crossover functions and
magneto-thermoelectric hydrodynamics. The second class concerns symmetry
breaking transitions of two-dimensional systems in the presence of gapless
electronic excitations at isolated points or along lines (i.e. Fermi surfaces)
in the Brillouin zone. I describe the scaling structure of a recent theory of
the Ising-nematic transition in metals, and discuss its possible connection to
theories of Fermi surfaces obtained from simple AdS duals.Comment: 39 pages, 12 figures; Lectures at the 5th Aegean summer school, "From
  gravity to thermal gauge theories: the AdS/CFT correspondence", and the De
  Sitter Lecture Series in Theoretical Physics 2009, University of Groninge
Vintage Bit Cryptography

We propose to use a Random High-Rate Binary (RHRB) stream for the purpose of key distribution. The idea is as follows. Assume availability of a high-rate (terabits per second) broadcaster sending random content. Members of the key group (e.g. {Alice, Bob}) share a weak secret (at least 60 bits) and use it to make a selection of bits from the RHRB stream at an extremely low rate (1 bit out of 1016 to 1018). By the time that a strong key of reasonable size has been collected (1,000 bits), an enormous amount of data has been broadcast (1019?????????1021 bits). This is 106 to 108 times current hard drive capacity, which makes it infeasible for the interceptor (Eve) to store the stream for subsequent cryptanalysis, which is what the interceptor would have to do in the absence of the shared secret. Alternatively Eve could record the selection of bits that correspond to every value of the weak shared secret, which under the above assumptions requires the same or greater amount of storage i.e. 260??103. The members of the key group have no need to capture the whole stream, but store only the tiny part of it that is the key. Effectively this allows a pseudo-random sequence generated from a weak key to be leveraged up into a strong genuinely random key
Which mathematics for the Information Society?

MathIS is a new project that aims to reinvigorate secondary- school mathematics by exploiting insights of the dynamics of algorithmic problem solving. This paper describes the main ideas that underpin the project. In summary, we propose a central role for formal logic, the development of a calculational style of reasoning, the emphasis on the algorithmic nature of mathematics, and the promotion of self-discovery by the students. These ideas are discussed and the case is made, through a number of examples that show the teaching style that we want to introduce, for their relevance in shaping mathematics training for the years to come. In our opinion, the education of software engineers that work effectively with formal methods and mathematical abstractions should start before university and would benefit from the ideas discussed here.Long-term collaboration with J. N. Oliveira on calculational approaches to mathematics is deeply acknowledged. We are also grateful to the anonymous referees for their valuable comments. This research was supported by FCT (the Portuguese Foundation for Science and Technology), in the context of the MATHIS Project under contract PTDC/EIA/73252/2006. The work of Joao F. Ferreira and AlexandraMendeswas further supported by FCT grants SFRH/BD/24269/2005 and SFRH/BD/29553/2006, respectively
Hybridizing Beam-ACO with constraint programming for single machine job scheduling

A recent line of research concerns the integration of ant colony optimization and constraint programming. Hereby, constraint programming is used for eliminating parts of the search tree during the solution construction of ant colony optimization. In the context of a single machine scheduling problem, for example, it has been shown that the integration of constraint programming can significantly improve the ability of ant colony optimization to find feasible solutions. One of the remaining problems, however, concerns the elevated computation time requirements of the hybrid algorithm, which are due to constraint propagation. In this work we propose a possible solution to this problem by integrating constraint programming with a specific version of ant colony optimization known as Beam-ACO. The idea is to reduce the time spent for constraint propagation by parallelizing the solution construction process as done in Beam-ACO. The results of the proposed algorithm show indeed that it is currently the best performing algorithm for the above mentioned single machine job scheduling problem.Peer ReviewedPostprint (published version
The Effect of Different Forms of Synaptic Plasticity on Pattern Recognition in the Cerebellar Cortex

???The original publication is available at www.springerlink.com???. Copyright Springer.Many cerebellar learning theories assume that long-term depression (LTD) of synapses between parallel fibres (PFs) and Purkinje cells (PCs) provides the basis for pattern recognition in the cerebellum. Previous work has suggested that PCs can use a novel neural code based on the duration of silent periods. These simulations have used a simplified learning rule, where the synaptic conductance was halved each time a pattern was learned. However, experimental studies in cerebellar slices show that the synaptic conductance saturates and is rarely reduced to less than 50% of its baseline value. Moreover, the previous simulations did not include plasticity of the synapses between inhibitory interneurons and PCs. Here we study the effect of LTD saturation and inhibitory synaptic plasticity on pattern recognition in a complex PC model. We find that the PC model is very sensitive to the value at which LTD saturates, but is unaffected by inhibitory synaptic plasticity
Connection Strategies in Associative Memory Models

???The original publication is available at www.springerlink.com???. Copyright Springer.The problem we address in this paper is that of finding effective and parsimonious patterns of connectivity in sparse associative memories. This problem must be addressed in real neuronal systems, so results in artificial systems could throw light on real systems. We show that there are efficient patterns of connectivity and that these patterns are effective in models with either spiking or non-spiking neurons. This suggests that there may be some underlying general principles governing good connectivity in such networks
Analysis of a Real Online Social Network using Semantic Web Frameworks

International audienceSocial Network Analysis (SNA) provides graph algorithms to characterize the structure of social networks, strategic positions in these networks, specific sub-networks and decompositions of people and activities. Online social platforms like Facebook form huge social networks, enabling people to connect, interact and share their online activities across several social applications. We extended SNA operators using semantic web frameworks to include the semantics of these graph-based representations when analyzing such social networks and to deal with the diversity of their relations and interactions. We present here the results of this approach when it was used to analyze a real social network with 60,000 users connecting, interacting and sharing content
An exploratory study on using social information networks for flexible literature access

International audienceIt is well known that the fundamental intellectual problems of information access are the production and consumption of information. In this paper, we investigate the use of social network of information pro- ducers (authors) within relations in data (co-authorship and citation) in order to improve the relevance of information access. Relevance is derived from the network by levraging the usual topical similarity between the query and the document with the target author's authority. We explore various social network based measures for computing social information importance and show how this kind of contextual information can be incorporated within an information access model. We experiment with a collection issued from SIGIR1 proceedings and show that combining topical, author and citation based evidences can significantly improve retrieval access precision, measured in terms of mean reciprocal rank
Predicting neighbor goodness in collaborative filtering

Proceedings of 8th International Conference, FQAS 2009, Roskilde, Denmark, October 26-28, 2009.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-04957-6_52Performance prediction has gained increasing attention in the IR field since the half of the past decade and has become an established research topic in the field. The present work restates the problem in the subarea of Collaborative Filtering (CF), where it has barely been researched so far. We investigate the adaptation of clarity-based query performance predictors to define predictors of neighbor performance in CF. The proposed predictors are introduced in a memory-based CF algorithm to produce a dynamic variant where neighbor ratings are weighted based on their predicted performance. The approach is tested with encouraging empirical results, as the dynamic variants consistently outperform the baseline algorithms, with increasing difference on small neighborhoods.This work was supported by the Spanish Ministry of Science and
Innovation (TIN2008-06566-C04-02) and the Ministry of Industry, Tourism and
Commerce (CENIT-2007-1012)
Exploiting social tagging profiles to personalize web search

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-642-04957-6_54Proceedings of Second European Semantic Web Conference, ESWC 2005, Heraklion, Crete, Greece, May 29–June 1, 2005.Semantic search has been one of the motivations of the Semantic Web since it was envisioned. We propose a model for the exploitation of ontology-based KBs to improve search over large document repositories. Our approach includes an ontology-based scheme for the semi-automatic annotation of documents, and a retrieval system. The retrieval model is based on an adaptation of the classic vector-space model, including an annotation weighting algorithm, and a ranking algorithm. Semantic search is combined with keyword-based search to achieve tolerance to KB incompleteness. Our proposal is illustrated with sample experiments showing improvements with respect to keyword-based search, and providing ground for further research and discussion.This research was supported by the European Commission under
contract FP6-027122-SALERO. The expressed content is the view of the authors but
not necessarily the view of the SALERO project as a whole
Dynamically Personalizing Search Results for Mobile Users

International audienceWe introduce a novel situation-aware approach to personalize search results for mobile users. By providing a mobile user with appropriate information that dynamically satisfies his interests according to his situation, we tackle the problem of information overload. To build situation-aware user profile we rely on evidence issued from retrieval situations. A retrieval situation refers to the spatio-temporal context of the user when submitting a query to the search engine. A situation is represented as a combination of geographical and temporal concepts inferred from concrete time and location information by some ontological knowledge. User's interests are inferred from past search activities related to the identified situations. They are represented using concepts issued from a thematic ontology. We also involve a method to maintain the user's interests over his ongoing search activity and to personalize the search results
An SBVR framework for RESTful Web Applications

We propose a framework that can be used to produce functioning web applications from SBVR models. To achieve this, we begin by discussing the concept of declarative application generation and examining the commonalities between SBVR and the RESTful architectural style of the web. We then show how a relational database schema and RESTful interface can be generated from an SBVR model. In this context, we discuss how SBVR can be used to semantically describe hypermedia on the Web and enhance its evolvability and loose coupling properties. Finally, we show that this system is capable of exhibiting process-like behaviour without requiring explicitly defined processes
Design and Implementation of a Distributed Platform for Sharing IP Flow Records

Experiments using real traffic traces are of key importance in many network management research fields, such as traffic characterization, intrusion detection, and accounting. Access to such traces is often restricted due to privacy issues; research institutions typically have to sign non-disclosure agreements before accessing such traces from a network operator. Having such restrictions, researchers rarely have more than one source of traffic traces on which to run and validate their experiments.\ud
Therefore, this paper develops a Distributed Platform for Sharing IP Flows (DipSIF) based on NetFlow records between multiple institutions. It is assumed that NetFlow traces collected by each participant are archived on separate storage hosts within their premises and then made available to others using a server that acts as a gateway to the storage. Due to privacy reasons the platform presented here uses a prefix-preserving, cryptography-based, and consistent anonymization algorithm in order to comply to different regulations determining the exchange of traffic traces data