Reacting to Complex Threats – the Securitization in the Speeches of Anders Fogh Rasmussen based on NATO´s New Strategic Concept

The purpose of this master´s thesis is to analyze how NATO Secretary General Anders Fogh Rasmussen is trying to justify the existence of the military alliance through the use of security arguments. I am puzzled by the question: why does NATO still exist – what is NATO’s raison d'être. The New Strategic Concept (2010) forms the base for his argumentation. This thesis focuses on the security argumentation of NATO which is examined by analyzing the speeches the Secretary General. The theoretical framework of this study is based on constructivist approach to international security examining the linguistic process of securitization. Issues become securitized after Anders Fogh Rasmussen names them as threats. This thesis focuses on the securitization process relating to NATO and analyses what issues Rasmussen raises to the security agenda. Research data consists of the speeches by Anders Fogh Rasmussen. They are analyzed through J.L. Austin’s speech act taxonomy and Chaïm Perelman’s argumentation theories. The thesis will concentrate on the formulation and articulation of these threats which are considered and coined as “new threats” in contemporary international relations. I am conducting this research through the use of securitization theory. This study illustrates that the threats are constructed by NATO’s member-states in unison, but the resolutions are sounded through Rasmussen’s official speeches and transcripts. . Based on the analysis it can be concluded that Rasmussen is giving reasons for the existence of NATO. This takes place by making use of speech acts and different rhetorical techniques. The results of the analysis indicate that NATO remains an essential organization for the West and the rest of the world according to the Secretary General.

Information Technology Development Needs in Community Pharmacies : A Strategic Approach

In the context of health care, information technology (IT) has an important role in the operational infrastructure, ranging from business management to patient care. An essential part of the system is medication management in inpatient and outpatient care. Community pharmacists strategy has been to extend practice responsibilities beyond dispensing towards patient care services. Few studies have evaluated the strategic development of IT systems to support this vision. The objectives of this study were to assess and compare independent Finnish community pharmacy owners and staff pharmacists priorities concerning the content and structure of the next generation of community pharmacy IT systems, to explore international experts visions and strategic views on IT development needs in relation to services provided in community pharmacies, to identify IT innovations facilitating patient care services and to evaluate their development and implementation processes, and to assess community pharmacists readiness to adopt innovations. This study applied both qualitative and quantitative methods. A qualitative personal interview of 14 experts in community pharmacy services and related IT from eight countries and a national survey of Finnish community pharmacy owners (mail survey, response rate 53%, n=308), and of a representative sample of staff pharmacists (online survey, response rate 22%, n=373) were conducted. Finnish independent community pharmacy owners gave priority to logistical functions but also to those related to medication information and patient care. The managers and staff pharmacists have different views of the importance of IT features, reflecting their different professional duties in the community pharmacy. This indicates the need for involving different occupation groups in planning the new IT systems for community pharmacies. A majority of the international experts shared the vision of community pharmacy adopting a patient care orientation; supported by IT-based documentation, new technological solutions, access to information, and shared patient data. Community pharmacy IT innovations were rare, which is paradoxical because owners and staff pharmacists perception of their innovativeness was seen as being high. Community pharmacy IT systems development processes usually had not undergone systematic needs assessment research beforehand or evaluation after the implementation and were most often coordinated by national governments without subsequent commercialization. Specifically, community pharmacy IT developments lack research, organization, leadership and user involvement in the process. Those responsible for IT development in the community pharmacy sector should create long-term IT development strategies that are in line with community pharmacy service development strategies. This could provide systematic guidance for future projects to ensure that potential innovations are based on a sufficient understanding of pharmacy practice problems that they are intended to solve, and to encourage strong leadership in research, development of innovations so that community pharmacists potential innovativeness is used, and that professional needs and strategic priorities will be considered even if the development process is led by those outside the profession.

A functional style of programming with CSP-like communication mechanisms

This paper introduces CSP-like communication mechanisms into Backus’ Functional Programming (FP) systems extended by nondeterministic constructs. Several new functionals are used to describe nondeterminism and communication in programs. The functionals union and restriction are introduced into FP systems to develop a simple algebra of programs with nondeterminism. The behaviour of other functionals proposed in this paper are characterized by the properties of union and restriction. The axiomatic semantics of communication constructs are presented. Examples show that it is possible to reason about a communicating program by first transforming it into a non-communicating program by using the axioms of communication, and then reasoning about the resulting non-communicating version of the program. It is also shown that communicating programs can be developed from non-communicating programs given as specifications by using a transformational approach.

