In this paper we define the weighted Cesaro sequence spaces ces (p, q).We prove the space ces(p, q) is a complete paranorm space. In section-2 we determine its Kothe-Toeplitz dual and continuous dual. In section-3 we establish necessary and sufficient condition for a matrix A to map ces (p, q) to and ces(p, q) to , where is the space of all bounded sequences and is the space of all convergent s...

A graph is a block if its blocks are all cliques. In this paper, we study the average eccentricity of graphs from perspective order sequences. An equivalence relation established under sequence and used to prove lower upper bounds on graphs. The result that 1 1n?34n2?12n?, respectively, where n graph. Finally, devise linear time algorithm calculate sequence.

Given two sequences S1, S2 and a constrained sequence C, the longest common subsequence of S1, S2 with restriction to C is defined as the constrained longest common subsequence (CLCS) of S1, S2 and C. At the same time, the best alignment of S1, S2 with restriction to C is defined as the constrained pairwise sequence alignment (CPSA) of S1, S2 and C. Previous algorithms have shown that both CLCS...

In this paper, user set selection in the allocation sequences of round-robin (RR) scheduling for distributed antenna transmission with block diagonalization (BD) pre-coding is proposed. prior research, initial phase equipment RR has been investigated. The performance proposed inferior to that proportional fair (PF) under severe intra-cell interference. multi-input multi-output technology BD app...

Image hashing has attracted more and attention in the field of information security. In this paper, a novel algorithm using cool warm hue three-dimensional space angle is proposed. Firstly, original image preprocessed to get opposite color component H HSV space. Then, distribution pixels extracted from H. Blocks H, according proportion each small block, combined with quaternion component, const...

Mirarab et al. (Research Article, 12 December 2014, p. 1250463) introduced statistical binning to improve the signal in phylogenetic methods using the multispecies coalescent model. We show that all forms of binning-naïve, statistical, and weighted statistical-display poor performance and are statistically inconsistent in large regions of parameter space, unlike unbinned sequence data used with...

We introduce methods to “count” the number of spreading models generated by a sequence and prove the following dichotomy. Every basic sequence in a Banach space X has a normalized block basis (xn) which satisfies one and only one of the following two conditions: (1) (xn) determines a spreading model isometric to `p or c0 over X; (2) There exists a separable Banach space Y that contains (xn) and...

In this paper, we introduce a class of infinite matrices related to the Beurling algebra of periodic functions, and we show that it is an inverse-closed subalgebra of B(`w), the algebra of all bounded linear operators on the weighted sequence space `w, for any 1 ≤ q <∞ and any discrete Muckenhoupt Aq-weight w. Constructive Approximation, To appear

in this paper, the notion of cyclic $varphi$-contraction in fuzzymetric spaces is introduced and a fixed point theorem for this typeof mapping is established. meantime, an example is provided toillustrate this theorem. the main result shows that a self-mappingon a g-complete fuzzy metric space has a unique fixed point if itsatisfies the cyclic $varphi$-contraction. afterwards, some results inco...