This study was funded by projects CGL2015-65055-P and PGC2018-095704-B-I00 from the Spanish Ministry of Science Innovation European Regional Development Fund (FEDER). ADF were supported Severo-Ochoa grant Economy Competitiveness (SVP-2014-068571). LG a Marie Sklodowska-Curie Fellowship Commission (grant number 747729, ‘EcoEvoClim’).

in this paper‎, ‎we introduce a new model of point free topology‎ ‎for point-set topology‎. ‎we study the basic concepts in this‎ ‎structure and will find that it is naturally close to point-set‎ ‎topology‎.‎

This work present several advances in the understanding of dynamic data structures in the bit-probe model: • We improve the lower bound record for dynamic language membership problems to Ω(( lg n lg lg n ) ). Surpassing Ω(lg n) was listed as the first open problem in a survey by Miltersen. • We prove a bound of Ω( lg n lg lg lg n ) for maintaining partial sums in Z/2Z. Previously, the known bou...

Abstract. We generalize two bijections due to Garsia and Gessel to compute the generating functions of the two vector statistics (desG,maj, lG, col) and (desG, idesG,maj, imaj, col, icol) over the wreath product of a symmetric group by a cyclic group. Here desG, lG, maj, col, idesG, imajG, and icol denote the number of descents, length, major index, color weight, inverse descents, inverse major...

Bu çal??man?n temel amac? sosyal bilgiler ö?retmenlerinin sanal müze kullan?m düzeyini ve bu teknik konusunda sahip olduklar? tutumlar? belirlemektir. ?lkokul Ortaokul ö?rencilerinin Sosyal Bilgiler konular?n? teknolojik imkan zaman ölçüsünde daha iyi özümsemeleri için uygulamas?n? kullanmalar? gerekmektedir. Bunu de öncelikle ö?retmenlerin rehber olmak ard?ndan ö?rencileriyle beraber müzeyi ku...

Comment: There was angiocentric involvement, with atypical cells that were positive for the B cell marker CD20, with more benign appearing CD3 positive T cells also present. Reticulin stain showed reticulin proliferation about involved vessels. In situ hybridization of lesions showed strong positivity for EBV. Some members of the audience noted the presence of intranuclear inclusions in the les...

This paper studies the average complexity on the number of comparisons for sorting algorithms. Its information-theoretic lower bound is n lg n− 1.4427n+O(log n). For many efficient algorithms, the first n lg n term is easy to achieve and our focus is on the (negative) constant factor of the linear term. The current best value is −1.3999 for the MergeInsertion sort. Our new value is −1.4106, nar...

Given a string S, the compressed indexing problem is to preprocess S into a compressed representation that supports fast substring queries. The goal is to use little space relative to the compressed size of S while supporting fast queries. We present a compressed index based on the Lempel–Ziv 1977 compression scheme. We obtain the following time-space trade-offs: For constant-sized alphabets (i...

It is widely assumed that O(m+ lg σ) is the best one can do for finding a pattern of length m in a compacted trie storing strings over an alphabet of size σ, if one insists on linear-size data structures and deterministic worst-case running times [Cole et al., ICALP’06]. In this article, we first show that a rather straightforward combination of well-known ideas yields O(m+lg lg σ) deterministi...