Secrecy Capacity Analysis Over κ–μ Fading Channels: Theory and Applications

In this paper, we consider the transmission of confidential information over a κ-μ fading channel in the presence of an eavesdropper who also experiences κ-μ fading. In particular, we obtain novel analytical solutions for the probability of strictly positive secrecy capacity (SPSC) and a lower bound of secure outage probability (SOPL) for independent and non-identically distributed channel coefficients without parameter constraints. We also provide a closed-form expression for the probability of SPSC when the μ parameter is assumed to take positive integer values. Monte-Carlo simulations are performed to verify the derived results. The versatility of the κ-μ fading model means that the results presented in this paper can be used to determine the probability of SPSC and SOPL for a large number of other fading scenarios, such as Rayleigh, Rice (Nakagamin), Nakagami-m, One-Sided Gaussian, and mixtures of these common fading models. In addition, due to the duality of the analysis of secrecy capacity and co-channel interference (CCI), the results presented here will have immediate applicability in the analysis of outage probability in wireless systems affected by CCI and background noise (BN). To demonstrate the efficacy of the novel formulations proposed here, we use the derived equations to provide a useful insight into the probability of SPSC and SOPL for a range of emerging wireless applications, such as cellular device-to-device, peer-to-peer, vehicle-to-vehicle, and body centric communications using data obtained from real channel measurements.

Kelvin-Helmholtz instability in solar chromospheric jets: theory and observation

Using data obtained by the high-resolution CRisp Imaging SpectroPolarimeter instrument on the Swedish 1 m Solar Telescope, we investigate the dynamics and stability of quiet-Sun chromospheric jets observed at the disk center. Small-scale features, such as rapid redshifted and blueshifted excursions, appearing as high-peed jets in the wings of the Hα line, are characterized by short lifetimes and rapid fading without any descending behavior. To study the theoretical aspects of their stability without considering their formation mechanism, we model chromospheric jets as twisted magnetic flux tubes moving along their axis, and use the ideal linear incompressible magnetohydrodynamic approximation to derive the governing dispersion equation. Analytical solutions of the dispersion equation indicate that this type of jet is unstable to Kelvin–Helmholtz instability (KHI), with a very short (few seconds) instability growth time at high upflow speeds. The generated vortices and unresolved turbulent flows associated with the KHI could be observed as a broadening of chromospheric spectral lines. Analysis of the Hα line profiles shows that the detected structures have enhanced line widths with respect to the background. We also investigate the stability of a larger-scale Hα jet that was ejected along the line of sight. Vortex-like features, rapidly developing around the jet’s boundary, are considered as evidence of the KHI. The analysis of the energy equation in the partially ionized plasma shows that ion–neutral collisions may lead to fast heating of the KH vortices over timescales comparable to the lifetime of chromospheric jets.

Social Theory and Nursing

Despite noteworthy exceptions, nursing’s literature largely disregards the ways in which social and sociological theory permeates, guides and shapes research, education, and practice. Likewise, social theory’s ability to position nursing within wider structures of healthcare and educational provision is similarly and puzzlingly downplayed. The questions nurses ask and the problems they face cannot however, adequately be addressed without engaging with social and sociological theory and, to progress this engagement, contributors to this book explore how social theories are used by and might apply to nursing and nursing practice. This work brings together leading international nursing and non-nursing scholars to stimulate thought and debate around a fascinating and enduring topic.

Commercial and Industrial Network Improvement and Programming Policy, Summary, 1991

The Commercial and Industrial Network improvement and programming policy reflected in this summary report was adopted for use in future highway programming by the Transportation Commission on November 5, 1991. The Iowa Department of Transportation, as directed by the Legislature, has established a 2,331-mile network of commercial and industrial highways and is directing a significant amount of primary construction funding resources toward improvements to this network. This summary outlines the technical needs assessment for improvements on the Commercial and Industrial Network for the next 20-year period. The portions of the network which require four-lane capacity, as well as major improvements to the two-lane sections, are graphically displayed. Detailed improvement needs and costs are listed in tabular form for the first two five-year periods (1992-1996 and 1997-2001). It is essential to note that these improvement needs are the result of a technical assessment and do not imply any funding commitment.

