Cloud computing providers in the infrastructure as a service (IaaS) layer provide their utility computing and IT services as virtual machines to customers, who then pay for resources based on time usage. One of the mo...
详细信息
Cloud computing providers in the infrastructure as a service (IaaS) layer provide their utility computing and IT services as virtual machines to customers, who then pay for resources based on time usage. One of the most subtle challenges is pricing stagnant resources dynamically, which combines the static pricing strategy of active resources to maximize cloud computing profits. this paper investigates cloud dynamic pricing and proposes an efficient model that manages virtual machines in regards to revenue management, formulating the maximum expected reward under discrete finite horizon Markovian decisions, characterizing model properties under optimum controlling conditions, approximating optimal dynamic programming policy using a linear programming approach, developing a new algorithm based on this approximation, and finally presenting evaluation results. Our results provide fundamental insights into cloud computing revenue.
A multi-period power optimization model for the ARE's electricity sector is presented. the model aims to minimize the cumulative costs and CO2 emission of the ARE's power sector during the planning horizon. th...
详细信息
Participation is a key requirement to ensure that ICT4D and HCI4D projects succeed. Specifically, the relationship between the research and community is necebary for any ICT4D project;without this cooperation, the pro...
详细信息
this paper presents a generic framework used todevelop and deploy high performance applications (HPC) oncloud infrastrcutures. We particularly target iterative e-scienceapplications where (i) convergence conditions an...
详细信息
this paper presents a generic framework used todevelop and deploy high performance applications (HPC) oncloud infrastrcutures. We particularly target iterative e-scienceapplications where (i) convergence conditions and number of jobsare not known in advance, (ii) jobs are created on the fly and(iii) jobs could be persistent. We propose a framework which provides intuitive statementsenabling an easy writing of HPC e-science applications. Non-expert developers (scientific researchers) can use them toguarantee fast development and efficient deployment of their applications.
this paper presents a first step of our research on designing an effective and efficient GP-based method for solving the symbolic regression. We have proposed three extensions of the standard Single Node GP, namely (1...
详细信息
this paper presents a first step of our research on designing an effective and efficient GP-based method for solving the symbolic regression. We have proposed three extensions of the standard Single Node GP, namely (1) a selection strategy for choosing nodes to be mutated based on the depth of the nodes, (2) operators for placing a compact version of the best tree to the beginning and to the end of the population, and (3) a local search strategy with multiple mutations applied in each iteration. All the proposed modifications have been experimentally evaluated on three symbolic regression problems and compared with standard GP and SNGP. the achieved results are promising showing the potential of the proposed modifications to significantly improve the performance of the SNGP algorithm.
We present Task-D, a task-based distributed programming framework. Traditionally, programming for distributed programs requires using either low-level MPI or high-level pattern based models such as Hadoop/Spark. Task ...
详细信息
ISBN:
(纸本)9781479989386
We present Task-D, a task-based distributed programming framework. Traditionally, programming for distributed programs requires using either low-level MPI or high-level pattern based models such as Hadoop/Spark. Task based models are frequently and well used for multicore and heterogeneous environment rather than distributed. Our Task-D tries to bridge this gap by creating a higher-level abstraction than MPI, while providing more flexibility than Hadoop/Spark for task-based distributed programming. the Task-D framework alleviates programmers from considering the complexities involved in distributed programming. We provide a set of APIs that can be directly embedded into user code to enable the program to run in a distributed fashion across heterogeneous computing nodes. We also explore the design space and necessary features the runtime should support, including data communication among tasks, data sharing among programs, resource management, memory transfers, job scheduling, automatic workload balancing and fault tolerance, etc. A prototype system is realized as one implementation of Task-D. A distributed ALS algorithm is implemented using the Task-D APIs, and achieved significant performance gains compared to Spark based implementation. We conclude that task-based models can be well suitable to distributed programming. Our Task-D is not only able to improve the programmability for distributed environment, but also able to leverage the performance with effective runtime support.
Withthe development of the Internet and the explosive growth of business data, there are massive Network User Virtual Identities (NUVIs) on Internet when network user accessing different applications. Compared with p...
详细信息
ISBN:
(纸本)9781479986477
Withthe development of the Internet and the explosive growth of business data, there are massive Network User Virtual Identities (NUVIs) on Internet when network user accessing different applications. Compared with previous methods, we will propose an algorithm to analyze which NUVIs belong to the same person. What's more, our approach is based on the cloud computing platform and the cluster system, including the Hadoop Distributed File System (HDFS) and the parallel processing software framework MapReduce.
According to the characteristics of large delay, large inertia and nonlinear of coagulant dosage, a two-layered predictive control strategy is proposed for the coagulant dosing systems. Model predictive controller (MP...
详细信息
ISBN:
(纸本)9781479986477
According to the characteristics of large delay, large inertia and nonlinear of coagulant dosage, a two-layered predictive control strategy is proposed for the coagulant dosing systems. Model predictive controller (MPC) calculation is separated into steady-state and dynamic optimization, through the objective function to reflect economic performance. the proposed method only requires little information of the controlled plant, and its algorithm is simple, easy to implement. theoretical analysis and simulation results show that this method reduces operating costs and achieve maximum economic efficiency.
We develop a notion of stochastic rewriting over marked graphs - i.e. directed multigraphs with degree constraints. the approach is based on double-pushout (DPO) graph rewriting. Marked graphs are expressive enough to...
详细信息
ISBN:
(纸本)9783319208602;9783319208596
We develop a notion of stochastic rewriting over marked graphs - i.e. directed multigraphs with degree constraints. the approach is based on double-pushout (DPO) graph rewriting. Marked graphs are expressive enough to internalize the 'no-dangling-edge' condition inherent in DPO rewriting. Our main result is that the linear span of marked graph occurrence-counting functions - or motif functions - form an algebra which is closed under the infinitesimal generator of (the Markov chain associated with) any such rewriting system. this gives a general procedure to derive the moment semantics of any such rewriting system, as a countable (and recursively enumerable) system of differential equations indexed by motif functions. the differential system describes the time evolution of moments (of any order) of these motif functions under the rewriting system. We illustrate the semantics using the example of preferential attachment networks;a well-studied complex system, which meshes well with our notion of marked graph rewriting. We show how in this case our procedure obtains a finite description of all moments of degree counts for a fixed degree.
the problem of missing data is frequently encountered in real world applications. In this paper, an attribute weighted fuzzy c-means algorithm for incomplete data sets is presented. the statistical representation prop...
详细信息
ISBN:
(纸本)9781479986477
the problem of missing data is frequently encountered in real world applications. In this paper, an attribute weighted fuzzy c-means algorithm for incomplete data sets is presented. the statistical representation proposed in our previous work is used here to impute the missing attribute values, and attribute weighting is involved to emphasize the contribution of important attributes. Experimental results indicate that the proposed approach has good clustering performance.
暂无评论