138,937 research outputs found

    Panel I: The Future of Sports Television

    Get PDF

    FCC Regulation of the Telecommunications Press

    Get PDF
    The author thinks we would not tolerate this sort of regulation in any context other than telecommunications; the First Amendment would forbid it. But somehow telecommunications speech is different and permits, many think, a different First Amendment regime. The author seeks here to raise questions about this assumption through an exploration of the justifications generally offered to support this different First Amendment regime for telecommunications speech. After exploring those justifications, the author will offer some alternative strategies for reforming telecommunications regulation in a manner which both eliminates present intrusion into protected speech and forwards the First Amendment interest of diversity of ideas

    FCC Regulation of the Telecommunications Press

    Get PDF
    StorstĂ€derna vĂ€xer och folk vill bo allt mer centralt, men det finns inte mycket yta att bygga pĂ„ ifall man inte vill offra naturomrĂ„den. En lösning Ă€r att bygga pĂ„ höjden, det vill sĂ€ga öka antalet vĂ„ningar. Det Ă€r vad denna uppsats handlar om och hur bostads- och hyresrĂ€ttsföreningar kan dra nytta av detta genom att öka sin ekonomiska vinning, samtidigt som de gör samhĂ€llet en tjĂ€nst och Ă€r med och mĂ€ttar behovet. Det denna uppsats kommer att behandla Ă€r hur ekonomin i olika föreningar Ă€ndras i samband med takpĂ„byggnad med en eller flera vĂ„ningar och hur detta skiljer sig utifrĂ„n olika tekniska lösningar. Syftet Ă€r att utifrĂ„n detta skapa en uppsats som kan gagna framtida fastigheter som övervĂ€ger att göra en sĂ„dan ombyggnation. De metoder vi kommer anvĂ€nda Ă€r granskning av dokumentation och handlingar frĂ„n olika föreningar som har genomgĂ„tt en takpĂ„byggnad av en eller flera vĂ„ningar. Dessa kommer att anvĂ€ndas för att göra utrĂ€kningar och egna analyser. Även intervjuer med styrelsemedlemmar i bostadsrĂ€ttsföreningarna och företag som utför takombyggnationer förekommer. Tekniska och juridiska krav behandlas Ă€ven om vad som generellt gĂ€ller för en takpĂ„byggnad. I slutet sĂ„ sker en analys av objekten, dĂ€r man fĂ„r se resultatet av det som undersökts. Avslutningsvis sĂ„ kommer slutsatsen som ger oss svaret att en bostadsrĂ€ttsförenings ekonomi med största sannolikhet gynnas av en ombyggnation av detta slag om möjligheten finns. De variationer som förekom var oftast lĂ€gesrelaterade och man kan se en tydlig korrelation mellan vinsten och ju mer centralt man hamnade. Slutsatsen Ă€r alltsĂ„ i sin enkelhet att om möjligheten finns sĂ„ Ă€r en vĂ„ningstakpĂ„byggnad med stor sannolikhet ett lönsamt alternativ.The big cities are growing and people want to live ever more centrally, but there is not much space to build on if you do not want to sacrifice the natural areas. One solution is to build higher, namely increasing the number of floors. That's what this essay is about and how housing and tenancy associations can take advantage of this by increasing their financial gain, while they’re doing the community a service and is with and saturates need. There we will examine is how the economies of various compounds change with a storey extension with one or more floors and how this differs from different technical solutions. The aim is that by this create an essay that will benefit future properties that are considering doing such conversions. The methods we will use is the examination of records and documents of various cases that have undergone a storey extension of one or more floors. These will be used to make the calculations and their own analyzes. Interviews with board members of housing cooperatives and companies that perform storey extensions occur. Technical and legal claims are pending, although generally applicable for a storey extension. In the end this happens, an analysis of the items, where you see the results of what has been investigated. Finally it will conclude that gives us the answer to a housing association economy most likely benefits from a reconstruction of this kind if the possibility exists. The variations that occurred were usually locational and one can see a clear correlation between the gain and the more centrally it ended. The conclusion is thus in its simplicity that if there is a possibility to do a storey extension, then it probably is a viable alternative

    Towards Optimal Distributed Node Scheduling in a Multihop Wireless Network through Local Voting

    Full text link
    In a multihop wireless network, it is crucial but challenging to schedule transmissions in an efficient and fair manner. In this paper, a novel distributed node scheduling algorithm, called Local Voting, is proposed. This algorithm tries to semi-equalize the load (defined as the ratio of the queue length over the number of allocated slots) through slot reallocation based on local information exchange. The algorithm stems from the finding that the shortest delivery time or delay is obtained when the load is semi-equalized throughout the network. In addition, we prove that, with Local Voting, the network system converges asymptotically towards the optimal scheduling. Moreover, through extensive simulations, the performance of Local Voting is further investigated in comparison with several representative scheduling algorithms from the literature. Simulation results show that the proposed algorithm achieves better performance than the other distributed algorithms in terms of average delay, maximum delay, and fairness. Despite being distributed, the performance of Local Voting is also found to be very close to a centralized algorithm that is deemed to have the optimal performance

    On Coding for Reliable Communication over Packet Networks

    Full text link
    We present a capacity-achieving coding scheme for unicast or multicast over lossy packet networks. In the scheme, intermediate nodes perform additional coding yet do not decode nor even wait for a block of packets before sending out coded packets. Rather, whenever they have a transmission opportunity, they send out coded packets formed from random linear combinations of previously received packets. All coding and decoding operations have polynomial complexity. We show that the scheme is capacity-achieving as long as packets received on a link arrive according to a process that has an average rate. Thus, packet losses on a link may exhibit correlation in time or with losses on other links. In the special case of Poisson traffic with i.i.d. losses, we give error exponents that quantify the rate of decay of the probability of error with coding delay. Our analysis of the scheme shows that it is not only capacity-achieving, but that the propagation of packets carrying "innovative" information follows the propagation of jobs through a queueing network, and therefore fluid flow models yield good approximations. We consider networks with both lossy point-to-point and broadcast links, allowing us to model both wireline and wireless packet networks.Comment: 33 pages, 6 figures; revised appendi
    • 

    corecore