Solar coronal jets: observations, theory, and modeling

Coronal jets represent important manifestations of ubiquitous solar transients, which may be the source of significant mass and energy input to the upper solar atmosphere and the solar wind. While the energy involved in a jet-like event is smaller than that of “nominal” solar flares and coronal mass ejections (CMEs), jets share many common properties with these phenomena, in particular, the explosive magnetically driven dynamics. Studies of jets could, therefore, provide critical insight for understanding the larger, more complex drivers of the solar activity. On the other side of the size-spectrum, the study of jets could also supply important clues on the physics of transients close or at the limit of the current spatial resolution such as spicules. Furthermore, jet phenomena may hint to basic process for heating the corona and accelerating the solar wind; consequently their study gives us the opportunity to attack a broad range of solar-heliospheric problems.

Drones y el orden legal internacional. Tecnología, estrategia y largas cadenas de acción

The main thesis of this article is that the increasing recourse to the use of unmanned aerial systems in asymmetric warfare and the beginning routinization of U.S. drone operations represent part of an evolutionary change in the spatial ordering of global politics -- Using a heuristic framework based on actor-network theory, it is argued that practices of panoptic observation and selective airstrikes, being in need of legal justification, contribute to a reterritorialization of asymmetric conflicts -- Under a new normative spatial regime, a legal condition of state immaturity is constructed, which establishes a zone of conditional sovereignty subject to transnational aerial policing -- At the same time, this process is neither a deterministic result of the new technology nor a deliberate effect of policies to which drones are merely neutral instruments -- Rather, military technology and political decisions both form part of a long chain of action which has evolved under the specific circumstances of recent military interventions

The Danger Theory and Its Application to Artificial Immune Systems

Over the last decade, a new idea challenging the classical self-non-self viewpoint has become popular amongst immunologists. It is called the Danger Theory. In this conceptual paper, we look at this theory from the perspective of Artificial Immune System practitioners. An overview of the Danger Theory is presented with particular emphasis on analogies in the Artificial Immune Systems world. A number of potential application areas are then used to provide a framing for a critical assessment of the concept, and its relevance for Artificial Immune Systems.

The Idiosyncratic Body: Contemporary Clown Theory and Practice

Drawing on historical research, personal interviews, performance analysis, and my own embodied experience as a participant-observer in several clown workshops, I explore the diverse historical influences on clown theatre as it is conceived today. I then investigate how the concept of embodied knowledge is reflected in red-nose clown pedagogy. Finally, I argue that through shared embodied knowledge spectators are able to perceive and appreciate the humor of clown theatre in performance. I propose that clown theatre represents a reaction to the eroding personal connections prompted by the so-called information age, and that humor in clown theatre is a revealing index of socio-cultural values, attitudes, dispositions, and concerns.

Ionospheric Turbulence Near the Upper Hybrid Layer: Theory and Experiment

