Performance evaluation of link metrics in vehicle networks: a study from the Cologne case

Size: px
Start display at page:

Download "Performance evaluation of link metrics in vehicle networks: a study from the Cologne case"

Transcription

1 Performance evaluation of lin metrics in vehicle networs: a study from the Cologne case Jun Zhang Telecom Paristech, University of Paris-Saclay jun.zhang@telecomparistech.fr Meng Ying Ren Telecom Paristech, University of Paris-Saclay University of Technology of Troyes mengying.ren@telecomparistech.fr Houda Labiod Telecom Paristech, University of Paris-Saclay labiod@telecomparistech.fr ABSTRACT In vehicle ad hoc networs, the lin duration is an important concept for clustering and dissemination. Many lin metrics are proposed to predict it based on the vehicles velocities and distance between vehicles. However, there is a lac of comparison of these metrics under the same framewor. In this paper, we compare several common adopted lin metrics, LLT (lin life time), (spatial locality similarity), and (similarity function), in the performance of lin duration prediction, according to the vehicular mobility trace of the city of Cologne, Germany. We find that i) the impact of velocity prediction has different impact on different lin metrics; ii) and perform well in selecting long-lived lins; iv) LLT performs well in filtering out short-lived lins. We also show that, by combining and LLT intelligently, it is possible to create a lin metric that performs well in both selecting long-lived lins and filtering out short-lived lins. Keywords lin metric, vehicle networ 1. INTRODUCTION Due to the high mobility and scalability, traditional routing schemes for wireless networs do not perform well in vehicle ad hoc networs (VANETs). Instead, data forwarding/dissemination is suggested to replace routing in VANETs to reduce the protocol overhead, and prevent frequent lin breas. To scale down the complexity in data forwarding, clustering is one promising solution. The connections between clustering head (CH) and clustering members (CMs) remain stable in a certain period, so that data forwarding only needs to focus on the lin breas between CHs. The ey component of clustering algorithms in VANETs is the design of the lin metric. The lin metric should Permission to mae digital or hard copies of all or part of this wor for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this wor owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from permissions@acm.org. c 16 ACM. ISBN DOI:1.114/123 reveal how long the connection between two vehicles will last. Because of randomness of the vehicles mobility, the lin duration between vehicles cannot be nown in advance. Therefore, a lot of schemes utilize current status of vehicles to predict the future, while distance between vehicles and difference of velocities of two vehicles are the two most adopted parameters. There are different ways to combine distance and difference of velocities to form the metric. The lin life time (LLT) [9] [11] defines the metric as the ratio between the distance that one vehicle goes out of the transmission range of anther one and the difference of velocity. The spatial locality similarity () [4] defines the metric as a normalized value, such that the distance and the difference of velocities play similar roles. The similar function () suggested by [2] used the sum of the current distance and predicted future distance to indicate the lin duration between vehicle pairs. We would lie to figure out what ind of combination of these two parameters will lead to a more accurate prediction of lin duration. To reach this goal, we study the performance of these lin metrics according to the vehicular mobility trace of the city of Cologne, Germany [1]. We compare these metrics in three aspects: correlation with the actual lin duration, the performance of the top lins according to the lin metrics, and the performance of the last lins according to the lin metrics. The paper below is organized as follows. In the Section 2 we review the related wors on the lin metrics based on distance and difference of velocities. In the Section 3 we compare the performance of LLT,,, and compare them with the distance based, and difference of velocity based benchmar approaches. In the Section 4 we propose a new lin metric based on the analysis of shortcoming and benefit of previous lin metrics. In the Section we conclude the paper. 2. RELATED WORK In the literature, there are many lin metrics proposed to predict the lin quality of vehicle pairs in vehicle networs. Because the distance between vehicles is the dominate factor in determining the lin quality, these lin metrics are required to reveal the length of lin duration, i.e., how long two vehicles are within a certain distance to each other. Intuitively, the lin between two vehicles which are at a large distance to each other, and have a large difference in velocity are expected to have a short lin duration, and that between

2 two vehicles which are close to each other, and have similar velocity are expected to have a long one. Hence, the distance between two vehicles and velocity of each vehicles become the fundamental parameters in designing lin metrics. In the following, we will review several typical lin metrics that are based on distance and velocity. For the purpose of coherence, in Table 1 we give all necessary variables for the definition of following lin metrics. Table 1: Variables used for the definition of different lin metrics Variables Meaning l i = (x i,y i) vehicle i s location v i vehicle i s velocity vector θ i vehicle i s direction in the polar coordinate system z i,j,z = {l,x,v} z i z j z,z {l,x,v} Norm of z r maximal transmission range maximal velocity (scalar) v max 2.1 Lin life time Lin life time (LLT) utilizes the predicted lin duration as the lin metric. The wor in [9] gave the equations to compute LLT, given the current locations and velocities of two vehicles. Let v i and v j be the velocities of two vehicles i and j, the direction of velocities of these two vehicles in the polar coordinator system are θ i and θ j respectively. The coordinations of these two vehicles are (x i,y i) and (x j,y j) respectively. Let a = v i cos(θ i) v j cos(θ j) b = x i x j c = v i sin(θ i) v j sin(θ j) d = y i y j. The lin life time, that is, the time duration that these two vehicles are within the distance r is then computed as LLT ij = (ab+cd)+ (a 2 +c 2 )r 2 (ad bc) 2 a 2 +c 2. (1) When the two vehicles move in the same or opposite direction, the above equation can be simplified as LLT ij = as suggested in [11]. vij lij + vij r ( v ij) 2, (2) 2.2 Spatial locality similarity The wor in [4] proposed to use spatial locality similarity () as one part of lin metric. The intuition is to use normalized ratio of distance and difference of velocities to obtain a normalized value that indicates how long the lin can last. A higher indicates two vehicles moves in a similar manner and stays in the similar region, which implies a longer lin duration. Formally, spatial locality similarity is defined as 1 ij =. (3) 1+( l ij ) r 2 +( v ij 2v max ) Similarity function In [7], [2] an affinity propagation based clustering algorithm is proposed to reduce the overhead in establishing clusters. The lin metric suggested in [2] is called similarity function (). It uses the sum of the current distance and predicted future distance at t seconds later between two vehicles to predicate the closeness of two vehicles in the future. Formally, it is defined as ij = l ij (l i +t v i) (l j +t v j). (4) 3. PERFOANCE COMPARISON OF LINK METRICS In this section, we compare the performance of different lin metrics according to the vehicle trace file from TAPAS- Cologne project [1]. The setting of scenarios, and lins metrics in comparison are described in Section 3.1, 3.2 respectively/ An analysis of the lin duration distribution is conducted in Section 3.3. After that, we evaluate lin metrics in the following aspects: 1. correlation between lin metrics and actual lin duration (Section 3.4), 2. average lin duration of the top and bottom lins selected by lin metrics (Section 3.). 3.1 Scenario settings We use the vehicle mobility trace from the TAPASCologne project [1] for the purpose of the analysis of lin metrics. This trace file records more than 7 individual car trips in the city of Cologne covers a region of square ilometers. According to the suggestion from their web site [1], we extract the the location and velocity of vehicles between 6am and8am. Wesubtracttypicalcases outofthis2hours trace. In each case, we determine a starting time t c, where c is the index for cases, and select vehicles (called central vehicles) that are moving in the city at that moment. For each selected central vehicle, we also select its nearby vehicles (called neighboring vehicles) that are within meters and move in the same direction as the central vehicle. Here meters is defined to be the threshold to decide whether two vehicles can communicate or not. Then we record the following information of these vehicles: 1. location and velocity, 2. lin metrics between each (central vehicle, neighboring vehicle) pair calculated at the starting time t c, 3. and lin duration calculated from the starting time t c, i.e., the duration of time that two vehicles are within a distance of meters. The statistics of the five testing cases is shown in Table. 2. v c specifies the mean velocity of central vehicles (in the unit of meters per second), and v nb specifies the mean velocity of neighboring vehicles. v c v nb specifies the mean difference in velocity of the central vehicles and their neighboring vehicles when they move in the same direction. Density specifies the mean number of neighboring vehicles around the central vehicle. All of the above properties are measured at the starting time. These five cases can be classified by the velocity of the central vehicle, the difference of the velocity between the central vehicle and neighboring vehicle, and the vehicle density, which is shown in Table 3.

