Mobile cloud storage (MCS) is being extensively used nowadays to provide data access services to various mobile platforms such as smart phones and tablets. For cross-platform mobile apps, MCS is a foundation for shari...
详细信息
ISBN:
(纸本)9781538617915
Mobile cloud storage (MCS) is being extensively used nowadays to provide data access services to various mobile platforms such as smart phones and tablets. For cross-platform mobile apps, MCS is a foundation for sharing and accessing user data as well as supporting seamless user experience in a mobile cloud computing environment. However, the mobile usage of smart phones or tablets is quite different from legacy desktop computers, in the sense that each user has his/ her own mobile usage pattern. therefore, it is challenging to design an efficient MCS that is optimized for individual users. In this paper, we investigate a distributed MCS system whose performance is optimized by exploiting the fine-grained context information of every mobile user. In this distributed system, lightweight storage servers are deployed pervasively, such that data can be stored closer to its user. We systematically optimize the data access efficiency of such a distributed MCS by exploiting three types of user context information: mobility pattern, network condition, and data access pattern. We propose two optimization formulations: a centralized one based on mixed-integer linear programming (MILP), and a distributed one based on stable matching. We then develop solutions to both formulations. Comprehensive simulations are performed to evaluate the effectiveness of the proposed solutions by comparing them against their counterparts under various network and context conditions.
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacit...
详细信息
High penetration of renewable resources will increase the risk of overloading transmission lines and the difficulty of controlling transmission grid in a safe operation. In this paper, a model for transmission capacity margin assessment (TCMA) is established to quantify the transmission security with uncertain wind generation. the basic formulation is reformulated as a two-stage non-differentiable programming model. It can be transformed into a mixed integer linear programming (MILP) by duality theory and specific linearization techniques. Furthermore, an effective procedure is developed to improve the transmission capacity margin by necessary wind curtailment. A detailed case study is performed on the IEEE 31-bus system and numerical results verify the effectiveness of this TCMA framework.
the Discrete Event optimization (DEO) framework was recently proposed to formulate the simulation-optimization model of the Joint Workstation, Workload and Buffer Allocation Problem (JWWBAP) of the open flow line. How...
详细信息
the Discrete Event optimization (DEO) framework was recently proposed to formulate the simulation-optimization model of the Joint Workstation, Workload and Buffer Allocation Problem (JWWBAP) of the open flow line. However, the computational effort to solve the DEO model at optimality is quite high, because it is a mixed integer linear programming model. this work proposes a simulation cutting approach to efficiently solve the DEO model of the JWWBAP. Specifically, the DEO model is decomposed into an optimization model and a simulation model, which are the master problem and the subproblem in Benders decomposition, respectively. the optimization model is solved to find a system configuration, and the simulation model is solved to add cuts to the optimization model. An algorithm is proposed to generate cut using the simulation trajectory. Numerical analysis shows that the exact DEO model can be solved efficiently.
In light of significant complexity of the byproduct gas system in steel industry (which limits an ability to establish its physics-based model), this study proposes a data-based predictive optimization (DPO) method to...
详细信息
In light of significant complexity of the byproduct gas system in steel industry (which limits an ability to establish its physics-based model), this study proposes a data-based predictive optimization (DPO) method to carry out real-time adjusting for the gas system. Two stages of the method, namely the prediction modeling and real-time optimization, are involved. At the prediction stage, the states of the optimized objectives, the consumption of the outsourcing natural gas and oil, the power generation and the tank levels, are forecasted based on a proposed mixed Gaussian kernel-based prediction intervals (PIs) construction model. the Jacobian matrix of this model is represented by a kernel matrix through derivation, which greatly facilitates the subsequent calculation. At the second stage, a rolling optimization based on a mathematical programming technique involving continuous and integer decision-making variables is developed via the prediction intervals.
A well cores reused-based wrapper design is an important approach to minimize SOC test application time and test costs. the combinatorialoptimization problem of core wrapper design has been proven to be a NP-hard pro...
详细信息
A well cores reused-based wrapper design is an important approach to minimize SOC test application time and test costs. the combinatorialoptimization problem of core wrapper design has been proven to be a NP-hard problem. In this paper, a wrapper scan chain balance algorithm with entropy increase hybrid discrete differential evolution (EIHDE) is proposed to solve the core wrapper problem, which is inspired by thermodynamic system principle of entropy increase and outstanding global searching ability of Differential Evolution (DE). the proposed approach develops a cooperative mutation strategy based on entropy increase for the problem to preserving its interesting search mechanism for discrete domains. In the proposed model, two cooperative encode modes of individuals are introduced for standard differential mutation and the cooperative entropy increase mutation: integer encode mode and binary encode mode. EIHDE controls the search space by differential mutation, and search for superior individual in local space by entropy increase mutation. the combination of two kinds of mutation operations promotes the optimization ability considerably and achieves a better tradeoff between exploitation and exploration. the experimental results of the ITC'02 SOC test benchmarks show that EIHDE can achieve more balanced results compared with other algorithms.
We introduce a concept that generalizes several different notions of a "centerpoint" in the literature. We develop an oracle-based algorithm for convex mixed-integeroptimization based on centerpoints. Furth...
详细信息
ISBN:
(数字)9783319334615
ISBN:
(纸本)9783319334615;9783319334608
We introduce a concept that generalizes several different notions of a "centerpoint" in the literature. We develop an oracle-based algorithm for convex mixed-integeroptimization based on centerpoints. Further, we show that algorithms based on centerpoints are "best possible" in a certain sense. Motivated by this, we establish several structural results about this concept and provide efficient algorithms for computing these points.
Mixed-integer linear programming problems represent a large group of models that are widely constructed for optimization problems in Electric Power Systems Operation. An economical and financial analysis is obligatory...
详细信息
Mixed-integer linear programming problems represent a large group of models that are widely constructed for optimization problems in Electric Power Systems Operation. An economical and financial analysis is obligatory for the obtained solution as being a part of the effective system planning and operation. In this paper a formal approach to such analysis is given having a combinatorial problem with binary variables designing the different states in the microgrid. the numerical example includes a detailed post-solution analysis made with Matlab® and LPSolve.
We describe an algorithm that finds an is an element of-approximate solution to a concave mixed-integer quadratic programming problem. the running time of the proposed algorithm is polynomial in the size of the proble...
详细信息
ISBN:
(数字)9783319334615
ISBN:
(纸本)9783319334615;9783319334608
We describe an algorithm that finds an is an element of-approximate solution to a concave mixed-integer quadratic programming problem. the running time of the proposed algorithm is polynomial in the size of the problem and in 1/is an element of, provided that the number of integer variables and the number of negative eigenvalues of the objective function are fixed. the running time of the proposed algorithm is expected unless P = NP.
the original formal problem definition of financial management optimization of an enterprise at this conjuncture of financing the state defense order is suggested. the problem is shown to belong to the class of NP-har...
详细信息
ISBN:
(纸本)9781509040698
the original formal problem definition of financial management optimization of an enterprise at this conjuncture of financing the state defense order is suggested. the problem is shown to belong to the class of NP-hard problems of the mixed programming. the existing methods for solving this problem are considered and the properties of the program tools developed by the authors for searching for the best solutions are discussed.
In the last years, traffic over wireless networks has been increasing exponentially, due to the impact of Internet of things (IoT) and Smart Cities. Current networks must adapt to and cope withthe specific requiremen...
详细信息
In the last years, traffic over wireless networks has been increasing exponentially, due to the impact of Internet of things (IoT) and Smart Cities. Current networks must adapt to and cope withthe specific requirements of IoT applications since resources can be requested on-demand simultaneously by multiple devices on different locations. One of these requirements is low latency, since even a small delay for an IoT application such as health monitoring or emergency service can drastically impact their performance. To deal withthis limitation, the Fog computing paradigm has been introduced, placing cloud resources on the edges of the network to decrease the latency. However, deciding which edge cloud location and which physical hardware will be used to allocate a specific resource related to an IoT application is not an easy task. therefore, in this paper, an integer Linear programming (ILP) formulation for the IoT application service placement problem is proposed, which considers multiple optimization objectives such as low latency and energy efficiency. Solutions for the resource provisioning of IoT applications within the scope of Antwerp's City of things testbed have been obtained. the result of this work can serve as a benchmark in future research related to placement issues of IoT application services in Fog Computing environments since the model approach is generic and applies to a wide range of IoT use cases.
暂无评论