T_0*-compactification in the hyperspace

A *-compactification of a T0 quasi-uniform space (X,U) is a compact T0 quasi-uniform space (Y,V) that has a T(V∨V−1)-dense subspace quasi-isomorphic to (X,U). In this paper we study when the hyperspace with the Hausdorff–Bourbaki quasi-uniformity is *-compactifiable and describe some of its *-compactifications.Kunzi, HA.; Romaguera Bonilla, S.; Sanchez Granero, MA. (2012). T_0*-compactification in the hyperspace. Topology and its Applications. 159:1815-1819. doi:10.1016/j.topol.2011.06.064S1815181915

Potential of using remote sensing techniques for global assessment of water footprint of crops

Remote sensing has long been a useful tool in global applications, since it provides physically-based, worldwide, and consistent spatial information. This paper discusses the potential of using these techniques in the research field of water management, particularly for ‘Water Footprint’ (WF) studies. The WF of a crop is defined as the volume of water consumed for its production, where green and blue WF stand for rain and irrigation water usage, respectively. In this paper evapotranspiration, precipitation, water storage, runoff and land use are identified as key variables to potentially be estimated by remote sensing and used for WF assessment. A mass water balance is proposed to calculate the volume of irrigation applied, and green and blue WF are obtained from the green and blue evapotranspiration components. The source of remote sensing data is described and a simplified example is included, which uses evapotranspiration estimates from the geostationary satellite Meteosat 9 and precipitation estimates obtained with the Climatic Prediction Center Morphing Technique (CMORPH). The combination of data in this approach brings several limitations with respect to discrepancies in spatial and temporal resolution and data availability, which are discussed in detail. This work provides new tools for global WF assessment and represents an innovative approach to global irrigation mapping, enabling the estimation of green and blue water use

Complete partial metric spaces have partially metrizable computational models

