<p>ABSTRACT</p><p>Climate Change in the Daily Press</p><p>An Analysis of the Representation Swedish Daily Papers Convey Through Their Editorials About the Climate Change</p><p>The purpose of this essay is partly to present how swedish daily papers describe the climate change through their editorials and partly to examine if their politcal affiliation effect their point of view about the climate change. The search incluedes editorials from 6 daily papers (Aftonbladet, Dagens Nyheter, Expressen, Göteborgstidningen, Nerikes Allehanda and Svenska Dagbladet) from the year 1997 to the year 2003. Three discourses and the order between them, found by a former analysis (Adger and others, 2001) of the international politics of climate change, are used as types of ideal in a form of an analysis of idea.</p><p>The analysis reveals that the swedish daily papers don’t give the problem any major attention. Only a total of 65 editorials about the climate change could be found even though the papers produces several thousands during the period. Most attention occurs at the years 2000 and 2001, both are years of conflicts and demands on taking up a stand in important questions. Further the analysis shows that the representation of climate change in the editorials is being in accordance with the three discourses, and it also reproduce the order between them. The majority of the daily papers, 3 papers, dominates by the manegerial discourse, the challenger, the profligacy discourse, dominate 2 papers and the denial discourse dominate only 1 paper.</p><p>When it comes to the political aspect the konservative paper is, as presumed, the one and only that dominates by the denial discourse and the social democratic paper dominates by the profligacy discourse, also as presumed. However, the liberal papers do not confirm the presumption of them all being dominated by the manegerial discourse. Three of them are, but one is dominated by the profligacy discourse. The reason is presumably the difference between traditional liberalism and neoliberalism.</p><p>Keyword: climate change, discourse, daily press, editorial, Aftonbladet, Dagens Nyheter, Expressen, Göteborgstidningen, Nerikes Allehanda, Svenska Dagbladet, the manegerial discourse, the profligacy discourse, the denial discourse.</p>

The major global concern of preventing the spread of Human Immunodeficiency Virus (HIV) requires that millions of people be tested in order to identify those individuals who need treatment and care. This study’s purpose was to examine the role of social networks in an individual’s decision to test for HIV. The study sample included 62 participants of African and Caribbean origin in Toronto, Canada. Thirty-three females and 29 males, aged 16 to 49 years who had previously tested positive or negative for HIV, participated in interviews that lasted approximately 60 minutes. Measurement instruments adapted from Silverman, Hecht, McMillin, and Chang (2008) were used to identify and delimit the social networks of the participants. The instrument identified four social network types: immediate family, extended family, friends, and acquaintances. The study examined the role of these network types on the individuals’ decisions to get HIV testing. A mixed method approach (Creswell, 2008) was applied, and both qualitative and quantitative data were collected simultaneously. Participants listed their social networks and retrospectively described the role of their network members in influencing their decision to test for HIV. The participants’ narratives of the influence of social networks in HIV testing were coded. A thematic analysis of the qualitative descriptions of the network members’ influence was performed. The quantitative and the qualitative analysis results were then tallied. The results of the study demonstrated that the influence of social networks was evident in the individuals’ decisions to test for HIV. The most influential group was friends, followed in descending order of influence by immediate family, acquaintances, and extended family. These social network ties provided informational, material, and emotional support to individuals deciding to seek HIV testing. For policy makers and health professionals, coming to a more complete understanding of these dynamics will enable them to make institutional decisions and allocate resources to improve and enhance the support available from within these social networks, thus encouraging, promoting, and leading to increased testing for HIV.

