Let Η be a hypergraph with n vertices. Suppose that di,￠/2,...,dn are degrees of the vert ices of Η. The t-th graph entropy based on degrees of H is defined as Id^t(Η)=-n∑i=1(di^t/∑j=1^ndj^t^nlogdi^t/∑j=1^ndj^t...Let Η be a hypergraph with n vertices. Suppose that di,￠/2,...,dn are degrees of the vert ices of Η. The t-th graph entropy based on degrees of H is defined as Id^t(Η)=-n∑i=1(di^t/∑j=1^ndj^t^nlogdi^t/∑j=1^ndj^t^n)=log(n∑i=1di^t)-n∑i=1(di^t/∑j=1^ndj^tlogdi^t), where t is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of Id^t(Η) for t = 1, when Η is among all uniform super trees, unicyclic uniform hypergraphs and bicyclic uniform hypergraphs, respectively.展开更多
Unification is both necessary and challenging for studying atmospheric particle systems, which are polydispersesystems containing particles of different sizes and shapes. A general framework is proposed to realize the...Unification is both necessary and challenging for studying atmospheric particle systems, which are polydispersesystems containing particles of different sizes and shapes. A general framework is proposed to realize the first order generalization. Within this generalized framework, (1) atmospheric particle shapes are unified into self-similar fractals; (2) a self-similar particle is characterized by various power-law relationships; (3) by combining these power-law relationships for a single particle with Shannon's maximum entropy principle and some concepts in statistical mechanics, unified maximum likelihoood number size distributions are of the Weibull form for atmospheric particle systems. Frontier disciplines (e. g., scaling,fractal,chaos and hierarchy) are argued to provide potential 'tools' for such unification. Several new topics are raised for future research.展开更多
We propose to approximate the conditional density function of a random variable Y given a dependent random d-vector X by that of Y given θ^τX, where the unit vector θ is selected such that the average Kullback-Leib...We propose to approximate the conditional density function of a random variable Y given a dependent random d-vector X by that of Y given θ^τX, where the unit vector θ is selected such that the average Kullback-Leibler discrepancy distance between the two conditional density functions obtains the minimum. Our approach is nonparametric as far as the estimation of the conditional density functions is concerned. We have shown that this nonparametric estimator is asymptotically adaptive to the unknown index θ in the sense that the first order asymptotic mean squared error of the estimator is the same as that when θ was known. The proposed method is illustrated using both simulated and real-data examples.展开更多
Cairo city, being the Egypt’s industrial and cultural center, has a problem of rapid urban sprawl. The city has an extremely high population density which is continuously increasing through informal settlements that ...Cairo city, being the Egypt’s industrial and cultural center, has a problem of rapid urban sprawl. The city has an extremely high population density which is continuously increasing through informal settlements that grow by sprawling due to migration from the Nile Delta villages and the high population growth rates. The present study attempts to understand, detect and quantify the spatial pattern of Cairo’s urban sprawl using Shannon’s entropy and multi-temporal Landsat TM and ETM images acquired for the period from 1984 to 2013. Supervised classification was applied to extract the built-up areas and to measure the changes in the urban land-use class among the city wards. Shannon’s entropy was applied to model the city’s urban sprawl, trend and spatial change. The entropy values for the city’s electoral wards were modeled and used in an interpolation function to create an entropy surface (index) for each acquired temporal image. Such index indicates the spatial pattern of the urban sprawl and provides a visual comparison of the entropy phenomenon in such wards. Results indicate that Shannon’s entropy index increased from (1.4615) in year 1984 to (2.1023) in year 2013, indicating more dispersed urban growth, a sign of urban sprawl. The maximum entropy values are found in the eastern wards namely El Nozha, Awal Nasr District, Thany Nasr-District, El Salam, El Marg and El Bassatein. A regression analysis was carried for the population growth rate and the built-up areas. Findings help in understanding the sprawl patterns and dynamics among Cairo’s electoral wards and provide a visual comparison. The applied methodology provides explanations and facilitates tracing and measuring the urban sprawl which is needed by decision makers and city planners of mega cities.展开更多
Mean King’s problem is formulated as a retrodiction problem among noncommutative observables. In this paper, we reformulate Mean King’s problem using Shannon’s entropy as a first step of introducing quantum uncerta...Mean King’s problem is formulated as a retrodiction problem among noncommutative observables. In this paper, we reformulate Mean King’s problem using Shannon’s entropy as a first step of introducing quantum uncertainty relation with delayed classical information. As a result, we give informational and statistical meanings to the estimation on Mean King problem. As its application, we give an alternative proof of nonexistence of solutions of Mean King’s problem for qubit system without using entanglement.展开更多
基金Supported by NSFC(Grant Nos.11531011,11671320,11601431,11871034 and U1803263)the China Postdoctoral Science Foundation(Grant No.2016M600813)the Natural Science Foundation of Shaanxi Province(Grant No.2017JQ1019)
文摘Let Η be a hypergraph with n vertices. Suppose that di,￠/2,...,dn are degrees of the vert ices of Η. The t-th graph entropy based on degrees of H is defined as Id^t(Η)=-n∑i=1(di^t/∑j=1^ndj^t^nlogdi^t/∑j=1^ndj^t^n)=log(n∑i=1di^t)-n∑i=1(di^t/∑j=1^ndj^tlogdi^t), where t is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of Id^t(Η) for t = 1, when Η is among all uniform super trees, unicyclic uniform hypergraphs and bicyclic uniform hypergraphs, respectively.
文摘Unification is both necessary and challenging for studying atmospheric particle systems, which are polydispersesystems containing particles of different sizes and shapes. A general framework is proposed to realize the first order generalization. Within this generalized framework, (1) atmospheric particle shapes are unified into self-similar fractals; (2) a self-similar particle is characterized by various power-law relationships; (3) by combining these power-law relationships for a single particle with Shannon's maximum entropy principle and some concepts in statistical mechanics, unified maximum likelihoood number size distributions are of the Weibull form for atmospheric particle systems. Frontier disciplines (e. g., scaling,fractal,chaos and hierarchy) are argued to provide potential 'tools' for such unification. Several new topics are raised for future research.
基金supported by US National Science Foundation grant DMS-0704337 National Natural Science Foundation of China(No.10628104)supported by an EPSRC research grant EP/C549058/1
文摘We propose to approximate the conditional density function of a random variable Y given a dependent random d-vector X by that of Y given θ^τX, where the unit vector θ is selected such that the average Kullback-Leibler discrepancy distance between the two conditional density functions obtains the minimum. Our approach is nonparametric as far as the estimation of the conditional density functions is concerned. We have shown that this nonparametric estimator is asymptotically adaptive to the unknown index θ in the sense that the first order asymptotic mean squared error of the estimator is the same as that when θ was known. The proposed method is illustrated using both simulated and real-data examples.
文摘Cairo city, being the Egypt’s industrial and cultural center, has a problem of rapid urban sprawl. The city has an extremely high population density which is continuously increasing through informal settlements that grow by sprawling due to migration from the Nile Delta villages and the high population growth rates. The present study attempts to understand, detect and quantify the spatial pattern of Cairo’s urban sprawl using Shannon’s entropy and multi-temporal Landsat TM and ETM images acquired for the period from 1984 to 2013. Supervised classification was applied to extract the built-up areas and to measure the changes in the urban land-use class among the city wards. Shannon’s entropy was applied to model the city’s urban sprawl, trend and spatial change. The entropy values for the city’s electoral wards were modeled and used in an interpolation function to create an entropy surface (index) for each acquired temporal image. Such index indicates the spatial pattern of the urban sprawl and provides a visual comparison of the entropy phenomenon in such wards. Results indicate that Shannon’s entropy index increased from (1.4615) in year 1984 to (2.1023) in year 2013, indicating more dispersed urban growth, a sign of urban sprawl. The maximum entropy values are found in the eastern wards namely El Nozha, Awal Nasr District, Thany Nasr-District, El Salam, El Marg and El Bassatein. A regression analysis was carried for the population growth rate and the built-up areas. Findings help in understanding the sprawl patterns and dynamics among Cairo’s electoral wards and provide a visual comparison. The applied methodology provides explanations and facilitates tracing and measuring the urban sprawl which is needed by decision makers and city planners of mega cities.
文摘Mean King’s problem is formulated as a retrodiction problem among noncommutative observables. In this paper, we reformulate Mean King’s problem using Shannon’s entropy as a first step of introducing quantum uncertainty relation with delayed classical information. As a result, we give informational and statistical meanings to the estimation on Mean King problem. As its application, we give an alternative proof of nonexistence of solutions of Mean King’s problem for qubit system without using entanglement.