Strategic Sales Process Adaptation: Relationship Orientation of the Sales Process in a Business-to-Business Context

Although previous research has recognised adaptation as a central aspect in relationships, the adaptation of the sales process to the buying process has not been studied. Furthermore, the linking of relationship orientation as mindset with adaptation as a strategy and forming the means has not been elaborated upon in previous research. Adaptation in the context of relationships has mostly been studied in relationship marketing. In sales and sales management research, adaptation has been studied with reference to personal selling. This study focuses on adaptation of the sales process to strategically match it to the buyer’s mindset and buying process. The purpose of this study is to develop a framework for strategic adaptation of the seller’s sales process to match the buyer’s buying process in a business-to-business context to make sales processes more relationship oriented. In order to arrive at a holistic view of adaptation of the sales process during relationship initiation, both the seller and buyer are included in an extensive case analysed in the study. However, the selected perspective is primarily that of the seller, and the level focused on is that of the sales process. The epistemological perspective adopted is constructivism. The study is a qualitative one applying a retrospective case study, where the main sources of information are in-depth semi-structured interviews with key informants representing the counterparts at the seller and the buyer in the software development and telecommunications industries. The main theoretical contributions of this research involve targeting a new area in the crossroads of relationship marketing, sales and sales management, and buying and purchasing by studying adaptation in a business-to-business context from a new perspective. Primarily, this study contributes to research in sales and sales management with reference to relationship orientation and strategic sales process adaptation. This research fills three research gaps. Firstly, linking the relationship orientation mindset with adaptation as strategy. Secondly, extending adaptation in sales from adaptation in selling to strategic adaptation of the sales process. Thirdly, extending adaptation to include facilitation of adaptation. The approach applied in the study, systematic combining, is characterised by continuously moving back and forth between theory and empirical data. The framework that emerges, in which linking mindset with strategy with mindset and means forms a central aspect, includes three layers: purchasing portfolio, seller-buyer relationship orientation, and strategic sales process adaptation. Linking the three layers enables an analysis of where sales process adaptation can make a contribution. Furthermore, implications for managerial use are demonstrated, for example how sellers can avoid the ‘trap’ of ad-hoc adaptation. This includes involving the company, embracing the buyer’s purchasing portfolio, understanding the current position that the seller has in this portfolio, and possibly educating the buyer about advantages of adopting a relationship-oriented approach.

Promoting the European Union : Attitudinal stance adjectives in three genres of EU communication to the public

