Time-of-Arrival Estimation in Non-Line-Of-Sight Environments

Size: px
Start display at page:

Download "Time-of-Arrival Estimation in Non-Line-Of-Sight Environments"

Transcription

1 2 Conference on Information Sciences an Systems, The Johns Hopkins University, March 2, 2 Time-of-Arrival Estimation in Non-Line-Of-Sight Environments Sinan Gezici, Hisashi Kobayashi an H. Vincent Poor Department of Electrical Engineering Princeton University Princeton, NJ 8 {sgezici,hisashi,poor}@princeton.eu Serar Yüksel an Tamer Başar 2 Coorinate Science Laboratory University of Illinois at Urbana-Champaign 8 West Main Street, Urbana, IL {yuksel,tbasar}@ecision.csl.uiuc.eu Abstract A new estimator is propose to extract the true istance between a mobile an a base station from a set of time-of-arrival (TOA) ata, corrupte by unknown non-line-of-sight (NLOS) errors an Gaussian measurement noise. Characteristics of the estimator are iscusse for a class of NLOS errors with variance consierably greater than that of the measurement noise, which is usually the case in practice. A quantization approach is use to estimate the probability ensity function of the observe TOA measurements an the TOA estimator is compute from this ensity estimate. Keywors: Wireless location, NLOS error, parameter estimation, quantization. I. Introuction In the stuy of mobile positioning in wireless communication systems, accurate location estimation of a mobile station has proven to be an important problem. Multipath, non-lineof-sight (NLOS) propagation an multiple access interference are often the main sources of errors in geolocation, an make mobile positioning challenging. Among these error sources, NLOS is usually consiere to be the most crucial one an several practical algorithms to reuce the effects of this error have been propose in the literature. In [2] a hypothesis testing approach is use to etermine NLOS base stations an then the line-if-sight (LOS) reconstruction is achieve using the history of the measurements base on the hypothesis testing results. In [] statistics of the measurement noise are use to estimate the istances between the mobile an the base stations. However, the assumption mae that measurements lower than the true istance are ue to the measurement noise only may not hol in general. In [] an algorithm is use to mitigate the NLOS errors when no prior information is available assuming that there are more than three base stations for geolocation purpose. In this paper, a time of arrival (TOA) estimator is propose for a class of NLOS error statistics. It is shown that when the NLOS error has a much larger variance than the Gaussian measurement error, which is usually the case [], an when its probability ensity function (pf) is approximately constant aroun the origin, then the first erivative of the pf of the measurements has a peak near the true TOA. This observation is the key to the estimator propose in this paper. The remainer of this paper is organize as follows. Section II escribes the estimator an iscusses its properties. Use of This research is supporte in part by the U.S. National Science Founation uner grant CCR-99-79, an in part by the New Jersey Center for Wireless Telecommunications. 2 This research is supporte in part by the U.S. National Science Founation uner grants CCR--897 an ECS the estimator in a geolocation problem is aresse in Section III, followe by simulation results in Section IV. Finally, Section V presents some concluing remarks. II. Time of arrival estimation The estimator we propose is base on the estimation of the pf of the observe set of TOA measurements, which are the outcomes of a ranom process with the following characteristics: Y + E + N () where is the LOS elay to be estimate, N is the measurement error, which is moelle as a Gaussian ranom variable with zero mean an known variance σ 2, an E is the NLOS incurre elay taking a value between an some value L, possibly infinite. Define Z + E. Note that the pf of Z will be zero for Z, an the pf of the observation Y will be the convolution of the pf of Z an the pf of the Gaussian noise, N. Depening on the properties of the pf of E, we can make the following property. Property 2. If the ensity of the NLOS error E is uniform with a variance much larger than the variance of the Gaussian noise, then the probability ensity of Y has its secon erivative equal to zero (sale point) at almost the true timeof-arrival,. Furthermore, the assertion remains vali for a non-uniform NLOS error with boune pf, that is, f E (x) B for all x, if the pf of the NLOS error R is almost constant between an α, where α < L satisfies α ( x2 /σ 2 )e x 2 2σ 2 x /B an is consierably larger than the stanar eviation of the Gaussian measurement noise, σ. An argument supporting this property is as follows. Since Z + E, the pf of Y at a point t is f Y (t) Z +L f Z (τ)f N (t τ)τ, (2) where f Z is the pf of Z an f N is the ensity associate with the Gaussian noise. Taking the erivative with respect to t, we have f Y (t) t Z +L f Z (τ) fn (t τ) τ. () t Setting the secon erivative to zero to fin the point that achieves the maximum increment in the ensity of Y, we obtain Since 2 f Y (t) t 2 Z +L 2 f N (t τ) t 2 f Z(τ) 2 f N (t τ) t 2 τ. () (t τ)2 e (t τ)2 σ 2 2σ 2, ()

2 f W (x)/x x x Figure : First erivative of the sum of the NLOS error an the Gaussian error for L m an σ 2 2m. f 2 W (x)/x x x Figure 2: Secon erivative of the sum of the NLOS error an the Gaussian error for L m an σ 2 2m. equation () leas to Z +L Z +L f Z(τ) σ 2 e (t τ)2 2σ 2 τ f Z(τ) (t τ) 2 e (t τ)2 2σ 2 τ. () If the NLOS error E has a uniform istribution, the associate pf can be taken out of the integral an cancelle. Furthermore, if the Gaussian noise has almost all of its power between L an L, then at t the left han sie is equal to σ2 which 2 is equal to the right-han sie. Thus, for sufficiently large L, the secon erivative of the pf of the observe ranom variable is approximately zero at true TOA,. This point is the first (an only, if the NLOS is uniform) positive peak of the first erivative of the observe pf. The fact that the secon erivative is close zero at means that the true TOA is close to the sale point since the secon erivative of the pf of the measurements changes consierably aroun that point (see Figure 2 where ), which can be seen from the non-negligible negativity of the thir erivative at t : f Y (t) t Z +L (τ ) f Z (τ) (τ )2 σ 2 e (τ )2 2σ 2 τ. If the NLOS istribution is not uniform, then the arguments above will not hol in general, especially when the measurement noise variance is comparable to the NLOS error variance. However, in practice, as is argue in [] an [2], the measurement noise variance is usually much smaller than the NLOS error variance, an the pf of the NLOS error can be regare as practically constant for an interval comparable to σ an the above result still hols approximately as shown below. After a change of variables an using f E(x) f Z(x + ), the expression () at t can be expresse as Z L f E(x) ( x2 /σ 2 )e x2 2σ 2 x. (7) If we consier the integrals from to α an α to L separately, we have approximately + f E () Z L α Z α ( x2 /σ 2 )e x2 2σ 2 x f E (x) ( x2 /σ 2 )e x2 2σ 2 x. (8) Due to the conitions in the proposition, the first term in (8) is approximately zero. Also since L is very large compare to σ, R L ( x 2 /σ 2 )e x2 2σ 2 x is approximately R L zero. Therefore, ( α x2 /σ 2 )e x 2 2σ 2 x /B as well. Hence, the secon term is also approximately zero. Therefore, when the pf of the NLOS error is almost constant aroun the origin an has much larger variance than the measurement noise variance, the true TOA will be very close to the point where the secon erivative is zero, an might be assume to be equal to that sale point without much loss of performance. As a worst limiting case, where the assumption regaring the relationship between the variances completely fails, the NLOS error ensity is impulsive aroun the origin, meaning that there are only LOS observations. In this case the secon erivative will be zero at the point σ. Thus, in the worst case for a ecreasing ensity of NLOS, the error in the estimation will be σ. Actually, in this case, not the secon erivative but the first erivative being equal to zero characterizes the true TOA. However, it is usually possible to istinguish LOS measurements from the NLOS measurements by some ecision criterion []. Hence the LOS case can be consiere separately. The estimator is characterize by the pf of the observe ranom variable as follows: A pf estimation algorithm is employe, for which a histogram approach is use, which correspons to interpreting the observe ata as the input to a uniform quantizer with a specifie bin size. The number of observations per quantization bin is use to compute the probability mass function (pmf) of the ata. The smaller bin ege value corresponing to the quantizer bin having the first local peak in the ifference between the current bin an the preceing bin is the estimator output. Note that the choice of the bin size of the quantizer is an important parameter. The estimator can be formulate as follows. Given m inepenent ientically istribute (ii) measurements Y,..., Y m,

