963 resultados para Information Channels
Resumo:
A communication system model for mutual information performance analysis of multiple-symbol differential M-phase shift keying over time-correlated, time-varying flat-fading communication channels is developed. This model is a finite-state Markov (FSM) equivalent channel representing the cascade of the differential encoder, FSM channel model and differential decoder. A state-space approach is used to model channel phase time correlations. The equivalent model falls in a class that facilitates the use of the forward backward algorithm, enabling the important information theoretic results to be evaluated. Using such a model, one is able to calculate mutual information for differential detection over time-varying fading channels with an essentially finite time set of correlations, including the Clarke fading channel. Using the equivalent channel, it is proved and corroborated by simulations that multiple-symbol differential detection preserves the channel information capacity when the observation interval approaches infinity.
Resumo:
This paper provides mutual information performance analysis of multiple-symbol differential WSK (M-phase shift keying) over time-correlated, time-varying flat-fading communication channels. A state space approach is used to model time correlation of time varying channel phase. This approach captures the dynamics of time correlated, time-varying channels and enables exploitation of the forward-backward algorithm for mutual information performance analysis. It is shown that the differential decoding implicitly uses a sequence of innovations of the channel process time correlation and this sequence is essentially uncorrelated. It enables utilization of multiple-symbol differential detection, as a form of block-by-block maximum likelihood sequence detection for capacity achieving mutual information performance. It is shown that multiple-symbol differential ML detection of BPSK and QPSK practically achieves the channel information capacity with observation times only on the order of a few symbol intervals
Resumo:
We study information rates of time-varying flat-fading channels (FFC) modeled as finite-state Markov channels (FSMC). FSMCs have two main applications for FFCs: modeling channel error bursts and decoding at the receiver. Our main finding in the first application is that receiver observation noise can more adversely affect higher-order FSMCs than lower-order FSMCs, resulting in lower capacities. This is despite the fact that the underlying higher-order FFC and its corresponding FSMC are more predictable. Numerical analysis shows that at low to medium SNR conditions (SNR lsim 12 dB) and at medium to fast normalized fading rates (0.01 lsim fDT lsim 0.10), FSMC information rates are non-increasing functions of memory order. We conclude that BERs obtained by low-order FSMC modeling can provide optimistic results. To explain the capacity behavior, we present a methodology that enables analytical comparison of FSMC capacities with different memory orders. We establish sufficient conditions that predict higher/lower capacity of a reduced-order FSMC, compared to its original high-order FSMC counterpart. Finally, we investigate the achievable information rates in FSMC-based receivers for FFCs. We observe that high-order FSMC modeling at the receiver side results in a negligible information rate increase for normalized fading rates fDT lsim 0.01.
Resumo:
We investigate how special relativity influences the transmission of classical information through quantum channels by evaluating the Holevo bound when the sender and the receiver are in (relativistic) relative motion. By using the spin degrees of freedom of spin-1/2 fermions to encode the classical information, we show that, for some configurations, the accessible information in the receiver can be increased when the spin detector moves fast enough. This is possible by allowing the momentum wave packet of one of the particles to be sufficiently wide while the momentum wave packets of other particles are kept relatively narrow. In this way, one can take advantage of the fact that boosts entangle the spin and momentum degrees of freedom of spin-1/2 fermions to increase the accessible information in the former. We close the paper with a discussion of how this relativistic quantum channel cannot in general be described by completely positive quantum maps. © 2013 American Physical Society.
Resumo:
Mode of access: Internet.
Resumo:
We study the statistics of optical data transmission in a noisy nonlinear fiber channel with a weak dispersion management and zero average dispersion. Applying analytical expressions for the output probability density functions both for a nonlinear channel and for a linear channel with additive and multiplicative noise we calculate in a closed form a lower bound estimate on the Shannon capacity for an arbitrary signal-to-noise ratio.
Resumo:
In this paper we summarize our recently proposed work on the information theory analysis of regenerative channels. We discuss how the design and the transfer function properties of the regenerator affect the noise statistics and enable Shannon capacities higher than that of the corresponding linear channels (in the absence of regeneration).
Resumo:
Secrecy is fundamental to computer security, but real systems often cannot avoid leaking some secret information. For this reason, the past decade has seen growing interest in quantitative theories of information flow that allow us to quantify the information being leaked. Within these theories, the system is modeled as an information-theoretic channel that specifies the probability of each output, given each input. Given a prior distribution on those inputs, entropy-like measures quantify the amount of information leakage caused by the channel. ^ This thesis presents new results in the theory of min-entropy leakage. First, we study the perspective of secrecy as a resource that is gradually consumed by a system. We explore this intuition through various models of min-entropy consumption. Next, we consider several composition operators that allow smaller systems to be combined into larger systems, and explore the extent to which the leakage of a combined system is constrained by the leakage of its constituents. Most significantly, we prove upper bounds on the leakage of a cascade of two channels, where the output of the first channel is used as input to the second. In addition, we show how to decompose a channel into a cascade of channels. ^ We also establish fundamental new results about the recently-proposed g-leakage family of measures. These results further highlight the significance of channel cascading. We prove that whenever channel A is composition refined by channel B, that is, whenever A is the cascade of B and R for some channel R, the leakage of A never exceeds that of B, regardless of the prior distribution or leakage measure (Shannon leakage, guessing entropy leakage, min-entropy leakage, or g-leakage). Moreover, we show that composition refinement is a partial order if we quotient away channel structure that is redundant with respect to leakage alone. These results are strengthened by the proof that composition refinement is the only way for one channel to never leak more than another with respect to g-leakage. Therefore, composition refinement robustly answers the question of when a channel is always at least as secure as another from a leakage point of view.^
Communicating with first year students ; so many channels but is anyone listening? A practice report
Resumo:
Communicating with first year students has become a far more complex prospect in the digital age. There is a lot of competition for limited attentional resources from media sources in almost endless channels. Getting important messages to students when there is so much competing information is a difficult prospect for academic and professional divisions of the university alike. Students’ preferences for these communication channels are not well understood and are constantly changing with the introduction of new technology. A first year group was surveyed about their use and preference for various sources of information. Students were generally positive about the use of social networking and other new online media but strongly preferred more established channels for official academic and administrative information. A discussion of the findings and recommendations follows.
Resumo:
Crowdsourcing has become a popular approach for capitalizing on the potential of large and open crowds of people external to the organization. While crowdsourcing as a phenomenon is studied in a variety of fields, research mostly focuses on isolated aspects and little is known about the integrated design of crowdsourcing efforts. We introduce a socio-technical systems perspective on crowdsourcing, which provides a deeper understanding of the components and relationships in crowdsourcing systems. By considering the function of crowdsourcing systems within their organizational context, we develop a typology of four distinct system archetypes. We analyze the characteristics of each type and derive a number of design requirements for the respective system components. The paper lays a foundation for IS-based crowdsourcing research, channels related academic work, and helps guiding the study and design of crowdsourcing information systems.
Resumo:
In the modern connected world, pervasive computing has become reality. Thanks to the ubiquity of mobile computing devices and emerging cloud-based services, the users permanently stay connected to their data. This introduces a slew of new security challenges, including the problem of multi-device key management and single-sign-on architectures. One solution to this problem is the utilization of secure side-channels for authentication, including the visual channel as vicinity proof. However, existing approaches often assume confidentiality of the visual channel, or provide only insufficient means of mitigating a man-in-the-middle attack. In this work, we introduce QR-Auth, a two-step, 2D barcode based authentication scheme for mobile devices which aims specifically at key management and key sharing across devices in a pervasive environment. It requires minimal user interaction and therefore provides better usability than most existing schemes, without compromising its security. We show how our approach fits in existing authorization delegation and one-time-password generation schemes, and that it is resilient to man-in-the-middle attacks.
Resumo:
The μO-conotoxins are an intriguing class of conotoxins targeting various voltage-dependent sodium channels and molluscan calcium channels. In the current study, we have shown MrVIA and MrVIB to be the first known peptidic inhibitors of the transient tetrodotoxin-resistant (TTX-R) Na+ current in rat dorsal root ganglion neurons, in addition to inhibiting tetrodotoxin-sensitive Na+ currents. Human TTX-R sodium channels are a therapeutic target for indications such as pain, highlighting the importance of the μO-conotoxins as potential leads for drug development. Furthermore, we have used NMR spectroscopy to provide the first structural information on this class of conotoxins. MrVIA and MrVIB are hydrophobic peptides that aggregate in aqueous solution but were solubilized in 50% acetonitrile/water. The three-dimensional structure of MrVIB consists of a small β-sheet and a cystine knot arrangement of the three-disulfide bonds. It contains four backbone “loops” between successive cysteine residues that are exposed to the solvent to varying degrees. The largest of these, loop 2, is the most disordered part of the molecule, most likely due to flexibility in solution. This disorder is the most striking difference between the structures of MrVIB and the known δ- and ω-conotoxins, which along with the μO-conotoxins are members of the O superfamily. Loop 2 of ω-conotoxins has previously been shown to contain residues critical for binding to voltage-gated calcium channels, and it is interesting to speculate that the flexibility observed in MrVIB may accommodate binding to both sodium and molluscan calcium channels.
Resumo:
This article provides a general review of the literature on the nature and role of empathy in social interaction for information professionals working in a variety of information and knowledge environments. Relational agency theory (Edwards, 2005) is used asa framework to re-conceptualize education for empathic social interaction between information professionals and their clients. Past, present and future issues relevant to empathic interaction in information and knowledge management are discussed in the context of three shifts identified from the literature: (a) the continued increase in communication channels, both physical and virtual, for reference, information and re-search services, (b) the transition from the information age to the conceptual age and(c) the growing need for understanding of the affective paradigm in the information and knowledge professions. Findings from the literature review on the relationships between empathy and information behavior, social networking, knowledge management and information and knowledge services are presented. Findings are discussed in relation to the development of guidelines for the affective education and training of information and knowledge professionals and the potential use of virtual learning software such as Second Life in developing empathic communication skills
Resumo:
Purpose In the past channel literature has looked to other disciplines in developing and refining their theories, models and methods in order to evolve the field. This paper traces such history and highlights the substantial changes caused by the digital age. In light of this, the inclusion of design theory into future channel management is presented to overcome existing concerns. Design/methodology/approach A comprehensive review of literature on the history of channels, the emotional experience (people), limitations of digital innovation (technology) and the role of design (business) has been conducted to create a new approach, built upon the theory of the techno-economic innovation model. Findings The findings of this study propose design-led channel management as a new research area, providing novel research questions and future research directions. The inclusion of design and emotion theories indicates that the future of digital channel design requires a deeper understanding of customers and needs to go beyond technological advances. Theoretical implications The findings provide an opportunity to explore dynamic theories and methodologies within the field of design that will broaden the horizons and challenge existing notions in channel literature. Originality/value This paper is the first paper that introduces the theory of Emotionate, as the next evolution of channel literature. The value of Emotionate lies in providing a new design-led process of integrating emotion to provide advice to practitioners as well as identifies research areas for academia, thereby extending the reach and richness of this emerging research field.