Applications of the Bernstein-Durrmeyer operators in estimating the norm of Mercer kernel matrices

The paper is related to the norm estimate of Mercer kernel matrices.The lower and upper bound estimates of Rayleigh entropy numbers for some Mercer kernel matrices on[0,1]×[0,1]based on the Bernstein-Durrmeyer operator kernel ale obtained,with which and the approximation property of the Bernstein-Durrmeyer operator the lower and upper bounds of the Rayleigh entropy number and the l2-norm for general Mercer kernel matrices on[0,1]×[0,1]are provided.     

The unique solution of the Karcher equation and the self-adjointness of the Karcher mean

Lawson and Lim showed that the Karcher equation for positive invertible operators on a Hilbert space has a unique solution using the method of the implicit function theorem of a Banach space. In this paper, in the framework of the operator inequality, we show the equivalence of the unique solution of the Karcher equation and the self-adjointness of the Karcher mean. For this, we reform the notion of the operator power means of negative order by virtue of the Tsallis relative operator entropy of negative order.     

ENTROPY FUNCTIONAL FOR CONTINUOUS SYSTEMS OF FINITE ENTROPY

In this article,we introduce the concept of entropy functional for continuous systems on compact metric spaces,and prove some of its properties.We also extract the Kolmogorov entropy from the entropy f...     

基于三角隶属函数和模糊熵的图像增强方法及其相关应用研究

鉴于图像增强技术在生活应用中的重要性,模糊技术在图像应用中的实用性和广泛性,提出了一种基于三角隶属函数和模糊熵的新的图像增强算法(T-FE增强算法),使用三角函数作为隶属函数,重构参数型对比增强算子,运用模糊熵最大原则选取阈值,计算快速,简单.并且将T-FE算法运用于图像分割,边缘检测.通过实验仿真表明,T-FE算法在进行图像处理时有较好效果.     

模糊熵与距离测度的相互诱导及其应用

模糊信息论就是利用模糊数学这一工具来研究带有模糊不确定性的信息的．模糊熵和距离测度是模糊信息论中两个重要的度量方法．本文主要讨论模糊熵和距离测度之间的相互关系,由此得到几个由模糊熵诱导的距离测度公式和几个由距离测度诱导出的模糊熵公式,说明了模糊熵和距离测度是可以相互诱导的．最后,举例说明距离测度公式在模式识别中的应用．     

逐点伪轨跟踪性质与混沌

本文研究了逐点伪轨跟踪性质与拓扑混合等混沌性态的关系,给出了$f$具有逐点伪轨跟踪性质时,$f$具有一致正熵和完全正熵的一些等价条件.     

知识库中知识的信息表示及其上的粗动力系统

粗集理论对知识进行了形式化定义,它为处理不确定,不完整的海量数据知识提供了一套严密的数据分析处理工具．但粗集概念及运算的代数意义表示往往不易被人理解．本文针对于此。在知识库中提出了知识的信息熵问题,证明了知识的某些信息表示与其代数表示是等价的,最后还讨论了知识库上的粗动力系统的一些性质。     

Entropy extension

We prove an “entropy extension-lifting theorem.” It consists of two inequalities for the covering numbers of two symmetric convex bodies. The first inequality, which can be called an “entropy extension theorem,” provides estimates in terms of entropy of sections and should be compared with the extension property of ?_∞. The second one, which can be called an “entropy lifting theorem,” provides estimates in terms of entropies of projections.     

Bounds for Shannon and Zipf‐Mandelbrot entropies

Shannon and Zipf‐Mandelbrot entropies have many applications in many applied sciences, for example, in information theory, biology and economics, etc. In this paper, we consider two refinements of the well‐know Jensen inequality and obtain different bounds for Shannon and Zipf‐Mandelbrot entropies. First of all, we use some convex functions and manipulate the weights and domain of the functions and deduce results for Shannon entropy. We also discuss their particular cases. By using Zipf‐Mandelbrot laws for different parameters in Shannon entropies results, we obtain bounds for Zipf‐Mandelbrot entropy. The idea used in this paper for obtaining the results may stimulate further research in this area, particularly for Zipf‐Mandelbrot entropy.     

Dimensions of ℝ-trees and self-similar fractal spaces of nonpositive curvature

We study various dimensions of spaces with nonpositive curvature in the A. D. Alexandrov sense, in particular, of ?-trees. We find some conditions necessary and sufficient for the metric space to be an ?-tree and clarify relations between the topological, Hausdorff, entropy, and rough dimensions. We build the examples of ?-trees and CAT(0)-spaces in which strict inequalities between the topological, Hausdorff, and entropy dimensions hold; we also show that the Hausdorff and entropy dimensions can be arbitrarily large while the topological dimension remains fixed.     

Equivalence relations among inequalities for some relative operator entropies

Positivity - The relative operator entropy has properties like operator means. In addition, the relative operator entropy has entropy-like properties. In this paper, we prove a Loewner–Heinz...     

An Alternative to Free Entropy for Free Group Factors

