110,078 Hits in 2.0 sec

Reflexivity and the diagonal argument in proofs of limitative theorems [article]

Kajetan Młynarski
2011 arXiv   pre-print
The fact, that a formal system contains a sentence, which introduces reflexitivity, does not imply, that the same system does not contain a sentence or a proof procedure which solves this problem.  ...  In this work, we suggest an algorithm generating real numbers (arbitrary, infinite in the limit, binary strings), and we speculate it's meaning for theoretical computer science.  ...  In summary: such a tester can work infinitely long, processing infinite or incomplete data. Let us assume, that there exists a formal system in which each true sentence can be proven.  ... 
arXiv:1111.6954v1 fatcat:ux5r6qiwgrcxfdcgfw7jvckxpq

Some Analogies Between Thermodynamics and Shannon Theory

Dragan Samardzija
2007 2007 41st Annual Conference on Information Sciences and Systems  
We revisit the previously published results that relate notion of energy and information. We then introduce a thermodynamic system that could be used to store information.  ...  Specifically, we show that the average energy needed for adiabatic compression of the ideal gas to 1/N of its initial volume is the same as the average energy needed to achieve the capacity C = log 2 N  ...  In both cases, the compression and transmission are infinitely slow. 2 D.  ... 
doi:10.1109/ciss.2007.4298293 dblp:conf/ciss/Samardzija07 fatcat:tpdwx2q6rjdatpswgalondrbxa

Chaos in Binary Category Computation [article]

Carlos Pedro Gonçalves
2010 arXiv   pre-print
The work focuses on infinite binary chains of C2, which is a category that implements an X-OR-based categorial logical calculus.  ...  Category computation theory deals with a web-based systemic processing that underlies the morphic webs, which constitute the basis of categorial logical calculus.  ...  As is proved in section 3., all infinite binary strings are morphically compressible (theorem 1.), thus, all algorithmically random infinite binary strings are morphically compressible.  ... 
arXiv:1011.4686v1 fatcat:4cxgl66svnbbvbz26twehw6spu

Efficient error control in 3D mesh coding

D. C. Cernea, A. Munteanu, A. Alecu, J. Cornelis, P. Schelkens, F. Moran Burgos
2010 2010 IEEE International Workshop on Multimedia Signal Processing  
Instantiations of both L-2 and L-infinite coding approaches are demonstrated for MESHGRID, which is a scalable 3D object encoding system, part of MPEG-4 AFX.  ...  In this survey paper, we compare the novel L-infinite distortion estimator against the L-2 distortion estimator which is typically employed in 3D mesh coding systems.  ...  the compression system.  ... 
doi:10.1109/mmsp.2010.5662035 dblp:conf/mmsp/CerneaMACSB10 fatcat:asl2drceabd7llnoa6ezacqj6y

Image encryption algorithm for crowd data based on a new hyperchaotic system and Bernstein polynomial

Donghua Jiang, Lidong Liu, Xingyuan Wang, Xianwei Rong
2021 IET Image Processing  
A new two-dimensional chaotic system in the form of a cascade structure is designed, which is derived from the Chebyshev system and the infinite collapse system.  ...  First, the plain image is compressed by singular value decomposition, and then encrypted to the noise-like cipher image by scrambling and diffusion algorithm.  ...  FIGURE 2 2 Infinite collapse system, (a) is the bifurcation chart of the infinite collapse system, (b) is the Lyapunov exponent chart of the infinite collapse system FIGURE 3 3 FIGURE 3 The trajectory  ... 
doi:10.1049/ipr2.12237 fatcat:6sopufuusrgbvkdccrqtcnubem

Simplicity: a unifying principle in cognitive science?

Nick Chater, Paul Vitányi
2003 Trends in Cognitive Sciences  
be 'lossy' -i.e. information may be thrown away by the cognitive system, but we do not consider this here).  ...  But there are always infinitely many patterns compatible with any finite amount of data. How does the cognitive system choose 'sensible' patterns?  ... 
doi:10.1016/s1364-6613(02)00005-0 pmid:12517354 fatcat:u3bglbpppbgf7lhreojjuannke

Page 725 of SMPTE Motion Imaging Journal Vol. 103, Issue 11 [page]

1994 SMPTE Motion Imaging Journal  
Transform compression system. shown to produce objectively and sub- jectively superior results.  ...  However, they do so at the expense of the edge information that is spread across the SMPTE Journal, November 1994 frequency spectrum.  ... 

An infinite quantum Ramsey theorem [article]