Målet för Pro Gradu-avhandlingen är att undersöka hur Europeiska unionen (EU) marknadsförs genom användningen av värderande adjektiv i tre genrer av skriftlig kommunikation från EU till medlemsstaternas medborgare. Undersökningen är inriktad på tre forskningsfrågor: hur marknadsföringen av EU syns i användningen av värderande adjektiv i de tre genrerna, vilka de centrala skillnaderna mellan de tre genrerna är gällande användningen av värderande adjektiv, samt på vilket sätt texterna uppfyller sitt kommunikativa syfte, nämligen att informera allmänheten om EU:s verksamhet och marknadsföra EU som en giltig och handlingskraftig union. Den teoretiska ramen för undersökningen grundar sig på genreanalys, kommunikationsteori och teorier om hur författarens värdering (stance) syns i texter. Skillnaden mellan genre, texttyp och register diskuteras, och teoridelen redogör även för begreppet diskurssamfund, dvs. den grupp personer som i ett yrkesmässigt eller institutionellt sammanhang producerar och använder sig av en genre enligt dess kommunikativa konventioner. Materialet behandlas även utgående från Egon Werlichs indelning av texttyper i deskriptiva, narrativa, expositära, argumentativa och instruktiva texter. Materialet består av tre delar som representerar var sin genre: informationsbroschyrer, pressmeddelanden och den Allmänna rapporten om Europeiska unionens verksamhet, som utges av EU varje år. Storleken på varje del av materialet varierar mellan 20 000 - 30 000 ord. Materialet har valts på basis av de teman texterna behandlar, och kriterierna för urvalet är bl.a. att texterna behandlar ämnen som har anknytning till medborgarnas vardag, att de är riktade till allmänheten, och att de finns tillgängliga på Internet. Undersökningen är genomförd som en kvalitativ genreanalys. Materialet analyseras först utgående från kontexten och det samhälleliga sammanhanget enligt Vijay K. Bhatias metodik för analys av obekanta genrer. Det kommunikativa syftet, författaren och den tilltänkta läsarkretsen, dvs. målgruppen för kommunikationen, fastställs. Värderande adjektiv som uttrycker författarens hållning har plockats ur texten manuellt och med hjälp av konkordansprogrammet AntConc, och placerats i 16 kategorier enligt de värden de uttrycker. Varje genre analyseras sedan språkligt med utgångspunkt i adjektivlistorna, varefter resultaten jämförs med varandra. Undersökningen visar att pressmeddelandena innehåller det största antalet värderande adjektiv, medan informationsbroschyrerna innehåller det minsta antalet värderande adjektiv. Den Allmänna rapporten om Europeiska unionens verksamhet innehåller delar med tätt förekommande värderande adjektiv, i synnerhet i stycken som behandlar mer kontroversiella ämnen. I alla tre genrer sammanfaller ett högt antal värderande adjektiv med argumentativ text, och argumentativ text förekommer främst då ämnet som diskuteras rör sig på en mer abstrakt nivå, t.ex. om EU:s värderingar och grundläggande principer, eller då texten behandlar sådan politik som delar allmänhetens uppfattning. För EU utgör alla tre genrer viktiga kanaler för kommunikationen till medlemsstaternas medborgare, och EU kan genom sitt informationsmaterial och sina officiella publikationer informera om, förklara och marknadsföra sin verksamhet på ett sätt som avser att upprätthålla och förbättra EU:s image. Utarbetandet av lämpliga texter är ändå krävande på grund av den heterogena målgruppen, och det är en utmaning i sig att få fram rätt budskap bland det stora utbudet information som finns tillgängligt på Internet.

Factors Affecting Knowledge Sharing in Strategic Alliances: The Role of Knowledge Sharing as Strategic Control Behavior among Multinational Enterprises

International strategic alliances (ISAs) have become increasingly important for the stability, growth, and long-term viability of modern business organizations. Alliance partnerships as inter-firm cooperative ventures represent an influential mechanism for asserting corporate strategic control among autonomous multinational enterprises. These different cooperative arrangements are made of equity investments or contractually-based partnerships. Different alliance forms represent different approaches that partner firms adopt to control their mutual dependence on the alliance and on other partners. Earlier research shows that the partner characteristics could provide an explanation for alliance strategic behavior and see alliances as alternative forms to markets or hierarchies for addressing specific strategic needs linked to partners’ characteristics and their subsequent strategic motives. These characteristics of the partners’ and subsequent strategic motives are analyzed as knowledge sharing factors and how these influence inter-firm control in alliances within the context of the focal-firm STMicroelectronics and its alliance partners Nokia, Ericsson and IBM. This study underline that as contracts are incomplete, they are therefore required to maintain mutual dependence based control mechanisms in addition to a contract. For example, mutual dependence based control mechanisms could be joint financial investments and the building of an ownership structure between the parties (e.g., JVs). However, the present study clarifies that subsequent inter-firm control is also exercised through inter-firm knowledge sharing. The present study contributes by presenting a dynamic interplay between competitive and cooperative rent seeking behavior. Such coopetition behavior describes the firm's strategic orientation to achieve a dynamic balance between competitive and cooperative strategies. This balance is seen in knowledge sharing based cooperation and competition behavior. Thus this study clarifies coopetition strategies by introducing the role of inter-firm cooperation and the competitive nature of knowledge sharing. Simultaneous cooperative and competitive behavior is also seen as synergetic rent-seeking behavior. Therefore, this study extends the perspective of previous studies on competitive and cooperative seeking behavior.

Optimal scheduling of a processor executing a communication protocol stack

We consider the problem of optimally scheduling a processor executing a multilayer protocol in an intelligent Network Interface Controller (NIC). In particular, we assume a typical LAN environment with class 4 transport service, a connectionless network service, and a class 1 link level protocol. We develop a queuing model for the problem. In the most general case this becomes a cyclic queuing network in which some queues have dedicated servers, and the others have a common schedulable server. We use sample path arguments and Markov decision theory to determine optimal service schedules. The optimal throughputs are compared with those obtained with simple policies. The optimal policy yields upto 25% improvement in some cases. In some other cases, the optimal policy does only slightly better than much simpler policies.

