A shortest path algorithm in multimodal networks: a case study with time varying costs
|
|
- Dayna Charles
- 5 years ago
- Views:
Transcription
1 A shortest path algorithm in multimoal networks: a case stuy with time varying costs Daniela Ambrosino*, Anna Sciomachen* * Department of Economics an Quantitative Methos (DIEM), University of Genoa Via Vivali 5, Genova, Italy Abstract In this paper we eal with the problem of fining optimal routes in multimoal networks. Since moal change noes play a relevant role in the choice of origin estination paths, an consequently in the computation of multimoal shortest paths, we evaluate the performance of such noes with the aim of increasing their attractivity. We propose an algorithm that focuses on the moal change noes an forces as much as possible routings through those noes that coul be profitably selecte as commuting points. Preliminary results of a computational experimentation aime at valiating the propose algorithm with ranomly generate multimoal networks are reporte together with a case stuy relate to the city of Genoa, Italy. Keywors: multimoal networks, shortest path problems, moal change noes, generalize cost function. 1 Introuction an problem escription Intermoality, that consists of a change of carrier uring the travel, one or more times, using ifferent connections, is nowaays almost necessary in many kins of transports, both concerning freight an passenger mobility. There is hence the nee of establishing the proper sequence of means an commuting points that coul allow avantages for the travellers. The costs of multimoal routes are given by the cost of the travels relate to each moality plus the cost implie by the change of moality, that is the so calle transition costs. When using multimoal routes some travelling costs can be reuce since economies of scales can be obtaine when using ifferent transportation moalities, especially those relate to the mass transit moality. Moreover, the usage of a mass transit moality allows a great saving in terms of cost an pollution; unfortunately, this is not always available an can rarely reach many points of a multimoal network. Thus we have higher monetary an time costs ue to the change of moality, associate with a greater iscomfort pai by the users. When a user reaches an intermoal noe, the corresponing transition time is usually given by the time spent for fining a free an legal parking, the walking time require for reaching the train / bus stop, an the waiting time at the bus stop or train station. Generally these terms are functions consisting of a eterministic part plus a stochastic eviation (i.e. rivers on t know exactly the time require for looking for an available car park an reaching it once they arrive at the moal change noe). The monetary cost component is given by the parking fee. Most of the papers presente in the literature about intermoality focus on urban mobility, an in particular on the shortest path problem in urban multimoal transportation networks; see among others [8], [7], [6] an [3]. In this paper we focus on urban passenger mobility networks; however, the algorithm here escribe can be applie also to any kin of multimoal networks. The main goal of the propose approach is to fin origin estination (o-) multimoal least cost paths forcing as much as possible routings through those noes that coul be profitably selecte as commuting points. Our objective function consiers both time an monetary cost components; the require optimal paths are thus referre to herein as Pareto-optimal paths. Note that since such solutions are not generally equivalent to the ecision makers, they are evaluate also on the basis of a sort of rating of the moal change noes. Of course, ifferent priorities or orers in the selection of moal change noes can be use, accoring to several criteria, such as the buffer queue or some structural characteristics of the noes like the connectivity, as efine in [2]; another selection criterion can be to consier only primary an seconary moal change noes, as they have been efine in [1], that is moal change noes that guarantee very easy connections to the mass transit transportation network. In the search for optimal multimoal routes we first compute the require shortest paths by looking for the 1
2 most well performing moal change noes from both the origin an the estination noes; successively, we evaluate the corresponing possible multimoal paths with the aim of fining more convenient the intermoal solutions than the mono moal ones. We base our computations on the Dijkstra s algorithm [4], but any of the classical shortest path algorithms propose in literature can be use as well (see e.g. [5] for a survey of such algorithms). Our goal is to compute multimoal o- paths in a reasonable amount of CPU time, without having the nee of verifying exhaustively every possible o- multimoal connections. We are also intereste in analysing how the propose approach is sensible to any kin of upgraing of the ata concerning the network; in particular, we consier some perturbation in the ata about travelling times. Moreover, this analysis allows to face possible travel time changes over a ay ue to a variation of the traffic congestion in transportation networks. 2 The network moel In orer to be able to represent all the features of multimoal transportation problems we have to eal with moels that enable us to inclue all the parameters that can impact on the corresponing ecisional process, especially those relate to the moal change points. For this purpose, focusing on urban transportation networks, we consier igraph G = (V, A, C, I, D, M, R) with the following specifications. V is the set of noes that efines, as usual, relevant locations within the network; great attention will be evote to N V, that represents the subset of possible moal change noes. Let V = m an N = n. Set A efines the oriente arcs, or connections, between pair of noes; C is the set of weights (travelling times) associate with each arc (i,j) A, while I is the set of weights (transition costs) associate with each noe belonging to N. D is the set of attributes associate with the moal change noes that will be evaluate in the selection phase of the algorithm for etermining the shortest multimoal paths. A better explanation of costs an attributes of the network moel will be given in Subsections 2.1 an 2.2. M is the set of the transportation moalities that are allowable in the network uner consieration; we may split them into two main classes, namely: a) restricte moalities, that is private ones, such as car or motorcar, which can be use only by the ecision maker; b) mass transit moalities, that is share ones, such as train or bus, which can allow a multiple transport with a single carrier. We have to consier that people generally on t like more than one changes of mean in the same trip; in fact, moal changes are perceive uncomfortable by users an usually are not free. For this reason, once the change of moality from the private to a mass transit one is selecte, the presente algorithm tries to o up to two moal changes, that is we assume that no more than two means for each o- path is allowable; more precisely, we say that noe j is connecte to noe i in a mass transit transportation network if an only if there exists a path from i to j in G in which at most one change of a mass transit mean may occur. Finally, R is the set of the possible ecisional criteria use to evaluate the generalize cost of the whole journey in the multimoal network. The specification of any element r R that we consier in this work is follows: r = 1 is relate to the traveling time, r = 2 concerns the monetary cost, r = 3 can refer to some iscomfort factors, such as weather conitions in the case of urban mobility, reliability in case of ata transfer an so on. 2.1 Definition of the (arc an noe) costs in G We consier ifferent kins of weights, associate, respectively, with the arcs an noes of the network. Set C is the set of the costs associate with the arcs of the network; every element c(i,j) t,r C is the cost for travelling arc (i,j) A with moality t accoring to a given ecisional criterion r. In orer to better represent the user s preferences, we use a weighte value for each criterion, that is we compare the cost of ifferent routes by computing for every consiere o- path travelle with moality t the generalize R cost function C(o,) t given in (1) as C( o, ) t = c( i, j) t, rϖ (1) r r = 1 2
3 R where ω r is the weight that users assign to the r-th evaluation criterion, such that ω r = 1. r = 1 In literature, a lot of works eal with travelling time functions; assuming that every problem shoul have its own cost function, we legitimately assume that the travelling cost is a linear function; for example, we may suppose that, in a roa transportation network, the time function epens on the length of the street, the with, the traffic conition, the grae line an the level of bow-street (see e.g. [9]). I a relevant set in our moel an for our algorithm too, since it efines the transitions costs that users have to pay at the moal change noes. Set I of the cost associate with the noes of the network is a M R matrix. Let τ(i) ab,r be a generic element of set I representing the cost that the users have to pay for moving from moality a, that is the restricte one, to moality b, that is one of the possible mass transit moality, at the moal change noe i N accoring to a given ecisional criterion r. Note that we imply that τ(i) ab,r = + i N, that is we assume that a change of moality is not allowe anywhere. 2.2 Attributes D is a particular set that is ifferent from the others since it contains the measure of the qualitative characteristics of the moal change noes. We think that for the ecisional process concerning the transportation moalities it is relevant the evaluation of the moal change noes from a structural point of view, that is to verify their connection capability to the mass transit transportation network from the restricte one. Therefore, we consier the following attributes. Connectivity. The connectivity is the first attribute that we verify in the evaluation of every possible moal change noe. This inex δ ) gives a measure of how a given moal change noe i N is connecte to the ( 1 i other noes of the network; it is hence given by the ratio between the number x i,t of noes that can be reache from i without any moal or vehicle change over the total number of noes of V. Note that if more than one moality is available, the connectivity inex is relative to the moality with higher connectivity. Usually the connectivity inex is compute for evaluating, as in our case, the gooness of the connection between the restricte moality, that is chosen at the origin noe, an the mass transit one, that can be selecte for reaching the estination noe. Accessibility. This inex ( δ 2 ) concerns the istance from all noes in V to noe i, i N. That is, the i accessibility inex gives a measure of how easily a moal change noe i N can be reache by the other noes of the network. Expecte time. The expecte time (e.g. queue or transfer) spent at a moal change noe may be calculate by an a-hoc function specifically for each case. Note that a too long waiting time may often iscourage the user an make him/her chooses another noe, thus implying a change in the strategy. For this reason, we may think to o not consier as possible commuting points those moal change noes that have an excessive waiting time to enter to. Generally, the waiting time associate with each noe may be compute as the prouct between the number of elements actually in the queue an the mean processing time; in this case the expecte queuing time at a moal change noe i N ( δ 3 ) can be given by the prouct between the average waiting time an the i number of users in the queue at noe i. Remember that set D is a component of the network an it is efine a priori at the beginning of the process, therefore users on t know precisely the queue time associate with the moal change noes. Thus set D can be now generally efine as 1 2 D = { δ i, δi,..., δi }, i N; in our case we have = 3. As previously escribe, the selection of the moal change noes is our main issue in fining the best intermoal path. We suppose that users on t know the effective generalize cost function associate with the commuting noes an thus make their choice in low information conitions. In fact, when users reach a moal change noe, they know the network status of a noe an the available connections from such noe to the others; however, they may only suppose the average waiting time at it basing the choice on a previous knowlege instea of calculating the real cost. For this reason, attributes are a set of information that users know an use to reuce the number of moal change noes to be consiere in the computation of the shortest paths, as we will see in the next paragraph. 3
4 3 The propose algorithm The presente algorithm is a heuristic approach to the problem of fining optimal multimoal o- routes in urban transportation networks. The algorithm looks for the best moal change noes an computes the minimum cost path using such noes for the given pair of o- noes. In particular, by using a Dijkstra like algorithm, we first compute the require shortest path by looking for the most well performing moal change noes from both the origin an the estination noes; successively, we evaluate the generalize cost of possible alternative multimoal paths with the aim of forcing as much as possible routings through those noes that coul be selecte as commuting points while reucing the previously etermine mono-moal solution. At the beginning of the ecision process, the user efines the upper an lower bouns for attribute δ i, = 1,, 3; these bouns are the threshol value for selecting a moal change noe in the search for the shortest path. In particular, let α 1, α 2,, α an β 1, β 2,, β be the upper an lower bouns, respectively, of valuesδ i, = 1,, 3; if i N an β δ i α D then noe i will be ae to the set of possible commuting points. For each kin of networks we may have ifferent evaluation parameters, as to better escribe the user s ecision process. We assume that attributes δ i, = 1,, 3, are alreay known at the beginning of the algorithm. In more etails, the propose algorithm procees by first executing the Dijkstra algorithm starting from the given origin noe. The selection process of the moal change noes occurs within the labelling phase of the algorithm. At each iteration every selecte noe is analyse; if the noe is a moal change one an the values of its consiere attributes fit into the allowable ranges then the noe is consiere as possible commuting noes. The Dijkstra algorithm stops as soon as a given number k n of reachable moal change noes are positively evaluate or we are not able to fin any other caniate noe. Finally, we execute the Dijkstra algorithm having the estination noe as our starting noe, as before, until k moal change noes are selecte. Let Ω an enote the sets of the ientifie moal change noes starting from the origin an estination noes, respectively. The Dijkstra algorithm is execute in both irection for every restricte moality. Note that, ue to the multi objective nature of the problem, every cost comparison has to be mae relatively to the generalize cost function; that is, we look for the path having the minimum value of equation (1) consiering as interchanging noes only those belonging to Ω an with respect to the chosen criterion r, r = 1,, 3. Note that in the selection of moal change noes ifferent priorities or orers can be consiere. The algorithm takes into account only moal change noes that guarantee very easy connections from the private network to the mass transit one, an vice versa. For setting up our attributes before the execution of the 1 2 algorithm, we fix the minimum acceptable value of δ i an δ i, to 40%; this means that those noes with both connectivity an attractivity values lower than 40% are not consiere as commuting points an hence as possible origin noes. Note that the connectivity value is evaluate for the selection of the origin interchange noes belonging to Ω, while the attractivity is relevant for the selection of the estination interchange noes belonging to. 4 Computational experimentation An extensive computational effort evote at valiating the propose algorithm is in progress. A massive number of trials with ranomly generate instances have been use as a test be for verifying both the gooness of the obtaine solutions an the corresponing CPU time. We are also applying our algorithm to a urban passenger transportation network relate to the central area of the city of Genova, Italy. The algorithm has been implemente in C++ an we are testing it on a 3200 Mhz ual core with 512 Mb RAM platform. In Table 1 we report some preliminary computational results relate to ranom instances of ifferent sizes. Each entry of Table 1 is the average value of the objective function (1) compute on the basis of 100 ifferent ranomly generate graphs of the same size. Values in column Optimality gap has been obtaine as the ifference of the generalize cost (1) between the optimal solution foun with the exhaustive algorithm an the solution foun by our algorithm. Note that on the average the optimality gap is only about 6,75% for the non optimal solutions; more precisely, in at most 34% of the instances the non optimal paths are averagely between 5% an 8,5% more expensive than the optimal 4
5 solutions. In fact, the propose algorithm was able to fin the Pareto optimal solution in a very high percentage of cases; in particular, from the observe results, we can see that the algorithm fins the optimal solutions about two times every three trials. Combine with the number of successes, this means that the algorithm is able to fin on the average a solution that is less than 5% worst than the Pareto-optimal solution. As far as the CPU time is concerne, we can note that, while the CPU time of the exact algorithm grows very quickly, our heuristic algorithm reaches the solution in a very small CPU time. Instance type Table 1. Computational results with ranom instances # noes # arcs CPU time our algorithm CPU time exaustive algorithm # optimal solutions (%) <0,01 1,49 66% 6.52% <0,01 7,17 64% 7.91% ,016" 35,89" 64% 8.40% ,04" 1'07" 68% 5.51% ,055 2'16 62% 5.32% Optimality gap (%) Referring to the city of Genova an assuming that the mass transportation eman level is given, we look for the best intermoal solution for the most travelle o- paths. Starting from the efinition of G an the available o- matrices referring to a rush hour time perio, i.e. from 6.30 to 9.30 a.m., we have erive the corresponing network moel that represents the central area of the city an is relate to a linear extension of about 5 kilometres. The size of the network is the following: m = 56, n = 46, A = 1141, whose 997 refer to the mass transit moalities, that consist in turn of a multimoal network since it is split into bus, subway, train, elevator an cableway connections. We focus on 3 noes that are the most relevant origin noes in terms of traffic flow, since they represent the access to the centre for rivers coming from the west, east an north sie of the city, respectively, an on 2 noes in the centre of the town where it is concentrate the commercial heart of the city, that represent the most frequent estinations. In Tables 2-3 we present the values of the most relevant o- shortest paths; columns Ω an represent the possible moal change noes from the origin an the estination noes, respectively, in the consiere path; the remaining columns report the total cost an that relate to the corresponing moality, incluing the walking time. In the case of the path from 56 to 18, synthesise in Table 2, the solution foun by our algorithm is Paretooptimal. Note that even if noe 56 is a moal change noe, it has been iscare by the algorithm ue to its ba attributes; in this case, the moal change noe is 27. Table 2. Cost of the multimoal path Ω Total Private Mass transit Interchange Walking ,31 1,53 9,55 10, ,84 1,53 11,06 10, ,97 1,53 8,54 10,23 2, ,17 1,63 7,85 4, ,68 1,63 9,36 4, ,83 1,63 6,84 4,69 2, ,03 2,19 5,94 6, ,54 2,19 7,45 6, ,09 2,19 4,93 6,9 2,67 A ifferent situation arises in the case of the path from 42 to 18, reporte in Table 4; this case is interesting to be analyze, since noe 42 is a moal change noe an it is not iscare by the algorithm. Having a look at the solution, that is the Pareto-optimal one, we can see that noe 42 is not the interchanging noe selecte by the solution; inee the change of moality occurs at noe 27. Table 3. Cost of the multimoal path Ω Total Private Mass transit Interchange Walking ,96 0 9, , , ,37 0 8,7 0 2, ,66 0,88 9,55 10, ,17 0,88 11,06 10, ,32 0,88 8,54 10,23 2, ,08 1,54 7,85 4, ,59 1,54 9,36 4,69 2 5
6 5 Sensitivity analysis ,74 1,54 6,84 4,69 2,67 As a final valiation of the propose algorithm we test the stability of the foune optimal solutions in the presence of noise in the ata, an more precisely of the weight of the arc set A. In fact, consiering the technical ifficulties usually encountere in getting precise ata, in particular information about ata flows, it is important that the algorithm is stable enough to allow to fin goo solutions also when a high ata accuracy level cannot be guarantee. For this purpose, we implemente a ranom noise generator that perturbe the arc costs. More precisely, we implemente the function anoise X that as to the arc weights a perturbation up to X% of the corresponing given input value; that is every arc cost has been moifie up to the efine percentage of noise (more or less) before running again the shortes path algorithm. Table 4 reports the synthesis of our computational results relative to ifferent levels of noise on ifferent kins of ranomly generate graphs. Table 4. Percentage of optimal solution in presence of perturbation on the arc cost Noise # optimal solutions (%) Optimality gap (%) 5% 100% 0% 10% 90% 3.52% 15% 90% 3.52% 20% 80% 5.23% 25% 75% 6.21% Each row of Table 4 reports the average value of 10 ifferent networks, each one of the type given in Table 1 for every noise level, an the corresponing comparison with the solution obtaine with the exact algorithm without any noise. We can see that results are very goo up to 15% of noise, while starting from a 20% noise level, the solution s reliability egenerates quickly. Preliminary results show that the algorithm has a goo tolerance to the noise. The main reason is that the noe selection is one also on the basis of the qualitative information about the structural characteristics of the same noes. 6 Conclusions an outlines for future works In this paper we have presente an algorithm for fining optimal paths in multimoal networks having ecisional weights on both arcs an noes. Preliminary tests shown that the algorithm has goo performances both in terms of CPU time an optimality gap, an it is able to fin moal change noes when such noes are well connecte to the other moalities. The authors inten to exten the computational experiments an the sensitivity analysis. References [1] Ambrosino D., Sciomachen A. Selection of moal choice noes in urban intermoal networks in Urban an transport XII, Brebbia C.A., Dolezel V. Es., WIT Press, (2006) pp [2] Benacchio M., Musso E., Sciomachen A. Intermoal transport in urban passenger mobility - in Urban transport an the environment for the 21st century, IV, Southampton-Boston: Wessex Institute of Technology Press, Computational Mechanics Publications, [3] Bielli M., Boulmakoul A., Mouncil H. Object moelling an path computation for mutimoal travel systems. European Journal of Operational Research, 175/3, (2005) pp [4] Dijkstra, E. W. A note on two problems in connexion with graphs. Numerische Mathematik, 1, (1959) pp [5] Gallo G., Pallottino S. Shortest path algorithms, Annals of Operations Research, 13, (1998) pp [6] Lozano A., Storchi G.. Shortest viable path in multimoal networks. Transportation Research A, 35, (2001) pp [7] Moesti, P., Sciomachen, A. A utility measure for fining multiobjective shortest paths in urban multimoal transportation networks, European Journal of Operational Research, 111/3, (1998) pp [8] Mote, J., Murthy, I., Olson, D.L.. A parametric approach to solving bicriterion shortest path in urban multimoal transportation networks, European Journal of Operational Research, 53, (1991) pp [9] Sheffy Y. Urban transportation networks. Prentice Hall, Englewoos Cliffs, NY,
Comparison of Methods for Increasing the Performance of a DUA Computation
Comparison of Methos for Increasing the Performance of a DUA Computation Michael Behrisch, Daniel Krajzewicz, Peter Wagner an Yun-Pang Wang Institute of Transportation Systems, German Aerospace Center,
More informationSolution Representation for Job Shop Scheduling Problems in Ant Colony Optimisation
Solution Representation for Job Shop Scheuling Problems in Ant Colony Optimisation James Montgomery, Carole Faya 2, an Sana Petrovic 2 Faculty of Information & Communication Technologies, Swinburne University
More informationThe Reconstruction of Graphs. Dhananjay P. Mehendale Sir Parashurambhau College, Tilak Road, Pune , India. Abstract
The Reconstruction of Graphs Dhananay P. Mehenale Sir Parashurambhau College, Tila Roa, Pune-4030, Inia. Abstract In this paper we iscuss reconstruction problems for graphs. We evelop some new ieas lie
More informationParticle Swarm Optimization Based on Smoothing Approach for Solving a Class of Bi-Level Multiobjective Programming Problem
BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 17, No 3 Sofia 017 Print ISSN: 1311-970; Online ISSN: 1314-4081 DOI: 10.1515/cait-017-0030 Particle Swarm Optimization Base
More informationThreshold Based Data Aggregation Algorithm To Detect Rainfall Induced Landslides
Threshol Base Data Aggregation Algorithm To Detect Rainfall Inuce Lanslies Maneesha V. Ramesh P. V. Ushakumari Department of Computer Science Department of Mathematics Amrita School of Engineering Amrita
More informationAlgorithm for Intermodal Optimal Multidestination Tour with Dynamic Travel Times
Algorithm for Intermoal Optimal Multiestination Tour with Dynamic Travel Times Neema Nassir, Alireza Khani, Mark Hickman, an Hyunsoo Noh This paper presents an efficient algorithm that fins the intermoal
More informationMORA: a Movement-Based Routing Algorithm for Vehicle Ad Hoc Networks
: a Movement-Base Routing Algorithm for Vehicle A Hoc Networks Fabrizio Granelli, Senior Member, Giulia Boato, Member, an Dzmitry Kliazovich, Stuent Member Abstract Recent interest in car-to-car communications
More informationOnline Appendix to: Generalizing Database Forensics
Online Appenix to: Generalizing Database Forensics KYRIACOS E. PAVLOU an RICHARD T. SNODGRASS, University of Arizona This appenix presents a step-by-step iscussion of the forensic analysis protocol that
More informationQueueing Model and Optimization of Packet Dropping in Real-Time Wireless Sensor Networks
Queueing Moel an Optimization of Packet Dropping in Real-Time Wireless Sensor Networks Marc Aoun, Antonios Argyriou, Philips Research, Einhoven, 66AE, The Netherlans Department of Computer an Communication
More informationAlmost Disjunct Codes in Large Scale Multihop Wireless Network Media Access Control
Almost Disjunct Coes in Large Scale Multihop Wireless Network Meia Access Control D. Charles Engelhart Anan Sivasubramaniam Penn. State University University Park PA 682 engelhar,anan @cse.psu.eu Abstract
More informationAnyTraffic Labeled Routing
AnyTraffic Labele Routing Dimitri Papaimitriou 1, Pero Peroso 2, Davie Careglio 2 1 Alcatel-Lucent Bell, Antwerp, Belgium Email: imitri.papaimitriou@alcatel-lucent.com 2 Universitat Politècnica e Catalunya,
More informationNon-homogeneous Generalization in Privacy Preserving Data Publishing
Non-homogeneous Generalization in Privacy Preserving Data Publishing W. K. Wong, Nios Mamoulis an Davi W. Cheung Department of Computer Science, The University of Hong Kong Pofulam Roa, Hong Kong {wwong2,nios,cheung}@cs.hu.h
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu Institute of Information Science Acaemia Sinica Taipei, Taiwan Da-wei Wang Jan-Jan Wu Institute of Information Science
More informationSURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH
SURVIVABLE IP OVER WDM: GUARANTEEEING MINIMUM NETWORK BANDWIDTH Galen H Sasaki Dept Elec Engg, U Hawaii 2540 Dole Street Honolul HI 96822 USA Ching-Fong Su Fuitsu Laboratories of America 595 Lawrence Expressway
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.
Preface Here are my online notes for my Calculus I course that I teach here at Lamar University. Despite the fact that these are my class notes, they shoul be accessible to anyone wanting to learn Calculus
More informationGeneralized Edge Coloring for Channel Assignment in Wireless Networks
TR-IIS-05-021 Generalize Ege Coloring for Channel Assignment in Wireless Networks Chun-Chen Hsu, Pangfeng Liu, Da-Wei Wang, Jan-Jan Wu December 2005 Technical Report No. TR-IIS-05-021 http://www.iis.sinica.eu.tw/lib/techreport/tr2005/tr05.html
More informationOptimal Oblivious Path Selection on the Mesh
Optimal Oblivious Path Selection on the Mesh Costas Busch Malik Magon-Ismail Jing Xi Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 280, USA {buschc,magon,xij2}@cs.rpi.eu Abstract
More informationTHE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM
International Journal of Physics an Mathematical Sciences ISSN: 2277-2111 (Online) 2016 Vol. 6 (1) January-March, pp. 24-6/Mao an Shi. THE APPLICATION OF ARTICLE k-th SHORTEST TIME PATH ALGORITHM Hua Mao
More informationDivide-and-Conquer Algorithms
Supplment to A Practical Guie to Data Structures an Algorithms Using Java Divie-an-Conquer Algorithms Sally A Golman an Kenneth J Golman Hanout Divie-an-conquer algorithms use the following three phases:
More informationHandling missing values in kernel methods with application to microbiology data
an Machine Learning. Bruges (Belgium), 24-26 April 2013, i6oc.com publ., ISBN 978-2-87419-081-0. Available from http://www.i6oc.com/en/livre/?gcoi=28001100131010. Hanling missing values in kernel methos
More informationLoop Scheduling and Partitions for Hiding Memory Latencies
Loop Scheuling an Partitions for Hiing Memory Latencies Fei Chen Ewin Hsing-Mean Sha Dept. of Computer Science an Engineering University of Notre Dame Notre Dame, IN 46556 Email: fchen,esha @cse.n.eu Tel:
More informationImage Segmentation using K-means clustering and Thresholding
Image Segmentation using Kmeans clustering an Thresholing Preeti Panwar 1, Girhar Gopal 2, Rakesh Kumar 3 1M.Tech Stuent, Department of Computer Science & Applications, Kurukshetra University, Kurukshetra,
More informationLearning Polynomial Functions. by Feature Construction
I Proceeings of the Eighth International Workshop on Machine Learning Chicago, Illinois, June 27-29 1991 Learning Polynomial Functions by Feature Construction Richar S. Sutton GTE Laboratories Incorporate
More informationScalable Deterministic Scheduling for WDM Slot Switching Xhaul with Zero-Jitter
FDL sel. VOA SOA 100 Regular papers ONDM 2018 Scalable Deterministic Scheuling for WDM Slot Switching Xhaul with Zero-Jitter Bogan Uscumlic 1, Dominique Chiaroni 1, Brice Leclerc 1, Thierry Zami 2, Annie
More informationA New Search Algorithm for Solving Symmetric Traveling Salesman Problem Based on Gravity
Worl Applie Sciences Journal 16 (10): 1387-1392, 2012 ISSN 1818-4952 IDOSI Publications, 2012 A New Search Algorithm for Solving Symmetric Traveling Salesman Problem Base on Gravity Aliasghar Rahmani Hosseinabai,
More informationTransient analysis of wave propagation in 3D soil by using the scaled boundary finite element method
Southern Cross University epublications@scu 23r Australasian Conference on the Mechanics of Structures an Materials 214 Transient analysis of wave propagation in 3D soil by using the scale bounary finite
More informationSupporting Fully Adaptive Routing in InfiniBand Networks
XIV JORNADAS DE PARALELISMO - LEGANES, SEPTIEMBRE 200 1 Supporting Fully Aaptive Routing in InfiniBan Networks J.C. Martínez, J. Flich, A. Robles, P. López an J. Duato Resumen InfiniBan is a new stanar
More informationRandom Clustering for Multiple Sampling Units to Speed Up Run-time Sample Generation
DEIM Forum 2018 I4-4 Abstract Ranom Clustering for Multiple Sampling Units to Spee Up Run-time Sample Generation uzuru OKAJIMA an Koichi MARUAMA NEC Solution Innovators, Lt. 1-18-7 Shinkiba, Koto-ku, Tokyo,
More informationImproving Spatial Reuse of IEEE Based Ad Hoc Networks
mproving Spatial Reuse of EEE 82.11 Base A Hoc Networks Fengji Ye, Su Yi an Biplab Sikar ECSE Department, Rensselaer Polytechnic nstitute Troy, NY 1218 Abstract n this paper, we evaluate an suggest methos
More informationAdaptive Load Balancing based on IP Fast Reroute to Avoid Congestion Hot-spots
Aaptive Loa Balancing base on IP Fast Reroute to Avoi Congestion Hot-spots Masaki Hara an Takuya Yoshihiro Faculty of Systems Engineering, Wakayama University 930 Sakaeani, Wakayama, 640-8510, Japan Email:
More informationLecture 1 September 4, 2013
CS 84r: Incentives an Information in Networks Fall 013 Prof. Yaron Singer Lecture 1 September 4, 013 Scribe: Bo Waggoner 1 Overview In this course we will try to evelop a mathematical unerstaning for the
More informationPolitehnica University of Timisoara Mobile Computing, Sensors Network and Embedded Systems Laboratory. Testing Techniques
Politehnica University of Timisoara Mobile Computing, Sensors Network an Embee Systems Laboratory ing Techniques What is testing? ing is the process of emonstrating that errors are not present. The purpose
More informationfiltering LETTER An Improved Neighbor Selection Algorithm in Collaborative Taek-Hun KIM a), Student Member and Sung-Bong YANG b), Nonmember
107 IEICE TRANS INF & SYST, VOLE88 D, NO5 MAY 005 LETTER An Improve Neighbor Selection Algorithm in Collaborative Filtering Taek-Hun KIM a), Stuent Member an Sung-Bong YANG b), Nonmember SUMMARY Nowaays,
More informationAPPLYING GENETIC ALGORITHM IN QUERY IMPROVEMENT PROBLEM. Abdelmgeid A. Aly
International Journal "Information Technologies an Knowlege" Vol. / 2007 309 [Project MINERVAEUROPE] Project MINERVAEUROPE: Ministerial Network for Valorising Activities in igitalisation -
More informationReformulation and Solution Algorithms for Absolute and Percentile Robust Shortest Path Problems
> REPLACE THIS LINE WITH YOUR PAPER IENTIFICATION NUMBER (OUBLE-CLICK HERE TO EIT) < 1 Reformulation an Solution Algorithms for Absolute an Percentile Robust Shortest Path Problems Xuesong Zhou, Member,
More informationClassifying Facial Expression with Radial Basis Function Networks, using Gradient Descent and K-means
Classifying Facial Expression with Raial Basis Function Networks, using Graient Descent an K-means Neil Allrin Department of Computer Science University of California, San Diego La Jolla, CA 9237 nallrin@cs.ucs.eu
More informationPolitecnico di Torino. Porto Institutional Repository
Politecnico i Torino Porto Institutional Repository [Proceeing] Automatic March tests generation for multi-port SRAMs Original Citation: Benso A., Bosio A., i Carlo S., i Natale G., Prinetto P. (26). Automatic
More informationState Indexed Policy Search by Dynamic Programming. Abstract. 1. Introduction. 2. System parameterization. Charles DuHadway
State Inexe Policy Search by Dynamic Programming Charles DuHaway Yi Gu 5435537 503372 December 4, 2007 Abstract We consier the reinforcement learning problem of simultaneous trajectory-following an obstacle
More informationCoupling the User Interfaces of a Multiuser Program
Coupling the User Interfaces of a Multiuser Program PRASUN DEWAN University of North Carolina at Chapel Hill RAJIV CHOUDHARY Intel Corporation We have evelope a new moel for coupling the user-interfaces
More informationDisjoint Multipath Routing in Dual Homing Networks using Colored Trees
Disjoint Multipath Routing in Dual Homing Networks using Colore Trees Preetha Thulasiraman, Srinivasan Ramasubramanian, an Marwan Krunz Department of Electrical an Computer Engineering University of Arizona,
More informationOffloading Cellular Traffic through Opportunistic Communications: Analysis and Optimization
1 Offloaing Cellular Traffic through Opportunistic Communications: Analysis an Optimization Vincenzo Sciancalepore, Domenico Giustiniano, Albert Banchs, Anreea Picu arxiv:1405.3548v1 [cs.ni] 14 May 24
More informationAn Algorithm for Building an Enterprise Network Topology Using Widespread Data Sources
An Algorithm for Builing an Enterprise Network Topology Using Wiesprea Data Sources Anton Anreev, Iurii Bogoiavlenskii Petrozavosk State University Petrozavosk, Russia {anreev, ybgv}@cs.petrsu.ru Abstract
More informationLearning convex bodies is hard
Learning convex boies is har Navin Goyal Microsoft Research Inia navingo@microsoftcom Luis Raemacher Georgia Tech lraemac@ccgatecheu Abstract We show that learning a convex boy in R, given ranom samples
More informationLab work #8. Congestion control
TEORÍA DE REDES DE TELECOMUNICACIONES Grao en Ingeniería Telemática Grao en Ingeniería en Sistemas e Telecomunicación Curso 2015-2016 Lab work #8. Congestion control (1 session) Author: Pablo Pavón Mariño
More informationThroughput Characterization of Node-based Scheduling in Multihop Wireless Networks: A Novel Application of the Gallai-Edmonds Structure Theorem
Throughput Characterization of Noe-base Scheuling in Multihop Wireless Networks: A Novel Application of the Gallai-Emons Structure Theorem Bo Ji an Yu Sang Dept. of Computer an Information Sciences Temple
More informationAnalytical approximation of transient joint queue-length distributions of a finite capacity queueing network
Analytical approximation of transient joint queue-length istributions of a finite capacity queueing network Gunnar Flötterö Carolina Osorio March 29, 2013 Problem statements This work contributes to the
More informationDistributed Line Graphs: A Universal Technique for Designing DHTs Based on Arbitrary Regular Graphs
IEEE TRANSACTIONS ON KNOWLEDE AND DATA ENINEERIN, MANUSCRIPT ID Distribute Line raphs: A Universal Technique for Designing DHTs Base on Arbitrary Regular raphs Yiming Zhang an Ling Liu, Senior Member,
More informationCS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing
CS269I: Incentives in Computer Science Lecture #8: Incentives in BGP Routing Tim Roughgaren October 19, 2016 1 Routing in the Internet Last lecture we talke about elay-base (or selfish ) routing, which
More informationOptimal Routing and Scheduling for Deterministic Delay Tolerant Networks
Optimal Routing an Scheuling for Deterministic Delay Tolerant Networks Davi Hay Dipartimento i Elettronica olitecnico i Torino, Italy Email: hay@tlc.polito.it aolo Giaccone Dipartimento i Elettronica olitecnico
More informationAn Adaptive Routing Algorithm for Communication Networks using Back Pressure Technique
International OPEN ACCESS Journal Of Moern Engineering Research (IJMER) An Aaptive Routing Algorithm for Communication Networks using Back Pressure Technique Khasimpeera Mohamme 1, K. Kalpana 2 1 M. Tech
More informationUsing Vector and Raster-Based Techniques in Categorical Map Generalization
Thir ICA Workshop on Progress in Automate Map Generalization, Ottawa, 12-14 August 1999 1 Using Vector an Raster-Base Techniques in Categorical Map Generalization Beat Peter an Robert Weibel Department
More informationShift-map Image Registration
Shift-map Image Registration Svärm, Linus; Stranmark, Petter Unpublishe: 2010-01-01 Link to publication Citation for publishe version (APA): Svärm, L., & Stranmark, P. (2010). Shift-map Image Registration.
More informationStudy of Network Optimization Method Based on ACL
Available online at www.scienceirect.com Proceia Engineering 5 (20) 3959 3963 Avance in Control Engineering an Information Science Stuy of Network Optimization Metho Base on ACL Liu Zhian * Department
More informationOn the Placement of Internet Taps in Wireless Neighborhood Networks
1 On the Placement of Internet Taps in Wireless Neighborhoo Networks Lili Qiu, Ranveer Chanra, Kamal Jain, Mohamma Mahian Abstract Recently there has emerge a novel application of wireless technology that
More informationFINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD
Warsaw University of Technology Faculty of Physics Physics Laboratory I P Joanna Konwerska-Hrabowska 6 FINDING OPTICAL DISPERSION OF A PRISM WITH APPLICATION OF MINIMUM DEVIATION ANGLE MEASUREMENT METHOD.
More informationNew Version of Davies-Bouldin Index for Clustering Validation Based on Cylindrical Distance
New Version of Davies-Boulin Inex for lustering Valiation Base on ylinrical Distance Juan arlos Roas Thomas Faculta e Informática Universia omplutense e Mari Mari, España correoroas@gmail.com Abstract
More informationCharacterizing Decoding Robustness under Parametric Channel Uncertainty
Characterizing Decoing Robustness uner Parametric Channel Uncertainty Jay D. Wierer, Wahee U. Bajwa, Nigel Boston, an Robert D. Nowak Abstract This paper characterizes the robustness of ecoing uner parametric
More informationUninformed search methods
CS 1571 Introuction to AI Lecture 4 Uninforme search methos Milos Hauskrecht milos@cs.pitt.eu 539 Sennott Square Announcements Homework assignment 1 is out Due on Thursay, September 11, 014 before the
More informationTight Wavelet Frame Decomposition and Its Application in Image Processing
ITB J. Sci. Vol. 40 A, No., 008, 151-165 151 Tight Wavelet Frame Decomposition an Its Application in Image Processing Mahmu Yunus 1, & Henra Gunawan 1 1 Analysis an Geometry Group, FMIPA ITB, Banung Department
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stolyar Abstract Backpressure-base aaptive routing
More informationAdjacency Matrix Based Full-Text Indexing Models
1000-9825/2002/13(10)1933-10 2002 Journal of Software Vol.13, No.10 Ajacency Matrix Base Full-Text Inexing Moels ZHOU Shui-geng 1, HU Yun-fa 2, GUAN Ji-hong 3 1 (Department of Computer Science an Engineering,
More informationPetri Nets with Time and Cost (Tutorial)
Petri Nets with Time an Cost (Tutorial) Parosh Aziz Abulla Department of Information Technology Uppsala University Sween parosh@it.uu.se Richar Mayr School of Informatics, LFCS University of Einburgh Unite
More informationResearch Article Inviscid Uniform Shear Flow past a Smooth Concave Body
International Engineering Mathematics Volume 04, Article ID 46593, 7 pages http://x.oi.org/0.55/04/46593 Research Article Invisci Uniform Shear Flow past a Smooth Concave Boy Abullah Mura Department of
More informationFrequent Pattern Mining. Frequent Item Set Mining. Overview. Frequent Item Set Mining: Motivation. Frequent Pattern Mining comprises
verview Frequent Pattern Mining comprises Frequent Pattern Mining hristian Borgelt School of omputer Science University of Konstanz Universitätsstraße, Konstanz, Germany christian.borgelt@uni-konstanz.e
More informationOptimal path planning in a constant wind with a bounded turning rate
Optimal path planning in a constant win with a boune turning rate Timothy G. McGee, Stephen Spry an J. Karl Herick Center for Collaborative Control of Unmanne Vehicles, University of California, Berkeley,
More informationEDOVE: Energy and Depth Variance-Based Opportunistic Void Avoidance Scheme for Underwater Acoustic Sensor Networks
sensors Article EDOVE: Energy an Depth Variance-Base Opportunistic Voi Avoiance Scheme for Unerwater Acoustic Sensor Networks Safar Hussain Bouk 1, *, Sye Hassan Ahme 2, Kyung-Joon Park 1 an Yongsoon Eun
More information2-connected graphs with small 2-connected dominating sets
2-connecte graphs with small 2-connecte ominating sets Yair Caro, Raphael Yuster 1 Department of Mathematics, University of Haifa at Oranim, Tivon 36006, Israel Abstract Let G be a 2-connecte graph. A
More informationProvisioning Virtualized Cloud Services in IP/MPLS-over-EON Networks
Provisioning Virtualize Clou Services in IP/MPLS-over-EON Networks Pan Yi an Byrav Ramamurthy Department of Computer Science an Engineering, University of Nebraska-Lincoln Lincoln, Nebraska 68588 USA Email:
More informationReal Time On Board Stereo Camera Pose through Image Registration*
28 IEEE Intelligent Vehicles Symposium Einhoven University of Technology Einhoven, The Netherlans, June 4-6, 28 Real Time On Boar Stereo Camera Pose through Image Registration* Fai Dornaika French National
More informationBends, Jogs, And Wiggles for Railroad Tracks and Vehicle Guide Ways
Ben, Jogs, An Wiggles for Railroa Tracks an Vehicle Guie Ways Louis T. Klauer Jr., PhD, PE. Work Soft 833 Galer Dr. Newtown Square, PA 19073 lklauer@wsof.com Preprint, June 4, 00 Copyright 00 by Louis
More informationEvolutionary Optimisation Methods for Template Based Image Registration
Evolutionary Optimisation Methos for Template Base Image Registration Lukasz A Machowski, Tshilizi Marwala School of Electrical an Information Engineering University of Witwatersran, Johannesburg, South
More informationImproving Performance of Sparse Matrix-Vector Multiplication
Improving Performance of Sparse Matrix-Vector Multiplication Ali Pınar Michael T. Heath Department of Computer Science an Center of Simulation of Avance Rockets University of Illinois at Urbana-Champaign
More informationA Stochastic Process on the Hypercube with Applications to Peer to Peer Networks
A Stochastic Process on the Hypercube with Applications to Peer to Peer Networs [Extene Abstract] Micah Aler Department of Computer Science, University of Massachusetts, Amherst, MA 0003 460, USA micah@cs.umass.eu
More informationA Neural Network Model Based on Graph Matching and Annealing :Application to Hand-Written Digits Recognition
ITERATIOAL JOURAL OF MATHEMATICS AD COMPUTERS I SIMULATIO A eural etwork Moel Base on Graph Matching an Annealing :Application to Han-Written Digits Recognition Kyunghee Lee Abstract We present a neural
More informationShift-map Image Registration
Shift-map Image Registration Linus Svärm Petter Stranmark Centre for Mathematical Sciences, Lun University {linus,petter}@maths.lth.se Abstract Shift-map image processing is a new framework base on energy
More informationA Framework for Dialogue Detection in Movies
A Framework for Dialogue Detection in Movies Margarita Kotti, Constantine Kotropoulos, Bartosz Ziólko, Ioannis Pitas, an Vassiliki Moschou Department of Informatics, Aristotle University of Thessaloniki
More informationTHE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE
БСУ Международна конференция - 2 THE BAYESIAN RECEIVER OPERATING CHARACTERISTIC CURVE AN EFFECTIVE APPROACH TO EVALUATE THE IDS PERFORMANCE Evgeniya Nikolova, Veselina Jecheva Burgas Free University Abstract:
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 4, APRIL
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 1, NO. 4, APRIL 01 74 Towar Efficient Distribute Algorithms for In-Network Binary Operator Tree Placement in Wireless Sensor Networks Zongqing Lu,
More informationAdditional Divide and Conquer Algorithms. Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication
Aitional Divie an Conquer Algorithms Skipping from chapter 4: Quicksort Binary Search Binary Tree Traversal Matrix Multiplication Divie an Conquer Closest Pair Let s revisit the closest pair problem. Last
More informationSkyline Community Search in Multi-valued Networks
Syline Community Search in Multi-value Networs Rong-Hua Li Beijing Institute of Technology Beijing, China lironghuascut@gmail.com Jeffrey Xu Yu Chinese University of Hong Kong Hong Kong, China yu@se.cuh.eu.h
More informationFinite Automata Implementations Considering CPU Cache J. Holub
Finite Automata Implementations Consiering CPU Cache J. Holub The finite automata are mathematical moels for finite state systems. More general finite automaton is the noneterministic finite automaton
More informationDual Arm Robot Research Report
Dual Arm Robot Research Report Analytical Inverse Kinematics Solution for Moularize Dual-Arm Robot With offset at shouler an wrist Motivation an Abstract Generally, an inustrial manipulator such as PUMA
More informationLearning Subproblem Complexities in Distributed Branch and Bound
Learning Subproblem Complexities in Distribute Branch an Boun Lars Otten Department of Computer Science University of California, Irvine lotten@ics.uci.eu Rina Dechter Department of Computer Science University
More informationIntensive Hypercube Communication: Prearranged Communication in Link-Bound Machines 1 2
This paper appears in J. of Parallel an Distribute Computing 10 (1990), pp. 167 181. Intensive Hypercube Communication: Prearrange Communication in Link-Boun Machines 1 2 Quentin F. Stout an Bruce Wagar
More informationPerformance Modelling of Necklace Hypercubes
erformance Moelling of ecklace ypercubes. Meraji,,. arbazi-aza,, A. atooghy, IM chool of Computer cience & harif University of Technology, Tehran, Iran {meraji, patooghy}@ce.sharif.eu, aza@ipm.ir a Abstract
More informationData Mining: Concepts and Techniques. Chapter 7. Cluster Analysis. Examples of Clustering Applications. What is Cluster Analysis?
Data Mining: Concepts an Techniques Chapter Jiawei Han Department of Computer Science University of Illinois at Urbana-Champaign www.cs.uiuc.eu/~hanj Jiawei Han an Micheline Kamber, All rights reserve
More informationCluster Center Initialization Method for K-means Algorithm Over Data Sets with Two Clusters
Available online at www.scienceirect.com Proceia Engineering 4 (011 ) 34 38 011 International Conference on Avances in Engineering Cluster Center Initialization Metho for K-means Algorithm Over Data Sets
More information6 Gradient Descent. 6.1 Functions
6 Graient Descent In this topic we will iscuss optimizing over general functions f. Typically the function is efine f : R! R; that is its omain is multi-imensional (in this case -imensional) an output
More informationOptimization of cable-stayed bridges with box-girder decks
Avances in Engineering Software 31 (2000) 417 423 www.elsevier.com/locate/avengsoft Optimization of cable-staye briges with box-girer ecks L.M.C. Simões*, J.H.J.O. Negrão Department of Civil Engineering,
More informationBIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES
BIJECTIONS FOR PLANAR MAPS WITH BOUNDARIES OLIVIER BERNARDI AND ÉRIC FUSY Abstract. We present bijections for planar maps with bounaries. In particular, we obtain bijections for triangulations an quarangulations
More informationAlgebraic transformations of Gauss hypergeometric functions
Algebraic transformations of Gauss hypergeometric functions Raimunas Viūnas Faculty of Mathematics, Kobe University Abstract This article gives a classification scheme of algebraic transformations of Gauss
More informationRobust Camera Calibration for an Autonomous Underwater Vehicle
obust Camera Calibration for an Autonomous Unerwater Vehicle Matthew Bryant, Davi Wettergreen *, Samer Aballah, Alexaner Zelinsky obotic Systems Laboratory Department of Engineering, FEIT Department of
More informationEstimating Velocity Fields on a Freeway from Low Resolution Video
Estimating Velocity Fiels on a Freeway from Low Resolution Vieo Young Cho Department of Statistics University of California, Berkeley Berkeley, CA 94720-3860 Email: young@stat.berkeley.eu John Rice Department
More informationShort-term prediction of photovoltaic power based on GWPA - BP neural network model
Short-term preiction of photovoltaic power base on GWPA - BP neural networ moel Jian Di an Shanshan Meng School of orth China Electric Power University, Baoing. China Abstract In recent years, ue to China's
More informationRobust PIM-SM Multicasting using Anycast RP in Wireless Ad Hoc Networks
Robust PIM-SM Multicasting using Anycast RP in Wireless A Hoc Networks Jaewon Kang, John Sucec, Vikram Kaul, Sunil Samtani an Mariusz A. Fecko Applie Research, Telcoria Technologies One Telcoria Drive,
More informationBackpressure-based Packet-by-Packet Adaptive Routing in Communication Networks
1 Backpressure-base Packet-by-Packet Aaptive Routing in Communication Networks Eleftheria Athanasopoulou, Loc Bui, Tianxiong Ji, R. Srikant, an Alexaner Stoylar arxiv:15.4984v1 [cs.ni] 27 May 21 Abstract
More informationChapter 9 Memory Management
Contents 1. Introuction 2. Computer-System Structures 3. Operating-System Structures 4. Processes 5. Threas 6. CPU Scheuling 7. Process Synchronization 8. Dealocks 9. Memory Management 10.Virtual Memory
More informationInterior Permanent Magnet Synchronous Motor (IPMSM) Adaptive Genetic Parameter Estimation
Interior Permanent Magnet Synchronous Motor (IPMSM) Aaptive Genetic Parameter Estimation Java Rezaie, Mehi Gholami, Reza Firouzi, Tohi Alizaeh, Karim Salashoor Abstract - Interior permanent magnet synchronous
More informationA fast embedded selection approach for color texture classification using degraded LBP
A fast embee selection approach for color texture classification using egrae A. Porebski, N. Vanenbroucke an D. Hama Laboratoire LISIC - EA 4491 - Université u Littoral Côte Opale - 50, rue Ferinan Buisson
More informationMining Sequential Patterns with Periodic Wildcard Gaps
Mining Sequential Patterns with Perioic Wilcar Gaps Youxi Wu, Lingling Wang, Jiaong Ren, Wei Ding, Xinong Wu Abstract Mining frequent patterns with perioic wilcar gaps is a critical ata mining problem
More information