新聞媒體在強調民意的民主政治中，扮演著不可或缺的角色。一方面，媒 體傳送民眾所需的資訊，幫助民眾形成意見與判斷；另一方面，媒體作為 公共論壇，呈現不同的聲音，展現多元的民意，並藉此牽制政府的行動。 因此，在新聞從業人員宣稱自己與群眾站在一起的同時，瞭解他們如何認 知民意，如何評估民意，毋寧是相當重要的。在此，本研究希望探討新聞 從業人員對於新聞媒體與民意關係的認知，以及他們評估民意的方法，以 期對新聞工作者有進一步的了解。本研究以國內三家電視台的新聞記者為 研究對象，進行問卷調查。結果發現，電視記者認為新聞媒體應該「反映 民意」的功能，遠比媒體「引導民意」、「匡正民意」重要。而且愈傾向 「解釋╱調查者」專業意理的電視記者，愈認為新聞媒體應該反映民意； 而愈傾向「資訊傳佈者」專業意理的電視記者，愈認為新聞媒體不應該影 響民意。在評估民意的方式上，一般而言，電視記者最常用來評估民意的 管道是報紙的新聞報導，其次分別是選舉、學者專家的意見、民意代表的 質詢或辯論，以及民意測驗、與民眾的親身接觸等等。而報紙社論則是電 視記者最不常用作評估民意的方式。至於那一種方式最能代表民意呢？資 料分析顯示，電視記者認為選舉結果最能夠代表民意，與民眾的親身接觸 也是判斷民意的很好指標。而電視新聞報導似乎不很能夠展現民意的趨向 ，報紙社論的評價則屬最低。

A wireless local area network (WLAN) provides high bandwidth to users in a limited geographical area. This network faces certain challenges and constraints that are not imposed on their wired counterparts. They are: frequency allocation, interference and reliability, security, power consumption, human safety, mobility, connection to wired LAN,service area, handoff and roaming, dynamic configuration and the throughput. But the wireless medium relies heavily on the features of MAC protocol and the MAC protocol is the core of medium access control for WLANs. The available MAC protocols all have their own merits and demerits. In our research works, we propose a hybrid MAC protocol forWLAN. In the design, we have combined the merits of the TDMA and CDMA systems to improve the throughput of the WLAN in a picocellular environment. We have used the reservation and polling methods of MAC protocols to handle both the low and high data traffics of the mobile users. We have strictly followed the standards specified by IEEE 802.11 for WLANs to implement the designed MAC protocol. We have simulated the hybrid TDMA/CDMA based MAC protocols combined with RAP (Randomly Addressed Polling) for Wireless Local Area Networks. We have developed a closed form mathematical expressions analytically for this protocol. We have also studied the power control aspects in this environment and we derived a closed form mathematical expressions analytically for this power control technique. This hybrid protocol is capable of integrating different types of traffic (like CBR,VBR and ABR services) and compiles with the requirements of next-generation systems.The lower traffic arrival is dealt with the Random Access and the higher traffic arrival is with the Polling methods. This enables us to obtain higher throughput and lowmean delay performance compared to the contention-reservation-based MAC schemes. The protocol offers the ability to integrate different types of services in a flexible way by the use of multiple slots per frame, while CDMA allows multiple users to transmit simultaneously using their own codes. The RAP uses an efficient "back-off" algorithm to improve throughput at higher arrival rates of user's data. The performance is evaluated in terms of throughput, delay, and rejection rate using computer simulation. A detailed simulation is carried out regarding the maximum number of users that each base station can support on a lossy channel. This work has analyzed the desired user's signal quality in a single cell CDMA (Code Division Multiple Access) system in the presence of MAI (Multiple Access Interference). Earlier power control techniques were designed to assure that all signals are received with equal power levels. Since these algorithms are designed for a imperfect control of power, the capacity of the system is reduced for a given BER (Bit-Error Rate). We proposed an EPCM (Efficient Power Control Mechanism) based system capacity which is designed for the reverse link (mobile to base station) considering the path loss, log-normal shadowing and Rayleigh fading. We have simulated the following applications for the further improvement of the performance of the designed MAC protocol:Designed protocol is tested under different traffic conditions. The protocol is tested for multimedia traffic under application oriented QoS requirements. Buffer Management and resource allocation. Call Admission Control (hand-offs, arrival of new users). The adaptability to the variable nature of traffic.The propagation aspects in the wireless medium. The proposed MAC protocol has been simulated and analysed by using C++/MATLAB Programming in IBM/SUN-SOLARIS UNIX environment. The results were plotted using MATLAB software. All the functions of the protocol have been tested by an analysis and also by simulation. Call admission control function of the protocol has been tested by simulation and analysis in a multimedia wireless network topology and from analysis we found that at low traffic the throughput is high and at high traffic the throughput is kept constant at a reasonable high value. The simulation results also justify/ coordinate the analysis results. Dynamic channel allocation function of the protocol was tested and analysed and the coordinated results show that at low traffic, high throughput and at high traffic the throughput is constant. Buffer management function of the protocol simulation shows the results that the packet loss can be controlled to a minimum by adjusting the buffer threshold level at any traffic conditions. Maintenance of data transfer during the hand-offs function was simulated and the results show that the blocked calls are less during low traffic and at high traffic the blocked calls can be kept constant at low value. Thus, the proposed model aimed at having high throughput, high spectral efficiency, low delay, moderate BER and moderate blocking probability. We have considered a pico cell with a maximum of several users and studied the power efficiency of combined channel coding and modulation with perfect power controlled CDMA system. Thus our simulation of the "software radio" has flexibility in choosing the proper channel coders dynamically depending upon the variations of AWGN channel.

