Minimizing mean client serving time and broadcast schedule cost in wireless push systems

2011 ◽  
Author(s):  
C. K. Liaskos ◽  
G. I. Papadimitriou
Keyword(s):  
Broadcast Schedule

Public Broadcasting in the Digital Age: Issues for Television in New Zealand

2005 ◽  
Vol 117 (1) ◽  
pp. 43-54
Author(s):  
Paul Norris
Keyword(s):  
New Zealand ◽  
Public Funding ◽  
Digital Age ◽  
The State ◽  
State Agency ◽  
Public Broadcasting ◽  
Unique Model ◽  
Broadcast Schedule ◽  
Combined Impact

New Zealand has a unique model of public broadcasting for television. The state broadcaster is almost totally commercial, although since 2003 it has been given a charter and some limited public funding. A state agency, NZ On Air, administers funding contestable between national broadcasters for public broadcasting, meaning in essence local (national) content in the threatened genres of drama, documentary, children's and minority programs. But this system is under challenge from the rise of multi-channel and the transition to digital. Audiences are fragmenting and the combined impact of broadband, the PVR and VOD threaten the notion of the broadcast schedule and the viability of commercial free-to-air television itself. The concluding section of this paper examines issues for the New Zealand model in adapting to the digital challenge, and looks at the criteria on which the model's success or failure may be judged.

Push and Pull Systems

2011 ◽  
pp. 1-31
Author(s):  
Petros Nicopolitidis ◽  
Georgios I. Papadimitriou ◽  
Andreas S. Pomportsis
Keyword(s):  
Broadcast Channels ◽  
Data Broadcasting ◽  
Time Period ◽  
Client Population ◽  
Information Item ◽  
Wireless Environments ◽  
Pull Systems ◽  
Broadcast Schedule ◽  
Access Patterns ◽  
Push And Pull

Data broadcasting has emerged as an efficient way for the dissemination of information over asymmetric wireless environments where the needs of the various users of the data items are usually overlapping. In such environments, data broadcasting stands to be an efficient solution since the broadcast of a single information item is likely to satisfy a possibly large number of users. Communications asymmetry is due to a number of facts, the most important being equipment, network, and application asymmetry. This chapter starts with a discussion of preliminary issues and terminology for asymmetric environments for data broadcasting. The chapter then discusses broadcast schedule construction for systems employing a single broadcast channel, schedule construction for systems employing multiple broadcast channels, and schedule construction for systems that take into account the effect of reception errors. It then presents an algorithm that tries to provide better support for clients whose access patterns deviate a lot form the overall access pattern of the client population. It also presents algorithms for environments where item requests by clients are dropped if not served in a certain time period. Brief comments on issues that affect performance of the discussed data broadcasting methods are also made.

The Other Format Wars: Cartridges, Cassettes, and Making Home Work

2019 ◽  
pp. 127-163
Author(s):  
Kit Hughes
Keyword(s):  
Case Studies ◽  
Management Strategy ◽  
The Other ◽  
Corporate Communications ◽  
Home Work ◽  
Broadcast Schedule ◽  
Key Terms

Chapter 4 (keyword: time-shifting) outlines industrial users’ contributions to the development of videocassettes before “the” format wars between VHS and Betamax. It argues that the key terms for cassettes were not simply “Whatever. Whenever,” but “Whenever. Whomever. Wherever.” Rather than promise freedom from the broadcast schedule, this triadic promise of flexibility responded to industrial concerns with employee management in an era when the temporal demands on worker time were becoming more complex (whenever), when workforces were becoming more diverse (whomever), and when companies were growing more expansive (wherever). Tracing the pursuit of whenever-whomever-wherever as a management strategy through a series of three case studies—8mm cartridge projectors (1961–1970s), CBS’s EVR (1960–1971), and Sony’s U-matic (1961–1980s)—this chapter also reveals how businesses drew on workers’ pleasurable associations with domestic television and transformed the home into an exhibition site for corporate communications—in both instances, intensifying claims to employees’ nonworking time.

scholarly journals Implementasi Algoritma Genetika Dalam Penjadwalan Jeda Iklan Pada Stasiun Radio 99.1 Most FM

2020 ◽  
Vol 2 (2) ◽  
pp. 99-108
Author(s):  
Mutiah Mutiah ◽  
Efori Buulolo ◽  
Natalia Silalahi
Keyword(s):  
Radio Station ◽  
Prime Time ◽  
Radio Stations ◽  
Regular Time ◽  
Fitness Value ◽  
The Hours ◽  
Commercial Radio ◽  
Broadcast Schedule ◽  
Radio Broadcast ◽  
Crossover And Mutation