3 Table 2: Setting of mobility trace Case v c v nb v c v nb Density Table 3: Classification of testing cases Cases Criteria high middle low v c 1, 4 2, 3 v c v nb 4-1,2,3, Density 4, 2, Lin metrics in comparison Lin metrics are calculated based on distance and velocity at the starting time t c, where c is the index of the case. We consider two ind of velocities: instant velocity and average velocity. The instant velocity for each vehicle is given by the trace file at each case at the time t c. The average velocity for each vehicle i is the one in the last t seconds, which is calculated as l i(t c) l i(t c T). () T In our simulation, we set T as 1 seconds. The lin metrics in comparison include: 1. lin life time by instant velocity () 2. lin life time by average velocity () 3. spatial locality similarity by instant velocity ((I)) 4. spatial locality similarity by average velocity ((A)). similarity function by instant velocity with 1 second distance prediction ((I,1)) 6. similarity function by average velocity with 1 second distance prediction ((A,1)) 7. similarity function by instant velocity with 1 seconds distance prediction ((I,1)) 8. similarity function by average velocity with 1 seconds distance prediction ((A,1)) In addition, we consider the distance, and difference in velocities () as two benchmar lin metrics. 3.3 Lin duration distribution We plot the distribution of lin duration between central vehicles and neighboring vehicles in the five testing cases in the Fig. 1. Lin duration is measured in the unit of seconds. From this figure, we have two observations: 1. mean linduration increasesas the max( v c, v nb ) decreases: when the velocity is high (Fig. 1(a)-Fig. 1(d)), more than half of lins have lin duration less than seconds; while when the velocity is low (Fig. 1(e)), the median lin duration can be up to 1 seconds. 2. v c v nb plays marginal role in the lin duration distribution: there is no big difference in the case 1 and 4, while the velocity different in the latter is much large; in contrast, the lin duration distribution is quite different, while the velocity difference is similar in case 2 and. The reason for the first observation is because the maximal value of the instant velocities of two neighboring vehicles indicates how fast the lin between them will be lost in the worst case. For example, for two vehicles of distance 1 meters and at the velocities of 12m/s, their lin can brea in 1 seconds if one vehicle braes. On the other hand, for same vehicles at the velocities of 4m/s, it will tae up to seconds if one vehicle braes. The reason for the second observation is because the velocity of vehicles may change rapidly. So a large difference in the instant velocities of two vehicles does not necessarily indicate a large difference in the average velocities. Lin duration (seconds) Lin duration (seconds) Lin duration (seconds) Lin duration (seconds) Lin duration (seconds) Figure 1: The lin duration distribution between central vehicles and neighboring vehicles in the five testing cases 3.4 Correlation analysis We study the correlation between lin metrics and actual lin duration to see how well each lin metric predict how long each lin last. Two inds of correlation is considered,

4 global correlation and local correlation. The global correlation regards all lins in each case as a whole group, and computes the correlation between lin metrics and actual lin duration on these lins. The local correlation regards all lins attached to the same central vehicle in each case as a whole group, computes the correlation for each group, and taes the mean correlation of all groups in the same case. For the correlation coefficients, two inds of correlation coefficients are considered: correlation based on value, and ran correlation. The first one quantifies the extent of linear dependency between the values of two groups of data, and the second quantifies the extent of linear dependency between the orders of two groups of data. For the correlation coefficient based on value, we choose the commonly adopted approach: Pearson product-moment correlation coefficient [6]. It is the division between the covariance of two random variables and the product of the standard deviation of these two variables. For two groups of associated data(a 1,a 2,,a n), and (b 1,b 2,,b n), their Pearson product-moment correlation coefficient is p(a,b) = n n i=1 (aibi) n n i=1 ai i=1 bi n n i=1 a2 i ( n i=1 ai)2 n n i=1 b2 i ( n i=1 bi)2. (6) is always between -1 and 1. When it is close to -1 and 1, it infers that these two groups of data has a strong linear dependency, either negatively, or positively. When it is, it infers that these two groups of data is independent. For the ran correlation, we choose the Kendall s tau coefficient [3]. It measures the similarity of the ordering of two groups of data. Let (a 1,a 2,,a n), and (b 1,b 2,,b n) be the two groups of data in concern. A pair of tuples of value (a i,a j) and (b i,b j), where i j, is said to be concordant if both a i > a j and b i > b j, or both a i < a j and b i < b j. This pair is said to be disconcordant if both a i > a j and b i < b j, or a i < a j and b i < b j. When a i = a j, or b i = b j, this pair is neither concordant nor disconcordant. The Kendall s tau coefficient, in the τ b format, is defined as n c n d τ B(a,b) =, (7) n n 1 n n 2 wheren c isthenumberofconcordantpairs, n d is thenumber of disconcordant pairs, n = n(n 1)/2, n 1 = (t i(t i 1))/2, and n 2 = (µ j(µ j 1))/2. Here t i is the number of tied values of the i th group of ties for the first quantity, and µ j is the number of tied values of the j th group of ties for the second quantity. The Kendall s tau coefficient is ranged between -1 and 1. The coefficient 1 indicates the ran of these two groups are same, and -1 indicts a totally reversed order between these two groups. The closer Kendall s tau coefficient is to 1, the more similarity in order is between these two groups. Fig. 2 and Fig. 3 plot the global correlation and local correlation for the five testing cases. For both global and local correlation, we can see that: 1. Correlation coefficient between lin metrics and actual lin duration is usually between.2 and.4, showing a wea positive correlation. In some cases, certain lin metrics have zero correlation, showing the incapability to ran or evaluate the actual lin duration. The Pearson coefficient and Kendall s tau coefficient in certain scenarios can be quite different, especially for LLT, showing that there exists large mismatch between actual lin duration and predicted lin duration. 2. The correlation by LLT is similar to that by the difference of velocity. In contrast, the correlation by and is similar to that by distance. In all cases, the global correlation and local correlation can be quite different. This is because neighboring vehicles move in a similar mobility pattern. Therefore, difference of velocities plays a more important role in global correlation, and distance plays a more important role in local correlation, except that there exists a large gap in velocity between central vehicles and neighboring vehicles (case 4). 3. The impact of the difference in instant velocity and average velocity on LLT is much significantly compared with and. There is nearly no difference in the performance of (I) and (A), while there is no consistent order of performance by (I,1), (I,1), (A,1), (A,1). The special findings on the global correlation are as follows: 1. When the mean velocity in the networ is low, distance, and so does and, has a higher correlation with the lin duration. 2. When the mean velocity is not low, difference in velocities has a higher correlation with lin duration among all lin metrics. For the local correlation, we can see that 1. When the difference of velocities between central vehicle and neighboring vehicle is small, distance has a higher correlation with the lin duration among different lin metrics; 2. In general, the correlation between vehicle s velocities with lin duration does not outperform other lin metrics, unless there is a large difference in the velocity between central vehicles and neighboring vehicles. Overall, we can see that, there is no winning lin metrics for all cases. In general, the maximal value of the correlation coefficient between distance and lin duration, or that between difference in velocities and lin duration determine the upper bound of correlations of all lin metrics in comparison. The leading lin metrics and dominating parameters (distance or velocity) in different conditions is summarized in the Table Top and Bottom lins In the problem of forwarder selection and cluster-head cluster-member association, it is important to select reliable candidates that have better lin metrics. On the other hand, the computation of the node metrics for the election of cluster heads is usually based on the aggregation of lin metrics for lins attached to the same vehicle. For the purpose of accurate prediction, lins with worse lin metrics should be filtered out in the early stage to avoid polluting the calculation. Therefore, the lin duration of the top or the bottom

