两个广义伽玛分布之间新的Kullback-Leibler距离

在Kullback-Leibler距离的基础上,对Kullback-Leibler距离进行改进,给出了新的Kullback-Leibler距离,并讨论了它的性质.计算了两个不同广义伽玛分布之间新的Kullback-Leibler距离.推导出伽玛分布、Weibull分布、Rayleigh分布、正态分布、指数分布新的Kullback-Leibler距离.另外在新的KullbackLeibler距离下,还得到digamma函数Ψ(x)=(Γ'(x)/(Γ(x))为单调递增函数.     

Resistance characterizations of equiarboreal graphs

A weighted (unweighted) graph $G$ is called equiarboreal if the sum of weights (the number) of spanning trees containing a given edge in $G$ is independent of the choice of edge. In this paper, we give some resistance characterizations of equiarboreal weighted and unweighted graphs, and obtain the necessary and sufficient conditions for $k$-subdivision graphs, iterated double graphs, line graphs of regular graphs and duals of planar graphs to be equiarboreal. Applying these results, we obtain new infinite families of equiarboreal graphs, including iterated double graphs of 1-walk-regular graphs, line graphs of triangle-free 2-walk-regular graphs, and duals of equiarboreal planar graphs.     

An object-parameter approach to predicting unknown data in incomplete fuzzy soft sets

Incomplete data in soft sets lead to uncertainty and inaccuracy in representing and handling information. This paper introduces notions of complete distance between two objects and relative dominance degree between two parameters. Based on both the notions, an object-parameter method is proposed to predict unknown data in incomplete fuzzy soft sets. The proposal makes full use of known data, including the information from the relationship between known values of all objects on a certain parameter and the information from the relationship between known values of an object on all parameters. The effectiveness of the proposal is verified by many examples under the compared investigation of classical predicted methods.     

Multi-location transshipment problem with capacitated production

We consider coordination among stocking locations through replenishment strategies that explicitly take into account lateral transshipments, i.e., transfer of a product among locations at the same echelon level. Our basic contribution is the incorporation of supply capacity into the traditional transshipment model. Our goal is to analyze the impact on system behavior and on stocking locations’ performance of the fact that the supplier may fail to fulfill all the replenishment orders. We therefore formulate the capacitated supply scenario as a network flow problem embedded in a stochastic optimization problem, which is solved through a sample average approximation method. We find that, depending on the production capacity, system behavior can vary drastically. Moreover, in a production-inventory system, we find evidence that either capacity flexibility (i.e., extra production) or transshipment flexibility (i.e., pooling) is required to maintain a desired level of service.     

总体协差阵为单位阵的最小距离判别

本引进最小距离域定义,得到了确定最小距离域的计算方法。在马氏距离判别定理的基础上,确定了最小距离判别规则,得到了利用该规则的判别方法。     

Optimal uncertainty size in distributionally robust inverse covariance estimation

In a recent paper, Nguyen et al. (2018) built a distributionally robust estimator for the precision matrix of the Gaussian distribution. The distributional uncertainty size is a key ingredient in the construction of this estimator. We develop a statistical theory which shows how to optimally choose the uncertainty size to minimize the associated Stein loss. Surprisingly, rather than the expected canonical square-root scaling rate, the optimal uncertainty size scales linearly with the sample size.     

Finite-dimensional global attractors in Banach spaces

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls of smaller radius. As an application of the abstract theory we show that the global attractors of a very broad class of parabolic partial differential equations (semilinear equations in Banach spaces) are finite-dimensional.     

图的距离谱综述

设D(G)为连通图G的距离矩阵,λ1(D)≥>…≥AnD)是D(G)的特征值.距离特征值的研究可追溯到Graham 和Pollack [Bell Syst.Tech.J.,1971,50:2495-2519]的工作,其中描述了负距离特征值数目与数据通信系统寻址问题之间的关系.2014年,Aouchiche和Hansen...     

Calculating distances for dissimilar strings: The shortest path formulation revisited

Fast detection of string differences is a prerequisite for string clustering problems. An example of such a problem is the identification of duplicate information in the data cleansing stage of the data mining process. The relevant algorithms allow the application of large-scale clustering techniques in order to create clusters of similar strings. The vast majority of comparisons, in such cases, is between very dissimilar strings, therefore methods that perform better at detecting large differences are preferable. This paper presents approaches which comply with this requirement, based on reformulation of the underlying shortest path problem. It is believed that such methods can lead to a family of new algorithms. An upper bound algorithm is presented, as an example, which produces promising results.     

Effects of Phase Damping on Controlled Teleportation of a Qubit by a GHZ State

We investigate controlled teleportation ofa qubit via a GHZ state with the influence of phase damping in the Bloch sphere representation. We use the average trace distance to describe how close the output state is to the input state to be teleported. Our results show that the average trace distance is a function of decoherence rates and angles of the analyzer performed by the controller in the single-particle projective measurement. Moreover, for a fixed value of the decoherence rate, one can adjust the analyzer angle to achieve the optimal average trace distance.