The thesis presents experimental results, simulations, and theory on turbulence excited in magnetized plasmas near the ionosphere’s upper hybrid layer. The results include: The first experimental observations of super small striations (SSS) excited by the High-Frequency Auroral Research Project (HAARP) The first detection of high-frequency (HF) waves from the HAARP transmitter over a distance of 16x10^3 km The first simulations indicating that upper hybrid (UH) turbulence excites electron Bernstein waves associated with all nearby gyroharmonics Simulation results that indicate that the resulting bulk electron heating near the upper hybrid (UH) resonance is caused primarily by electron Bernstein waves parametrically excited near the first gyroharmonic. On the experimental side we present two sets of experiments performed at the HAARP heating facility in Alaska. In the first set of experiments, we present the first detection of super-small (cm scale) striations (SSS) at the HAARP facility. We detected density structures smaller than 30 cm for the first time through a combination of satellite and ground based measurements. In the second set of experiments, we present the results of a novel diagnostic implemented by the Ukrainian Antarctic Station (UAS) in Verdansky. The technique allowed the detection of the HAARP signal at a distance of nearly 16 Mm, and established that the HAARP signal was injected into the ionospheric waveguide by direct scattering off of dekameter-scale density structures induced by the heater. On the theoretical side, we present results of Vlasov simulations near the upper hybrid layer. These results are consistent with the bulk heating required by previous work on the theory of the formation of descending artificial ionospheric layers (DIALs), and with the new observations of DIALs at HAARP’s upgraded effective radiated power (ERP). The simulations that frequency sweeps, and demonstrate that the heating changes from a bulk heating between gyroharmonics, to a tail acceleration as the pump frequency is swept through the fourth gyroharmonic. These simulations are in good agreement with experiments. We also incorporate test particle simulations that isolate the effects of specific wave modes on heating, and we find important contributions from both electron Bernstein waves and upper hybrid waves, the former of which have not yet been detected by experiments, and have not been previously explored as a driver of heating. In presenting these results, we analyzed data from HAARP diagnostics and assisted in planning the second round of experiments. We integrated the data into a picture of experiments that demonstrated the detection of SSS, hysteresis effects in simulated electromagnetic emission (SEE) features, and the direct scattering of the HF pump into the ionospheric waveguide. We performed simulations and analyzed simulation data to build the understanding of collisionless heating near the upper hybrid layer, and we used these simulations to show that bulk electron heating at the upper hybrid layer is possible, which is required by current theories of DAIL formation. We wrote a test particle simulation to isolate the effects of electron Bernstein waves and upper hybrid layers on collisionless heating, and integrated this code to work with both the output of Vlasov simulations and the input for simulations of DAIL formation.

Sense-making in theory and practice: a metatheoretical foundation and application for health information seeking

This thesis attempts to provide deeper historical and theoretical grounding for sense-making, thereby illustrating its applicability to practical information seeking research. In Chapter One I trace the philosophical origins of Brenda Dervin’s theory known as “sense making,” reaching beyond current scholarship that locates the origins of sense-making in twentieth-century Phenomenology and Communication theory and find its rich ontological, epistemological, and etymological heritage that dates back to the Pre-Socratics. After exploring sense-making’s Greek roots, I examine sense-making’s philosophical undercurrents found in Hegel’s Phenomenology of Spirit (1807), where he also returns to the simplicity of the Greeks for his concept of sense. With Chapter Two I explore sense-making methodology and find, in light of the Greek and Hegelian dialectic, a dialogical bridge connecting sense-making’s theory with pragmatic uses. This bridge between Dervin’s situation and use occupies a distinct position in sense-making theory. Moreover, building upon Brenda Dervin’s model of sense-making, I use her metaphors of gap and bridge analogy to discuss the dialectic and dialogic components of sense making. The purpose of Chapter Three is pragmatic – to gain insight into the online information-seeking needs, experiences, and motivation of first-degree relatives (FDRs) of breast cancer survivors through the lens of sense-making. This research analyses four questions: 1) information-seeking behavior among FDRs of cancer survivors compared to survivors and to undiagnosed, non-related online cancer information seekers in the general population, 2) types of and places where information is sought, 3) barriers or gaps and satisfaction rates FDRs face in their cancer information quest, and 4) types and degrees of cancer information and resources FDRs want and use in their information search for themselves and other family members. An online survey instrument designed to investigate these questions was developed and pilot tested. Via an email communication, the Susan Love Breast Cancer Research Foundation distributed 322,000 invitations to its membership to complete the survey, and from March 24th to April 5th 10,692 women agreed to take the survey with 8,804 volunteers actually completing survey responses. Of the 8,804 surveys, 95% of FDRs have searched for cancer information online, and 84% of FDRs use the Internet as a sense-making tool for additional information they have received from doctors or nurses. FDRs report needing much more information than either survivors or family/friends in ten out of fifteen categories related to breast and ovarian cancer. When searching for cancer information online, FDRs also rank highest in several of sense-making’s emotional levels: uncertainty, confusion, frustration, doubt, and disappointment than do either survivors or friends and family. The sense-making process has existed in theory and praxis since the early Greeks. In applying sense–making’s theory to a contemporary problem, the survey reveals unaddressed situations and gaps of FDRs’ information search process. FDRs are a highly motivated group of online information seekers whose needs are largely unaddressed as a result of gaps in available online information targeted to address their specific needs. Since FDRs represent a quarter of the population, further research addressing their specific online information needs and experiences is necessary.

