Fault tolerant ability is an important aspect for overall evaluation of distributed system(DS). This paper discusses three measures for the evaluation: node/edge connectivity, number of spanning trees and synthetic co...Fault tolerant ability is an important aspect for overall evaluation of distributed system(DS). This paper discusses three measures for the evaluation: node/edge connectivity, number of spanning trees and synthetic connectivity. A numerical example for illustration and analysis is given, and the synthetic connectivity measure presented by this paper is proved to be rational and satisfactory.展开更多
In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual ne...In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.展开更多
Let X and Y be metrizable topological linear spaces. In this paper, the following results are proved. (1) If X and Y are complete, g: X→Y is a point closed u. s. c.,and symmetric process with F(X)=Y,then either F(X) ...Let X and Y be metrizable topological linear spaces. In this paper, the following results are proved. (1) If X and Y are complete, g: X→Y is a point closed u. s. c.,and symmetric process with F(X)=Y,then either F(X) is meager in Y,or else F is an open muRifunction with F(X)=Y. (2) If X is complete, and F: X→Y is a process with a subclosed graph, then F is I s. c.. We also discuss topological multi-homomorphisms between topological linear spaces.展开更多
The purpose of this paper is to reconsider the utility representation problem of preferences,Sev-eral representation theorems are obtained on general choice spaces.Preferences having continuous utility functions are c...The purpose of this paper is to reconsider the utility representation problem of preferences,Sev-eral representation theorems are obtained on general choice spaces.Preferences having continuous utility functions are characterized by their continuities and countable satiation.It is showed that on a pairwise separable choice space,the sufficient and necessary condition for a preference to be represented by a contin-uous utility function is that the preference is continuous and countably satiable.For monotone prefer-ences,we obtain that any space has continuous utility representations.展开更多
文摘Fault tolerant ability is an important aspect for overall evaluation of distributed system(DS). This paper discusses three measures for the evaluation: node/edge connectivity, number of spanning trees and synthetic connectivity. A numerical example for illustration and analysis is given, and the synthetic connectivity measure presented by this paper is proved to be rational and satisfactory.
基金supported by "the Fundamental Research Funds for the Central Universities" of China University of Petroleum(East China)(Grant No.18CX02139A)the Shandong Provincial Natural Science Foundation,China(Grant No.ZR2014FQ018)+3 种基金the National Natural Science Foundation of China(Grant No.61471056)the National Basic Research Program(973)of China(Grant No.2012CB315801)the Research on coordinated management and control technology of network and satellite multi-domain network resources(Grant No.17-H863-01-ZT-001-001-02)the China research project on key technology strategy of infrastructure security for information network development
文摘In the network virtualization environments, one of the most challenges is how to map the virtual networks(VNs) onto a shared substrate network managed by an infrastructure provider(In P), which is termed as virtual network embedding problem. Prior studies on this issue only emphasize on maximizing the revenue or minimizing the energy consumption while ignoring the reliability requirements of end-users. In our work, we incorporate the reliability probability into the virtual network embedding process with an aim to improve the Qo S/Qo E of end users from a new perspective. We devised two novel reliable virtual network embedding algorithms called RRW-Max Match and RDCC-VNE based on RW-Max Match and DCC-VNE, respectively. Extensive simulations demonstrated that the efficiency of our proposed algorithms is better than those of two primitive algorithms in terms of the reliability demands, the acceptance ratio of virtual networks and the long-term average revenue.
基金This paper was reported at the 5th National Functional Analysis Conference held at Nanjing in Nov.,1990.
文摘Let X and Y be metrizable topological linear spaces. In this paper, the following results are proved. (1) If X and Y are complete, g: X→Y is a point closed u. s. c.,and symmetric process with F(X)=Y,then either F(X) is meager in Y,or else F is an open muRifunction with F(X)=Y. (2) If X is complete, and F: X→Y is a process with a subclosed graph, then F is I s. c.. We also discuss topological multi-homomorphisms between topological linear spaces.
基金This work is supported by the natural science foundation.
文摘The purpose of this paper is to reconsider the utility representation problem of preferences,Sev-eral representation theorems are obtained on general choice spaces.Preferences having continuous utility functions are characterized by their continuities and countable satiation.It is showed that on a pairwise separable choice space,the sufficient and necessary condition for a preference to be represented by a contin-uous utility function is that the preference is continuous and countably satiable.For monotone prefer-ences,we obtain that any space has continuous utility representations.