5 Table 4: Summarization of the correlation between lin metrics and lin duration Condition Leading lin metrics Dominating parameters Global correlation Small mean velocity LLT distance Large mean velocity, Local correlation Similar group velocity, distance Different group velocity LLT (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) Correlation with lin duration Correlation with lin duration Correlation with lin duration Correlation with lin duration (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) Correlation with lin duration Correlation with lin duration Correlation with lin duration Correlation with lin duration (A,1) (I,1) (A,1) (I,1) (A) (I) (A,1) (I,1) (A,1) (I,1) (A) (I) Correlation with lin duration Correlation with lin duration Figure 2: The global correlation between different lin metric and actual lin duration in the five testing cases Figure 3: The local correlation between different lin metric and actual lin duration in the five testing cases lins selected by lin metrics is also an important criteria in evaluation. Weplottheaveragelindurationbottom andtop lins bydifferentlinmetrics inthefivetestingcases infig. 4and Fig. (in the unit of seconds). As reflected in the section 3.4, whether using instant velocity or average velocity as the input has a marginal impact on the performance of. In addition, the performance of (I,1), (A,1), (I, 1) and (A, 1) is similar and does not have a consistent ordering in different cases. Therefore, for and, we simply use (I,1) and (I,1) to represent the performance of lin metrics in those families. In Fig. 4, we can see that: 1.,,, is not good in identifying short-lived lins, i.e., many lins with large difference in velocities, or small,, still have a large lin duration. 2. in general selects the most short-lived lins among all lin metrics for the first five or first ten bottom lins, i.e., when is very low, there is a higher lielihood that this lin s lin duration is short. 3. Although distance is not able to identifying very shortlived lins, it is possible to detect relative short-lived lins. This is because when the neighboring vehicles have similar mobility pattern, a vehicle that is farther

