Sobrification and bicompletion of totally bounded quasi-uniform spaces

We observe that if is a compatible totally bounded quasi-uniformity on a T0-space (X,), then the bicompletion of (X, ) is a strongly sober, locally quasicompact space. It follows that the b-closure S of (X, ) in is homeomorphic to the sobrification of the space (X, ). We prove that S is equal to if and only if (X, ) is a core-compact space in which every ultrafilter has an irreducible convergence set and is the coarsest quasi-uniformity compatible with . If is the Pervin quasi-uniformity on X, then S is equal to if and only if X is hereditarily quasicompact, or equivalently, is the Pervin quasi-uniformity o

CVaR minimization by the SRA algorithm

Using the risk measure CV aR in �nancial analysis has become more and more popular recently. In this paper we apply CV aR for portfolio optimization. The problem is formulated as a two-stage stochastic programming model, and the SRA algorithm, a recently developed heuristic algorithm, is applied for minimizing CV aR

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

Targeted alpha therapy in vivo: direct evidence for single cancer cell kill using 149Tb-rituximab

This study demonstrates high-efficiency sterilisation of single cancer cells in a SCID mouse model of leukaemia using rituximab, a monoclonal antibody that targets CD20, labelled with terbium-149, an alpha-emitting radionuclide. Radio-immunotherapy with 5.5MBq labelled antibody conjugate (1.11GBq/mg) 2 days after an intravenous graft of 5·106 Daudi cells resulted in tumour-free survival for >120 days in 89% of treated animals. In contrast, all control mice (no treatment or treated with 5 or 300µg unlabelled rituximab) developed lymphoma disease. At the end of the study period, 28.4%±4% of the long-lived daughter activity remained in the body, of which 91.1% was located in bone tissue and 6.3% in the liver. A relatively high daughter radioactivity concentration was found in the spleen (12%±2%/g), suggesting that the killed cancer cells are mainly eliminated through the spleen. This promising preliminary in vivo study suggests that targeted alpha therapy with 149Tb is worthy of consideration as a new-generation radio-immunotherapeutic approac

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

Normally preordered spaces and utilities

In applications it is useful to know whether a topological preordered space is normally preordered. It is proved that every $k_\omega$-space equipped with a closed preorder is a normally preordered space. Furthermore, it is proved that second countable regularly preordered spaces are perfectly normally preordered and admit a countable utility representation.Comment: 17 pages, 1 figure. v2 contains a second proof to the main theorem with respect to the published version. The last section of v1 is not present in v2. It will be included in a different wor

The Relationship between Life Course Socioeconomic Conditions and Objective and Subjective Memory in Older Age.

While objective memory performance in older adults was primarily shown to be affected by education as indicator of life course socioeconomic conditions, other life course socioeconomic conditions seem to relate to subjective memory complaints. However, studies differ in which life course stages were investigated. Moreover, studies have explored these effects in an isolated way, but have not yet investigated their unique effect when considering several stages of the life course simultaneously. This study, therefore, examined the respective influence of socioeconomic conditions from childhood up to late-life on prospective memory (PM) performance as an objective indicator of everyday memory as well as on subjective memory complaints (SMC) in older age using structural equation modeling. Data came from two waves of the Vivre-Leben-Vivere aging study (n=993, Mage=80.56). The results indicate that only socioeconomic conditions in adulthood significantly predicted late-life PM performance. PM performance was also predicted by age and self-rated health. In contrast, SMC in older age were not predicted by socioeconomic conditions at any stage of the life course but were predicted by level of depression. In line with the cognitive reserve hypothesis, present results highlight the significance of education and occupation (adulthood socioeconomic conditions) for cognitive functioning in later life

Use of tobacco and alcohol by Swiss primary care physicians: a cross-sectional survey

BACKGROUND: Health behaviours among doctors has been suggested to be an important marker of how harmful lifestyle behaviours are perceived. In several countries, decrease in smoking among physicians was spectacular, indicating that the hazard was well known. Historical data have shown that because of their higher socio-economical status physicians take up smoking earlier. When the dangers of smoking become better known, physicians began to give up smoking at a higher rate than the general population. For alcohol consumption, the situation is quite different: prevalence is still very high among physicians and the dangers are not so well perceived. To study the situation in Switzerland, data of a national survey were analysed to determine the prevalence of smoking and alcohol drinking among primary care physicians. METHODS: 2'756 randomly selected practitioners were surveyed to assess subjective mental and physical health and their determinants, including smoking and drinking behaviours. Physicians were categorised as never smokers, current smokers and former smokers, as well as non drinkers, drinkers (AUDIT-C < 4 for women and < 5 for men) and at risk drinkers (higher scores). RESULTS: 1'784 physicians (65%) responded (men 84%, mean age 51 years). Twelve percent were current smokers and 22% former smokers. Sixty six percent were drinkers and 30% at risk drinkers. Only 4% were never smokers and non drinkers. Forty eight percent of current smokers were also at risk drinkers and 16% of at risk drinkers were also current smokers. Smoking and at risk drinking were more frequent among men, middle aged physicians and physicians living alone. When compared to a random sample of the Swiss population, primary care physicians were two to three times less likely to be active smokers (12% vs. 30%), but were more likely to be drinkers (96% vs. 78%), and twice more likely to be at risk drinkers (30% vs. 15%). CONCLUSION: The prevalence of current smokers among Swiss primary care physicians was much lower than in the general population in Switzerland, reflecting that the hazards of smoking are well known to doctors. However, the opposite was found for alcohol use, underlining the importance of making efforts in this area to increase awareness among physicians of the dangers of alcohol consumption