Approximation Algorithms for Network Design and Orienteering

This thesis presents approximation algorithms for some NP-Hard combinatorial optimization problems on graphs and networks; in particular, we study problems related to Network Design. Under the widely-believed complexity-theoretic assumption that P is not equal to NP, there are no efficient (i.e., polynomial-time) algorithms that solve these problems exactly. Hence, if one desires efficient algorithms for such problems, it is necessary to consider approximate solutions: An approximation algorithm for an NP-Hard problem is a polynomial time algorithm which, for any instance of the problem, finds a solution whose value is guaranteed to be within a multiplicative factor of the value of an optimal solution to that instance. We attempt to design algorithms for which this factor, referred to as the approximation ratio of the algorithm, is as small as possible. The field of Network Design comprises a large class of problems that deal with constructing networks of low cost and/or high capacity, routing data through existing networks, and many related issues. In this thesis, we focus chiefly on designing fault-tolerant networks. Two vertices u,v in a network are said to be k-edge-connected if deleting any set of k − 1 edges leaves u and v connected; similarly, they are k-vertex connected if deleting any set of k − 1 other vertices or edges leaves u and v connected. We focus on building networks that are highly connected, meaning that even if a small number of edges and nodes fail, the remaining nodes will still be able to communicate. A brief description of some of our results is given below. We study the problem of building 2-vertex-connected networks that are large and have low cost. Given an n-node graph with costs on its edges and any integer k, we give an O(log n log k) approximation for the problem of finding a minimum-cost 2-vertex-connected subgraph containing at least k nodes. We also give an algorithm of similar approximation ratio for maximizing the number of nodes in a 2-vertex-connected subgraph subject to a budget constraint on the total cost of its edges. Our algorithms are based on a pruning process that, given a 2-vertex-connected graph, finds a 2-vertex-connected subgraph of any desired size and of density comparable to the input graph, where the density of a graph is the ratio of its cost to the number of vertices it contains. This pruning algorithm is simple and efficient, and is likely to find additional applications. Recent breakthroughs on vertex-connectivity have made use of algorithms for element-connectivity problems. We develop an algorithm that, given a graph with some vertices marked as terminals, significantly simplifies the graph while preserving the pairwise element-connectivity of all terminals; in fact, the resulting graph is bipartite. We believe that our simplification/reduction algorithm will be a useful tool in many settings. We illustrate its applicability by giving algorithms to find many trees that each span a given terminal set, while being disjoint on edges and non-terminal vertices; such problems have applications in VLSI design and other areas. We also use this reduction algorithm to analyze simple algorithms for single-sink network design problems with high vertex-connectivity requirements; we give an O(k log n)-approximation for the problem of k-connecting a given set of terminals to a common sink. We study similar problems in which different types of links, of varying capacities and costs, can be used to connect nodes; assuming there are economies of scale, we give algorithms to construct low-cost networks with sufficient capacity or bandwidth to simultaneously support flow from each terminal to the common sink along many vertex-disjoint paths. We further investigate capacitated network design, where edges may have arbitrary costs and capacities. Given a connectivity requirement R_uv for each pair of vertices u,v, the goal is to find a low-cost network which, for each uv, can support a flow of R_uv units of traffic between u and v. We study several special cases of this problem, giving both algorithmic and hardness results. In addition to Network Design, we consider certain Traveling Salesperson-like problems, where the goal is to find short walks that visit many distinct vertices. We give a (2 + epsilon)-approximation for Orienteering in undirected graphs, achieving the best known approximation ratio, and the first approximation algorithm for Orienteering in directed graphs. We also give improved algorithms for Orienteering with time windows, in which vertices must be visited between specified release times and deadlines, and other related problems. These problems are motivated by applications in the fields of vehicle routing, delivery and transportation of goods, and robot path planning.