pinecone/core-2020-05-10-deduplication huggingface dataset:
A fast and exact modulo-distance between histograms

Presentado al 11th Joint IAPR International Workshop on Structural, Syntactic and Statistical Pattern Recognition (SSPR&SPR/2006) celebrado en Hong Kong (China).The aim of this paper is to present a new method to compare modulo histograms. In these histograms, the type of elements are cyclic, for instance, the hue in colour images. The main advantage is that there is an important time-complexity reduction respect the methods presented before. The distance between histograms that we present is defined on a structure called signature, which is a lossless representation of histograms. We show that the computational cost of our distance is O(z'2), being z' the number of non-empty bins of the histograms. The computational cost of the algorithms presented in the literature depends on the number of bins of the histograms. In most of the applications, the obtained histograms are sparse, then considering only the non-empty bins makes the time consuming of the comparison drastically decrease. The distance and algorithms presented in this paper are experimentally validated on the comparison of images obtained from public databases.Peer Reviewe
Polynomial network classifier with discriminative feature extraction

http://www.springerlink.com/The polynomial neural network, or called polynomial network classifier (PNC), is a powerful nonlinear classifier that can separate classes of complicated distributions. A method that expands polynomial terms on principal subspace has yielded superior performance. In this paper, we aim to further improve the performance of the subspace-featurebased PNC. In the framework of discriminative feature extraction (DFE), we adjust the subspace parameters together with the network weights in supervised learning. Under the objective of minimum squared error, the parameters can be efficiently updated by stochastic gradient descent. In experiments on 13 datasets from the UCI Machine Learning Repository, we show that DFE can either improve the classification accuracy or reduce the network complexity. On seven datasets, the accuracy of PNC is competitive with support vector classifiers
Using alignment templates to infer shallow-transfer machine translation rules

When building rule-based machine translation systems, a considerable human effort is needed to code the transfer rules that are able to translate source-language sentences into grammatically correct target-language sentences. In this paper we describe how to adapt the alignment templates used in statistical machine translation to the rule-based machine translation framework. The alignment templates are converted into structural transfer rules that are used by a shallow-transfer machine translation engine to produce grammatically correct translations. As the experimental results show there is a considerable improvement in the translation quality as compared to word-for-word translation (when no transfer rules are used), and the translation quality is close to that achieved when hand-coded transfer rules are used. The method presented is entirely unsupervised, and needs only a parallel corpus, two morphological analysers, and two part-of-speech taggers, such as those used by the machine translation system in which the inferred transfer rules are integrated.Work funded by the Spanish Comisión Interministerial de Ciencia y Tecnología through project TIC2003-08681-C02-01 and by the Spanish Ministerio de Educación y Ciencia and the European Social Fund through grant BES-2004-4711
Efficient and Robust Segmentations Based on Eikonal and Diffusion PDEs

In this paper, we present efficient and simple image segmentations based on the solution of two separate Eikonal equations, each originating from a different region. Distance functions from the interior and exterior regions are computed, and final segmentation labels are determined by a competition criterion between the distance functions. We also consider applying a diffusion partial differential equation (PDE) based method to propagate information in a manner inspired by the information propagation feature of the Eikonal equation. Experimental results are presented in a particular medical image segmentation application, and demonstrate the proposed methods
The Kleene Equality for Graphs

International audienceIn order to generalize the Kleene theorem from the free monoid to richer algebraic structures, we consider the non deterministic acceptance by a finite automaton of subsets of vertices of a graph. The subsets accepted in such a way are the equational subsets of vertices of the graph in the sense of Mezei and Wright. We introduce the notion of deterministic acceptance by finite automaton. A graph satisfies the Kleene equality if the two acceptance modes are equivalent, and in this case, the equational subsets form a Boolean algebra. We establish that the infinite grid and the transition graphs of deterministic pushdown automata satisfy the Kleene equality and we present families of graphs in which the free product of graphs preserves the Kleene equality
Minimal chordal sense of direction and circulant graphs

A sense of direction is an edge labeling on graphs that follows a globally
consistent scheme and is known to considerably reduce the complexity of several
distributed problems. In this paper, we study a particular instance of sense of
direction, called a chordal sense of direction (CSD). In special, we identify
the class of k-regular graphs that admit a CSD with exactly k labels (a minimal
CSD). We prove that connected graphs in this class are Hamiltonian and that the
class is equivalent to that of circulant graphs, presenting an efficient
(polynomial-time) way of recognizing it when the graphs' degree k is fixed
Autobiographic knowledge for believable virtual characters

The original publication is available at www.springerlink.com .--Copyright Springer DOI : 10.1007/11821830_31It has been widely acknowledged in the areas of human memory and cognition that behaviour and emotion are essentially grounded by autobiographic knowledge. In this paper we propose an overall framework of human autobiographic memory for modelling believable virtual characters in narrative story-telling systems and role-playing computer games. We first lay out the background research of autobiographic memory in Psychology, Cognitive Science and Artificial Intelligence. Our autobiographic agent framework is then detailed with features supporting other cognitive processes which have been extensively modelled in the design of believable virtual characters (e.g. goal structure, emotion, attention, memory schema and reactive behaviour-based control at a lower level). Finally we list directions for future research at the end of the paper
Static verification of indirect data sharing in loosely-coupled component systems

To maintain loose coupling and facilitate dynamic composition, components in a pipe-and-filter architecture have a very limited syntactic interface and often communicate indirectly by means of a shared data repository. This severely limits the possibilities for compile time compatibility checking. Even static type checking is made largely irrelevant due to the very general types given in the interfaces. The combination of pipe-and-filter and a shared data repository is widely used, and in this paper we study this problem in the context of the Struts framework. We propose simple, but formally specified, behavioural contracts for components in such frameworks and show that automated formal verification of certain semantical compatibility properties is feasible. In particular, our verification guarantees that indirect data sharing through the shared data repository is performed consistently.status: publishe
Did Germinal Centers evolve under differential effects of diversity vs affinity?

The classical view on the process of mutation and affinity
maturation that occurs in GCs assumes that their major role is to generate
high affinity levels of serum Abs, as well as a dominant pool of high
affinity memory B cells, through a very efficient selection process. Here
we present a model that considers different types of structures where a
mutation selection process occurs, with the aim at discussing the evolution
of Germinal Center reactions. Based on the results of this model, we
suggest that in addition to affinity maturation, the diversity generated
during the GC reaction may have also been important in the evolution towards
the presently observed highly organized structure of GC in higher
vertebrates
Computation of the real zeros of the Kummer function M(a;c;x)

12 pages, 5 figures.-- MSC2000 codes: Primary: 33F05; Secondary: 33C05, 34C60, 65H05.Contributed to: Second International Congress on Mathematical Software (ICMS'06, Castro Urdiales, Spain, Sep 1-3, 2006).MR#: MR2387180 (2009d:33060)An algorithm for computing the real zeros of the Kummer function M(a;c;x) is presented. The computation of ratios of functions of the type M(a+1; c+1; x)/M(a; c; x), M(a+1; c; x)/M(a; c; x) plays a key role in the algorithm, which is based on global fixed-point iterations. We analyse the accuracy and efficiency of three continued fraction representations converging to these ratios as a function of the parameter values. The condition of the change of variables appearing in the fixed point method is also studied. Comparison with implicit Maple functions is provided, including the Laguerre polynomial case.A. Gil acknowledges financial support from Ministerio de Educación y Ciencia (programa Ramón y Cajal). J. Segura acknowledges financial support from project BFM2003-06335-C03-02. The authors acknowledge financial support from Ministerio de Educación y Ciencia (ProjectMTM2004–01367).Publicad
Semi-automatic semantic-based web service classification

The final publication is available at Springer via http://dx.doi.org/10.1007/11837862_43Proceedings of BPM 2006 International Workshops, BPD, BPI, ENEI, GPWW, DPM, semantics4ws, Vienna, Austria, September 4-7, 2006.With the expectable growth of the number of Web services available on the WWW and service repositories, the need for mechanisms that enable the automatic organization and discovery of services becomes increasingly important. Service classification using standard or proprietary taxonomies is a common and simple facility in this context, complementarily to more sophisticated service management retrieval techniques. In this paper we propose a heuristic approach for the semi-automatic classification of Web services, based on a three-level matching procedure between services and classification categories, assuming a corpus of previously classified services is available. An experimental test of the proposed techniques is reported, showing positive results.This research was supported by the Spanish Ministry of Industry, Tourism and Commerce
(CDTI05-0436) and the Ministry of Science and Education (TIN2005-0685)
Some adaptive advantages of the ability to make predictions

We describe some simple simulations showing two possible adaptive advantages of the ability to predict the consequences of one?s actions: predicted inputs can replace missing inputs and predicted success vs. failure can help deciding whether to actually executing a planned action or not. The neural networks controlling the organisms? behaviour include distinct modules whose connection weights are all genetically inherited and evolved using a genetic algorithm except those of the predictive module which are learned during life
Building ensembles of neural networks with class-switching

The final publication is available at Springer via http://dx.doi.org/10.1007/11840817_19Proceedings of 16th International Conference, Athens, Greece, September 10-14, 2006This article investigates the properties of ensembles of neural networks, in which each network in the ensemble is constructed using a perturbed version of the training data. The perturbation consists in switching the class labels of a subset of training examples selected at random. Experiments on several UCI and synthetic datasets show that these class-switching ensembles can obtain improvements in classification performance over both individual networks and bagging ensembles.The authors acknowledge financial support from the Spanish Dirección General de Investigación, project TIN2004-07676-C02-02
Lazy training of radial basis neural networks

Proceeding of: 16th International Conference on Artificial Neural Networks, ICANN 2006. Athens, Greece, September 10-14, 2006Usually, training data are not evenly distributed in the input space. This makes non-local methods, like Neural Networks, not very accurate in those cases. On the other hand, local methods have the problem of how to know which are the best examples for each test pattern. In this work, we present a way of performing a trade off between local and non-local methods. On one hand a Radial Basis Neural Network is used like learning algorithm, on the other hand a selection of the training patterns is used for each query. Moreover, the RBNN initialization algorithm has been modified in a deterministic way to eliminate any initial condition influence. Finally, the new method has been validated in two time series domains, an artificial and a real world one.This article has been financed by the Spanish founded research MEC project OPLINK::UC3M, Ref: TIN2005-08818-C04-0
Improved storage capacity of hebbian learning attractor neural network with bump formations

The final publication is available at Springer via http://dx.doi.org/10.1007/11840817_25Proceedings of 16th International Conference on Artificial Neural Networks, Athens, Greece, September 10-14, 2006, Part IRecently, bump formations in attractor neural networks with distance dependent connectivities has become of increasing interest for investigation in the field of biological and computational neuroscience. Although the distance dependent connectivity is common in biological networks, a common fault of these network is the sharp drop of the number of patterns p that can remembered, when the activity changes from global to bump-like, than effectively makes these networks low effective.
In this paper we represent a bump-based recursive network specially designed in order to increase its capacity, which is comparable with that of randomly connected sparse network. To this aim, we have tested a selection of 700 natural images on a network with N = 64K neurons with connectivity per neuron C. We have shown that the capacity of the network is of order of C, that is in accordance with the capacity of highly diluted network. Preserving the number of connections per neuron, a non-trivial behavior with the radius of the connectivity has been observed. Our results show that the decrement of the capacity of the bumpy network can be avoided.The authors acknowledge the financial support from the Spanish Grants DGI.M.
CyT. FIS2005-1729, Plan de Promoción de la Investigación UNED and TIN
2004–07676-G01-01.We also thank David Dominguez for the fruitful discussion
of the manuscript
Neural model of dopaminergic control of arm movements in Parkinson’s disease bradykinesia

Patients suffering from Parkinson’s disease display a number of\ud
symptoms such a resting tremor, bradykinesia, etc. Bradykinesia is the hallmark\ud
and most disabling symptom of Parkinson’s disease (PD). Herein, a basal\ud
ganglia-cortico-spinal circuit for the control of voluntary arm movements in PD\ud
bradykinesia is extended by incorporating DAergic innervation of cells in the\ud
cortical and spinal components of the circuit. The resultant model simulates\ud
successfully several of the main reported effects of DA depletion on neuronal,\ud
electromyographic and movement parameters of PD bradykinesia
Compressed indexes for approximate string matching

We revisit the problem of indexing a string 5[1.n] to support searching all substrings in S that match a given pattern P[1.m] with at most k errors. Previous solutions either require an index of size exponential in k or need Ω(m k) time for searching. Motivated by the indexing of DNA sequences, we investigate space efficient indexes that occupy only O(n) space. For k = 1, we give an index to support matching in O(m+occ+lognloglogn) time. The previously best solution achieving this time complexity requires an index of size O(n log n). This new index can be used to improve existing indexes for k ≥ 2 errors. Among others, it can support matching with k = 2 errors in O(m log n log log n + occ) time. © Springer-Verlag Berlin Heidelberg 2006.postprintProceedings of the 14th Annual European Symposium on Algorithms (ESA), Zurich, Switzerland, 11-13 September, 2006. In Lecture Notes In Computer Science, 2006, v. 4168 LNCS, p. 208-21
Violator Spaces: Structure and Algorithms

Sharir and Welzl introduced an abstract framework for optimization problems,
called LP-type problems or also generalized linear programming problems, which
proved useful in algorithm design. We define a new, and as we believe, simpler
and more natural framework: violator spaces, which constitute a proper
generalization of LP-type problems. We show that Clarkson's randomized
algorithms for low-dimensional linear programming work in the context of
violator spaces. For example, in this way we obtain the fastest known algorithm
for the P-matrix generalized linear complementarity problem with a constant
number of blocks. We also give two new characterizations of LP-type problems:
they are equivalent to acyclic violator spaces, as well as to concrete LP-type
problems (informally, the constraints in a concrete LP-type problem are subsets
of a linearly ordered ground set, and the value of a set of constraints is the
minimum of its intersection).Comment: 28 pages, 5 figures, extended abstract was presented at ESA 2006;
  author spelling fixe
Execution Semantics for Service Choreographies

A service choreography is a model of the interactions in which a set of services engage to achieve a goal, seen from the perspective of an ideal observer that records all messages exchanged between these services. Choreographies have been put forward as a starting point for building service-oriented systems since they provide a global picture\ud
of the system’s behavior. In previous work we presented a language for service choreography modeling targeting the early phases of the development lifecycle. This paper provides an execution semantics for this language in terms of a mapping to -calculus. This formal semantics provides a basis for analyzing choreographies. The paper reports on experiences using the semantics to detect unreachable interactions
A Formal Approach to Service Component Architecture

This is the author's final draft of the paper published as Lecture Notes in Computer Science, 2006, volume 4184, pp. 193-213.  The original publication is available at www.springerlink.com.  Doi: 10.1007/11841197_13We report on a formal framework being developed within the SENSORIA project for supporting service-oriented modelling at high levels of abstraction, i.e. independently of the hosting middleware and hardware platforms, and the languages in which services are programmed. More specifically, we give an account of the concepts and techniques that support the composition model of SENSORIA, i.e. the mechanisms through which complex applications can be put together from simpler components, including modelling primitives for the orchestration of components and the definition of external interfaces
SCC: A Service Centered Calculus

We seek for a small set of primitives that might serve as a basis for formalising and programming service oriented applications over global computers. As an outcome of this study we introduce here SCC, a process calculus that features explicit notions of service definition, service invocation and session handling. Our proposal has been influenced by Orc, a programming model for structured orchestration of services, but the SCC’s session handling mechanism allows for the definition of structured interaction protocols, more complex than the basic request-response provided by Orc. We present syntax and operational semantics of SCC and a number of simple but nontrivial programming examples that demonstrate flexibility of the chosen set of primitives. A few encodings are also provided to relate our proposal with existing ones.\u
On the Suitability of BPMN for Business Process Modelling

In this paper we examine the suitability of the Business Process Modelling Notation (BPMN) for business process modelling, using the Workflow Patterns as an evaluation framework. The Workflow Patterns are a collection of patterns developed for assessing control-flow, data and resource capabilities in the area of Process Aware Information Systems (PAISs). In doing so, we provide a comprehensive evaluation of the capabilities of BPMN, and its strengths and weaknesses when utilised for business process modelling. The analysis provided for BPMN is part of a larger effort aiming at an unbiased and vendor-independent survey of the suitability and the expressive power of some mainstream process modelling languages. It is a sequel to previous work in which languages including BPEL and UML Activity Diagrams were evaluated
Managing Process Variants as an Information Resource

Many business solutions provide best practice process templates, both generic as well as for specific industry sectors. However, it is often the variance from template solutions that provide organizations with intellectual capital and competitive differentiation. In this paper, we present a modeling framework that is conducive to constrained variance, by supporting user driven process adaptations. The focus of the paper is on providing a means of utilizing the adaptations effectively for process improvement through effective management of the process variants repository (PVR). In particular, we will provide deliberations towards a facility to provide query functionality for PVR that is specifically targeted for effective search and retrieval of process variants
Towards a Task-Oriented, Policy-Driven Business Requirements Specification for Web Services

This paper was presented at Business Process Management, 4th International Conference, BPM 2006 and published as Lecture Notes in Computer Science, 2006, 4102, pp. 465-470.Dynamic assembly of complex software is possible through automated composition of web services. Coordination scripts identify and orchestrate a number of services to fulfil a user or business goal. There exists a need for expressing high level business requirements in such a way that is accessible by businesses. Current solutions fail to include specifications at the appropriate level of abstraction. Our approach defines a graphical notation to depict a business goal in terms of objectives, which are refined by tasks. The specifics of each task as well as overarching business constraints are expressed by policies.Peer reviewedPost prin
Adapt or Perish: Algebra and Visual Notation for Service Interface Adaptation

The proliferation of services on the web is leading to the formation of service ecosystems wherein services interact with one another in ways not necessarily foreseen during their development or deployment. A key challenge in this setting is service mediation: the act of retrofitting existing services by intercepting, storing, transforming, and (re-)routing messages going into and out of these services so they can interact in unforeseen manners. This paper addresses a sub-problem of service mediation, namely service interface adaptation, that arises when the interface that a service provides does not match the interface that it is expected to provide in a given interaction. The paper focuses on reconciling mismatches between behavioural interfaces, i.e. interfaces that capture ordering constraints between interactions. It presents a declarative approach to service interface adaptation based on: (i) an algebra over behavioural interfaces; and (ii) a visual language that allows pairs of provided-required interfaces to be linked through algebraic expressions. These expressions are fed into an execution engine that intercepts, buffers, transforms and forwards messages to enact the adaptation logic