A note on profit maximization and monotonicity for inbound call centers
|
|
- Scot Russell
- 8 years ago
- Views:
Transcription
1 A note on profit maximization and monotonicity for inbound call center Ger Koole & Aue Pot Department of Mathematic, Vrije Univeriteit Amterdam, The Netherland 23rd December 2005 Abtract We conider an inbound call center with a fixed reward per call and communication and agent cot By controlling the number of line and the number of agent we can maximize the profit Abandonment are included in our performance model Monotonicity reult for the maximization problem are obtained, which lead to an efficient optimization procedure We give a counterexample to the concavity in the number of agent, which i equivalent to aying that the law of diminihing return doe not hold Numerical reult are given 1 Introduction Traditionally call center are een a cot center Thi mean that a certain ervice level ha to be obtained for minimal cot The ervice level i often taen a follow: 80% of the call hould be anwered by a call center agent within 20 econd In thi buine model a call cot money but i neceary to the company Another buine model i the one where the call center i conidered to be a profit center There i a reward aigned to a call, and the objective of the call center i to maximize it profit, defined a reward minu cot The variable cot in a call center mainly conit of alary cot and communication cot, in cae the call center pay for (part of) that Such a buine model can lead to coniderable aving (ee [2] for an example) In thi paper we analyze a model for a call center in which we determine the number of line and agent for which the profit i maximized It i our objective to find the global maximum for thi two-dimenional profit function We derive propertie of the profit function a to avoid having to earch exhautively all poible combination of parameter value Baed on thi we formulate an algorithm that find the global maximum The optimization procedure can be een a a local earch procedure in which the function value i the profit for given parameter value Thee value can be obtained through Marov chain method We give ome numerical reult The intereted reader can alo experiment with a tool that i freely available on the internet In addition to the poitive reult that lead to the optimization procedure we alo offer a counterexample that how that (given the optimal number of line i determined for each poible 1
2 number of agent) the profit function i neither concave nor unimodal in the number of agent Thi how that the law of diminihing return doe not hold for thi model Our model i one of the model tudied in Helber et al [4] (ee alo [3]) In thi paper the author urvey the German call center maret and come up with a number of buine model Next to our ingle period profit maximization model they alo conider a multi-period model with a contraint on the number of available agent hour Our monotonicity reult how how to find the optimal olution in the ingle-period model of [4], and our counterexample how that finding the optimal olution for the multi-period model i, in theory, a non-trivial problem A different call center profit maximization model (with multiple call clae and a hared reource) ha been decribed in Aşin and Harer [1] In the next ection we decribe the model After that we preent the propertie of the profit function and the reulting optimization procedure We alo give numerical reult The ection after that i devoted to the counterexample and it implication In the final ection the propertie of the profit function are derived, mainly uing dynamic programming Thi i done by inductively proving certain propertie, related to concavity, of the dynamic programming value function 2 Model decription and reult The call center model that we conider i commonly called an M/M//n+M ytem That i, it ha Poion arrival and exponential ervice time, with additional feature exponential abandonment and a finite number of line meaning that the total number of call waiting and in ervice i retricted There are no redial of bloced or abandoned call The cutomer arrival rate i λ, and the rate of the ervice time ditribution i µ (In practice uually the expected call duration i taen, which we denote with β = 1/µ) The number of agent i variable, with an upper bound of S, the number of eat in the call center Alo the number of line i limited, to + N if there are agent (We tae + N intead of imply N for reaon that will become clear later) A call that i waiting abandon with rate γ We have communication cot c per call per unit of time, and cot 1 per cheduled agent per unit of time There are expected reward r per handled call (Note that the actual reward per call might vary, but a we are only intereted in expected reward, and a we have no prior information on the reward of a call, we only need r) We define g,n a the average long-run expected profit for agent or erver and n additional waiting line For fixed and n g,n i the tationary reward in a birth-death proce with tate x {0,, + n} (indicating the number of call in the ytem), tranition rate α(, ), and immediate reward δ( ), given by: α(x,x + 1) = λ for 0 x < + n, α(x,x 1) = min{x,}µ+ (x min{x,})γ for 0 < x + n; δ(x) = min{x,}µr xc 2
3 Uing tandard argument for birth-death procee it follow that g,n i given by (tae a = λβ): g,n = x=0 n a x a x(µr c) + x!! x=1 a x x! + a! x=0 λ x xy=1 ((µr c) xc) (µ+ yγ) n x=1 λ x xy=1 (µ+ yγ) (1) Now define g = max 0 n N g,n (with n = argmax 0 n N g,n ) and g = max 0 S g (with = argmax 0 S g ) In Section 4 we how the following reult Theorem 21 g,0 g,n for all 0 S and n n for all 0 < S Theorem 21 tell u the following: for a fixed number of agent the reward i non-decreaing in the number of line up to the optimal number of line, and if the number of agent i increaed than the optimal number of line for that many erver doe not decreae The theorem lead to a imple algorithm for finding and n To avoid trivialitie we chec firt that (1 + c)β < r: if thi i not the cae then the cot for the agent and communication of a call that i directly connected are higher than the profit, and it i better to reject all call and to chedule no agent at all Algorithm for finding (,n ): 0 Tae (,n) = (,n ) = (0,0) 1 If (1 + c)β r then: top 2 For = 1 to S do 3 Compute g,n (uing Equation (1)) 3 If n < N then: Compute g,n+1 4 While g,n < g,min{n+1,n} 5 n n If n < N then: Compute g,n+1 7 If g,n > g,n then: (,n ) (,n) Thu we ee that for each value of we increae n until we have found the optimal value n ; then we increae, and we tart increaing n again, from the value n According to Theorem 21 we certainly encounter the optimal olution, but we can only identify it after having determined n for all value of, becaue g need not be unimodal, a the counterexample in the next ection how In Figure 1 we ee a typical example of how the algorithm travere the (, n)-grid, from the lower left corner to the upper right The correponding parameter are S = 10, N = 30, λ = 5, µ = 1, c = 5, r = 3, γ = 5, and the price of an agent 1 per time unit It tae at maximum S + N tep, while there are SN point in the grid Thi illutrate well the efficiency of the algorithm a compared to enumeration It mae it uitable for routine application to typical call center 3
4 n Figure 1: (,n)-grid for S = 10, N = 30, λ = 5, µ = 1, c = 5, r = 3, and γ = 5 optimization problem with ten of different interval with different parameter per day The optimum i (,n ) = (6,13) The tool by which the numerical reult were obtained can alo be found on our web ite, ee wwwmathvunl/ apot/oftware/erlangprofit/ Note that in the tool the number of line include the number of agent, which i more uual in practice Alo the average ervice and abandonment time have to be entered, not the rate 3 Counterexample and implication In cae g were unimodal then we could top earching a oon a g would decreae after ome We how by a counterexample that thi i not alway the cae Conider the model with the parameter λ = 15, µ = 1, c = 039, r = 152, γ = 1/29 and an agent cot 1 per unit of time, a we defined earlier To analyze the concavity we vary from 0 to 15 In Table 1 the value of g can be found We ee that g increae for up to = 8, then it decreae for = 9, to tae it maximum value at = 10 We conclude that the function g,n i non-unimodal and thu neither convex nor concave in Thi counterexample how the neceity of increaing up to S in the algorithm The intuition behind it i a follow Computation how that n 8 = 1 and n 9 = n 10 = 2 Thu when adding the 9th erver it i optimal to add an additional line for waiting However, for n = 2, it i better to have 10 intead of 9 erver Thu = 9 doe not jutify completely the econd line, but with a ingle line the productivity and thu the reward i too low (g 9,1 = 03824) Thu due 4
5 Table 1: Value of g for variou for λ = 15, µ = 1, c = 039, r = 152, and γ = 1/29 g to the dicrete nature of n we ee a drop in profit at = 9 The counterexample ha further implication Conider we have two (or more) interval and a limited number of agent hour, a in [4] How to allocate the agent hour in an optimal way? A greedy algorithm would find the optimal allocation, auming that the law of diminihing return hold Thi law tate that when the number of erver i increaed the additional return for adding erver decreae Thi i equivalent to concavity Indeed, for a um of concave function the optimal allocation can be found by tarting empty and adding agent hour one by one, each time to the interval with the highet additional return It follow clearly from the counterexample that the concavity doe not hold, and thu the greedy algorithm i not guaranteed to give an optimal olution in the multi-period model of [4] 4 Monotonicity reult In thi ection we prove Theorem 21 Proof of Theorem 21 We tart with proving g,0 g,n for ome with 0 S Aume that n > 0 (otherwie there i nothing to prove) Firt note that g,n+1 = pg,n + (1 p)δ( + n + 1) for ome 0 < p < 1 Thi equation hold for all birth-death procee Now uppoe that g,n > g,n+1 for ome n < n Thi mean that δ( + n + 1) < g,n Note alo that δ(+n ) < < δ(+n+1) Becaue g,n i a convex combination of δ(+n ),,δ(+n+1) and g,n, thi mean that g,n < g,n, which i in contradiction with the optimality of n 5
6 The proof of the econd aertion of Theorem 21 i more involved We ue dynamic programming in it proof We formulate the value function for fixed and admiion control It i well nown that a threhold policy i optimal (Lippman [6]; ee Koole [5] for an overview of thi type of monotonicity reult) We called thi threhold n, meaning that an arrival i rejected if and only if the number of cutomer exceed + n To prove n n for ome 0 < S we need to how that when admiion i optimal in the ytem with erver and a total of x cutomer, then admiion i alo optimal in the ytem with + 1 erver and a total of x + 1 cutomer (giving the ame number of waiting cutomer) Let u now formulate the dynamic programming value function We cale time uch that λ + Sµ+ Nγ = 1 Then the tranition rate can alo be een a tranition probabilitie of the embedded uniformized chain (ee Lippman [6]) The dynamic programming value function V of thi embedded chain, with the epoch, i now given by V+1 (x) = µrmin{,x} cx + λmax{v (x),v (x + 1)}+ [µmin{,x} + γ(x min{,x})]v (x 1) + [µ(s min{,x}) + γ(n x + min{,x})]v (x) if x < + N and > 0, V +1 ( + N) = µr c( + N) + λv ( + N) + [µ+ γn]v ( + N 1)+ µ(s )V ( + N) if > 0, and V0 (x) = 0 for all and x Note that final term in both equation come from the uniformization procedure To prove that admiion i optimal in the ytem with + 1 erver and x + 1 cutomer if it i optimal in the ytem with erver and x cutomer, it uffice to how that V (x + 1) +V (x + 1) V (x) +V (x + 2) (2) for all 0, 0 < S, and 0 x < +N 1 Indeed, if admiion i optimal in x when having erver, and thu V (x) V (x + 1), then according to Equation (2) alo V (x) V (x + 1), and admiion i alo optimal with x call and + 1 erver or agent From Marov deciion theory it follow that the ame hold for the long-run limiting average cae (becaue tate and action pace are finite: ee, eg, Puterman [7]) In the proof of inequality (2) we will ue the well-nown concavity of V in x, ie, V (x) +V (x + 2) V (x + 1) +V (x + 1) (3) Note that inequalitie (2) and (3) ummed give upermodularity (or convexity) V (x + 1) +V (x) V (x) +V (x + 1) (4) We are now ready to prove (2) We do thi by induction to For = 0 the inequality trivially hold Aume that it hold up to ome Now conider the correponding term in V +1 and 6
7 V+1 i one by one (a method formalized in [5]) Conider firt the reward, the inequality to how min{,x + 1} + min{ + 1,x + 1} min{,x} + min{ + 1,x + 2} It i readily hown that thi hold indeed for all value of x and The ame hold for the cot Now conider the term with coefficient λ We have to loo at a number of cae Aume firt that the maximizing action in both V (x + 1) and V (x + 1) i admiion Then max{v V (x + 1),V (x + 2)} + max{v (x + 1),V (x + 2)} = V (x + 2) +V (x + 2) (x + 1) +V (x + 3) max{v (x),v (x + 1)} + max{v (x + 2),V (x + 3)}, the firt inequality i obtained by induction A imilar argument hold in the cae that rejection i optimal in tate x+1 for the ytem with and erver If the optimal action are different, then it mut be that admiion i the optimizing action in V (x + 1), by induction Then max{v (x + 1),V (x + 2)} + max{v (x + 1),V (x + 2)} = V (x + 1) +V (x + 2) max{v (x),v (x + 1)} + max{v (x + 2),V (x + 3)} Conider next the term with coefficient µ, the departure term There coefficient um up to Sµ, a if there are in total S erver For value function V of thee are preent, and in tate x min{,x} of thee are active We number the erver, and aume that in tate x erver 1 upto min{,x} are active We conider the erver one by one Aume firt that x + 1 Then all call in (2) are being erved Of particular interet are erver x + 1 and x + 2, the term related to all other erver hold trivially by induction Server x + 1 lead on the lh to V (x) +V (x), on the rh to V (x)+v (x+1) Server x+2 lead on the lh to V (x+1)+v (x+1), on the rh to V (x)+v (x + 1) Both lh ummed are maller than the rh ummed, becaue of Equation (4), which hold by induction Next aume that x Then all erver are buy, and the + 1th erver give again Equation (4) Finally conider the abandonment Aume that x, otherwie there are no abandonment Taing abandonment of the extra cutomer in queue in V (x + 1) and V (x + 2) into account lead to an equality Reference [1] OZ Aşin and PT Harer Capacity izing in the preence of a common hared reource: Staffing an inbound call center European Journal of Operational Reearch, 147: , 2003 [2] B Andrew and H Paron Etablihing telephone-agent taffing level through economic optimization Interface, 23(2):14 20, 1993 [3] S Helber and R Stolletz Call Center Management in der Praxi Springer,
8 [4] S Helber, R Stolletz, and S Bothe Erfolgzielorientierte Agentenalloation in inbound call Centern Zeitchrift für Betriebwirtchaftliche Forchung, page 3 32, 2005 (February) [5] GM Koole Structural reult for the control of queueing ytem uing event-baed dynamic programming Queueing Sytem, 30: , 1998 [6] SA Lippman Applying a new device in the optimization of exponential queueing ytem Operation Reearch, 23: , 1975 [7] ML Puterman Marov Deciion Procee Wiley,
A Note on Profit Maximization and Monotonicity for Inbound Call Centers
OPERATIONS RESEARCH Vol. 59, No. 5, September October 2011, pp. 1304 1308 in 0030-364X ein 1526-5463 11 5905 1304 http://dx.doi.org/10.1287/opre.1110.0990 2011 INFORMS TECHNICAL NOTE INFORMS hold copyright
More informationQueueing systems with scheduled arrivals, i.e., appointment systems, are typical for frontal service systems,
MANAGEMENT SCIENCE Vol. 54, No. 3, March 28, pp. 565 572 in 25-199 ein 1526-551 8 543 565 inform doi 1.1287/mnc.17.82 28 INFORMS Scheduling Arrival to Queue: A Single-Server Model with No-Show INFORMS
More informationPartial optimal labeling search for a NP-hard subclass of (max,+) problems
Partial optimal labeling earch for a NP-hard ubcla of (max,+) problem Ivan Kovtun International Reearch and Training Center of Information Technologie and Sytem, Kiev, Uraine, ovtun@image.iev.ua Dreden
More informationQueueing Models for Multiclass Call Centers with Real-Time Anticipated Delays
Queueing Model for Multicla Call Center with Real-Time Anticipated Delay Oualid Jouini Yve Dallery Zeynep Akşin Ecole Centrale Pari Koç Univerity Laboratoire Génie Indutriel College of Adminitrative Science
More informationResearch Article An (s, S) Production Inventory Controlled Self-Service Queuing System
Probability and Statitic Volume 5, Article ID 558, 8 page http://dxdoiorg/55/5/558 Reearch Article An (, S) Production Inventory Controlled Self-Service Queuing Sytem Anoop N Nair and M J Jacob Department
More informationCHARACTERISTICS OF WAITING LINE MODELS THE INDICATORS OF THE CUSTOMER FLOW MANAGEMENT SYSTEMS EFFICIENCY
Annale Univeritati Apuleni Serie Oeconomica, 2(2), 200 CHARACTERISTICS OF WAITING LINE MODELS THE INDICATORS OF THE CUSTOMER FLOW MANAGEMENT SYSTEMS EFFICIENCY Sidonia Otilia Cernea Mihaela Jaradat 2 Mohammad
More informationOptical Illusion. Sara Bolouki, Roger Grosse, Honglak Lee, Andrew Ng
Optical Illuion Sara Bolouki, Roger Groe, Honglak Lee, Andrew Ng. Introduction The goal of thi proect i to explain ome of the illuory phenomena uing pare coding and whitening model. Intead of the pare
More informationProfitability of Loyalty Programs in the Presence of Uncertainty in Customers Valuations
Proceeding of the 0 Indutrial Engineering Reearch Conference T. Doolen and E. Van Aken, ed. Profitability of Loyalty Program in the Preence of Uncertainty in Cutomer Valuation Amir Gandomi and Saeed Zolfaghari
More informationAssessing the Discriminatory Power of Credit Scores
Aeing the Dicriminatory Power of Credit Score Holger Kraft 1, Gerald Kroiandt 1, Marlene Müller 1,2 1 Fraunhofer Intitut für Techno- und Wirtchaftmathematik (ITWM) Gottlieb-Daimler-Str. 49, 67663 Kaierlautern,
More informationSocially Optimal Pricing of Cloud Computing Resources
Socially Optimal Pricing of Cloud Computing Reource Ihai Menache Microoft Reearch New England Cambridge, MA 02142 t-imena@microoft.com Auman Ozdaglar Laboratory for Information and Deciion Sytem Maachuett
More informationTwo Dimensional FEM Simulation of Ultrasonic Wave Propagation in Isotropic Solid Media using COMSOL
Excerpt from the Proceeding of the COMSO Conference 0 India Two Dimenional FEM Simulation of Ultraonic Wave Propagation in Iotropic Solid Media uing COMSO Bikah Ghoe *, Krihnan Balaubramaniam *, C V Krihnamurthy
More informationA Resolution Approach to a Hierarchical Multiobjective Routing Model for MPLS Networks
A Reolution Approach to a Hierarchical Multiobjective Routing Model for MPLS Networ Joé Craveirinha a,c, Rita Girão-Silva a,c, João Clímaco b,c, Lúcia Martin a,c a b c DEEC-FCTUC FEUC INESC-Coimbra International
More informationRisk Management for a Global Supply Chain Planning under Uncertainty: Models and Algorithms
Rik Management for a Global Supply Chain Planning under Uncertainty: Model and Algorithm Fengqi You 1, John M. Waick 2, Ignacio E. Gromann 1* 1 Dept. of Chemical Engineering, Carnegie Mellon Univerity,
More informationControl of Wireless Networks with Flow Level Dynamics under Constant Time Scheduling
Control of Wirele Network with Flow Level Dynamic under Contant Time Scheduling Long Le and Ravi R. Mazumdar Department of Electrical and Computer Engineering Univerity of Waterloo,Waterloo, ON, Canada
More informationDISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS. G. Chapman J. Cleese E. Idle
DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS G. Chapman J. Cleee E. Idle ABSTRACT Content matching i a neceary component of any ignature-baed network Intruion Detection
More informationName: SID: Instructions
CS168 Fall 2014 Homework 1 Aigned: Wedneday, 10 September 2014 Due: Monday, 22 September 2014 Name: SID: Dicuion Section (Day/Time): Intruction - Submit thi homework uing Pandagrader/GradeScope(http://www.gradecope.com/
More informationRedesigning Ratings: Assessing the Discriminatory Power of Credit Scores under Censoring
Redeigning Rating: Aeing the Dicriminatory Power of Credit Score under Cenoring Holger Kraft, Gerald Kroiandt, Marlene Müller Fraunhofer Intitut für Techno- und Wirtchaftmathematik (ITWM) Thi verion: June
More informationDISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS
DISTRIBUTED DATA PARALLEL TECHNIQUES FOR CONTENT-MATCHING INTRUSION DETECTION SYSTEMS Chritopher V. Kopek Department of Computer Science Wake Foret Univerity Winton-Salem, NC, 2709 Email: kopekcv@gmail.com
More informationChapter 10 Stocks and Their Valuation ANSWERS TO END-OF-CHAPTER QUESTIONS
Chapter Stoc and Their Valuation ANSWERS TO EN-OF-CHAPTER QUESTIONS - a. A proxy i a document giving one peron the authority to act for another, typically the power to vote hare of common toc. If earning
More informationSenior Thesis. Horse Play. Optimal Wagers and the Kelly Criterion. Author: Courtney Kempton. Supervisor: Professor Jim Morrow
Senior Thei Hore Play Optimal Wager and the Kelly Criterion Author: Courtney Kempton Supervior: Profeor Jim Morrow June 7, 20 Introduction The fundamental problem in gambling i to find betting opportunitie
More informationBi-Objective Optimization for the Clinical Trial Supply Chain Management
Ian David Lockhart Bogle and Michael Fairweather (Editor), Proceeding of the 22nd European Sympoium on Computer Aided Proce Engineering, 17-20 June 2012, London. 2012 Elevier B.V. All right reerved. Bi-Objective
More informationOnline story scheduling in web advertising
Online tory cheduling in web advertiing Anirban Dagupta Arpita Ghoh Hamid Nazerzadeh Prabhakar Raghavan Abtract We tudy an online job cheduling problem motivated by toryboarding in web advertiing, where
More informationBidding for Representative Allocations for Display Advertising
Bidding for Repreentative Allocation for Diplay Advertiing Arpita Ghoh, Preton McAfee, Kihore Papineni, and Sergei Vailvitkii Yahoo! Reearch. {arpita, mcafee, kpapi, ergei}@yahoo-inc.com Abtract. Diplay
More informationNETWORK TRAFFIC ENGINEERING WITH VARIED LEVELS OF PROTECTION IN THE NEXT GENERATION INTERNET
Chapter 1 NETWORK TRAFFIC ENGINEERING WITH VARIED LEVELS OF PROTECTION IN THE NEXT GENERATION INTERNET S. Srivatava Univerity of Miouri Kana City, USA hekhar@conrel.ice.umkc.edu S. R. Thirumalaetty now
More informationINFORMATION Technology (IT) infrastructure management
IEEE TRANSACTIONS ON CLOUD COMPUTING, VOL. 2, NO. 1, MAY 214 1 Buine-Driven Long-term Capacity Planning for SaaS Application David Candeia, Ricardo Araújo Santo and Raquel Lope Abtract Capacity Planning
More informationMSc Financial Economics: International Finance. Bubbles in the Foreign Exchange Market. Anne Sibert. Revised Spring 2013. Contents
MSc Financial Economic: International Finance Bubble in the Foreign Exchange Market Anne Sibert Revied Spring 203 Content Introduction................................................. 2 The Mone Market.............................................
More informationFEDERATION OF ARAB SCIENTIFIC RESEARCH COUNCILS
Aignment Report RP/98-983/5/0./03 Etablihment of cientific and technological information ervice for economic and ocial development FOR INTERNAL UE NOT FOR GENERAL DITRIBUTION FEDERATION OF ARAB CIENTIFIC
More informationScheduling of Jobs and Maintenance Activities on Parallel Machines
Scheduling of Job and Maintenance Activitie on Parallel Machine Chung-Yee Lee* Department of Indutrial Engineering Texa A&M Univerity College Station, TX 77843-3131 cylee@ac.tamu.edu Zhi-Long Chen** Department
More informationGroup Mutual Exclusion Based on Priorities
Group Mutual Excluion Baed on Prioritie Karina M. Cenci Laboratorio de Invetigación en Sitema Ditribuido Univeridad Nacional del Sur Bahía Blanca, Argentina kmc@c.un.edu.ar and Jorge R. Ardenghi Laboratorio
More informationGrowth and Sustainability of Managed Security Services Networks: An Economic Perspective
Growth and Sutainability of Managed Security Service etwork: An Economic Perpective Alok Gupta Dmitry Zhdanov Department of Information and Deciion Science Univerity of Minneota Minneapoli, M 55455 (agupta,
More informationREDUCTION OF TOTAL SUPPLY CHAIN CYCLE TIME IN INTERNAL BUSINESS PROCESS OF REAMER USING DOE AND TAGUCHI METHODOLOGY. Abstract. 1.
International Journal of Advanced Technology & Engineering Reearch (IJATER) REDUCTION OF TOTAL SUPPLY CHAIN CYCLE TIME IN INTERNAL BUSINESS PROCESS OF REAMER USING DOE AND Abtract TAGUCHI METHODOLOGY Mr.
More informationAvailability of WDM Multi Ring Networks
Paper Availability of WDM Multi Ring Network Ivan Rado and Katarina Rado H d.o.o. Motar, Motar, Bonia and Herzegovina Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, Univerity
More informationProject Management Basics
Project Management Baic A Guide to undertanding the baic component of effective project management and the key to ucce 1 Content 1.0 Who hould read thi Guide... 3 1.1 Overview... 3 1.2 Project Management
More informationSCM- integration: organiational, managerial and technological iue M. Caridi 1 and A. Sianei 2 Dipartimento di Economia e Produzione, Politecnico di Milano, Italy E-mail: maria.caridi@polimi.it Itituto
More informationUnit 11 Using Linear Regression to Describe Relationships
Unit 11 Uing Linear Regreion to Decribe Relationhip Objective: To obtain and interpret the lope and intercept of the leat quare line for predicting a quantitative repone variable from a quantitative explanatory
More informationA technical guide to 2014 key stage 2 to key stage 4 value added measures
A technical guide to 2014 key tage 2 to key tage 4 value added meaure CONTENTS Introduction: PAGE NO. What i value added? 2 Change to value added methodology in 2014 4 Interpretation: Interpreting chool
More informationAN OVERVIEW ON CLUSTERING METHODS
IOSR Journal Engineering AN OVERVIEW ON CLUSTERING METHODS T. Soni Madhulatha Aociate Preor, Alluri Intitute Management Science, Warangal. ABSTRACT Clutering i a common technique for tatitical data analyi,
More informationAlgorithms for Advance Bandwidth Reservation in Media Production Networks
Algorithm for Advance Bandwidth Reervation in Media Production Network Maryam Barhan 1, Hendrik Moen 1, Jeroen Famaey 2, Filip De Turck 1 1 Department of Information Technology, Ghent Univerity imind Gaton
More informationGrowth and Sustainability of Managed Security Services Networks: An Economic Perspective
Growth and Sutainability of Managed Security Service etwork: An Economic Perpective Alok Gupta Dmitry Zhdanov Department of Information and Deciion Science Univerity of Minneota Minneapoli, M 55455 (agupta,
More informationSupport Vector Machine Based Electricity Price Forecasting For Electricity Markets utilising Projected Assessment of System Adequacy Data.
The Sixth International Power Engineering Conference (IPEC23, 27-29 November 23, Singapore Support Vector Machine Baed Electricity Price Forecating For Electricity Maret utiliing Projected Aement of Sytem
More informationTRADING rules are widely used in financial market as
Complex Stock Trading Strategy Baed on Particle Swarm Optimization Fei Wang, Philip L.H. Yu and David W. Cheung Abtract Trading rule have been utilized in the tock market to make profit for more than a
More informationSolution of the Heat Equation for transient conduction by LaPlace Transform
Solution of the Heat Equation for tranient conduction by LaPlace Tranform Thi notebook ha been written in Mathematica by Mark J. McCready Profeor and Chair of Chemical Engineering Univerity of Notre Dame
More informationGrowing Self-Organizing Maps for Surface Reconstruction from Unstructured Point Clouds
Growing Self-Organizing Map for Surface Recontruction from Untructured Point Cloud Renata L. M. E. do Rêgo, Aluizio F. R. Araújo, and Fernando B.de Lima Neto Abtract Thi work introduce a new method for
More informationPerformance of Multiple TFRC in Heterogeneous Wireless Networks
Performance of Multiple TFRC in Heterogeneou Wirele Network 1 Hyeon-Jin Jeong, 2 Seong-Sik Choi 1, Firt Author Computer Engineering Department, Incheon National Univerity, oaihjj@incheon.ac.kr *2,Correponding
More informationHUMAN CAPITAL AND THE FUTURE OF TRANSITION ECONOMIES * Michael Spagat Royal Holloway, University of London, CEPR and Davidson Institute.
HUMAN CAPITAL AND THE FUTURE OF TRANSITION ECONOMIES * By Michael Spagat Royal Holloway, Univerity of London, CEPR and Davidon Intitute Abtract Tranition economie have an initial condition of high human
More informationTransmission Scheduling for Multi-Channel Satellite and Wireless Networks
Tranmiion Scheduling for ulti-channel Satellite and Wirele Network Anand Ganti, Eytan odiano, John N. Titikli aachuett Intitute of Technology e-mail: aganti@mit.edu, modiano@mit.edu, jnt@mit.edu Abtract
More informationControl Theory based Approach for the Improvement of Integrated Business Process Interoperability
www.ijcsi.org 201 Control Theory baed Approach for the Improvement of Integrated Buine Proce Interoperability Abderrahim Taoudi 1, Bouchaib Bounabat 2 and Badr Elmir 3 1 Al-Qualadi Reearch & Development
More informationUtility-Based Flow Control for Sequential Imagery over Wireless Networks
Utility-Baed Flow Control for Sequential Imagery over Wirele Networ Tomer Kihoni, Sara Callaway, and Mar Byer Abtract Wirele enor networ provide a unique et of characteritic that mae them uitable for building
More informationPlanning of Capacity and Inventory in a Manufacturing Supply Chain: Under Uncertain Demand. Acknowledgements. Outline
Planning of Capacity and Inventory in a Manufacturing Supply Chain: Under Uncertain Demand B. Dominguez Balletero,, C. Luca, G. Mitra,, C. Poojari Acknowledgement European Project SCHUMANN: Supply Chain
More information1. Introduction. C. Camisullis 1, V. Giard 2, G. Mendy-Bilek 3
Proceeding of the 3 rd International Conference on Information Sytem, Logitic and Supply Chain Creating value through green upply chain ILS 2010 Caablanca (Morocco), April 14-16 The right information to
More informationProceedings of Power Tech 2007, July 1-5, Lausanne
Second Order Stochatic Dominance Portfolio Optimization for an Electric Energy Company M.-P. Cheong, Student Member, IEEE, G. B. Sheble, Fellow, IEEE, D. Berleant, Senior Member, IEEE and C.-C. Teoh, Student
More informationMobility Improves Coverage of Sensor Networks
Mobility Improve Coverage of Senor Networ Benyuan Liu Dept. of Computer Science Univerity of Maachuett-Lowell Lowell, MA 1854 Peter Bra Dept. of Computer Science City College of New Yor New Yor, NY 131
More informationManaging Customer Arrivals in Service Systems with Multiple Servers
Managing Cutomer Arrival in Service Sytem with Multiple Server Chrito Zacharia Department of Management Science, School of Buine Adminitration, Univerity of Miami, Coral Gable, FL 3346. czacharia@bu.miami.edu
More informationReturn on Investment and Effort Expenditure in the Software Development Environment
International Journal of Applied Information ytem (IJAI) IN : 2249-0868 Return on Invetment and Effort Expenditure in the oftware Development Environment Dineh Kumar aini Faculty of Computing and IT, ohar
More informationMobile Network Configuration for Large-scale Multimedia Delivery on a Single WLAN
Mobile Network Configuration for Large-cale Multimedia Delivery on a Single WLAN Huigwang Je, Dongwoo Kwon, Hyeonwoo Kim, and Hongtaek Ju Dept. of Computer Engineering Keimyung Univerity Daegu, Republic
More informationv = x t = x 2 x 1 t 2 t 1 The average speed of the particle is absolute value of the average velocity and is given Distance travelled t
Chapter 2 Motion in One Dimenion 2.1 The Important Stuff 2.1.1 Poition, Time and Diplacement We begin our tudy of motion by conidering object which are very mall in comparion to the ize of their movement
More informationLaureate Network Products & Services Copyright 2013 Laureate Education, Inc.
Laureate Network Product & Service Copyright 2013 Laureate Education, Inc. KEY Coure Name Laureate Faculty Development...3 Laureate Englih Program...9 Language Laureate Signature Product...12 Length Laureate
More informationA Spam Message Filtering Method: focus on run time
, pp.29-33 http://dx.doi.org/10.14257/atl.2014.76.08 A Spam Meage Filtering Method: focu on run time Sin-Eon Kim 1, Jung-Tae Jo 2, Sang-Hyun Choi 3 1 Department of Information Security Management 2 Department
More informationA Duality Model of TCP and Queue Management Algorithms
A Duality Model of TCP and Queue Management Algorithm Steven H. Low CS and EE Department California Intitute of Technology Paadena, CA 95 low@caltech.edu May 4, Abtract We propoe a duality model of end-to-end
More informationOffice of Tax Analysis U.S. Department of the Treasury. A Dynamic Analysis of Permanent Extension of the President s Tax Relief
Office of Tax Analyi U.S. Department of the Treaury A Dynamic Analyi of Permanent Extenion of the Preident Tax Relief July 25, 2006 Executive Summary Thi Report preent a detailed decription of Treaury
More informationGraph Analyi I Network Meaure of the Networked Adaptive Agents
Uing Graph Analyi to Study Network of Adaptive Agent Sherief Abdallah Britih Univerity in Dubai, United Arab Emirate Univerity of Edinburgh, United Kingdom hario@ieee.org ABSTRACT Experimental analyi of
More informationCASE STUDY BRIDGE. www.future-processing.com
CASE STUDY BRIDGE TABLE OF CONTENTS #1 ABOUT THE CLIENT 3 #2 ABOUT THE PROJECT 4 #3 OUR ROLE 5 #4 RESULT OF OUR COLLABORATION 6-7 #5 THE BUSINESS PROBLEM THAT WE SOLVED 8 #6 CHALLENGES 9 #7 VISUAL IDENTIFICATION
More informationJanuary 21, 2015. Abstract
T S U I I E P : T R M -C S J. R January 21, 2015 Abtract Thi paper evaluate the trategic behavior of a monopolit to influence environmental policy, either with taxe or with tandard, comparing two alternative
More informationPekka Helkiö, 58490K Antti Seppälä, 63212W Ossi Syd, 63513T
Pekka Helkiö, 58490K Antti Seppälä, 63212W Oi Syd, 63513T Table of Content 1. Abtract...1 2. Introduction...2 2.1 Background... 2 2.2 Objective and Reearch Problem... 2 2.3 Methodology... 2 2.4 Scoping
More informationAssigning Tasks for Efficiency in Hadoop
Aigning Tak for Efficiency in Hadoop [Extended Abtract] Michael J. Ficher Computer Science Yale Univerity P.O. Box 208285 New Haven, CT, USA michael.ficher@yale.edu Xueyuan Su Computer Science Yale Univerity
More informationMaximizing Acceptance Probability for Active Friending in Online Social Networks
Maximizing for Active Friending in Online Social Network De-Nian Yang, Hui-Ju Hung, Wang-Chien Lee, Wei Chen Academia Sinica, Taipei, Taiwan The Pennylvania State Univerity, State College, Pennylvania,
More informationDUE to the small size and low cost of a sensor node, a
1992 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 14, NO. 10, OCTOBER 2015 A Networ Coding Baed Energy Efficient Data Bacup in Survivability-Heterogeneou Senor Networ Jie Tian, Tan Yan, and Guiling Wang
More informationFree Enterprise, the Economy and Monetary Policy
Free Enterprie, the Economy and Monetary Policy free (fre) adj. not cont Free enterprie i the freedom of individual and buinee to power of another; at regulation. It enable individual and buinee to create,
More informationStochasticity in Transcriptional Regulation: Origins, Consequences, and Mathematical Representations
36 Biophyical Journal Volume 8 December 200 36 336 Stochaticity in Trancriptional Regulation: Origin, Conequence, and Mathematical Repreentation Thoma B. Kepler* and Timothy C. Elton *Santa Fe Intitute,
More informationMixed Method of Model Reduction for Uncertain Systems
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol 4 No June Mixed Method of Model Reduction for Uncertain Sytem N Selvaganean Abtract: A mixed method for reducing a higher order uncertain ytem to a table reduced
More informationSector Concentration in Loan Portfolios and Economic Capital. Abstract
Sector Concentration in Loan Portfolio and Economic Capital Klau Düllmann and Nancy Machelein 2 Thi verion: September 2006 Abtract The purpoe of thi paper i to meaure the potential impact of buine-ector
More informationThree Phase Theory - Professor J R Lucas
Three Phae Theory - Profeor J Luca A you are aware, to tranit power with ingle phae alternating current, we need two wire live wire and neutral. However you would have een that ditribution line uually
More informationMorningstar Fixed Income Style Box TM Methodology
Morningtar Fixed Income Style Box TM Methodology Morningtar Methodology Paper Augut 3, 00 00 Morningtar, Inc. All right reerved. The information in thi document i the property of Morningtar, Inc. Reproduction
More informationHow to Maximize User Satisfaction Degree in Multi-service IP Networks
How to Maximize Uer Satifaction Degree in Multi-ervice IP Network Huy Anh Nguyen, Tam Van Nguyen and Deokai Choi Department of Electronic and Computer Engineering Chonnam National Univerity Gwangu, KOREA
More informationIntroduction to the article Degrees of Freedom.
Introduction to the article Degree of Freedom. The article by Walker, H. W. Degree of Freedom. Journal of Educational Pychology. 3(4) (940) 53-69, wa trancribed from the original by Chri Olen, George Wahington
More informationMANAGING DATA REPLICATION IN MOBILE AD- HOC NETWORK DATABASES (Invited Paper) *
MANAGING DATA REPLICATION IN MOBILE AD- HOC NETWORK DATABASES (Invited Paper) * Praanna Padmanabhan School of Computer Science The Univerity of Oklahoma Norman OK, USA praannap@yahoo-inc.com Dr. Le Gruenwald
More informationA New Optimum Jitter Protection for Conversational VoIP
Proc. Int. Conf. Wirele Commun., Signal Proceing (Nanjing, China), 5 pp., Nov. 2009 A New Optimum Jitter Protection for Converational VoIP Qipeng Gong, Peter Kabal Electrical & Computer Engineering, McGill
More informationAcceleration-Displacement Crash Pulse Optimisation A New Methodology to Optimise Vehicle Response for Multiple Impact Speeds
Acceleration-Diplacement Crah Pule Optimiation A New Methodology to Optimie Vehicle Repone for Multiple Impact Speed D. Gildfind 1 and D. Ree 2 1 RMIT Univerity, Department of Aeropace Engineering 2 Holden
More informationHealth Insurance and Social Welfare. Run Liang. China Center for Economic Research, Peking University, Beijing 100871, China,
Health Inurance and Social Welfare Run Liang China Center for Economic Reearch, Peking Univerity, Beijing 100871, China, Email: rliang@ccer.edu.cn and Hao Wang China Center for Economic Reearch, Peking
More informationApigee Edge: Apigee Cloud vs. Private Cloud. Evaluating deployment models for API management
Apigee Edge: Apigee Cloud v. Private Cloud Evaluating deployment model for API management Table of Content Introduction 1 Time to ucce 2 Total cot of ownerhip 2 Performance 3 Security 4 Data privacy 4
More informationA Life Contingency Approach for Physical Assets: Create Volatility to Create Value
A Life Contingency Approach for Phyical Aet: Create Volatility to Create Value homa Emil Wendling 2011 Enterprie Rik Management Sympoium Society of Actuarie March 14-16, 2011 Copyright 2011 by the Society
More informationLinear Momentum and Collisions
Chapter 7 Linear Momentum and Colliion 7.1 The Important Stuff 7.1.1 Linear Momentum The linear momentum of a particle with ma m moving with velocity v i defined a p = mv (7.1) Linear momentum i a vector.
More informationHow Enterprises Can Build Integrated Digital Marketing Experiences Using Drupal
How Enterprie Can Build Integrated Digital Marketing Experience Uing Drupal acquia.com 888.922.7842 1.781.238.8600 25 Corporate Drive, Burlington, MA 01803 How Enterprie Can Build Integrated Digital Marketing
More informationNetwork Architecture for Joint Failure Recovery and Traffic Engineering
Network Architecture for Joint Failure Recovery and Traffic Engineering Martin Suchara Dept. of Computer Science Princeton Univerity, NJ 08544 muchara@princeton.edu Dahai Xu AT&T Lab Reearch Florham Park,
More information6. Friction, Experiment and Theory
6. Friction, Experiment and Theory The lab thi wee invetigate the rictional orce and the phyical interpretation o the coeicient o riction. We will mae ue o the concept o the orce o gravity, the normal
More informationOptimal shift scheduling with a global service level constraint
Optimal shift scheduling with a global service level constraint Ger Koole & Erik van der Sluis Vrije Universiteit Division of Mathematics and Computer Science De Boelelaan 1081a, 1081 HV Amsterdam The
More informationTowards Control-Relevant Forecasting in Supply Chain Management
25 American Control Conference June 8-1, 25. Portland, OR, USA WeA7.1 Toward Control-Relevant Forecating in Supply Chain Management Jay D. Schwartz, Daniel E. Rivera 1, and Karl G. Kempf Control Sytem
More informationReport 4668-1b 30.10.2010. Measurement report. Sylomer - field test
Report 4668-1b Meaurement report Sylomer - field tet Report 4668-1b 2(16) Contet 1 Introduction... 3 1.1 Cutomer... 3 1.2 The ite and purpoe of the meaurement... 3 2 Meaurement... 6 2.1 Attenuation of
More informationCluster-Aware Cache for Network Attached Storage *
Cluter-Aware Cache for Network Attached Storage * Bin Cai, Changheng Xie, and Qiang Cao National Storage Sytem Laboratory, Department of Computer Science, Huazhong Univerity of Science and Technology,
More informationA model for the relationship between tropical precipitation and column water vapor
Click Here for Full Article GEOPHYSICAL RESEARCH LETTERS, VOL. 36, L16804, doi:10.1029/2009gl039667, 2009 A model for the relationhip between tropical precipitation and column water vapor Caroline J. Muller,
More information2. METHOD DATA COLLECTION
Key to learning in pecific ubject area of engineering education an example from electrical engineering Anna-Karin Cartenen,, and Jonte Bernhard, School of Engineering, Jönköping Univerity, S- Jönköping,
More informationProgress 8 measure in 2016, 2017, and 2018. Guide for maintained secondary schools, academies and free schools
Progre 8 meaure in 2016, 2017, and 2018 Guide for maintained econdary chool, academie and free chool July 2016 Content Table of figure 4 Summary 5 A ummary of Attainment 8 and Progre 8 5 Expiry or review
More informationDistributed, Secure Load Balancing with Skew, Heterogeneity, and Churn
Ditributed, Secure Load Balancing with Skew, Heterogeneity, and Churn Jonathan Ledlie and Margo Seltzer Diviion of Engineering and Applied Science Harvard Univerity Abtract Numerou propoal exit for load
More informationImproving the Performance of Web Service Recommenders Using Semantic Similarity
Improving the Performance of Web Service Recommender Uing Semantic Similarity Juan Manuel Adán-Coello, Carlo Miguel Tobar, Yang Yuming Faculdade de Engenharia de Computação, Pontifícia Univeridade Católica
More informationTap Into Smartphone Demand: Mobile-izing Enterprise Websites by Using Flexible, Open Source Platforms
Tap Into Smartphone Demand: Mobile-izing Enterprie Webite by Uing Flexible, Open Source Platform acquia.com 888.922.7842 1.781.238.8600 25 Corporate Drive, Burlington, MA 01803 Tap Into Smartphone Demand:
More informationImagery Portal Workshop #2 Department of Administrative Services, Executive Building Salem, Oregon May 11, 2006
ry Portal Workhop #2 Department of Adminitrative Service, Executive Building Salem, Oregon May 11, 2006 Workhop Purpoe: dicu the outcome of the phae 1 coping proce for development of an imagery portal
More informationBrokerage Commissions and Institutional Trading Patterns
rokerage Commiion and Intitutional Trading Pattern Michael Goldtein abon College Paul Irvine Emory Univerity Eugene Kandel Hebrew Univerity and Zvi Wiener Hebrew Univerity June 00 btract Why do broker
More informationLicense & SW Asset Management at CES Design Services
Licene & SW Aet Management at CES Deign Service johann.poechl@iemen.com www.ces-deignservice.com 2003 Siemen AG Öterreich Overview 1. Introduction CES Deign Service 2. Objective and Motivation 3. What
More informationReview of Multiple Regression Richard Williams, University of Notre Dame, http://www3.nd.edu/~rwilliam/ Last revised January 13, 2015
Review of Multiple Regreion Richard William, Univerity of Notre Dame, http://www3.nd.edu/~rwilliam/ Lat revied January 13, 015 Aumption about prior nowledge. Thi handout attempt to ummarize and yntheize
More informationRISK MANAGEMENT POLICY
RISK MANAGEMENT POLICY The practice of foreign exchange (FX) rik management i an area thrut into the potlight due to the market volatility that ha prevailed for ome time. A a conequence, many corporation
More information