We show that the domain of formal balls of a complete partial metric space (X, p) can be endowed with a complete partial metric that extends p and induces the Scott topology. This result, that generalizes well-known constructions of Edalat and Heckmann [A computational model for metric spaces, Theoret. Comput. Sci. 193 (1998), pp. 53-73] and Heckmann [Approximation of metric spaces by partial metric spaces, Appl. Cat. Struct. 7 (1999), pp. 71-83] for metric spaces and improves a recent result of Romaguera and Valero [A quantitative computational model for complete partial metric spaces via formal balls, Math. Struct. Comput. Sci. 19 (2009), pp. 541-563], motivates a notion of a partially metrizable computational model which allows us to characterize those topological spaces that admit a compatible complete partial metric via this model.The authors acknowledge the support of the Spanish Ministry of Science and Innovation, under grant MTM2009-12872-C02-01.Romaguera Bonilla, S.; Tirado Peláez, P.; Valero Sierra, Ó. (2012). Complete partial metric spaces have partially metrizable computational models. International Journal of Computer Mathematics. 89(3):284-290. https://doi.org/10.1080/00207160.2011.559229S284290893ALI-AKBARI, M., HONARI, B., POURMAHDIAN, M., & REZAII, M. M. (2009). The space of formal balls and models of quasi-metric spaces. Mathematical Structures in Computer Science, 19(2), 337-355. doi:10.1017/s0960129509007439Edalat, A., & Heckmann, R. (1998). A computational model for metric spaces. Theoretical Computer Science, 193(1-2), 53-73. doi:10.1016/s0304-3975(96)00243-5Edalat, A., & Sünderhauf, P. (1999). Computable Banach spaces via domain theory. Theoretical Computer Science, 219(1-2), 169-184. doi:10.1016/s0304-3975(98)00288-6Flagg, B., & Kopperman, R. (1997). Computational Models for Ultrametric Spaces. Electronic Notes in Theoretical Computer Science, 6, 151-159. doi:10.1016/s1571-0661(05)80164-1Heckmann, R. (1999). Applied Categorical Structures, 7(1/2), 71-83. doi:10.1023/a:1008684018933Kopperman, R., Künzi, H.-P. A., & Waszkiewicz, P. (2004). Bounded complete models of topological spaces. Topology and its Applications, 139(1-3), 285-297. doi:10.1016/j.topol.2003.12.001Krötzsch, M. (2006). Generalized ultrametric spaces in quantitative domain theory. Theoretical Computer Science, 368(1-2), 30-49. doi:10.1016/j.tcs.2006.05.037Künzi, H.-P. A. (2001). Nonsymmetric Distances and Their Associated Topologies: About the Origins of Basic Ideas in the Area of Asymmetric Topology. History of Topology, 853-968. doi:10.1007/978-94-017-0470-0_3LAWSON, J. (1997). Spaces of maximal points. Mathematical Structures in Computer Science, 7(5), 543-555. doi:10.1017/s0960129597002363Martin, K. (1998). Domain theoretic models of topological spaces. Electronic Notes in Theoretical Computer Science, 13, 173-181. doi:10.1016/s1571-0661(05)80221-xMatthews, S. G.Partial metric topology. Procedings of the 8th Summer Conference on General Topology and Applications, Ann. New York Acad. Sci. 728 (1994), pp. 183–197Rodríguez-López, J., Romaguera, S., & Valero, O. (2008). Denotational semantics for programming languages, balanced quasi-metrics and fixed points. International Journal of Computer Mathematics, 85(3-4), 623-630. doi:10.1080/00207160701210653Romaguera, S., & Valero, O. (2009). A quasi-metric computational model from modular functions on monoids. International Journal of Computer Mathematics, 86(10-11), 1668-1677. doi:10.1080/00207160802691652ROMAGUERA, S., & VALERO, O. (2009). A quantitative computational model for complete partial metric spaces via formal balls. Mathematical Structures in Computer Science, 19(3), 541-563. doi:10.1017/s0960129509007671ROMAGUERA, S., & VALERO, O. (2010). Domain theoretic characterisations of quasi-metric completeness in terms of formal balls. Mathematical Structures in Computer Science, 20(3), 453-472. doi:10.1017/s0960129510000010Rutten, J. J. M. M. (1998). Weighted colimits and formal balls in generalized metric spaces. Topology and its Applications, 89(1-2), 179-202. doi:10.1016/s0166-8641(97)00224-1Schellekens, M. P. (2003). A characterization of partial metrizability: domains are quantifiable. Theoretical Computer Science, 305(1-3), 409-432. doi:10.1016/s0304-3975(02)00705-3Smyth, M. B. (2006). The constructive maximal point space and partial metrizability. Annals of Pure and Applied Logic, 137(1-3), 360-379. doi:10.1016/j.apal.2005.05.032Waszkiewicz, P. (2003). Applied Categorical Structures, 11(1), 41-67. doi:10.1023/a:1023012924892WASZKIEWICZ, P. (2006). Partial metrisability of continuous posets. Mathematical Structures in Computer Science, 16(02), 359. doi:10.1017/s096012950600519

New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces

