pinecone/core-2020-05-10-deduplication huggingface dataset:
Morphological diversity and sparsity in blind source separation

International audienceThis paper describes a new blind source separation method for instantaneous linear mixtures. This new method coined GMCA (Generalized Morphological Component Analysis) relies on morphological diversity. It provides new insights on the use of sparsity for blind source separation in a noisy environment. GMCA takes advantage of the sparse representation of structured data in large overcomplete signal dictionaries to separate sources based on their morphology. In this paper, we define morphological diversity and focus on its ability to be a helpful source of diversity between the signals we wish to separate. We introduce the blind GMCA algorithm and we show that it leads to good results in the overdetermined blind source separation problem from noisy mixtures. Both theoretical and algorithmic comparisons between morphological diversity and independence-based separation techniques are given. The effectiveness of the proposed scheme is confirmed in several numerical experiments
Good lattice rules with a composite number of points based on the product weighted star discrepancy

Rank-1 lattice rules based on a weighted star discrepancy with weights of a product form have been previously constructed under the assumption that the number of points is prime. Here, we extend these results to the non-prime case. We show that if the weights are summable, there exist lattice rules whose weighted star discrepancy is O(n−1+δ), for any δ > 0, with the implied constant independent of the dimension and the number of lattice points, but dependent on δ and the weights. Then we show that the generating vector of such a rule can be constructed using a component-by-component (CBC) technique. The cost of the CBC construction is analysed in the final part of the paper
Quadratic optimal functional quantization of stochastic processes and numerical applications

41 pagesInternational audienceIn this paper, we present an overview of the recent developments of functional quantization of stochastic processes, with an emphasis on the quadratic case. Functional quantization is a way to approximate a process, viewed as a Hilbert-valued random variable, using a nearest neighbour projection on a finite codebook. A special emphasis is made on the computational aspects and the numerical applications, in particular the pricing of some path-dependent European options
SVM speaker verification using session variability modelling and GMM supervectors

This paper demonstrates that modelling session variability during GMM training can improve the performance of a GMM supervector SVM speaker verification system. Recently, a method of modelling session variability in GMM-UBM systems has led to significant improvements when the training and testing conditions are subject to session effects. In this work, session variability modelling is applied during the extraction of GMM supervectors prior to SVM speaker model training and classification. Experiments performed on the NIST 2005 corpus show major improvements over the baseline GMM supervector SVM system
Robust 3D Face Recognition from Expression Categorisation

The task of Face Recognition is often cited as being complicated by the presence of lighting and expression variation. In this article a novel combination of facial expression categorisation and 3D Face Recognition is used to provide enhanced recognition performance. The use of 3D face data alleviates performance issues related to pose and illumination. Part-face decomposition is combined with a novel adaptive weighting scheme to increase robustness to expression variation. By using local features instead of a monolithic approach, this system configuration allows for expression variability to be modelled and aid in the fusion process. The system is tested on the Face Recognition Grand Challenge (FRGC) database, currently the largest available dataset of 3D faces. The sensitivity of the proposed approach is also evaluated in the presence of systematic error in the expression classification stage
Natural language descriptions of human behaviour from video sequences

Presentado al 30th German Conference on Artificial Intelligence (KI-2007) celebrado en Osnabrück (Alemania) del 10 al 13 de septiembre.This contribution addresses the generation of textual descriptions in several natural languages for evaluation of human behavior in video sequences. The problem is tackled by converting geometrical information extracted from videos of the scenario into predicates in fuzzy logic formalism, which facilitates the internal representations of the conceptual data and allows the temporal analysis of situations in a deterministic fashion, by means of Situation Graph Trees (SGTs). The results of the analysis are stored in structures proposed by the Discourse Representation Theory (DRT), which facilitate a subsequent generation of natural language text. This set of tools has been proved to be perfectly suitable for the specified purpose.Peer Reviewe
A Stochastic Local Search Approach to Vertex Cover

We introduce a novel stochastic local search algorithm for the vertex cover problem. Compared to current exhaustive search techniques, our algorithm achieves excellent performance on a suite of problems drawn from the field of biology. We also evaluate our performance on the commonly used DIMACS benchmarks for the related clique problem, finding that our approach is competitive with the current best stochastic local search algorithm for finding cliques. On three very large problem instances, our algorithm establishes new records in solution quality.Griffith Sciences, School of Information and Communication TechnologyFull Tex
A Formally Verified Prover for the ALC Description Logic

