Search results for " information theory"

showing 10 items of 51 documents

Low-Power Wide-Area Networks for Sustainable IoT

2019

Low-power wide-area (LPWA) networks are attracting extensive attention because of their abilities to offer low-cost and massive connectivity to Internet of Things (IoT) devices distributed over wide geographical areas. This article provides a brief overview on the existing LPWA technologies and useful insights to aid the large-scale deployment of LPWA networks. Particularly, we first review the currently competing candidates of LPWA networks, such as narrowband IoT (NB-IoT) and long range (LoRa), in terms of technical fundamentals and large-scale deployment potential. Then we present two implementation examples on LPWA networks. By analyzing the field-test results, we identify several chall…

FOS: Computer and information sciencesComputer scienceComputer Science - Information Theory0805 Distributed Computing02 engineering and technologylaw.inventionComputer Science - Networking and Internet ArchitectureBluetoothGSMlaw1005 Communications Technologies0202 electrical engineering electronic engineering information engineeringBandwidth (computing)Resource managementElectrical and Electronic EngineeringNetworking and Internet Architecture (cs.NI)business.industryInformation Theory (cs.IT)020206 networking & telecommunicationsComputer Science ApplicationsPower (physics)0906 Electrical and Electronic EngineeringWide areaSoftware deploymentNetworking & TelecommunicationsTelecommunicationsbusinessInternet of Things
researchProduct

Investigating Low Level Protocols for Wireless Body Sensor Networks

2016

The rapid development of medical sensors has increased the interest in Wireless Body Area Network (WBAN) applications where physiological data from the human body and its environment is gathered, monitored, and analyzed to take the proper measures. In WBANs, it is essential to design MAC protocols that ensure adequate Quality of Service (QoS) such as low delay and high scalability. This paper investigates Medium Access Control (MAC) protocols used in WBAN, and compares their performance in a high traffic environment. Such scenario can be induced in case of emergency for example, where physiological data collected from all sensors on human body should be sent simultaneously to take appropria…