The screening of advertisements on a commercial radio station is done every day from Sunday to Saturday. In commercial radio stations, in general, making ad schedules is still manually which results in delays in the presentation of the weekly ad schedule. Playback time consists of two types, namely prime time and regular time. Radio Ad Scheduling that will be discussed in this study is the ad screening that is carried out on the radio broadcast schedule, which is between 5 am to 24 pm in which with the rules every 15 minutes are provided 3 ad playback slots with a maximum duration of 1 minute per ad. So if the radio broadcast time per day is 19 hours, then the maximum number of ads per day that can be displayed is 76 ads. Another rule is the implementation of prime time, the hours at which the general public (listeners) have the greatest opportunity to listen to the radio, which is between 6:00 and 10:00 in the morning and 16: 00-20: 00 at night. The number of screenings of the same advertisement on one day is limited to prime time which is 5 times, while for regular time is 8 times. The radio scheduling process is carried out using genetic algorithms consisting of chromosome initialization, selection, crossover and mutation processes. The chromosomes in this study consist of 3 genes, each chromosome will be evaluated based on its fitness value which is calculated based on the number of violations of rules that occur on each chromosome in an individual. Where rule 1 is the number of plays per advertisement that cannot be more than 5 times in a day and rule 2 is that there cannot be two or more ad scheduling shows on the same day and time. After that the fitness value of each chromosome is obtained, then the selection, crossover and mutation are carried out. From this research an optimal ad schedule is produced by scheduling overall ad data, day and time of ad playback

scholarly journals A Scheduling Method to Reduce Waiting Time for Close-Range Broadcasting

2012 ◽  
Vol 8 (4) ◽  
pp. 303-314 ◽  
Author(s):  
Yusuke Gotoh ◽  
Tomoki Yoshihisa ◽  
Hideo Taniguchi ◽  
Masanori Kanazawa ◽  
Wenny Rahayu ◽  
...  
Keyword(s):  
Waiting Time ◽  
Continuous Media ◽  
Main Program ◽  
Available Bandwidth ◽  
Scheduling Method ◽  
Close Range ◽  
Digital Broadcasting ◽  
Broadcast Schedule ◽  
Media Data ◽  
Continuous Media Data

Due to the recent popularization of digital broadcasting systems, close-range broadcasting using continuous media data, i.e. audio and video, has attracted great attention. For example, in a drama, after a user watches interesting content such as a highlight scene, he/she will watch the main program continuously. In close-range broadcasting, the necessary bandwidth for continuously playing the two types of data increases. Conventional methods reduce the necessary bandwidth by producing an effective broadcast schedule for continuous media data. However, these methods do not consider the broadcast schedule for two types of continuous media data. When the server schedules two types of continuous media data, waiting time that occurs from finishing the highlight scene to starting the main scene, may increase. In this paper, we propose a scheduling method to reduce the waiting time for close-range broadcasting. In our proposed method, by dividing two types of data and producing an effective broadcast schedule considering the available bandwidth, we can reduce the waiting time.

scholarly journals An Efficient Algorithm to Find Broadcast Schedule in Ad Hoc TDMA Networks

2008 ◽  
Vol 2008 ◽  
pp. 1-10 ◽  
Author(s):  
Imtiaz Ahmad ◽  
Buthaina Al-Kazemi ◽  
A. Shoba Das
Keyword(s):  
Network Performance ◽  
Ad Hoc ◽  
Heuristic Algorithms ◽  
Solution Space ◽  
Search Space ◽  
Minimum Length ◽  
Scheduling Problem ◽  
Broadcast Scheduling ◽  
Practical Concern ◽  
Broadcast Schedule

The broadcast scheduling is of fundamental importance and practical concern for ad hoc network performance measures such as the communication delay and the throughput. The scheduling problem on hand involves determination of a collision-free broadcast schedule with the minimum length TDMA frame and the maximum slot utilization by efficient distribution of slots among stations. The problem is widely known as NP-complete, and diverse heuristic algorithms were reported to solve this problem recently. The intractable nature of the broadcast scheduling problem and its importance in ad hoc TDMA networks necessitates development of more efficient heuristic algorithms. In this paper, we developed a new heuristic approach which employs a tight lower bound derived from the maximal incompatibles and generates a search space from the set of maximal compatibles. The developed algorithm is very efficient and effective in conquering the intractable nature of the broadcast scheduling problem in the sense that it explores complex solution space in smaller CPU time. A comparison with existing techniques for the test examples reported in the literature shows that our algorithm achieves a collision-free broadcast with minimum frame length and the maximum slot utilization in relatively shorter time.

The Conscience of the King Or: Is There in Truth No Sex and Violence?

2020 ◽  
pp. 61-80
Author(s):  
John Andreas Fuchs
Keyword(s):  
Star Trek ◽  
The Other ◽  
Vital Part ◽  
Feature Films ◽  
Positive Message ◽  
Broadcast Schedule

This chapter explores the different depictions of sex, violence and swearing throughout the Star Trek franchise and argues that complaints about sex and violence in Star Trek, then, are nothing new; even the original Star Trek series seemed inappropriate in its day. In 1984, the BBC removed the episodes “The Empath,” “Whom Gods Destroy,” “Plato’s Stepchildren,” and “Miri” from the broadcast schedule for over ten years due to showing subjects of “madness, torture, sadism and disease.” One of the underlying reasons for this decision was that Star Trek was seen as a TV series for children, which it clearly was not. Seen in the context of the zeitgeist, the newest addition to the franchise, Star Trek: Discovery is not any more violent, gory, or even vulgar than any of the other series or feature films. Sex and violence have always been an integral part of Star Trek’s storytelling and are a vital part of showing its positive message of humanity’s future.

Sign in / Sign up

Export Citation Format

Share Document