Best Proximity Points of Generalized Semicyclic Impulsive Self-Mappings: Applications to Impulsive Differential and Difference Equations

This paper is devoted to the study of convergence properties of distances between points and the existence and uniqueness of best proximity and fixed points of the so-called semicyclic impulsive self-mappings on the union of a number of nonempty subsets in metric spaces. The convergences of distances between consecutive iterated points are studied in metric spaces, while those associated with convergence to best proximity points are set in uniformly convex Banach spaces which are simultaneously complete metric spaces. The concept of semicyclic self-mappings generalizes the well-known one of cyclic ones in the sense that the iterated sequences built through such mappings are allowed to have images located in the same subset as their pre-image. The self-mappings under study might be in the most general case impulsive in the sense that they are composite mappings consisting of two self-mappings, and one of them is eventually discontinuous. Thus, the developed formalism can be applied to the study of stability of a class of impulsive differential equations and that of their discrete counterparts. Some application examples to impulsive differential equations are also given.

Sampling and learning the Mallows and Generalized Mallows models under the Cayley distance

[EN]The Mallows and Generalized Mallows models are compact yet powerful and natural ways of representing a probability distribution over the space of permutations. In this paper we deal with the problems of sampling and learning (estimating) such distributions when the metric on permutations is the Cayley distance. We propose new methods for both operations, whose performance is shown through several experiments. We also introduce novel procedures to count and randomly generate permutations at a given Cayley distance both with and without certain structural restrictions. An application in the field of biology is given to motivate the interest of this model.

Is General Relativity a simplified theory?

IARD 8th Biennial Conference on Classical and Quantum Relativistic Dynamics of Particles and Fields - Galileo Galilei Inst Theoret Phys (GGI), Florence, ITALY - MAY 29-JUN 01, 2012. Edited by:Horowitz, LP

Query-by-Example Spoken Term Detection ALBAYZIN 2012 evaluation: overview, systems, results, and discussion

Query-by-Example Spoken Term Detection (QbE STD) aims at retrieving data from a speech data repository given an acoustic query containing the term of interest as input. Nowadays, it has been receiving much interest due to the high volume of information stored in audio or audiovisual format. QbE STD differs from automatic speech recognition (ASR) and keyword spotting (KWS)/spoken term detection (STD) since ASR is interested in all the terms/words that appear in the speech signal and KWS/STD relies on a textual transcription of the search term to retrieve the speech data. This paper presents the systems submitted to the ALBAYZIN 2012 QbE STD evaluation held as a part of ALBAYZIN 2012 evaluation campaign within the context of the IberSPEECH 2012 Conference(a). The evaluation consists of retrieving the speech files that contain the input queries, indicating their start and end timestamps within the appropriate speech file. Evaluation is conducted on a Spanish spontaneous speech database containing a set of talks from MAVIR workshops(b), which amount at about 7 h of speech in total. We present the database metric systems submitted along with all results and some discussion. Four different research groups took part in the evaluation. Evaluation results show the difficulty of this task and the limited performance indicates there is still a lot of room for improvement. The best result is achieved by a dynamic time warping-based search over Gaussian posteriorgrams/posterior phoneme probabilities. This paper also compares the systems aiming at establishing the best technique dealing with that difficult task and looking for defining promising directions for this relatively novel task.

Extending Distance-based Ranking Models In Estimation of Distribution Algorithms

Recently, probability models on rankings have been proposed in the field of estimation of distribution algorithms in order to solve permutation-based combinatorial optimisation problems. Particularly, distance-based ranking models, such as Mallows and Generalized Mallows under the Kendall’s-t distance, have demonstrated their validity when solving this type of problems. Nevertheless, there are still many trends that deserve further study. In this paper, we extend the use of distance-based ranking models in the framework of EDAs by introducing new distance metrics such as Cayley and Ulam. In order to analyse the performance of the Mallows and Generalized Mallows EDAs under the Kendall, Cayley and Ulam distances, we run them on a benchmark of 120 instances from four well known permutation problems. The conducted experiments showed that there is not just one metric that performs the best in all the problems. However, the statistical test pointed out that Mallows-Ulam EDA is the most stable algorithm among the studied proposals.

Problems when generating virtual models representing real objects: Hondarribia walls

[EN] This paper is based in the following project:

[A_Labraza_Muralla] Documentación geométrica y restitución fotogramétrica de las fases 1 a 5 de la muralla exterior de Labraza. Álava

[ES] Se han documentado unos 140 metros de muralla que corresponde a los alzados suroeste y sur y que incluye la puerta de acceso principal del casco urbano.

[A_Labraza_Muralla] Documentación geométrica y restitución fotogramétrica de la muralla exterior de Labraza. Álava

[ES] Se han documentado unos 180 metros de muralla que corresponde a los alzados este y norte. También se incluye el interior de dos puertas de acceso, el muro exterior del cementerio y parte de los muros de la iglesia.

