Methods Pattern analysis of a chorological dataset, consisting of the occurrences of 3041 vascular plant species in each of the 50 km 9 50 km UTM cells of a grid covering Iberia and the Balearic Islands, was based on cluster analysis (unweighted pair-group method using arithmetic averages; UPGMA) and parsimony analysis of endemicity (PAE). The Jaccard similarity index was used in the UPGMA, and...

In this article, we consider pair frames in Banach spaces and   introduce Banach pair frames. Some various concepts in the frame theory such as frames, Schauder frames, Banach frames and atomic decompositions are considered as   special kinds of (Banach) pair frames.  Some frame-like inequalities  for (Banach)  pair frames are presented. The elements that participant  in the construction of (Ba...

In this paper, three types of (philosophical, optimistic and pessimistic) multigranulation single valued neutrosophic (SVN) covering-based rough set models are presented, and these three models are applied to the problem of multi-criteria group decision making (MCGDM).Firstly, a type of SVN covering-based rough set model is proposed.Based on this rough set model, three types of mult...

We consider heavy meson-antimeson pairs and their coupling to quarkonium in the context of nonrelativistic effective field theories (EFTs) incorporating adiabatic expansion. work out all leading order couplings obtain contributions masses widths quarkonia. match new potentials terms QCD. Using available lattice data for coupled system lowest lying pair, we extract mixing potential use it comput...

We consider two covering variants of the network design problem. are given a set origin/destination pairs, called O/D and each such pair is covered if there exists path in from origin to destination whose length not larger than threshold. In first problem, Maximal Covering Network Design one must determine that maximizes total fulfilled demand pairs subject budget constraint on costs network. s...

Rough set theory provides a systematic way for rule extraction, attribute reduction and knowledge classification in information systems. Some measurements are important in rough sets. For example, information entropy, knowledge dependency are useful in attribute reduction algorithms. This paper proposes the concepts of the lower and upper covering numbers to establish measurements in covering-b...

We consider a new construction of locality-sensitive hash functions for Hamming space that is covering in the sense that is it guaranteed to produce a collision for every pair of vectors within a given radius r. The construction is efficient in the sense that the expected number of hash collisions between vectors at distance cr, for a given c > 1, comes close to that of the best possible data i...

Let Γ be a group together with a sequence of normal subgroups Γ ⊃ Γ1 ⊃ Γ2 ⊃ . . . of finite index [Γ : Γk] such that T k Γk = {1}. Let (X,Y ) be a (compact) 4n-dimensional Poincaré pair and p : (X,Y )→ (X,Y ) be a Γ-covering, i.e. normal covering with Γ as deck transformation group. We get associated Γ/Γk-coverings (Xk, Yk)→ (X,Y ). We prove that sign(X,Y ) = lim k→∞ sign(Xk, Yk) [Γ : Γk] , whe...

Reduplication has played a central role in the development of phonological theories for 30years. The introduction of Classical Optimality Theory (OT) in the 1990s sparked intensive research into the typology and analysis of reduplicative patterns, as reduplication was a key testing area both for OT and for theories critical of OT. Now, after some 20years of research within the OT model, it is a...