The Ontology Web Language (OWL) is a language used for
the Semantic Web. OWL is based on Description Logics (DLs), a family
of logical formalisms for representing and reasoning about conceptual
and terminological knowledge. Among these, the logic ALC is a ground
DL used in many practical cases. Moreover, the Semantic Web appears
as a new field for the application of formal methods, that could be used
to increase its reliability. A starting point could be the formal verification
of satisfiability provers for DLs. In this paper, we present the PVS
specification of a prover for ALC , as well as the proofs of its termination,
soundness and completeness. We also present the formalization of
the well–foundedness of the multiset relation induced by a well–founded
relation. This result has been used to prove the termination and the
completeness of the ALC prover.Ministerio de Educación y Ciencia TIN2004–0388
Definitions contributed to the “Electrochemical dictionary” (edited by Allen J. Bard, György Inzelt, and Fritz Scholz).

This item contains definitions from the  Electrochemical Dictionary [© Springer] available from: http://www.springer.com/The Electrochemical Dictionary is intended to provide authoritative definitions of terms used in electrochemistry and related fields.  This document contains definitions of some diverse terms used in electrochemistry and related fields, namely, Electrochromism, electrochromic devices, Indium tin oxide (ITO) optically transparent electrode, Porphyrin, Tetraalkyl ammonium salts, Tungsten oxides
The correspondence between the logical algorithms language and CHR

This paper investigates the relationship between the Logical Algorithms language (LA) of Ganzinger and McAllester and Constraint Handling Rules (CHR). We present a translation scheme from LA to CHR-rp: CHR with rule priorities and show that the meta-complexity theorem for LA can be applied to a subset of CHR-rp via inverse translation. This result is compared with previous work. Inspired by the high-level implementation proposal of Ganzinger and McAllester, we demonstrate how LA programs can be compiled into CHR rules that interact with a scheduler written in CHR. This forms the first actual implementation of LA. Our implementation achieves the complexity required for the meta-complexity theorem to hold and can execute a subset of CHR-rp with strong complexity bounds.status: publishe
Declarative Diagnosis of Temporal Concurrent Constraint Programs

International audienceWe present a framework for the declarative diagnosis of nondeterministic timed concurrent constraint programs. We present a denotational semantics based on a (continuous) immediate consequence operator, TD, which models the process behaviour associated with a program D given in terms of sequences of constraints. Then, we show that, given the intended specification of D, it is possible to check the correctness of D by a single step of TD. In order to develop an effective debugging method, we approximate the denotational semantics of D. We formalize this method by abstract interpretation techniques, and we derive a finitely terminating abstract diagnosis method, which can be used statically. We define an abstract domain which allows us to approximate the infinite sequences by a finite ‘cut'. As a further development we show how to use a specific linear temporal logic for deriving automatically the debugging sequences. Our debugging framework does not require the user to either provide error symptoms in advance or answer questions concerning program correctness. Our method is compositional, that may allow to master the complexity of the debugging methodology
Static region analysis for Mercury

Region-based memory management is a form of compile-time memory
management, well-known from the functional programming world.
This paper describes a static region analysis for the logic
programming language Mercury. We use region points-to graphs to
model the partitioning of the memory used by a program into
separate regions. The algorithm starts with a region points-to
analysis that determines the different regions in the program. We then
compute the liveness of the regions by using an extended live
variable analysis. Finally, a program transformation adds region
annotations to the program for region support. These annotations
generate data for a region simulator that generates reports on the memory
behaviour of region-annotated programs. Our approach obtains good memory
consumption for several benchmark programs; for some of them it achieves
optimal memory management.status: publishe
Universal Timed Concurrent Constraint Programming

International audienceIn this doctoral work we aim at developing a rich timed con- current constraint (tcc) based language with strong ties to logic. The new calculus called Universal Timed Concurrent Constraint (utcc) increases the expressiveness of tcc languages allowing infinite behaviour and mobility. We introduce a constructor of the form (abs x; c)P (Abstraction in P) that can be viewed as a dual operator of the hidden operator local x in P. i.e. the later can be viewed as an existential quantification on the variable x and the former as an universal quantification of x, executing P[t=x] for all t s.t. the current store entails c[t=x]. As a compelling application, we applied this calculus to verify security protocols
Foundations of Rule-Based Query Answering

This survey article introduces into the essential concepts and methods underlying rule-based query languages. It covers four complementary areas: declarative semantics based on adaptations of mathematical logic, operational semantics, complexity and expressive power, and optimisation of query evaluation.

The treatment of these areas is foundation-oriented, the foundations having resulted from over four decades of research in the logic programming and database communities on combinations of query languages and rules. These results have later formed the basis for conceiving, improving, and implementing several Web and Semantic Web technologies, in particular query languages such as XQuery or SPARQL for querying relational, XML, and RDF data, and rule languages like the “Rule Interchange Framework (RIF)” currently being developed in a working group of the W3C.

Coverage of the article is deliberately limited to declarative languages in a classical setting: issues such as query answering in F-Logic or in description logics, or the relationship of query answering to reactive rules and events, are not addressed.
Reactive Rules on the Web

