文件名称:athetic_computation
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:3mb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
1928年, George D. Birkhoff提出了著名的美学度量公式measure = order/complexity.但是order和complexity具体如何计算并没有给出。本文在Shannon信息论的基础上,提出了基于Shannon entropy和kolmogorov complexity的美学度量。作者认为他们“on a promising track with a sound theoretical basis, which not only extends but will further develop Birkhoff’s and Bense’s aesthetics studies”(同意,呵呵)。论文中利用到的信息论基本概念有:Shannon Entropy, conditional entropy, mutual information, Jensen-Shannon inequality, kolmogorov complexity和physical entropy等。-In 1928, George D. Birkhoff aesthetic measure proposed by the famous formula of measure = order/complexity. But the order and complexity did not give specific how to calculate. In this paper, based on Shannon information theory, was proposed based on Shannon entropy and kolmogorov complexity of the aesthetic measure. Author believes that they are " on a promising track with a sound theoretical basis, which not only extends but will further develop Birkhoff' s and Bense' s aesthetics studies" (agree, huh, huh). Use of papers to the basic concept of information theory: Shannon Entropy, conditional entropy, mutual information, Jensen-Shannon inequality, kolmogorov complexity and physical entropy and so on.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
athetic_computation.pdf
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.