Results 31 to 40 of about 1,494,270 (305)

Proving and disproving information inequalities

open access: yes, 2014
Proving an information inequality is a crucial step in establishing the converse results in coding theorems. However, an information inequality involving many random variables is difficult to be proved manually.
Tan, W.C., Yeung, R.W., Ho, S.W.
core   +1 more source

Dataset for file fragment classification of audio file formats

open access: yesBMC Research Notes, 2019
Objectives File fragment classification of audio file formats is a topic of interest in network forensics. There are a few publicly available datasets of files with audio formats.
Atieh Khodadadi, Mehdi Teimouri
doaj   +1 more source

Information Theory for Fields [PDF]

open access: yesAnnalen der Physik, 2019
AbstractA physical field has an infinite number of degrees of freedom since it has a field value at each location of a continuous space. Therefore, it is impossible to know a field from finite measurements alone and prior information on the field is essential for field inference.
openaire   +3 more sources

The Information Content of Accounting Reports: An Information Theory Perspective

open access: yes, 2016
Is it possible to quantify the information content of accounting reports? If possible, then how? This study examines accounting as a classical communication system with the purpose of providing a framework with which to approach these fundamentally ...
Jonathan Ross
core   +1 more source

Dataset for file fragment classification of textual file formats

open access: yesBMC Research Notes, 2019
Objectives Classification of textual file formats is a topic of interest in network forensics. There are a few publicly available datasets of files with textual formats. Therewith, there is no public dataset for file fragments of textual file formats. So,
Fatemeh Mansouri Hanis, Mehdi Teimouri
doaj   +1 more source

Approximating probability distributions with short vectors, via information theoretic distance measures

open access: yes, 2016
Given a probability distribution p = (p1., pn) and an integer m < n, what is the probability distribution q = (q1., qm) that is 'the closest' to p, that is, that best approximates p?
VACCARO, Ugo   +5 more
core   +1 more source

ITC-Net-MingledApp: A comprehensive dataset of mixed mobile application traffic for network traffic classification in diverse environmentsMendeley DataMendeley DataMendeley DataMendeley DataMendeley Data

open access: yesData in Brief
This dataset was collected from 36 popular Android applications across three distinct network scenarios. The scenarios varied by Internet service provider (ISP), geographic location, and individual users.
Abolghasem Rezaei Khesal   +5 more
doaj   +1 more source

Iterative Processing for Superposition Mapping

open access: yesJournal of Electrical and Computer Engineering, 2010
Superposition mapping (SM) is a modulation technique which loads bit tuples onto data symbols simply via linear superposition. Since the resulting data symbols are often Gaussian-like, SM has a good theoretical potential to approach the capacity of ...
Tianbin Wo   +3 more
doaj   +1 more source

Approximate Synchronization of Complex Network Consisting of Nodes With Minimum-Phase Zero Dynamics and Uncertainties

open access: yesIEEE Access, 2022
A synchronization algorithm of nonlinear complex networks composed of nonlinear nodes is designed. The main idea is to apply the exact feedback linearization of every node first, then applying methods for synchronization of linear complex networks.
Branislav Rehak, Volodymyr Lynnyk
doaj   +1 more source

Home - About - Disclaimer - Privacy