Reactive rules are used for programming rule-based, reactive
systems, which have the ability to detect events and respond to them automatically
in a timely manner. Such systems are needed on the Web for
bridging the gap between the existing, passive Web, where data sources
can only be accessed to obtain information, and the dynamicWeb, where
data sources are enriched with reactive behavior. This paper presents two
possible approaches to programming rule-based, reactive systems. They
are based on different kinds of reactive rules, namely Event-Condition-
Action rules and production rules. Concrete reactive languages of both
kinds are used to exemplify these programming paradigms. Finally the
similarities and differences between these two paradigms are studied.
Path integral Monte Carlo simulation of charged particles in traps

This chapter is devoted to the computation of equilibrium (thermodynamic)
properties of quantum systems. In particular, we will be interested in the
situation where the interaction between particles is so strong that it cannot
be treated as a small perturbation. For weakly coupled systems many efficient
theoretical and computational techniques do exist. However, for strongly
interacting systems such as nonideal gases or plasmas, strongly correlated
electrons and so on, perturbation methods fail and alternative approaches are
needed. Among them, an extremely successful one is the Monte Carlo (MC) method
which we are going to consider in this chapter.Comment: 18 pages, based on talks on Hareaus school on computational methods,
  Greifswald, September 200
Wigner function quantum molecular dynamics

Classical molecular dynamics (MD) is a well established and powerful tool in
various fields of science, e.g. chemistry, plasma physics, cluster physics and
condensed matter physics. Objects of investigation are few-body systems and
many-body systems as well. The broadness and level of sophistication of this
technique is documented in many monographs and reviews, see for example
\cite{Allan,Frenkel,mdhere}. Here we discuss the extension of MD to quantum
systems (QMD). There have been many attempts in this direction which differ
from one another, depending on the type of system under consideration. One
direction of QMD has been developed for condensed matter systems and will not
discussed here, e.g. \cite{fermid}. In this chapter we are dealing with unbound
electrons as they occur in gases, fluids or plasmas. Here, one strategy is to
replace classical point particles by wave packets, e.g.
\cite{fermid,KTR94,zwicknagel06} which is quite successful. At the same time,
this method struggles with problems related to the dispersion of such a packet
and difficulties to properly describe strong electron-ion interaction and bound
state formation. We, therefore, avoid such restrictions and consider a
completely general alternative approach. We start discussion of quantum
dynamics from a general consideration of quantum distribution functions.Comment: 18 pages, based on lecture at Hareaus school on computational phyics,
  Greifswald, September 200
Zero-lag Long Range Synchronization of Neurons Is Enhanced by Dynamical Relaying

Also published by Springer as chapter of the book "Artificial Neural Networks – ICANN 2007" (ISBN 978-3-540-74689-8), Proceedings of the 17th International Conference ICANN 2007, Porto, Portugal, September 9-13, 2007.-- Final full-text of the paper available at: http://dx.doi.org/10.1007/978-3-540-74690-4.How can two distant neural assemblies synchronize their firings at zero-lag even in the presence of non-negligible delays in the\ud
transfer of information between them? Here we propose a simple network module that naturally accounts for zero-lag neural synchronization\ud
for a wide range of temporal delays. In particular, we demonstrate that isochronous (without lag) millisecond precise synchronization between two distant neurons or neural populations can be achieved by relaying\ud
their dynamics via a third mediating single neuron or population.Research supported by the GABA project (European Commission, FP6-NEST contract 043309)
Selection of decision stumps in bagging ensembles

Proceedings of 17th International Conference ICANN, Porto, Portugal, September 9-13, 2007.The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-540-74690-4_33This article presents a comprehensive study of different ensemble pruning techniques applied to a bagging ensemble composed of decision stumps. Six different ensemble pruning methods are tested. Four of these are greedy strategies based on first reordering the elements of the ensemble according to some rule that takes into account the complementarity of the predictors with respect to the classification task. Subensembles of increasing size are then constructed by incorporating the ordered classifiers one by one. A halting criterion stops the aggregation process before the complete original ensemble is recovered. The other two approaches are selection techniques that attempt to identify optimal subensembles using either genetic algorithms or semidefinite programming. Experiments performed on 24 benchmark classification tasks show that the selection of a small subset (≈ 10 − 15%) of the original pool of stumps generated with bagging can significantly increase the accuracy and reduce the complexity of the ensemble.This work has been supported by Consejería de Educación de la Comunidad Autónoma de Madrid, European Social Fund, and the Dirección General de Investigación, grant TIN2004-07676-C02-0
Visualization of dynamics using local dynamic modelling with self organizing maps