Zugl.: Heidelberg, Universiẗat, Diss., 2006.

Thesis (MScEng)--Stellenbosch University, 2012. / ENGLISH ABSTRACT: In this thesis, the investigation into the optimization of low speed communication protocols for narrow band networks will be presented. The main focus will be on analysing commonly used low speed communication protocols and investigate an alternative to these protocols to provide an optimized low speed narrow band network that provides better performance at high and low channel utilization. A study of existing low speed communication networks within the field of water supply has been used to identify the most appropriate protocols to be included in the analysis. The analysis of each protocol discussed includes the development of a simulation and theoretical model, with parameters based on those obtained from implemented communication networks focusing on the parameters used within the Namib water supply scheme of NamWater in Namibia. Of the currently implemented contention protocols, the non-persistent Carrier Sense Multiple Access (CSMA) protocol is implemented the most. Current models used for modelling these protocols make use of various assumptions. These models have been expanded to provide a more accurate representation of the non-persistent CSMA model. The Round Robin Polling (RRP) protocol is another well known protocol used within the telemetry industry and has also been modelled as an alternative to the non-persistent CSMA model. The Adaptive Tree Walk (ATW) protocol has been identified as the limited contention protocol to be modelled as a possible alternative to the conventional methods used. A new model has been developed for modelling this protocol by making use of the same strategies and tools used in the modelling of the non-persistent CSMA and RRP protocols. The Simulation modelling has been developed by making use of DESMO-J, an Object Orientated Simulation API based in Java, developed by the Faculty of Informatics at the University of Hamburg. DESMO-J has been chosen as an alternative to the more traditional simulation languages due to its complete documentation, support structures, ease of use and flexibility. All theoretical models have been implemented in Matlab. / AFRIKAANSE OPSOMMING: In hierdie tesis sal die ondersoek na die optimering van laespoed protokolle vir kommunikasie oor nouband netwerke voorgelê word. Die hoof fokus is op die analise van algemene laespoed kommunikasie protokolle en die ondersoek van alternatiewe wat ’n meer optimale laespoed nouband netwerk sal lewer deur beter werkverigting by lae en hoë kanaalverkeer. ’n Studie van praktiese laespoed nouband netwerke in die veld van waterverspreiding word gebruik om die mees algemene protokolle te identifiseer wat in die analise ingesluit moet word. Die analise van die protokolle sluit in teoretiese en simulasie modelle, met parameters soos geidentifiseer uit die studie van ‘n praktiese netwerk, naamlik die Namib waterverspreidingskema van NamWater in Namibië. Die ’Non-persistent Carrier Sense Multiple Access’ en ’Round Robin Polling’ protokolle is geidentifiseer as dié wat meeste geimplementeer word. Die werkverigting van die protokolle is geanaliseer deur gebruik te maak van teoretiese en simulasie modeleringstegnieke. Huidige modelle van die CSMA protokol is gebaseer op sekere aannames. Hierdie aannames word aangepas en verbeter vir implementering van die teoretiese model. Die model word ook verder uitgebrei om beter resultate te lewer oor ’n groter parameterstel. Die ’Adaptive Tree Walk’ protokol is geidentifiseer as ’n moontlike optimale protokol en word gemodeleer en vergelyk teen die CSMA en RRP protokolle se werkverigting. Die simulasiemodelle is ontwikkel deur gebruik te maak van die DESMO-J sagteware, soos ontwikkel as ’n Java program-koppelvlak deur die Universiteit van Hamburg se Fakulteit van Informatika. DESMO-J is gekies as ’n alternatief vir die meer tradisionele simuleringstale omrede goeie dokumentasie, maklike gebruik en buigbaarheid. Alle teoretiese modelering is uitgevoer in Matlab.

