Richardson数对后台阶流动熵产的影响

后台阶流动是研究伴随有传热现象的分离流动的常用模型．虽然Richardson数的改变会明显影响分离流动的流动和传热特性,但是迄今为止关于Richardson数对后台阶流动熵产影响的研究依然很少．基于求解熵产方程,第一次系统研究Richardson数对后台阶流动熵产的影响．对于求解熵产方程所需的速度和温度等变量,通过格子Boltzmann方法来得到．通过上述工作可以发现,后台阶流动中熵产和Bejan数的分布随Richardson数变化显著．总熵产数是Richardson数的单调减函数而平均Bejan数是Richardson数的单调增函数．     

混合型多属性决策问题的熵方法

从熵的角度出发,研究了指标属性值为精确实数值、区间值和模糊值的混合型多属性决策问题.并定义了区间熵的概念,提出计算方案区间熵的公式.根据区间熵值可作出各方案的优劣决策.算例表明其具有有效性及科学性.     

On the piecewise smoothness of entropy solutions to scalar conservation laws

The behavior and structure of entropy solutions of scalar convex conservation laws are studied. It is well known that such entropy solutions consist of at most countable number of C¹-smooth regions. We obtain new upper. bounds on the higher order derivatives of the entropy solution in any one of its C¹-smoothness regions. These bounds enable us to measure the high order piecewise smoothness of the entropy solution. To this end we introduce an appropriate new Cⁿ-semi norm - localized to the smooth part of the entropy solution, and we show that the entropy solution is stable with respect to this norm. We also address the question regarding the number of C¹-smoothness pieces; we show that if the initial speed has a finite number of decreasing inflection points then it bounds the number of future shock discontinuities. Loosely speaking this says that in the case of such generic initial data the entropy solution consists of a finite number of smooth pieces, each of which is as smooth as the data permits. It is this type of piecewise smoothness which is assumed - sometime implicitly - in many finite-dimensional computations for such discontinuous problems.     

Entropy generation under the effect of suction/injection

This work investigates entropy generation in a steady flow of viscous incompressible fluids between two infinite parallel porous plates. The fluid temperature variation is due to asymmetric heating of the porous plates as well as viscous dissipation. Two different physical situations are discussed with their entropy generation profiles: (i) Couette flow with suction/injection and (ii) pressure-driven Poiseuille flow with suction/injection. In each case, closed form expressions for entropy generation number and Bejan number are derived in dimensionless form by using the expressions for velocity and temperature which are derived by solving the resulting momentum and energy equations by the method of undetermined coefficient. The effect of the governing parameters on velocity, temperature, entropy generation and Bejan number are extensively discussed with the help of graphs. It is interesting to remark that entropy generation number increases with suction on one porous plate while it decreases on the other porous plate with injection.     

The finitary coding of two Bernoulli schemes with unequal entropies has finite expectation

It is well known that for any two Bernoulli schemes with a finite number of states and unequal entropies, there exists a finitary homomorphism from the scheme with the larger entropy to the one with smaller entropy. We prove that the average number of coordinates in the larger entropy scheme needed to determine one coordinate in the image point is finite.     

Existence and stability of a discrete probability distribution by maximum entropy approach

The discrete maximum entropy (ME) probability distribution which can take on a finite number of values and whose first moments are assigned, is considered. The necessary and sufficient conditions for the existence of a maximum entropy solution are identical to the general ones for the finite moment problem. The entropy decreasing by adding one more moment is studied. Unstability of the distribution recovering is proved when an increasing number of moments is used.     

基于模糊熵-熵权法的混合多属性决策方法

针对决策信息以区间数、直觉模糊数和语言变量给出的混合多属性决策问题,提出了基于模糊熵-熵权法的混合多属性决策方法。通过规范化的方法把区间数转化为直觉模糊数,建立了直觉模糊数与语言变量的对应关系,把混合多属性决策信息统一在同一决策框架下;然后利用熵权法确定属性的客观权重区间,通过求解属性信息模糊熵最小的线性规划模型得到属性客观权重;再与主观赋权方法相结合确定属性的组合权重;最后应用相对熵排序法得到方案的最终排序结果。算例分析表明方法的可行性和实用性。     

Harmonic models and spanning forests of residually finite groups

We prove a number of identities relating the sofic entropy of a certain class of non-expansive algebraic dynamical systems, the sofic entropy of the Wired Spanning Forest and the tree entropy of Cayley graphs of residually finite groups. We also show that homoclinic points and periodic points in harmonic models are dense under general conditions.     

Selective responses by entropy minimization

In this paper, we propose a method of entropy minimization for increasing selectivity and obtaining simple network architectures. An entropy function is defined with respect to the state of hidden units. By minimizing this entropy, the selectivity of hidden units can significantly be increased. Since a unit tends to respond to specific input patterns, the meaning or the function of the hidden units can easily be understood. In addition, we have observed that by minimizing the entropy, some units are forced to be inactive, responding to no input patterns. Thus, these inactive units can be deleted, and we can construct smaller network architectures. We applied the entropy method to standard and recurrent back-propagation. Experimental results confirmed that the number of units selectively responding to a specific pattern increased gradually, while units with low selectivity responding to multiple patterns decreased as entropy decreased. In addition, the number of units responding to no input patterns increased in proportion to the decrease of the entropy. These results show that the entropy minimization method can be used to improve the selectivity, and therefore, the interpretability of the network's behaviors. Then, the method can be used to suppress unnecessary units and to produce simple internal representation or simple network architectures.     

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

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

A class of finitary codes

