Capacity of Wireless Networks with Heterogeneous Traffic
|
|
- Mavis Gilmore
- 8 years ago
- Views:
Transcription
1 Capacity of Wireless Networks with Heterogeeous Traffic Migyue Ji, Zheg Wag, Hamid R. Sadjadpour, J.J. Garcia-Lua-Aceves Departmet of Electrical Egieerig ad Computer Egieerig Uiversity of Califoria, Sata Cruz, 56 High Street, Sata Cruz, CA 95064, USA Palo Alto Research Ceter PARC, 3333 Coyote Hill Road, Palo Alto, CA 94304, USA {davidjmy, wzgold, hamid, Abstract We study the scalig laws for wireless ad hoc etwork i which the distributio of odes i the etwork is homogeeous but the traffic is heterogeeous. More specifically, we cosider the case i which a ode is the sik to k sources sedig differet iformatio, while the rest of the odes are part of uicast commuicatios with a uiform assigmet of source-destiatio pairs. We prove that the capacity of these heterogeeous etworks is Θ, where ad deote the maximum traffic for a cell ad the umber of odes i the etwork, respectively. Equivaletly, our derivatios reveal that, q whe k costat, the etwork capacity is equal to Θ for k O ad equal to Θ ` k for k Ω. Furthermore, the etwork capacity is Θ whe k costat. These results demostrate that the capacity of a heterogeeous etwork is domiated by the maximum cogestio i ay area of the etwork. I. INTRODUCTION The scalig laws of wireless ad hoc etworks with homogeeous traffic ad uiform distributio have bee extesively studies i the literature. The semial paper by Gupta ad Kumar [] evaluated the capacity of wireless ad hoc etwork with uiform traffic ad showed that the capacity scales as Θ uder the protocol model. The iformatio theoretic capacity of wireless ad hoc etworks with cooperatio amog odes was ivestigated by Xie ad Kumar [2], [3]. Zemliaov ad de Veciaa [4] ivestigated the throughput capacity with homogeeous traffic whe some odes are coected to the ifrastructure. Few prior works ivestigate heterogeeous traffic i the etwork. Keshavarz-Haddad et al. [5] itroduced the cocept of trasmissio area. Based o that defiitio, they itroduced a method to compute the upper boud of the capacity for differet traffic patters ad differet topologies of the etwork. However, the paper did ot itroduce ay closed-form scalig laws for the etwork capacity. Krishamurthy et al. [6] discussed differet heterogeeous traffic requiremets, which deped o the type of data such as audio ad video. Liu et al. [7] assumed a heterogeeous traffic for low-priority ad highpriority data with differet traffic models for them. Rodoplu et al. [8], [9] cosider a etwork with may sources selectig a sigle ode as destiatio. They itroduce the cocept of core capacity ad derived some aalytical results for capacity of this type of etwork ad compared it with uiform uicast core capacity. However, their derivatios did ot lead to a closed form scalig laws; istead, they showed simulatio results for the case i which there is a limited umber of odes i the etwork. To the best of our kowledge, this is the first paper that provides the scalig laws of such etwork with heterogeeous traffic as a fuctio of ad other etwork parameters. Iterestigly, we fid out that the capacity is domiated by the area i which the majority of traffic i the etwork passes. This result is ituitive whe we assume that all the traffic requiremet for each ode should be satisfied. Clearly, the ode with the highest traffic will domiate the capacity. The paper is orgaized as follows. Sectio II presets the assumptios ad defiitios eeded i our aalysis. Sectio III provides the routig scheme ad the lower boud throughput capacity for our etwork model. Sectio IV provides the upper boud. Some discussios are preseted i Sectio V ad the paper is cocluded i Sectio VI. II. WIRELESS NETWORK MODEL We cosider a etwork with odes uiformly distributed i a dese etwork, where the area of the etwork is a costat uit square. We assume heterogeeous traffic for the etwork, such that a sigle ode called the access poit is the destiatio for k sources i the etwork. For the rest of the k odes i the etwork we assume radom ad uiformly distributed source-destiatio pairs. Therefore, the source-destiatio pair selectio for uicast commuicatios is similar to that used by Gupta ad Kumar [] for the rest of k odes i the etwork. This etwork model is show i Figure. The trasmissio rage is assumed to be the same for all the odes ad the commuicatio betwee odes is poit-to-poit. A successful commuicatio betwee two odes is modeled accordig to the protocol model, which is defied below. Defiitio 2.: Protocol Model: Assume that there is a sigle commo commuicatio rage r for all odes. Node i at locatio X i ca successfully trasmit to ode ir at locatio X ir if X i X ir r ad for every ode k located at X k, k i that trasmits at the same time, X k X ir + r. The quatity guaratees a guard zoe aroud the receiver.
2 B. The traffic caused by access ode Let us defie a traffic from ode i to ode j as commodity [9]. Clearly, the umber of commodities for access ode is k which is also equivalet to the umber of lies paths passig through the cell that cotais the access ode. For simplicity of the aalysis, we assume that the access ode is located at the ceter of the etwork. Now we compute the umber of commodities for a cell that has a distace of x from the access ode. From Fig. 2 ad by choosig X i C 2, the area of triagle is Fig.. The Network Model Defiitio 2.2: Feasible Throughput: A throughput of λ i bits per secod is said to be feasible for the i th source-destiatio pair if there is a commo trasmissio rage r, ad a scheme to schedule trasmissios ad there are routes betwee source ad destiatio, such that source i ca trasmit to its destiatio at such rate successfully. For heterogeeous traffic, the feasible throughput is defied for each source-destiatio pair. Defiitio 2.3: Order of Throughput Capacity: The total throughput capacity is said to be of order Θf bits per secod if there exist a costat c ad c such that lim Prλ λ i cf is feasible ; ad i limif Prλ λ i c f is feasible <. i III. THE LOWER BOUND OF THE CAPACITY We eed to emphasize that there are two types of traffic i our model. Oe traffic is associated to the k sources trasmittig packets to the access ode ad the other traffic stems from the rest of k odes i the etwork with uicast commuicatios. Therefore, we eed to defie the routig protocol ad schedulig uder this traffic model. A. The Routig Scheme ad the Schedulig Protocol The selectio of sources for the access ode i is based o the techique described i [0]. We radomly ad uiformly select k locatios i the etwork ad choose the closest odes to these k locatios as sources for the access ode. The routig trajectory is a straight lie L i from access ode to these k locatios. The the packets traverse from each source to destiatio i a multi-hop fashio passig through all the cells that cross L i. For the rest of j odes with uicast traffic where j k, both selectios of source-destiatio pairs ad routig is similar to the above techique. For the schedulig scheme, we utilize a TDMA scheme similar to [0] with some modificatios to take ito accout the heterogeeity of the traffic. S XiAB 2d 2 x + d 2 d 2 < 2d x, 2 d C is selected to guaratee the coectivity betwee adjacet cells i the etwork [] ad C is a costat factor. Fig. 2. d A geometric descriptio of traffic by the access ode i the etwork Theorem 3.: For ay cell with a distace of from the access ode, the upper boud for the umber of commodities caused by the traffic from the access ode is X i N j < 2 d k 3 whe k Ω. Proof: The average umber of lies passig through the cell E[N xj ] whose distace from access ode i is is less tha 2 d k sice k source odes are uiformly distributed i the etwork. Utlizig the Cheroff boud [], we have Pr N xj E[N xj ] > δ E[N xj ] < exp [ + δlog + δ δen xj ] 4 ad Pr N xj E[N xj ] < δ E[N xj ] ] < exp [ δ2 2 E[N ] 5
3 where 0 < δ <. Combiig the results ad cosiderig E[N xj ] < 2d k, we obtai Pr N xj E[N xj ] > δ E[N xj ] < [ exp + δlog + δ δ 2d ] ] k + exp [ δ2 2d k. 2 6 Thus, the probability that the values of the radom variables N xj for all j ca simultaeously be arbitrarily close to E[N xj ] is give by Pr N xj E[N xj ] < δ E[N xj ] j Pr N xj E[N xj ] > δ E[N xj ] j Pr [ N xj E[N xj ] > δ E[N xj ] ] j [ exp + δlog + δ δ 2d ] k > j ] + exp [ δ2 2d k. 7 2 Deote that if k Ω ad d Θ probability teds to whe. C. The traffic caused by uicast commuicatios, the this I this sectio, we derive the umber of lies passig through each cell because of uicast traffic i the etwork. Sice the uicast traffic is distributed uiformly i the etwork, this value is the same for all the cells i the etwork. Lemma 3.2: For ay cell S, the maximum umber of lies itersectig this cell caused by uicast traffic is give by PrMaximum umber of lies L i passig through S C 2 k, whe k costat. Proof: Our proof is similar to that of [0] except that we accout for k uicast pairs i the etwork. The probability that the destiatio ode j is x away from the source ode is C 3 πx+d [0] where C 3 is a costat. Thus, the probability p that there is a lie passig through the cell S which is with distace x from j is PrL i itersects S p < 2 d 2d x k C 3 πx + d dx C 4 where C 4 is a costat value. Each of k odes radomly ad uiformly selects ay other ode i the etwork as 8 destiatio. Defie i.i.d. radom variable I i as { If Li itersect S I i 0, Otherwise where i, 2,, k. It is clear from Eq. 8 that PrI i p < C 4. Deote Z k i I i as the umber of lies passig through the cell S. Thus for positive values of a ad m ad usig Cheroff Boud, we have Furhter, 9 PrZ > m EeaZ. 0 eam Ee az + e a p k Let s defie m C 2 k exp ke a p expc 4 ke a, the Eq. becomes PrZ > C 2 k exp k C 4e a C 2 a. 2 If we select C 2 such that C 2 a C 4 e a ǫ > 0, the PrZ > C 2 k exp ǫ k. 3 If the area for each cell is defied as s 2 Θ, the by utilizig the uio boud we arrive at PrSome cells have more tha k lies PrZ > k all the cells s 2 exp ǫ k exp ǫ k. 4 2C This probability goes to zero as teds to ifiity as log as k costat. D. The Lower Boud of the Capacity Case of k costat: From the previous two sectios, we deduce that the umber of lies passig through a cell with distace x from the access ode is upper bouded as 2dk x + C 2 k ad for the cell that cotais the access ode is k+c 2 k. I the traditioal aalysis of capacity with homogeeous traffic, the iverse of traffic for a cell usig a TDMA scheme provides the throughput capacity. Give that this value varies for differet cells i heterogeeous traffic, we assig a badwidth to the cell that is
4 proportioal to the umber of lies passig through a cell. This assigmet is based o the fact that each lik i the etwork has the same badwidth similar to the approach by Gupta ad Kumar but more allocatio of badwidth is give to a cell with higher traffic. Clearly, our results demostrate that the cell that cotais the access ode has the highest traffic. If we divide the etwork ito layers of cells startig from the access poit as show i Fig. 3, the traffic for cells i each layer is the same order. Let s assume the traffic for each layer is T i where i,..., Θ. The our badwidth requiremet for each layer is give by W o T o W T... W Θ c. 5 T Θ Note that W o W max, T o ad c is a pre-determied fuctio of. This assumptio basically meas that more badwidth is provided to a cell with higher traffic. 2 Case of k costat: Uder this coditio, clearly all the traffic is cotributed by the access ode ad sice each source is sedig differet packet to the access ode, the achivable capacity is Ω by allowig oe source at the time to trasmit its packet to the access ode. Combiig the above results, we state the followig theorem for the achivable lower boud. Theorem 3.3: The achievable lower boud for a heterogeeous traffic with maximum umber of traffic of for a cell ca be give as follows. Ω whe k C 5 C lower 7 Ω whe k C 5 Note that Theorem 3. is proved oly for k Ω. However whe k O, we ca still take advatage of the upper boud for because there is less traffic uder this coditio ad the upper boud holds. X i l l l l l log IV. THE UPPER BOUND OF THE CAPACITY Fig. 3. The layers aroud X i We first compute the capacity for the case whe k costat. The capacity ca be defied as The average umber of odes i each cell is proportioal to Θ, the the lower boud capacity is Θ log 8lW l C lower + W 0 Θ, T l MW max MW max l Θ l0 Θ MW max + T 0 8lc + c Θ, Θ c, Ω c W max Ω, 6 where M is the TDMA parameter that is required to separate cells i order to satisfy the protocol model. Note that the capacity defied i this paper is the total capacity sice the traffic for each ode is differet ad per ode capacity may ot be meaigful. C upper the sum of capacity for all cells the average umber of hops for source-destiatio pairs maximum badwidth expasio TDMA parameter. First, we cosider the case whe k Ω. It is easy to show that x 2l 2d 2 where l varies from a costat value up to Θ depedig o the locatio of cell from the access ode. From this lower boud for x, we ca derive the upper boud for T l. 2d k T l < 2l + C 2 k 2d 2 k + C 2 k l 0 l 0 8
5 The the capacity ca be derived as C upper Θ MW max l 8lW l L o r + W 0 L o r W max ML o rc 2 2k a W max ML o rc Θ 2d k 8l l 2l + C 2 k 2d 2 + k + C 2 k Θ + k + C 2 k Θ l W max ML o rc 2 2k k+ 2l C 2 k Θ l 8l + l 8l + Θ l 8l 2l W max ML o rc 2 2kΘ + log + k + C 2 k Θ W max ML o rc 2 2kΘ + C 2 kθ b W max ML o cθ 2 2kΘ + C 2 kθ W max ML o c 2 2k + C 2 k O c W max O 9 a is derived by replacig W l T l c ad b is derived by replacig r with Θ. L i this derivatio is the average legth of each uicast or the average legth over all 4 distaces betwee k sources ad the access ode. Secod, we cosider the case whe k O. From 8, we ca see that the maximum traffic i the etwork still satisfies this coditio. Thus, we ca derive the same result as 9. The case of k costat is straightforward sice we ca at most have oe data set to the access ode whe all the commuicatios ivolve the access ode. Fially, from the aalysis above, we derive a tight boud for the capacity. Theorem 4.: I a radom ad hoc etwork, uder the heterogeeous traffic patter with oe ode performig as the destiatio for k source odes ad other odes have uicast commuicatios, the overall capacity is Θ, k C 5, k O C Θ, k C 5, k Ω k, Θ. whe k C 5 20 Proof: We kow that the capacity of this etwork is Θ, where k + C 2 k. The it is straightforward to see that for differet values of k, eq. 20 ca be derived. V. DISCUSSION Fig. 4 shows the throughput capacity of a wireless etwork obtaied from 20 as a fuctio of the umber of sources for the access ode. As the umber of the sources for this access ode k icreases from to Θ, the capacity of the etwork is Θ which is the well kow result computed by Gupta ad Kumar for homogeeous traffic model. We call this regio as Homogeeous Traffic regio. It is clear that the capacity of the etwork i this regio is domiated by the uiform uicast traffic. Oce the value of k passes this threshold of Θ, the capacity of the etwork is Θ k which is smaller tha the capacity of the Homogeeous Traffic regio. The capacity of the etwork is domiated by the access ode which is the bottleeck i the etwork ad we call this capacity regio as Heterogeeous Traffic regio. This result implies that for the cells ear the access ode, we should assig more resources badwidth or time to guaratee the data rate for each traffic. Fially if the umber of sources for the access ode is such that k C 5, the the capacity is Θ which is the same as broadcast trasport capacity [2]. Sice the umber of sources is relatively large i this case, we call this capacity regio as All to Oe Traffic regio. We ca see that almost all of the odes have traffic for the access ode, thus, for the extreme case that all the odes have traffic to the access ode, at each time, oly oe ode ca trasmit. Furthermore, the capacity we calculated is a ormalized capacity by the maximum badwidth. We ca see without this ormalizatio, the capacity of the etwork is c which is ot related to k see Eqs. 6 ad 9. However, to achieve the same capacity for all odes ad for differet
6 C log log k log k Fig. 4. The capacity result values of k, we eed to allocate more badwidth to the more cogested areas of the etwork. Fig. 5 demostrates that i the Homogeous Traffic regio, the maximum badwidth eeded is ot related to k. However, i the Heterogeous Traffic regio, the badwidth grows liearly with k, which is the price for keepig the overall capacity the same. Fially, i the All to Oe Traffic regio, the order of the maximum badwidth does ot chage. W max c REFERENCES [] P. Gupta ad P.R.Kumar, The capacity of wireless etworks, IEEE Trasactios o Iformatio Theory, vol. 46, o. 2, pp , March [2] L.-L. Xie ad P.R.Kumar, A etwork iformatio theory for wireless commuicatio: Scalig laws ad optimal operatio, IEEE Trasactios o Iformatio Theory, vol. 50, o. 5, pp , May [3], O the path-loss atteuatio regime for positive cost ad liear scalig of trasport capacity i wireless etworks, IEEE Trasactios o Iformatio Theory, vol. 52, o. 6, pp , Jue [4] A. Zemliaov ad G. de Veciaa, Capacity of ad hoc wireless etworks with ifrastructure support, IEEE Joural o Selected Areas i Commuicatios, vol. 23, o. 3, pp , March [5] A. Keshavarz-Haddad ad R. Riedi, Bouds for the capacity of wireless multihop etworks imposed by topology ad demad, i MobiHoc, September 2007, pp [6] F. Yu, V. Krishamurthy, ad V. C.M.Leug, Cross-layer optimal coectio admissio cotrol for varible bit rate multimedia traffic i packet wireless cdma etworks, IEEE Trasactios o Sigal Processig, vol. 54, o. 2, pp , February [7] W. Liu, X. Che, Y. Fag, ad J. M. Shea, Courtesy piggybackig: Supportig differetiated services i multiop mobile ad hoc etworks, IEEE Trasactios o Mobile Computig, vol. 3, o. 4, pp , [8] V. Rodoplu ad T. H.Meg, Core capacity of wireless ad hoc etworks, i The 5th Iteratioal Symposium o Wireless Persoal Multimedia Commuicatios, September 2002, pp [9] M. Kyoug ad V. Rodoplu, Core capacity regio of portable wireless etworks, i Globecom, September 2004, pp [0] F. Xue ad P. R. Kumar, Scalig Laws for Ad Hoc Wireless Networks: A Iformatio Theoretic Approach. NOW Publishers, [] B. Motwai ad P. Raghava, Radomized Algorithms. Cambridge Uiversity Press, 995. [2] D. Marco, E. J. Duarte-Melo, M. Liu, ad D. L. Neuhoff, O the may-to-oe trasport capacity of a dese wireless sesor etwork ad the compressibility of its data, i IPSN, kc c log k Fig. 5. The maximum badwidth required correspodig to differet k VI. CONCLUSION This paper preseted the first closed-form scalig laws for the capacity of wireless ad hoc etworks with heterogeeous traffic. More specifically, we assumed a access ode with k sources choosig this ode as destiatio ad the rest of odes i the etwork, havig uicast commuicatios. It was show that the capacity of such heterogeeous etworks is Θ. Equivaletly, our derivatios reveal that, whe k costat, the the capacity is equal to Θ for k O ad equal to Θ k for k Ω log. Furthermore, whe k costat, the the capacity is Θ. The results demostrate that, as it should be expected, the capacity of a heterogeeous etwork is domiated by the maximum traffic cogestio i ay area of the etwork.
On the Capacity of Hybrid Wireless Networks
O the Capacity of Hybrid ireless Networks Beyua Liu,ZheLiu +,DoTowsley Departmet of Computer Sciece Uiversity of Massachusetts Amherst, MA 0002 + IBM T.J. atso Research Ceter P.O. Box 704 Yorktow Heights,
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 27, NO. 2, FEBRUARY 2009 117
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 27, NO. 2, FEBRUARY 2009 7 Capacity ad Delay of Hybrid ireless Broadbad Access Networks Pa Li, Chi Zhag, Studet Member, IEEE, ad Yuguag Fag, Fellow,
More informationThe Fundamental Capacity-Delay Tradeoff in Large Mobile Ad Hoc Networks
The Fudametal Capacity-Delay Tradeoff i Large Mobile Ad Hoc Networks Xiaoju Li ad Ness B. Shroff School of Electrical ad Computer Egieerig, Purdue Uiversity West Lafayette, IN 47907, U.S.A. {lix, shroff}@ec.purdue.edu
More informationYour organization has a Class B IP address of 166.144.0.0 Before you implement subnetting, the Network ID and Host ID are divided as follows:
Subettig Subettig is used to subdivide a sigle class of etwork i to multiple smaller etworks. Example: Your orgaizatio has a Class B IP address of 166.144.0.0 Before you implemet subettig, the Network
More informationProperties of MLE: consistency, asymptotic normality. Fisher information.
Lecture 3 Properties of MLE: cosistecy, asymptotic ormality. Fisher iformatio. I this sectio we will try to uderstad why MLEs are good. Let us recall two facts from probability that we be used ofte throughout
More informationIn nite Sequences. Dr. Philippe B. Laval Kennesaw State University. October 9, 2008
I ite Sequeces Dr. Philippe B. Laval Keesaw State Uiversity October 9, 2008 Abstract This had out is a itroductio to i ite sequeces. mai de itios ad presets some elemetary results. It gives the I ite Sequeces
More informationIncremental calculation of weighted mean and variance
Icremetal calculatio of weighted mea ad variace Toy Fich faf@cam.ac.uk dot@dotat.at Uiversity of Cambridge Computig Service February 009 Abstract I these otes I eplai how to derive formulae for umerically
More informationLecture 13. Lecturer: Jonathan Kelner Scribe: Jonathan Pines (2009)
18.409 A Algorithmist s Toolkit October 27, 2009 Lecture 13 Lecturer: Joatha Keler Scribe: Joatha Pies (2009) 1 Outlie Last time, we proved the Bru-Mikowski iequality for boxes. Today we ll go over the
More informationTaking DCOP to the Real World: Efficient Complete Solutions for Distributed Multi-Event Scheduling
Taig DCOP to the Real World: Efficiet Complete Solutios for Distributed Multi-Evet Schedulig Rajiv T. Maheswara, Milid Tambe, Emma Bowrig, Joatha P. Pearce, ad Pradeep araatham Uiversity of Souther Califoria
More informationAsymptotic Growth of Functions
CMPS Itroductio to Aalysis of Algorithms Fall 3 Asymptotic Growth of Fuctios We itroduce several types of asymptotic otatio which are used to compare the performace ad efficiecy of algorithms As we ll
More informationChapter 6: Variance, the law of large numbers and the Monte-Carlo method
Chapter 6: Variace, the law of large umbers ad the Mote-Carlo method Expected value, variace, ad Chebyshev iequality. If X is a radom variable recall that the expected value of X, E[X] is the average value
More informationDepartment of Computer Science, University of Otago
Departmet of Computer Sciece, Uiversity of Otago Techical Report OUCS-2006-09 Permutatios Cotaiig May Patters Authors: M.H. Albert Departmet of Computer Sciece, Uiversity of Otago Micah Colema, Rya Fly
More informationThe analysis of the Cournot oligopoly model considering the subjective motive in the strategy selection
The aalysis of the Courot oligopoly model cosiderig the subjective motive i the strategy selectio Shigehito Furuyama Teruhisa Nakai Departmet of Systems Maagemet Egieerig Faculty of Egieerig Kasai Uiversity
More informationOutput Analysis (2, Chapters 10 &11 Law)
B. Maddah ENMG 6 Simulatio 05/0/07 Output Aalysis (, Chapters 10 &11 Law) Comparig alterative system cofiguratio Sice the output of a simulatio is radom, the comparig differet systems via simulatio should
More informationModified Line Search Method for Global Optimization
Modified Lie Search Method for Global Optimizatio Cria Grosa ad Ajith Abraham Ceter of Excellece for Quatifiable Quality of Service Norwegia Uiversity of Sciece ad Techology Trodheim, Norway {cria, ajith}@q2s.tu.o
More informationChapter 7 Methods of Finding Estimators
Chapter 7 for BST 695: Special Topics i Statistical Theory. Kui Zhag, 011 Chapter 7 Methods of Fidig Estimators Sectio 7.1 Itroductio Defiitio 7.1.1 A poit estimator is ay fuctio W( X) W( X1, X,, X ) of
More informationNormal Distribution.
Normal Distributio www.icrf.l Normal distributio I probability theory, the ormal or Gaussia distributio, is a cotiuous probability distributio that is ofte used as a first approimatio to describe realvalued
More information0.7 0.6 0.2 0 0 96 96.5 97 97.5 98 98.5 99 99.5 100 100.5 96.5 97 97.5 98 98.5 99 99.5 100 100.5
Sectio 13 Kolmogorov-Smirov test. Suppose that we have a i.i.d. sample X 1,..., X with some ukow distributio P ad we would like to test the hypothesis that P is equal to a particular distributio P 0, i.e.
More informationDomain 1 - Describe Cisco VoIP Implementations
Maual ONT (642-8) 1-800-418-6789 Domai 1 - Describe Cisco VoIP Implemetatios Advatages of VoIP Over Traditioal Switches Voice over IP etworks have may advatages over traditioal circuit switched voice etworks.
More informationRecovery time guaranteed heuristic routing for improving computation complexity in survivable WDM networks
Computer Commuicatios 30 (2007) 1331 1336 wwwelseviercom/locate/comcom Recovery time guarateed heuristic routig for improvig computatio complexity i survivable WDM etworks Lei Guo * College of Iformatio
More informationI. Chi-squared Distributions
1 M 358K Supplemet to Chapter 23: CHI-SQUARED DISTRIBUTIONS, T-DISTRIBUTIONS, AND DEGREES OF FREEDOM To uderstad t-distributios, we first eed to look at aother family of distributios, the chi-squared distributios.
More informationBaan Service Master Data Management
Baa Service Master Data Maagemet Module Procedure UP069A US Documetiformatio Documet Documet code : UP069A US Documet group : User Documetatio Documet title : Master Data Maagemet Applicatio/Package :
More information5 Boolean Decision Trees (February 11)
5 Boolea Decisio Trees (February 11) 5.1 Graph Coectivity Suppose we are give a udirected graph G, represeted as a boolea adjacecy matrix = (a ij ), where a ij = 1 if ad oly if vertices i ad j are coected
More informationMulticast Capacity in Mobile Wireless Ad Hoc Network with Infrastructure Support
Multicast apacity i Mobile ireless Ad Hoc Networ with Ifrastructure Support Xi he, etao Huag ad Xibig ag Departmet of Electroic Egieerig Shaghai Jiao Tog Uiversity, hia Email: qfbzcx,yelohuag,xwag8}@sjtu.edu.c
More informationVladimir N. Burkov, Dmitri A. Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT
Keywords: project maagemet, resource allocatio, etwork plaig Vladimir N Burkov, Dmitri A Novikov MODELS AND METHODS OF MULTIPROJECTS MANAGEMENT The paper deals with the problems of resource allocatio betwee
More informationLECTURE 13: Cross-validation
LECTURE 3: Cross-validatio Resampli methods Cross Validatio Bootstrap Bias ad variace estimatio with the Bootstrap Three-way data partitioi Itroductio to Patter Aalysis Ricardo Gutierrez-Osua Texas A&M
More informationTHE ABRACADABRA PROBLEM
THE ABRACADABRA PROBLEM FRANCESCO CARAVENNA Abstract. We preset a detailed solutio of Exercise E0.6 i [Wil9]: i a radom sequece of letters, draw idepedetly ad uiformly from the Eglish alphabet, the expected
More informationApproximating Area under a curve with rectangles. To find the area under a curve we approximate the area using rectangles and then use limits to find
1.8 Approximatig Area uder a curve with rectagles 1.6 To fid the area uder a curve we approximate the area usig rectagles ad the use limits to fid 1.4 the area. Example 1 Suppose we wat to estimate 1.
More informationMulti-server Optimal Bandwidth Monitoring for QoS based Multimedia Delivery Anup Basu, Irene Cheng and Yinzhe Yu
Multi-server Optimal Badwidth Moitorig for QoS based Multimedia Delivery Aup Basu, Iree Cheg ad Yizhe Yu Departmet of Computig Sciece U. of Alberta Architecture Applicatio Layer Request receptio -coectio
More informationLecture 4: Cheeger s Inequality
Spectral Graph Theory ad Applicatios WS 0/0 Lecture 4: Cheeger s Iequality Lecturer: Thomas Sauerwald & He Su Statemet of Cheeger s Iequality I this lecture we assume for simplicity that G is a d-regular
More informationUniversal coding for classes of sources
Coexios module: m46228 Uiversal codig for classes of sources Dever Greee This work is produced by The Coexios Project ad licesed uder the Creative Commos Attributio Licese We have discussed several parametric
More informationSoving Recurrence Relations
Sovig Recurrece Relatios Part 1. Homogeeous liear 2d degree relatios with costat coefficiets. Cosider the recurrece relatio ( ) T () + at ( 1) + bt ( 2) = 0 This is called a homogeeous liear 2d degree
More informationChapter 5: Inner Product Spaces
Chapter 5: Ier Product Spaces Chapter 5: Ier Product Spaces SECION A Itroductio to Ier Product Spaces By the ed of this sectio you will be able to uderstad what is meat by a ier product space give examples
More informationSECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES
SECTION 1.5 : SUMMATION NOTATION + WORK WITH SEQUENCES Read Sectio 1.5 (pages 5 9) Overview I Sectio 1.5 we lear to work with summatio otatio ad formulas. We will also itroduce a brief overview of sequeces,
More informationChatpun Khamyat Department of Industrial Engineering, Kasetsart University, Bangkok, Thailand ocpky@hotmail.com
SOLVING THE OIL DELIVERY TRUCKS ROUTING PROBLEM WITH MODIFY MULTI-TRAVELING SALESMAN PROBLEM APPROACH CASE STUDY: THE SME'S OIL LOGISTIC COMPANY IN BANGKOK THAILAND Chatpu Khamyat Departmet of Idustrial
More informationDesigning Incentives for Online Question and Answer Forums
Desigig Icetives for Olie Questio ad Aswer Forums Shaili Jai School of Egieerig ad Applied Scieces Harvard Uiversity Cambridge, MA 0238 USA shailij@eecs.harvard.edu Yilig Che School of Egieerig ad Applied
More informationLecture 4: Cauchy sequences, Bolzano-Weierstrass, and the Squeeze theorem
Lecture 4: Cauchy sequeces, Bolzao-Weierstrass, ad the Squeeze theorem The purpose of this lecture is more modest tha the previous oes. It is to state certai coditios uder which we are guarateed that limits
More information1 Correlation and Regression Analysis
1 Correlatio ad Regressio Aalysis I this sectio we will be ivestigatig the relatioship betwee two cotiuous variable, such as height ad weight, the cocetratio of a ijected drug ad heart rate, or the cosumptio
More informationEntropy of bi-capacities
Etropy of bi-capacities Iva Kojadiovic LINA CNRS FRE 2729 Site école polytechique de l uiv. de Nates Rue Christia Pauc 44306 Nates, Frace iva.kojadiovic@uiv-ates.fr Jea-Luc Marichal Applied Mathematics
More informationConvexity, Inequalities, and Norms
Covexity, Iequalities, ad Norms Covex Fuctios You are probably familiar with the otio of cocavity of fuctios. Give a twicedifferetiable fuctio ϕ: R R, We say that ϕ is covex (or cocave up) if ϕ (x) 0 for
More informationSystems Design Project: Indoor Location of Wireless Devices
Systems Desig Project: Idoor Locatio of Wireless Devices Prepared By: Bria Murphy Seior Systems Sciece ad Egieerig Washigto Uiversity i St. Louis Phoe: (805) 698-5295 Email: bcm1@cec.wustl.edu Supervised
More informationTHE HEIGHT OF q-binary SEARCH TREES
THE HEIGHT OF q-binary SEARCH TREES MICHAEL DRMOTA AND HELMUT PRODINGER Abstract. q biary search trees are obtaied from words, equipped with the geometric distributio istead of permutatios. The average
More informationNr. 2. Interpolation of Discount Factors. Heinz Cremers Willi Schwarz. Mai 1996
Nr 2 Iterpolatio of Discout Factors Heiz Cremers Willi Schwarz Mai 1996 Autore: Herausgeber: Prof Dr Heiz Cremers Quatitative Methode ud Spezielle Bakbetriebslehre Hochschule für Bakwirtschaft Dr Willi
More informationNon-life insurance mathematics. Nils F. Haavardsson, University of Oslo and DNB Skadeforsikring
No-life isurace mathematics Nils F. Haavardsso, Uiversity of Oslo ad DNB Skadeforsikrig Mai issues so far Why does isurace work? How is risk premium defied ad why is it importat? How ca claim frequecy
More informationConvention Paper 6764
Audio Egieerig Society Covetio Paper 6764 Preseted at the 10th Covetio 006 May 0 3 Paris, Frace This covetio paper has bee reproduced from the author's advace mauscript, without editig, correctios, or
More information1 Computing the Standard Deviation of Sample Means
Computig the Stadard Deviatio of Sample Meas Quality cotrol charts are based o sample meas ot o idividual values withi a sample. A sample is a group of items, which are cosidered all together for our aalysis.
More informationDiscrete Mathematics and Probability Theory Spring 2014 Anant Sahai Note 13
EECS 70 Discrete Mathematics ad Probability Theory Sprig 2014 Aat Sahai Note 13 Itroductio At this poit, we have see eough examples that it is worth just takig stock of our model of probability ad may
More informationHypothesis testing. Null and alternative hypotheses
Hypothesis testig Aother importat use of samplig distributios is to test hypotheses about populatio parameters, e.g. mea, proportio, regressio coefficiets, etc. For example, it is possible to stipulate
More information1 The Gaussian channel
ECE 77 Lecture 0 The Gaussia chael Objective: I this lecture we will lear about commuicatio over a chael of practical iterest, i which the trasmitted sigal is subjected to additive white Gaussia oise.
More informationMultiplexers and Demultiplexers
I this lesso, you will lear about: Multiplexers ad Demultiplexers 1. Multiplexers 2. Combiatioal circuit implemetatio with multiplexers 3. Demultiplexers 4. Some examples Multiplexer A Multiplexer (see
More informationEstimating Probability Distributions by Observing Betting Practices
5th Iteratioal Symposium o Imprecise Probability: Theories ad Applicatios, Prague, Czech Republic, 007 Estimatig Probability Distributios by Observig Bettig Practices Dr C Lych Natioal Uiversity of Irelad,
More informationMARTINGALES AND A BASIC APPLICATION
MARTINGALES AND A BASIC APPLICATION TURNER SMITH Abstract. This paper will develop the measure-theoretic approach to probability i order to preset the defiitio of martigales. From there we will apply this
More informationPresent Values, Investment Returns and Discount Rates
Preset Values, Ivestmet Returs ad Discout Rates Dimitry Midli, ASA, MAAA, PhD Presidet CDI Advisors LLC dmidli@cdiadvisors.com May 2, 203 Copyright 20, CDI Advisors LLC The cocept of preset value lies
More informationCharacterizing End-to-End Packet Delay and Loss in the Internet
Characterizig Ed-to-Ed Packet Delay ad Loss i the Iteret Jea-Chrysostome Bolot Xiyu Sog Preseted by Swaroop Sigh Layout Itroductio Data Collectio Data Aalysis Strategy Aalysis of packet delay Aalysis of
More informationCS103A Handout 23 Winter 2002 February 22, 2002 Solving Recurrence Relations
CS3A Hadout 3 Witer 00 February, 00 Solvig Recurrece Relatios Itroductio A wide variety of recurrece problems occur i models. Some of these recurrece relatios ca be solved usig iteratio or some other ad
More informationWeek 3 Conditional probabilities, Bayes formula, WEEK 3 page 1 Expected value of a random variable
Week 3 Coditioal probabilities, Bayes formula, WEEK 3 page 1 Expected value of a radom variable We recall our discussio of 5 card poker hads. Example 13 : a) What is the probability of evet A that a 5
More informationData Analysis and Statistical Behaviors of Stock Market Fluctuations
44 JOURNAL OF COMPUTERS, VOL. 3, NO. 0, OCTOBER 2008 Data Aalysis ad Statistical Behaviors of Stock Market Fluctuatios Ju Wag Departmet of Mathematics, Beijig Jiaotog Uiversity, Beijig 00044, Chia Email:
More informationA Faster Clause-Shortening Algorithm for SAT with No Restriction on Clause Length
Joural o Satisfiability, Boolea Modelig ad Computatio 1 2005) 49-60 A Faster Clause-Shorteig Algorithm for SAT with No Restrictio o Clause Legth Evgey Datsi Alexader Wolpert Departmet of Computer Sciece
More informationConfidence Intervals for One Mean
Chapter 420 Cofidece Itervals for Oe Mea Itroductio This routie calculates the sample size ecessary to achieve a specified distace from the mea to the cofidece limit(s) at a stated cofidece level for a
More informationAnnuities Under Random Rates of Interest II By Abraham Zaks. Technion I.I.T. Haifa ISRAEL and Haifa University Haifa ISRAEL.
Auities Uder Radom Rates of Iterest II By Abraham Zas Techio I.I.T. Haifa ISRAEL ad Haifa Uiversity Haifa ISRAEL Departmet of Mathematics, Techio - Israel Istitute of Techology, 3000, Haifa, Israel I memory
More informationDomain 1 Components of the Cisco Unified Communications Architecture
Maual CCNA Domai 1 Compoets of the Cisco Uified Commuicatios Architecture Uified Commuicatios (UC) Eviromet Cisco has itroduced what they call the Uified Commuicatios Eviromet which is used to separate
More informationResearch Article Sign Data Derivative Recovery
Iteratioal Scholarly Research Network ISRN Applied Mathematics Volume 0, Article ID 63070, 7 pages doi:0.540/0/63070 Research Article Sig Data Derivative Recovery L. M. Housto, G. A. Glass, ad A. D. Dymikov
More informationEngineering Data Management
BaaERP 5.0c Maufacturig Egieerig Data Maagemet Module Procedure UP128A US Documetiformatio Documet Documet code : UP128A US Documet group : User Documetatio Documet title : Egieerig Data Maagemet Applicatio/Package
More informationCenter, Spread, and Shape in Inference: Claims, Caveats, and Insights
Ceter, Spread, ad Shape i Iferece: Claims, Caveats, ad Isights Dr. Nacy Pfeig (Uiversity of Pittsburgh) AMATYC November 2008 Prelimiary Activities 1. I would like to produce a iterval estimate for the
More informationCOMPUTING EFFICIENCY METRICS FOR SYNERGIC INTELLIGENT TRANSPORTATION SYSTEMS
Trasport ad Teleuicatio Vol, No 4, 200 Trasport ad Teleuicatio, 200, Volume, No 4, 66 74 Trasport ad Teleuicatio Istitute, Lomoosova, Riga, LV-09, Latvia COMPUTING EFFICIENCY METRICS FOR SYNERGIC INTELLIGENT
More informationSAMPLE QUESTIONS FOR FINAL EXAM. (1) (2) (3) (4) Find the following using the definition of the Riemann integral: (2x + 1)dx
SAMPLE QUESTIONS FOR FINAL EXAM REAL ANALYSIS I FALL 006 3 4 Fid the followig usig the defiitio of the Riema itegral: a 0 x + dx 3 Cosider the partitio P x 0 3, x 3 +, x 3 +,......, x 3 3 + 3 of the iterval
More informationJune 3, 1999. Voice over IP
Jue 3, 1999 Voice over IP This applicatio ote discusses the Hypercom solutio for providig ed-to-ed Iteret protocol (IP) coectivity i a ew or existig Hypercom Hybrid Trasport Mechaism (HTM) etwork, reducig
More informationSequences and Series
CHAPTER 9 Sequeces ad Series 9.. Covergece: Defiitio ad Examples Sequeces The purpose of this chapter is to itroduce a particular way of geeratig algorithms for fidig the values of fuctios defied by their
More informationMaximum Likelihood Estimators.
Lecture 2 Maximum Likelihood Estimators. Matlab example. As a motivatio, let us look at oe Matlab example. Let us geerate a radom sample of size 00 from beta distributio Beta(5, 2). We will lear the defiitio
More informationInfinite Sequences and Series
CHAPTER 4 Ifiite Sequeces ad Series 4.1. Sequeces A sequece is a ifiite ordered list of umbers, for example the sequece of odd positive itegers: 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29...
More informationA Constant-Factor Approximation Algorithm for the Link Building Problem
A Costat-Factor Approximatio Algorithm for the Lik Buildig Problem Marti Olse 1, Aastasios Viglas 2, ad Ilia Zvedeiouk 2 1 Ceter for Iovatio ad Busiess Developmet, Istitute of Busiess ad Techology, Aarhus
More informationReliability Analysis in HPC clusters
Reliability Aalysis i HPC clusters Narasimha Raju, Gottumukkala, Yuda Liu, Chokchai Box Leagsuksu 1, Raja Nassar, Stephe Scott 2 College of Egieerig & Sciece, Louisiaa ech Uiversity Oak Ridge Natioal Lab
More informationConnectivity in Secure Wireless Sensor Networks under Transmission Constraints
Coectivity i Secure Wireless Sesor Networks uder Trasmissio Costraits Ju Zhao Osma Yaga ad Virgil Gligor March 3 04 CMU-CyLab-4-003 CyLab Caregie Mello Uiversity Pittsburgh PA 53 Coectivity i Secure Wireless
More informationIntelligent Sensor Placement for Hot Server Detection in Data Centers - Supplementary File
Itelliget Sesor Placemet for Hot Server Detectio i Data Ceters - Supplemetary File Xiaodog Wag, Xiaorui Wag, Guoliag Xig, Jizhu Che, Cheg-Xia Li ad Yixi Che The Ohio State Uiversity, USA Michiga State
More informationEkkehart Schlicht: Economic Surplus and Derived Demand
Ekkehart Schlicht: Ecoomic Surplus ad Derived Demad Muich Discussio Paper No. 2006-17 Departmet of Ecoomics Uiversity of Muich Volkswirtschaftliche Fakultät Ludwig-Maximilias-Uiversität Müche Olie at http://epub.ub.ui-mueche.de/940/
More informationThe Stable Marriage Problem
The Stable Marriage Problem William Hut Lae Departmet of Computer Sciece ad Electrical Egieerig, West Virgiia Uiversity, Morgatow, WV William.Hut@mail.wvu.edu 1 Itroductio Imagie you are a matchmaker,
More informationOverview of some probability distributions.
Lecture Overview of some probability distributios. I this lecture we will review several commo distributios that will be used ofte throughtout the class. Each distributio is usually described by its probability
More informationHere are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.
This documet was writte ad copyrighted by Paul Dawkis. Use of this documet ad its olie versio is govered by the Terms ad Coditios of Use located at http://tutorial.math.lamar.edu/terms.asp. The olie versio
More information*The most important feature of MRP as compared with ordinary inventory control analysis is its time phasing feature.
Itegrated Productio ad Ivetory Cotrol System MRP ad MRP II Framework of Maufacturig System Ivetory cotrol, productio schedulig, capacity plaig ad fiacial ad busiess decisios i a productio system are iterrelated.
More information5: Introduction to Estimation
5: Itroductio to Estimatio Cotets Acroyms ad symbols... 1 Statistical iferece... Estimatig µ with cofidece... 3 Samplig distributio of the mea... 3 Cofidece Iterval for μ whe σ is kow before had... 4 Sample
More informationLecture 3. denote the orthogonal complement of S k. Then. 1 x S k. n. 2 x T Ax = ( ) λ x. with x = 1, we have. i = λ k x 2 = λ k.
18.409 A Algorithmist s Toolkit September 17, 009 Lecture 3 Lecturer: Joatha Keler Scribe: Adre Wibisoo 1 Outlie Today s lecture covers three mai parts: Courat-Fischer formula ad Rayleigh quotiets The
More informationExploratory Data Analysis
1 Exploratory Data Aalysis Exploratory data aalysis is ofte the rst step i a statistical aalysis, for it helps uderstadig the mai features of the particular sample that a aalyst is usig. Itelliget descriptios
More informationUniversity of California, Los Angeles Department of Statistics. Distributions related to the normal distribution
Uiversity of Califoria, Los Ageles Departmet of Statistics Statistics 100B Istructor: Nicolas Christou Three importat distributios: Distributios related to the ormal distributio Chi-square (χ ) distributio.
More informationMeasures of Spread and Boxplots Discrete Math, Section 9.4
Measures of Spread ad Boxplots Discrete Math, Sectio 9.4 We start with a example: Example 1: Comparig Mea ad Media Compute the mea ad media of each data set: S 1 = {4, 6, 8, 10, 1, 14, 16} S = {4, 7, 9,
More informationMTO-MTS Production Systems in Supply Chains
NSF GRANT #0092854 NSF PROGRAM NAME: MES/OR MTO-MTS Productio Systems i Supply Chais Philip M. Kamisky Uiversity of Califoria, Berkeley Our Kaya Uiversity of Califoria, Berkeley Abstract: Icreasig cost
More informationProject Deliverables. CS 361, Lecture 28. Outline. Project Deliverables. Administrative. Project Comments
Project Deliverables CS 361, Lecture 28 Jared Saia Uiversity of New Mexico Each Group should tur i oe group project cosistig of: About 6-12 pages of text (ca be loger with appedix) 6-12 figures (please
More informationStatistical inference: example 1. Inferential Statistics
Statistical iferece: example 1 Iferetial Statistics POPULATION SAMPLE A clothig store chai regularly buys from a supplier large quatities of a certai piece of clothig. Each item ca be classified either
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Solutions 9 Spring 2006
Exam format UC Bereley Departmet of Electrical Egieerig ad Computer Sciece EE 6: Probablity ad Radom Processes Solutios 9 Sprig 006 The secod midterm will be held o Wedesday May 7; CHECK the fial exam
More informationClass Meeting # 16: The Fourier Transform on R n
MATH 18.152 COUSE NOTES - CLASS MEETING # 16 18.152 Itroductio to PDEs, Fall 2011 Professor: Jared Speck Class Meetig # 16: The Fourier Trasform o 1. Itroductio to the Fourier Trasform Earlier i the course,
More informationDetermining the sample size
Determiig the sample size Oe of the most commo questios ay statisticia gets asked is How large a sample size do I eed? Researchers are ofte surprised to fid out that the aswer depeds o a umber of factors
More informationMajor Coefficients Recovery: a Compressed Data Gathering Scheme for Wireless Sensor Network
This full text paper was peer reviewed at the directio of IEEE Commuicatios Society subject matter experts for publicatio i the IEEE Globecom proceedigs. Major Coefficiets Recovery: a Compressed Data Gatherig
More informationChapter 14 Nonparametric Statistics
Chapter 14 Noparametric Statistics A.K.A. distributio-free statistics! Does ot deped o the populatio fittig ay particular type of distributio (e.g, ormal). Sice these methods make fewer assumptios, they
More informationChair for Network Architectures and Services Institute of Informatics TU München Prof. Carle. Network Security. Chapter 2 Basics
Chair for Network Architectures ad Services Istitute of Iformatics TU Müche Prof. Carle Network Security Chapter 2 Basics 2.4 Radom Number Geeratio for Cryptographic Protocols Motivatio It is crucial to
More informationStudy on the application of the software phase-locked loop in tracking and filtering of pulse signal
Advaced Sciece ad Techology Letters, pp.31-35 http://dx.doi.org/10.14257/astl.2014.78.06 Study o the applicatio of the software phase-locked loop i trackig ad filterig of pulse sigal Sog Wei Xia 1 (College
More informationAP Calculus BC 2003 Scoring Guidelines Form B
AP Calculus BC Scorig Guidelies Form B The materials icluded i these files are iteded for use by AP teachers for course ad exam preparatio; permissio for ay other use must be sought from the Advaced Placemet
More informationOptimal Backpressure Routing for Wireless Networks with Multi-Receiver Diversity
CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS (CISS), INVITED PAPER ON OPTIMIZATION OF COMM. NETWORKS, MARCH 2006 1 Optimal Backpressure Routig for Wireless Networks with Multi-Receiver Diversity Michael
More informationHypergeometric Distributions
7.4 Hypergeometric Distributios Whe choosig the startig lie-up for a game, a coach obviously has to choose a differet player for each positio. Similarly, whe a uio elects delegates for a covetio or you
More informationPROCEEDINGS OF THE YEREVAN STATE UNIVERSITY AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM
PROCEEDINGS OF THE YEREVAN STATE UNIVERSITY Physical ad Mathematical Scieces 2015, 1, p. 15 19 M a t h e m a t i c s AN ALTERNATIVE MODEL FOR BONUS-MALUS SYSTEM A. G. GULYAN Chair of Actuarial Mathematics
More information.04. This means $1000 is multiplied by 1.02 five times, once for each of the remaining sixmonth
Questio 1: What is a ordiary auity? Let s look at a ordiary auity that is certai ad simple. By this, we mea a auity over a fixed term whose paymet period matches the iterest coversio period. Additioally,
More informationOptimal Adaptive Bandwidth Monitoring for QoS Based Retrieval
1 Optimal Adaptive Badwidth Moitorig for QoS Based Retrieval Yizhe Yu, Iree Cheg ad Aup Basu (Seior Member) Departmet of Computig Sciece Uiversity of Alberta Edmoto, AB, T6G E8, CAADA {yizhe, aup, li}@cs.ualberta.ca
More information