Cost Efficient Datacenter Selection for Cloud Services
|
|
- Garey Willis
- 8 years ago
- Views:
Transcription
1 Cost Efficient Datacenter Selection for Clou Services Hong u, Baochun Li henryxu, Department of Electrical an Computer Engineering University of Toronto Abstract Many clou services nowaays are running on top of geographically istribute infrastructures for better reliability an performance. They nee an effective way to irect the user requests to a suitable atacenter, in a cost efficient manner. Previous work focuse mostly on the electricity cost of atacenters. The approaches favor atacenters at locations with cheaper electricity prices. In this paper, we augment the picture by consiering another significant cost contributor: network banwith. We propose to utilize statistical multiplexing to strategically bunle emans at ifferent locations. The anti-correlation between emans effectively smooths out the aggregate banwith usage, thereby saving the banwith cost calculate by burstable billing methos that charge the peak banwith usage. We present an optimization framework that moels the realistic environment an practical constraints a clou faces. We evelop an efficient istribute algorithm base on ual ecomposition an the subgraient metho, an evaluate its effectiveness an practicality using realworl traffic traces an electricity costs. I. INTRODUCTION Internet-scale services are becoming essential to our everyay lives, with important applications incluing web search, vieo-on-eman, an file hosting. The emergence of clou computing platforms, such as Amazon AWS [1], further enables rapi eployment of new services at scale. Almost all of these services are built atop geographically istribute infrastructures, i.e. atacenters locate in ifferent regions to provie better reliability an performance. They nee an effective way to irect clients across the wie area to an appropriate atacenter. Usually, Internet-scale services hanle atacenter selection by eploying mapping noes, which are typically DNS servers as shown in Fig. 1, to customize the IP aress(es) returne to ifferent clients. Alternatively, they can also outsource atacenter selection to thir-parties [2], [3] or the clou provier [4]. An efficient atacenter selection algorithm is imperative to the operation of clou services. Many previous works exist in this area. The problem can be cast as an optimization that maximizes the system-wie performance subject to certain cost constraints. Existing works usually consier the electricity cost of running atacenters. By taking avantage of the geographic iversity of electricity prices, requests are irecte in favor of atacenters with lower electricity prices, an costs can be reuce [5], [6]. In this paper, we consier another significant cost contributor to atacenters: wie-area network banwith [7]. We propose to utilize statistical multiplexing to strategically bunle emans Clients Mapping noes (DNS) Mapping Requests Datacenters Fig. 1. An example of a clou service running atop a geographically istribute clou infrastructure. from ifferent mapping noes. The intuition is that, emans from ifferent mapping noes correlate with each other in a ifferent fashion: some are positively correlate, i.e. they ten to peak at the same time, while some are negatively correlate, i.e. when eman from one noe rises, eman from another noe tens to ecrease. By combining emans from negatively correlate noes, the aggregate banwith require from a particular atacenter is smoothe out across time, thereby reucing the banwith cost which is etermine by burstable billing methos, such as the 95-percentile billing that charges peak banwith usage [8] [1]. To better illustrate the iea, Fig. 2 an 3 plot some sample eman ata we collecte from a major online multimeia company UUSee [11] in China. The re line correspons to the 95-percentile banwith consumption, which amounts to 45 Mbps an 33 Mbps for noe 1 an 2 respectively. If these two noes were serve by the same atacenter, the aggregate banwith consumption as shown in Fig. 4 is smoother than the iniviual curves. The 95-percentile of the aggregate banwith is aroun 7 Mbps, which is smaller than the sum of the iniviual 95-percentile values. This emonstrates the potential of multiplexing in terms of saving banwith consumption an cost. Our main contribution in this paper is a general optimization framework for cost efficient atacenter selection that takes into account both electricity an banwith costs. Our framework is general in the sense that it moels practical environments that a clou operates in. The utility abstraction encompasses many performance consierations, incluing throughput, latency, as well as possible fairness criteria. The electricity an banwith
2 Deman (Mbps) Noe 1 Time (epochs) Deman (Mbps) Noe 2 Time (epochs) Deman (Mbps) Noe 1 + Noe 2 Time (epochs) Fig. 2. Deman at noe 1. Fig. 3. Deman at noe 2. Fig. 4. Aggregate eman. cost constraints capture the two most important ongoing costs associate with the operation of atacenters, i.e. operation expense (OPE) [7]. Both the utility an electricity price are location epenent in orer to realistically moel the geographic iversity. By using ual ecomposition, our optimization formulation can be ecentralize to the atacenter level. Specifically, the problem can be ecompose into subproblems, each solvable by an iniviual atacenter itself. This enables us to evelop efficient istribute implementations of our atacenter selection algorithm to fin the optimal noe-atacenter assignment base on the subgraient metho. Our algorithms remain relevant in an are applicable to other request irection scenarios, such as a content istribution network (CDN) [12]. We evaluate the effectiveness of our ecentralize implementation using real-worl traffic traces collecte from UUSee [11], as well as real-worl electricity prices [13]. Results emonstrate that our algorithm saves the overall operating cost of atacenters while offering a comparable performance compare to the vanilla banwith-agnostic solution. II. AN OPTIMIZATION FRAMEWORK FOR COST EFFICIENT DATACENTER SELECTION In this section, we present our optimization framework for cost-effective atacenter selection. A. System Moel We start by introucing the system moel. We consier a clou infrastructure with M atacenters geographically istribute across the wie area. The clou eploys N mapping noes (e.g. DNS servers) at ifferent locations to serve client requests. We use the term mapping noes an noes interchangeably in the sequel. The requests at a particular noe are irecte to a subset of all the atacenters etermine by the atacenter selection algorithm. Since the request traffic fluctuates ynamically, the atacenter selection algorithm nees to be run perioically to optimize performance. Let us introuce a few notations. We consier an iniviual time epoch without loss of generality, an thus we rop the time subscript t in our notations. The banwith eman of noe i 2 is a ranom variable D i with mean µ i an variance i. The ranom emans D =[D 1,...,D N ] may be correlate ue to time ifference an the natural correlation between viewer preferences, human behavior, etc. Let µ enote the N 1 mean eman matrix, or eman matrix in short, an be the N N covariance matrix. We assume that the clou operator employs techniques such as those in our previous work [14], [15] to preict the eman matrix µ with satisfactory accuracy. The covariance matrix between emans at ifferent noes can also be preicte for the short-term future by using time series forecasting methos [14], [15]. We also assume that the electricity price at each atacenter p is available at the beginning of an epoch, an remains static throughout the entire epoch. This is a practical assumption in toay s electricity market in the U.S. If the local electricity market of atacenter is in a regulate utility region, the electricity price is fixe. If on the other han the atacenter is in a eregulate market region, such as California an Texas, there is a forwar market with settlements of various kins, such as ay-ahea an hour-ahea, for customers to lock in the price [6], [13]. The M 1 matrix p =[p ] is referre to as the price matrix. We use an abstract utility notion u i to capture the performance of the clou service, when a request from noe i is irecte to atacenter. This notion allows us a consierable amount of expressiveness. For example, if the clou service is an interactive application an seeks minimal latency, u i can be a ecreasing function of the roun trip time (RTT), irectly measure or estimate by various means. If the clou service is a bulk transfer application an seeks goo throughput, U i can be a ecreasing function of the network congestion level or the link utilization. It can incorporate fairness consierations by making use of the canonical alpha-fair utility functions [16]. For more iscussions of the generality of the utility notion one can refer to [3]. The N M matrix u =[u i ] is the performance matrix, an the column vector u =[u i ] is the performance vector of atacenter. Finally, we use w i 2 [, 1] to enote the proportion of traffic irecte from noe i to atacenter, an w is a N M atacenter selection matrix. w i is the optimizing variable of our problem. Given w, we observe that the vector w = [w 1,...,w N ] represents the workloa portfolio of atacenter. B. Moeling the 95-percentile Banwith Note that in the moel, we choose not to take into account the banwith price, since in reality this is often a fixe price
3 across ifferent regions. It is equivalent to only consiering the aggregate banwith usage at iniviual atacenters. The aggregate banwith consumption of becomes a ranom variable L = w D. whose mean an variance are w µ an w w, respectively, given the atacenter selection matrix w. Suppose the peak banwith usage of atacenter is A. This implies that, the probability that the banwith consumption of excees A is equal to of the time, where is a small positive constant. That is, Pr(L >A )=, 8. For the 95-percentile charging moel, =.5. Note that this can also be interprete as a QoS constraint, where the probability of banwith uner-provisioning is boune by. Through reasonable aggregation, L follows a Gaussian istribution ue to the law of large numbers. This has also been empirically verifie using trace stuies in previous work [14], [15]. Thus, the above constraint is equivalent to w µ + qw w = A, 8 where = F 1 (1 ) an F ( ) is the CDF of the Gaussian istribution N (, 1). For example when =.5, =1.96. The total billable banwith usage of the clou is w qw µ + w. C. An Optimization Framework Now we formally introuce our optimization framework. The atacenter selection problem at a particular epoch can be succinctly expresse as follows: DC-OPT: s.t. max w w u (1) w qw µ + w apple A, (2) p w µ apple B, (3) C min apple w qw µ + w apple C, 8, (4) w i =1, 8i (5) The ecision variables are w i, i.e. the proportion of requests irecte to atacenter from noe i. The objective (1) calculates the system-wie utility given by the atacenter selection matrix w an the performance matrix u. Constraint (2) is the total banwith usage constraint, where A is the banwith cap. (3) is the total electricity cost constraint. It enforces that the total electricity cost of serving all the requests shoul not excee the buget B. is a conversion factor that converts workloa in Gbps into electricity consumption in KWh. Constraint (4) represents both the loa balancing an capacity constraints at iniviual atacenters, where C min is the minimum loa that each atacenter must achieve, an C is the capacity of atacenter. Constraint (5) correspons to the simple fact that all the requests arriving at noe i shoul be serve, i.e. our algorithm is work-conserving. III. A DECENTRALIZED IMPLEMENTATION The optimization problem DC-OPT is essentially a seconorer cone program, an can be solve in polynomial time. However, this requires a central coorinator which introuces a single point of failure an is vulnerable to attacks. Further, the computational complexity of solving the cone program also increases significantly when the problem size scales up. A centralize solution also makes it less aaptive to suen changes in traffic eman in a flash crow scenario. Thus, for reasons of reliability, security, scalability, an performance, we are motivate to evelop istribute solutions in which the atacenters iteratively solve the optimization problem. A. Dual Decomposition Relax the constraints (2), (3), an (5), we can obtain the Lagrangian of DC-OPT: L(w,,, ) = w u + A q w! µ + w w + B! p w µ +! i 1 w i, i where,, an are the Lagrange multipliers associate with the banwith usage, electricity cost, an work conservation constraints, respectively. The ual function is then ( max L(w,,, ) g(,, ) = w (6) s.t. constraint (4) To solve g(,, ), it is equivalent to maximizing the following objective q w (u µ p µ ) w w where the constant terms in L(w,,, ) can be safely remove. The key observation here is that it can be ecompose into M per-atacenter maximization sub-problems q max w w (u µ p µ ) w w s.t. constraint (4), (7) The per-atacenter sub-problem naturally emboies an economic interpretation. Each atacenter strives to maximize the total utility of serving the requests, iscounte by the costs of violating the banwith, electricity cost, an work conservation constraints, as price by the Lagrange multipliers. It is still a secon-orer cone program. However the problem size has been reuce. The per-atacenter sub-problem has only N variables
4 an 2 constraints. In a typical prouction clou, the number of mapping noes N is on the orer of hunres, which can be solve efficiently by stanar optimization solvers with the computing power of a atacenter. B. A Distribute Algorithm We have shown that the ual function of DC-OPT can be ecompose into M per-atacenter maximization problem, which is a smaller secon-orer cone program. Now we nee to solve the ual problem min g(,, ) s.t.,. (8) The subgraient metho [17] can be use to solve the ual problem. The upating rules for the ual variables are as follows: " q + (l+1) = (l) + w (l) µ + w w A!#, (l+1) = " (l) + (l) (9)!# + p w µ B, (1) (l+1) i = (l) + (l) i! w i 1, 8i, (11) where [x] + represents max{,x}, an,, are the step sizes. Accoring to [17], the above proceure is guarantee to converge as long as the following conition is satisfie. Proposition 1: The subgraient upates as in (9) (11) converge to the optimal ual variables if a iminishing step size rule is followe for choosing,, [17]. The ual variables,, serve as price signals to coorinate the resource consumption an workloa conservation. For example, when the 95-percentile banwith of all atacenters excees the banwith cap, i.e. P w µ + p w w >A, the clou increases its price for the next iteration to suppress the excessive traffic. The process continues until it converges to the optimal resource allocation. Dual optimization by the subgraient metho can be one in a istribute fashion because of ual ecomposition. First, in each iteration, the per-atacenter sub-problems (7) can be solve concurrently by iniviual atacenters. Secon, subgraient upates can also be istributively performe by each atacenter an mapping noe. Here an nee to be upate with global information from all atacenters. This can be one in a istribute way as follows, using as an example. Initially, the previous (l) is mae common knowlege among the atacenters. First, a atacenter is ranomly chosen an given a token with the total buget B. It calculates its own electricity cost of serving the requests p w µ, an euct this amount from B. It puts a mark in the token, an pass it on to the next atacenter, who also upates the remaining buget, marks the token, an passes it further own. A atacenter etermines it is the last one in the loop by examining that except itself, everyone else has marke the token. It thus upates the remaining buget, calculates the upate buget price (l+1), an broacasts to each atacenter. Finally, i can be upate by each mapping noe, with w i receive from each atacenter. Algorithm 1 Optimal Distribute DC-OPT Algorithm 1. Initialize () an () to. Each noe initializes () i. 2. Each atacenter collects (l), (l), an inepenently solves the per-atacenter subproblem (7) using stanar optimization solvers an obtain w, which is broacast to each noe. 3. Each noe performs a subgraient upate for (l) i as in (11). The upate (l+1) i is broacast to atacenters. 4. A atacenter is ranomly chosen an given a token with the banwith cap A an buget B. 5. The atacenter eucts its banwith usage an electricity cost from the remaining banwith cap an buget respectively in the token, marks it, an passes it own. 6. Repeat step 5 until the last atacenter calculates the final remaining banwith cap an buget, upates (l) an (l) as in (9) an (1), an broacasts to every atacenter. 7. Return to step 2 until convergence. The complete istribute algorithm is shown in Algorithm 1. Since it optimally solves the ual problem (8), it optimally solves the primal problem DC-OPT because the uality gap for convex optimization problems is zero. Theorem 1: The istribute algorithm as shown in Algorithm 1 always converges, an when it converges its solution optimally solves the atacenter selection problem DC-OPT. IV. EVALUATION We present our simulation stuies in this section. A. Setup 1) Deman matrix: To represent the request traffic for a clou service, we use real-worl traces collecte from UUSee Inc. [11], a major online multimeia provier with servers eploye in ifferent geographical regions in China. The ataset contains, among other information, the banwith emans for UUSee vieo programs sample every 1 minutes, in a 12- ay perio uring the 28 Beijing Olympics. Although the scale of the UUSee infrastructure may not be as large as that of a clou provier, we believe the traces faithfully reflect the eman istribution for a clou service, an it is appropriate to use them for the purpose of benchmarking the performance of our atacenter selection algorithm. We assume that the preiction of mean an covariance of traffic emans can be one accurately [14], [15], an in the simulation we simply aopt the preicte values for µ an. We use the traffic emans of istinct vieo channels to represent emans of istinct mapping noes. We simulate a clou with 1 mapping noes. Since the ata is collecte every 1 minutes, the optimization epoch is also set to 1 minutes. The banwith cap A is set to 2 Mbps. The minimum
5 loa of a atacenter C min is 1 Mbps, an the capacity of atacenters C is ranomly rawn. 2) Datacenter placement an price matrix: To capture the location iversity of the clou infrastructure an electricity market, we assume the atacenters are eploye across the continental U.S. For the ease of exploration, we assume that there is one atacenter in a ranomly chosen hub in each regional electricity market as shown in Fig. 5 [13]. We use the 211 annual average ay-ahea on peak price ($/MWh) at these regions provie by the Feeral Energy Regulatory Commission (FERC) as the electricity price for each atacenter, i.e. p, as summarize in Table I [13]. Fig. 5. The U.S. electricity market an our clou atacenter map. Source: FERC [13]. TABLE I 211 ANNUAL AVERAGE DAY AHEAD ON PEAK PRICE ($/MWH) IN DIFFERENT REGIONAL MARKETS. SOURCE: FERC[13]. Region Hub Price California NP15 $35.83 Miwest Michigan Hub $42.73 New Englan Mass Hub $52.64 New York NY Zone J $62.71 Northwest California-Oregon Borer (COB) $32.57 PJM PJM West $51.99 Southeast VACAR $44.44 Southwest Four Corners $36.36 SPP SPP North $36.41 Texas ERCOT North $ ) Performance matrix: We consier a utility function efine by the negative Eucliean istance between the mapping noes an the atacenters. This efinition instructs the algorithm to irect requests to atacenters in the geographical vicinity of a mapping noe whenever possible, in an effort to minimize the transmission elay an optimize viewer experience. To calculate the performance matrix, we first obtain the longitue an latitue of ten counties near each of the ten hubs as the exact locations of our atacenters in the U.S. We then ranomly choose another 1 counties as the locations of the 1 mapping noes. All the location information is obtaine from [18]. The Eucliean istance between any given pair of mapping noe an atacenter then can be reaily calculate, which constitutes the performance matrix U. Without loss of generality, we assume that =.1, i.e. serving 1 Mbps per epoch of 1 minutes consumes.1 kwh electricity. The buget B is set to $4 per epoch. 4) Benchmark: Finally, we use a banwith-agnostic atacenter selection scheme that shares the same objective function (1) an constraints (3) (5), except that it oes not consier the banwith usage, i.e. constraint (2), as the benchmark for the performance of DC-OPT. This problem is also a secon-orer cone program an can be efficiently solve. This is referre to as Benchmark in the following. B. Effectiveness We evaluate the effectiveness of our istribute atacenter selection algorithm. Fig. 6 shows the 95-percentile banwith consumption of each atacenter for a 1-epoch perio of time. We observe that, compare to the banwith-agnostic benchmark, DC-OPT reuces the banwith usage of most atacenters by 15% 2% by intelligently mixing negatively correlate emans. One may notice that atacenter 4, 6, 8, an 1 have the same banwith usage using both algorithms. This is ue to the unattractive electricity price an performance at these locations. From Table I, we observe that atacenter 4, 6, an 1 have the highest electricity prices among all locations. Also from our performance matrix we observe that atacenter 8 is far away from many of the noes. This prevents both DC- OPT an Benchmark from irecting requests to these locations beyon the minimum loa of 1 Mbps require by the loa balancing constraint (4). Fig. 7 emonstrates the average utility comparison between DC-OPT an Benchmark. We observe that DC-OPT has a slightly worse average utility across the time. The reason for the inferior performance is that in orer to reuce the banwith usage, sometimes DC-OPT nees to irect requests to locations that are not necessarily the closest, but are more banwith efficient because these emans effectively smooth out the aggregate traffic. By the same token, DC-OPT has to sacrifice the electricity cost in orer to satisfy the banwith usage constraint. This is illustrate in Fig. 8. The electricity cost is on average aroun 5%-1% higher than Benchmark. Note that both DC-OPT an Benchmark violate the cost constraint uring peak hours when eman rises to the point that this constraint becomes infeasible uring epoch The average performance at this perio of time is also relatively worse as seen in Fig. 7. The results show that there is an inherent trae-off between banwith usage an performance/electricity cost. Essentially, DC-OPT strives to be more banwith efficient, an achieves a ifferent operating point on the trae-off curve. Accoring to [7], both the electricity an wie-area banwith account for aroun 15% of the atacenter costs, respectively. Thus the overall cost of DC-OPT is reuce, while the performance is comparable to when banwith usage is not consiere. DC- OPT represents a favorable solution than banwith-agnostic atacenter selection schemes for clou operators. V. RELATED WORK The topic of atacenter selection an loa irection for a geoistribute clou has starte to gain attention in the research
6 Mbps DC OPT Benchmark Datacenter km DC OPT Benchmark 7 Time (epoch) $ DC OPT Benchmark 2.5 Time (epoch) Fig percentile banwith comparison. Fig. 7. Average utility comparison. Fig. 8. Total cost comparison. community. Qureshi et al. [5] introuce an intuitive iea of utilizing the location iversity of electricity spot price to intelligently irect requests to atacenters with lower prices. Wenell et al. [3] evelope a ecentralize atacenter selection algorithm for clou services, an evaluate its performance using a prototype an realistic traffic traces. Rao et al. [6] consiere a joint loa balancing an power control problem for Internet atacenters to exploit the time an location iversity of electricity price. [19] specifically consiere the effect of geographical loa balancing on proviing environmental gains by encouraging the use of green energy. [2] stuie a complementary problem of ata placement in a geo-istribute clou, consiering the ata locality. These works, however, o not consier banwith usage in their problem formulations. Our work relies on the iea of multiplexing emans with ifferent egrees of correlation to reuce the peak aggregate eman of atacenters. Similar iea has been propose in some recent works [14], [15], where a banwith reservation service in the clou is envisione for VoD applications, an multiplexing is utilize to reuce the total banwith reservation for a given level of QoS. Here we consier a more general setting where multiplexing is use for reucing the operating cost of the clou. Another recent work [21] iscusses correlation aware power optimization in atacenters. The focus is on local-area traffic in a atacenter network whose correlation statistics change frequently, while our approach eals with wie-area egress traffic of the atacenter. We also take into account the geographical iversity of electricity cost which is not consiere in these works. VI. CONCLUDING REMARKS In this paper, we presente a general optimization framework that consiers banwith usage an electricity costs to solve the atacenter selection problem for clou services. Our iea is to exploit the ifferent egrees of correlations between emans at ifferent locations to reuce the peak eman of aggregate traffic at atacenters, thereby reucing the billing amount of wie-area banwith. We aopte a ual ecomposition approach to solve the secon-orer cone program, an evelope a istribute algorithm base on the subgraient metho to iteratively achieve the optimal atacenter selection solution in a ecentralize fashion. Simulation results with real-worl traces an electricity prices show that our algorithm reuces the 95- percentile banwith usage by 2%, an offers comparable performance an electricity cost against banwith-agnostic solutions. Our work can be extene in many irections. One possible irection is to consier the online atacenter selection that makes ecision on-the-fly with sequentially arriving requests, which is more ifficult than the offline problem we solve in this paper. REFERENCES [1] Amazon web services (AWS), [2] DynDNS, [3] P. Wenell, J. W. Jiang, M. J. Freeman, an J. Rexfor, DONAR: Decentralize server selection for clou services, in Proc. ACM SIGCOMM, 21. [4] Amazon AWS elastic loa balancing, elasticloabalancing/. [5] A. Qureshi, R. Weber, H. Balakrishnan, J. Guttag, an B. Maggs, Cutting the electricity bill for Internet-scale systems, in Proc. ACM SIGCOMM, 29. [6] L. Rao,. Liu, L. ie, an W. Liu, Minimizing electricity cost: Optimization of istribute Internet ata centers in a multi-electricitymarket environment, in Proc. IEEE INFOCOM, 21. [7] A. Greenberg, J. Hamilton, D. A. Maltz, an P. Patel, The Cost of a Clou: Research Problems in Data Center Networks, SIGCOMM Comput. Commun. Rev., vol. 39, no. 1, pp , 29. [8]. Dimitropoulos, P. Hurley, A. Kin, an M. P. Stoecklin, On the 95- percentile billing metho, in Proc. PAM, 29. [9] N. Laoutaris, M. Sirivianos,. Yang, an P. Roriguez, Inter-atacenter bulk transfers with netstitcher, in Proc. ACM SIGCOMM, 211. [1] D. u an. Liu, Geographic trough filling for Internet atacenters, in Proc. IEEE INFOCOM, 212. [11] UUSee Inc. [12] H. Alzoubi, S. Lee, M. Rabinovich, O. Spatscheck, an J. van er Merwe, A practical architecture for an anycast CDN, ACM Trans. Web, vol. 5, no. 4, October 211. [13] Feeral Energy Regulatory Commission, U.S. electric power markets, [14] D. Niu, H. u, B. Li, an S. Zhao, Risk management for vieo-oneman servers leveraging eman forecast, in Proc. ACM Multimeia, 211. [15], Quality-assure clou banwith auto-scaling for vieo-oneman applications, in Proc. IEEE INFOCOM, 212. [16] J. Mo an J. Walran, Fair en-to-en winow-base congestion control, IEEE/ACM Trans. Netw., vol. 8, no. 5, pp , October 2. [17] S. Boy an A. Mutapcic, Subgraient methos, Lecture notes of EE364b, Stanfor University, Winter Quarter stanfor.eu/class/ee364b/notes/subgra metho notes.pf. [18] WebGIS, [19] Z. Liu, M. Lin, A. Wierman, S. H. Low, an L. L. Anrew, Greening geographical loa balancing, in Proc. ACM Sigmetrics, 211. [2] S. Agarwal, J. Dunagan, N. Jain, S. Saroiu, A. Wolman, an H. Bhogan, Volley: Automate ata placement for geo-istribute clou services, in Proc. USENI NSDI, 21. [21]. Wang, Y. Yao,. Wang, K. Lu, an Q. Cao, CARPO: Correlationaware power optimization in ata center networks, in Proc. IEEE INFOCOM, 212.
Game Theoretic Modeling of Cooperation among Service Providers in Mobile Cloud Computing Environments
2012 IEEE Wireless Communications an Networking Conference: Services, Applications, an Business Game Theoretic Moeling of Cooperation among Service Proviers in Mobile Clou Computing Environments Dusit
More informationA Data Placement Strategy in Scientific Cloud Workflows
A Data Placement Strategy in Scientific Clou Workflows Dong Yuan, Yun Yang, Xiao Liu, Jinjun Chen Faculty of Information an Communication Technologies, Swinburne University of Technology Hawthorn, Melbourne,
More informationBellini: Ferrying Application Traffic Flows through Geo-distributed Datacenters in the Cloud
Bellini: Ferrying Application Traffic Flows through Geo-istribute Datacenters in the Clou Zimu Liu, Yuan Feng, an Baochun Li Department of Electrical an Computer Engineering, University of Toronto Department
More informationFirewall Design: Consistency, Completeness, and Compactness
C IS COS YS TE MS Firewall Design: Consistency, Completeness, an Compactness Mohame G. Goua an Xiang-Yang Alex Liu Department of Computer Sciences The University of Texas at Austin Austin, Texas 78712-1188,
More informationOptimal Control Policy of a Production and Inventory System for multi-product in Segmented Market
RATIO MATHEMATICA 25 (2013), 29 46 ISSN:1592-7415 Optimal Control Policy of a Prouction an Inventory System for multi-prouct in Segmente Market Kuleep Chauhary, Yogener Singh, P. C. Jha Department of Operational
More informationHOST SELECTION METHODOLOGY IN CLOUD COMPUTING ENVIRONMENT
International Journal of Avance Research in Computer Engineering & Technology (IJARCET) HOST SELECTION METHODOLOGY IN CLOUD COMPUTING ENVIRONMENT Pawan Kumar, Pijush Kanti Dutta Pramanik Computer Science
More informationOn Adaboost and Optimal Betting Strategies
On Aaboost an Optimal Betting Strategies Pasquale Malacaria 1 an Fabrizio Smerali 1 1 School of Electronic Engineering an Computer Science, Queen Mary University of Lonon, Lonon, UK Abstract We explore
More informationGPRS performance estimation in GSM circuit switched services and GPRS shared resource systems *
GPRS performance estimation in GSM circuit switche serices an GPRS share resource systems * Shaoji i an Sen-Gusta Häggman Helsinki Uniersity of Technology, Institute of Raio ommunications, ommunications
More informationISSN: 2277-3754 ISO 9001:2008 Certified International Journal of Engineering and Innovative Technology (IJEIT) Volume 3, Issue 12, June 2014
ISSN: 77-754 ISO 900:008 Certifie International Journal of Engineering an Innovative echnology (IJEI) Volume, Issue, June 04 Manufacturing process with isruption uner Quaratic Deman for Deteriorating Inventory
More informationINFLUENCE OF GPS TECHNOLOGY ON COST CONTROL AND MAINTENANCE OF VEHICLES
1 st Logistics International Conference Belgrae, Serbia 28-30 November 2013 INFLUENCE OF GPS TECHNOLOGY ON COST CONTROL AND MAINTENANCE OF VEHICLES Goran N. Raoičić * University of Niš, Faculty of Mechanical
More informationLecture L25-3D Rigid Body Kinematics
J. Peraire, S. Winall 16.07 Dynamics Fall 2008 Version 2.0 Lecture L25-3D Rigi Boy Kinematics In this lecture, we consier the motion of a 3D rigi boy. We shall see that in the general three-imensional
More informationSensor Network Localization from Local Connectivity : Performance Analysis for the MDS-MAP Algorithm
Sensor Network Localization from Local Connectivity : Performance Analysis for the MDS-MAP Algorithm Sewoong Oh an Anrea Montanari Electrical Engineering an Statistics Department Stanfor University, Stanfor,
More informationA Blame-Based Approach to Generating Proposals for Handling Inconsistency in Software Requirements
International Journal of nowlege an Systems Science, 3(), -7, January-March 0 A lame-ase Approach to Generating Proposals for Hanling Inconsistency in Software Requirements eian Mu, Peking University,
More informationA New Pricing Model for Competitive Telecommunications Services Using Congestion Discounts
A New Pricing Moel for Competitive Telecommunications Services Using Congestion Discounts N. Keon an G. Ananalingam Department of Systems Engineering University of Pennsylvania Philaelphia, PA 19104-6315
More informationLow-Complexity and Distributed Energy Minimization in Multi-hop Wireless Networks
Low-Complexity an Distribute Energy inimization in ulti-hop Wireless Networks Longbi Lin, Xiaojun Lin, an Ness B. Shroff Center for Wireless Systems an Applications (CWSA) School of Electrical an Computer
More informationAn intertemporal model of the real exchange rate, stock market, and international debt dynamics: policy simulations
This page may be remove to conceal the ientities of the authors An intertemporal moel of the real exchange rate, stock market, an international ebt ynamics: policy simulations Saziye Gazioglu an W. Davi
More informationMSc. Econ: MATHEMATICAL STATISTICS, 1995 MAXIMUM-LIKELIHOOD ESTIMATION
MAXIMUM-LIKELIHOOD ESTIMATION The General Theory of M-L Estimation In orer to erive an M-L estimator, we are boun to make an assumption about the functional form of the istribution which generates the
More informationHull, Chapter 11 + Sections 17.1 and 17.2 Additional reference: John Cox and Mark Rubinstein, Options Markets, Chapter 5
Binomial Moel Hull, Chapter 11 + ections 17.1 an 17.2 Aitional reference: John Cox an Mark Rubinstein, Options Markets, Chapter 5 1. One-Perio Binomial Moel Creating synthetic options (replicating options)
More informationThe one-year non-life insurance risk
The one-year non-life insurance risk Ohlsson, Esbjörn & Lauzeningks, Jan Abstract With few exceptions, the literature on non-life insurance reserve risk has been evote to the ultimo risk, the risk in the
More informationMinimum-Energy Broadcast in All-Wireless Networks: NP-Completeness and Distribution Issues
Minimum-Energy Broacast in All-Wireless Networks: NP-Completeness an Distribution Issues Mario Čagal LCA-EPFL CH-05 Lausanne Switzerlan mario.cagal@epfl.ch Jean-Pierre Hubaux LCA-EPFL CH-05 Lausanne Switzerlan
More informationState of Louisiana Office of Information Technology. Change Management Plan
State of Louisiana Office of Information Technology Change Management Plan Table of Contents Change Management Overview Change Management Plan Key Consierations Organizational Transition Stages Change
More informationCALCULATION INSTRUCTIONS
Energy Saving Guarantee Contract ppenix 8 CLCULTION INSTRUCTIONS Calculation Instructions for the Determination of the Energy Costs aseline, the nnual mounts of Savings an the Remuneration 1 asics ll prices
More informationModelling and Resolving Software Dependencies
June 15, 2005 Abstract Many Linux istributions an other moern operating systems feature the explicit eclaration of (often complex) epenency relationships between the pieces of software
More informationCh 10. Arithmetic Average Options and Asian Opitons
Ch 10. Arithmetic Average Options an Asian Opitons I. Asian Option an the Analytic Pricing Formula II. Binomial Tree Moel to Price Average Options III. Combination of Arithmetic Average an Reset Options
More informationChapter 9 AIRPORT SYSTEM PLANNING
Chapter 9 AIRPORT SYSTEM PLANNING. Photo creit Dorn McGrath, Jr Contents Page The Planning Process................................................... 189 Airport Master Planning..............................................
More informationThroughputScheduler: Learning to Schedule on Heterogeneous Hadoop Clusters
ThroughputScheuler: Learning to Scheule on Heterogeneous Haoop Clusters Shehar Gupta, Christian Fritz, Bob Price, Roger Hoover, an Johan e Kleer Palo Alto Research Center, Palo Alto, CA, USA {sgupta, cfritz,
More informationProduct Differentiation for Software-as-a-Service Providers
University of Augsburg Prof. Dr. Hans Ulrich Buhl Research Center Finance & Information Management Department of Information Systems Engineering & Financial Management Discussion Paper WI-99 Prouct Differentiation
More informationOptimizing Multiple Stock Trading Rules using Genetic Algorithms
Optimizing Multiple Stock Traing Rules using Genetic Algorithms Ariano Simões, Rui Neves, Nuno Horta Instituto as Telecomunicações, Instituto Superior Técnico Av. Rovisco Pais, 040-00 Lisboa, Portugal.
More informationA New Evaluation Measure for Information Retrieval Systems
A New Evaluation Measure for Information Retrieval Systems Martin Mehlitz martin.mehlitz@ai-labor.e Christian Bauckhage Deutsche Telekom Laboratories christian.bauckhage@telekom.e Jérôme Kunegis jerome.kunegis@ai-labor.e
More informationData Center Power System Reliability Beyond the 9 s: A Practical Approach
Data Center Power System Reliability Beyon the 9 s: A Practical Approach Bill Brown, P.E., Square D Critical Power Competency Center. Abstract Reliability has always been the focus of mission-critical
More informationNet Neutrality, Network Capacity, and Innovation at the Edges
Net Neutrality, Network Capacity, an Innovation at the Eges Jay Pil Choi Doh-Shin Jeon Byung-Cheol Kim May 22, 2015 Abstract We stuy how net neutrality regulations affect a high-banwith content provier(cp)
More informationWeb Appendices of Selling to Overcon dent Consumers
Web Appenices of Selling to Overcon ent Consumers Michael D. Grubb A Option Pricing Intuition This appenix provies aitional intuition base on option pricing for the result in Proposition 2. Consier the
More informationScalable live video streaming to cooperative clients using time shifting and video patching
calable live vieo streaming to cooperative clients using time shifting an vieo patching Meng Guo, Mostafa H. Ammar {mguo, ammar}@cc.gatech.eu Networking an Telecommunication Group ollege of omputing, Georgia
More informationModeling and Predicting Popularity Dynamics via Reinforced Poisson Processes
Proceeings of the Twenty-Eighth AAAI Conference on Artificial Intelligence Moeling an Preicting Popularity Dynamics via Reinforce Poisson Processes Huawei Shen 1, Dashun Wang 2, Chaoming Song 3, Albert-László
More informationJON HOLTAN. if P&C Insurance Ltd., Oslo, Norway ABSTRACT
OPTIMAL INSURANCE COVERAGE UNDER BONUS-MALUS CONTRACTS BY JON HOLTAN if P&C Insurance Lt., Oslo, Norway ABSTRACT The paper analyses the questions: Shoul or shoul not an iniviual buy insurance? An if so,
More informationSafety Management System. Initial Revision Date: Version Revision No. 02 MANUAL LIFTING
Revision Preparation: Safety Mgr Authority: Presient Issuing Dept: Safety Page: Page 1 of 11 Purpose is committe to proviing a safe an healthy working environment for all employees. Musculoskeletal isorers
More informationUnbalanced Power Flow Analysis in a Micro Grid
International Journal of Emerging Technology an Avance Engineering Unbalance Power Flow Analysis in a Micro Gri Thai Hau Vo 1, Mingyu Liao 2, Tianhui Liu 3, Anushree 4, Jayashri Ravishankar 5, Toan Phung
More information10.2 Systems of Linear Equations: Matrices
SECTION 0.2 Systems of Linear Equations: Matrices 7 0.2 Systems of Linear Equations: Matrices OBJECTIVES Write the Augmente Matrix of a System of Linear Equations 2 Write the System from the Augmente Matrix
More informationView Synthesis by Image Mapping and Interpolation
View Synthesis by Image Mapping an Interpolation Farris J. Halim Jesse S. Jin, School of Computer Science & Engineering, University of New South Wales Syney, NSW 05, Australia Basser epartment of Computer
More informationSearch Advertising Based Promotion Strategies for Online Retailers
Search Avertising Base Promotion Strategies for Online Retailers Amit Mehra The Inian School of Business yeraba, Inia Amit Mehra@isb.eu ABSTRACT Web site aresses of small on line retailers are often unknown
More informationConsumer Referrals. Maria Arbatskaya and Hideo Konishi. October 28, 2014
Consumer Referrals Maria Arbatskaya an Hieo Konishi October 28, 2014 Abstract In many inustries, rms rewar their customers for making referrals. We analyze the optimal policy mix of price, avertising intensity,
More informationStock Market Value Prediction Using Neural Networks
Stock Market Value Preiction Using Neural Networks Mahi Pakaman Naeini IT & Computer Engineering Department Islamic Aza University Paran Branch e-mail: m.pakaman@ece.ut.ac.ir Hamireza Taremian Engineering
More informationStochastic Planning for Content Delivery: Unveiling the Benefits of Network Functions Virtualization
Stochastic Planning for Content Delivery: Unveiling the Benefits of Network Functions Virtualization Michele Mangili, Fabio Martignon an Antonio Capone LRI, Université Paris-Su {michele.mangili, fabio.martignon}@lri.fr
More informationChapter 4: Elasticity
Chapter : Elasticity Elasticity of eman: It measures the responsiveness of quantity emane (or eman) with respect to changes in its own price (or income or the price of some other commoity). Why is Elasticity
More informationzupdate: Updating Data Center Networks with Zero Loss
zupate: Upating Data Center Networks with Zero Loss Hongqiang Harry Liu Yale University hongqiang.liu@yale.eu Lihua Yuan Microsoft lyuan@microsoft.com Xin Wu Duke University xinwu@cs.uke.eu Roger Wattenhofer
More informationForecasting and Staffing Call Centers with Multiple Interdependent Uncertain Arrival Streams
Forecasting an Staffing Call Centers with Multiple Interepenent Uncertain Arrival Streams Han Ye Department of Statistics an Operations Research, University of North Carolina, Chapel Hill, NC 27599, hanye@email.unc.eu
More informationEnterprise Resource Planning
Enterprise Resource Planning MPC 6 th Eition Chapter 1a McGraw-Hill/Irwin Copyright 2011 by The McGraw-Hill Companies, Inc. All rights reserve. Enterprise Resource Planning A comprehensive software approach
More informationA Universal Sensor Control Architecture Considering Robot Dynamics
International Conference on Multisensor Fusion an Integration for Intelligent Systems (MFI2001) Baen-Baen, Germany, August 2001 A Universal Sensor Control Architecture Consiering Robot Dynamics Frierich
More informationImproving Emulation Throughput for Multi-Project SoC Designs
Improving Emulation Throhput for Multi-Project SoC Designs By Frank Schirrmeister, Caence Design Systems As esign sizes grow, so, too, oes the verification effort. Inee, verification has become the biggest
More informationHow To Segmentate An Insurance Customer In An Insurance Business
International Journal of Database Theory an Application, pp.25-36 http://x.oi.org/10.14257/ijta.2014.7.1.03 A Case Stuy of Applying SOM in Market Segmentation of Automobile Insurance Customers Vahi Golmah
More informationMODELLING OF TWO STRATEGIES IN INVENTORY CONTROL SYSTEM WITH RANDOM LEAD TIME AND DEMAND
art I. robobabilystic Moels Computer Moelling an New echnologies 27 Vol. No. 2-3 ransport an elecommunication Institute omonosova iga V-9 atvia MOEING OF WO AEGIE IN INVENOY CONO YEM WIH ANOM EA IME AN
More informationEnergy Cost Optimization for Geographically Distributed Heterogeneous Data Centers
Energy Cost Optimization for Geographically Distribute Heterogeneous Data Centers Eric Jonari, Mark A. Oxley, Sueep Pasricha, Anthony A. Maciejewski, Howar Jay Siegel Abstract The proliferation of istribute
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 14 10/27/2008 MOMENT GENERATING FUNCTIONS Contents 1. Moment generating functions 2. Sum of a ranom number of ranom variables 3. Transforms
More informationWeb Appendices to Selling to Overcon dent Consumers
Web Appenices to Selling to Overcon ent Consumers Michael D. Grubb MIT Sloan School of Management Cambrige, MA 02142 mgrubbmit.eu www.mit.eu/~mgrubb May 2, 2008 B Option Pricing Intuition This appenix
More informationTowards a Framework for Enterprise Architecture Frameworks Comparison and Selection
Towars a Framework for Enterprise Frameworks Comparison an Selection Saber Aballah Faculty of Computers an Information, Cairo University Saber_aballah@hotmail.com Abstract A number of Enterprise Frameworks
More informationSCDA: SLA-aware Cloud Datacenter Architecture for Efficient Content. Storage and Retrieval
: SLA-aware Clou Datacenter Architecture for Efficient Content Storage an Retrieval Debessay Fesehaye an Klara Nahrstet Department of Computer Science University of Illinois at Urbana-Champaign {kassa2,klara}@illinois.eu
More informationOption Pricing for Inventory Management and Control
Option Pricing for Inventory Management an Control Bryant Angelos, McKay Heasley, an Jeffrey Humpherys Abstract We explore the use of option contracts as a means of managing an controlling inventories
More informationHow To Predict A Call Capacity In A Voip System
Paper Preictive Moeling in a VoIP System Ana-Maria Simionovici a, Alexanru-Arian Tantar a, Pascal Bouvry a, an Loic Dielot b a Computer Science an Communications University of Luxembourg, Luxembourg b
More informationSecurity Vulnerabilities and Solutions for Packet Sampling
Security Vulnerabilities an Solutions for Packet Sampling Sharon Golberg an Jennifer Rexfor Princeton University, Princeton, NJ, USA 08544 {golbe, jrex}@princeton.eu Abstract Packet sampling supports a
More informationSensitivity Analysis of Non-linear Performance with Probability Distortion
Preprints of the 19th Worl Congress The International Feeration of Automatic Control Cape Town, South Africa. August 24-29, 214 Sensitivity Analysis of Non-linear Performance with Probability Distortion
More informationPerformance Analysis of Bandwidth Allocations for Multi-Services Mobile Wireless Cellular Networks *
erformance Analysis of Banwith Allocations for Multi-Serices Mobile Wireless Cellular Networs * Lizhong Li Bin Li Bo Li Xi-Ren Cao Department of Computer Science Department of Electrical an Electronic
More informationCross-Over Analysis Using T-Tests
Chapter 35 Cross-Over Analysis Using -ests Introuction his proceure analyzes ata from a two-treatment, two-perio (x) cross-over esign. he response is assume to be a continuous ranom variable that follows
More informationCost-aware Workload Dispatching and Server Provisioning for Distributed Cloud Data Centers
, pp.51-60 http://dx.doi.org/10.14257/ijgdc.2013.6.5.05 Cost-aware Workload Dispatching and Server Provisioning for Distributed Cloud Data Centers Weiwei Fang 1, Quan Zhou 1, Yuan An 2, Yangchun Li 3 and
More informationDetecting Possibly Fraudulent or Error-Prone Survey Data Using Benford s Law
Detecting Possibly Frauulent or Error-Prone Survey Data Using Benfor s Law Davi Swanson, Moon Jung Cho, John Eltinge U.S. Bureau of Labor Statistics 2 Massachusetts Ave., NE, Room 3650, Washington, DC
More informationOptimal Energy Commitments with Storage and Intermittent Supply
Submitte to Operations Research manuscript OPRE-2009-09-406 Optimal Energy Commitments with Storage an Intermittent Supply Jae Ho Kim Department of Electrical Engineering, Princeton University, Princeton,
More informationProfessional Level Options Module, Paper P4(SGP)
Answers Professional Level Options Moule, Paper P4(SGP) Avance Financial Management (Singapore) December 2007 Answers Tutorial note: These moel answers are consierably longer an more etaile than woul be
More informationUnsteady Flow Visualization by Animating Evenly-Spaced Streamlines
EUROGRAPHICS 2000 / M. Gross an F.R.A. Hopgoo Volume 19, (2000), Number 3 (Guest Eitors) Unsteay Flow Visualization by Animating Evenly-Space Bruno Jobar an Wilfri Lefer Université u Littoral Côte Opale,
More informationDigital barrier option contract with exponential random time
IMA Journal of Applie Mathematics Avance Access publishe June 9, IMA Journal of Applie Mathematics ) Page of 9 oi:.93/imamat/hxs3 Digital barrier option contract with exponential ranom time Doobae Jun
More informationHow To Evaluate Power Station Performance
Proceeings of the Worl Congress on Engineering an Computer Science 20 Vol II, October 9-2, 20, San Francisco, USA Performance Evaluation of Egbin Thermal Power Station, Nigeria I. Emovon, B. Kareem, an
More informationMeasures of distance between samples: Euclidean
4- Chapter 4 Measures of istance between samples: Eucliean We will be talking a lot about istances in this book. The concept of istance between two samples or between two variables is funamental in multivariate
More informationDynamic Network Security Deployment Under Partial Information
Dynamic Network Security Deployment Uner Partial nformation nvite Paper) George Theoorakopoulos EPFL Lausanne, Switzerlan Email: george.theoorakopoulos @ epfl.ch John S. Baras University of Marylan College
More informationSafety Stock or Excess Capacity: Trade-offs under Supply Risk
Safety Stock or Excess Capacity: Trae-offs uner Supply Risk Aahaar Chaturvei Victor Martínez-e-Albéniz IESE Business School, University of Navarra Av. Pearson, 08034 Barcelona, Spain achaturvei@iese.eu
More informationA Scheme to Estimate One-way Delay Variations for Diagnosing Network Traffic Conditions
Cyber Journals: Multiisciplinary Journals in Science an Technology Journal of Selecte Areas in Telecommunications (JSAT) August Eition 2011 A Scheme to Estimate One-way Delay Variations for Diagnosing
More informationA Theory of Exchange Rates and the Term Structure of Interest Rates
Review of Development Economics, 17(1), 74 87, 013 DOI:10.1111/roe.1016 A Theory of Exchange Rates an the Term Structure of Interest Rates Hyoung-Seok Lim an Masao Ogaki* Abstract This paper efines the
More informationA Generalization of Sauer s Lemma to Classes of Large-Margin Functions
A Generalization of Sauer s Lemma to Classes of Large-Margin Functions Joel Ratsaby University College Lonon Gower Street, Lonon WC1E 6BT, Unite Kingom J.Ratsaby@cs.ucl.ac.uk, WWW home page: http://www.cs.ucl.ac.uk/staff/j.ratsaby/
More informationHybrid Model Predictive Control Applied to Production-Inventory Systems
Preprint of paper to appear in the 18th IFAC Worl Congress, August 28 - Sept. 2, 211, Milan, Italy Hybri Moel Preictive Control Applie to Prouction-Inventory Systems Naresh N. Nanola Daniel E. Rivera Control
More informationCalibration of the broad band UV Radiometer
Calibration of the broa ban UV Raiometer Marian Morys an Daniel Berger Solar Light Co., Philaelphia, PA 19126 ABSTRACT Mounting concern about the ozone layer epletion an the potential ultraviolet exposure
More informationHow To Connect Two Servers Together In A Data Center Network
DPillar: Scalable Dual-Port Server Interconnection for Data Center Networks Yong Liao ECE Department University of Massachusetts Amherst, MA 3, USA Dong Yin Automation Department Northwestern Polytech
More informationMathematics Review for Economists
Mathematics Review for Economists by John E. Floy University of Toronto May 9, 2013 This ocument presents a review of very basic mathematics for use by stuents who plan to stuy economics in grauate school
More informationCoalitional Game Theoretic Approach for Cooperative Transmission in Vehicular Networks
Coalitional Game Theoretic Approach for Cooperative Transmission in Vehicular Networks arxiv:.795v [cs.gt] 8 Feb Tian Zhang, Wei Chen, Zhu Han, an Zhigang Cao State Key Laboratory on Microwave an Digital
More informationA Comparison of Performance Measures for Online Algorithms
A Comparison of Performance Measures for Online Algorithms Joan Boyar 1, Sany Irani 2, an Kim S. Larsen 1 1 Department of Mathematics an Computer Science, University of Southern Denmark, Campusvej 55,
More informationDECISION SUPPORT SYSTEM FOR MANAGING EDUCATIONAL CAPACITY UTILIZATION IN UNIVERSITIES
DECISION SUPPORT SYSTEM OR MANAGING EDUCATIONAL CAPACITY UTILIZATION IN UNIVERSITIES Svetlana Vinnik 1, Marc H. Scholl 2 Abstract Decision-making in the fiel of acaemic planning involves extensive analysis
More informationImproving Direct Marketing Profitability with Neural Networks
Volume 9 o.5, September 011 Improving Direct Marketing Profitability with eural etworks Zaiyong Tang Salem State University Salem, MA 01970 ABSTRACT Data mining in irect marketing aims at ientifying the
More informationSeeing the Unseen: Revealing Mobile Malware Hidden Communications via Energy Consumption and Artificial Intelligence
Seeing the Unseen: Revealing Mobile Malware Hien Communications via Energy Consumption an Artificial Intelligence Luca Caviglione, Mauro Gaggero, Jean-François Lalane, Wojciech Mazurczyk, Marcin Urbanski
More informationRUNESTONE, an International Student Collaboration Project
RUNESTONE, an International Stuent Collaboration Project Mats Daniels 1, Marian Petre 2, Vicki Almstrum 3, Lars Asplun 1, Christina Björkman 1, Carl Erickson 4, Bruce Klein 4, an Mary Last 4 1 Department
More informationAn Introduction to Event-triggered and Self-triggered Control
An Introuction to Event-triggere an Self-triggere Control W.P.M.H. Heemels K.H. Johansson P. Tabuaa Abstract Recent evelopments in computer an communication technologies have le to a new type of large-scale
More information! # % & ( ) +,,),. / 0 1 2 % ( 345 6, & 7 8 4 8 & & &&3 6
! # % & ( ) +,,),. / 0 1 2 % ( 345 6, & 7 8 4 8 & & &&3 6 9 Quality signposting : the role of online information prescription in proviing patient information Liz Brewster & Barbara Sen Information School,
More informationHow To Price Internet Access In A Broaban Service Charge On A Per Unit Basis
iqui Pricing for Digital Infrastructure Services Subhajyoti Banyopahyay * an sing Kenneth Cheng Department of Decision an Information Sciences Warrington College of Business Aministration University of
More informationMandate-Based Health Reform and the Labor Market: Evidence from the Massachusetts Reform
Manate-Base Health Reform an the Labor Market: Evience from the Massachusetts Reform Jonathan T. Kolsta Wharton School, University of Pennsylvania an NBER Amana E. Kowalski Department of Economics, Yale
More informationAsymmetric Neutrality Regulation and Innovation at the Edges: Fixed vs. Mobile Networks
TSE 521 August 2014 Asymmetric Neutrality Regulation an Innovation at the Eges: Fixe vs. Mobile Networks Jay Pil Choi, Doh Shin Jeon an Byung Cheol Kim Asymmetric Neutrality Regulation an Innovation at
More informationCURRENCY OPTION PRICING II
Jones Grauate School Rice University Masa Watanabe INTERNATIONAL FINANCE MGMT 657 Calibrating the Binomial Tree to Volatility Black-Scholes Moel for Currency Options Properties of the BS Moel Option Sensitivity
More informationRisk Management for Derivatives
Risk Management or Derivatives he Greeks are coming the Greeks are coming! Managing risk is important to a large number o iniviuals an institutions he most unamental aspect o business is a process where
More informationFactoring Dickson polynomials over finite fields
Factoring Dickson polynomials over finite fiels Manjul Bhargava Department of Mathematics, Princeton University. Princeton NJ 08544 manjul@math.princeton.eu Michael Zieve Department of Mathematics, University
More informationAchieving quality audio testing for mobile phones
Test & Measurement Achieving quality auio testing for mobile phones The auio capabilities of a cellular hanset provie the funamental interface between the user an the raio transceiver. Just as RF testing
More informationDi usion on Social Networks. Current Version: June 6, 2006 Appeared in: Économie Publique, Numéro 16, pp 3-16, 2005/1.
Di usion on Social Networks Matthew O. Jackson y Caltech Leeat Yariv z Caltech Current Version: June 6, 2006 Appeare in: Économie Publique, Numéro 16, pp 3-16, 2005/1. Abstract. We analyze a moel of i
More informationarxiv:1309.1857v3 [gr-qc] 7 Mar 2014
Generalize holographic equipartition for Friemann-Robertson-Walker universes Wen-Yuan Ai, Hua Chen, Xian-Ru Hu, an Jian-Bo Deng Institute of Theoretical Physics, LanZhou University, Lanzhou 730000, P.
More informationOptimal Control Of Production Inventory Systems With Deteriorating Items And Dynamic Costs
Applie Mathematics E-Notes, 8(2008), 194-202 c ISSN 1607-2510 Available free at mirror sites of http://www.math.nthu.eu.tw/ amen/ Optimal Control Of Prouction Inventory Systems With Deteriorating Items
More informationMath 230.01, Fall 2012: HW 1 Solutions
Math 3., Fall : HW Solutions Problem (p.9 #). Suppose a wor is picke at ranom from this sentence. Fin: a) the chance the wor has at least letters; SOLUTION: All wors are equally likely to be chosen. The
More informationInnovation Union means: More jobs, improved lives, better society
The project follows the Lisbon an Gothenburg Agenas, an supports the EU 2020 Strategy, in particular SMART Growth an the Innovation Union: Innovation Union means: More jobs, improve lives, better society
More informationRural Development Tools: What Are They and Where Do You Use Them?
Faculty Paper Series Faculty Paper 00-09 June, 2000 Rural Development Tools: What Are They an Where Do You Use Them? By Dennis U. Fisher Professor an Extension Economist -fisher@tamu.eu Juith I. Stallmann
More information