Matthew Kennedy, Taras Kolomatski, Daniel Spivak
2017 arXiv   pre-print
Specifically, we prove that if V is such a subspace, then provided there is no obvious obstruction, there is an infinite rank projection P with the property that the compression PVP is either maximal or  ...  We prove an infinite Ramsey theorem for noncommutative graphs realized as unital self-adjoint subspaces of linear operators acting on an infinite dimensional Hilbert space.  ...  graph of a channel from classical information theory.  ... 
arXiv:1711.09526v1 fatcat:dllbgk7yf5fndeclh7dirpvn5m

Page 131 of Journal of Spacecraft and Rockets Vol. 12, Issue 3 [page]

1975 Journal of Spacecraft and Rockets  
SPACECRAFT Calculation of Compressible Turbulent Boundary Layers on an Infinite Yawed Airfoil J.C. Adams Jr.* ARO, Inc., Arnold Air Force Station, Tenn.  ...  Theme HE three-dimensional compressible turbulent boundary layer on an infinite yawed airfoil is a problem which has received little attention in the literature.  ... 

Channel estimation using joint dictionary learning in FDD massive MIMO systems

Yacong Ding, Bhaskar D. Rao
2015 2015 IEEE Global Conference on Signal and Information Processing (GlobalSIP)  
The existing work that applies compressed channel estimation use orthogonal DFT basis as Ψ: Agree with array manifold using ULA. Infinite number of antennas, limited scattering environment.  ...  Infinite number of antennas, limited scattering environment.  ... 
doi:10.1109/globalsip.2015.7418182 dblp:conf/globalsip/DingR15 fatcat:ss5q7qr36fgwjaanv4qgruthka

Page 4420 of Mathematical Reviews Vol. , Issue 95g [page]

1995 Mathematical Reviews  
The subject is currently enjoying a revival in the information theory and computer science literature because of the importance of noiseless compression in the efficient storage and transmission of information  ...  (D-DORT-I2; Dortmund) Codes and infinite words. (English and French summaries) Acta Cybernet. 11 (1994), no. 4, 241-256. Summary: “Codes can be characterized by their way of acting on infinite words.  ... 

Robustness of statistical mechanical interpretation of algorithmic information theory

Kohtaro Tadaki
2011 2011 IEEE Information Theory Workshop  
and specific heat, into algorithmic information theory.  ...  Reflecting this self-referential nature of the compression rate of the temperature, we obtain fixed point theorems on compression rate.  ...  Acknowledgments This work was supported both by KAKENHI, Grant-in-Aid for Scientific Research (C) (20540134) and by SCOPE (Strategic Information and Communications R&D Promotion Programme) from the Ministry  ... 
doi:10.1109/itw.2011.6089427 dblp:conf/itw/Tadaki11 fatcat:tllvmtpqizdwxmaipjo4hc5uce

Toward a dynamical model for prime numbers

Claudio Bonanno, Mirko S. Mega
2004 Chaos, Solitons & Fractals  
Our approach is based on two complexity methods, the Computable Information Content and the Entropy Information Gain, looking for analogies between the prime numbers and intermittency.  ...  In the following we use a particular compression algorithm called CASToRe (introduced in [2] ), that has been tested on some weakly chaotic and infinite systems, giving good approximations of the AIC.  ...  If the invariant ergodic measure µ is infinite then (see [11] for exact hypothesis on systems with infinite measures) K(x, Z) = 0 (6) for µ-almost any x ∈ X.  ... 
doi:10.1016/s0960-0779(03)00433-8 fatcat:fdokmvuipra4hjsb6rykpemsn4

Theoretical Distortion Estimation In L-Infinite Wavelet-Based Coding Of Semi-Regular Meshes

Leon Denis, Ruxandra Florea, Jan Lievens, A. Munteanu, Peter Schelkens
2012 Zenodo  
At low-to-medium rates, the performance differences are substantial, indicating that for L-infinite coding, a compression system deploying wavelets on surfaces, as proposed in this paper, should be favored  ...  In addition, the proposed system brings substantial performance improvements in L-infinite coding over the state-of-the-art L-infinite MeshGrid-based system of [11] .  ... 
doi:10.5281/zenodo.42974 fatcat:ymvtlcklyvb3xov5p5hjjgulmi

On Nested Justification Systems (full version) [article]

Simon Marynissen, Jesse Heyninck, Bart Bogaerts, Marc Denecker
2022 arXiv   pre-print
As we show in this paper, the original semantics for nested justification systems lead to the loss of information relevant for explanations.  ...  Nested justification systems, first introduced by Denecker et al. (2015), allow for the composition of justification systems.  ...  Going from Merge(JS) to Compress(JS) should be relatively easy since justifications in Merge(JS) contain more information. By removing this extra information, we can reduce the justification.  ... 
arXiv:2205.04541v1 fatcat:bztwtgxhcnhwxf3b2a2e6hcgle
« Previous Showing results 1 — 15 out of 110,078 results