It is shown that for any two Bernoulli schemes with a finite number of states and unequal entropies, there exists a finitary homomorphism from the scheme with larger entropy to the one with smaller entropy.     

Computing the complexity for Schelling segregation models

The Schelling segregation models are “agent based” population models, where individual members of the population (agents) interact directly with other agents and move in space and time. In this note we study one-dimensional Schelling population models as finite dynamical systems. We define a natural notion of entropy which measures the complexity of the family of these dynamical systems. The entropy counts the asymptotic growth rate of the number of limit states. We find formulas and deduce precise asymptotics for the number of limit states, which enable us to explicitly compute the entropy.     

Some results on entropy dimension for non-autonomous systems

In this paper, the preimage branch t-entropy and entropy dimension for nonautonomous systems are studied and some systems with preimage branch t-entropy zero are introduced. Moreover, formulas calculating the s-topological entropy of a sequence of equi-continuous monotone maps on the unit circle are given. Finally, examples to show that the entropy dimension of non-autonomous systems can be attained by any positive number s are constructed.     

基于遗传算法和熵的缩减记忆式LS-SVM财务困境预测模型研究

为了提高财务困境预测的正确率,减少模型的训练样本数和训练时间,在传统支持向量机(SVM)预测模型的基础上,将遗传算法、信息熵和缩减记忆算法应用于最小二乘支持向量机(LS-SVM),提出了一种基于遗传算法和信息熵的缩减记忆式最小二乘支持向量机预测模型。并独立推导出了适合财务困境预测这一离散序列的熵以及支持向量机核函数的表达式,同时,给出了这一改进模型的实现步骤。实验结果表明,该模型无论是预测正确率,还是训练样本的数量和训练时间,都显著优于最小二乘支持向量机以及传统支持向量机模型。     

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 are 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] x [0, 1] are provided.     

A cooperation index based on the Rényi entropy of correlation matrix spectrum

We propose an index to measure cooperation among different time-series based on the Rényi entropy of the eigenvalues of the signal correlation matrix and an optimization step. The index could be considered as a generalization of a previously known index, based instead on the Shannon entropy. The extension to Rényi entropy and the optimization step allow a better use of the information conveyed by the correlation matrix, especially when dealing with a small number of signals.     

Is breaking of ensemble equivalence monotone in the number of constraints?

Breaking of ensemble equivalence between the microcanonical ensemble and the canonical ensemble may occur for random graphs whose size tends to infinity, and is signaled by a non-zero specific relative entropy between the two ensembles. In Garlaschelli et al. (2017) and Garlaschelli et al. (0000) it was shown that breaking occurs when the constraint is put on the degree sequence (configuration model). It is not known what is the effect on the relative entropy when the number of constraints is reduced, i.e., when only part of the nodes are constrained in their degree (and the remaining nodes are left unconstrained). Intuitively, the relative entropy is expected to decrease. However, this is not a trivial issue because when constraints are removed both the microcanonical ensemble and the canonical ensemble change. In this paper a formula for the relative entropy valid for generic discrete random structures, recently formulated by Squartini and Garlaschelli, is used to prove that the relative entropy is monotone in the number of constraints when the constraint is on the degrees of the nodes. It is further shown that the expression for the relative entropy corresponds, in the dense regime, to the degrees in the microcanonical ensemble being asymptotically multivariate Dirac and in the canonical ensemble being asymptotically Gaussian.     

A new fuzzy multi-objective programming: Entropy based geometric programming and its application of transportation problems

In this paper, we introduce a fuzzy mathematical programming with generalized fuzzy number as objective coefficients. We also examine a transportation problem with additional restriction. There is an additional entropy objective function in the transportation problem besides transportation cost objective function. Using new fuzzy mathematical programming, this multi-objective entropy transportation problem with generalized trapezoidal fuzzy number costs has been reduced to a primal geometric programming problem. Pareto optimal solution of the transportation model is found. Numerical examples have been provided to illustrate the problem.     

基于粗糙数和信息熵的产品设计方案灰色关联评估模型

针对复杂产品方案设计中指标属性信息的不完全性和不确定性,研究了一种基于粗糙数和信息熵理论的灰色关联评估模型。首先通过引入粗糙数序列的范数实现粗糙数评估矩阵的规范化处理,并利用熵权对指标属性值进行权重集结,然后构建理想最优特征序列,并借助基于信息还原算子的粗糙相似关联度来获得最优评估方案。信息熵赋权可减少主观赋权产生的人为因素影响,信息还原算子可避免评估过程中的信息失真现象。最后通过工程机械产品的实例,验证了该评估模型的有效性和实用性,便于对复杂产品的方案设计进行评估和优选。     

Multiscale measures of equilibrium on finite dynamic systems

This article presents a new method for the study of the evolution of dynamic systems based on the notion of quantity of information. The system is divided into elementary cells and the quantity of information is studied with respect to the cell size. We have introduced an analogy between quantity of information and entropy, and defined the intrinsic entropy as the entropy of the whole system independent of the size of the cells. It is shown that the intrinsic entropy follows a Gaussian probability density function (PDF) and thereafter, the time needed by the system to reach equilibrium is a random variable. For a finite system, statistical analyses show that this entropy converges to a state of equilibrium and an algorithmic method is proposed to quantify the time needed to reach equilibrium for a given confidence interval level. A Monte-Carlo simulation of diffusion of A* atoms in A is then provided to illustrate the proposed simulation. It follows that the time to reach equilibrium for a constant error probability, t_e, depends on the number, n, of elementary cells as: t_e∝n^2.22_±0.06. For an infinite system size (n infinite), the intrinsic entropy obtained by statistical modelling is a pertinent characteristic number of the system at the equilibrium.