3 we quantize these measurements into N b bins. Assume that the ith bin extens from (i )l b to il b where l b is the bin size. Let S,..., S NB enote the number of samples in the bins an D i S i S i the ifference in the number of samples between ajacent bins. Then, the inex of the bin incluing the true TOA is estimate as ˆb arg min i {D i D i > an D i+ D i }, (9) an (i )l b gives the TOA estimation. Note that it is not the reconstruction value but the bin ege that gives the true TOA estimation, since the bin ege characterizes the increment better. With this efinition of the estimator, we have the following property: Property 2.2 Assume that the NLOS error is uniformly istribute with support much larger than the Gaussian measurement error stanar eviation. Then, as the number of samples goes to infinity, the error of the estimator is almost surely confine to the interval [-. l b,. l b ] for small values of l b. Let m enote the number of samples. As m, S i/m p i almost surely, where p i Z ilb (i )l b f Y (y)y, () with Y given by (). Thus, (D i D i )/m p i 2p i +p i 2 almost surely. Let the kth bin contain the true TOA. From the above analysis of the pf of the measurements, we know that the pf increases until some point with increasing first erivative an after almost the true TOA it continues to increase with a ecreasing first erivative. In other wors, the pf of the measurements is strictly convex before the true TOA an strictly concave after that for some time. Consier D k+ D k. For large m, we have (D k+ D k )/m p k+ + p k 2p k Z (k+)lb Z (k )lb Z klb When the support of the uniform error is much larger than the stanar eviation of the Gaussian measurement error an the bin size is sufficiently small, the value of the integral (2) is approximately zero for l b /2. From the convextiy/concavity of the pf aroun the origin, we also have for < l b /2, D k+ D k < R an for > l b /2, D k+ D k >. (k i)l Since D i D i b [f (k i+)l W (y + l) + f W (y l) b 2f W (y)]y, the convexity of f W (.) to the left of the origin an concavity of it to the right of the origin to some extent together with the previous result implies that D i D i > for i k, k,... an D i D i < for i k + 2, k +,... Therefore, the only bins that can satisfy the conitions of the estimator (9) are the kth or the (k + )st bins: For < l b /2, the kth bin an for > l b /2, the (k + )st bin satisfies the conitions of the estimator. Therefore, for < l b /2, the TOA estimate is (k )l b an for > l b /2, it is kl b. Since (k )l b +, the error is between.l b an.l b. Note that for pf s satisfying the alternative conitions state in Property 2., Property 2.2 is still approximately true. The histogram can be interprete as the quantization of the erivative of the pf of the measurements. In this case, the increments can approximately be represente by f Y ((i )l b ) lb 2 p i p i for small bin sizes. Thus the erivative is represente by rectangular bins, an the bin ege of the quantizer can be regare as the representative sample for the erivative. The erivative of the ensity function of the total error with a uniform NLOS noise is epicte in Figure. As is seen, the erivative function goes to zero after the peak, an then has a negative peak. This figure can be use to introuce a boun on the bin size for the estimator. The estimator will compare the competing erivatives for the peak an output the peak as the estimate bin. The bins aroun the upper part of the quantizer will be the caniates for the maximum value, an if those bins o not interfere with the lower portion (negative values) of the erivative curve, the estimation outcome will be at most half the quantizer bin size away from the true TOA (which is in the figure). Assuming symmetry in the upper part of the curve with respective to the peak of the erivative, the bin sizes less than the ifference between the peak an the point where the erivative crosses zero, will cause a istortion not greater than l b 2, whereas larger bin sizes may result in interference with the values in the negative portion an cause an error. The ifference between the sale point (peak of the erivative) of the ensity of the observation an the maximum point (where the erivative is zero) is on the orer of a few stanar eviations of the noise. Thus the quantizer bin size shoul be upper boune by a few σ s. f Y (y)y + f Y (y)y 2 f Y (y)y kl b (k 2)l b (k )l b III. Mobile Location Z klb Location of a mobile in a wireless communications system [f Y (y + l b ) + f Y (y l b ) 2f Y (y)]y. () can be etermine from TOA measurements from a number of (k )l b base stations (BSs). Traitionally, the location of the mobile Since the true TOA is in the kth bin, we can express as is estimate by a least squares (LS) estimator [], which is (k )l b + where l b. Defining W N + E as the optimal estimator when the mobile is LOS to all the BS s. the sum of the NLOS an measurement errors an using the When the NLOS error is not known, this approach is still fact that f W (x) f Y (x + ), the last integral can be written employe an the NLOS observations are given less weight in as: orer to mitigate the effect of the NLOS error. Z lb If the locations of the mobile an the BS s are enote [f W (y + l b ) + f W (y l b ) 2f W (y)]y. (2) by p m an p,..., p b respectively with b being the number of BS s, the location estimate is given by the p that minimizes bx i w i ( p p i vy i ) 2, () where. enotes L2-norm, v is the spee of light, Y i is the TOA measurement from the ith BS an w i is the weight that reflects the reliability of the measurement from the ith BS, which might be consiere to be inversely proportional to the variance of the measurements. In NLOS situations, even though the NLOS BS is given smaller weight, the error will still be significant unless there