The major global concern of preventing the spread of Human Immunodeficiency Virus (HIV) requires that millions of people be tested in order to identify those individuals who need treatment and care. This study’s purpose was to examine the role of social networks in an individual’s decision to test for HIV. The study sample included 62 participants of African and Caribbean origin in Toronto, Canada. Thirty-three females and 29 males, aged 16 to 49 years who had previously tested positive or negative for HIV, participated in interviews that lasted approximately 60 minutes. Measurement instruments adapted from Silverman, Hecht, McMillin, and Chang (2008) were used to identify and delimit the social networks of the participants. The instrument identified four social network types: immediate family, extended family, friends, and acquaintances. The study examined the role of these network types on the individuals’ decisions to get HIV testing. A mixed method approach (Creswell, 2008) was applied, and both qualitative and quantitative data were collected simultaneously. Participants listed their social networks and retrospectively described the role of their network members in influencing their decision to test for HIV. The participants’ narratives of the influence of social networks in HIV testing were coded. A thematic analysis of the qualitative descriptions of the network members’ influence was performed. The quantitative and the qualitative analysis results were then tallied. The results of the study demonstrated that the influence of social networks was evident in the individuals’ decisions to test for HIV. The most influential group was friends, followed in descending order of influence by immediate family, acquaintances, and extended family. These social network ties provided informational, material, and emotional support to individuals deciding to seek HIV testing. For policy makers and health professionals, coming to a more complete understanding of these dynamics will enable them to make institutional decisions and allocate resources to improve and enhance the support available from within these social networks, thus encouraging, promoting, and leading to increased testing for HIV.

Aquesta tesi doctoral documenta els actors principals i secundaris del fenomen del revisionisme històric i del negacionisme en relació a la història de la persecució política de la llengua catalana i analitza els arguments del revisionisme des de la transició democràtica espanyola fins als nostres dies, amb especial èmfasi en la relativització de la política lingüística de la dinastia borbònica en els segles XVIII i XIX, l’edulcorament de la repressió cultural de la dictadura de Miguel Primo de Rivera i la minimització de l’intent de genocidi cultural franquista. Aquesta anàlisi del discurs revisionista finalitza amb unes conclusions que expliquen el rerefons profund d’aquest fenomen en l’actualitat. / Esta tesis doctoral documenta los actores principales y secundarios del fenómeno del revisionismo histórico y del negacionismo en relación con la historia de la persecución política de la lengua catalana y analiza los argumentos del revisionismo desde la transición democrática española hasta nuestros días, con especial énfasis en la relativización de la política lingüística de la dinastía borbónica en los siglos XVIII y XIX, el edulcoramiento de la represión cultural de la dictadura de Primo de Rivera y la minimización del intento de genocidio cultural franquista. Este análisis del discurso revisionista finaliza con unas conclusiones que explican el trasfondo profundo de este fenómeno en la actualidad. / This thesis documents the leading and supporting protagonists of the historical revisionism and denial phenomenon regarding the history of political persecution of the Catalan language and analyzes the arguments for revisionism from the transition to democracy in Spain until the present day, with special emphasis on the playing down of the language policy of the Bourbon dynasty in the eighteenth and nineteenth centuries, the easing of the cultural repression of the Miguel Primo de Rivera dictatorship and the minimization of the attempted cultural genocide of the Franco regime. This revisionist discourse analysis reaches conclusions to explain the deep background of this phenomenon.

Denial of Service and the Distributed Denial of Service Attacks have recently emerged as one of the most newsworthy, if not the greatest, weaknesses of the Internet. This paper attempt to explain how they work, why they are hard to combat today, and what will need to happen if they are to be brought under control. It is divided into eight sections. The first is an overview of the current situation and also brief explanatory of the rest of the chapters being covered. The second is a detailed description of exactly how this attack works, and why it is hard to cope with today; of necessity it includes a description of how the Internet works today. The third section is totally about the different attacks in recent years and how they affected the people or the bigorganizations. The fourth section describes the short-term prospects, the tools which are used to rectify these attacks. The fifth is problems being faced with an explanatory of the percentage of attack in recent years and comparing the problems. The sixth is what can be done today to help alleviate this problem. The seventh section describes the legal actions and also legal actions that can be followed against the attack by the victim; and the eighth section describes the long-term picture, what will change to bring this class of problem under control, if not eliminate it entirely. And finally there are some appendices: a bibliography, giving references to original research work and announcements; a brief article on securing servers; and acknowledgments for the many people who helped make this paper possible.

In this thesis, a novel anti-sensor network paradigm is introduced against wireless sensor networks (WSN). Anti-sensor network (ASN) aims to destroy application reliability by adaptively and anonymously introducing adequate level of artificial distortion into the communication of the event features transported from the sensor nodes (SN) to the sink. ASN is composed of anti-sensor nodes (aSN) randomly distributed over the sensor network field. aSNs pretend to be SNs tomaintain anonymity and so improve resiliency against attack detection and prevention mechanisms. Performance evaluations via mathematical analysis and simulation experiments show that ASN can effectively reduce the application reliability of WSN.

