many appealing multicast services such as on-demand tv, teleconference, online games and etc. can benefit from high available bandwidth in multi-radio multi-channel wireless mesh networks. when multiple simultaneous transmissions use a similar channel to transmit data packets, network performance degrades to a large extant. designing a good multicast tree to route data packets could enhance the...

Current day wireless technologies, such as 802.11a, support multiple non-overlapping channels. Multiple channels can be potentially used to increase network capacity by simultaneously communicating across different channels. In infrastructure based networks, multiple channels have been utilized by placing adjacent access points on different channels, thereby promoting simultaneous use of the ch...

Given a finite point set X in the plane, the degree of a pair {x, y} ⊂ X is the number of empty triangles t = conv{x, y, z}, where empty means t∩X = {x, y, z}. Define degX as the maximal degree of a pair in X. Our main result is that if X is a random sample of n independent and uniform points from a fixed convex body, then degX ≥ cn/ lnn in expectation.

Government support for industrial firms can come in many different forms and through a range of channels, varying complexity. A particularly challenging form is energy inputs offered to producers at below-market prices. To improve understanding about the scope scale such support, this report examines an illustrative sample 33 companies their subsidiaries operating energy-intensive industries, n...

Previous ultra-dependable real-time computing archi-tectures have been specialised to meet the requirements of a particular application domain. Over the last two years, a consortium of European companies and academic institutions has been investigating the design and development of a Generic Upgrad-able Architecture for Real-time Dependable Systems (GUARDS). The architecture aims to be tolerant...

It is well-known that every planar or projective planar graph can be 3-colored so that each color class induces a forest. This bound is sharp. In this paper, we show that there are in fact exponentially many 3-colorings of this kind for any (projective) planar graph. The same result holds in the setting of 3-list-colorings.

A k_n Latin rectangle is a k_n matrix of entries from [1, 2, ..., n] such that no symbol occurs twice in any row or column. An intercalate is a 2_2 Latin subrectangle. Let N(R) be the number of intercalates in R, a randomly chosen k_n Latin rectangle. We obtain a number of results about the distribution of N(R) including its asymptotic expectation and a bound on the probability that N(R)=0. For...

Within large taxonomic assemblages, the number of species with adult body mass M is characterized by a broad but asymmetric distribution, with the largest mass being orders of magnitude larger than the typical mass. This canonical shape can be explained by cladogenetic diffusion that is bounded below by a hard limit on viable species mass and above by extinction risks that increase weakly with ...