This paper considers the interaction between channel assignment and distributed scheduling in multi-channel multiradio Wireless Mesh Networks (WMNs). Recently, a number of distributed scheduling algorithms for wireless networks have emerged. Due to their distributed operation, these algorithms can achieve only a fraction of the maximum possible throughput. As an alternative to increasing the th...

The sphericity sph(G) of a graph G is the minimum dimension d for which G is the intersection graph of a family of congruent spheres in Rd . The edge clique cover number (G) is the minimum cardinality of a set of cliques (complete subgraphs) that covers all edges of G. We prove that if G has at least one edge, then sph(G) (G). Our upper bound remains valid for intersection graphs defined by bal...

In distributed and decentralized state estimation systems, fusion methods are employed to systematically combine multiple estimates of the state into a single, more accurate estimate. An often encountered problem in the fusion process relates to unknown common information that is shared by the estimates to be fused and is responsible for correlations. If the correlation structure is unknown to ...

By providing explicit definitions, we show that in both affine and projective geometry of dimension ≥ 3, considered as first-order theories axiomatized in terms of lines as the only variables, and the binary line-intersection predicate as primitive notion, non-intersection of two lines can be positively defined in terms of line-intersection. Mathematics Subject Classification (2000): 51A05, 51A...

We study a particular graded ring structure on the set of all loopfree matroids on a fixed labeled ground set, which occurs naturally in tropical geometry. The product is given by matroid intersection and the additive structure is defined by assigning to each matroid the indicator vector of its chains of flats. We show that this ring is generated in corank one, more precisely that any matroid c...

In this paper we study restrictions imposed on individual preferences, as opposed to preference profiles, and we introduce individual preference restrictions that characterize the existence and uniqueness of stable hedonic coalition structures on rich preference domains. We prove that if such a preference domain satisfies an individual preference restriction then it guarantees the existence of ...

We prove a sufficient condition for a graph G to have a matching that interconnects all the components of a disconnected spanning subgraph ofG. The condition is derived from a recent extension of the Matroid intersection theorem due to Aharoni and Berger. We apply the result to the problem of the existence of a (spanning) 2-walk in sufficiently tough graphs.

We examine the recently found point of intersection between the Z2 and Z4 orbifold subvarieties in the K3 moduli space more closely. First we give an explicit identification of the coordinates of the respective Z2 and Z4 orbifold theories at this point. Secondly we construct the explicit identification of conformal field theories at this point and show the orthogonality of the two subvarieties.

When the degree of saturation at intersection approaches one, Webster’s optimum cycle length equation becomes inapplicable, because the cycle length will becomes very big when the degree of saturation approaches one and will be fully unrealistic when the degree of saturation becomes greater than one. This is not a problem for HCM2000 method. But optimum cycle length calculation in this method h...

F. Richard Moore proposed a general model for spatial processing of sounds in 1982. [5] This model separates space in two nested areas. The outer room is an imagimary acoustic space within which the inner room (or the real performance space) is located. The inner room is denoted by the location of the speakers which simulate the sound heard in the inner room as if the speakers were “openings” c...