In this work, we describe a procedure to visualize nonlinear process dynamics using a self-organizing map based local model dynamical estimator. The proposed method exploits the topology preserving nature of the resulting estimator to extract visualizations (planes) of insightful dynamical features, that allow to explore nonlinear systems whose behavior changes with the operating point. Since the visualizations are obtained from a dynamical model of the process, measures on the goodness of this estimator (such as RMSE or AIC) are also applicable as a measure of the trustfulness of the visualizations. To illustrate the application of the proposed method, an experiment to analyze the dynamics of a nonlinear system on different operating points is include
Gamma-ray probe of the QSO's obscured evolution

The idea that substantial absorption in AGN could be a definite
characteristic of the early phases of QSO evolution was invoked to explain the
submillimeter observations of X-ray absorbed AGN at z~1 to z~3, that have shown
strong emission at 850 mkm. This strong emission is a signature of the copious
star formation. In AGN evolution model, the main obscured growth phase of the
QSO coincides with formation of the host galaxy spheroid, the completion of
which indicates the beginning of the luminous, unobscured phase of the QSO's
evolution. The verification of this model at redshifts up to z~6 appears
possible via application of the gamma-ray resonant absorption method.Comment: 3 pages, 1 figure, contribution to proceedings of International
  Astrophysics Conference "Relativistic Astrophysics and Cosmology-Einsteins
  Legacy", held during November 7-11, 2005, Munich, Germany. To be printed in
  the Springer-Verlag series "ESO Astrophysics Symposia", Eds. B. Aschenbach,
  V. Burwitz, G. Hasinger, and B. Leibundgu
Nuclear activity in galaxies driven by binary supermassive black holes

Nuclear activity in galaxies is closely connected to galactic mergers and supermassive black holes (SBH). Galactic mergers perturb substantially the dynamics of gas and stellar population in the merging galaxies, and they are expected to lead to formation of supermassive binary black holes (BBH) in the center of mass of the galaxies merged. A scheme is proposed here that connects the peak magnitude of the nuclear activity with evolution of a BBH system. The scheme predicts correctly the relative fractions of different types of active galactic nuclei (AGN) and explains the connection between the galactic type and the strength of the nuclear activity. It shows that most powerful AGN should result from mergers with small mass ratios, while weaker activity is produced in unequal mergers. The scheme explains also the observed lack of galaxies with two active nuclei, which is attributed to effective disruption of accretion disks around the secondary in BBH systems with masses of the primary smaller than ~10^10 solar masses
Astrophysical Probes of Fundamental Physics

I review the theoretical motivation for varying fundamental couplings and discuss how these measurements can be used to constrain a number of fundamental physics scenarios that would otherwise be inacessible to experiment. As a case study I will focus on the relation between varying couplings and dark energy, and explain how varying coupling measurements can be used to probe the nature of dark energy, with important advantages over the standard methods. Assuming that the current observational evidence for varying $\alpha$ and $\mu$ is correct, a several-sigma detection of dynamical dark energy is feasible within a few years, using currently operational ground-based facilities. With forthcoming instruments like CODEX, a high-accuracy reconstruction of the equation of state may be possible all the way up to redshift $z\sim4$
Spectral and variability properties of LS 5039 from radio to very high-energy gamma-rays

Microquasars are X-ray binaries with relativistic jets. The microquasar LS 5039 turned out to be the first high-energy gamma-ray microquasar candidate due to its likely association with the EGRET source 3EG J1824-1514. Further theoretical studies supported this association, which could be extended to other EGRET sources. Very recently, Aharonian et al. (2005) have communicated the detection of the microquasar LS 5039 at TeV energies. This fact confirms the EGRET source association and leaves no doubt about the gamma-ray emitting nature of this object. The aim of the present work is to show that, applying a cold-matter dominated jet model to LS 5039, we can reproduce many of the spectral and variability features observed in this source. Jet physics is explored, and some physical quantities are estimated as a by-product of the performed modeling. Although at the moment only LS 5039 has been detected on the entire electromagnetic spectrum, it does not seem unlikely that other microquasars will show similar spectral properties. Therefore, an in-depth study of the first gamma-ray microquasar, on theoretical grounds supported by observations, can render a useful knowledge applicable elsewhere
"Integrare", a Collaborative Environment for Behavior-Oriented Design

In this paper, we introduce a new cooperative design and visualization environment, called "Integrare", which supports designers and developers in building dependable, component-based systems using a new behavior-oriented design method. This method has advantages in terms of its abilities to manage complexity, find defects and make checks of dependability. The environment integrates and unifies several tools that support multiple phases of the design process, allowing them to interact and exchange information, as well as providing efficient editing capabilities. It can help formalize individual natural language functional requirements as Behavior Trees. These trees can be composed to create an integrated tree-like view of all the formalized requirements. The environment manages complexity by allowing multiple users to work independently on requirements translation and tree editing in a collaborative mode.  Once a design is constructed from the requirements, it can be visually simulated with respect to an underlying operational semantics, and formally verified by way of a model checker.Griffith Sciences, School of Information and Communication TechnologyFull Tex