pinecone/core-2020-05-10-deduplication huggingface dataset:
The Importance of Network Topology in Local Contribution Games

We consider a model of content contribution in peer-to-peer networks with linear quadratic payoffs and very general interaction patterns. We find that Nash equilibria of this game always exist; moreover, they are computable by solving a linear complementarity problem. The equilibrium is unique when goods are strategic complements or weak substitutes and contributions are proportional to a network centrality measure called the Bonacich index. In the case of public goods, the equilibrium is non-unique and characterized by k-order maximal independent sets. The structure of optimal networks is always star-like when the game exhibits strict or weak complements. Under public good scenarios, while star-like networks remain optimal in the best case, they also yield the worst-performing equilibria. We also discuss a network-based policy for improving the equilibrium performance of networks by the exclusion of a single player.Engineering and Applied Science
Unbounded-Error Classical and Quantum Communication Complexity

Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86},
the unbounded-error classical communication complexity of a Boolean function
has been studied based on the arrangement of points and hyperplanes. Recently,
\cite[ICALP'07]{INRY07} found that the unbounded-error {\em quantum}
communication complexity in the {\em one-way communication} model can also be
investigated using the arrangement, and showed that it is exactly (without a
difference of even one qubit) half of the classical one-way communication
complexity. In this paper, we extend the arrangement argument to the {\em
two-way} and {\em simultaneous message passing} (SMP) models. As a result, we
show similarly tight bounds of the unbounded-error two-way/one-way/SMP
quantum/classical communication complexities for {\em any} partial/total
Boolean function, implying that all of them are equivalent up to a
multiplicative constant of four. Moreover, the arrangement argument is also
used to show that the gap between {\em weakly} unbounded-error quantum and
classical communication complexities is at most a factor of three.Comment: 11 pages. To appear at Proc. ISAAC 200
Geometric Spanner of Segments (Algorithms and Computation)

Algorithms and computation : 18th International Symposium, ISAAC 2007, Sendai, Japan, December 17-19, 2007 : proceedings ; ISAAC 2007 : (Lecture notes in computer science ; 4835)Proc. of ISACCGeometric spanner is a fundamental structure in computational geometry and plays an important role in many geometric networks design applications. In this paper, we consider a generalization of the classical geometric spanner problem (called segment spanner): Given a set S of disjoint 2-D segments, find a spanning network G with minimum size so that for any pair of points in S, there exists a path in G with length no more than t times their Euclidean distance. Based on a number of interesting techniques (such as weakly dominating set, strongly dominating set, and interval cover), we present an efficient algorithm to construct the segment spanner. Our approach first identifies a set of Steiner points in S, then construct a point spanner for them. Our algorithm runs in O(|Q| + n 2 logn) time, where Q is the set of Steiner points. We show that Q is an O(1)-approximation in terms of its size when S is relatively “well” separated by a constant. For arbitrary rectilinear segments under L 1 distance, the approximation ratio improves to 2
Detecting Phishing E-mails by Heterogeneous Classification

This paper presents a system for classifying e-mails into two\ud
categories, legitimate and fraudulent. This classifier system is based on the\ud
serial application of three filters: a Bayesian filter that classifies the textual\ud
content of e-mails, a rule- based filter that classifies the non grammatical\ud
content of e-mails and, finally, a filter based on an emulator of fictitious\ud
accesses which classifies the responses from websites referenced by links\ud
contained in e-mails. This system is based on an approach that is hybrid,\ud
because it uses different classification methods, and also integrated, because it\ud
takes into account all kind of data and information contained in e-mails. This\ud
approach aims to provide an effective and efficient classification. The system\ud
first applies fast and reliable classification methods, and only when the resulting\ud
classification decision is imprecise does the system apply more complex\ud
analysis and classification methods.Peer reviewe
Out of bootstrap estimation of generalization error curves in bagging ensembles

The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-77226-2_6Proceedings of 8th International Conference IDEAL, Birmingham, UK, December 16-19, 2007.The dependence of the classification error on the size of a bagging ensemble can be modeled within the framework of Monte Carlo theory for ensemble learning. These error curves are parametrized in terms of the probability that a given instance is misclassified by one of the predictors in the ensemble. Out of bootstrap estimates of these probabilities can be used to model generalization error curves using only information from the training data. Since these estimates are obtained using a finite number of hypotheses, they exhibit fluctuations. This implies that the modeled curves are biased and tend to overestimate the true generalization error. This bias becomes negligible as the number of hypotheses used in the estimator becomes sufficiently large. Experiments are carried out to analyze the consistency of the proposed estimator
Random convolution ensembles

A novel method for creating diverse ensembles of image classifiers is proposed. The idea is that, for each base image classifier in the ensemble, a random image transformation is generated and applied to all of the images in the labeled training set. The base classifiers are then learned using features extracted from these randomly transformed versions of the training data, and the result is a highly diverse ensemble of image classifiers. This approach is evaluated on a benchmark pedestrian detection dataset and shown to be effective
On the Connection Between Signcryption and One-pass Key Establishment

There is an intuitive connection between signcryption and one-pass key establishment. Although this has been observed previously, up to now there has been no formal analysis of this relationship. The main purpose of this paper is to prove that, with appropriate security notions, one-pass key establishment can be used as a signcryption KEM and vice versa. In order to establish the connection we  explore the definitions for signcryption (KEM) and give new and generalised definitions. By making our generic construction concrete we are able to provide new examples of a signcryption KEM and a one-pass key establishment protocol
A novel fuzzy approach to evaluate the quality of examination timetabling

In this paper we introduce a new fuzzy evaluation function for examination timetabling. We describe how we employed fuzzy reasoning to evaluate the quality of a constructed timetable by considering two criteria: the average penalty per student and the highest penalty imposed on any of the students. A fuzzy system was created based on a series of easy to understand rules to combine the two criteria. A significant problem encountered was how to determine the lower and upper bounds of the decision criteria for any given problem instance, in order to allow the fuzzy system to be fixed and, hence, applicable to new problems without alteration. In this work, two different methods for determining boundary settings are proposed. Experimental results are presented and the implications analysed. These results demonstrate that fuzzy reasoning can be successfully applied to evaluate the quality of timetable solutions in which multiple decision criteria are involved
Phase-based methods for voice source analysis

International Conference on Nonlinear Speech Processing, NOLISP 2007; Paris; France; 22 May 2007 through 25 May 2007Voice source analysis is an important but difficult issue for speech processing. In this talk, three aspects of voice source analysis recently developed at LIMSI (Orsay, France) and FPMs (Mons, Belgium) are discussed. In a first part, time domain and spectral domain modelling of glottal flow signals are presented. It is shown that the glottal flow can be modelled as an anticausal filter (maximum phase) before the glottal closing, and as a causal filter (minimum phase) after the glottal closing. In a second part, taking advantage of this phase structure, causal and anticausal components of the speech signal are separated according to the location in the Z-plane of the zeros of the Z-Transform (ZZT) of the windowed signal. This method is useful for voice source parameters analysis and source-tract deconvolution. Results of a comparative evaluation of the ZZT and linear prediction for source/tract separation are reported. In a third part, glottal closing instant detection using the phase of the wavelet transform is discussed. A method based on the lines of maximum phase in the time-scale plane is proposed. This method is compared to EGG for robust glottal closing instant analysis
Hybrid Models for Automatic Speech Recognition: a Comparison of Classical ANN and Kernel Based Methods

Support Vector Machines (SVMs) are state-of-the-art methods for machine learning but share with more classical Artificial Neural Networks (ANNs) the difficulty of their application to input patterns of non-fixed dimension. This is the case in Automatic Speech Recognition (ASR), in which the duration of the speech utterances is variable. In this paper we have recalled the hybrid (ANN/HMM) solutions provided in the past for ANNs and applied them to SVMs performing a comparison between them. We have experimentally assessed both hybrid systems with respect to the standard HMM-based ASR system, for several noisy environments. On the one hand, the ANN/HMM system provides better results than the HMM-based system. On the other, the results achieved by the SVM/HMM system are slightly lower than those of the HMM system. Nevertheless, such a results are encouraging due to the current limitations of the SVM/HMM system
Defining Component Protocols with Service Composition: Illustration with the Kmelia Model

International audienceWe address in this article the description and usage of component protocols viewed as specific services. In addition to inter-component service composition, our \kmelia component model supports vertical structuring mechanisms that allow service composition inside a component. The structuring mechanisms (namely state annotation and transition annotation) are then used to describe protocols which are considered here as component usage guides. These structuring mechanisms are integrated in the support language of our component model and are implemented in our COSTO toolbox. We show how protocol analysis is performed in order to detect some inconsistencies that may be introduced by the component designers
Mechanical Theorem Proving in Tarski's geometry.

International audienceThis paper describes the mechanization of the proofs of the first height chapters of Schwabäuser, Szmielew and Tarski's book: Metamathematische Methoden in der Geometrie. The goal of this development is to provide foundations for other formalizations of geometry and implementations of decision procedures. We compare the mechanized proofs with the informal proofs. We also compare this piece of formalization with the previous work done about Hilbert's Gründlagen der Geometrie. We analyze the differences between the two axiom systems from the formalization point of view
An Efficient Storage Mechanism to Distribute Disk Load in a VoD Server

In this paper, a storage mechanism is devised to balance the load and to provide immediate service to the clients with a start-up delay of 2ms to 7 ms. The video storage is based on the probability of the clients requesting for the video. Videos with higher probability of being requested are stored and replicated to ensure guaranteed retrieval. Parity generation scheme is employed to provide reliability to non-popular videos. The system is also capable of handling disk failures transparently and thereby providing a reliable service to the clients
On Completeness of Logical Relations for Monadic Types

Software security can be ensured by specifying and verifying security
properties of software using formal methods with strong theoretical bases. In
particular, programs can be modeled in the framework of lambda-calculi, and
interesting properties can be expressed formally by contextual equivalence
(a.k.a. observational equivalence). Furthermore, imperative features, which
exist in most real-life software, can be nicely expressed in the so-called
computational lambda-calculus. Contextual equivalence is difficult to prove
directly, but we can often use logical relations as a tool to establish it in
lambda-calculi. We have already defined logical relations for the computational
lambda-calculus in previous work. We devote this paper to the study of their
completeness w.r.t. contextual equivalence in the computational
lambda-calculus.Comment: 20 pages, full version of the paper published at ASIAN'2006, with the
  same titl
Simultaneous Geometric Graph Embeddings

We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be placed in the plane in such a way that for each graph the straight-line drawing is planar. We partially settle an open problem of Erten and Kobourov and show that even for two graphs the problem is NP-hard. We also show that the problem of computing the rectilinear crossing number of a graph can be reduced to a simultaneous geometric graph embedding problem; this implies that placing SGE in NP will be hard, since the corresponding question for rectilinear crossing number is a longstanding open problem. However, rather like rectilinear crossing number, SGE can be decided in PSPACE
On continuity properties of the law of integrals of Lévy processes

Let $(\xi,\eta)$ be a bivariate L\'evy process such that the integral $\int\_0^\infty e^{-\xi\_{t-}} d\eta\_t$ converges almost surely. We characterise, in terms of their \LL measures, those L\'evy processes for which (the distribution of) this integral has atoms. We then turn attention to almost surely convergent integrals of the form $I:=\int\_0^\infty g(\xi\_t) dt$, where $g$ is a deterministic function. We give sufficient conditions ensuring that $I$ has no atoms, and under further conditions derive that $I$ has a Lebesgue density. The results are also extended to certain integrals of the form $\int\_0^\infty g(\xi\_t) dY\_t$, where $Y$ is an almost surely strictly increasing stochastic process, independent of $\xi$
An Analysis of Settlement Risk Contagion in Alternative Securities Settlement Architecture

This paper compares the so-called gross and net architectures for securities settlement. It studies the settlement risk arising from exogenous operational delays and compares the importance of settlement failures under the two architectures, as a function of the length of the settlement cycle and of different market conditions. Under both architectures, settlement failures are non-monotonically related to the length of settlement cycle. There is no evidence that continuous time settlement provides always higher stability. Gross systems appear to be more stable than net systems
The evaluation of discrete barrier options in a path integral framework

The pricing of discretely monitored barrier options is a difficult problem. In general, there is no known closed form solution for pricing such options. A path integral approach to the evaluation of barrier options is developed. This leads to a backward recursion functional equation linking the pricing functions at successive barrier points. This functional equation is solved by expanding the pricing functions in Fourier-Hermite series. The backward recursion functional equation then becomes the backward recurrence relation for the coefficients in the Fourier-Hermite expansion of the pricing functions. A very efficient and accurate method for generating the pricing function at any barrier point is thus obtained. A number of numerical experiments with the method are performed in order to gain some understanding of the nature of convergence. Results for various volatility values and different numbers of basis functions in the Fourier-Hermite expansion are presented. Comparisons are given between pricing of discrete barrier option in the path integral framework and by use of finite difference methods
Linguistic support for revising and editing

Revising and editing are important parts of the writing process. In fact, multiple revision and editing cycles are crucial for the production of high-quality texts. However, revising and editing are also tedious and error-prone, since changes may introduce new errors.\ud
Grammar checkers, as offered by some word processors, are not a solution. Besides the fact that they are only available for few languages, and regardless of the questionable quality, their conceptual approach is not suitable for experienced writers, who actively create their texts. Word processors offer few, if any, functions for handling text on the same cognitive level as the author: While the author is thinking in high-level linguistic terms, editors and word processors mostly provide low-level character oriented functions. Mapping the intended outcome to these low-level operations is distracting for the author, who now has to focus for a long time on small parts of the text. This results in a loss of global overview of the text and in typical revision errors (duplicate verbs, extraneous conjunctions, etc.)\ud
We therefore propose functions for text processors that work on the conceptual level of writers. These functions operate on linguistic elements, not on lines and characters. We describe how these functions can be implemented by making use of NLP methods and linguistic resources
Transforming object-oriented to process-oriented models

Object-oriented modelling is an established approach to document the information systems. In an object model,\ud
a system is captured in terms of object types and associations, state machines, collaboration diagrams, etc. Process modeling on the other hand, provides a different approach whereby behaviour is captured in terms of activities, flow dependencies, resources, etc. These\ud
two approaches have their relative advantages. In\ud
object models, behaviour is split across object types, whereas in process models, behaviour is captured along chains of\ud
logically related tasks. Also, object models and process models lend\ud
themselves to different styles of implementation. There is an\ud
opportunity to leverage the relative advantages of object models and\ud
process models by creating integrated meta-models and\ud
transformations so that modellers can switch between these views. In\ud
this paper we define a transformation from a meta-model for object\ud
behavior modeling to a meta-model for process modeling. The\ud
transformation relies on the identification of causal\ud
relations in the object model. These relations are encoded in a\ud
heuristics net from which a process model is derived
Access Control Requirements for Processing Electronic Health Records

There is currently a strong focus worldwide on the potential of large-scale Electronic Health Record systems to cut costs and improve patient outcomes through increased e±ciency. A number of countries are developing nationwide EHR systems to aggregate services currently provided by isolated Electronic Medical Record databases. However, such aggregation introduces new risks for patient privacy and data security, both by linking previously-separate pieces of information about an individual, and by creating single access points to a wide range of personal data. It is thus essential that new access control policies and mechanisms are devised for federated Electronic Health Record systems, to ensure not only that sensitive patient data is accessible by authorized personnel only, but also that it is available when needed in life-critical situations. Here we review the traditional security models for access control, Discretionary Access Control, Mandatory Access Control and Role-Based Access Control, and use a case study to demonstrate that no single one of them is su±cient in a federated healthcare environment. We then show how the required level of data security can be achieved through a judicious combination of all three mechanisms
Linking Domain Models and Process Models for Reference Model Configuration

Reference process models capture common practices in a given domain and variations thereof. Such models are intended to be configured in a specific setting, leading to individualized process models. Although the advantages of reference process models are widely accepted, their configuration still requires a high degree of modeling expertise. Thus users not only need to be domain experts, but also need to master the notation in which the reference process model is captured. In this paper we propose a framework for reference process modeling wherein the domain variability is represented separately from the actual process model. Domain variability is captured as a questionnaire that reflects the decisions that need to be made during configuration and their inter-relationships. This questionnaire allows subject matter experts to configure the process model without requiring them to understand the process modeling nota-tion. The approach guarantees that the resulting process models are correct ac-cording to certain constraints. To demonstrate the applicability of the proposal, we have implemented a questionnaire toolset that guides users through the con-figuration of reference process models captured in two different notations
Families of dendrograms

A conceptual framework for cluster analysis from the viewpoint of p-adic
geometry is introduced by describing the space of all dendrograms for n
datapoints and relating it to the moduli space of p-adic Riemannian spheres
with punctures using a method recently applied by Murtagh (2004b). This method
embeds a dendrogram as a subtree into the Bruhat-Tits tree associated to the
p-adic numbers, and goes back to Cornelissen et al. (2001) in p-adic geometry.
After explaining the definitions, the concept of classifiers is discussed in
the context of moduli spaces, and upper bounds for the number of hidden
vertices in dendrograms are given.Comment: 7 pages, 3 figures. To appear in: Proceedings of the 31st Annual
  Conference of the German Classification Society on Data Analysis, Machine
  Learning, and Applications, Freiburg im Breisgau, 7-9 March 2007. Springer
  series Studies in Classification, Data Analysis, and Knowledge Organizatio
Collective classification for labeling of places and objects in 2D and 3D range data

In this paper, we present an algorithm to identify types of places and objects from 2D and 3D laser range data obtained in indoor environments. Our approach is a combination of a collective classification method based on associative Markov networks together with an instance-based feature extraction using nearest neighbor. Additionally, we show how to select the best features needed to represent the objects and places, reducing the time needed for the learning and inference steps while maintaining high classification rates. Experimental results in real data demonstrate the effectiveness of our approach in indoor environments