4 . m m m2 m 7. Our Algorithm RRE Algorithm Bin Size (m) Number of Samples Figure : Mean Absolute Error versus bin size for ifferent sample sizes for the uniform NLOS error, [, m], an Gaussian measurement error with variance 2m 2. Figure : Mean Absolute Error for ifferent algorithms for the uniform NLOS error, [, m], an Gaussian measurement error with variance 2m 2. are at least three LOS BS s (for two-imensional location). Therefore, we suggest employing our TOA estimation technique for the NLOS BS s before using the LS estimator. We assume that the NLOS BS s can be etermine from the measurements using a variance test []. Consier a series of TOA measurements from a NLOS BS. To apply the TOA estimation technique, consier a winow aroun the specific TOA measurement an take those measurements as input to the estimator. Note that the samples shoul be sufficiently space in time so that they are inepenent. Then, for NLOS BS s Y i in equation () is replace by the result of the TOA estimation an the final location is estimate by the LS scheme. IV. Simulation Results Consier the moel in () where the Gaussian measurement error has variance σ 2 an the NLOS error is uniform between an L. Assume that m ii TOA measurements are taken accoring to this moel an the location of the mobile oes not change consierably uring these measurements. This assumption means that the NLOS error is assume to be inepenent from sampling instant to sampling instant, which is ue to the ynamic environment an/or the movement of the mobile, but the mobile s location can be consiere to be constant for the purposes of TOA estimation. These two seemingly inconsistent assumptions can be reconcile since the NLOS error variations are small-scale variations while the mobile s location is a large-scale property. For the simulations, the observe TOA ata have been converte to istance measurements for convenience. The variance of the Gaussian measurement error is taken to be 2 m 2. In Figure, the NLOS error is taken to be uniformly istribute between an m an the mean absolute error (MAE) is calculate for ifferent bin sizes, l b. For each bin size, 2, trials were performe with the true istance uniformly istribute between some range so that the probability that the true istance is at any location in a bin is always uniformly istribute. From the figure, it is seen that there is an optimal bin size for each sample size, m. For small bin sizes, number of samples may not be sufficient to represent the erivative value correctly resulting in higher errors. For large bin sizes, even though the correct bin can be chosen, the estimation value may not be very close to the true istance ue to the large size of the bin. Also note that when the sample size increases, the optimal value of bin size ecreases. Figure compares the performance of the estimator to the Robust Range Estimation (RRE) algorithm []. The error of the RRE algorithm is higher than the error of our estimator since the assumption use in the RRE algorithm, namely that the measurements lower than the true istance comes from the Gaussian error assumption, may cause some small errors. However, that algorithm oes not require specific properties of the NLOS pf which are assume for our estimator. But in practical situations the conitions on the pf are not so tight an are satisfie by most NLOS error istributions. In Figure, the NLOS error is taken to be exponentially istribute with mean 2 m an the mean absolute error (MAE) is calculate for ifferent bin sizes. For each bin size, 2, trials were performe with the probability that the true istance is at any location in a bin again uniformly istribute. From the figure, the same observations as the uniform NLOS error case can be mae. Also the algorithm clearly works for the exponential NLOS error as well since the variance of the NLOS error is consierably larger than the Gaussian measurement error variance. Figure compares the two estimators. Again the algorithm propose in this paper achieves lower error values. However, in this case, the results are closer since the NLOS pf is exponentially istribute an Proposition 2. applies since it has a large variance compare to the Gaussian error. Now consier the mobile tracking scenario shown in Figure 7, in which there are three BS a at (, ), (, ) an (, 29.8) an the mobile moves from (, 8) to (2, 8) on the soli line shown with a velocity of m/s. Twenty TOA measurements are taken per secon. The first BS is assume to be NLOS with an exponential NLOS error with mean 2 m, an the other BS s are assume to be LOS. The Gaussian measurement error variance is 2 m 2 for all measurements. 2 samples aroun a given sample are consiere for the TOA estimation for the NLOS BS an a bin size of 2 m is use for the quantization. Also the weights are taken to be inversely proportional to the variances of the measurements for the LS

5 Mean Absolute Error (m)... m m m2 m Bin Size (m) Figure : Mean Absolute Error versus bin size for ifferent sample sizes for the exponential NLOS error with mean 2m an Gaussian measurement error with variance 2m 2... Our Algorithm RRE Algorithm Number of Samples Figure : Mean Absolute Error for ifferent algorithms for the exponential NLOS error with mean 2m an Gaussian measurement error with variance 2m 2. estimator. From the figure it is seen that employing our TOA technique for the NLOS BS improves the location accuracy. The MAE for the traitional LS algorithm is. m whereas it is 2.9 m for the moifie scheme. V. Conclusion In this paper we have introuce a practical algorithm to estimate true TOA of a signal between a mobile an a base station in the presence of NLOS noise with unknown statistics an Gaussian noise with a variance consierably smaller than that of the NLOS error. It has been shown that uner reasonable conitions, TOA estimation can be performe by locating the first peak of the first erivative of the pf of the measurements. A histogram approach can then be employe to approximate the pf of the measurements an thus obtain this estimate. The simulations are performe to asses the performance of the estimator. Our simulations show the superiority of this approach to existing methos. References [] M. P. Wylie-Green an S. S. Wang, Robust range estimation in the presence of the non-line-of-sight error, Proc. IEEE th Vehicular Technology Conference, Fall 2 vol., Atlantic City, NJ, pp. -. [2] M. P. Wylie an J. Holtzman, The non-line of sight problem in mobile location estimation, Proc. th IEEE International Conference on Universal Personal Communications, 99, Cambrige, MA, pp [] P. C. Chen, A non-line-of-sight error mitigation algorithm in location estimation, Proc. IEEE Wireless Communications an Networking Conference, 999, vol., New Orleans, LA, pp. -2. [] J. Caffery, Jr. an G. Stuber, Subscriber location in CDMA cellular networks, IEEE Trans. Vehicular Technology, vol. 7, pp. -, May 998. [] J. Borras, P. Hatrack an N. B. Manayam, Decision theoretical framework for NLOS ientification, Proc. IEEE Vehicular Technology Conference, Spring 998 vol. 2, Ottawa, Canaa, pp BS 2 y (m) LS Moifie LS BS BS x (m) Figure 7: Mobile Tracking Scenario. Mobile moves from left to right with velocity m/s an 2 TOA measurements are taken per secon. Only BS is NLOS.

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k