Denna rapport behandlar push-teknik, en teknik för att skicka data i realtid inom webbapplikationer. Många gånger i dagens mer interaktiva webb kan ett behov finnas av att behandla data på ett alternativt sätt. På grund av detta kändes det valda ämnet relevant inom ramen för webbutveckling. Syftet är att undersöka hur vida denna teknik skiljer sig mot andra tekniker för att transportera data. För att kunna undersöka push-tekniken har en applikation skapats med hjälp av ett ramverk för detta ändamål. Som ramverk för arbetet valdes APE som innehåller en komplett lösning för push-teknik på webben. Som underlag för rapporten utvecklades en spelapplikation samt en utvärdering av ramverket APE och ett antal prestandatester gjordes. / This study deals with push technology, a technology to send real-time data within web applications. Many times in today's more inter-active web an alternative way of processing data may be needed. Because of this, the topic seemed relevant in the context of web development. The aim is to examine how far this technique contrasts with other techniques to transport data. To investigate the push technology an application was created using a framework for this purpose. As a framework for the exercise the APE framework, containing a complete solution for push technology on the web, was chosen. As a basis for the report a gaming application was developed and a number of performance tests as well as an evaluation of the framework APE were made.

The aim of this work is to describe and analyze the marketing mix and marketing activities of the fitness SPORT CENTRUM BUDOKAN with the emphasis on increasing its attractiveness and competitiveness, to identify possible deficiencies and to give a list of recommendations for the owner of the fitness, i.e. to make a proposal of a compact marketing strategy. Based on my own marketing analysis (positional analysis, SWOT analysis, mystery shopping, polling, observation and benchmarking), I have designed my own marketing strategy, which would lead to the established aim.

The aim of this graduate thesis is proposing an optimization of the likely voter model parameter values utilized by Median (research agency) based on secondary analysis of data from the third wave and post-election follow-up of the Czech Household Panel Study 2017 and the Median omnibus survey. The theoretical chapter presents selected aspects of the analyzed likely voter model parameters. Secondary data analysis confirms hypotheses regarding the relationships of: 1) voter turnout, prior voting behavior and the intent to vote, 2) pre-election voting preferences and actual voting behavior, 3) reported prior voting behavior and time elapsed since the prior election. Hypotheses are confirmed, and analysis results are utilized in construction of an optimized likely voter model. This model's results are then compared to the results of four currently or formerly published likely voter models (MEDIAN, CVVM2017, CVVM2018, KANTAR), all computed using an identical dataset (September/October 2017 Median omnibus survey). Based on prior-set comparison criteria, the proposed model has the highest ranking out of all the compared models. Areas of future research proposed, namely exploring the relationship between prior voting behavior misreporting and voting preference trends, in accordance with cognitive...

No description available.