FOS: Computer and information sciencesComputer scienceComputer Science - Information TheoryTime division multiple accessAccess control[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technology[INFO.INFO-IU]Computer Science [cs]/Ubiquitous Computing[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]Body area network0202 electrical engineering electronic engineering information engineeringWirelessProtocol (science)business.industryInformation Theory (cs.IT)Quality of service020208 electrical & electronic engineeringComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS020206 networking & telecommunications[INFO.INFO-MO]Computer Science [cs]/Modeling and SimulationComputer Science - Distributed Parallel and Cluster Computing[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]Scalability[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET]Distributed Parallel and Cluster Computing (cs.DC)[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessWireless sensor networkComputer network
researchProduct

Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities

2016

One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such task…

FOS: Computer and information sciencesExistential quantificationComputer Science - Information TheoryFOS: Physical sciences01 natural sciences010305 fluids & plasmasTheoretical Computer ScienceQuantum state0103 physical sciencesElectrical and Electronic Engineering010306 general physicsQuantumMathematicsQuantum computerDiscrete mathematicsQuantum PhysicsInformation Theory (cs.IT)Statistical and Nonlinear PhysicsParity (physics)Electronic Optical and Magnetic MaterialsKochen–Specker theoremModeling and SimulationSignal ProcessingOnticQuantum Physics (quant-ph)Random access
researchProduct

Fractional generalized cumulative entropy and its dynamic version

2021

Following the theory of information measures based on the cumulative distribution function, we propose the fractional generalized cumulative entropy, and its dynamic version. These entropies are particularly suitable to deal with distributions satisfying the proportional reversed hazard model. We study the connection with fractional integrals, and some bounds and comparisons based on stochastic orderings, that allow to show that the proposed measure is actually a variability measure. The investigation also involves various notions of reliability theory, since the considered dynamic measure is a suitable extension of the mean inactivity time. We also introduce the empirical generalized fract…

FOS: Computer and information sciencesExponential distributionComputer Science - Information TheoryMathematics - Statistics TheoryStatistics Theory (math.ST)01 natural sciencesMeasure (mathematics)010305 fluids & plasmas0103 physical sciencesFOS: MathematicsApplied mathematicsAlmost surelyCumulative entropy; Fractional calculus; Stochastic orderings; EstimationEntropy (energy dispersal)010306 general physicsStochastic orderingsMathematicsCentral limit theoremNumerical AnalysisInformation Theory (cs.IT)Applied MathematicsCumulative distribution functionProbability (math.PR)Fractional calculusEmpirical measureFractional calculusModeling and SimulationEstimationCumulative entropyMathematics - ProbabilityCommunications in Nonlinear Science and Numerical Simulation
researchProduct

Local Granger causality

2021

Granger causality is a statistical notion of causal influence based on prediction via vector autoregression. For Gaussian variables it is equivalent to transfer entropy, an information-theoretic measure of time-directed information transfer between jointly dependent processes. We exploit such equivalence and calculate exactly the 'local Granger causality', i.e. the profile of the information transfer at each discrete time point in Gaussian processes; in this frame Granger causality is the average of its local version. Our approach offers a robust and computationally fast method to follow the information transfer along the time history of linear stochastic processes, as well as of nonlinear …

FOS: Computer and information sciencesInformation transferGaussianFOS: Physical sciencestechniques; information theory; granger causalityMachine Learning (stat.ML)Quantitative Biology - Quantitative Methods01 natural sciences010305 fluids & plasmasVector autoregressionsymbols.namesakegranger causalityGranger causalityStatistics - Machine Learning0103 physical sciencesApplied mathematicstime serie010306 general physicsQuantitative Methods (q-bio.QM)Mathematicsinformation theoryStochastic processDisordered Systems and Neural Networks (cond-mat.dis-nn)Condensed Matter - Disordered Systems and Neural NetworksComputational Physics (physics.comp-ph)Discrete time and continuous timeAutoregressive modelFOS: Biological sciencesSettore ING-INF/06 - Bioingegneria Elettronica E InformaticasymbolsTransfer entropytechniquesPhysics - Computational Physics
researchProduct

Multiscale analysis of information dynamics for linear multivariate processes.

2016

In the study of complex physical and physiological systems represented by multivariate time series, an issue of great interest is the description of the system dynamics over a range of different temporal scales. While information-theoretic approaches to the multiscale analysis of complex dynamics are being increasingly used, the theoretical properties of the applied measures are poorly understood. This study introduces for the first time a framework for the analytical computation of information dynamics for linear multivariate stochastic processes explored at different time scales. After showing that the multiscale processing of a vector autoregressive (VAR) process introduces a moving aver…

FOS: Computer and information sciencesInformation transferMultivariate statisticsMultivariate analysisComputer scienceComputer Science - Information Theory0206 medical engineeringStochastic ProcesseBiomedical EngineeringFOS: Physical sciencesInformation Storage and RetrievalHealth Informatics02 engineering and technology01 natural sciencesEntropy (classical thermodynamics)Moving average0103 physical sciencesEntropy (information theory)Computer SimulationStatistical physicsEntropy (energy dispersal)Time series010306 general physicsEntropy (arrow of time)Multivariate Analysi1707Stochastic ProcessesEntropy (statistical thermodynamics)Stochastic processInformation Theory (cs.IT)Probability and statisticsModels Theoretical020601 biomedical engineeringComplex dynamicsAutoregressive modelPhysics - Data Analysis Statistics and ProbabilitySignal ProcessingSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaMultivariate AnalysisData Analysis Statistics and Probability (physics.data-an)Entropy (order and disorder)Annual International Conference of the IEEE Engineering in Medicine and Biology Society. IEEE Engineering in Medicine and Biology Society. Annual International Conference
researchProduct

The rightmost equal-cost position problem.

2013

LZ77-based compression schemes compress the input text by replacing factors in the text with an encoded reference to a previous occurrence formed by the couple (length, offset). For a given factor, the smallest is the offset, the smallest is the resulting compression ratio. This is optimally achieved by using the rightmost occurrence of a factor in the previous text. Given a cost function, for instance the minimum number of bits used to represent an integer, we define the Rightmost Equal-Cost Position (REP) problem as the problem of finding one of the occurrences of a factor whose cost is equal to the cost of the rightmost one. We present the Multi-Layer Suffix Tree data structure that, for…

FOS: Computer and information sciencesOffset (computer science)Computer scienceSuffix treeComputer Science - Information Theorylaw.inventionCombinatoricslawLog-log plotComputer Science - Data Structures and AlgorithmsCompression schemetext compressiondictionary text compressionData Structures and Algorithms (cs.DS)LZ77 compressiondata compressionLossless compressionfull text indexSuffix Tree Data StructuresSettore INF/01 - InformaticaInformation Theory (cs.IT)Data structurePrefixCompression ratioCompression scheme; Constant time; Suffix Tree Data StructuresAlgorithmData compressionConstant time
researchProduct

Gradients of O-information: Low-order descriptors of high-order dependencies

2023

O-information is an information-theoretic metric that captures the overall balance between redundant and synergistic information shared by groups of three or more variables. To complement the global assessment provided by this metric, here we propose the gradients of the O-information as low-order descriptors that can characterise how high-order effects are localised across a system of interest. We illustrate the capabilities of the proposed framework by revealing the role of specific spins in Ising models with frustration, and on practical data analysis on US macroeconomic data. Our theoretical and empirical analyses demonstrate the potential of these gradients to highlight the contributio…

FOS: Computer and information sciencesPhysics and AstronomyInformation Theory (cs.IT)Computer Science - Information TheoryPhysics - Data Analysis Statistics and ProbabilitySettore ING-INF/06 - Bioingegneria Elettronica E InformaticaFOS: Physical sciencesGeneral Physics and Astronomycomplex systems information theory dynamical systems econophysicsData Analysis Statistics and Probability (physics.data-an)Physical Review Research
researchProduct

Optimal Classical Random Access Codes Using Single d-level Systems

2015

Recently, in the letter [Phys. Rev. Lett. {\bf 114}, 170502 (2015)], Tavakoli et al. derived interesting results by studying classical and quantum random access codes (RACs) in which the parties communicate higher-dimensional systems. They construct quantum RACs with a bigger advantage over classical RACs compared to previously considered RACs with binary alphabet. However, these results crucially hinge upon an unproven assertion that the classical strategy "majority-encoding-identity-decoding" leads to the maximum average success probability achievable for classical RACs; in this article we provide a proof of this intuition. We characterize all optimal classical RACs and show that indeed "…

FOS: Computer and information sciencesQuantum PhysicsComputer Science - Computational ComplexityInformation Theory (cs.IT)Computer Science - Information TheoryFOS: Physical sciencesComputational Complexity (cs.CC)Quantum Physics (quant-ph)Quantitative Biology::Cell Behavior
researchProduct

Random Interruptions in Cooperation for Spectrum Sensing in Cognitive Radio Networks

2015

In this paper, a new cooperation structure for spectrum sensing in cognitive radio networks is proposed which outperforms the existing commonly-used ones in terms of energy efficiency. The efficiency is achieved in the proposed design by introducing random interruptions in the cooperation process between the sensing nodes and the fusion center, along with a compensation process at the fusion center. Regarding the hypothesis testing problem concerned, first, the proposed system behavior is thoroughly analyzed and its associated likelihood-ratio test (LRT) is provided. Next, based on a general linear fusion rule, statistics of the global test summary are derived and the sensing quality is cha…

FOS: Computer and information sciencesSemidefinite programmingMathematical optimizationta213Computer scienceInformation Theory (cs.IT)Computer Science - Information Theory010401 analytical chemistrydecision/data fusion020206 networking & telecommunications02 engineering and technology01 natural sciencesStatistical power0104 chemical sciencescooperative spectrum sensingCognitive radionon-ideal reporting channelsefficiency0202 electrical engineering electronic engineering information engineeringcognitive radio (CR)False alarmElectrical and Electronic EngineeringStatistical hypothesis testingEfficient energy use
researchProduct