The neo-liberal state and the crisis of public service broadcasting in the Anglo-American democracies /

The NeO'liberal State and the Crisis ofPublic Service Broadcasting in the Anglo-American Democracies The purpose ofthis analysis ofthe present condition ofpublic service broadcasting in the Anglo- American democracies was to investigate whether such media can still be regarded as the primarypublic spherefor a dialogue between each nation 's civil society and the State. The motivationfor this thesis was based on a presumption that such fora for public discussion on the central issues of each society have become viewed as less relevant bypoliticians andpolicy-makers and thepublics they were intended to serve in the Anglo-American democracies over thepast two decades. It is speculated that this is the case because ofa beliefthat the post-war consensus between the respective States andpublics that led to the construction of the Keynesian Welfare State and the notion ofpublic service broadcasting has been displaced by an individualistic, neo-liberal, laissez-faire ideology. In other words, broadcasting as a consumer-oriented, commercial commodity has superseded concerns pertaining to the importance ofthe public interest. The methodology employed in this thesis is a comparative analysisfrom a criticalpolitical economy perspective. It was considered appropriate to focus on the United Kingdom, Australia, Canada and the\ United States because they comprise the four largest Anglo-American nations with democratic political systems andprimarily market economies. Justificationfor this particular sample is reinforced by thefact that case study countries also share a common socio-political and economic tradition. The evidence assembledfor this thesis consisted almost exclusively ofexisting literature on the subjects ofpublic service broadcasting, global economic andpolitical integration, and the ascendance ofthe 'free-market ' ethos in Western democracies since the late mid- to late-1970s. In essence, this thesis could be considered as a reinterpretation ofthe existing literature relevant to these issues. Several important common features werefound among the political, economic and broadcasting systems of the four case study nations. It is proposed that the prevalence of the neo-liberal world view throughout the political and policy environments of the four countries has undermined the stability and credibility of each nation 's national public service broadcasting organization, although with varying intensity and effect,. Deregulation ofeach nation 's broadcasting system and the supremacy ofthe notion of 'consumer sovereignty' have marginalized the view of broadcasting on any basis other than strictly economic criteria in thefour case study countries. This thesis concludes that,for a reconstruction ofa trulyparticipatory anddemocraticpublicsphere to be realized in the present as well as thefuture, a reassessment ofthe conventional concept ofthe 'public sphere ' is necessary. Therefore, it is recommended that thefocus ofpolicy-makers in each Anglo-American democracy be redirectedfrom that which conceived ofan all-encompassing, large, state-ownedand operated public broadcasting service toward a view which considers alternativeforms ofpublic communication, such as local community and ethnic broadcasting operations, that are likely to be more responsive to the needs of the increasingly diverse and heterogeneous populations that comprise the modem Anglo-American democracies. The traditional conception of public broadcasters must change in accordance with its contemporary environment if the fundamental principles of the public sphere and public service broadcasting are to be realized.

Letter - Canadian Broadcasting Corporation to Mrs. E.F. McCordick, 1940

A letter from special events representative, T.O. Wiklund of the CBC. It is a response to a letter sent by Mrs. E.F. McCordick in regards to a hockey game that was not broadcast. The letter details the situation of the CBC and the BBC during the war and the unreliable transmission for special events like the hockey game. The letter is dated February 26, 1940.

The influence of physical attractiveness and gender on perceived competence of sportscasters

