检索结果-内蒙古大学图书馆

International Conference on Intelligent Sensing and Information Processing

作者： Krishnamurthy, EV Australian Natl Univ Comp Sci Lab Canberra ACT 0200 Australia

ISBN: (纸本)0780382439

A smart system exhibits the three important properties: (i) Interactive, Collective, coordinated and parallel Operation (ii) Self-organization through emergent properties (iii)Adaptive and Flexible operation. A hierarchy based on metric entropy is suggested among the computational systems that transcend from the unsmart to the smart system through a phase transition like phenomenon. Understanding smart systems is useful to solve hard-optimization problem inspired by the self-organizing processes found in nature. Such systems will be valuable to create artificial systems made up of exotic matter to solve specific problems in particular domains of interest with a high efficiency.

关键词： self-adjusting systems emergent phenomena evolutionary computation optimisation entropy algorithmic entropy smart system parallel operation self organizing process computational systems phase transition optimization problem artificial systems metric entropy percolation

来源：评论

学校读者我要写书评

暂无评论

Nonparametric Steganalysis of QIM Steganography Using Approximate entropy

引用

IEEE TRANSACTIONS ON INFORMATION FORENSICS AND SECURITY 2012年第2期7卷 418-431页

作者： Malik, Hafiz Subbalakshmi, K. P. Chandramouli, R. Univ Michigan Dept Elect & Comp Engn Dearborn MI 48128 USA Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

This paper proposes an active steganalysis method for quantization index modulation (QIM)-based steganography. The proposed nonparametric steganalysis method uses irregularity (or randomness) in the test image to distinguish between the cover image and the stego image. We have shown that plain quantization (quantization without message embedding) induces regularity in the resulting quantized object, whereas message embedding using QIM increases irregularity in the resulting QIM-stego. Approximate entropy, an algorithmic entropy measure, is used to quantify irregularity in the test image. The QIM-stego image is then analyzed to estimate secret message length. To this end, the QIM codebook is estimated from the QIM-stego image using first-order statistics of the image coefficients in the embedding domain. The estimated codebook is then used to estimate secret message. Simulation results show that the proposed scheme can successfully estimate the hidden message from the QIM-stego with very low decoding error probability. For a given cover object the decoding error probability depends on embedding rate and decreases mono-tonically, approaching zero as the embedding rate approaches one.

关键词： algorithmic entropy approximate entropy complexity dither modulation embedding rate entropy message recovery quantization index modulation steganalysis steganography

来源：评论

学校读者我要写书评

暂无评论

Nonparametric steganalysis of QIM data hiding using approximate entropy

Nonparametric steganalysis of QIM data hiding using approxim...

引用

Conference on Security, Forensics, Steganography, and Watermarking of Multimedia Contents X

作者： Malik, Hafiz Subbalakshmi, K. P. Chandramouli, R. Univ Michigan Dept Elect & Comp Engn Dearborn MI 48127 USA Stevens Inst Technol Dept Elect & Comp Engn Hoboken NJ 07030 USA

ISBN: (纸本)9780819469915

This paper proposes a nonparametric steganalysis method for quantization index modulation (QIM) based steganography. The proposed steganalysis method uses irregularity (or randomness) in the test-image to distinguish between the cover- and the stego-image. We have shown that plain-quantization (quantization without message embedding) induces regularity in the resulting quantized-image;whereas message embedding using QIM increases irregularity in the resulting QIM-stego image. Approximate entropy, an algorithmic entropy measure, is used to quantify irregularity in the test-image. Simulation results presented in this paper show that the proposed steganalysis technique can distinguish between the cover- and the stego-image with low false rates (i.e. P-fp < 0.1 & P-fn < 0.07 for dither modulation stego and P-fp < 0.12 & P-fn < 0.002 for QIM-stego).

关键词： steganography steganalysis quantization index modulation dither modulation entropy complexity approximate entropy algorithmic entropy

来源：评论

学校读者我要写书评

暂无评论

Uniform test of algorithmic randomness over a general space

引用

THEORETICAL COMPUTER SCIENCE 2005年第1-3期341卷 91-137页

作者： Gács, P Boston Univ Dept Comp Sci Boston MA 02215 USA

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These restrictions seem artificial. Some progress has been made to extend the theory to arbitrary Bernoulli distributions (by Martin-Lof) and to arbitrary distributions (by Levin). We recall the main ideas and problems of Levin's theory, and report further progress in the same framework. The issues are the following: Allow non-compact spaces (like the space of continuous functions, underlying the Brownian motion). The uniform test (deficiency of randomness) d p (x) (depending both on the outcome x and the measure P) should be defined in a general and natural way. See which of the old results survive: existence of universal tests, conservation of randomness, expression of tests in terms of description complexity, existence of a universal measure, expression of mutual information as "deficiency of independence". The negative of the new randomness test is shown to be a generalization of complexity in continuous spaces;we show that the addition theorem survives. The paper's main contribution is introducing an appropriate framework for studying these questions and related ones (like statistics for a general family of distributions). (c) 2005 Elsevier B.V. All rights reserved.

关键词： algorithmic information theory algorithmic entropy randomness test Kolmogorov complexity description complexity

来源：评论

学校读者我要写书评

暂无评论

Understanding how replication processes can maintain systems away from equilibrium using algorithmic Information Theory