This thesis is rooted in the research tradition known as coalition politics, where governments, political parties and political institutions are the central focus. The main emphasis here is on government instability and the question of why governments in modern parliamentary democracies often come to an end before the next regular election. In five distinct but interrelated papers, the thesis explores the issue of early government termination and how it is affected by public support, economic developments and the functioning of the state apparatus. The studies included in this thesis generally take a quantitative approach and make use of a dataset that contains 640 governments in 29 European democracies. Their joint goal is to improve our understanding of when early termination happens by introducing and testing new explanatory factors as well as by improving how previously identified factors are modelled. The first paper focuses on Central and Eastern Europe. It shows that the stability of governments in that region is affected by slightly different factors than those that impact on governments in Western Europe. In particular, ideological factors and political institutions are found to be less important in Central and Eastern Europe while the formal power basis of the government and the country’s economic performance matter more. In the second paper, co-authored with Professor Torbjörn Bergman, the state is brought into government stability research. The paper shows that countries with a lower quality of governance and a less efficient public sector have less stable governments. This is mainly because government parties struggle to achieve their policy goals when the state apparatus is inefficient and corrupt. Paper 3, co-written with Associate Professor Johan Hellström, looks at how different types of governments respond to economic challenges. In particular, this paper demonstrates that the same changes in economic circumstances (e.g. increases in unemployment or inflation) have different effects on cabinet stability depending on which type of government is in charge. Single party governments are better equipped to deal with economic changes, because they are better positioned to devise new policy responses without having to compromise with other parties. Coalition governments, in contrast, become significantly more likely to terminate early when the economy takes a turn for the worse. Finally, over the course of two papers I first explore new techniques for analysing polling data and then use them to empirically test whether governments sometimes choose termination as a way to cope with bad poll numbers. Most of the existing techniques for pooling polls and forecasting elections were explicitly designed with two party systems in mind. In Paper 4, I test some of these techniques to determine their usefulness in complex, multiparty systems, and I develop some improvements that enable us to take advantage of more of the information in the data. In the final paper, I combine the two themes of polling and government stability by looking at how changes in government popularity affect the likelihood of premature dissolution. I find that governments, particularly single party governments, do, in fact, use terminations as a strategic response to changes in their popularity among the public. When support is high, governments tend to opportunistically call an early election, whereas they tend to abandon or reshuffle the government when support is low.

Un des thèmes pratiques, mais hautement sensibles, est le problème de sondage dans les réseaux sociaux où le caractère secret des informations sélectionnées et la réputation de l’utilisateur sont très critiques. En effet, les utilisateurs désirent préserver la confidentialité de leurs votes et dissimuler, le cas échéant, leurs mauvais comportements. Récemment, Guerraoui et al. ont propose des protocoles de sondage basés sur la partage de secret et ne nécessitant aucune infrastructure cryptographique. Néanmoins, ces protocoles ne sont applicables que si le graphe social a une structure d’anneau et le nombre d’utilisateurs est un carré parfait. Dans cette thèse, nous traitons, d’une part, du problème du déploiement décentralisé des protocoles de sondage qui sont basés sur des graphes sociaux ayant des structures générales, et d’autre part, du problème de transformation des graphes sociaux pour augmenter les propriétés de vie privée et de précision, nécessaires au déroulement sûr et rentable du sondage décentralisé. Premièrement, nous proposons trois protocoles décentralisés qui s’appuient sur l’état originel (sans transformation) des graphes sociaux. Les deux premiers protocoles utilisent respectivement des modèles de communication synchrone et asynchrone, et manipulent des procédures de vérification pour détecter les utilisateurs malhonnêtes. Quant au troisième protocole, il est asynchrone et ne nécessite pas de procédures de vérification. Pour que ce protocole permette une diffusion efficace de messages, nous avons défini une propriété sur les graphes sociaux, appelée “m-broadcasting”. Dans la deuxième partie de la thèse, nous formalisons le problème de “l’ajout des amis” qui consiste à trouver une transformation optimale des graphes sociaux pour les adapter au partage de secret. Pour résoudre ce problème, nous présentons deux algorithmes selon deux approches différentes: centralisée et décentralisée. Une évaluation expérimentale montre que nos protocoles sont précis et restreints aux bornes théoriques / One of the current practical, useful but sensitive topic in social networks is polling problem where the privacy of exchanged information and user reputation are very critical. Indeed, users want to preserve the confidentiality of their votes and to hide, if any, their misbehaviors. Recently, Guerraoui et al. proposed polling protocols based on simple secret sharing scheme and without requiring any central authority or cryptography system. However these protocols can be deployed safely and efficiently provided that the social graph structure should be transformed into a ring structure-based overlay and the number of participating users is perfect square. In this thesis, we address the problem of deploying decentralized polling protocols for general social graphs and how to transform these graphs in order to increase the privacy and/or accuracy properties. First, we propose three simple decentralized polling protocols that rely on the current state of social graphs. The two first protocols use synchronous and asynchronous models and verification procedures to detect the misbehaving users. The third protocol is an asynchronous one that does not require any verification procedures and contains a method for efficiently broadcasting message under a family of social graphs satisfying what we call the “m-broadcasting” property. Second, we formalize the “adding friends” problem such that we can reuse the social graphs after some minimum structural modifications consisting in adding new friendship relations. We also devise algorithms for solving this problem in centralized and decentralized networks. We validate our solutions with some performance evaluations which show that our protocols are accurate, and inside the theoretical bounds