The media tends to represent female athletes as women first and athletes second (Koivula, 1 999). The present study investigated whether this same trend was present for female sportscasters, using a self-presentational framework. Self-presentation is the process by which people try to control how others see them (Leary, 1995). One factor that may influence the type of image they try to project is their roles held in society, including gender roles. The gender roles for a man include dominance, assertiveness, and masculinity, while the gender roles for a woman include nurturer, femininity, and attractiveness (Deaux & Major, 1 987). By contrast, sports broadcasters are expected to be knowledgeable, assertive, and competent. Research suggests that female sports broadcasters are seen as less competent and less persuasive than male sports broadcasters (Mitrook & Dorr, 2001; Ordman & Zillmann, 1994, Toro, 2005). One reason for this difference may be that the gender roles for a man are much more similar to those of a sportscaster, compared to those of a woman. Thus, there may be a conflict between the two roles for women. The present study investigated whether the gender and perceived attractiveness of sportscasters influenced the audience's perceptions of the level of competence that a sportscaster demonstrates. Two hundred and four male (n =75) and female (n =129) undergraduate students were recruited from a southern Ontario university to participate in the study. The average age of the male participants was 21 .23 years {SD =1 .60), and the average age for female participants was 20.67 years {SD = 1 .31). The age range for all participants was from 19 to 30 years {M = 20.87 years, SD = 1 .45). Af^er providing informed consent, participants randomly received one of four possible questionnaire packages. The participants answered the demographic questionnaire, and then proceeded to view the picture and read the script of a sports newscast. Next, based on the picture and script, the participants answered the competence questionnaire, assessing the general, sport specific, and overall competence of the sportscaster. Once participants had finished, they returned the package to the researcher and were thanked for their time. Data was analyzed using an ANOVA to determine if general sport competence differs with respect to gender and attractiveness of the sportscaster. Overall, the ANOVA was non-significant (p > .05), indicating no differences on the dependent variable based on gender (F (3, 194) = .631, p = .426), attractiveness (F (3, 194) = .070, p = .791), or the interaction of the two {F (3, 194) = .043,/? = .836). Although none of the study hypotheses were supported, the study provided some insight to the perceived competence of female sportscasters. It is possible that female sportscasters are now seen as competent in the area of sports. Sample characteristics could also have influenced these results; the participants in the current study were primarily physical education and kinesiology students, who had experience participating in physical activity with both men and women. Future research should investigate this issue further by using a video sportscast. It is possible that delivery characteristics such as voice quality or eye contact may also impact perceptions of sportscasters.

Properties and algorithms of the (n, k)-arrangement graphs

The (n, k)-arrangement interconnection topology was first introduced in 1992. The (n, k )-arrangement graph is a class of generalized star graphs. Compared with the well known n-star, the (n, k )-arrangement graph is more flexible in degree and diameter. However, there are few algorithms designed for the (n, k)-arrangement graph up to present. In this thesis, we will focus on finding graph theoretical properties of the (n, k)- arrangement graph and developing parallel algorithms that run on this network. The topological properties of the arrangement graph are first studied. They include the cyclic properties. We then study the problems of communication: broadcasting and routing. Embedding problems are also studied later on. These are very useful to develop efficient algorithms on this network. We then study the (n, k )-arrangement network from the algorithmic point of view. Specifically, we will investigate both fundamental and application algorithms such as prefix sums computation, sorting, merging and basic geometry computation: finding convex hull on the (n, k )-arrangement graph. A literature review of the state-of-the-art in relation to the (n, k)-arrangement network is also provided, as well as some open problems in this area.

Properties and algorithms of the hyper-star graph and its related graphs

The hyper-star interconnection network was proposed in 2002 to overcome the drawbacks of the hypercube and its variations concerning the network cost, which is defined by the product of the degree and the diameter. Some properties of the graph such as connectivity, symmetry properties, embedding properties have been studied by other researchers, routing and broadcasting algorithms have also been designed. This thesis studies the hyper-star graph from both the topological and algorithmic point of view. For the topological properties, we try to establish relationships between hyper-star graphs with other known graphs. We also give a formal equation for the surface area of the graph. Another topological property we are interested in is the Hamiltonicity problem of this graph. For the algorithms, we design an all-port broadcasting algorithm and a single-port neighbourhood broadcasting algorithm for the regular form of the hyper-star graphs. These algorithms are both optimal time-wise. Furthermore, we prove that the folded hyper-star, a variation of the hyper-star, to be maixmally fault-tolerant.

John W. Fisher Fonds, 1937-1961, 1964-1989, 1993, n.d.