Denial-of-Service (DoS) attacks form a very important category of security threats that are possible in MIPv6 (Mobile Internet Protocol version 6). This thesis proposes a scheme for participants (Mobile Node, Home Agent, and Correspondent Node) in MIPv6 to recover from DoS attacks in the event of any of them being subjected to a DoS attack. We propose a threshold based scheme for participants in MIPv6 to detect presence of DoS attacks and to recover from DoS attacks in the event of any of them being subjected to a DoS attack. This is achieved using an infrastructure for MIPv6 that makes such a solution practical even in the absence of IPsec infrastructure. We propose a protocol that uses concepts like Cryptographically Generated Addresses (CGA), short-term IP addresses using a Lamport hash like mechanism and a hierarchy based trust management infrastructure for key distribution. However, reasoning about correctness of such protocols is not trivial. In addition, new solutions to mitigate attacks may need to be deployed in the network on a frequent basis as and when attacks are detected, as it is practically impossible to anticipate all attacks and provide solutions in advance. This makes it necessary to validate solutions in a timely manner before deployment in real network. However, threshold schemes needed in group protocols make analysis complex. Model checking threshold-based group protocols that employ cryptography have been not successful so far. The testing in a real network or a test bed also will not be feasible if faster and frequent deployment of DoS mitigation solutions is needed. Hence, there is a need for an approach that lies between automated/manual verification and an actual implementation. It is evident from existing literature that not many simulations for doing security analysis of MIP/MIPv6 have been done. This research is a step in that direction. We propose a simulation based approach for validation using a tool called FRAMOGR [40] that supports executable specification of group protocols that use cryptography. FRAMOGR allows one to specify attackers and track probability distributions of values or paths. This work deals with simulation of DoS attacks and their mitigation solutions for MIP in FRAMOGR. This makes validation of solutions possible without mandating a complete deployment of the protocol to detect vulnerabilities in a solution. This does away with the need for a formal theoretical verification of a DoS mitigation solution. In the course of this work, some DoS attacks and recovery mechanisms are simulated and validated using FRAMOGR. We obtained encouraging results for the performance of the detection scheme. We believe that infrastructure such as FRAMOGR would be required in future for validating new group based threshold protocols that are needed for making MIPv6 more robust.

As the Internet becomes the ubiquitous infrastructure for various applications, demands on the reliability, availability and security of routing protocols in the Internet are becoming more stringent. Unfortunately, failures are still common in the daily operation of a network. Service disruption for even a short time can seriously affect the quality of real-time applications, such as VoIP and video on demand applications. Moreover, critical business and government applications require routing protocols to be robust against malicious attacks, such as denial of Service attacks. This dissertation proposes three techniques to address some reliability and security concerns in intra-domain (distance vector) routing protocols and inter-domain (path vector) routing protocols. The first technique addresses the problem of service disruption that arises from sudden link failures in distance vector routing protocols. We consider two types of link failures: single link failures and shared risk link group failures. For single link failures, we propose an IP fast reroute mechanism to reroute packets around the failed links. This fast reroute mechanism is the first that does not require complete knowledge of the network topology and does not require changing of the original routing protocol. This mechanism proactively computes a set of relay nodes that can be used to tunnel the rerouted packets immediately after the detection of a link or node failure. The mechanism includes an algorithm for a node to automatically identify itself as a candidate relay node for a reroute link and notify the source node of the reroute link of its candidacy. The source node can then decide the validity of a candidate relay node. The mechanism also includes an algorithm to suppress redundant notification messages. We then extend our IP fast reroute mechanism for single link failures to accommodate shared risk link group failures. We achieve this goal by introducing one more bit information. Through simulations, I show that the proposed mechanisms succeed in rerouting around failed links about 100% of the time, with the length of the reroute path being comparable to the length of the re-converged shortest path. The second technique addresses the problem that arises from allowing any node to route data packets to any other node in the network (and consequently allow any adversary node to launch DoS attacks against other nodes in the network). To solve this problem, we propose a blocking option to allow a node u to block a specified set of nodes and prevent each of them from sending or forwarding packets to node u. The blocking option intends to discard violating packets near the adversary nodes that generated them rather than near their ultimate destinations. We then discuss unintentionally blocked nodes, called blind nodes and extend the routing protocols to allow each node to communicate with its blind nodes via some special nodes called joint nodes. Finally, I show, through extensive simulation, that the average number of blind nodes is close to zero when the average number of blocked nodes is small. The third technique addresses the problem that arises when a set of malicious ASes in the Internet collude to hijack an IP prefix from its legitimate owner in BGP. (Note that none of previous proposals for protecting BGP against IP prefix hijacking is effective when malicious ASes can collude.) To solve this problem, we propose an extension of BGP in which each listed AS in an advertised route supplies a certified full list of all its peers. Then I present an optimization where each AS in an advertised route supplies only a balanced peer list, that is much smaller than its full peer list. Using real Internet topology data, I demonstrate that the average, and largest, balanced peer list is 92% smaller than the corresponding full peer list. Furthermore, in order to handle the dynamics of the Internet topology, we propose algorithms on how to issue certificates to reflect the latest changes of the Internet topology graph. Although the results in this dissertation are presented in the context of distance vector and path vector routing protocols, many of these results can be extended to link state routing protocols as well. / text

