570 research outputs found

    Standard fuzzy uniform structures based on continuous t-norms

    Full text link
    This paper deals with fuzzy uniform structures previously introduced by the authors [Fuzzy uniform structures and continuous t-norms, Fuzzy Sets Syst. 161 (2009) 1011-1021]. Our approach involves a covariant functor psi from the category of fuzzy uniform spaces and fuzzy uniformly continuous mappings (in our sense) to the category of uniform spaces and uniformly continuous mappings. We show that psi is well-behaved with respect to some significant fuzzy uniform concepts. and its behavior provides a method to introduce notions of tine fuzzy uniform structure and Stone-tech fuzzy compactification in this context. Our method also applies to obtain fuzzy versions of some classical results on topological algebra and hyperspaces. The case of quasi-uniform structures is also analyzed. (C) 2011 Elsevier B.V. All rights reserved.This research is supported by the Plan Nacional I+D+i, under Grants MTM2009-12872-C02-01 and MTM2009-12872-C02-02.Gutiérrez, J.; Romaguera Bonilla, S.; Sanchis, M. (2012). Standard fuzzy uniform structures based on continuous t-norms. Fuzzy Sets and Systems. 195:75-89. doi:10.1016/j.fss.2011.10.008S758919

    fixed point

    Full text link
    The study of the dual complexity space, introduced by S. Romaguera and M. P. Schellekens [Quasi-metric properties of complexity spaces, Topol. Appl. 98 (1999), pp. 311-322], constitutes a part of the interdisciplinary research on Computer Science and Topology. The relevance of this theory is given by the fact that it allows one to apply fixed point techniques of denotational semantics to complexity analysis. Motivated by this fact and with the intention of obtaining a mixed framework valid for both disciplines, a new complexity space formed by partial functions was recently introduced and studied by S. Romaguera and O. Valero [On the structure of the space of complexity partial functions, Int. J. Comput. Math. 85 (2008), pp. 631-640]. An application of the complexity space of partial functions to model certain processes that arise, in a natural way, in symbolic computation was given in the aforementioned reference. In this paper, we enter more deeply into the relationship between semantics and complexity analysis of programs. We construct an extension of the complexity space of partial functions and show that it is, at the same time, an appropriate mathematical tool for the complexity analysis of algorithms and for the validation of recursive definitions of programs. As applications of our complexity framework, we show the correctness of the denotational specification of the factorial function and give an alternative formal proof of the asymptotic upper bound for the average case analysis of Quicksort.The first and the third authors acknowledge the support of the Spanish Ministry of Science and Innovation, and FEDER, grant MTM2009-12872-C02-01 (subprogram MTM), and the support of Generalitat Valenciana, grant ACOMP2009/005. The second author acknowledges the support of the Science Foundation Ireland, SFI Principal Investigator Grant 07/IN.1/I977.Romaguera Bonilla, S.; Schellekens, M.; Valero Sierra, Ó. (2011). The complexity space of partial functions: A connection between Complexity Analysis and Denotational Semantics. International Journal of Computer Mathematics. 88(9):1819-1829. https://doi.org/10.1080/00207161003631885S18191829889De Bakker, J. W., & de Vink, E. P. (1998). Denotational models for programming languages: applications of Banach’s Fixed Point Theorem. Topology and its Applications, 85(1-3), 35-52. doi:10.1016/s0166-8641(97)00140-5Emerson, E. A., & Jutla, C. S. (1999). The Complexity of Tree Automata and Logics of Programs. SIAM Journal on Computing, 29(1), 132-158. doi:10.1137/s0097539793304741Flajolet, P., & Golin, M. (1994). Mellin transforms and asymptotics. Acta Informatica, 31(7), 673-696. doi:10.1007/bf01177551Garcí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., & Sánchez-Pérez, E. A. (2003). The supremum asymmetric norm on sequence algebras. Electronic Notes in Theoretical Computer Science, 74, 39-50. doi:10.1016/s1571-0661(04)80764-3García-Raffi, L. M., Romaguera, S., Sánchez-Pérez, E. A. and Valero, O. Normed Semialgebras: A Mathematical Model for the Complexity Analysis of Programs and Algorithms. Proceedings of The 7th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2003), Orlando, Florida, USA. Edited by: Callaos, N., Di Sciullo, A. M., Ohta, T. and Liu, T.K. Vol. II, pp.55–58. Orlando, FL: International Institute of Informatics and Systemics.Den Hartog, J. I., de Vink, E. P., & de Bakker, J. W. (2001). Metric Semantics and Full Abstractness for Action Refinement and Probabilistic Choice. Electronic Notes in Theoretical Computer Science, 40, 72-99. doi:10.1016/s1571-0661(05)80038-6Kü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_3Medina, J., Ojeda-Aciego, M. and Ruiz-Calviño, J. A fixed point theorem for multi-valued functions with an application to multilattice-based logic programming. Applications of Fuzzy Sets Theory: 7th International Workshop on Fuzzy Logic and Applications, WILF 2007, Camogli, Italy, July 7–10, 2007, Proceedings. Edited by: Masulli, F., Mitra, S. and Pasi, G. Vol. 4578, pp.37–44. Berlin: Springer-Verlag. Notes in Artificial IntelligenceO’Keeffe, M., Romaguera, S., & Schellekens, M. (2003). Norm-weightable Riesz Spaces and the Dual Complexity Space. Electronic Notes in Theoretical Computer Science, 74, 105-121. doi:10.1016/s1571-0661(04)80769-2Rodríguez-López, J., Romaguera, S., & Valero, O. (2004). Asymptotic Complexity of Algorithms via the Nonsymmetric Hausdorff Distance. Computing Letters, 2(3), 155-161. doi:10.1163/157404006778330816Rodrí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., & 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., & Schellekens, M. (2000). The quasi-metric of complexity convergence. Quaestiones Mathematicae, 23(3), 359-374. doi:10.2989/16073600009485983Romaguera, S., & Schellekens, M. P. (2002). Duality and quasi-normability for complexity spaces. Applied General Topology, 3(1), 91. doi:10.4995/agt.2002.2116Romaguera, 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., Sánchez-Pérez, E. A., & Valero, O. (2003). The complexity space of a valued linearly ordered set. Electronic Notes in Theoretical Computer Science, 74, 158-171. doi:10.1016/s1571-0661(04)80772-2Schellekens, M. (1995). The Smyth Completion. Electronic Notes in Theoretical Computer Science, 1, 535-556. doi:10.1016/s1571-0661(04)00029-5Schellekens, M. 1995. “The smyth completion: A common topological foundation for denotational semantics and complexity analysis”. Pittsburgh: Carnegie Mellon University. Ph.D. thesisSeda, A. K., & Hitzler, P. (2008). Generalized Distance Functions in the Theory of Computation. The Computer Journal, 53(4), 443-464. doi:10.1093/comjnl/bxm108Straccia, U., Ojeda-Aciego, M., & Damásio, C. V. (2009). On Fixed-Points of Multivalued Functions on Complete Lattices and Their Application to Generalized Logic Programs. SIAM Journal on Computing, 38(5), 1881-1911. doi:10.1137/070695976Tennent, R. D. (1976). The denotational semantics of programming languages. Communications of the ACM, 19(8), 437-453. doi:10.1145/360303.360308Tix, R., Keimel, K., & Plotkin, G. (2005). RETRACTED: Semantic Domains for Combining Probability and Non-Determinism. Electronic Notes in Theoretical Computer Science, 129, 1-104. doi:10.1016/j.entcs.2004.06.06

    The Wijsman topology of a fuzzy metric space

    Full text link
    [EN] We introduce and study the notions of lower Wijsman topology, upper Wijsman topology and Wijsman topology of a fuzzy metric space in the sense of Kramosil and Michalek. In particular, quasi-uniformizability, uniformizability, quasi-metrizability and metrizability of these topologies are discussed. Their relations with other hypertopologies are also analyzed. Corresponding results to the Wijsman topology of a metric space are deduced from our approach with the help of the standard fuzzy metric.J. Gutierrez Garcia acknowledges the support of the Ministry of Economy and Competitiveness of Spain, Grant MTM2012-37894-C02-02. J. Rodriguez-Lopez, S. Romaguera and M. Sanchis also acknowledge the support of the Ministry of Economy and Competitiveness of Spain, Grant MTM2012-37894-C02-01.Gutierrez Garcia, J.; Rodríguez López, J.; Romaguera Bonilla, S.; Sanchis, M. (2016). The Wijsman topology of a fuzzy metric space. Fuzzy Sets and Systems. 300:57-71. https://doi.org/10.1016/j.fss.2015.08.005S577130

    Comparación del comportamiento de dos escayolas amasadas con aguas contaminadas

    Get PDF
    Not availableLas investigaciones que se publican actualmente acerca de la físico-química del yeso como material de construcción resultan relativamente escasas si se tiene en cuenta que, pese a tratarse de un material conocido y utilizado desde hace milenios, todavía hoy se ignoran algunos aspectos de su comportamiento

    Effect of silicoaluminous pozzolans on the hydration process of the Portland cement cured at low temperatures

    Full text link
    The aim of this paper is to study hydration processes in cement pastes and mortars, blended with either metakaolin (MK) or a catalyst used in catalytic cracking (FCC), and cured at low temperature. The amounts of hydrates and portlandite in pastes have been determined for 3¿28 days curing at 5¿20 C. Microstructural study, using thermogravimetric analysis of the pastes, has shown that FCC acts mainly as a pozzolan at low temperatures (5¿10 C), whereas MK also accelerates Portland cement hydration. Mechanical strengths of a control mortar, and mortars made with 15% replacement of cement by these two pozzolans, have been measured. Both mortars containing pozzolans exhibited a relative increase in compressive strength when cured at 5 C. A limestone filler (LF) has been used to compare the effects of adding inert or pozzolanic materials. Finally, mortars were prepared by partially replacing aggregates with either MK, FCC or LF. The MK and FCC are effective materials even for low curing temperatures, especially when they are used to replace a fraction of the aggregates in mortarsAuthors thanks to Ministerio de Ciencia and Tecnologia of Spain the financial support of project MAT2001-2694 and FEDER funding.Soriano Martinez, L.; Monzó Balbuena, JM.; Bonilla Salvador, MM.; Tashima, MM.; Paya Bernabeu, JJ.; Borrachero Rosado, MV. (2013). Effect of silicoaluminous pozzolans on the hydration process of the Portland cement cured at low temperatures. Cement and Concrete Composites. 42:41-48. doi:10.1016/j.cemconcomp.2013.05.007S41484

    Prácticas de física : laboratorio II

    Get PDF
    1 archivo PDF (86 páginas)Manual de laboratorio de prácticas de física

    At the beginnings of the funerary Megalithism in Iberia at Campo de Hockey necropolis

    Get PDF
    The excavations undertaken at the Campo de Hockey site in 2008 led to the identification of a major Neolithic necropolis in the former Island of San Fernando (Bay of Cádiz). This work presents the results of the latest studies, which indicate that the site stands as one of the oldest megalithic necropolises in the Iberian Peninsula. The main aim of this work is to present with precision the chronology of this necropolis through a Bayesian statistical model that confirms that the necropolis was in use from c. 4300 to 3800 cal BC. The presence of prestige grave goods in the earliest and most monumental graves suggest that the Megalithism phenomenon emerged in relation to maritime routes linked to the distribution of exotic products. We also aim to examine funerary practices in these early megalithic communities, and especially their way of life and the social reproduction system. As such, in addition to the chronological information and the Bayesian statistics, we provide the results of a comprehensive interdisciplinary study, including anthropological, archaeometric and genetic data.Archaeological background: the Campo de Hockey settlement Methods - Tomb typology - Radiocarbon dates and Bayesian analysis. - Bioarchaeology. - DNA - Grave goods Results - Tomb typology - Radiocarbon dating: Bayesian analysis - Bioarchaeology. - DNA - Grave goods. Discussion and conclusions

    Search for Eccentric Black Hole Coalescences during the Third Observing Run of LIGO and Virgo

    Full text link
    Despite the growing number of confident binary black hole coalescences observed through gravitational waves so far, the astrophysical origin of these binaries remains uncertain. Orbital eccentricity is one of the clearest tracers of binary formation channels. Identifying binary eccentricity, however, remains challenging due to the limited availability of gravitational waveforms that include effects of eccentricity. Here, we present observational results for a waveform-independent search sensitive to eccentric black hole coalescences, covering the third observing run (O3) of the LIGO and Virgo detectors. We identified no new high-significance candidates beyond those that were already identified with searches focusing on quasi-circular binaries. We determine the sensitivity of our search to high-mass (total mass M>70M>70 MM_\odot) binaries covering eccentricities up to 0.3 at 15 Hz orbital frequency, and use this to compare model predictions to search results. Assuming all detections are indeed quasi-circular, for our fiducial population model, we place an upper limit for the merger rate density of high-mass binaries with eccentricities 0<e0.30 < e \leq 0.3 at 0.330.33 Gpc3^{-3} yr1^{-1} at 90\% confidence level.Comment: 24 pages, 5 figure

    A search for the dimuon decay of the Standard Model Higgs boson with the ATLAS detector

    Get PDF
    A search for the dimuon decay of the Standard Model (SM) Higgs boson is performed using data corresponding to an integrated luminosity of 139 fb(-1) collected with the ATLAS detector in Run 2 pp collisions at root s = 13 TeV at the Large Hadron Collider. The observed (expected) significance over the background-only hypothesis for a Higgs boson with a mass of 125.09 GeV is 2.0 sigma (1.7 sigma). The observed upper limit on the cross section times branching ratio for pp -&gt; H -&gt; mu mu is 2.2 times the SM prediction at 95% confidence level, while the expected limit on a H -&gt; mu mu signal assuming the absence (presence) of a SM signal is 1.1(2.0). The best-fit value of the signal strength parameter, defined as the ratio of the observed signal yield to the one expected in the SM, is mu = 1.2 +/- 0.6. (C) 2020 The Author(s). Published by Elsevier B.V

    The ATLAS fast tracKer system

    Get PDF
    The ATLAS Fast TracKer (FTK) was designed to provide full tracking for the ATLAS high-level trigger by using pattern recognition based on Associative Memory (AM) chips and fitting in high-speed field programmable gate arrays. The tracks found by the FTK are based on inputs from all modules of the pixel and silicon microstrip trackers. The as-built FTK system and components are described, as is the online software used to control them while running in the ATLAS data acquisition system. Also described is the simulation of the FTK hardware and the optimization of the AM pattern banks. An optimization for long-lived particles with large impact parameter values is included. A test of the FTK system with the data playback facility that allowed the FTK to be commissioned during the shutdown between Run 2 and Run 3 of the LHC is reported. The resulting tracks from part of the FTK system covering a limited η-ϕ region of the detector are compared with the output from the FTK simulation. It is shown that FTK performance is in good agreement with the simulation. © The ATLAS collaboratio
    corecore