Norah and Fred Fisher welcomed John Fisher into the world on November 29, 1912, not knowing what an influential role he would play in shaping Canada's history. John Fisher grew up as the middle child of five brothers and sisters in Frosty Hollow, New Brunswick, close to today’s town of Sackville. Sackville’s main industry was the Enterprise Foundry which the Fisher family owned and operated; however, Fisher had no plans of going into the family business. He was more inspired by his maternal grandfather, Dr. Cecil Wiggins, who lived with the family after retiring from the Anglican ministry. Wiggins encouraged all his grandchildren to be well read and to take part in discussions on current events. There were often visitors in the Fisher household taking part in discussions about politics, religion, and daily life. Fisher forced himself to take part in these conversations to help overcome his shyness in social settings. These conversations did help with his shyness and also in forming many opinions and observations about Canada. It put Fisher on the road to becoming Mr. Canada and delivering the many eloquent speeches for which he was known. Fisher did not venture far from home to complete his first degree. In 1934 he graduated from Mount Allison University in Sackville, NB with an Arts degree. The same year Fisher enrolled in Dalhousie’s law school. During his time at Dalhousie, Fisher discovered radio through Hugh Mills. Mills or “Uncle Mel” was on CHNS, Halifax’s only radio station at the time. Fisher began by making appearences on the radio drama show. By 1941 he had begun writing and broadcasting his own works and joined the staff as an announcer and continuity writer. In 1936 the Canadian Broadcasting Corporation was formed, the first National radio station. Fisher joined the CBC shortly after it’s beginning and remained with them, as well as the Halifax Herald newspaper, even after his law school graduation in 1937. By 1943 Fisher’s talks became a part of the CBC’s programming for a group of maritime radio stations. Fisher once described his talks as follows “my talks weren’t meant to be objective. . . they were meant to be favourable. They were ‘pride builders’” He began his famed John Fisher Reports at CBC Toronto when he transfered there shortly after the war. This program brought emmence pride to the fellow Canadians he spoke about leading to approximately 3500 requests per year to speak at banquets and meeting throughout Canada and the United States. Fisher was a well travelled indivdual who would draw on personal experiences to connect with his audience. His stories were told in simple, straight forward language for anyone to enjoy. He became a smooth, dynamic and passionate speaker who sold Canada to Canadians. He became a renowned journalist, folk historian, writer and broadcaster. Fisher was able to reach a vast array of people through his radio work and build Canadian pride, but he did not stop there. Other ways Fisher has contributed to Canada and the Canadian people include: Honoured by five Canadian Universities. 1956, became the Director of the Canadian Tourist Association. 1961, was appointed Special Assistant to the Prime Minister of Canada. 1963, Commissioner of the Centennial Commission (the Federal Agency Responsible for Canada’s 100th birthday) 1968, received the Service Medal , a coveted Order of Canada. President of John Fisher Enterprises Ltd., private consultant work, specializing in Centennial planning, broadcasts, lectures and promotion. John Fisher continued recording radio broadcasts even after his diagnosis with cancer. He would record 3 or 4 at a time so he was free to travel across Canada, the U.S., Europe and Mexico in search of treatments. Fisher passed away from the disease on February 15, 1981 and he is buried at Mount Pleasant Cemetery in Toronto.

Properties and Algorithms of the KCube Graphs

The KCube interconnection topology was rst introduced in 2010. The KCube graph is a compound graph of a Kautz digraph and hypercubes. Compared with the at- tractive Kautz digraph and well known hypercube graph, the KCube graph could accommodate as many nodes as possible for a given indegree (and outdegree) and the diameter of interconnection networks. However, there are few algorithms designed for the KCube graph. In this thesis, we will concentrate on nding graph theoretical properties of the KCube graph and designing parallel algorithms that run on this network. We will explore several topological properties, such as bipartiteness, Hamiltonianicity, and symmetry property. These properties for the KCube graph are very useful to develop efficient algorithms on this network. We will then study the KCube network from the algorithmic point of view, and will give an improved routing algorithm. In addition, we will present two optimal broadcasting algorithms. They are fundamental algorithms to many applications. A literature review of the state of the art network designs in relation to the KCube network as well as some open problems in this field will also be given.

Properties and Algorithms of the KCube Interconnection Networks

The KCube interconnection network was first introduced in 2010 in order to exploit the good characteristics of two well-known interconnection networks, the hypercube and the Kautz graph. KCube links up multiple processors in a communication network with high density for a fixed degree. Since the KCube network is newly proposed, much study is required to demonstrate its potential properties and algorithms that can be designed to solve parallel computation problems. In this thesis we introduce a new methodology to construct the KCube graph. Also, with regard to this new approach, we will prove its Hamiltonicity in the general KC(m; k). Moreover, we will find its connectivity followed by an optimal broadcasting scheme in which a source node containing a message is to communicate it with all other processors. In addition to KCube networks, we have studied a version of the routing problem in the traditional hypercube, investigating this problem: whether there exists a shortest path in a Qn between two nodes 0n and 1n, when the network is experiencing failed components. We first conditionally discuss this problem when there is a constraint on the number of faulty nodes, and subsequently introduce an algorithm to tackle the problem without restrictions on the number of nodes.