In most optimal VM placement algorithms, the first step to determine proper time horizon, T for prediction of expected maximum future load, L. However, is dependent on knowledge required servers switch from their initial SLEEP/ACTIVE state next desired state. The activities implemented by this policy are (a) relocate an encumbered server, a server that operates in undesirably high regime with a...

Distributed Generations (DGs) are utilized to supply the active and reactive power in the transmission and distribution systems. These types of power sources have many benefits such as power quality enhancement, voltage deviation reduction, power loss reduction, load shedding reduction, reliability improvement, etc. In order to reach the above benefits, the optimal placement and sizing of DG is...

background: accurate diagnosis is key to success. diagnosing the pulpal status in varied clinical situations poses a challenge to the clinician. electric pulp test (ept) is one of the valuable attempts in evaluating the sensibility of pulp tissue. the aim of this study was to find out and compare the threshold levels and optimal electrode placement site for ept in fluorosed and nonfluorosed ant...

Let M be an m-sided simple polygon and N be an n-sided polygon with holes. In this paper we consider the problem of computing the feasible region i.e., the set of all placements by translation of M so that M lies inside N without intersecting any hole. First we propose an O(mn 2) time algorithm for computing the feasible region for the case when M is a monotone polygon. Then we consider the gen...

In wireless networks, coded caching is an effective technique to reduce network congestion during peak traffic times. Recently, a new concept called placement delivery array (PDA) was proposed to characterize the coded caching scheme. So far, only one class of PDAs by Maddah-Ali and Niesen is known to be optimal. In this paper, we mainly focus on constructing optimal PDAs. Firstly, we derive so...

In this paper, we consider the time-optimal control of a single-input, single-output second-order system with bounded input anddescribe amethod for calculating the number of switches and the switching times to drive the system from any initial state to a target state in a particular class. A pair of affine mappings are derived that transform the original system into one where the switching curv...