In this paper we define a very simple invariant η(V^-) for a k-tuple V^-of unitaries in a finite factor von Neumann algebra, and we show how this invariant can replace free entropy in many of the important applications. We also introduce a notion of metric free entropy and some related concepts.We include proofs, using η, of the theorems of Liming Ge and of D. Voiculescu, respectively, on the primeness of and on the absence of Cartan snbalgebras in the noncommutative free group factors.     

New sharp inequalities for operator means

New sharp multiplicative reverses of the operator means inequalities are presented, with a simple discussion of squaring an operator inequality. As a direct consequence, we extend the operator Pólya-Szegö inequality to arbitrary operator means. Furthermore, we obtain some new lower and upper bounds for the Tsallis relative operator entropy, operator monotone functions and positive linear maps.     

A general model of parameterized OWA aggregation with given orness level

The paper proposes a general optimization model with separable strictly convex objective function to obtain the consistent OWA (ordered weighted averaging) operator family. The consistency means that the aggregation value of the operator monotonically changes with the given orness level. Some properties of the problem are discussed with its analytical solution. The model includes the two most commonly used maximum entropy OWA operator and minimum variance OWA operator determination methods as its special cases. The solution equivalence to the general minimax problem is proved. Then, with the conclusion that the RIM (regular increasing monotone quantifier) can be seen as the continuous case of OWA operator with infinite dimension, the paper further proposes a general RIM quantifier determination model, and analytically solves it with the optimal control technique. Some properties of the optimal solution and the solution equivalence to the minimax problem for RIM quantifier are also proved. Comparing with that of the OWA operator problem, the RIM quantifier solutions are usually more simple, intuitive, dimension free and can be connected to the linguistic terms in natural language. With the solutions of these general problems, we not only can use the OWA operator or RIM quantifier to obtain aggregation value that monotonically changes with the orness level for any aggregated set, but also can obtain the parameterized OWA or RIM quantifier families in some specific function forms, which can incorporate the background knowledge or the required characteristic of the aggregation problems.     

Physical entropy, information entropy and their evolution equations

Inspired by the evolution equation of nonequilibrium statistical physics entropy and the concise statistical formula of the entropy production rate, we develop a theory of the dynamic information entropy and build a nonlinear evolution equation of the information entropy density changing in time and state variable space. Its mathematical form and physical meaning are similar to the evolution equation of the physical entropy: The time rate of change of information entropy density originates together from drift, diffusion and production. The concise statistical formula of information entropy production rate is similar to that of physical entropy also. Furthermore, we study the similarity and difference between physical entropy and information entropy and the possible unification of the two statistical entropies, and discuss the relationship among the principle of entropy increase, the principle of equilibrium maximum entropy and the principle of maximum information entropy as well as the connection between them and the entropy evolution equation.     

关于滑动相对熵的若干极限性质

引入滑动似然比和滑动相对熵等概念,讨论了滑动相对熵的若干渐近性质.主要结果是,获得了随机变量任意状态的相对频率与滑动相对熵之间的关系,并且给出了滑动相对熵基于相对频率的上界的估计.作为推论,得到了随机序列滑动平均的强大数定理.     

Combinatorial lemmas and applications to dynamics

The well-known combinatorial lemma of Karpovsky, Milman and Alon and a very recent one of Kerr and Li are extended. The obtained lemmas are applied to study the maximal pattern entropy introduced in the paper. It turns out that the maximal pattern entropy is equal to the supremum of sequence entropies over all sequences both in topological and measure-theoretical settings. Moreover, it is shown the maximal pattern entropy of any topological system is logk for some with k the maximal length of intrinsic sequence entropy tuples; and a zero-dimensional system has zero sequence entropy for any sequence if and only if the maximal pattern with respect to any open cover is of polynomial order.     

信息熵公理及其在决策分析中的应用

针对信息量是消息发生前的不确定性给出一个直观测量信息量公式.为了克服Shannon熵的局限性和分析信息度量本质,借鉴距离空间理论中度量公理定义的思路,通过非负性、对称性、次可加和极大性给出信息熵的公理化新定义.将Shannon熵、直观信息熵和β-熵等不同形式的信息度量统一在同一公理化结构下.应用直观信息熵公式仅采用四则运算进行决策树分析,避免了利用Shannon熵公式的对数运算.     

Applying the Linblad equation to quantum dissipative systems

For quantum systems with linear dissipation, we obtain the representation of the Linblad equation in the canonical form via Hermitian operators. Based on this representation, we derive equations for the entropy density and for the statistical projection operator. We consider the quantum harmonic oscillator with linear dissipation as an example. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 148, No. 2, pp. 288–294, August, 2006. An erratum to this article is available at .     

直觉模糊熵与加权决策算法

直觉模糊熵是直觉模糊集理论中的一个重要概念,反映了直觉模糊集的模糊程度和不确定程度.首先给出一种新的直觉模糊熵,并运用到多属性直觉模糊决策问题中.决策时根据直觉模糊熵计算属性权重,再综合决策者的偏好对各属性权重进行修正,然后使用直觉模糊集结算子和得分函数对方案进行排序,从而获得最优方案.