Distributed Coding for Multiple Access Communication with Side Information

In a typical sensor network scenario a goal is to monitor a spatio-temporal process through a number of inexpensive sensing nodes, the key parameter being the fidelity at which the process has to be estimated at distant locations. We study such a scenario in which multiple encoders transmit their correlated data at finite rates to a distant, common decoder over a discrete time multiple access channel under various side information assumptions. In particular, we derive an achievable rate region for this communication problem.

Chemical communication in Ropalidia marginata: Dufour's gland contains queen signal that is perceived across colonies and does not contain colony signal

Queens of the primitively eusocial wasp Ropalidia marginata appear to maintain reproductive monopoly through pheromone rather than through physical aggression. Upon queen removal, one of the workers (potential queen, PQ) becomes extremely aggressive but drops her aggression immediately upon returning the queen. If the queen is not returned, the PQ gradually drops her aggression and becomes the next queen of the colony. In a previous study, the Dufour's gland was found to be at least one source of the queen pheromone. Queen-worker classification could be done with 100% accuracy in a discriminant analysis, using the compositions of their respective Dufour's glands. In a bioassay, the PQ dropped her aggression in response to the queen's Dufour's gland macerate, suggesting that the queen's Dufour's gland contents mimicked the queen herself. In the present study, we found that the PQ also dropped her aggression in response to the macerate of a foreign queen's Dufour's gland. This suggests that the queen signal is perceived across colonies. This also suggests that the Dufour's gland in R. marginata does not contain information about nestmateship, because queens are attacked when introduced into foreign colonies, and hence PQ is not expected to reduce her aggression in response to a foreign queen's signal. The latter conclusion is especially significant because the Dufour's gland chemicals are adequate to classify individuals correctly not only on the basis of fertility status (queen versus worker) but also according to their colony membership, using discriminant analysis. This leads to the additional conclusion (and precaution) that the ability to statistically discriminate organisms using their chemical profiles does not necessarily imply that the organisms themselves can make such discrimination. (C) 2010 Elsevier Ltd. All rights reserved.

Robust Semi-Blind Estimation for Beamforming Based MIMO Wireless Communication

In this paper, we present robust semi-blind (SB) algorithms for the estimation of beamforming vectors for multiple-input multiple-output wireless communication. The transmitted symbol block is assumed to comprise of a known sequence of training (pilot) symbols followed by information bearing blind (unknown) data symbols. Analytical expressions are derived for the robust SB estimators of the MIMO receive and transmit beamforming vectors. These robust SB estimators employ a preliminary estimate obtained from the pilot symbol sequence and leverage the second-order statistical information from the blind data symbols. We employ the theory of Lagrangian duality to derive the robust estimate of the receive beamforming vector by maximizing an inner product, while constraining the channel estimate to lie in a confidence sphere centered at the initial pilot estimate. Two different schemes are then proposed for computing the robust estimate of the MIMO transmit beamforming vector. Simulation results presented in the end illustrate the superior performance of the robust SB estimators.

Coalition Formation With Communication Ranges and Moving Targets

A team of unmanned aerial vehicles (UAVs) with limited communication ranges and limited resources are deployed in a region to search and destroy stationary and moving targets. When a UAV detects a target, depending on the target resource requirement, it is tasked to form a coalition over the dynamic network formed by the UAVs. In this paper, we develop a mechanism to find potential coalition members over the network using principles from internet protocol and introduce an algorithm using Particle Swarm Optimization to generate a coalition that destroys the target is minimum time. Monte-Carlo simulations are carried out to study how coalition are formed and the effects of coalition process delays.

Distributed intrusion detection in the presence of correlated sensor readings: Signal-space and communication-complexity view-point