引用

BIOSYSTEMS 2016年 140卷 8-22页

作者： Devine, Sean D. Victoria Univ Wellington Victoria Management Sch POB 600 Wellington 6140 New Zealand

Replication can be envisaged as a computational process that is able to generate and maintain order far-from-equilibrium. Replication processes, can self-regulate, as the drive to replicate can counter degradation processes that impact on a system. The capability of replicated structures to access high quality energy and eject disorder allows Landauer's principle, in conjunction with algorithmic Information Theory, to quantify the entropy requirements to maintain a system far-from-equilibrium. Using Landauer's principle, where destabilising processes, operating under the second law of thermodynamics, change the information content or the algorithmic entropy of a system by Delta H bits, replication processes can access order, eject disorder, and counter the change without outside interventions. Both diversity in replicated structures, and the coupling of different replicated systems, increase the ability of the system (or systems) to self-regulate in a changing environment as adaptation processes select those structures that use resources more efficiently. At the level of the structure, as selection processes minimise the information loss, the irreversibility is minimised. While each structure that emerges can be said to be more entropically efficient, as such replicating structures proliferate, the dissipation of the system as a whole is higher than would be the case for inert or simpler structures. While a detailed application to most real systems would be difficult, the approach may well be useful in understanding incremental changes to real systems and provide broad descriptions of system behaviour. (C) 2016 The Author. Published by Elsevier Ireland Ltd.

关键词： Organization in complex systems Dynamics of evolution Replication algorithmic Information Theory algorithmic entropy

来源：评论

学校读者我要写书评

暂无评论

THE DECREASE IN THE OVERALL algorithmic COMPLEXITY OF THE SPIN-ECHO EFFECT

引用

JOURNAL OF STATISTICAL PHYSICS 1993年第3-4期70卷 1057-1067页

作者： SHIZUME, K University of Library and Information Science Tsukuba Japan

Recently Lloyd and Zurek studied the algorithmic complexity of the spin-echo effect and concluded that the overall complexity of spins together with the magnetic field grew slowly even during the rephasing stage. In this paper we show that, in contrast to their conclusion, the complexity decreases during the rephasing stage. We also clarify the origin of the disagreement.

关键词： algorithmic entropy COMPLEXITY RANDOMNESS SPIN-ECHO EFFECT

来源：评论

学校读者我要写书评

暂无评论

The application of algorithmic information theory to noisy patterned strings

引用

COMPLEXITY 2006年第2期12卷 52-58页

作者： Devine, Sean Victoria Univ Wellington Victoria Management Sch Wellington 6140 New Zealand

Although algorithmic information theory provides a measure of the information content of string of characters, problems of noise and noncomputability emerge. However, if pattern in a noisy string is recognized by reference to a set of similar strings, this article shows that a compressed algorithmic description of a noisy string is possible and illustrates this with some simple examples. The article also shows that algorithmic information theory can quantify the information in complex organized systems where pattern is nested within pattern. (c) 2006 Wiley Periodicals, Inc.

关键词： complexity algorithmic information theory algorithmic entropy pattern

来源：评论

学校读者我要写书评

暂无评论

ALAN TURING AND THE ORIGINS OF COMPLEXITY

引用

ARBOR-CIENCIA PENSAMIENTO Y CULTURA 2013年第764期189卷

作者： Martin-Delgado, Miguel-Angel Univ Complutense Dept Fis Teor 1 E-28040 Madrid Spain

The 75th anniversary of Turing's seminal paper and his centennial anniversary occur in 2011 and 2012, respectively. It is natural to review and assess Turing's contributions in diverse fields in the light of new developments that his thought has triggered in many scientific communities. Here, the main idea is to discuss how the work of Turing allows us to change our views on the foundations of Mathematics, much as quantum mechanics changed our conception of the world of Physics. Basic notions like computability and universality are discussed in a broad context, placing special emphasis on how the notion of complexity can be given a precise meaning after Turing, i.e., not just qualitatively but also quantitatively Turing's work is given some historical perspective with respect to some of his precursors, contemporaries and mathematicians who took his ideas further.

关键词： Turing Machine Computability algorithmic Complexity Computational Complexity Complexity Classes Chaitin Omega algorithmic entropy Turing Barrier

来源：评论

学校读者我要写书评

暂无评论

AN algorithmic INFORMATION THEORY CHALLENGE TO INTELLIGENT DESIGN

引用

ZYGON 2014年第1期49卷 42-65页

作者： Devine, Sean Victoria Univ Wellington Sch Management Wellington 6140 New Zealand

William Dembski claims to have established a decision process to determine when highly unlikely events observed in the natural world are due to Intelligent Design. This article argues that, as no implementable randomness test is superior to a universal Martin-Lof test, this test should be used to replace Dembski's decision process. Furthermore, Dembski's decision process is flawed, as natural explanations are eliminated before chance. Dembski also introduces a fourth law of thermodynamics, his law of conservation of information, to argue that information cannot increase by natural processes. However, this article, using algorithmic information theory, shows that this law is no more than the second law of thermodynamics. The article concludes that any discussions on the possibilities of design interventions in nature should be articulated in terms of the algorithmic information theory approach to randomness and its robust decision process.

关键词： algorithmic entropy algorithmic information theory fourth law of thermodynamics Intelligent Design randomness test

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：