Robust Forward Algorithms via PAC-Bayes and Laplace Distributions. ω Q. Pr (y(ω x) < 0) = Pr A k A Proof of Lemma 2 B Proof of Lemma 3 Proof: Since the support of LL istributions is R, two such istributions are equivalent absolutely continuous with respect to each other an the ivergence is well-efine

More information

Least-Squares Regression on Sparse Spaces

Least-Squares Regression on Sparse Spaces Least-Squares Regression on Sparse Spaces Yuri Grinberg, Mahi Milani Far, Joelle Pineau School of Computer Science McGill University Montreal, Canaa {ygrinb,mmilan1,jpineau}@cs.mcgill.ca 1 Introuction

More information

UWB Geolocation Techniques for IEEE a Personal Area Networks

UWB Geolocation Techniques for IEEE a Personal Area Networks MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com UWB Geolocation Techniques for IEEE 802.15.4a Personal Area Networks Sinan Gezici Zafer Sahinoglu TR-2004-110 August 2004 Abstract A UWB positioning

More information

A New Minimum Description Length

A New Minimum Description Length A New Minimum Description Length Soosan Beheshti, Munther A. Dahleh Laboratory for Information an Decision Systems Massachusetts Institute of Technology soosan@mit.eu,ahleh@lis.mit.eu Abstract The minimum

More information

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward

An Analytical Expression of the Probability of Error for Relaying with Decode-and-forward An Analytical Expression of the Probability of Error for Relaying with Decoe-an-forwar Alexanre Graell i Amat an Ingmar Lan Department of Electronics, Institut TELECOM-TELECOM Bretagne, Brest, France Email:

More information

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device

Closed and Open Loop Optimal Control of Buffer and Energy of a Wireless Device Close an Open Loop Optimal Control of Buffer an Energy of a Wireless Device V. S. Borkar School of Technology an Computer Science TIFR, umbai, Inia. borkar@tifr.res.in A. A. Kherani B. J. Prabhu INRIA

More information

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE

THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE Journal of Soun an Vibration (1996) 191(3), 397 414 THE VAN KAMPEN EXPANSION FOR LINKED DUFFING LINEAR OSCILLATORS EXCITED BY COLORED NOISE E. M. WEINSTEIN Galaxy Scientific Corporation, 2500 English Creek

More information

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson

JUST THE MATHS UNIT NUMBER DIFFERENTIATION 2 (Rates of change) A.J.Hobson JUST THE MATHS UNIT NUMBER 10.2 DIFFERENTIATION 2 (Rates of change) by A.J.Hobson 10.2.1 Introuction 10.2.2 Average rates of change 10.2.3 Instantaneous rates of change 10.2.4 Derivatives 10.2.5 Exercises

More information

Situation awareness of power system based on static voltage security region

Situation awareness of power system based on static voltage security region The 6th International Conference on Renewable Power Generation (RPG) 19 20 October 2017 Situation awareness of power system base on static voltage security region Fei Xiao, Zi-Qing Jiang, Qian Ai, Ran

More information

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013

Survey Sampling. 1 Design-based Inference. Kosuke Imai Department of Politics, Princeton University. February 19, 2013 Survey Sampling Kosuke Imai Department of Politics, Princeton University February 19, 2013 Survey sampling is one of the most commonly use ata collection methos for social scientists. We begin by escribing

More information

Non-Parametric Non-Line-of-Sight Identification 1

Non-Parametric Non-Line-of-Sight Identification 1 Non-Paraetric Non-Line-of-Sight Identification Sinan Gezici, Hisashi Kobayashi and H. Vincent Poor Departent of Electrical Engineering School of Engineering and Applied Science Princeton University, Princeton,

More information

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions

Computing Exact Confidence Coefficients of Simultaneous Confidence Intervals for Multinomial Proportions and their Functions Working Paper 2013:5 Department of Statistics Computing Exact Confience Coefficients of Simultaneous Confience Intervals for Multinomial Proportions an their Functions Shaobo Jin Working Paper 2013:5

More information

A Modification of the Jarque-Bera Test. for Normality

A Modification of the Jarque-Bera Test. for Normality Int. J. Contemp. Math. Sciences, Vol. 8, 01, no. 17, 84-85 HIKARI Lt, www.m-hikari.com http://x.oi.org/10.1988/ijcms.01.9106 A Moification of the Jarque-Bera Test for Normality Moawa El-Fallah Ab El-Salam

More information

Hyperbolic Systems of Equations Posed on Erroneous Curved Domains

Hyperbolic Systems of Equations Posed on Erroneous Curved Domains Hyperbolic Systems of Equations Pose on Erroneous Curve Domains Jan Norström a, Samira Nikkar b a Department of Mathematics, Computational Mathematics, Linköping University, SE-58 83 Linköping, Sween (

More information

Math 342 Partial Differential Equations «Viktor Grigoryan

Math 342 Partial Differential Equations «Viktor Grigoryan Math 342 Partial Differential Equations «Viktor Grigoryan 6 Wave equation: solution In this lecture we will solve the wave equation on the entire real line x R. This correspons to a string of infinite

More information

Logarithmic spurious regressions

Logarithmic spurious regressions Logarithmic spurious regressions Robert M. e Jong Michigan State University February 5, 22 Abstract Spurious regressions, i.e. regressions in which an integrate process is regresse on another integrate

More information

arxiv: v4 [math.pr] 27 Jul 2016

arxiv: v4 [math.pr] 27 Jul 2016 The Asymptotic Distribution of the Determinant of a Ranom Correlation Matrix arxiv:309768v4 mathpr] 7 Jul 06 AM Hanea a, & GF Nane b a Centre of xcellence for Biosecurity Risk Analysis, University of Melbourne,

More information

6 General properties of an autonomous system of two first order ODE

