We propose broadcasting algorithms for line digraphs in the te lephone model The new protocols use a broadcasting protocol for a graph G to obtain a broadcasting protocol for the graph LG the graph obtained by applying k times the line digraph operation to G As a consequence improved bounds for the broadcasting time in De Bruijn Kautz and Wrapped Butter y digraphs are obtained

With the deployment of digital broadcasting and broadband IP (Internet protocol) networks in recent years, broadcasting services are expected to change dynamically. However, it is difficult to integrate and exploit the advantages of broadband because of the established systems for broadcasting, which reflect the business and technical requirements of the broadcasting industry. It is essential t...

In order to determine the optimum rate of Vigna sun-hum seed sowing for rangeland rehabilitation in sandy soil of North Kordofan, Sudan, two trials were conducted separately under managed and unmanaged conditions at El-obeid Agricultural Research Farm in Sheikan locality of North Kordofan State in 2015 and 2016. Seed rates were 1, 2, 3, 4 and 5 Kg/feddan (4200m) and arranged by a Completely Ran...

Biological soil crusts (BSCs) cover >35% of the Earth's land area and contribute to important ecological functions in arid and semiarid ecosystems, including erosion reduction, hydrological cycling, and nutrient cycling. Artificial rapid cultivation of BSCs can provide a novel alternative to traditional biological methods for controlling soil and water loss such as the planting of trees, shrubs...

Broadcasting can reduce the cost of video on demand services by distributing in a more efficient fashion videos that are simultaneously watched by many viewers. Rather than waiting for individual requests, broadcasting schedules repeated broadcasts of the various segments of a video ahead of time. Hence it performs best when it is used to distribute videos that are watched concurrently by hundr...

This paper investigates fault-tolerant broadcasting in star networks. We propose a non-adaptive single-port broadcasting scheme in the n-star network such that it tolerates n 2 faults in the worst case and completes the broadcasting in O(n log n) time. The existence of such a broadcasting scheme was not known before. A new technique, called di using-and-disseminating, is introduced into the sch...

SSSAJ: Volume 74: Number 3 • May–June 2010 Soil Sci. Soc. Am. J. 74:936–946 Published online 23 Feb. 2010 doi:10.2136/sssaj2009.0234 Received 24 June 2009. *Corresponding author ([email protected]). © Soil Science Society of America, 5585 Guilford Rd., Madison WI 53711 USA All rights reserved. No part of this periodical may be reproduced or transmitted in any form or by any means, electronic or ...

We consider broadcasting a message from one node to all other nodes of an asynchronous totally unlabeled network: neither nodes nor links of the network have a priori assigned labels but they know the topology of the network. Nodes can send messages of arbitrary size and we are interested in minimizing the total number of messages. Broadcasting in an n-node unlabeled network is perfect if it us...

Soil Sci. Soc. Am. J. 78:3–10 doi:10.2136/sssaj2013.07.0287dgs Received 17 July 2013. *Corresponding author ([email protected]). © Soil Science Society of America, 5585 Guilford Rd., Madison WI 53711 USA All rights reserved. No part of this periodical may be reproduced or transmitted in any form or by any means, electronic or mechanical, including photocopying, recording, or any info...