Recorrido y reflexiones en torno al pensamiento analítico de Georges Laplace: movimiento, interdependencia y arquetipos en la construcción de una arqueología científica

Homenaje a Georges Laplace, realizado en Vitoria-Gasteiz el 13,14 y 15 de noviembre de 2012. Edición a cargo de Aitor Calvo, Aitor Sánchez, Maite García-Rojas y Mónica Alonso-Eguíluz.

Participación ciudadana, patrimonio cultural y museos: entre la teoría y la praxis

Cap. 1. La Nueva Museología, el patrimonio cultural y la participación ciudadana a debate. Iñaki Arrieta Urtizberea Cap. 2. Museos: del público al ciudadano. Rafael Azuar Ruiz Cap. 3. Los públicos y lo público. De mutismos, sorderas, y de diálogos sociales en museos y espacios patrimoniales. Luz Maceira Ochoa Cap. 4. La restitution du patrimoine: un rôle pour le musée? Études de cas dans les communautés innues du Québec et du Labrador (Canada). Élise Dubuc Cap. 5. El museo de territorio y sociedad, ¿una utopía? el caso del Museo Industrial del Ter. Carles García Hermosilla Cap. 6. El ecomuseo del río Caicena (Almedinilla-Córdoba): un proyecto de desarrollo rural desde el patrimonio histórico-natural, ¿y la participación ciudadana? Ignacio Muñiz Jaén Cap. 7. Mé-tisser les mémoires. Musées indiens du nordeste brésilien. Martin Soares Cap. 8. El patrimonio como proceso social. Intervención, desarrollo y consumo del patrimonio minero en Andalucía. Macarena Hernández Ramírez y Esteban Ruiz Ballesteros Cap. 9. Legislación patrimonial, intervención pública y participación ciudadana en la declaración de un conjunto histórico. Iñaki Arrieta Urtizberea Cap. 10. El castillo de Montsoriu. La participación de la sociedad civil. Joaquim Mateu Gasquet Cap. 11. El patrimonio cultural; espacio de encuentro. Daniel Arnesio Lara Montero

Properties of convergence of a class of iterative processes generated by sequences of self-mappings with applications to switched dynamic systems

This article investigates the convergence properties of iterative processes involving sequences of self-mappings of metric or Banach spaces. Such sequences are built from a set of primary self-mappings which are either expansive or non-expansive self-mappings and some of the non-expansive ones can be contractive including the case of strict contractions. The sequences are built subject to switching laws which select each active self-mapping on a certain activation interval in such a way that essential properties of boundedness and convergence of distances and iterated sequences are guaranteed. Applications to the important problem of stability of dynamic switched systems are also given.

Judgmental-analytical procedures for adapting tests: Adaptation to Spanish of the Reasoning Tests Battery

Adapting a test between cultures or languages requires taking into account legal, linguistic, metric, and use-related considerations. Significantly more attention has been paid to the methodological aspects involved in the study of metric equivalence than to judgmental-analytical procedures prior to the empirical confirmation stage. However, considering the latter is crucial in the adaptation process. Along these lines, this paper seeks to describe and focus on the relevance of the previous stages, thereby offering a systematization process that comprises ten sections. This approach contributes to ensuring the construction of a test adapted and equivalent in as much as possible to the original. This process is exemplified by means of a Spanish language adaptation of a cognitive test originally designed in Portuguese for the Portuguese population, the Reasoning Test Battery. Copyright (C) 2013, Konrad Lorenz University Foundation. Published by Elsevier Espana, S.L.U.

Results on proximal and generalized weak proximal contractions including the case of iteration-dependent range sets

This paper presents some further results on proximal and asymptotic proximal contractions and on a class of generalized weak proximal contractions in metric spaces. The generalizations are stated for non-self-mappings of the forms for and , or , subject to and , such that converges uniformly to T, and the distances are iteration-dependent, where , , and are non-empty subsets of X, for , where is a metric space, provided that the set-theoretic limit of the sequences of closed sets and exist as and that the countable infinite unions of the closed sets are closed. The convergence of the sequences in the domain and the image sets of the non-self-mapping, as well as the existence and uniqueness of the best proximity points, are also investigated if the metric space is complete. Two application examples are also given, being concerned, respectively, with the solutions through pseudo-inverses of both compatible and incompatible linear algebraic systems and with the parametrical

Coincidence and common fixed point theorems for Suzuki type hybrid contractions and applications

Coincidence and common fixed point theorems for a class of Suzuki hybrid contractions involving two pairs of single-valued and multivalued maps in a metric space are obtained. In addition, the existence of a common solution for a certain class of functional equations arising in a dynamic programming is also discussed.

Pata contractions and coupled type fixed points

A new coupled fixed point theorem related to the Pata contraction for mappings having the mixed monotone property in partially ordered complete metric spaces is established. It is shown that the coupled fixed point can be unique under some extra suitable conditions involving mid point lower or upper bound properties. Also the corresponding convergence rate is estimated when the iterates of our function converge to its coupled fixed point.