The problem of sensor-network-based distributed intrusion detection in the presence of clutter is considered. It is argued that sensing is best regarded as a local phenomenon in that only sensors in the immediate vicinity of an intruder are triggered. In such a setting, lack of knowledge of intruder location gives rise to correlated sensor readings. A signal-space view-point is introduced in which the noise-free sensor readings associated to intruder and clutter appear as surfaces f(s) and f(g) and the problem reduces to one of determining in distributed fashion, whether the current noisy sensor reading is best classified as intruder or clutter. Two approaches to distributed detection are pursued. In the first, a decision surface separating f(s) and f(g) is identified using Neyman-Pearson criteria. Thereafter, the individual sensor nodes interactively exchange bits to determine whether the sensor readings are on one side or the other of the decision surface. Bounds on the number of bits needed to be exchanged are derived, based on communication-complexity (CC) theory. A lower bound derived for the two-party average case CC of general functions is compared against the performance of a greedy algorithm. Extensions to the multi-party case is straightforward and is briefly discussed. The average case CC of the relevant greaterthan (CT) function is characterized within two bits. Under the second approach, each sensor node broadcasts a single bit arising from appropriate two-level quantization of its own sensor reading, keeping in mind the fusion rule to be subsequently applied at a local fusion center. The optimality of a threshold test as a quantization rule is proved under simplifying assumptions. Finally, results from a QualNet simulation of the algorithms are presented that include intruder tracking using a naive polynomial-regression algorithm. 2010 Elsevier B.V. All rights reserved.

Neural network based optimal routing algorithm for communication networks

This paper presents the capability of the neural networks as a computational tool for solving constrained optimization problem, arising in routing algorithms for the present day communication networks. The application of neural networks in the optimum routing problem, in case of packet switched computer networks, where the goal is to minimize the average delays in the communication have been addressed. The effectiveness of neural network is shown by the results of simulation of a neural design to solve the shortest path problem. Simulation model of neural network is shown to be utilized in an optimum routing algorithm known as flow deviation algorithm. It is also shown that the model will enable the routing algorithm to be implemented in real time and also to be adaptive to changes in link costs and network topology. (C) 2002 Elsevier Science Ltd. All rights reserved.

A Convex Optimization Framework for Almost Budget Balanced Allocation of a Divisible Good

We address the problem of allocating a single divisible good to a number of agents. The agents have concave valuation functions parameterized by a scalar type. The agents report only the type. The goal is to find allocatively efficient, strategy proof, nearly budget balanced mechanisms within the Groves class. Near budget balance is attained by returning as much of the received payments as rebates to agents. Two performance criteria are of interest: the maximum ratio of budget surplus to efficient surplus, and the expected budget surplus, within the class of linear rebate functions. The goal is to minimize them. Assuming that the valuation functions are known, we show that both problems reduce to convex optimization problems, where the convex constraint sets are characterized by a continuum of half-plane constraints parameterized by the vector of reported types. We then propose a randomized relaxation of these problems by sampling constraints. The relaxed problem is a linear programming problem (LP). We then identify the number of samples needed for ``near-feasibility'' of the relaxed constraint set. Under some conditions on the valuation function, we show that value of the approximate LP is close to the optimal value. Simulation results show significant improvements of our proposed method over the Vickrey-Clarke-Groves (VCG) mechanism without rebates. In the special case of indivisible goods, the mechanisms in this paper fall back to those proposed by Moulin, by Guo and Conitzer, and by Gujar and Narahari, without any need for randomization. Extension of the proposed mechanisms to situations when the valuation functions are not known to the central planner are also discussed. Note to Practitioners-Our results will be useful in all resource allocation problems that involve gathering of information privately held by strategic users, where the utilities are any concave function of the allocations, and where the resource planner is not interested in maximizing revenue, but in efficient sharing of the resource. Such situations arise quite often in fair sharing of internet resources, fair sharing of funds across departments within the same parent organization, auctioning of public goods, etc. We study methods to achieve near budget balance by first collecting payments according to the celebrated VCG mechanism, and then returning as much of the collected money as rebates. Our focus on linear rebate functions allows for easy implementation. The resulting convex optimization problem is solved via relaxation to a randomized linear programming problem, for which several efficient solvers exist. This relaxation is enabled by constraint sampling. Keeping practitioners in mind, we identify the number of samples that assures a desired level of ``near-feasibility'' with the desired confidence level. Our methodology will occasionally require subsidy from outside the system. We however demonstrate via simulation that, if the mechanism is repeated several times over independent instances, then past surplus can support the subsidy requirements. We also extend our results to situations where the strategic users' utility functions are not known to the allocating entity, a common situation in the context of internet users and other problems.