6 General properties of an autonomous system of two first order ODE 6 General properties of an autonomous system of two first orer ODE Here we embark on stuying the autonomous system of two first orer ifferential equations of the form ẋ 1 = f 1 (, x 2 ), ẋ 2 = f 2 (, x

More information

Nonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain

Nonlinear Adaptive Ship Course Tracking Control Based on Backstepping and Nussbaum Gain Nonlinear Aaptive Ship Course Tracking Control Base on Backstepping an Nussbaum Gain Jialu Du, Chen Guo Abstract A nonlinear aaptive controller combining aaptive Backstepping algorithm with Nussbaum gain

More information

Sensors & Transducers 2015 by IFSA Publishing, S. L.

Sensors & Transducers 2015 by IFSA Publishing, S. L. Sensors & Transucers, Vol. 184, Issue 1, January 15, pp. 53-59 Sensors & Transucers 15 by IFSA Publishing, S. L. http://www.sensorsportal.com Non-invasive an Locally Resolve Measurement of Soun Velocity

More information

Separation of Variables

Separation of Variables Physics 342 Lecture 1 Separation of Variables Lecture 1 Physics 342 Quantum Mechanics I Monay, January 25th, 2010 There are three basic mathematical tools we nee, an then we can begin working on the physical

More information

A General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication

A General Analytical Approximation to Impulse Response of 3-D Microfluidic Channels in Molecular Communication A General Analytical Approximation to Impulse Response of 3- Microfluiic Channels in Molecular Communication Fatih inç, Stuent Member, IEEE, Bayram Cevet Akeniz, Stuent Member, IEEE, Ali Emre Pusane, Member,

More information

One-dimensional I test and direction vector I test with array references by induction variable

One-dimensional I test and direction vector I test with array references by induction variable Int. J. High Performance Computing an Networking, Vol. 3, No. 4, 2005 219 One-imensional I test an irection vector I test with array references by inuction variable Minyi Guo School of Computer Science

More information

ELEC3114 Control Systems 1

ELEC3114 Control Systems 1 ELEC34 Control Systems Linear Systems - Moelling - Some Issues Session 2, 2007 Introuction Linear systems may be represente in a number of ifferent ways. Figure shows the relationship between various representations.

More information

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy,

NOTES ON EULER-BOOLE SUMMATION (1) f (l 1) (n) f (l 1) (m) + ( 1)k 1 k! B k (y) f (k) (y) dy, NOTES ON EULER-BOOLE SUMMATION JONATHAN M BORWEIN, NEIL J CALKIN, AND DANTE MANNA Abstract We stuy a connection between Euler-MacLaurin Summation an Boole Summation suggeste in an AMM note from 196, which

More information

Qubit channels that achieve capacity with two states

Qubit channels that achieve capacity with two states Qubit channels that achieve capacity with two states Dominic W. Berry Department of Physics, The University of Queenslan, Brisbane, Queenslan 4072, Australia Receive 22 December 2004; publishe 22 March

More information

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz

A note on asymptotic formulae for one-dimensional network flow problems Carlos F. Daganzo and Karen R. Smilowitz A note on asymptotic formulae for one-imensional network flow problems Carlos F. Daganzo an Karen R. Smilowitz (to appear in Annals of Operations Research) Abstract This note evelops asymptotic formulae

More information

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE

TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS. Yannick DEVILLE TEMPORAL AND TIME-FREQUENCY CORRELATION-BASED BLIND SOURCE SEPARATION METHODS Yannick DEVILLE Université Paul Sabatier Laboratoire Acoustique, Métrologie, Instrumentation Bât. 3RB2, 8 Route e Narbonne,

More information

Perturbation Analysis and Optimization of Stochastic Flow Networks

Perturbation Analysis and Optimization of Stochastic Flow Networks IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. XX, NO. Y, MMM 2004 1 Perturbation Analysis an Optimization of Stochastic Flow Networks Gang Sun, Christos G. Cassanras, Yorai Wari, Christos G. Panayiotou,

More information

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7.

1 dx. where is a large constant, i.e., 1, (7.6) and Px is of the order of unity. Indeed, if px is given by (7.5), the inequality (7. Lectures Nine an Ten The WKB Approximation The WKB metho is a powerful tool to obtain solutions for many physical problems It is generally applicable to problems of wave propagation in which the frequency

More information

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling

Balancing Expected and Worst-Case Utility in Contracting Models with Asymmetric Information and Pooling Balancing Expecte an Worst-Case Utility in Contracting Moels with Asymmetric Information an Pooling R.B.O. erkkamp & W. van en Heuvel & A.P.M. Wagelmans Econometric Institute Report EI2018-01 9th January

More information

arxiv: v1 [cs.it] 21 Aug 2017

arxiv: v1 [cs.it] 21 Aug 2017 Performance Gains of Optimal Antenna Deployment for Massive MIMO ystems Erem Koyuncu Department of Electrical an Computer Engineering, University of Illinois at Chicago arxiv:708.06400v [cs.it] 2 Aug 207

More information

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms

On Characterizing the Delay-Performance of Wireless Scheduling Algorithms On Characterizing the Delay-Performance of Wireless Scheuling Algorithms Xiaojun Lin Center for Wireless Systems an Applications School of Electrical an Computer Engineering, Purue University West Lafayette,

More information

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering,

Lyapunov Functions. V. J. Venkataramanan and Xiaojun Lin. Center for Wireless Systems and Applications. School of Electrical and Computer Engineering, On the Queue-Overflow Probability of Wireless Systems : A New Approach Combining Large Deviations with Lyapunov Functions V. J. Venkataramanan an Xiaojun Lin Center for Wireless Systems an Applications

More information

Lower Bounds for the Smoothed Number of Pareto optimal Solutions

Lower Bounds for the Smoothed Number of Pareto optimal Solutions Lower Bouns for the Smoothe Number of Pareto optimal Solutions Tobias Brunsch an Heiko Röglin Department of Computer Science, University of Bonn, Germany brunsch@cs.uni-bonn.e, heiko@roeglin.org Abstract.

More information

6. Friction and viscosity in gasses

6. Friction and viscosity in gasses IR2 6. Friction an viscosity in gasses 6.1 Introuction Similar to fluis, also for laminar flowing gases Newtons s friction law hols true (see experiment IR1). Using Newton s law the viscosity of air uner

More information

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation

Relative Entropy and Score Function: New Information Estimation Relationships through Arbitrary Additive Perturbation Relative Entropy an Score Function: New Information Estimation Relationships through Arbitrary Aitive Perturbation Dongning Guo Department of Electrical Engineering & Computer Science Northwestern University

More information

Quantum mechanical approaches to the virial

Quantum mechanical approaches to the virial Quantum mechanical approaches to the virial S.LeBohec Department of Physics an Astronomy, University of Utah, Salt Lae City, UT 84112, USA Date: June 30 th 2015 In this note, we approach the virial from

More information

KNN Particle Filters for Dynamic Hybrid Bayesian Networks

KNN Particle Filters for Dynamic Hybrid Bayesian Networks KNN Particle Filters for Dynamic Hybri Bayesian Networs H. D. Chen an K. C. Chang Dept. of Systems Engineering an Operations Research George Mason University MS 4A6, 4400 University Dr. Fairfax, VA 22030

More information

Jointly continuous distributions and the multivariate Normal

Jointly continuous distributions and the multivariate Normal Jointly continuous istributions an the multivariate Normal Márton alázs an álint Tóth October 3, 04 This little write-up is part of important founations of probability that were left out of the unit Probability

More information

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21

'HVLJQ &RQVLGHUDWLRQ LQ 0DWHULDO 6HOHFWLRQ 'HVLJQ 6HQVLWLYLW\,1752'8&7,21 Large amping in a structural material may be either esirable or unesirable, epening on the engineering application at han. For example, amping is a esirable property to the esigner concerne with limiting

More information

The total derivative. Chapter Lagrangian and Eulerian approaches

The total derivative. Chapter Lagrangian and Eulerian approaches Chapter 5 The total erivative 51 Lagrangian an Eulerian approaches The representation of a flui through scalar or vector fiels means that each physical quantity uner consieration is escribe as a function

More information

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes

Leaving Randomness to Nature: d-dimensional Product Codes through the lens of Generalized-LDPC codes Leaving Ranomness to Nature: -Dimensional Prouct Coes through the lens of Generalize-LDPC coes Tavor Baharav, Kannan Ramchanran Dept. of Electrical Engineering an Computer Sciences, U.C. Berkeley {tavorb,

More information

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction

FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS. 1. Introduction FLUCTUATIONS IN THE NUMBER OF POINTS ON SMOOTH PLANE CURVES OVER FINITE FIELDS ALINA BUCUR, CHANTAL DAVID, BROOKE FEIGON, MATILDE LALÍN 1 Introuction In this note, we stuy the fluctuations in the number

More information

TRACKING CONTROL OF MULTIPLE MOBILE ROBOTS: A CASE STUDY OF INTER-ROBOT COLLISION-FREE PROBLEM

TRACKING CONTROL OF MULTIPLE MOBILE ROBOTS: A CASE STUDY OF INTER-ROBOT COLLISION-FREE PROBLEM 265 Asian Journal of Control, Vol. 4, No. 3, pp. 265-273, September 22 TRACKING CONTROL OF MULTIPLE MOBILE ROBOTS: A CASE STUDY OF INTER-ROBOT COLLISION-FREE PROBLEM Jurachart Jongusuk an Tsutomu Mita

More information

Lecture 2: Correlated Topic Model

Lecture 2: Correlated Topic Model Probabilistic Moels for Unsupervise Learning Spring 203 Lecture 2: Correlate Topic Moel Inference for Correlate Topic Moel Yuan Yuan First of all, let us make some claims about the parameters an variables

More information

On combinatorial approaches to compressed sensing

On combinatorial approaches to compressed sensing On combinatorial approaches to compresse sensing Abolreza Abolhosseini Moghaam an Hayer Raha Department of Electrical an Computer Engineering, Michigan State University, East Lansing, MI, U.S. Emails:{abolhos,raha}@msu.eu

More information

IERCU. Institute of Economic Research, Chuo University 50th Anniversary Special Issues. Discussion Paper No.210

IERCU. Institute of Economic Research, Chuo University 50th Anniversary Special Issues. Discussion Paper No.210 IERCU Institute of Economic Research, Chuo University 50th Anniversary Special Issues Discussion Paper No.210 Discrete an Continuous Dynamics in Nonlinear Monopolies Akio Matsumoto Chuo University Ferenc

More information

3.6. Let s write out the sample space for this random experiment:

3.6. Let s write out the sample space for this random experiment: STAT 5 3 Let s write out the sample space for this ranom experiment: S = {(, 2), (, 3), (, 4), (, 5), (2, 3), (2, 4), (2, 5), (3, 4), (3, 5), (4, 5)} This sample space assumes the orering of the balls

More information

Generalization of the persistent random walk to dimensions greater than 1

Generalization of the persistent random walk to dimensions greater than 1 PHYSICAL REVIEW E VOLUME 58, NUMBER 6 DECEMBER 1998 Generalization of the persistent ranom walk to imensions greater than 1 Marián Boguñá, Josep M. Porrà, an Jaume Masoliver Departament e Física Fonamental,

More information

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM

A LIMIT THEOREM FOR RANDOM FIELDS WITH A SINGULARITY IN THE SPECTRUM Teor Imov r. ta Matem. Statist. Theor. Probability an Math. Statist. Vip. 81, 1 No. 81, 1, Pages 147 158 S 94-911)816- Article electronically publishe on January, 11 UDC 519.1 A LIMIT THEOREM FOR RANDOM

More information

θ x = f ( x,t) could be written as

θ x = f ( x,t) could be written as 9. Higher orer PDEs as systems of first-orer PDEs. Hyperbolic systems. For PDEs, as for ODEs, we may reuce the orer by efining new epenent variables. For example, in the case of the wave equation, (1)

More information

Topic 7: Convergence of Random Variables

Topic 7: Convergence of Random Variables Topic 7: Convergence of Ranom Variables Course 003, 2016 Page 0 The Inference Problem So far, our starting point has been a given probability space (S, F, P). We now look at how to generate information

More information

Sharp Thresholds. Zachary Hamaker. March 15, 2010

Sharp Thresholds. Zachary Hamaker. March 15, 2010 Sharp Threshols Zachary Hamaker March 15, 2010 Abstract The Kolmogorov Zero-One law states that for tail events on infinite-imensional probability spaces, the probability must be either zero or one. Behavior

More information

12.11 Laplace s Equation in Cylindrical and

12.11 Laplace s Equation in Cylindrical and SEC. 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential 593 2. Laplace s Equation in Cylinrical an Spherical Coorinates. Potential One of the most important PDEs in physics an engineering

More information

PDE Notes, Lecture #11

PDE Notes, Lecture #11 PDE Notes, Lecture # from Professor Jalal Shatah s Lectures Febuary 9th, 2009 Sobolev Spaces Recall that for u L loc we can efine the weak erivative Du by Du, φ := udφ φ C0 If v L loc such that Du, φ =

More information

Role of parameters in the stochastic dynamics of a stick-slip oscillator

Role of parameters in the stochastic dynamics of a stick-slip oscillator Proceeing Series of the Brazilian Society of Applie an Computational Mathematics, v. 6, n. 1, 218. Trabalho apresentao no XXXVII CNMAC, S.J. os Campos - SP, 217. Proceeing Series of the Brazilian Society

More information

Capacity Analysis of MIMO Systems with Unknown Channel State Information

Capacity Analysis of MIMO Systems with Unknown Channel State Information Capacity Analysis of MIMO Systems with Unknown Channel State Information Jun Zheng an Bhaskar D. Rao Dept. of Electrical an Computer Engineering University of California at San Diego e-mail: juzheng@ucs.eu,

More information

05 The Continuum Limit and the Wave Equation

05 The Continuum Limit and the Wave Equation Utah State University DigitalCommons@USU Founations of Wave Phenomena Physics, Department of 1-1-2004 05 The Continuum Limit an the Wave Equation Charles G. Torre Department of Physics, Utah State University,

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Technical Report TTI-TR-2008-5 Multi-View Clustering via Canonical Correlation Analysis Kamalika Chauhuri UC San Diego Sham M. Kakae Toyota Technological Institute at Chicago ABSTRACT Clustering ata in

More information

Lecture 6 : Dimensionality Reduction

Lecture 6 : Dimensionality Reduction CPS290: Algorithmic Founations of Data Science February 3, 207 Lecture 6 : Dimensionality Reuction Lecturer: Kamesh Munagala Scribe: Kamesh Munagala In this lecture, we will consier the roblem of maing

More information

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation

Tutorial on Maximum Likelyhood Estimation: Parametric Density Estimation Tutorial on Maximum Likelyhoo Estimation: Parametric Density Estimation Suhir B Kylasa 03/13/2014 1 Motivation Suppose one wishes to etermine just how biase an unfair coin is. Call the probability of tossing

More information

7.1 Support Vector Machine

7.1 Support Vector Machine 67577 Intro. to Machine Learning Fall semester, 006/7 Lecture 7: Support Vector Machines an Kernel Functions II Lecturer: Amnon Shashua Scribe: Amnon Shashua 7. Support Vector Machine We return now to

More information

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification

Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection and System Identification Concentration of Measure Inequalities for Compressive Toeplitz Matrices with Applications to Detection an System Ientification Borhan M Sananaji, Tyrone L Vincent, an Michael B Wakin Abstract In this paper,

More information

APPLICATION of compressed sensing (CS) in radar signal

APPLICATION of compressed sensing (CS) in radar signal A Novel Joint Compressive Single Target Detection an Parameter Estimation in Raar without Signal Reconstruction Alireza Hariri, Massou Babaie-Zaeh Department of Electrical Engineering, Sharif University

More information

Improved Rate-Based Pull and Push Strategies in Large Distributed Networks

Improved Rate-Based Pull and Push Strategies in Large Distributed Networks Improve Rate-Base Pull an Push Strategies in Large Distribute Networks Wouter Minnebo an Benny Van Hout Department of Mathematics an Computer Science University of Antwerp - imins Mielheimlaan, B-00 Antwerp,

More information

Tractability results for weighted Banach spaces of smooth functions

Tractability results for weighted Banach spaces of smooth functions Tractability results for weighte Banach spaces of smooth functions Markus Weimar Mathematisches Institut, Universität Jena Ernst-Abbe-Platz 2, 07740 Jena, Germany email: markus.weimar@uni-jena.e March

More information

Equilibrium in Queues Under Unknown Service Times and Service Value

Equilibrium in Queues Under Unknown Service Times and Service Value University of Pennsylvania ScholarlyCommons Finance Papers Wharton Faculty Research 1-2014 Equilibrium in Queues Uner Unknown Service Times an Service Value Laurens Debo Senthil K. Veeraraghavan University

More information

Lower bounds on Locality Sensitive Hashing

Lower bounds on Locality Sensitive Hashing Lower bouns on Locality Sensitive Hashing Rajeev Motwani Assaf Naor Rina Panigrahy Abstract Given a metric space (X, X ), c 1, r > 0, an p, q [0, 1], a istribution over mappings H : X N is calle a (r,

More information

All s Well That Ends Well: Supplementary Proofs

All s Well That Ends Well: Supplementary Proofs All s Well That Ens Well: Guarantee Resolution of Simultaneous Rigi Boy Impact 1:1 All s Well That Ens Well: Supplementary Proofs This ocument complements the paper All s Well That Ens Well: Guarantee

More information

Discrete Mathematics

Discrete Mathematics Discrete Mathematics 309 (009) 86 869 Contents lists available at ScienceDirect Discrete Mathematics journal homepage: wwwelseviercom/locate/isc Profile vectors in the lattice of subspaces Dániel Gerbner

More information

On the Connectivity Analysis over Large-Scale Hybrid Wireless Networks

On the Connectivity Analysis over Large-Scale Hybrid Wireless Networks This full text paper was peer reviewe at the irection of IEEE Communications Society subject matter experts for publication in the IEEE INFOCOM proceeings This paper was presente as part of the main Technical

More information

Parameter estimation: A new approach to weighting a priori information

Parameter estimation: A new approach to weighting a priori information Parameter estimation: A new approach to weighting a priori information J.L. Mea Department of Mathematics, Boise State University, Boise, ID 83725-555 E-mail: jmea@boisestate.eu Abstract. We propose a

More information

Experiment 2, Physics 2BL

Experiment 2, Physics 2BL Experiment 2, Physics 2BL Deuction of Mass Distributions. Last Upate: 2009-05-03 Preparation Before this experiment, we recommen you review or familiarize yourself with the following: Chapters 4-6 in Taylor

More information

1 Math 285 Homework Problem List for S2016

1 Math 285 Homework Problem List for S2016 1 Math 85 Homework Problem List for S016 Note: solutions to Lawler Problems will appear after all of the Lecture Note Solutions. 1.1 Homework 1. Due Friay, April 8, 016 Look at from lecture note exercises:

More information

Conservation Laws. Chapter Conservation of Energy

Conservation Laws. Chapter Conservation of Energy 20 Chapter 3 Conservation Laws In orer to check the physical consistency of the above set of equations governing Maxwell-Lorentz electroynamics [(2.10) an (2.12) or (1.65) an (1.68)], we examine the action

More information

Convergence of Random Walks

Convergence of Random Walks Chapter 16 Convergence of Ranom Walks This lecture examines the convergence of ranom walks to the Wiener process. This is very important both physically an statistically, an illustrates the utility of

More information

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012

Lecture Introduction. 2 Examples of Measure Concentration. 3 The Johnson-Lindenstrauss Lemma. CS-621 Theory Gems November 28, 2012 CS-6 Theory Gems November 8, 0 Lecture Lecturer: Alesaner Mąry Scribes: Alhussein Fawzi, Dorina Thanou Introuction Toay, we will briefly iscuss an important technique in probability theory measure concentration

More information

Make graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides

Make graph of g by adding c to the y-values. on the graph of f by c. multiplying the y-values. even-degree polynomial. graph goes up on both sides Reference 1: Transformations of Graphs an En Behavior of Polynomial Graphs Transformations of graphs aitive constant constant on the outsie g(x) = + c Make graph of g by aing c to the y-values on the graph

More information

Fast image compression using matrix K-L transform

Fast image compression using matrix K-L transform Fast image compression using matrix K-L transform Daoqiang Zhang, Songcan Chen * Department of Computer Science an Engineering, Naning University of Aeronautics & Astronautics, Naning 2006, P.R. China.

More information

Prep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9

Prep 1. Oregon State University PH 213 Spring Term Suggested finish date: Monday, April 9 Oregon State University PH 213 Spring Term 2018 Prep 1 Suggeste finish ate: Monay, April 9 The formats (type, length, scope) of these Prep problems have been purposely create to closely parallel those

More information

Chaos, Solitons and Fractals Nonlinear Science, and Nonequilibrium and Complex Phenomena

Chaos, Solitons and Fractals Nonlinear Science, and Nonequilibrium and Complex Phenomena Chaos, Solitons an Fractals (7 64 73 Contents lists available at ScienceDirect Chaos, Solitons an Fractals onlinear Science, an onequilibrium an Complex Phenomena journal homepage: www.elsevier.com/locate/chaos

More information

Lecture 2 Lagrangian formulation of classical mechanics Mechanics

Lecture 2 Lagrangian formulation of classical mechanics Mechanics Lecture Lagrangian formulation of classical mechanics 70.00 Mechanics Principle of stationary action MATH-GA To specify a motion uniquely in classical mechanics, it suffices to give, at some time t 0,

More information

Lie symmetry and Mei conservation law of continuum system

Lie symmetry and Mei conservation law of continuum system Chin. Phys. B Vol. 20, No. 2 20 020 Lie symmetry an Mei conservation law of continuum system Shi Shen-Yang an Fu Jing-Li Department of Physics, Zhejiang Sci-Tech University, Hangzhou 3008, China Receive

More information

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y

ensembles When working with density operators, we can use this connection to define a generalized Bloch vector: v x Tr x, v y Tr y Ph195a lecture notes, 1/3/01 Density operators for spin- 1 ensembles So far in our iscussion of spin- 1 systems, we have restricte our attention to the case of pure states an Hamiltonian evolution. Toay

More information

A simple tranformation of copulas

A simple tranformation of copulas A simple tranformation of copulas V. Durrleman, A. Nikeghbali & T. Roncalli Groupe e Recherche Opérationnelle Créit Lyonnais France July 31, 2000 Abstract We stuy how copulas properties are moifie after

More information

Technion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels.

Technion - Computer Science Department - M.Sc. Thesis MSC Constrained Codes for Two-Dimensional Channels. Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Constraine Coes for Two-Dimensional Channels Keren Censor Technion - Computer Science Department - M.Sc. Thesis MSC-2006- - 2006 Technion

More information

Multi-View Clustering via Canonical Correlation Analysis

Multi-View Clustering via Canonical Correlation Analysis Keywors: multi-view learning, clustering, canonical correlation analysis Abstract Clustering ata in high-imensions is believe to be a har problem in general. A number of efficient clustering algorithms

More information

Throughput Optimal Control of Cooperative Relay Networks

Throughput Optimal Control of Cooperative Relay Networks hroughput Optimal Control of Cooperative Relay Networks Emun Yeh Dept. of Electrical Engineering Yale University New Haven, C 06520, USA E-mail: emun.yeh@yale.eu Ranall Berry Dept. of Electrical an Computer

More information

BIRS Ron Peled (Tel Aviv University) Portions joint with Ohad N. Feldheim (Tel Aviv University)

BIRS Ron Peled (Tel Aviv University) Portions joint with Ohad N. Feldheim (Tel Aviv University) 2.6.2011 BIRS Ron Pele (Tel Aviv University) Portions joint with Oha N. Felheim (Tel Aviv University) Surface: f : Λ Hamiltonian: H(f) DGFF: V f(x) f(y) x~y V(x) x 2. R or for f a Λ a box Ranom surface:

More information

Acute sets in Euclidean spaces

Acute sets in Euclidean spaces Acute sets in Eucliean spaces Viktor Harangi April, 011 Abstract A finite set H in R is calle an acute set if any angle etermine by three points of H is acute. We examine the maximal carinality α() of

More information

Radar Sensor Management for Detection and Tracking

Radar Sensor Management for Detection and Tracking Raar Sensor Management for Detection an Tracking Krüger White, Jason Williams, Peter Hoffensetz Defence Science an Technology Organisation PO Box 00, Einburgh, SA Australia Email: Kruger.White@sto.efence.gov.au,

More information

Monotonicity of facet numbers of random convex hulls

Monotonicity of facet numbers of random convex hulls Monotonicity of facet numbers of ranom convex hulls Gilles Bonnet, Julian Grote, Daniel Temesvari, Christoph Thäle, Nicola Turchi an Florian Wespi arxiv:173.31v1 [math.mg] 7 Mar 17 Abstract Let X 1,...,

More information

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback

An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback Journal of Machine Learning Research 8 07) - Submitte /6; Publishe 5/7 An Optimal Algorithm for Banit an Zero-Orer Convex Optimization with wo-point Feeback Oha Shamir Department of Computer Science an

More information

Transmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency

Transmission Line Matrix (TLM) network analogues of reversible trapping processes Part B: scaling and consistency Transmission Line Matrix (TLM network analogues of reversible trapping processes Part B: scaling an consistency Donar e Cogan * ANC Eucation, 308-310.A. De Mel Mawatha, Colombo 3, Sri Lanka * onarecogan@gmail.com

More information

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy

IPA Derivatives for Make-to-Stock Production-Inventory Systems With Backorders Under the (R,r) Policy IPA Derivatives for Make-to-Stock Prouction-Inventory Systems With Backorers Uner the (Rr) Policy Yihong Fan a Benamin Melame b Yao Zhao c Yorai Wari Abstract This paper aresses Infinitesimal Perturbation

More information

SYNCHRONOUS SEQUENTIAL CIRCUITS

SYNCHRONOUS SEQUENTIAL CIRCUITS CHAPTER SYNCHRONOUS SEUENTIAL CIRCUITS Registers an counters, two very common synchronous sequential circuits, are introuce in this chapter. Register is a igital circuit for storing information. Contents

More information

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation

Thermal conductivity of graded composites: Numerical simulations and an effective medium approximation JOURNAL OF MATERIALS SCIENCE 34 (999)5497 5503 Thermal conuctivity of grae composites: Numerical simulations an an effective meium approximation P. M. HUI Department of Physics, The Chinese University

More information

PHYS 414 Problem Set 2: Turtles all the way down

PHYS 414 Problem Set 2: Turtles all the way down PHYS 414 Problem Set 2: Turtles all the way own This problem set explores the common structure of ynamical theories in statistical physics as you pass from one length an time scale to another. Brownian

More information

Introduction to the Vlasov-Poisson system

Introduction to the Vlasov-Poisson system Introuction to the Vlasov-Poisson system Simone Calogero 1 The Vlasov equation Consier a particle with mass m > 0. Let x(t) R 3 enote the position of the particle at time t R an v(t) = ẋ(t) = x(t)/t its

More information