6 away from the central vehicle is expected to move out sooner. In Fig., we can see the curves of, and distance form one group, and LLT and form another. The average lin duration of the top lins by lin metrics in the firstgroupingeneral islargerthanthanbythesecondgroup. This is because distance has a higher local correlation with the actual lin duration, as mentioned in the Fig. 3 before. Overall, we can see that, there is no lin metric both achieve good performance in accurately selecting lins with long lin duration and filtering out short-lived lins. Average lin duration of bottom lins Average lin duration of bottom lins 3 2 Lin duration Lin duration Average lin duration of bottom lins Average lin duration of bottom lins Lin duration Lin duration Average lin duration of top lins Average lin duration of top lins Lin duration 3 Average lin duration of top lins Lin duration Average lin duration of top lins Average lin duration of top lins Lin duration Lin duration Lin duration Figure : The top lins selected by different lin metrics Average lin duration of bottom lins Lin duration Figure 4: The bottom lins selected by different lin metrics 4. A NEW LINK METRIC 4.1 definition From the discussion in the Section 3 we can see that previous distance and velocity based lin metrics can be classified into two categories: distance oriented (, ) and velocity oriented (LLT). The lin metrics in the first categories tends to achieve better performance in selecting lins with long duration, and that in the second categories tends to achieve better performance in filtering out lins with short duration. In terms of correlation with the actual lin duration, lin metrics in both categories may have low correlations with the lin duration in certain cases. To overcome the drawbac of these previous lin metrics, we propose to combine distance oriented lin metrics and velocity oriented lin metrics together to form a new one. The intuition is as follows. The new lin metric is based on distance oriented schemes, so as to have better prediction on long-lived lins. In addition, a velocity oriented module is added to this metric, so as to be sensible to lins with short duration. We choose (I) as the basic distance oriented module, and as the basic velocity oriented module. Because both of them are positive and easy to be computed. The new lin () metric is computed as { ij, if LLT ij t th ij = ij LLT ij t th, otherwise When LLT ij is very small, this new lin metric should also besmall as its valueis scaled downwith thefraction between LLT ij and t th. When LLT ij is sufficiently large, this new lin metric becomes ij. We fix t th as 1 seconds in default. 4.2 evaluation (8)

7 As shown in Fig. 6, the correlation between this new lin metric and the actual lin duration is always larger than.3, for both correlation coefficients. Compared with the performance of other lin metrics in Fig. 2 and Fig. 3, this new lin metric always achieve a performance close to the best one. Fig. 7 and Fig. 8 shows the comparison between the proposed new lin metric () in selecting top duration lins and bottom duration lins with other previous lin metrics. For the ease of display, we remove the curves by the lin metrics that have been shown to not perform well. We can see that, the proposed new lin metric achieves nearly the best performance in all cases, thans to the capability in identifying very short-lived lins by, and in identifying long-lived lins by (I). Case Correlation with lin duration (a) Global correlation Case Correlation with lin duration (b) Local correlation Figure 6: Correlation between proposed lin metrics and actual lin duration 4.3 application Forwarder selection The proposed new lin metric can be applied to select a forwarder that rests in the communication range for a relative long time. In order to now how reliable the suggestion given by this new lin metric is, we use a conditional probability to quantify its effect. We define P b(ld(a) > LD(b) nl(a) > nl(b) + δ) as the conditional probability that lin a s lin duration is larger than that of lin b, given that the new lin metric of the lin a is larger than that of lin b by δ. Fig. 9 shows this conditional probability in the five testing cases. We can see that, as long as the new lin metric of one lin is larger than anther by.2, there is nearly 8% probability that this lin s duration is larger. In practise, such a property is very helpful in distinguishing long-lived lins and short-lived lins with a high confidence. In addition, we can see from Fig. 9 that such a probability increases when the velocities of vehicles decreases Cluster head election The proposed new lin metric can be used to form the metric for cluster head election. In the literature, the metric for each cluster head candidate can be simply -based, such as the Lowest- scheme in [], or based on the relative mobility () of neighboring nodes, i.e., the standard deviation of the change of distance between node pairs [8]. Another common approach is to aggregate lins metrics, i.e., to tae the mean lin metric of lins between the cluster candidate and its neighbors. We compare our metric with,,,,, in cluster head election of the five testing cases under the above Average lin duration of bottom lins Average lin duration of bottom lins Lin duration Lin duration Average lin duration of bottom lins 1 1 Average lin duration of bottom lins Average lin duration of bottom lins 6 3 Lin duration Lin duration Lin duration Figure 7: The bottom lins selected by the proposed new lin metric metric aggregation approach. In addition, we also compare the relative mobility approach, Lowest- approach, and the optimal approach that use lin duration as the metric. In order to compare different cluster head election metric fairly, we consider the following evaluation criteria. Each central vehicle i selects s neighbors with the best lin metrics (except and Lowest-), and set its cluster head candidate metric m i as the mean value of these lin metrics. Considering the scalability, s is set as s = max(1,nb(i)/1), where NB(i) is the number of i s neighbors. The mean lin duration of these s lins attached to the vehicle i is denoted as LD(i). Top five central vehicles is selected based on the cluster head candidate metric. The corresponding performance criteria is the mean lin duration of the s lins attached to these five central vehicles. As shown in Fig. 1, in most cases (except case 3), is the one that has the closest performance to the optimal one. Even in the case 3, its performance is close to the best benchmar metrics in comparison. Therefore, is effectively in predicting cluster heads that maintains stable connection with their neighbors.. CONCLUSION In this paper, we studied lin metrics in vehicles networs

8 Average lin duration of top lins Lin duration Average lin duration of top lins Lin duration Mean lin duration (seconds) 6 8 Mean lin duration (seconds) Average lin duration of top lins Lin duration 3 Average lin duration of top lins 1 1 Lin duration 1 Mean lin duration (seconds) 1 Mean lin duration (seconds) Average lin duration of top lins Lin duration 1 3 Mean lin duration (seconds) Figure 8: The top lins selected by the proposed new lin metric Figure 1: The mean lin duration of selected lins attached to the central vehicle Pb(LD(a)>LD(b) nl(a)>nl(b)+δ) Case 1 Case 2 Case 3 Case 4 Case.6. 1 δ Figure 9: Conditional probability that the lin duration of one lin a is larger than anther lin b, given that nl(a) > nl(b)+δ that based on distance and velocities, including lin life time, spatial locality similarity and similar function, according to the real vehicle mobility trace in the city Cologne. We compare these lin metrics in terms of correlation with the actual duration, and average lin duration of top and bottom lins selected by these lin metrics. We reveal that, these lin metrics have either a performance close to the distancebased approach, or velocity-based approach. There is no winning lin metrics that performs the best in all cases. By analyzing these lin metrics, we proposed a new lin met- ric that combines the benefit or distance-based approach and velocity-based approach. The new lin metric performs well in both correlation with the actual lin duration, and the capability in selecting long-lived lins and filtering out short-lived lins. In the future, we will extend our analysis to other real mobility data, such as Madrid trace [?], to see whether our conclusion is generic. 6. REFERENCES [1] TAPASCologne project. [2] M. Bhaumi, S. DasGupta, and S. Saha. Affinity based clustering routing protocol for vehicular ad hoc networs. Procedia Engineering, 38: , 12. [3] M. G. Kendall. A new measure of ran correlation. Biometria, 3(1/2):81 93, [4] Y. Li, M. Zhao, and W. Wang. Internode mobility correlation for group detection and analysis in vanets. Vehicular Technology, IEEE Transactions on, 62(9):49 461, 13. [] C. R. Lin and M. Gerla. Adaptive clustering for mobile wireless networs. Selected Areas in Communications, IEEE Journal on, 1(7): , [6] K. Pearson. Note on regression and inheritance in the

9 case of two parents. Proceedings of the Royal Society of London, 8:2 242, 189. [7] C. Shea, B. Hassanabadi, and S. Valaee. Mobility-based clustering in vanets using affinity propagation. In Global Telecommunications Conference, 9. GLOBECOM 9. IEEE. IEEE, 9. [8] E. Souza, I. Niolaidis, and P. Gburzynsi. A new aggregate local mobility (ALM) clustering algorithm for VANETs. In IEEE ICC, 1. [9] W. Su, S.-J. Lee, and M. Gerla. Mobility prediction and routing in ad hoc wireless networs. International Journal of Networ Management, 11(1):3 3, 1. [1] S. Uppoor, O. Trullols-Cruces, M. Fiore, and J. M. Barcelo-Ordinas. Generation and analysis of a large-scale urban vehicular mobility dataset. Mobile Computing, IEEE Transactions on, 13():161 17, 14. [11] S.-S. Wang and Y.-S. Lin. PassCAR: A passive clustering aided routing protocol for vehicular ad hoc networs. Computer Communications, 36(2):17 179, 13.

EUSIPCO

EUSIPCO EUSIPCO 3 569736677 FULLY ISTRIBUTE SIGNAL ETECTION: APPLICATION TO COGNITIVE RAIO Franc Iutzeler Philippe Ciblat Telecom ParisTech, 46 rue Barrault 753 Paris, France email: firstnamelastname@telecom-paristechfr

More information

Maximum Achievable Gain of a Two Port Network

Maximum Achievable Gain of a Two Port Network Maximum Achievable Gain of a Two Port Network Ali Niknejad Siva Thyagarajan Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2016-15 http://www.eecs.berkeley.edu/pubs/techrpts/2016/eecs-2016-15.html

More information

Blame and Coercion: Together Again for the First Time

Blame and Coercion: Together Again for the First Time Blame and Coercion: Together Again for the First Time Supplementary Material Jeremy Siek Indiana University, USA jsiek@indiana.edu Peter Thiemann Universität Freiburg, Germany thiemann@informatik.uni-freiburg.de

More information

A Black Box Measurement Method for Reliability of Wireless Communication

A Black Box Measurement Method for Reliability of Wireless Communication A Black Box Measurement Method for Reliability of Wireless Communication .@salzburgresearch.at ABSTRACT In the future, connected vehicles and automated factories will use wireless

More information

Mathematical Modeling of Incentive Policies in P2P Systems

Mathematical Modeling of Incentive Policies in P2P Systems Mathematical Modeling of Incentive Policies in P2P Systems Bridge Q. Zhao Dept. of Computer Science and Engineering The Chinese University of HK Shatin, NT, Hong Kong qzhao@cse.cuhk.edu.hk John C.S. Lui

More information

Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks

Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks Communications and Networ, 2010, 2, 87-92 doi:10.4236/cn.2010.22014 Published Online May 2010 (http://www.scirp.org/journal/cn Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless

More information

Geometric interpretation of signals: background

Geometric interpretation of signals: background Geometric interpretation of signals: background David G. Messerschmitt Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-006-9 http://www.eecs.berkeley.edu/pubs/techrpts/006/eecs-006-9.html

More information

Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering

Algebraic Gossip: A Network Coding Approach to Optimal Multiple Rumor Mongering Algebraic Gossip: A Networ Coding Approach to Optimal Multiple Rumor Mongering Supratim Deb, Muriel Médard, and Clifford Choute Laboratory for Information & Decison Systems, Massachusetts Institute of

More information

Test Generation for Designs with Multiple Clocks

Test Generation for Designs with Multiple Clocks 39.1 Test Generation for Designs with Multiple Clocks Xijiang Lin and Rob Thompson Mentor Graphics Corp. 8005 SW Boeckman Rd. Wilsonville, OR 97070 Abstract To improve the system performance, designs with

More information

Metric-based classifiers. Nuno Vasconcelos UCSD

Metric-based classifiers. Nuno Vasconcelos UCSD Metric-based classifiers Nuno Vasconcelos UCSD Statistical learning goal: given a function f. y f and a collection of eample data-points, learn what the function f. is. this is called training. two major

More information

The Probabilistic Method

The Probabilistic Method Lecture 3: Tail bounds, Probabilistic Method Today we will see what is nown as the probabilistic method for showing the existence of combinatorial objects. We also review basic concentration inequalities.

More information

Nemo: Multi-Criteria Test-Suite Minimization with Integer Nonlinear Programming.

Nemo: Multi-Criteria Test-Suite Minimization with Integer Nonlinear Programming. Jun-Wei Lin University of California, Irvine junwel1@uci.edu Joshua Garcia University of California, Irvine joshug4@uci.edu ABSTRACT Multi-criteria test-suite minimization aims to remove redundant test

More information

Logarithmic quantisation of wavelet coefficients for improved texture classification performance

Logarithmic quantisation of wavelet coefficients for improved texture classification performance Logarithmic quantisation of wavelet coefficients for improved texture classification performance Author Busch, Andrew, W. Boles, Wageeh, Sridharan, Sridha Published 2004 Conference Title 2004 IEEE International

More information

Feasibility-Preserving Crossover for Maximum k-coverage Problem

Feasibility-Preserving Crossover for Maximum k-coverage Problem Feasibility-Preserving Crossover for Maximum -Coverage Problem Yourim Yoon School of Computer Science & Engineering Seoul National University Sillim-dong, Gwana-gu Seoul, 151-744, Korea yryoon@soar.snu.ac.r

More information

Evaluating the Consistency of Estimation

Evaluating the Consistency of Estimation Tampere University of Technology Evaluating the Consistency of Estimation Citation Ivanov, P., Ali-Löytty, S., & Piche, R. (201). Evaluating the Consistency of Estimation. In Proceedings of 201 International

More information

k-hit Query: Top-k Query with Probabilistic Utility Function

k-hit Query: Top-k Query with Probabilistic Utility Function -Hit Query: Top- Query with Probabilistic Utility Function Peng PENG Hong Kong University of Science and Technology Clear Water Bay, Kowloon, Hong Kong ppeng@cse.ust.h Raymond Chi-Wing WONG Hong Kong University

More information

Empirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity

Empirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity Empirical Study of Traffic Velocity Distribution and its Effect on VANETs Connectivity Sherif M. Abuelenin Department of Electrical Engineering Faculty of Engineering, Port-Said University Port-Fouad,

More information

Information Storage Capacity of Crossbar Switching Networks

Information Storage Capacity of Crossbar Switching Networks Information Storage Capacity of Crossbar Switching etworks ABSTRACT In this work we ask the fundamental uestion: How many bits of information can be stored in a crossbar switching network? The answer is

More information

VEHICULAR TRAFFIC FLOW MODELS

VEHICULAR TRAFFIC FLOW MODELS BBCR Group meeting Fri. 25 th Nov, 2011 VEHICULAR TRAFFIC FLOW MODELS AN OVERVIEW Khadige Abboud Outline Introduction VANETs Why we need to know traffic flow theories Traffic flow models Microscopic Macroscopic

More information

Asymptotic Distribution of The Number of Isolated Nodes in Wireless Ad Hoc Networks with Unreliable Nodes and Links

Asymptotic Distribution of The Number of Isolated Nodes in Wireless Ad Hoc Networks with Unreliable Nodes and Links Asymptotic Distribution of The Number of Isolated Nodes in Wireless Ad Hoc Networs with Unreliable Nodes and Lins Chih-Wei Yi, Peng-Jun Wan, Kuo-Wei Lin and Chih-Hao Huang Department of Computer Science

More information

Data Mining Techniques

Data Mining Techniques Data Mining Techniques CS 622 - Section 2 - Spring 27 Pre-final Review Jan-Willem van de Meent Feedback Feedback https://goo.gl/er7eo8 (also posted on Piazza) Also, please fill out your TRACE evaluations!

More information

XCSF with Local Deletion: Preventing Detrimental Forgetting

XCSF with Local Deletion: Preventing Detrimental Forgetting XCSF with Local Deletion: Preventing Detrimental Forgetting ABSTRACT Martin V. Butz Department of Psychology III University of Würzburg Röntgenring 977 Würzburg, Germany butz@psychologie.uni-wuerzburg.de

More information

Algorithm Independent Topics Lecture 6

Algorithm Independent Topics Lecture 6 Algorithm Independent Topics Lecture 6 Jason Corso SUNY at Buffalo Feb. 23 2009 J. Corso (SUNY at Buffalo) Algorithm Independent Topics Lecture 6 Feb. 23 2009 1 / 45 Introduction Now that we ve built an

More information

Analysis of Hop-Distance Relationship in Spatially Random Sensor Networks

Analysis of Hop-Distance Relationship in Spatially Random Sensor Networks Analysis of Hop-Distance elationship in Spatially andom Sensor Networks Serdar Vural Department of Electrical and Computer Engineering The Ohio State University Columbus, OH vurals@ece.osu.edu Eylem Ekici

More information

CSE 417T: Introduction to Machine Learning. Final Review. Henry Chai 12/4/18

CSE 417T: Introduction to Machine Learning. Final Review. Henry Chai 12/4/18 CSE 417T: Introduction to Machine Learning Final Review Henry Chai 12/4/18 Overfitting Overfitting is fitting the training data more than is warranted Fitting noise rather than signal 2 Estimating! "#$

More information

Linear Prediction Theory

Linear Prediction Theory Linear Prediction Theory Joseph A. O Sullivan ESE 524 Spring 29 March 3, 29 Overview The problem of estimating a value of a random process given other values of the random process is pervasive. Many problems

More information

Surge Pricing and Labor Supply in the Ride- Sourcing Market

Surge Pricing and Labor Supply in the Ride- Sourcing Market Surge Pricing and Labor Supply in the Ride- Sourcing Market Yafeng Yin Professor Department of Civil and Environmental Engineering University of Michigan, Ann Arbor *Joint work with Liteng Zha (@Amazon)

More information

Massive Experiments and Observational Studies: A Linearithmic Algorithm for Blocking/Matching/Clustering

Massive Experiments and Observational Studies: A Linearithmic Algorithm for Blocking/Matching/Clustering Massive Experiments and Observational Studies: A Linearithmic Algorithm for Blocking/Matching/Clustering Jasjeet S. Sekhon UC Berkeley June 21, 2016 Jasjeet S. Sekhon (UC Berkeley) Methods for Massive

More information

Trade Space Exploration with Ptolemy II

Trade Space Exploration with Ptolemy II Trade Space Exploration with Ptolemy II Shanna-Shaye Forbes Electrical Engineering and Computer Sciences University of California at Berkeley Technical Report No. UCB/EECS-2009-102 http://www.eecs.berkeley.edu/pubs/techrpts/2009/eecs-2009-102.html

More information

Multiple Variable Analysis

Multiple Variable Analysis Multiple Variable Analysis Revised: 10/11/2017 Summary... 1 Data Input... 3 Analysis Summary... 3 Analysis Options... 4 Scatterplot Matrix... 4 Summary Statistics... 6 Confidence Intervals... 7 Correlations...

More information

Random Forests. These notes rely heavily on Biau and Scornet (2016) as well as the other references at the end of the notes.

Random Forests. These notes rely heavily on Biau and Scornet (2016) as well as the other references at the end of the notes. Random Forests One of the best known classifiers is the random forest. It is very simple and effective but there is still a large gap between theory and practice. Basically, a random forest is an average

More information

Max-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference

Max-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference 1 Max-Min Relay Selection for Legacy Amplify-and-Forward Systems with Interference Ioannis Kriidis, Member, IEEE, John S. Thompson, Member, IEEE, Steve McLaughlin, Senior Member, IEEE, and Norbert Goertz,

More information

On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic

On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic Irith Pomeranz 1 and Sudhakar M. Reddy 2 School of Electrical & Computer Eng.

More information

Stability Analysis of Predator- Prey Models via the Liapunov Method

Stability Analysis of Predator- Prey Models via the Liapunov Method Stability Analysis of Predator- Prey Models via the Liapunov Method Gatto, M. and Rinaldi, S. IIASA Research Memorandum October 1975 Gatto, M. and Rinaldi, S. (1975) Stability Analysis of Predator-Prey

More information

DECISION MAKING BY METHOD OF KEY SUCCESS FACTORS DISCRIMINATION: KEYANP

DECISION MAKING BY METHOD OF KEY SUCCESS FACTORS DISCRIMINATION: KEYANP 9th ISAHP 007, Chile, Vina del Mar, August 3-6 007 DECISION MAKING BY METHOD OF KEY SUCCESS FACTORS DISCRIMINATION: KEYANP Prof., Dr.Sci Anatoliy Slyeptsov Donets National University, Uraine anatoliy-slyeptsov@yandex.ru

More information

Copyright 1996, by the author(s). All rights reserved.

Copyright 1996, by the author(s). All rights reserved. Copyright 1996, by the author(s). All rights reserved. Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are

More information

Where to Find My Next Passenger?

Where to Find My Next Passenger? Where to Find My Next Passenger? Jing Yuan 1 Yu Zheng 2 Liuhang Zhang 1 Guangzhong Sun 1 1 University of Science and Technology of China 2 Microsoft Research Asia September 19, 2011 Jing Yuan et al. (USTC,MSRA)

More information

A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY

A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE SIMILARITY IJAMML 3:1 (015) 69-78 September 015 ISSN: 394-58 Available at http://scientificadvances.co.in DOI: http://dx.doi.org/10.1864/ijamml_710011547 A METHOD OF FINDING IMAGE SIMILAR PATCHES BASED ON GRADIENT-COVARIANCE

More information

Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal

Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Channel Probing in Communication Systems: Myopic Policies Are Not Always Optimal Matthew Johnston, Eytan Modiano Laboratory for Information and Decision Systems Massachusetts Institute of Technology Cambridge,

More information

Total Ordering on Subgroups and Cosets

Total Ordering on Subgroups and Cosets Total Ordering on Subgroups and Cosets Alexander Hulpke Department of Mathematics Colorado State University 1874 Campus Delivery Fort Collins, CO 80523-1874 hulpke@math.colostate.edu Steve Linton Centre

More information

Entity Resolution with Crowd Errors

Entity Resolution with Crowd Errors Entity Resolution with Crowd Errors Vasilis Verroios Stanford University verroios@stanford.edu Hector Garcia-Molina Stanford University hector@cs.stanford.edu ABSTRACT Given a set of records, an ER algorithm

More information

WSN Signal Online Blind Extracting Algorithm Based on UKF

WSN Signal Online Blind Extracting Algorithm Based on UKF WSN Signal Online Blind Extracting Algorithm Based on UKF Caixia GAO Changping QI Junyong LIU School of Information echnology and Media and Communications Hexi University Zhangye Gansu 734000 China School

More information

Product Selection Problem: Improve Market Share by Learning Consumer Behavior

Product Selection Problem: Improve Market Share by Learning Consumer Behavior Product Selection Problem: Improve Market Share by Learning Consumer Behavior SILEI XU and JOHN C. S. LUI, The Chinese University of Hong Kong 34 It is often crucial for manufacturers to decide what products

More information

Forecasting Wind Ramps

Forecasting Wind Ramps Forecasting Wind Ramps Erin Summers and Anand Subramanian Jan 5, 20 Introduction The recent increase in the number of wind power producers has necessitated changes in the methods power system operators

More information

Scheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time

Scheduling Coflows in Datacenter Networks: Improved Bound for Total Weighted Completion Time 1 1 2 Scheduling Coflows in Datacenter Networs: Improved Bound for Total Weighted Completion Time Mehrnoosh Shafiee and Javad Ghaderi Abstract Coflow is a recently proposed networing abstraction to capture

More information

For final project discussion every afternoon Mark and I will be available

For final project discussion every afternoon Mark and I will be available Worshop report 1. Daniels report is on website 2. Don t expect to write it based on listening to one project (we had 6 only 2 was sufficient quality) 3. I suggest writing it on one presentation. 4. Include

More information

Intuitionistic Fuzzy Estimation of the Ant Methodology

Intuitionistic Fuzzy Estimation of the Ant Methodology BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volume 9, No 2 Sofia 2009 Intuitionistic Fuzzy Estimation of the Ant Methodology S Fidanova, P Marinov Institute of Parallel Processing,

More information

Machine Learning Final: Learning The Structures and Predicting Behavoir of Potential Function Based Multi-Agent Formations

Machine Learning Final: Learning The Structures and Predicting Behavoir of Potential Function Based Multi-Agent Formations Machine Learning Final: Learning The Structures and Predicting Behavoir of Potential Function Based Multi-Agent Formations Doug Beck Aeronautics and Astronautics Stanford Univeristy Chun-Yeon Lin Mechanical

More information

Time Series Data Cleaning

Time Series Data Cleaning Time Series Data Cleaning Shaoxu Song http://ise.thss.tsinghua.edu.cn/sxsong/ Dirty Time Series Data Unreliable Readings Sensor monitoring GPS trajectory J. Freire, A. Bessa, F. Chirigati, H. T. Vo, K.

More information

Optimal Common-Centroid-Based Unit Capacitor Placements for Yield Enhancement of Switched-Capacitor Circuits

Optimal Common-Centroid-Based Unit Capacitor Placements for Yield Enhancement of Switched-Capacitor Circuits Optimal Common-Centroid-Based Unit Capacitor Placements for Yield Enhancement of Switched-Capacitor Circuits CHIEN-CHIH HUANG, National Central University CHIN-LONG WEY, National Chiao Tung University

More information

Determining Appropriate Precisions for Signals in Fixed-Point IIR Filters

Determining Appropriate Precisions for Signals in Fixed-Point IIR Filters 38.3 Determining Appropriate Precisions for Signals in Fixed-Point IIR Filters Joan Carletta Akron, OH 4435-3904 + 330 97-5993 Robert Veillette Akron, OH 4435-3904 + 330 97-5403 Frederick Krach Akron,

More information

The 2-valued case of makespan minimization with assignment constraints

The 2-valued case of makespan minimization with assignment constraints The 2-valued case of maespan minimization with assignment constraints Stavros G. Kolliopoulos Yannis Moysoglou Abstract We consider the following special case of minimizing maespan. A set of jobs J and

More information

CS246 Final Exam. March 16, :30AM - 11:30AM

CS246 Final Exam. March 16, :30AM - 11:30AM CS246 Final Exam March 16, 2016 8:30AM - 11:30AM Name : SUID : I acknowledge and accept the Stanford Honor Code. I have neither given nor received unpermitted help on this examination. (signed) Directions

More information

Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks

Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks VANET Analysis Integrity-Oriented Content Transmission in Highway Vehicular Ad Hoc Networks Tom Hao Luan, Xuemin (Sherman) Shen, and Fan Bai BBCR, ECE, University of Waterloo, Waterloo, Ontario, N2L 3G1,

More information

An Uplink-Downlink Duality for Cloud Radio Access Network

An Uplink-Downlink Duality for Cloud Radio Access Network An Uplin-Downlin Duality for Cloud Radio Access Networ Liang Liu, Prati Patil, and Wei Yu Department of Electrical and Computer Engineering University of Toronto, Toronto, ON, 5S 3G4, Canada Emails: lianguotliu@utorontoca,

More information

Quantitative Analysis of the VANET Connectivity: Theory and Application

Quantitative Analysis of the VANET Connectivity: Theory and Application Quantitative Analysis of the VANET Connectivity: Theory and Application Xin Jin, Weijie Su, YAN Wei School of EECS, School of Mathematical Sciences, Peking University E-mail: {jinxin, yanwei@net.pku.edu.cn},

More information

Integer Least Squares: Sphere Decoding and the LLL Algorithm

Integer Least Squares: Sphere Decoding and the LLL Algorithm Integer Least Squares: Sphere Decoding and the LLL Algorithm Sanzheng Qiao Department of Computing and Software McMaster University 28 Main St. West Hamilton Ontario L8S 4L7 Canada. ABSTRACT This paper

More information

Greedy Online Algorithms for Routing Permanent Virtual Circuits

Greedy Online Algorithms for Routing Permanent Virtual Circuits Greedy Online Algorithms for Routing Permanent Virtual Circuits Jessen T. Havill, 1 Weizhen Mao 2 1 Department of Mathematics and Computer Science, Denison University, Granville, Ohio 43023 2 Department

More information

Efficiency Optimization of a Multi-Pump Booster System

Efficiency Optimization of a Multi-Pump Booster System Efficiency Optimization of a Multi-Pump Booster System Gerulf K.M. Pedersen Department of Cognitive Psychology University of Würzburg Würzburg, Germany gerulf@psychologie.uni-wuerzburg.de Zhenyu Yang Esbjerg

More information

An improved approximation algorithm for the stable marriage problem with one-sided ties

An improved approximation algorithm for the stable marriage problem with one-sided ties Noname manuscript No. (will be inserted by the editor) An improved approximation algorithm for the stable marriage problem with one-sided ties Chien-Chung Huang Telikepalli Kavitha Received: date / Accepted:

More information

Optimizing Roadside Advertisement Dissemination in Vehicular CPS

Optimizing Roadside Advertisement Dissemination in Vehicular CPS Optimizing Roadside Advertisement Dissemination in Vehicular CPS Huanyang Zheng and Jie Wu Computer and Information Sciences Temple University 1. Introduction Roadside Advertisement Dissemination Passengers,

More information

VISUAL EXPLORATION OF SPATIAL-TEMPORAL TRAFFIC CONGESTION PATTERNS USING FLOATING CAR DATA. Candra Kartika 2015

VISUAL EXPLORATION OF SPATIAL-TEMPORAL TRAFFIC CONGESTION PATTERNS USING FLOATING CAR DATA. Candra Kartika 2015 VISUAL EXPLORATION OF SPATIAL-TEMPORAL TRAFFIC CONGESTION PATTERNS USING FLOATING CAR DATA Candra Kartika 2015 OVERVIEW Motivation Background and State of The Art Test data Visualization methods Result

More information

SEM for Categorical Outcomes

SEM for Categorical Outcomes This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike License. Your use of this material constitutes acceptance of that license and the conditions of use of materials on this

More information

Sound Recognition in Mixtures

Sound Recognition in Mixtures Sound Recognition in Mixtures Juhan Nam, Gautham J. Mysore 2, and Paris Smaragdis 2,3 Center for Computer Research in Music and Acoustics, Stanford University, 2 Advanced Technology Labs, Adobe Systems

More information

An artificial neural networks (ANNs) model is a functional abstraction of the

An artificial neural networks (ANNs) model is a functional abstraction of the CHAPER 3 3. Introduction An artificial neural networs (ANNs) model is a functional abstraction of the biological neural structures of the central nervous system. hey are composed of many simple and highly

More information

Extracting mobility behavior from cell phone data DATA SIM Summer School 2013

Extracting mobility behavior from cell phone data DATA SIM Summer School 2013 Extracting mobility behavior from cell phone data DATA SIM Summer School 2013 PETER WIDHALM Mobility Department Dynamic Transportation Systems T +43(0) 50550-6655 F +43(0) 50550-6439 peter.widhalm@ait.ac.at

More information

Bidirectional Representation and Backpropagation Learning

Bidirectional Representation and Backpropagation Learning Int'l Conf on Advances in Big Data Analytics ABDA'6 3 Bidirectional Representation and Bacpropagation Learning Olaoluwa Adigun and Bart Koso Department of Electrical Engineering Signal and Image Processing

More information

Multiclass Classification-1

Multiclass Classification-1 CS 446 Machine Learning Fall 2016 Oct 27, 2016 Multiclass Classification Professor: Dan Roth Scribe: C. Cheng Overview Binary to multiclass Multiclass SVM Constraint classification 1 Introduction Multiclass

More information

Characterizing Social Response to Urban Earthquakes using Cell-Phone Network Data: The 2012 Oaxaca Earthquake

Characterizing Social Response to Urban Earthquakes using Cell-Phone Network Data: The 2012 Oaxaca Earthquake Benyounes Moumni EPFL Lausanne, Switzerland benyounes.moumni@epfl.ch Enrique Frias-Martinez Telefonica Research, Madrid, Spain efm@tid.es Characterizing Social Response to Urban Earthquakes using Cell-Phone

More information

Method for Optimizing the Number and Precision of Interval-Valued Parameters in a Multi-Object System

Method for Optimizing the Number and Precision of Interval-Valued Parameters in a Multi-Object System Method for Optimizing the Number and Precision of Interval-Valued Parameters in a Multi-Object System AMAURY CABALLERO*, KANG YEN*, *, JOSE L. ABREU**, ALDO PARDO*** *Department of Electrical & Computer

More information

ecompass eco-friendly urban Multi-modal route PlAnning Services for mobile users ecompass TR 045 Checking the Stationarity of the Datasets

ecompass eco-friendly urban Multi-modal route PlAnning Services for mobile users ecompass TR 045 Checking the Stationarity of the Datasets Project Number 288094 ecompass eco-friendly urban Multi-modal route PlAnning Services for mobile users STREP Funded by EC, INFSO-G4(ICT for Transport) under FP7 ecompass TR 045 Checking the Stationarity

More information

Clustering by Mixture Models. General background on clustering Example method: k-means Mixture model based clustering Model estimation

Clustering by Mixture Models. General background on clustering Example method: k-means Mixture model based clustering Model estimation Clustering by Mixture Models General bacground on clustering Example method: -means Mixture model based clustering Model estimation 1 Clustering A basic tool in data mining/pattern recognition: Divide

More information

Optimization Problems

Optimization Problems Optimization Problems The goal in an optimization problem is to find the point at which the minimum (or maximum) of a real, scalar function f occurs and, usually, to find the value of the function at that

More information

Fractal Dimension and Vector Quantization

Fractal Dimension and Vector Quantization Fractal Dimension and Vector Quantization [Extended Abstract] Krishna Kumaraswamy Center for Automated Learning and Discovery, Carnegie Mellon University skkumar@cs.cmu.edu Vasileios Megalooikonomou Department

More information

Reducing Delay Uncertainty in Deeply Scaled Integrated Circuits Using Interdependent Timing Constraints

Reducing Delay Uncertainty in Deeply Scaled Integrated Circuits Using Interdependent Timing Constraints Reducing Delay Uncertainty in Deeply Scaled Integrated Circuits Using Interdependent Timing Constraints Emre Salman and Eby G. Friedman Department of Electrical and Computer Engineering University of Rochester

More information

Mathematical Olympiad for Girls

Mathematical Olympiad for Girls UKMT UKMT UKMT United Kingdom Mathematics Trust Mathematical Olympiad for Girls Organised by the United Kingdom Mathematics Trust These are polished solutions and do not illustrate the process of failed

More information

Lecture: Modeling graphs with electrical networks

Lecture: Modeling graphs with electrical networks Stat260/CS294: Spectral Graph Methods Lecture 16-03/17/2015 Lecture: Modeling graphs with electrical networks Lecturer: Michael Mahoney Scribe: Michael Mahoney Warning: these notes are still very rough.

More information

Lecture 16: Introduction to Neural Networks

Lecture 16: Introduction to Neural Networks Lecture 16: Introduction to Neural Networs Instructor: Aditya Bhasara Scribe: Philippe David CS 5966/6966: Theory of Machine Learning March 20 th, 2017 Abstract In this lecture, we consider Bacpropagation,

More information

A Unified Framework for Representing Logic Program Updates

A Unified Framework for Representing Logic Program Updates A Unified Framework for Representing Logic Program Updates Yan Zhang School of Computing & Information Technology University of Western Sydney NSW 1797 Australia E-mail: yan@cit.uws.edu.au Norman Foo School

More information

AUTOMATED TEMPLATE MATCHING METHOD FOR NMIS AT THE Y-12 NATIONAL SECURITY COMPLEX

AUTOMATED TEMPLATE MATCHING METHOD FOR NMIS AT THE Y-12 NATIONAL SECURITY COMPLEX AUTOMATED TEMPLATE MATCHING METHOD FOR NMIS AT THE Y-1 NATIONAL SECURITY COMPLEX J. A. Mullens, J. K. Mattingly, L. G. Chiang, R. B. Oberer, J. T. Mihalczo ABSTRACT This paper describes a template matching

More information

A Reservoir Sampling Algorithm with Adaptive Estimation of Conditional Expectation

A Reservoir Sampling Algorithm with Adaptive Estimation of Conditional Expectation A Reservoir Sampling Algorithm with Adaptive Estimation of Conditional Expectation Vu Malbasa and Slobodan Vucetic Abstract Resource-constrained data mining introduces many constraints when learning from

More information

Evaluation and Analysis of Similarity Measures for. Content-based Visual Information Retrieval

Evaluation and Analysis of Similarity Measures for. Content-based Visual Information Retrieval Evaluation and Analysis of Similarity Measures for Content-based Visual Information Retrieval HORST EIDENBERGER Vienna University of Technology, Institute of Software Technology and Interactive Systems,

More information

The Relative Worst Order Ratio for On-Line Algorithms

The Relative Worst Order Ratio for On-Line Algorithms The Relative Worst Order Ratio for On-Line Algorithms JOAN BOYAR and LENE M. FAVRHOLDT We define a new measure for the quality of on-line algorithms, the relative worst order ratio, using ideas from the

More information

Statistical Data Analysis Stat 3: p-values, parameter estimation

Statistical Data Analysis Stat 3: p-values, parameter estimation Statistical Data Analysis Stat 3: p-values, parameter estimation London Postgraduate Lectures on Particle Physics; University of London MSci course PH4515 Glen Cowan Physics Department Royal Holloway,

More information

A collision theory of seismic waves applied to elastic VSP data

A collision theory of seismic waves applied to elastic VSP data A collision theory of seismic waves applied to elastic V data A collision theory of seismic waves applied to elastic V data Kris Innanen and Kevin Hall ABTRACT In previous CREWE reports we have been assembling

More information

SIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM. Neal Patwari and Alfred O.

SIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM. Neal Patwari and Alfred O. SIGNAL STRENGTH LOCALIZATION BOUNDS IN AD HOC & SENSOR NETWORKS WHEN TRANSMIT POWERS ARE RANDOM Neal Patwari and Alfred O. Hero III Department of Electrical Engineering & Computer Science University of

More information

Mobility Analytics through Social and Personal Data. Pierre Senellart

Mobility Analytics through Social and Personal Data. Pierre Senellart Mobility Analytics through Social and Personal Data Pierre Senellart Session: Big Data & Transport Business Convention on Big Data Université Paris-Saclay, 25 novembre 2015 Analyzing Transportation and

More information

TRAFFIC FLOW MODELING AND FORECASTING THROUGH VECTOR AUTOREGRESSIVE AND DYNAMIC SPACE TIME MODELS

TRAFFIC FLOW MODELING AND FORECASTING THROUGH VECTOR AUTOREGRESSIVE AND DYNAMIC SPACE TIME MODELS TRAFFIC FLOW MODELING AND FORECASTING THROUGH VECTOR AUTOREGRESSIVE AND DYNAMIC SPACE TIME MODELS Kamarianakis Ioannis*, Prastacos Poulicos Foundation for Research and Technology, Institute of Applied

More information

12.4 Known Channel (Water-Filling Solution)

12.4 Known Channel (Water-Filling Solution) ECEn 665: Antennas and Propagation for Wireless Communications 54 2.4 Known Channel (Water-Filling Solution) The channel scenarios we have looed at above represent special cases for which the capacity

More information

Minimum Repair Bandwidth for Exact Regeneration in Distributed Storage

Minimum Repair Bandwidth for Exact Regeneration in Distributed Storage 1 Minimum Repair andwidth for Exact Regeneration in Distributed Storage Vivec R Cadambe, Syed A Jafar, Hamed Malei Electrical Engineering and Computer Science University of California Irvine, Irvine, California,

More information

Computational Connections Between Robust Multivariate Analysis and Clustering

Computational Connections Between Robust Multivariate Analysis and Clustering 1 Computational Connections Between Robust Multivariate Analysis and Clustering David M. Rocke 1 and David L. Woodruff 2 1 Department of Applied Science, University of California at Davis, Davis, CA 95616,

More information

STA 414/2104, Spring 2014, Practice Problem Set #1

STA 414/2104, Spring 2014, Practice Problem Set #1 STA 44/4, Spring 4, Practice Problem Set # Note: these problems are not for credit, and not to be handed in Question : Consider a classification problem in which there are two real-valued inputs, and,

More information

Finding Robust Solutions to Dynamic Optimization Problems

Finding Robust Solutions to Dynamic Optimization Problems Finding Robust Solutions to Dynamic Optimization Problems Haobo Fu 1, Bernhard Sendhoff, Ke Tang 3, and Xin Yao 1 1 CERCIA, School of Computer Science, University of Birmingham, UK Honda Research Institute

More information

Potential Function Explain of the Quick Algorithm of Synergetic Neural Network

Potential Function Explain of the Quick Algorithm of Synergetic Neural Network Computer Science Technical Reports Computer Science 00 Potential Function Explain of the Quic Algorithm of Synergetic Neural Networ Jie Bao Iowa State University Follow this and additional wors at: http://lib.dr.iastate.edu/cs_techreports

More information

An Novel Continuation Power Flow Method Based on Line Voltage Stability Index

An Novel Continuation Power Flow Method Based on Line Voltage Stability Index IOP Conference Series: Earth and Environmental Science PAPER OPEN ACCESS An Novel Continuation Power Flow Method Based on Line Voltage Stability Index To cite this article: Jianfang Zhou et al 2018 IOP

More information

Supplemental Material : A Unified Framework for Multi-Target Tracking and Collective Activity Recognition

Supplemental Material : A Unified Framework for Multi-Target Tracking and Collective Activity Recognition Supplemental Material : A Unified Framewor for Multi-Target Tracing and Collective Activity Recognition Wongun Choi and Silvio Savarese Electrical and Computer Engineering University of Michigan Ann Arbor

More information

Map Matching Algorithms in GPS Navigating System and Their Functions

Map Matching Algorithms in GPS Navigating System and Their Functions Map Matching Algorithms in GPS Navigating System and Their Functions Abstract R.Kamalambal (M.Phil. Student) Department of computer science & Technology Kajamalai Campus, Bharathidasan University, Trichy,

More information

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation

Statistics 612: L p spaces, metrics on spaces of probabilites, and connections to estimation Statistics 62: L p spaces, metrics on spaces of probabilites, and connections to estimation Moulinath Banerjee December 6, 2006 L p spaces and Hilbert spaces We first formally define L p spaces. Consider

More information

Iterative Laplacian Score for Feature Selection

Iterative Laplacian Score for Feature Selection Iterative Laplacian Score for Feature Selection Linling Zhu, Linsong Miao, and Daoqiang Zhang College of Computer Science and echnology, Nanjing University of Aeronautics and Astronautics, Nanjing 2006,

More information

Large-Margin Thresholded Ensembles for Ordinal Regression

Large-Margin Thresholded Ensembles for Ordinal Regression Large-Margin Thresholded Ensembles for Ordinal Regression Hsuan-Tien Lin and Ling Li Learning Systems Group, California Institute of Technology, U.S.A. Conf. on Algorithmic Learning Theory, October 9,

More information