Schellekens [The Smyth completion: A common foundation for denotational semantics and complexity analysis, Electron. Notes Theor. Comput. Sci. 1 (1995), pp. 211-232.] introduced the theory of complexity (quasi-metric) spaces as a part of the development of a topological foundation for the asymptotic complexity analysis of programs and algorithms in 1995. The applicability of this theory to the asymptotic complexity analysis of divide and conquer algorithms was also illustrated by Schellekens in the same paper. In particular, he gave a new formal proof, based on the use of the Banach fixed-point theorem, of the well-known fact that the asymptotic upper bound of the average running time of computing of Mergesort belongs to the asymptotic complexity class of n log(2) n. Recently, Schellekens' method has been shown to be useful in yielding asymptotic upper bounds for a class of algorithms whose running time of computing leads to recurrence equations different from the divide and conquer ones reported in Cerda-Uguet et al. [The Baire partial quasi-metric space: A mathematical tool for the asymptotic complexity analysis in Computer Science, Theory Comput. Syst. 50 (2012), pp. 387-399.]. However, the variety of algorithms whose complexity can be analysed with this approach is not much larger than that of algorithms that can be analysed with the original Schellekens method. In this paper, on the one hand, we extend Schellekens' method in order to yield asymptotic upper bounds for a certain class of recursive algorithms whose running time of computing cannot be discussed following the techniques given by Cerda-Uguet et al. and, on the other hand, we improve the original Schellekens method by introducing a new fixed-point technique for providing, contrary to the case of the method introduced by Cerda-Uguet et al., lower asymptotic bounds of the running time of computing of the aforementioned algorithms and those studied by Cerda-Uguet et al. We illustrate and validate the developed method by applying our results to provide the asymptotic complexity class (asymptotic upper and lower bounds) of the celebrated algorithms Quicksort, Largetwo and Hanoi.The authors are thankful for the support from the Spanish Ministry of Science and Innovation, grant MTM2009-12872-C02-01.Romaguera Bonilla, S.; Tirado Peláez, P.; Valero Sierra, Ó. (2012). New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces. International Journal of Computer Mathematics. 89(13-14):1728-1741. https://doi.org/10.1080/00207160.2012.659246S172817418913-14Cerdà-Uguet, M. A., Schellekens, M. P., & Valero, O. (2011). The Baire Partial Quasi-Metric Space: A Mathematical Tool for Asymptotic Complexity Analysis in Computer Science. Theory of Computing Systems, 50(2), 387-399. doi:10.1007/s00224-010-9310-7Cull, P., & Ecklund, E. F. (1985). Towers of Hanoi and Analysis of Algorithms. The American Mathematical Monthly, 92(6), 407. doi:10.2307/2322448García-Raffi, L. M., Romaguera, S., & Sánchez-Pérez, E. A. (2002). Sequence spaces and asymmetric norms in the theory of computational complexity. Mathematical and Computer Modelling, 36(1-2), 1-11. doi:10.1016/s0895-7177(02)00100-0García-Raffi, L. M., Romaguera, S., & Schellekens, M. P. (2008). Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms. Journal of Mathematical Analysis and Applications, 348(1), 346-355. doi:10.1016/j.jmaa.2008.07.026Künzi, H.-P. A. (2001). Nonsymmetric Distances and Their Associated Topologies: About the Origins of Basic Ideas in the Area of Asymmetric Topology. History of Topology, 853-968. doi:10.1007/978-94-017-0470-0_3Rodríguez-López, J., Romaguera, S., & Valero, O. (2008). Denotational semantics for programming languages, balanced quasi-metrics and fixed points. International Journal of Computer Mathematics, 85(3-4), 623-630. doi:10.1080/00207160701210653Rodríguez-López, J., Schellekens, M. P., & Valero, O. (2009). An extension of the dual complexity space and an application to Computer Science. Topology and its Applications, 156(18), 3052-3061. doi:10.1016/j.topol.2009.02.009Romaguera, S., & Schellekens, M. (1999). Quasi-metric properties of complexity spaces. Topology and its Applications, 98(1-3), 311-322. doi:10.1016/s0166-8641(98)00102-3Romaguera, S., & Valero, O. (2008). On the structure of the space of complexity partial functions. International Journal of Computer Mathematics, 85(3-4), 631-640. doi:10.1080/00207160701210117Romaguera, S., Schellekens, M. P., & Valero, O. (2011). The complexity space of partial functions: a connection between complexity analysis and denotational semantics. International Journal of Computer Mathematics, 88(9), 1819-1829. doi:10.1080/00207161003631885Schellekens, M. (1995). The Smyth Completion. Electronic Notes in Theoretical Computer Science, 1, 535-556. doi:10.1016/s1571-0661(04)00029-5Scott, D. S. 1970. Outline of a mathematical theory of computation. Proceedings of the 4th Annual Princeton Conference on Information Sciences and Systems. March26–271970, Princeton, NJ. pp.169–176

The bicompletion of the Hausdorff quasi-uniformity

We study conditions under which the Hausdorff quasi-uniformity ${\mathcal U}_H$ of a quasi-uniform space $(X,{\mathcal U})$ on the set ${\mathcal P}_0(X)$ of the nonempty subsets of $X$ is bicomplete. Indeed we present an explicit method to construct the bicompletion of the $T_0$-quotient of the Hausdorff quasi-uniformity of a quasi-uniform space. It is used to find a characterization of those quasi-uniform $T_0$-spaces $(X,{\mathcal U})$ for which the Hausdorff quasi-uniformity $\widetilde{{\mathcal U}}_H$ of their bicompletion $(\widetilde{X},{\widetilde{\mathcal U}})$ on ${\mathcal P}_0(\widetilde{X})$ is bicomplete

