For ensuring the displaying effects of Web applications, it is important to perform compatibility testing for browsers under the different configurations and it is a hard task to test all. So this paper focused on the improvements for browser compatibility testing. Firstly, we introduced the related work. Then we analysed the functional speciality of the current popular browsers, and provided t...

Given five positive integers v,m, k, λ and t where v > k > t and v > m > t, a t-(v, k,m, λ) general covering design is a pair (X,B) where X is a set of v elements (called points) and B a multiset of k-subsets of X (called blocks) such that every m-subset of X intersects (is covered by) at least λ members of B in at least t points. In this article we present new constructions for general coverin...

This paper proposes a cluster partitioning technique to calculate improved upper bounds to the optimal solution of maximal covering location problems. Given a covering distance, a graph is built considering as vertices the potential facility locations, and with an edge connecting each pair of facilities that attend a same client. Coupling constraints, corresponding to some edges of this graph, ...

We determine, for each v == 1 mod 3, the maximum (resp. minimum) number of near-triangle factors possible on v points so that each pair of distinct points occurs in a triple in at most (resp. at least) one of the neartriangle factors. In particular, we show that for each v == 1 mod 3, v:/: 7, there exists a near-resolvable exact 2-covering of v points by triples whose near-triangle factors admi...

abstract one of the basic assumptions in hub covering problems is considering the covering radius as an exogenous parameter which cannot be controlled by the decision maker. practically and in many real world cases with a negligible increase in costs, to increase the covering radii, it is possible to save the costs of establishing additional hub nodes. change in problem parameters during the pl...

A perfect covering of a v-set X is a set of subsets of X (called blocks), such that every pair of elements of X (points) occurs in a unique block. A perfect covering is also referred to in the literature as a pairwise balanced design or a finite linear space. The quantity of g’“‘(v) is defined to be the minimum number of blocks in a perfect covering of a v-set, in which the longest block has si...

A spherical stereo panorama is a pair of panoramic images with horizontal parallax, that both have a complete spherical projection covering 360◦ in azimuth and 180◦ in elevation. We present an analyze a new method to generate spherical stereo panorama by using one camera with regular lens, which are compatible for VR HMD display.

We present approximation algorithms for the metric uncapacitated facility location problem and the metric k-median problem achieving guarantees of 3 and 6 respectively. The distinguishing feature of our algorithms is their low running time: O(m log m) and O(m logm(L+log(n))) respectively, where n and m are the total number of vertices and edges in the underlying graph. The main algorithmic idea...

This paper introduces a new similarity measure, the covering similarity, that we formally define for evaluating the similarity between a symbolic sequence and a set of symbolic sequences. A pair-wise similarity can also be directly derived from the covering similarity to compare two symbolic sequences. An efficient implementation to compute the covering similarity is proposed that uses a suffix...

an injective map f : e(g) → {±1, ±2, · · · , ±q} is said to be an edge pair sum labeling of a graph g(p, q) if the induced vertex function f*: v (g) → z − {0} defined by f*(v) = (sigma e∈ev) f (e) is one-one, where ev denotes the set of edges in g that are incident with a vetex v and f*(v (g)) is either of the form {±k1, ±k2, · · · , ±kp/2} or {±k1, ±k2, · · · , ±k(p−1)/2} u {k(p+1)/2} accordin...