If not the most, one of the serious threats to data networks, particularly pervasive commercial networks such as Voice-over-IP (VoIP) providers is Denial-of-Service (DoS) attack. Currently, majority of solutions for these attacks focus on observing detailed server state changes due to any or some of the incoming messages. This approach however requires significant amount of server’s memory and processing time. This results in detectors not being able to scale up to the network edge points that receive millions of connections (requests) per second. To solve this problem, it is desirable to design stateless detection mechanisms. One approach is to aggregate transactions into groups. This research focuses on stateless scalable DoS intrusion detection mechanisms to obviate keeping detailed state for connections while maintaining acceptable efficiency. To this end, we adopt a two-layer aggregation scheme termed Advanced Partial Completion Filters (APCF), an intrusion detection model that defends against DoS attacks without tracking state information of each individual connection. Analytical as well as simulation analysis is performed on the proposed APCF. A simulation test bed has been implemented in OMNET++ and through simulations it is observed that APCF gained notable detection rates in terms of false positive and true positive detections, as opposed to its predecessor PCF. Although further study is needed to relate APCF adjustments to a certain network situation, this research shows invaluable gain to mitigate intrusion detection from not so scalable state-full mechanisms to aggregate scalable approach.

The advent of the Internet has generated a proliferation of online information-rich environments, which provide information consumers with an unprecedented amount of freely available information. However, the openness of these environments has also made them vulnerable to a new class of attacks called Denial of Information (DoI) attacks. Attackers launch these attacks by deliberately inserting low quality information into information-rich environments to promote that information or to deny access to high quality information. These attacks directly threaten the usefulness and dependability of online information-rich environments, and as a result, an important research question is how to automatically identify and remove this low quality information from these environments. The first contribution of this thesis research is a set of techniques for automatically recognizing and countering various forms of DoI attacks in email systems. We develop a new DoI attack based on camouflaged messages, and we show that spam producers and information consumers are entrenched in a spam arms race. To break free of this arms race, we propose two solutions. One solution involves refining the statistical learning process by associating disproportionate weights to spam and legitimate features, and the other solution leverages the existence of non-textual email features (e.g., URLs) to make the classification process more resilient against attacks. The second contribution of this thesis is a framework for collecting, analyzing, and classifying examples of DoI attacks in the World Wide Web. We propose a fully automatic Web spam collection technique and use it to create the Webb Spam Corpus -- a first-of-its-kind, large-scale, and publicly available Web spam data set. Then, we perform the first large-scale characterization of Web spam using content and HTTP session analysis. Next, we present a lightweight, predictive approach to Web spam classification that relies exclusively on HTTP session information. The final contribution of this thesis research is a collection of techniques that detect and help prevent DoI attacks within social environments. First, we provide detailed descriptions for each of these attacks. Then, we propose a novel technique for capturing examples of social spam, and we use our collected data to perform the first characterization of social spammers and their behaviors.