A Practical Model for Minimizing Waiting Time in a Transit Network
|
|
- Bertina Howard
- 6 years ago
- Views:
Transcription
1 A Practical Model for Minimizing Waiting Time in a Tranit Network Leila Dianat, MASc, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Youef Shafahi, Ph.D. Aociate Profeor, Department of Civil Engineering, Sharif Univerity of Technology, Tehran, Iran Introduction Nowaday urban planner are attempting to improve attraction of public tranportation. The mot important reaon that impede paenger from chooing public tranportation a their trip mode i waiting time in tranit ytem. According to thi fact need of decreaing ytem waiting time and tranfer coordination i obviou. Tranit waiting time ha two major component: boarding waiting time in the firt tation of the trip and tranfer waiting time in the middle tation. Tranfer waiting time caue more inconvenience for uer a it occur in the middle of the trip. The firt component depend motly on the headway of the line and will be reduced by decreaing the headway while the econd part varie with everal parameter and i more difficult to deal with. The primary purpoe of thi reearch i to create a model to decreae the tranfer waiting time of a ytem with preet headway but to 1
2 make the model more flexible, we let headway vary in a mall range. We put boarding waiting time in the model to minimize both waiting time imultaneouly. In ection 2, we reviewed ome previou reearche on thi ubject. Section 3 i the repreentation of the model. In ection 4 we decribed the olution method and ection 5 combine unreal and real life example to how efficiency of the model. Finally concluion are explained in ection 6. Literature review Recent tudie in tranfer optimization have been reviewed and a ummary i explained. Ceder et al. (2000) preented a MIP model to maximize the number of imultaneou arrival of bue from different line at tranfer tation. In thi model headway are not preet but they hould vary between a maximum and minimum value. The deciion variable i the departure time of i-th vehicle in line k (x ik ) and the difference between x (i+1)k and x ik hould be in the range [Hmax k, Hmin k ]. The travel time of each vehicle i aumed to be determinitic and predictable. Small network may be olved directly with thi model but to olve large cale one heuritic approache are ued. Quak (2003) changed the objective function of Ceder model to minimize paenger waiting time and olved hi model by ome change in Ceder heuritic model. Ting (1997) preented two model for tranfer coordination. He aimed to minimize cot of ytem by optimizing headway and dwell time. In hi firt model travel time are conidered to be determinitic and analytical method are ued to olve the model while in the econd model travel time are probabilitic and heuritic method are applied to olve it. Fleurent et al (2004) introduced three concept of tranfer waiting time: minimum, ideal and maximum tranfer waiting time. They made a compoite quality index for ynchronization and entered it in 2
3 the cot function a well a other cot. Finally they olved the model uing a Lagrangean relaxation and heuritic mechanim. Cevallo and Zhao (2006) attempted to hift the exiting timetable. Their model ued riderhip data at all tranfer tation and conidered randomne of bu arrival at tation. They olved a network with 80 line and 255 tranfer tation baed on genetic algorithm. The reult howed 12.1% reduction in the tranfer waiting time. Chung and Shalaby (2008) preented an optimization model to modify the exiting timetable of the tranit network and exerted extra dwell time in tranfer tation. They aumed that bue arrival time at tranfer tation followed a log-normal ditribution. Thi model wa olved uing genetic algorithm approach. Shafahi and Khani (2010) propoed two IP model to minimize paenger tranfer waiting time in the network. The variable of the firt model i the tart time of the firt vehicle of each line from the firt tation. In the econd model the top time of each vehicle at tranfer tation i alo conidered. Shafahi and Khani olved their model by CPLEX package for mall network and Genetic Algorithm for large network. Mollanejad (2010) propoed a MIP model to minimize the total waiting time of paenger in tranfer node of the tranit network. The variable of thi model i the headway of the line which i aumed to be uneven. He olved hi model uing CPLEX package for mall network and imulated annealing algorithm for large network. Thi reearch attempt to deal with waiting time and preent a mathematical formulation and an efficient olution procedure for tranit network of every ize. Waiting time optimization model The propoed model for minimizing waiting time in a public tranportation ytem are two mixed integer non-linear program (MINLP). Objective function of both model i um of tranfer and 3
4 non-tranfer waiting time in the ytem. Deciion variable in the firt model are headway and departure time of the firt vehicle of each line from the firt tation. In the econd model which i formulated by expanding the firt model, an extra top time i conidered for line in tranfer tation, o there would be more ucceful tranfer. Model aumption Some aumption are made to make the model impler. The main one are a below: The tranit network and fleet ize are given. Headway of each line i uniform during the planning duration and varie in a mall determined range o that fleet ize doe not change. Travel time in each ection i given and conidered to be contant. Travel demand and paenger choen route are given and are independent of ytem characteritic. A primary top time i conidered for vehicle in each tranfer tation, o paenger can get off and on the vehicle. In the econd model thi value i the output of the model. Paenger tranfer time between line in each tranfer tation i a given contant value. Thi time i the minimum poible time that paenger can tranfer between vehicle. In each tranfer tation, tranferring paenger elect the firt vehicle of the target line for tranferring in order to reduce their tranfer waiting time. Paenger average boarding waiting time for each line i aumed to be half of the headway of that line. Variable and input parameter The input parameter of the model are: R: et of all line in the tranit network; i, j and k are line indice, 4
5 S: et of all tranfer tation in the tranit network; i the tranfer tation index, S j : et of all tranfer tation in tranit network in line j, h0 i : Current headway of line i (in minute), t i : Travel time of vehicle from tarting point of line i to tranfer tation, dt i : Stopping time of vehicle in line i at tranfer tation, tp ij : Number of paenger tranferring from line i to line j at tranfer tation during the planning duration, p i : Total number of paenger in line i not tranferring at tranfer tation during the planning duration (taying aboard), tt ij : required tranfer time for paenger tranferring from line i to line j at tranfer tation. Thi value i the time needed for a paenger to walk from the vehicle in line i to the vehicle in line j. p i : Total paenger of line i including tranfer and non-tranfer paenger during the planning duration. Deciion variable in the firt propoed model are: x k = Departure time of the firt vehicle of line i from it firt tation, h k = Adjuted headway of line k; Other variable are: WT ij = minimum waiting time of paenger tranferring from line i to line j in tranfer tation, AWt ij = average waiting time of paenger tranferring from line i to line j in tranfer tation, 5
6 g ij = greatet common divior of adjuted headway h i and h j, y1 ij, y2 ij = integer variable, w ij = binary variable, Z: objective function; um of both tranfer and non-tranfer waiting time in all origin and tranfer tation, Problem formulation Conider paenger of line i in their origin, we aumed an average boarding waiting time equal to h i /2 for them. So the total boarding waiting time of paenger of line i during planning duration would be equal to p i h i /2 and the total boarding waiting time in the network would be i p i h i /2. Now let u conider paenger tranferring from line i to line j, their tranfer waiting time would be equal to (Shafahi and Khani, 2010): WT ij = x j + t j + dt j + y2 ij h j x i + t i + tt ij + y1 ij h i, i, jϵr, ϵs (1) In thi equation (x i + t i + tt ij ) i the arrival time of the paenger of the firt vehicle of line i and (x j + t j + dt j ) i the departure time of the firt vehicle of line j. If the tranfer paenger from line i reach the firt vehicle of line j the difference between thee two entence would be their tranfer waiting time; however, we hould conider two cae here: firt, the paenger of the firt vehicle of line i may mi their tranfer to the firt vehicle of line j; under thi condition, they hould wait for the next vehicle of line j. To calculate their waiting time under thi circumtance, we added y2 ij h j to the equation. Second, thi tranfer waiting time may exceed h i. A we are calculating minimum tranfer waiting time, we hould conider paenger of all of the vehicle from line i that have arrived during thi period, thu, we added y1 ij h i to the model. 6
7 y1 ij and y2 ij are calculated to gain the minimum waiting time. If headway of line i and j were not equal, the minimum tranfer waiting time from line i to line j would not be equal for all the vehicle of line i, o an average waiting time i calculated a below (Shafahi and Khani,2010): AWT ij = WT ij + (h j i, jϵr, ϵs (2) g ij )/2, Tranfer waiting time for all the paenger changing their line from i to j in the tranfer tation would be AWT ij tp ij during planning duration. By umming thi value for all poible ij- in tranfer tation we can calculate total tranfer waiting time in tranfer paenger and by umming thi value for all tranfer tation in the network we will calculate the total tranfer waiting time in the network. Now we can propoe the firt model: Minimize z = tp ij AWT ij + p ih i 2 i j WT ij = x j + t j + dt j + y2 ij g ij x i + t i + tt ij + y1 ij g ij, i (3) i, jϵr, ϵs (4) WT ij 0, i, jϵr, ϵs (5) WT ij < g ij, i, jϵr, ϵs (6) AWT ij = WT ij + (h j g ij /2), i, jϵr, ϵs (7) AWT ij h j, i, jϵr, ϵs (8) x k < h k, kϵr x k 0, kϵr minh k h k max h k, kϵr y1 ij : integer, i, jϵr, ϵs : integer, i, jϵr, ϵs y2 ij (9) (10) (11) (12) (13) 7
8 The objective function i the um of both tranfer and non-tranfer waiting time in the network. Contraint 4 calculate the minimum waiting time. Contraint 5 and 6 how the upper and lower bound of the minimum waiting time, repectively. Contraint 7 i the definition of average waiting time. Contraint 8 i the upper bound of average waiting time. Contraint 9 guarantee the practicality of the model. Contraint 11 how the range in which headway can change to gain the minimum waiting time without cauing change in the frequency. To reduce the olving time an upper bound i conidered for y1 ij and a below (Shafahi and Khani, 2010): y2 ij y1 ij. up = t j t i + h ih j /g g ij ij y2 ij. up = t j t i + h ih j /g g ij ij (14) (15) We can alo include contraint 16 and 17. A a reult, one of the y1 ij or y2 ij would be zero and the other one would have a non-zero value. y1 ij M(W ij ), i, jϵr, ϵs (16) M(1 W ij ), i, jϵr, ϵs (17) y2 ij A an expanion of the firt model we propoed a econd model. In the firt model we conidered a contant top time for vehicle in the tranfer tation, in the econd model we added the extra top time (edt j ) to the deciion variable of the model. Therefore, paenger who mi their tranfer with a mall gap would have more ucceful tranfer; However, thi extra waiting time hould not exceed an upper bound, becaue the aboard paenger travel time would increae and thi decreae their tendency toward uing public tranportation; Moreover, next vehicle would arrive and thi extra top time would be uele. By entering the new variable to the model ome change are made. Firt, the definition of minimum tranfer waiting time will change a below: WT ij = x j + t j + dt j + edt j + y2 ij g ij x i + t i + tt ij + y1 ij g ij, (18) 8
9 i, jϵr, ϵs In which t j i the travel time from the firt tation to the tranfer tation and i calculated a below: t j = t n j + edt j, nϵsb j jϵr, ϵs (19) where Sb j i the et of all tranfer tation in the tranit network placed in line i before tation. Upper bound that are conidered for extra waiting time in each tranfer tation and alo total extra waiting time in the network are hown in contraint 20, 21 repectively. edt j max_edt j, jϵr, ϵs (20) edt j ϵs j max_tedt j, jϵr, ϵs (21) Finally we hould add the extra travel time of the non-tranfer aboard paenger when the vehicle top for a longer time in tranfer tation. Thi time i equal to p j edt j, therefore, the total extra travel time in all tranfer tation i j p j edt j. The propoed model i repreented here: Minimize z = tp ij AWT ij i j + p ih i 2 i + p j edt j j (22) Contraint Contraint 5-13 Contraint Genetic Algorithm Approach Complexity of the model i motly caued by calculating integer variable y1 ij, y2 ij and alo g ij. Conidering run time and lack of memory, model cannot be olved by common olver package. On the ground of thi fact, we needed a heuritic approach to olve the model. A genetic algorithm i created to olve even very large network uch a urban metropolitan. Thi approach i briefly decribed here. 9
10 The deciion variable of the firt model are departure time of the firt vehicle of each line from the firt tation (x k ) and headway of each line (h k ), o chromoome include thee two variable a their gene in the GA. Fitne function i the total waiting time in the network which i the ame a the firt model objective function. x k are defined a double variable which can change in the range [0, h k ] and h k are defined a integer variable that vary in the range [hmin k, hmax k ]. The firt population i created randomly. To create the population of next generation we ued linear croover and mutation operator. Through the linear croover value of the ame gene of two chromoome are replaced, o the value of gene are till in their range. A croover operation may reult in local optimum, we hould exert mutation to earch the feaible region completely. Through mutation random value are added to the gene which are choen randomly. Thi may caue gene value to exceed their bound. To prevent thi we divided gene value to their range and replaced them with the remainder of thi diviion to aure that the value are in the feaible region. The other proce in the genetic algorithm i the election of the chromoome for the next generation. The common election procee are Roulette wheel and Elititim. We ued both of the procedure in thi reearch. The final tep i to determine termination criteria of the algorithm. The three criteria that we ued in thi reearch are: The bet olution doe not change after a given number of iteration. The difference between the bet and wort olution in a population i le than a given value, i.e., 1%. A maximum number of iteration i reached. To run the algorithm we need to determine value of algorithm parameter. One of thee parameter i the ratio of croovermutation, we gained that by running the algorithm with different ratio for contant number of iteration and invetigate the convergence in each of the run and finally we choe the bet rate. The other parameter wa number of chromoome in each generation. We found the bet population ize following the ame methodology a wa decribed for the croover-mutation ratio. Optimal number of iteration i alo determined conidering run time and convergence. 10
11 To olve the econd model we alo ued the ame genetic algorithm with ome change. We hould add extra top time of vehicle in tranfer tation to the variable. A all the line do not pa all the tranfer tation, we only conidered thoe i and for which p i i defined. We replaced thi variable in the algorithm with y i. y i i defined a integer variable which can change in a pecified range. Therefore, the vector formed the gene of the chromoome include (x i, h i, y i ). The fitne function i the ame a objective function of the econd model. The other procedure are the ame a the firt model. A Real Cae Study: City Of Mahhad Mahhad real life network i ued to evaluate the efficiency of model and genetic algorithm approach. Mahhad network i a large network with 139 two way (278 one way) bu line and 3618 bu top of which 841 one are tranfer tation. Figure 1 how Mahhad network. To etimate the value of the model parameter we performed tranit aignment uing Optimal Strategy in TranCAD oftware. Then, we applied genetic algorithm to olve the model of thi network. Headway of thee line vary between 2 and 165. We conidered a ±10% change in the headway value in order not to change the fleet ize. Alo the upper bound of the edt i wa defined a below: edt i. up = min 4, h i 4 (23) We etimated GA parameter a decribed before. We ran the GA for croover mutation ratio of 0.2, 0.3, 0.4, 0.5, 0.6, 0.7 and 0.8 with 2000 iteration, the optimal croover mutation ratio wa 0.5 conidering the GA convergence, then we ran GA with thi optimal croover mutation ratio with population ize of 10, 20, 30 and the optimal population ize wa found 20 regarding run time. We alo conidered 5000 iteration for termination. 11
12 Figure 1- Mahhad City bu network Finally 3 cenario were olved uing GA. The reult are hown in table 1. Table 1 Mahhad tranit network cheduling reult cenario Objective function value Objective function improvement No planning % Firt model % Second model % By the current condition of the network, waiting time in the whole network during the planning duration i minute. By exerting the new condition that i the reult of the firt model the waiting time would increae to minute, thi mean 12.5% improvement in the ytem which i equal to minute aving time for paenger. Finally by olving the econd model the objective 12
13 function value would reduce to minute. The improvement i 13.16% or minute. Comparing two propoed model, the econd model i 0.8% more efficient than the firt one; however, we hould notice that thee reult are not the optimal olution. The trend of the firt and econd model objective function improvement veru iteration i hown in figure 2 and 3 repectively. Finally we can conclude that both model are efficient in reducing waiting time of the paenger in the tranit network and GA i an appropriate approach to olve the large cale network a it doe not have limitation for the number of variable and contraint. fitne function number of iteration Figure 2- Trend of firt model objective function improvement by number of iteration for Mahhad city tranit network uing the genetic algorithm 13
14 fitne function number of iteration Figure 3- Trend of econd model objective function improvement by number of iteration for Mahhad city tranit network uing the genetic algorithm Concluion In thi paper we repreented two model to minimize tranfer and non-tranfer waiting time in a tranit network imultaneouly. According to the high number of variable uing a heuritic approach to olve the model wa neceary and we verified the reult with the reult of Shafahi and Khani (2010) olution. Finally, we created a genetic algorithm and applied it for a large real life tranit network. We made the following concluion: By a mall change in headway, there would be a reaonable reduction in the network waiting time; it i noticeable that we aumed uniform headway for each tranit line. Improvement of the econd model in comparing with the firt model how that extra top time in the tranfer tation caue more ucceful tranfer and reduce waiting time in the ytem. More ignificant origin and tranfer tation can be weighted in the model baed on their numbr of paenger. Both of the propoed model reduce the waiting time ignificantly. 14
15 Finally for eae of the modeling in thi reearch it i aumed that demand of each line i fixed (independent of it characteritic), a an extenion of thi reearch, the influence of the changed parameter on demand can be tudied. Alo tochatic travel time can be conidered intead of contant one. Other heuritic approache or a combination of them can be ued to olve the model. Moreover, in thi model half of the headway of each line i conidered a it average boarding waiting time, it can be replaced with better value. Bibliography Ceder A., Golany B. and Tal O., 2000, Creating bu timetable with maximal ynchronization, Tranportation Reearch - Part A 35, Cevallo, F.,Zhao, F., 2006, Minimizing Tranfer Time in a Public Tranit Network with a Genetic Algorithm. Tranportation Reearch Record, No. 1971, Wahington D.C., 2006,pp Fleurent, C., Leerd, R., and Segiun, L., Tranit Timetable Synchronization : Evaluation and Optimization, 9th International Conference on Computer Aided Scheduling in Public Tranport, San Diego California, Augut, Mollanejad, M., 2010, Creating Bu Timetable with Maximum Synchronization, MSC. Thei, Sharif Univerity of Technology, Iran. Quak, C.B., Bu line planning. Shafahi,Y., Khani, A., 2010, A practical model for tranfer optimization in a tranit network: Model formulation and olution, Tranportation Reearch, Part A, NO.44, pp Ting Ching-Jung.,1997, Tranfer coordination in tranit network, Ph.D diertation, Univerity of Maryland at College Park, MD. 15
DAROS: Distributed User-Server Assignment And Replication For Online Social Networking Applications
DAROS: Ditributed Uer-Server Aignment And Replication For Online Social Networking Application Thuan Duong-Ba School of EECS Oregon State Univerity Corvalli, OR 97330, USA Email: duongba@eec.oregontate.edu
More informationA Multi-objective Genetic Algorithm for Reliability Optimization Problem
International Journal of Performability Engineering, Vol. 5, No. 3, April 2009, pp. 227-234. RAMS Conultant Printed in India A Multi-objective Genetic Algorithm for Reliability Optimization Problem AMAR
More informationUniversität Augsburg. Institut für Informatik. Approximating Optimal Visual Sensor Placement. E. Hörster, R. Lienhart.
Univerität Augburg à ÊÇÅÍÆ ËÀǼ Approximating Optimal Viual Senor Placement E. Hörter, R. Lienhart Report 2006-01 Januar 2006 Intitut für Informatik D-86135 Augburg Copyright c E. Hörter, R. Lienhart Intitut
More informationLecture 14: Minimum Spanning Tree I
COMPSCI 0: Deign and Analyi of Algorithm October 4, 07 Lecture 4: Minimum Spanning Tree I Lecturer: Rong Ge Scribe: Fred Zhang Overview Thi lecture we finih our dicuion of the hortet path problem and introduce
More informationRefining SIRAP with a Dedicated Resource Ceiling for Self-Blocking
Refining SIRAP with a Dedicated Reource Ceiling for Self-Blocking Mori Behnam, Thoma Nolte Mälardalen Real-Time Reearch Centre P.O. Box 883, SE-721 23 Väterå, Sweden {mori.behnam,thoma.nolte}@mdh.e ABSTRACT
More informationPerformance of a Robust Filter-based Approach for Contour Detection in Wireless Sensor Networks
Performance of a Robut Filter-baed Approach for Contour Detection in Wirele Senor Network Hadi Alati, William A. Armtrong, Jr., and Ai Naipuri Department of Electrical and Computer Engineering The Univerity
More informationDistributed Packet Processing Architecture with Reconfigurable Hardware Accelerators for 100Gbps Forwarding Performance on Virtualized Edge Router
Ditributed Packet Proceing Architecture with Reconfigurable Hardware Accelerator for 100Gbp Forwarding Performance on Virtualized Edge Router Satohi Nihiyama, Hitohi Kaneko, and Ichiro Kudo Abtract To
More informationAn Approach to a Test Oracle for XML Query Testing
An Approach to a Tet Oracle for XML Query Teting Dae S. Kim-Park, Claudio de la Riva, Javier Tuya Univerity of Oviedo Computing Department Campu of Vieque, /n, 33204 (SPAIN) kim_park@li.uniovi.e, claudio@uniovi.e,
More informationHassan Ghaziri AUB, OSB Beirut, Lebanon Key words Competitive self-organizing maps, Meta-heuristics, Vehicle routing problem,
COMPETITIVE PROBABIISTIC SEF-ORGANIZING MAPS FOR ROUTING PROBEMS Haan Ghaziri AUB, OSB Beirut, ebanon ghaziri@aub.edu.lb Abtract In thi paper, we have applied the concept of the elf-organizing map (SOM)
More informationKey Terms - MinMin, MaxMin, Sufferage, Task Scheduling, Standard Deviation, Load Balancing.
Volume 3, Iue 11, November 2013 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Tak Aignment in
More informationIncreasing Throughput and Reducing Delay in Wireless Sensor Networks Using Interference Alignment
Int. J. Communication, Network and Sytem Science, 0, 5, 90-97 http://dx.doi.org/0.436/ijcn.0.50 Publihed Online February 0 (http://www.scirp.org/journal/ijcn) Increaing Throughput and Reducing Delay in
More information1 The secretary problem
Thi i new material: if you ee error, pleae email jtyu at tanford dot edu 1 The ecretary problem We will tart by analyzing the expected runtime of an algorithm, a you will be expected to do on your homework.
More informationA METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS
Vietnam Journal of Science and Technology 55 (5) (017) 650-657 DOI: 10.1565/55-518/55/5/906 A METHOD OF REAL-TIME NURBS INTERPOLATION WITH CONFINED CHORD ERROR FOR CNC SYSTEMS Nguyen Huu Quang *, Banh
More informationStochastic Search and Graph Techniques for MCM Path Planning Christine D. Piatko, Christopher P. Diehl, Paul McNamee, Cheryl Resch and I-Jeng Wang
Stochatic Search and Graph Technique for MCM Path Planning Chritine D. Piatko, Chritopher P. Diehl, Paul McNamee, Cheryl Rech and I-Jeng Wang The John Hopkin Univerity Applied Phyic Laboratory, Laurel,
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each type of circuit will be implemented in two
More informationSee chapter 8 in the textbook. Dr Muhammad Al Salamah, Industrial Engineering, KFUPM
Goal programming Objective of the topic: Indentify indutrial baed ituation where two or more objective function are required. Write a multi objective function model dla a goal LP Ue weighting um and preemptive
More informationA System Dynamics Model for Transient Availability Modeling of Repairable Redundant Systems
International Journal of Performability Engineering Vol., No. 3, May 05, pp. 03-. RAMS Conultant Printed in India A Sytem Dynamic Model for Tranient Availability Modeling of Repairable Redundant Sytem
More informationRouting Definition 4.1
4 Routing So far, we have only looked at network without dealing with the iue of how to end information in them from one node to another The problem of ending information in a network i known a routing
More informationPerformance Evaluation of an Advanced Local Search Evolutionary Algorithm
Anne Auger and Nikolau Hanen Performance Evaluation of an Advanced Local Search Evolutionary Algorithm Proceeding of the IEEE Congre on Evolutionary Computation, CEC 2005 c IEEE Performance Evaluation
More informationSLA Adaptation for Service Overlay Networks
SLA Adaptation for Service Overlay Network Con Tran 1, Zbigniew Dziong 1, and Michal Pióro 2 1 Department of Electrical Engineering, École de Technologie Supérieure, Univerity of Quebec, Montréal, Canada
More informationChapter 13 Non Sampling Errors
Chapter 13 Non Sampling Error It i a general aumption in the ampling theory that the true value of each unit in the population can be obtained and tabulated without any error. In practice, thi aumption
More informationService and Network Management Interworking in Future Wireless Systems
Service and Network Management Interworking in Future Wirele Sytem V. Tountopoulo V. Stavroulaki P. Demeticha N. Mitrou and M. Theologou National Technical Univerity of Athen Department of Electrical Engineering
More informationAnalysis of the results of analytical and simulation With the network model and dynamic priority Unchecked Buffer
International Reearch Journal of Applied and Baic Science 218 Available online at www.irjab.com ISSN 2251-838X / Vol, 12 (1): 49-53 Science Explorer Publication Analyi of the reult of analytical and imulation
More informationModeling and Analysis of Slow CW Decrease for IEEE WLAN
Modeling and Analyi of Slow CW Decreae for IEEE 82. WLAN Qiang Ni, Imad Aad 2, Chadi Barakat, and Thierry Turletti Planete Group 2 Planete Group INRIA Sophia Antipoli INRIA Rhône-Alpe Sophia Antipoli,
More informationAN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROBLEM
RAC Univerity Journal, Vol IV, No, 7, pp 87-9 AN ALGORITHM FOR RESTRICTED NORMAL FORM TO SOLVE DUAL TYPE NON-CANONICAL LINEAR FRACTIONAL PROGRAMMING PROLEM Mozzem Hoain Department of Mathematic Ghior Govt
More informationCutting Stock by Iterated Matching. Andreas Fritsch, Oliver Vornberger. University of Osnabruck. D Osnabruck.
Cutting Stock by Iterated Matching Andrea Fritch, Oliver Vornberger Univerity of Onabruck Dept of Math/Computer Science D-4909 Onabruck andy@informatikuni-onabrueckde Abtract The combinatorial optimization
More informationUC Berkeley International Conference on GIScience Short Paper Proceedings
UC Berkeley International Conference on GIScience Short Paper Proceeding Title A novel method for probabilitic coverage etimation of enor network baed on 3D vector repreentation in complex urban environment
More informationA Hybrid Deployable Dynamic Traffic Assignment Framework for Robust Online Route Guidance
A Hybrid Deployable Dynamic Traffic Aignment Framework for Robut Online Route Guidance Sriniva Peeta School of Civil Engineering, Purdue Univerity Chao Zhou Sabre, Inc. Sriniva Peeta School of Civil Engineering
More informationModeling of underwater vehicle s dynamics
Proceeding of the 11th WEA International Conference on YTEM, Agio Nikolao, Crete Iland, Greece, July 23-25, 2007 44 Modeling of underwater vehicle dynamic ANDRZEJ ZAK Department of Radiolocation and Hydrolocation
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory Univerity of Nebraka-Lincoln Email: yzheng choueiry@ce.unl.edu Abtract.
More informationGenetic Algorithms for Optimal Scheduling of Chlorine Dosing in Water Distribution Systems
oz343 Genetic Algorithm for Optimal Scheduling of hlorine Doing in Water Ditribution Sytem arl Rouhiainen, urtin Univerity, rouhiacj@e.curtin.edu.au Moe O. Tade, urtin Univerity, tadem@che.curtin.edu.au
More informationModeling the Effect of Mobile Handoffs on TCP and TFRC Throughput
Modeling the Effect of Mobile Handoff on TCP and TFRC Throughput Antonio Argyriou and Vijay Madietti School of Electrical and Computer Engineering Georgia Intitute of Technology Atlanta, Georgia 3332 25,
More information3-D Visualization of a Gene Regulatory Network: Stochastic Search for Layouts
3-D Viualization of a Gene Regulatory Network: Stochatic Search for Layout Naoki Hooyama Department of Electronic Engineering, Univerity of Tokyo, Japan hooyama@iba.k.u-tokyo.ac.jp Abtract- In recent year,
More informationAn Intro to LP and the Simplex Algorithm. Primal Simplex
An Intro to LP and the Simplex Algorithm Primal Simplex Linear programming i contrained minimization of a linear objective over a olution pace defined by linear contraint: min cx Ax b l x u A i an m n
More informationEvolution of Non-Deterministic Incremental Algorithms. Hugues Juille. Volen Center for Complex Systems. Brandeis University. Waltham, MA
Evolution of Non-Determinitic Incremental Algorithm a a New Approach for Search in State Space Hugue Juille Computer Science Department Volen Center for Complex Sytem Brandei Univerity Waltham, MA 02254-9110
More informationnp vp cost = 0 cost = c np vp cost = c I replacing term cost = c+c n cost = c * Error detection Error correction pron det pron det n gi
Spoken Language Paring with Robutne and ncrementality Yohihide Kato, Shigeki Matubara, Katuhiko Toyama and Yauyohi nagaki y Graduate School of Engineering, Nagoya Univerity y Faculty of Language and Culture,
More informationLocalized Minimum Spanning Tree Based Multicast Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Sensor Networks
Localized Minimum Spanning Tree Baed Multicat Routing with Energy-Efficient Guaranteed Delivery in Ad Hoc and Senor Network Hanne Frey Univerity of Paderborn D-3398 Paderborn hanne.frey@uni-paderborn.de
More informationManeuverable Relays to Improve Energy Efficiency in Sensor Networks
Maneuverable Relay to Improve Energy Efficiency in Senor Network Stephan Eidenbenz, Luka Kroc, Jame P. Smith CCS-5, MS M997; Lo Alamo National Laboratory; Lo Alamo, NM 87545. Email: {eidenben, kroc, jpmith}@lanl.gov
More informationA Procedure for Finding Initial Feasible Solutions on Cyclic Natural Gas Networks
Principal Invetigator/Project Director: Dr. Roger Z. Río Intitution: niveridad Autónoma de Nuevo eón (Mexico) Award Number: CONACYT J33187-A Program: CONACYT Young Invetigator Program Project Title: Intelligent
More informationPlanning of scooping position and approach path for loading operation by wheel loader
22 nd International Sympoium on Automation and Robotic in Contruction ISARC 25 - September 11-14, 25, Ferrara (Italy) 1 Planning of cooping poition and approach path for loading operation by wheel loader
More informationMotion Control (wheeled robots)
3 Motion Control (wheeled robot) Requirement for Motion Control Kinematic / dynamic model of the robot Model of the interaction between the wheel and the ground Definition of required motion -> peed control,
More information[N309] Feedforward Active Noise Control Systems with Online Secondary Path Modeling. Muhammad Tahir Akhtar, Masahide Abe, and Masayuki Kawamata
he 32nd International Congre and Expoition on Noie Control Engineering Jeju International Convention Center, Seogwipo, Korea, Augut 25-28, 2003 [N309] Feedforward Active Noie Control Sytem with Online
More information/06/$ IEEE 364
006 IEEE International ympoium on ignal Proceing and Information Technology oie Variance Etimation In ignal Proceing David Makovoz IPAC, California Intitute of Technology, MC-0, Paadena, CA, 95 davidm@ipac.caltech.edu;
More informationMulti-Target Tracking In Clutter
Multi-Target Tracking In Clutter John N. Sander-Reed, Mary Jo Duncan, W.B. Boucher, W. Michael Dimmler, Shawn O Keefe ABSTRACT A high frame rate (0 Hz), multi-target, video tracker ha been developed and
More informationAdvanced Encryption Standard and Modes of Operation
Advanced Encryption Standard and Mode of Operation G. Bertoni L. Breveglieri Foundation of Cryptography - AES pp. 1 / 50 AES Advanced Encryption Standard (AES) i a ymmetric cryptographic algorithm AES
More informationKeywords Cloud Computing, Service Level Agreements (SLA), CloudSim, Monitoring & Controlling SLA Agent, JADE
Volume 5, Iue 8, Augut 2015 ISSN: 2277 128X International Journal of Advanced Reearch in Computer Science and Software Engineering Reearch Paper Available online at: www.ijarce.com Verification of Agent
More informationDECENTRALIZED structured overlays and distributed. Distributed, Secure Load Balancing with Skew, Heterogeneity, and Churn
Harvard Technical Report TR-3-4 Ditributed, Secure Load Balancing with Skew, Heterogeneity, and Churn Jonathan Ledlie and Margo Seltzer Abtract Numerou propoal exit for load balancing in peer-to-peer (pp)
More informationSeparation of Routing and Scheduling in Backpressure- Based Wireless Networks
Separation of Routing and Scheduling in - Baed Wirele Network The MIT Faculty ha made thi article openly available. Pleae hare how thi acce benefit you. Your tory matter. Citation A Publihed Publiher Seferoglu,
More informationw w w. a j e r. o r g Page 98 Montreal, Canada) Corresponding Author: Essa Abrahim Abdulgader Saleem
American Journal of Engineering Reearch (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-6, Iue-10, pp-98-107 www.ajer.org Reearch Paper Open Acce Multi-objective optimization of multi-tate reliability
More informationTAM 212 Worksheet 3. Solutions
Name: Group member: TAM 212 Workheet 3 Solution The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below.
More informationSemi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
Syracue Univerity SUFAC lectrical ngineering and Computer Science echnical eport College of ngineering and Computer Science 8-1991 Semi-Ditributed Load Balancing for aively Parallel ulticomputer Sytem
More informationKinematics Programming for Cooperating Robotic Systems
Kinematic Programming for Cooperating Robotic Sytem Critiane P. Tonetto, Carlo R. Rocha, Henrique Sima, Altamir Dia Federal Univerity of Santa Catarina, Mechanical Engineering Department, P.O. Box 476,
More informationMinimum Energy Reliable Paths Using Unreliable Wireless Links
Minimum Energy Reliable Path Uing Unreliable Wirele Link Qunfeng Dong Department of Computer Science Univerity of Wiconin-Madion Madion, Wiconin 53706 qunfeng@c.wic.edu Micah Adler Department of Computer
More informationMulticut Benders Decomposition Algorithm for Process Supply Chain Planning under Uncertainty
Multicut Bender Decompoition Algorithm for Proce Supply Chain Planning under Uncertainty Fengqi You 1,2 and Ignacio E. Gromann 3 1 Argonne National Laboratory, Argonne, IL 60439 2 Northwetern Univerity,
More informationA Load Balancing Model based on Load-aware for Distributed Controllers. Fengjun Shang, Wenjuan Gong
4th International Conference on Machinery, Material and Computing Technology (ICMMCT 2016) A Load Balancing Model baed on Load-aware for Ditributed Controller Fengjun Shang, Wenjuan Gong College of Compute
More information3D SMAP Algorithm. April 11, 2012
3D SMAP Algorithm April 11, 2012 Baed on the original SMAP paper [1]. Thi report extend the tructure of MSRF into 3D. The prior ditribution i modified to atify the MRF property. In addition, an iterative
More informationAn efficient resource allocation algorithm for OFDMA cooperative relay networks with fairness and QoS guaranteed
Univerity of Wollongong Reearch Online Faculty of Informatic - Paper (Archive) Faculty of Engineering and Information Science 200 An efficient reource allocation algorithm for OFDMA cooperative relay network
More informationNew Structural Decomposition Techniques for Constraint Satisfaction Problems
113 New Structural Decompoition Technique for Contraint Satifaction Problem Yaling Zheng and Berthe Y. Choueiry Contraint Sytem Laboratory, Univerity of Nebraka-Lincoln {yzheng,choueiry}@ce.unl.edu Abtract.
More informationConnected Placement of Disaster Shelters in Modern Cities
Connected Placement of Diater Shelter in Modern Citie Huanyang Zheng and Jie Wu Department of Computer and Information Science Temple Univerity, USA {huanyang.zheng, jiewu}@temple.edu ABSTRACT Thi paper
More information3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES
MAKARA, TEKNOLOGI, VOL. 9, NO., APRIL 5: 3-35 3D MODELLING WITH LINEAR APPROACHES USING GEOMETRIC PRIMITIVES Mochammad Zulianyah Informatic Engineering, Faculty of Engineering, ARS International Univerity,
More informationHow to Select Measurement Points in Access Point Localization
Proceeding of the International MultiConference of Engineer and Computer Scientit 205 Vol II, IMECS 205, March 8-20, 205, Hong Kong How to Select Meaurement Point in Acce Point Localization Xiaoling Yang,
More informationIntegrated Single-arm Assembly and Manipulation Planning using Dynamic Regrasp Graphs
Proceeding of The 2016 IEEE International Conference on Real-time Computing and Robotic June 6-9, 2016, Angkor Wat, Cambodia Integrated Single-arm Aembly and Manipulation Planning uing Dynamic Regrap Graph
More informationDevelopment of an atmospheric climate model with self-adapting grid and physics
Intitute of Phyic Publihing Journal of Phyic: Conference Serie 16 (2005) 353 357 doi:10.1088/1742-6596/16/1/049 SciDAC 2005 Development of an atmopheric climate model with elf-adapting grid and phyic Joyce
More informationUninformed Search Complexity. Informed Search. Search Revisited. Day 2/3 of Search
Informed Search ay 2/3 of Search hap. 4, Ruel & Norvig FS IFS US PFS MEM FS IS Uninformed Search omplexity N = Total number of tate = verage number of ucceor (branching factor) L = Length for tart to goal
More informationShortest Path Routing in Arbitrary Networks
Journal of Algorithm, Vol 31(1), 1999 Shortet Path Routing in Arbitrary Network Friedhelm Meyer auf der Heide and Berthold Vöcking Department of Mathematic and Computer Science and Heinz Nixdorf Intitute,
More informationES205 Analysis and Design of Engineering Systems: Lab 1: An Introductory Tutorial: Getting Started with SIMULINK
ES05 Analyi and Deign of Engineering Sytem: Lab : An Introductory Tutorial: Getting Started with SIMULINK What i SIMULINK? SIMULINK i a oftware package for modeling, imulating, and analyzing dynamic ytem.
More informationA Linear Interpolation-Based Algorithm for Path Planning and Replanning on Girds *
Advance in Linear Algebra & Matrix Theory, 2012, 2, 20-24 http://dx.doi.org/10.4236/alamt.2012.22003 Publihed Online June 2012 (http://www.scirp.org/journal/alamt) A Linear Interpolation-Baed Algorithm
More informationOptimal Peer-to-Peer Technique for Massive Content Distribution
1 Optimal Peer-to-Peer Technique for Maive Content Ditribution Xiaoying Zheng, Chunglae Cho and Ye Xia Computer and Information Science and Engineering Department Univerity of Florida Email: {xiazheng,
More informationMAT 155: Describing, Exploring, and Comparing Data Page 1 of NotesCh2-3.doc
MAT 155: Decribing, Exploring, and Comparing Data Page 1 of 8 001-oteCh-3.doc ote for Chapter Summarizing and Graphing Data Chapter 3 Decribing, Exploring, and Comparing Data Frequency Ditribution, Graphic
More informationDiff-Max: Separation of Routing and Scheduling in Backpressure-Based Wireless Networks
Diff-Max: Separation of Routing and Scheduling in -Baed Wirele Network Hulya Seferoglu and Eytan Modiano Laboratory For Information and Deciion Sytem Maachuett Intitute of Technology {heferog, modiano}@mit.edu
More informationDesign of a Stewart Platform for General Machining Using Magnetic Bearings
eign of a Stewart Platform for eneral Machining Uing Magnetic earing Jeff Pieper epartment of Mechanical and Manufacturing Engineering Univerity of algary algary lberta anada N N4 pieper@ucalgary.ca Preented
More informationAUTOMATIC TEST CASE GENERATION USING UML MODELS
Volume-2, Iue-6, June-2014 AUTOMATIC TEST CASE GENERATION USING UML MODELS 1 SAGARKUMAR P. JAIN, 2 KHUSHBOO S. LALWANI, 3 NIKITA K. MAHAJAN, 4 BHAGYASHREE J. GADEKAR 1,2,3,4 Department of Computer Engineering,
More informationAalborg Universitet. Published in: Proceedings of the Working Conference on Advanced Visual Interfaces
Aalborg Univeritet Software-Baed Adjutment of Mobile Autotereocopic Graphic Uing Static Parallax Barrier Paprocki, Martin Marko; Krog, Kim Srirat; Kritofferen, Morten Bak; Krau, Martin Publihed in: Proceeding
More informationTopics. Lecture 37: Global Optimization. Issues. A Simple Example: Copy Propagation X := 3 B > 0 Y := 0 X := 4 Y := Z + W A := 2 * 3X
Lecture 37: Global Optimization [Adapted from note by R. Bodik and G. Necula] Topic Global optimization refer to program optimization that encompa multiple baic block in a function. (I have ued the term
More informationmapping reult. Our experiment have revealed that for many popular tream application, uch a networking and multimedia application, the number of VC nee
Reolving Deadlock for Pipelined Stream Application on Network-on-Chip Xiaohang Wang 1,2, Peng Liu 1 1 Department of Information Science and Electronic Engineering, Zheiang Univerity Hangzhou, Zheiang,
More informationThe Association of System Performance Professionals
The Aociation of Sytem Performance Profeional The Computer Meaurement Group, commonly called CMG, i a not for profit, worldwide organization of data proceing profeional committed to the meaurement and
More informationTAM 212 Worksheet 3. The worksheet is concerned with the design of the loop-the-loop for a roller coaster system.
Name: Group member: TAM 212 Workheet 3 The workheet i concerned with the deign of the loop-the-loop for a roller coater ytem. Old loop deign: The firt generation of loop wa circular, a hown below. R New
More informationPriority-Based Distribution Trees for Application-Level Multicast
Priority-Baed Ditribution Tree for Application-Level Multicat Jürgen Vogel, Jörg Widmer, Dirk Farin, Martin Mauve, Wolfgang Effelberg Praktiche Informatik IV, Univerity of Mannheim, Germany vogel, widmer,
More informationPROBLEM -1. where S. C basis x. 0, for entering
ISSN: 77754 ISO 9:8 Certified Volume 4 Iue 8 February 5 Optimum Solution of Linear Programming Problem by New Method Putta aburao; Supriya N. Khobragade and N.W.Khobragade Department of Mathematic RTM
More informationFocused Video Estimation from Defocused Video Sequences
Focued Video Etimation from Defocued Video Sequence Junlan Yang a, Dan Schonfeld a and Magdi Mohamed b a Multimedia Communication Lab, ECE Dept., Univerity of Illinoi, Chicago, IL b Phyical Realization
More informationSoftware Agent (SA) to guarantee QoS for multi constrain applications in all-ip networks
Software Agent (SA) to guarantee QoS for multi contrain application in all-ip network Kazi Khaled Al-Zahid and Mituji Matumoto GITS, Waeda Univerity 94 Waeda Univ. Bldg. A-308, 1011Okuboyama Nihitomida
More informationContents. shortest paths. Notation. Shortest path problem. Applications. Algorithms and Networks 2010/2011. In the entire course:
Content Shortet path Algorithm and Network 21/211 The hortet path problem: Statement Verion Application Algorithm (for ingle ource p problem) Reminder: relaxation, Dijktra, Variant of Dijktra, Bellman-Ford,
More informationVariable Resolution Discretization in the Joint Space
Variable Reolution Dicretization in the Joint Space Chritopher K. Monon, David Wingate, and Kevin D. Seppi {c,wingated,keppi}@c.byu.edu Computer Science, Brigham Young Univerity Todd S. Peteron peterto@uvc.edu
More informationLaboratory Exercise 6
Laboratory Exercie 6 Adder, Subtractor, and Multiplier The purpoe of thi exercie i to examine arithmetic circuit that add, ubtract, and multiply number. Each circuit will be decribed in Verilog and implemented
More informationNetwork Coding in Duty-Cycled Sensor Networks
1 Network Coding in Duty-Cycled Senor Network Roja Chandanala, Radu Stoleru, Member, IEEE Abtract Network coding and duty-cycling are two popular technique for aving energy in wirele adhoc and enor network.
More informationNearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks
Nearly Contant Approximation for Data Aggregation Scheduling in Wirele Senor Network Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yinghu Li and France Yao Computer Science Department, City Univerity of
More informationImplementation of a momentum-based distance metric for motion graphs. Student: Alessandro Di Domenico (st.no ), Supervisor: Nicolas Pronost
Implementation of a momentum-baed ditance metric for motion graph Student: Aleandro Di Domenico (t.no 3775682), Supervior: Nicola Pronot April 3, 2014 Abtract Thi report preent the procedure and reult
More informationTowards Mobility-Aware Proactive Caching for Vehicular Ad hoc Networks
Toward Mobility-Aware Proactive aching for Vehicular Ad hoc Network Youef AlNagar, Sameh Hony, Amr A. El-Sherif Wirele Intelligent Network enter (WIN), Nile Univerity, Giza, Egypt. Department of Electrical
More informationJoint Congestion Control and Media Access Control Design for Ad Hoc Wireless Networks
Joint Congetion Control and Media Acce Control Deign for Ad Hoc Wirele Network Lijun Chen, Steven H. Low and John C. Doyle Engineering & Applied Science Diviion, California Intitute of Technology Paadena,
More informationLinkGuide: Towards a Better Collection of Hyperlinks in a Website Homepage
Proceeding of the World Congre on Engineering 2007 Vol I LinkGuide: Toward a Better Collection of Hyperlink in a Webite Homepage A. Ammari and V. Zharkova chool of Informatic, Univerity of Bradford anammari@bradford.ac.uk,
More informationA User-Attention Based Focus Detection Framework and Its Applications
A Uer-Attention Baed Focu Detection Framework and It Application Chia-Chiang Ho, Wen-Huang Cheng, Ting-Jian Pan, Ja-Ling Wu Communication and Multimedia Laboratory, Department of Computer Science and Information
More informationMinimum congestion spanning trees in bipartite and random graphs
Minimum congetion panning tree in bipartite and random graph M.I. Otrovkii Department of Mathematic and Computer Science St. John Univerity 8000 Utopia Parkway Queen, NY 11439, USA e-mail: otrovm@tjohn.edu
More informationA NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE CONSTITUTED WITH MACHINING PROCESS BY MATERIAL REMOVAL
International Journal of Mechanical and Production Engineering Reearch and Development (IJMPERD) ISSN 49-689 Vol. 3, Iue, Mar 3, 4-5 TJPRC Pvt. Ltd. A NEW APPROACH IN MEASURING OF THE ROUGHNESS FOR SURFACE
More informationCompressed Sensing Image Processing Based on Stagewise Orthogonal Matching Pursuit
Senor & randucer, Vol. 8, Iue 0, October 204, pp. 34-40 Senor & randucer 204 by IFSA Publihing, S. L. http://www.enorportal.com Compreed Sening Image Proceing Baed on Stagewie Orthogonal Matching Puruit
More informationPerformance Evaluation of search engines via user efforts measures
IJCSI International Journal of Computer Science Iue, Vol. 9, Iue 4, No, July 01 www.ijcsi.org 437 Performance Evaluation of earch engine via uer effort meaure Raeh Kumar Goutam 1 and Sanay K. Dwivedi 1
More informationA New Approach to Pipeline FFT Processor
A ew Approach to Pipeline FFT Proceor Shouheng He and Mat Torkelon Department of Applied Electronic, Lund Univerity S- Lund, SWEDE email: he@tde.lth.e; torkel@tde.lth.e Abtract A new VLSI architecture
More informationOn Peer-to-Peer Media Streaming Λ
On eer-to-eer Media Streaming Λ Dongyan Xu y, Mohamed Hefeeda, Suanne Hambruch, Bharat Bhargava Department of Computer Science urdue Univerity, Wet Lafayette, IN 797 fdxu, hefeeda, eh, bbg@c.purdue.edu
More informationLaboratory Exercise 2
Laoratory Exercie Numer and Diplay Thi i an exercie in deigning cominational circuit that can perform inary-to-decimal numer converion and inary-coded-decimal (BCD) addition. Part I We wih to diplay on
More informationDrawing Lines in 2 Dimensions
Drawing Line in 2 Dimenion Drawing a traight line (or an arc) between two end point when one i limited to dicrete pixel require a bit of thought. Conider the following line uperimpoed on a 2 dimenional
More informationDiverse: Application-Layer Service Differentiation in Peer-to-Peer Communications
Divere: Application-Layer Service Differentiation in Peer-to-Peer Communication Chuan Wu, Student Member, IEEE, Baochun Li, Senior Member, IEEE Department of Electrical and Computer Engineering Univerity
More information