Vanishing of the upper critical field in Bi_2Sr_2CaCu_2O_{8+\delta} from Landau-Ott scaling

We apply Landau-Ott scaling to the reversible magnetization data of Bi$_2$Sr$_2$CaCu$_2$O$_{8+\delta}$ published by Y. Wang et al. [\emph{Phys. Rev. Lett. \textbf{95} 247002 (2005)}] and find that the extrapolation of the Landau-Ott upper critical field line vanishes at a critical temperature parameter, T^*_c, a few degrees above the zero resistivity critical temperature, T_c. Only isothermal curves below and near to T_c were used to determine this transition temperature. This temperature is associated to the disappearance of the mixed state instead of a complete suppression of superconductivity in the sample.Comment: 3 figure

Examples of non-strong fuzzy metrics

Answering a recent question posed by Gregori et al. [On a class of completable fuzzy metric spaces, Fuzzy Sets and Systems 161 (2010), 2193-2205] we present two examples of non-strong fuzzy metrics (in the sense of George and Veeramani). © 2010 Elsevier B.V. All rights reserved.This research was supported by the Ministry of Science and Innovation of Spain under Grants MTM2009-12872-C02-01 and MTM2009-12872-C02-02. J. Gutierrez Garcia also acknowledges financial support from the University of the Basque Country under Grant GIU07/27.Gutiérrez García, J.; Romaguera Bonilla, S. (2011). Examples of non-strong fuzzy metrics. Fuzzy Sets and Systems. 162(1):91-93. https://doi.org/10.1016/j.fss.2010.09.017S9193162

Applications of the complexity space to the General Probabilistic Divide and Conquer Algorithms

AbstractSchellekens [M. Schellekens, The Smyth completion: A common foundation for denotational semantics and complexity analysis, in: Proc. MFPS 11, in: Electron. Notes Theor. Comput. Sci., vol. 1, 1995, pp. 535–556], and Romaguera and Schellekens [S. Romaguera, M. Schellekens, Quasi-metric properties of complexity spaces, Topology Appl. 98 (1999) 311–322] introduced a topological foundation to obtain complexity results through the application of Semantic techniques to Divide and Conquer Algorithms. This involved the fact that the complexity (quasi-metric) space is Smyth complete and the use of a version of the Banach fixed point theorem and improver functionals. To further bridge the gap between Semantics and Complexity, we show here that these techniques of analysis, based on the theory of complexity spaces, extend to General Probabilistic Divide and Conquer schema discussed by Flajolet [P. Flajolet, Analytic analysis of algorithms, in: W. Kuich (Ed.), 19th Internat. Colloq. ICALP'92, Vienna, July 1992; Automata, Languages and Programming, in: Lecture Notes in Comput. Sci., vol. 623, 1992, pp. 186–210]. In particular, we obtain a general method which is useful to show that for several recurrence equations based on the recursive structure of General Probabilistic Divide and Conquer Algorithms, the associated functionals have a unique fixed point which is the solution for the corresponding recurrence equation

Transition to a Superconductor with Insulating Cavities

An extreme type II superconductor with internal insulating regions, namely cavities, is studied here. We find that the cavity-bearing superconductor has lower energy than the defect-free superconductor above a critical magnetic induction $B^*$ for insulating cavities but not for metallic ones. Using a numerical approach for the Ginzburg-Landau theory we compute and compare free energy densities for several cavity radii and at least for two cavity densities, assuming a cubic lattice of spherical cavities.Comment: 7 pages, 4 figures, to be published in Europhysics Letter

Quasi-uniform hyperspaces of compact subsets

AbstractLet (X,u) be a quasi-uniform space, K(X) be the family of all nonempty compact subsets of (X,u). In this paper, the notion of compact symmetry for (X,u) is introduced, and relationships between the Bourbaki quasi-uniformity and the Vietoris topology on K(X) are examined. Furthermore we establish that for a compactly symmetric quasi-uniform space (X,u) the Bourbaki quasi-uniformity u∗ on K(X) is complete if and only if u is complete. This theorem generalizes the well-known Zenor-Morita theorem for uniformisable spaces to the quasi-uniform setting