This paper systematically analyzes the structure and function of mobile office system in cloud platform, puts forward the method how to blend the advantages of cloud computing to organically integrate mobile office sc...This paper systematically analyzes the structure and function of mobile office system in cloud platform, puts forward the method how to blend the advantages of cloud computing to organically integrate mobile office scene. Firstly, this paper introduces the key technology of mobile OA platform based on cloud computing; secondly, this paper proposes the ideas of cloud computing middleware combination with original system, and on this basis, forming a mobile office architecture model based on cloud computing, gives the mobile office platform architecture scheme, combined with the actual development problems in some model specifications and solutions to build mobile office system based on cloud computing..展开更多
In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottlene...In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottleneck.However,how fair an allocation algorithm is remains an urgent issue.In this paper,we propose Dynamic Evaluation Framework for Fairness(DEFF),a framework to evaluate the fairness of an resource allocation algorithm.In our framework,two sub-models,Dynamic Demand Model(DDM) and Dynamic Node Model(DNM),are proposed to describe the dynamic characteristics of resource demand and the computing node number under cloud computing environment.Combining Fairness on Dominant Shares and the two sub-models above,we finally obtain DEFF.In our experiment,we adopt several typical resource allocation algorithms to prove the effectiveness on fairness evaluation by using the DEFF framework.展开更多
In this paper, we analytically discuss the scaling properties of the average square end-to-end distance < R-2 > for anisotropic random walk in D-dimensional space (D >= 2), and the returning probability P-n(r...In this paper, we analytically discuss the scaling properties of the average square end-to-end distance < R-2 > for anisotropic random walk in D-dimensional space (D >= 2), and the returning probability P-n(r(0)) for the walker into a certain neighborhood of the origin. We will not only give the calculating formula for < R-2 > and P-n(r(0)), but also point out that if there is a symmetric axis for the distribution of the probability density of a single step displacement, we always obtain < R-perpendicular to n(2) > similar to n, where perpendicular to refers to the projections of the displacement perpendicular to each symmetric axes of the walk; in D-dimensional space with D symmetric axes perpendicular to each other, we always have < R-n(2)> similar to n and the random walk will be like a purely random motion; if the number of inter-perpendicular symmetric axis is smaller than < R-n(2)> similar to n(2) the dimensions of the space, we must have n for very large n and the walk will be like a ballistic motion. It is worth while to point out that unlike the isotropic random walk in one and two dimensions, which is certain to return into the neighborhood of the origin, generally there is only a nonzero probability for the anisotropic random walker in two dimensions to return to the neighborhood.展开更多
文摘This paper systematically analyzes the structure and function of mobile office system in cloud platform, puts forward the method how to blend the advantages of cloud computing to organically integrate mobile office scene. Firstly, this paper introduces the key technology of mobile OA platform based on cloud computing; secondly, this paper proposes the ideas of cloud computing middleware combination with original system, and on this basis, forming a mobile office architecture model based on cloud computing, gives the mobile office platform architecture scheme, combined with the actual development problems in some model specifications and solutions to build mobile office system based on cloud computing..
基金supported in part by Program for Changjiang Scholars and Innovative Research Team in University No.IRT1078The Key Program of NSFC-Guangdong Union Foundation No.U1135002The Fundamental Research Funds for the Central Universities No.JY0900120301
文摘In cloud computing,fairness is one of the most significant indicators to evaluate resource allocation algorithms,which reveals whether each user is allocated as much as that of all other users having the same bottleneck.However,how fair an allocation algorithm is remains an urgent issue.In this paper,we propose Dynamic Evaluation Framework for Fairness(DEFF),a framework to evaluate the fairness of an resource allocation algorithm.In our framework,two sub-models,Dynamic Demand Model(DDM) and Dynamic Node Model(DNM),are proposed to describe the dynamic characteristics of resource demand and the computing node number under cloud computing environment.Combining Fairness on Dominant Shares and the two sub-models above,we finally obtain DEFF.In our experiment,we adopt several typical resource allocation algorithms to prove the effectiveness on fairness evaluation by using the DEFF framework.
文摘In this paper, we analytically discuss the scaling properties of the average square end-to-end distance < R-2 > for anisotropic random walk in D-dimensional space (D >= 2), and the returning probability P-n(r(0)) for the walker into a certain neighborhood of the origin. We will not only give the calculating formula for < R-2 > and P-n(r(0)), but also point out that if there is a symmetric axis for the distribution of the probability density of a single step displacement, we always obtain < R-perpendicular to n(2) > similar to n, where perpendicular to refers to the projections of the displacement perpendicular to each symmetric axes of the walk; in D-dimensional space with D symmetric axes perpendicular to each other, we always have < R-n(2)> similar to n and the random walk will be like a purely random motion; if the number of inter-perpendicular symmetric axis is smaller than < R-n(2)> similar to n(2) the dimensions of the space, we must have n for very large n and the walk will be like a ballistic motion. It is worth while to point out that unlike the isotropic random walk in one and two dimensions, which is certain to return into the neighborhood of the origin, generally there is only a nonzero probability for the anisotropic random walker in two dimensions to return to the neighborhood.
