Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals

Size: px
Start display at page:

Download "Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals"

Transcription

1 Samling and Distortion radeoffs for Bandlimited Periodic Signals Elaheh ohammadi and Farokh arvasti Advanced Communications Research Institute ACRI Deartment of Electrical Engineering Sharif University of echnology el Abstract In this aer the otimal samling strategies uniform or nonuniform and distortion tradeoffs for stationary bandlimited eriodic signals are studied. We justify and use both the average and variance of distortion as the erformance criteria. o comute the otimal distortion one needs to find the otimal samling locations as well as the otimal re-samling filter. A comlete characterization of the otimal distortion for the rates lower than half the Landau rate is rovided. It is shown that nonuniform samling outerforms uniform samling. In addition this nonuniform samling is robust with resect to missing samles. Next for the rates higher than half the Landau rate we find bounds that are shown to be tight for some secial cases. An extension of the results for random discrete eriodic signals is discussed with simulation results indicating that the intuitions from the continuous domain carry over to the discrete domain. I. INRODUCION Consider the roblem of finding the best locations for samling a continuous signal nonuniform samling to minimize the reconstruction distortion. o find the otimal samling oints one should utilize any available rior information about the structure of the signal. Furthermore samling noise should be taken into account. Due to its imortance nonuniform samling and its stability analysis has been the subject of numerous works see [] for an overview of nonuniform samling. However there has been relatively less work for a fully Bayesian model of the signal and samling noise where one is interested in the statistical average distortion of signal reconstruction over a class of signals. In this aer we study this roblem for stationary eriodic bandlimited signals. he best locations of nonuniform samling via an adative samling method is considered in [] for a first order arkov source. he first order arkov assumtion allows the authors to comute the distortions in terms of the length of consecutive samling times. A tradeoff among samling rate information rate and distortion of uniform samling is derived in [3] for Gaussian sources corruted by noise. he authors in [4] look at choosing the samling oints for a stationary Gaussian signal with auto-correlation function Rτ = ρ τ. It is shown that uniform samling is otimal in this case. atthews in [5] considers a wide-sense stationary rocess and comutes the linear minimum mean square error SE estimate from sub-nyquist uniform samles. he authors in [6] comute the otimal re-and ost-filters for a signal corruted by noise when uniform samling is used. he authors in [7] derive a rate distortion function for lossy reconstruction of a multi-comonent signal when only a subset of the signal comonents are samled. hey only consider uniform and random samling strategies. oreover there has been some work in comressed sensing on the tradeoffs between samling rate and the reconstruction error. In [8] a samling rate-distortion region is found; it is shown that arbitrarily small but constant distortion is achievable with a constant measurement rate and a er-samle signal-to-noise ratio. he authors in [9] define a samling-rate distortion function for an i.i.d. source and derive lower bounds on the achievable erformance. In this aer we consider a continuous stationary eriodic signal. he signal is assumed to be bandlimited with at most N N + non-zero Fourier series coefficients from frequency N ω 0 to N ω 0 where ω 0 = π/ is the fundamental frequency. Since there are N N + free variables the signal can be uniquely reconstructed from = noiseless samles Landau rate. But as we consider taking noisy samles at time instances that we choose unique reconstruction is not feasible and distortion is inevitable. We also consider a re-samling filter in our model. See Fig. for a descrition of our roblem. he Fourier series coefficients and the samling noises are all random variables. herefore both the inut signal and its reconstruction from its samles are random signals and so is the reconstruction distortion. We are interested in minimizing the exected value and variance of this distortion by choosing the best samling oints and re-samling filter. We denote the minimum of the exected value and variance of the distortion by and resectively. A formal definition of and is given in Section II. A small guarantees a good average erformance over all instances of the random signal while a small guarantees that with high robability we are close to the romised average distortion for a given random signal see [0 Aendix A] for further justification. herefore our goal is to find the tradeoffs between the number of samles the re-samling filter the variance of noise σ and the otimal exected value and variance of distortion. Here we rovide tight results or bounds on the tradeoffs among various arameters such as distortion samling rate and samling noise. When we are below half the Landau rate N we find the otimal average distortion

2 and variance. Interestingly we show that the minimum of both and are obtained at the same samling locations and the same re-samling filter. Furthermore these two minima are obtained when we do not use a re-samling filter on the signal bandwidth and use a nonuniform samling rocedure in which the samles are arbitrary chosen from the set 0 /N /N 3/N N /N. Observe that this set contains uniform samling oints at half the Landau rate. hus for < N the otimal samles are nonuniform. It is worth to note that the samling locations only deend on the bandwidth of the signal; they are otimal for all values of the noise variance σ and N. oreover the samling oints are robust with resect to missing samles. Note that the otimal samling oints are any arbitrary oints from the set 0 /N /N 3/N N /N. hus if we samle at these ositions and we miss some samles i.e. getting < samles instead of samles the set of samle oints is still a subset of 0 /N /N 3/N N /N and hence otimal. herefore if we knew in advance that we get samles this knowledge would not have heled us. For above half the Landau rate we rovide some lower and uer bounds that are shown to be tight in some cases. When N < i.e. between half the Landau rate and the Landau rate we find otimal average distortion when N using a non-uniform set of samling locations. In addition when > uniform samling is shown to be otimal under certain constraints. Whenever we find and exlicitly the minima are achieved simultaneously at the same otimal samling oints and the re- samling filter. his aer is organized as follows: Section II formally defines the roblem. Section III resents the main results of the aer with the roofs given in [0]. Section IV rovides simulation results. II. PROBLE DEFINIION We consider a continuous stationary bandlimited eriodic signal defined as follows: St = l=n [A l coslω 0 t + B l sinlω 0 t] where ω 0 = π/ is the fundamental frequency. he summation is from l = N to N indicating that the signal is bandlimited. We assume that A l and B l for N l N are mutually indeendent Gaussian rv s distributed according to N 0 for > 0. hus the signal ower is N/ where N = N N +. he discrete version of the signal is S[n] = l=n [A l coslω 0 n + B l sinlω 0 n] where ω 0 = π/ for some integer. Our model is deicted in Figure. he signal St given in is assed through a re-samling filter Hω to roduce St. he signal St is samled at time instances t = t t t where t i [0. hese samles are then corruted by Zt an i.i.d. zero-mean Gaussian noise denoted as N 0 σ. hus our observations are Y i = St i + Z i i =. An estimator uses the noisy samles Y Y Y to reconstruct the original signal denoted by Ŝt. he incurred samling distortion given by SE criterion is equal to Ŝt St dt. his distortion is a random variable. Our goal is to comute the minima of the exected value and variance of this random variable i.e. to minimize D = E Ŝt St dt 3 V = Var Ŝt St dt. 4 We are free to choose Hω and the samling locations t i s i. herefore the otimal distortion is defined as follows: = = min H t t E min H t t Var Ŝt St dt Ŝt St dt where the minimization is taken over the samling locations and the re-samling filter. We assume that Hω is a real linear time invariant LI filter such that Hlω 0 for all N l N meaning that the frequency gain of the signal is at most one; in other words we assume that the filter is assive and hence cannot increase the signal energy in each frequency. In articular all ass filters Hω = satisfy this assumtion. he reason for introducing this assumtion is that we can always normalize the ower gain of the filter. III. AIN RESULS In this section first two general lower bounds on the average and variance of distortion are given and then the main results of the aer are stated. he roofs of the main results are given in [0 Aendices A and B]. Note that SNR = N/σ. A. wo General Lower Bounds on the Average and Variance of Distortion Lemma. For any noise variance σ > 0 and any choice of the re-samling filter the following lower bounds hold for all values of : SNR + SNR. When we do not use a re-samling filter on the signal bandwidth i.e. Hlω 0 = for l = N N equality in

3 Fig.. Samling-Distortion odel. he signal St is assed through re-samling filter. he outut St is samled at times t t t. A noise Z is added to the signal at the time of samling. he noisy observations are then used to recover the signal. the above equations holds if and only if for any time instances t i and t j one of the following two equations holds: t i t j = m N for some integer m 5 t i t j = m + N + N for some integer m. 6 Lemma. For any σ > 0 and any choice of the re-samling filter the following lower bounds hold for all values of : N + SNR 7 +. SNR 8 Furthermore when we do not use a re-samling filter on the signal bandwidth equality in the above equation holds if the samling time instances satisfy t i= ejπk i = 0 for k N +. Note that for < Lemma gives better lower bounds on and whereas for > Lemma gives tighter ones. B. Samling Distortion radeoffs for N he samling-rate distortion tradeoffs are studied when the samling rate is lower than the Landau rate. heorem. For N the otimal average and variance of distortion for any given re-samling filter are given by = SNR = + + SNR. 0 Both the minimal average distortion and its variance are obtained with the re-samling filter Hlω 0 = for l = N N and choosing distinct time instances arbitrarily from the following set of N samles 0 N N 3 N N N. he otimal interolation formula for this set of samling oints is given by Ŝt = N + σ i= l=n coslω 0 t t i Y i = N + σ i= cos ω 0 t t i Nω0 sin t t i sin ω0 t t i Y i where Y i is the noisy samle of the signal at t = t i. Remark. Consider 9. Observe that for fixed values of and σ the minimum distortion is linear in. But it is not linear in N as SNR in the denominator is N/σ excet when SNR goes to infinity. In the case of noiseless samles σ = 0 the SNR will be infinity and the minimal distortion will be /. o intuitively understand this equation observe that there are free variables and we can recover of them using the samles. herefore we will have free variables giving a total distortion of / as the ower of each sinusoidal function is /. oreover the maximum distortion is / which is obtained when σ = SNR = 0 or = 0. Observe that when SNR is large + σ = + SNR which is linear in both and σ. Observe that when N is increasing in both and σ. C. Samling-Distortion radeoffs for N < For the samling rates N < we have: heorem. For N < and any choice of resamling filter the otimal average distortion can be bounded as follows + + SNR in which + + Num + SNR + SNR + SNR + N Num Num = min fn N N + SNR 3 and fa b is equal to b if r = 0 fa b = b r + if r > b r if 0 < r b

4 where r is the remainder of dividing a by b. he lower bound given in is tight when N for any arbitrary. o achieve the otimal distortion no re-samling filter is necessary and the otimal time instances can be chosen from the set 0 N N N N N + N N + N + N N N + N + N D. Samling Distortion radeoffs for. Here the samling rates above the Landau rate are studied. heorem 3. For and any choice of the re-samling filter the following lower bounds on otimal average and variance of distortion hold: N + 4.SNR +. 5 SNR oreover these lower bounds are tight with uniform samling i.e. t i = i/ i = and without filtering on the signal bandwidth if for each k in the interval k we have k. In articular uniform samling is otimal when >. Also the reconstruction formula for the otimal set of samling oints is given by Ŝt = + coslω 0 t t i Y i σ i= l=n = N + σ cos ω 0 t t i 6 i= Nω0 sin t t i sin ω0 t t i Y i 7 where Y i is the noisy samle of the signal at t = t i. Remark. When goes to infinity the minimum distortion = O/ goes to zero regardless of the samling noise value. o see this observe that when is very large > the lower bounds given in 4 and 5 are tight. Remark 3. Unlike the case of N where otimal samling oints could be found without any need to know N we show in [0] that this is no longer the case for >. Besides the uniform samling strategy is not otimal in general. E. Discrete Signals Consider a real eriodic discrete signal of the form S[n] = l=n [A l coslω 0 n + B l sinlω 0 n] 8 where ω 0 = π for some integer and N N < / are natural numbers. Observe that is the eriod of the discrete signal and A l jb l is the l-th DF coefficient of the discrete signal S[n]. Suose that we have noisy samles at time instances t t t. We want to use these samles to reconstruct the discrete signal S[n]. If the reconstruction is Ŝ[n] = N l=n [Âl coslω 0 n + ˆB l sinlω 0 n] the distortion n= S[n] Ŝ[n] is roortional to l A l Âl + B l ˆB l. hus the formulation for minimizing the distortion is the same as that of the continuous signals. he only additional restriction is that t i s should be integers. Whenever the otimal samling oints in the continuous formulation turn out to be integer values they are the otimal oints in the discrete case. And when the otimal samling oints are not integers simulation results with exhaustive search show that their closest integer values are either otimal or nearly otimal. For examle suose that the signal eriod is = 5 and N N = 3 4. In this case N and the otimal samling oints in the continuous case are t t t τ for some τ [0 ]. he rounds of these oint for τ =. are otimal in the discrete case i.e. any choice of time instances from the set 5 8 is otimal. On the other hand when the signal eriod is = 5 and N N = 4 6. Here again N and t t t 3 t 4 Ϝ = τ are the only continuous otimal oints. Choosing the time instances from their closest integers yields D = However the otimal oints are 8 9 resulting in = Note that the distance between the first two otimal oints is which cannot be achieved by choosing any arbitrary value of τ since the distance between any of the oints in Ϝ is.5. IV. SIULAION RESULS he maximum of the lower bounds given in Lemma and Lemma is deicted in Fig.. In this figure the distortion of the uniform samling without any re-samling filter on the signal bandwidth is also deicted. he erformance of the uniform samling is close to otimal for N its curve almost matches that of the lower bound in Lemma which is otimal for N. We observe that near the Landau rate increasing the number of samling oints does not decrease the distortion. Here the curve for uniform samling reaches its maximum at = 6 whereas the Landau rate is 8. he curve reaches the second lower bound at = 35. hus uniform samling is otimal for the rates above the Nyquist rate > = 34. Finally the exlicit uer bound on the erformance of the samling oints given in heorem is also deicted. As shown in the figure this uer bound can be below the distortion of the uniform samling. In Fig. 3 two random signals are generated using arameters N N σ = heir reconstruction with = 3 samles are also deicted emloying the otimal SE method and the iterative method of []. he samling oints are otimally chosen. he average reconstruction distortion SE over all random signals with the given arameters is D = In the to subfigure the

5 distortion of the otimal SE method is D = and the distortion of the iterative method is D iterative = In the bottom subfigure the distortions of the otimal SE and iterative methods are D =.6038 and D iterative =.604 resectively. We see that the erformance of the iterative method is near otimal in the high SNR scenario. Fig. 4 uses the same arameters for generating the signal but the variance of the noise is 4 low SNR scenario. In this case the average distortion over all random signals is D = he distortions of the to subfigure are D = 0.44 for the otimal SE method and D iterative = for the iterative method. For subfigure b they are D =.8347 and D iterative =.9700 resectively. ACKNOWLEDGEN he authors would like to thank Amin Gohari and Salman Beigi for helful discussions. Fig.. he average distortion for N N σ = 9 9. REFERENCES [] F. arvasti Nonuniform Samling heory and Practice Kluwer Academic/Plenum Publishers New York 000. [] S. Feizi V. K. Goyal and. edard ime-stamless Adative Nonuniform Samling for Stochastic Signals IEEE rans. Signal Process. vol. 60 no Oct. 0. [3] A. Kinis A. Goldsmith. Weissman Y. Eldar Distortion Rate Function of Sub-Nyquist Samled Gaussian Sources Corruted by Noise in Proc. Allerton Conf. on Comm. Control and Comuting [4] J. Wu and N. Sun Otimum Sensor Density in Distortion-tolerant Wireless Sensor Networks IEEE rans. Wireless Commun. vol. no June 0. [5]. atthews On the Linear minimum-mean-squared-error Estimation of an Undersamled Wide-sense Stationary Random Process IEEE rans. Signal Process. vol. 48 no Jan [6] D. Chan and R. Donaldson Otimum re- and ost-filtering of Samled Signals with Alication to Pulse odulation and Data Comression systems IEEE rans. on Commun. echnol. vol Ar. 97. [7] V. P. Boda and P. Narayan Samling Rate Distortion in Proc. IEEE Int. Sym. on Inf. heory ISI [8] G. Reeves and. Gastar he Samling Rate-Distortion radeoff for Sarsity Pattern Recovery in Comressed Sensing IEEE rans. Inf. heory vol. 58 no ay 0. [9] C. Guo and. E. Davies Samle Distortion for Comressed Imaging IEEE rans. Signal Process. vol Dec. 03. [0] E. ohammadi and F. arvasti Samling and Distortion radeoffs for Bandlimited Periodic Signals Jan. 05. [Online]. Available: htt://arxiv.org/abs/ [] F. arvasti. Analoui and. Gamshadzahi Recovery of Signals from Nonuniform Samles Using Iterative ethods IEEE rans. Signal Process. vol. 39 no Ar. 99. Fig. 3. wo random signals and their reconstructions in high SNR. Fig. 4. wo random signals and their reconstructions in low SNR.

Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals

Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals Sampling and Distortion Tradeoffs for Bandlimited Periodic Signals Elaheh ohammadi and Farokh arvasti Advanced Communications Research Institute (ACRI) Department of Electrical Engineering Sharif University

More information

4. Score normalization technical details We now discuss the technical details of the score normalization method.

4. Score normalization technical details We now discuss the technical details of the score normalization method. SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules

More information

Interactive Hypothesis Testing Against Independence

Interactive Hypothesis Testing Against Independence 013 IEEE International Symosium on Information Theory Interactive Hyothesis Testing Against Indeendence Yu Xiang and Young-Han Kim Deartment of Electrical and Comuter Engineering University of California,

More information

Improved Capacity Bounds for the Binary Energy Harvesting Channel

Improved Capacity Bounds for the Binary Energy Harvesting Channel Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,

More information

Multi-Operation Multi-Machine Scheduling

Multi-Operation Multi-Machine Scheduling Multi-Oeration Multi-Machine Scheduling Weizhen Mao he College of William and Mary, Williamsburg VA 3185, USA Abstract. In the multi-oeration scheduling that arises in industrial engineering, each job

More information

On Code Design for Simultaneous Energy and Information Transfer

On Code Design for Simultaneous Energy and Information Transfer On Code Design for Simultaneous Energy and Information Transfer Anshoo Tandon Electrical and Comuter Engineering National University of Singaore Email: anshoo@nus.edu.sg Mehul Motani Electrical and Comuter

More information

Convex Optimization methods for Computing Channel Capacity

Convex Optimization methods for Computing Channel Capacity Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem

More information

MATH 2710: NOTES FOR ANALYSIS

MATH 2710: NOTES FOR ANALYSIS MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite

More information

Estimation of the large covariance matrix with two-step monotone missing data

Estimation of the large covariance matrix with two-step monotone missing data Estimation of the large covariance matrix with two-ste monotone missing data Masashi Hyodo, Nobumichi Shutoh 2, Takashi Seo, and Tatjana Pavlenko 3 Deartment of Mathematical Information Science, Tokyo

More information

On split sample and randomized confidence intervals for binomial proportions

On split sample and randomized confidence intervals for binomial proportions On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have

More information

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.

Convolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code. Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional

More information

Chapter 7: Special Distributions

Chapter 7: Special Distributions This chater first resents some imortant distributions, and then develos the largesamle distribution theory which is crucial in estimation and statistical inference Discrete distributions The Bernoulli

More information

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO)

Combining Logistic Regression with Kriging for Mapping the Risk of Occurrence of Unexploded Ordnance (UXO) Combining Logistic Regression with Kriging for Maing the Risk of Occurrence of Unexloded Ordnance (UXO) H. Saito (), P. Goovaerts (), S. A. McKenna (2) Environmental and Water Resources Engineering, Deartment

More information

arxiv:cond-mat/ v2 25 Sep 2002

arxiv:cond-mat/ v2 25 Sep 2002 Energy fluctuations at the multicritical oint in two-dimensional sin glasses arxiv:cond-mat/0207694 v2 25 Se 2002 1. Introduction Hidetoshi Nishimori, Cyril Falvo and Yukiyasu Ozeki Deartment of Physics,

More information

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS

COMPARISON OF VARIOUS OPTIMIZATION TECHNIQUES FOR DESIGN FIR DIGITAL FILTERS NCCI 1 -National Conference on Comutational Instrumentation CSIO Chandigarh, INDIA, 19- March 1 COMPARISON OF VARIOUS OPIMIZAION ECHNIQUES FOR DESIGN FIR DIGIAL FILERS Amanjeet Panghal 1, Nitin Mittal,Devender

More information

Approximating min-max k-clustering

Approximating min-max k-clustering Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost

More information

arxiv: v1 [physics.data-an] 26 Oct 2012

arxiv: v1 [physics.data-an] 26 Oct 2012 Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch

More information

Anytime communication over the Gilbert-Eliot channel with noiseless feedback

Anytime communication over the Gilbert-Eliot channel with noiseless feedback Anytime communication over the Gilbert-Eliot channel with noiseless feedback Anant Sahai, Salman Avestimehr, Paolo Minero Deartment of Electrical Engineering and Comuter Sciences University of California

More information

ECE 534 Information Theory - Midterm 2

ECE 534 Information Theory - Midterm 2 ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You

More information

Linear diophantine equations for discrete tomography

Linear diophantine equations for discrete tomography Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,

More information

Robust Beamforming via Matrix Completion

Robust Beamforming via Matrix Completion Robust Beamforming via Matrix Comletion Shunqiao Sun and Athina P. Petroulu Deartment of Electrical and Comuter Engineering Rutgers, the State University of Ne Jersey Piscataay, Ne Jersey 8854-858 Email:

More information

Distributed Rule-Based Inference in the Presence of Redundant Information

Distributed Rule-Based Inference in the Presence of Redundant Information istribution Statement : roved for ublic release; distribution is unlimited. istributed Rule-ased Inference in the Presence of Redundant Information June 8, 004 William J. Farrell III Lockheed Martin dvanced

More information

8 STOCHASTIC PROCESSES

8 STOCHASTIC PROCESSES 8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular

More information

CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules

CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules CHAPTER-II Control Charts for Fraction Nonconforming using m-of-m Runs Rules. Introduction: The is widely used in industry to monitor the number of fraction nonconforming units. A nonconforming unit is

More information

Estimating Time-Series Models

Estimating Time-Series Models Estimating ime-series Models he Box-Jenkins methodology for tting a model to a scalar time series fx t g consists of ve stes:. Decide on the order of di erencing d that is needed to roduce a stationary

More information

State Estimation with ARMarkov Models

State Estimation with ARMarkov Models Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,

More information

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S.

2-D Analysis for Iterative Learning Controller for Discrete-Time Systems With Variable Initial Conditions Yong FANG 1, and Tommy W. S. -D Analysis for Iterative Learning Controller for Discrete-ime Systems With Variable Initial Conditions Yong FANG, and ommy W. S. Chow Abstract In this aer, an iterative learning controller alying to linear

More information

Asymptotically Optimal Simulation Allocation under Dependent Sampling

Asymptotically Optimal Simulation Allocation under Dependent Sampling Asymtotically Otimal Simulation Allocation under Deendent Samling Xiaoing Xiong The Robert H. Smith School of Business, University of Maryland, College Park, MD 20742-1815, USA, xiaoingx@yahoo.com Sandee

More information

System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests

System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests 009 American Control Conference Hyatt Regency Riverfront, St. Louis, MO, USA June 0-, 009 FrB4. System Reliability Estimation and Confidence Regions from Subsystem and Full System Tests James C. Sall Abstract

More information

Optimism, Delay and (In)Efficiency in a Stochastic Model of Bargaining

Optimism, Delay and (In)Efficiency in a Stochastic Model of Bargaining Otimism, Delay and In)Efficiency in a Stochastic Model of Bargaining Juan Ortner Boston University Setember 10, 2012 Abstract I study a bilateral bargaining game in which the size of the surlus follows

More information

Supplementary Materials for Robust Estimation of the False Discovery Rate

Supplementary Materials for Robust Estimation of the False Discovery Rate Sulementary Materials for Robust Estimation of the False Discovery Rate Stan Pounds and Cheng Cheng This sulemental contains roofs regarding theoretical roerties of the roosed method (Section S1), rovides

More information

On the Chvatál-Complexity of Knapsack Problems

On the Chvatál-Complexity of Knapsack Problems R u t c o r Research R e o r t On the Chvatál-Comlexity of Knasack Problems Gergely Kovács a Béla Vizvári b RRR 5-08, October 008 RUTCOR Rutgers Center for Oerations Research Rutgers University 640 Bartholomew

More information

Lower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data

Lower Confidence Bound for Process-Yield Index S pk with Autocorrelated Process Data Quality Technology & Quantitative Management Vol. 1, No.,. 51-65, 15 QTQM IAQM 15 Lower onfidence Bound for Process-Yield Index with Autocorrelated Process Data Fu-Kwun Wang * and Yeneneh Tamirat Deartment

More information

Hotelling s Two- Sample T 2

Hotelling s Two- Sample T 2 Chater 600 Hotelling s Two- Samle T Introduction This module calculates ower for the Hotelling s two-grou, T-squared (T) test statistic. Hotelling s T is an extension of the univariate two-samle t-test

More information

Training sequence optimization for frequency selective channels with MAP equalization

Training sequence optimization for frequency selective channels with MAP equalization 532 ISCCSP 2008, Malta, 12-14 March 2008 raining sequence otimization for frequency selective channels with MAP equalization Imed Hadj Kacem, Noura Sellami Laboratoire LEI ENIS, Route Sokra km 35 BP 3038

More information

On the capacity of the general trapdoor channel with feedback

On the capacity of the general trapdoor channel with feedback On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:

More information

Online Appendix to Accompany AComparisonof Traditional and Open-Access Appointment Scheduling Policies

Online Appendix to Accompany AComparisonof Traditional and Open-Access Appointment Scheduling Policies Online Aendix to Accomany AComarisonof Traditional and Oen-Access Aointment Scheduling Policies Lawrence W. Robinson Johnson Graduate School of Management Cornell University Ithaca, NY 14853-6201 lwr2@cornell.edu

More information

Radial Basis Function Networks: Algorithms

Radial Basis Function Networks: Algorithms Radial Basis Function Networks: Algorithms Introduction to Neural Networks : Lecture 13 John A. Bullinaria, 2004 1. The RBF Maing 2. The RBF Network Architecture 3. Comutational Power of RBF Networks 4.

More information

Generalized Coiflets: A New Family of Orthonormal Wavelets

Generalized Coiflets: A New Family of Orthonormal Wavelets Generalized Coiflets A New Family of Orthonormal Wavelets Dong Wei, Alan C Bovik, and Brian L Evans Laboratory for Image and Video Engineering Deartment of Electrical and Comuter Engineering The University

More information

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS

#A47 INTEGERS 15 (2015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS #A47 INTEGERS 15 (015) QUADRATIC DIOPHANTINE EQUATIONS WITH INFINITELY MANY SOLUTIONS IN POSITIVE INTEGERS Mihai Ciu Simion Stoilow Institute of Mathematics of the Romanian Academy, Research Unit No. 5,

More information

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK

MATHEMATICAL MODELLING OF THE WIRELESS COMMUNICATION NETWORK Comuter Modelling and ew Technologies, 5, Vol.9, o., 3-39 Transort and Telecommunication Institute, Lomonosov, LV-9, Riga, Latvia MATHEMATICAL MODELLIG OF THE WIRELESS COMMUICATIO ETWORK M. KOPEETSK Deartment

More information

HENSEL S LEMMA KEITH CONRAD

HENSEL S LEMMA KEITH CONRAD HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar

More information

Optimal Recognition Algorithm for Cameras of Lasers Evanescent

Optimal Recognition Algorithm for Cameras of Lasers Evanescent Otimal Recognition Algorithm for Cameras of Lasers Evanescent T. Gaudo * Abstract An algorithm based on the Bayesian aroach to detect and recognise off-axis ulse laser beams roagating in the atmoshere

More information

Autoregressive (AR) Modelling

Autoregressive (AR) Modelling Autoregressive (AR) Modelling A. Uses of AR Modelling () Alications (a) Seech recognition and coding (storage) (b) System identification (c) Modelling and recognition of sonar, radar, geohysical signals

More information

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4

s v 0 q 0 v 1 q 1 v 2 (q 2) v 3 q 3 v 4 Discrete Adative Transmission for Fading Channels Lang Lin Λ, Roy D. Yates, Predrag Sasojevic WINLAB, Rutgers University 7 Brett Rd., NJ- fllin, ryates, sasojevg@winlab.rutgers.edu Abstract In this work

More information

Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Application

Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Application BULGARIA ACADEMY OF SCIECES CYBEREICS AD IFORMAIO ECHOLOGIES Volume 9 o 3 Sofia 009 Positive Definite Uncertain Homogeneous Matrix Polynomials: Analysis and Alication Svetoslav Savov Institute of Information

More information

arxiv: v2 [cs.it] 10 Aug 2009

arxiv: v2 [cs.it] 10 Aug 2009 Sarse recovery by non-convex otimization instance otimality Rayan Saab arxiv:89.745v2 [cs.it] 1 Aug 29 Deartment of Electrical and Comuter Engineering, University of British Columbia, Vancouver, B.C. Canada

More information

MULTIVARIATE SHEWHART QUALITY CONTROL FOR STANDARD DEVIATION

MULTIVARIATE SHEWHART QUALITY CONTROL FOR STANDARD DEVIATION MULTIVARIATE SHEWHART QUALITY CONTROL FOR STANDARD DEVIATION M. Jabbari Nooghabi, Deartment of Statistics, Faculty of Mathematical Sciences, Ferdowsi University of Mashhad, Mashhad-Iran. and H. Jabbari

More information

Elementary Analysis in Q p

Elementary Analysis in Q p Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some

More information

Unsupervised Hyperspectral Image Analysis Using Independent Component Analysis (ICA)

Unsupervised Hyperspectral Image Analysis Using Independent Component Analysis (ICA) Unsuervised Hyersectral Image Analysis Using Indeendent Comonent Analysis (ICA) Shao-Shan Chiang Chein-I Chang Irving W. Ginsberg Remote Sensing Signal and Image Processing Laboratory Deartment of Comuter

More information

arxiv: v1 [cs.gt] 2 Nov 2018

arxiv: v1 [cs.gt] 2 Nov 2018 Tight Aroximation Ratio of Anonymous Pricing Yaonan Jin Pinyan Lu Qi Qi Zhihao Gavin Tang Tao Xiao arxiv:8.763v [cs.gt] 2 Nov 28 Abstract We consider two canonical Bayesian mechanism design settings. In

More information

Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations

Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations Characterizing the Behavior of a Probabilistic CMOS Switch Through Analytical Models and Its Verification Through Simulations PINAR KORKMAZ, BILGE E. S. AKGUL and KRISHNA V. PALEM Georgia Institute of

More information

Positive decomposition of transfer functions with multiple poles

Positive decomposition of transfer functions with multiple poles Positive decomosition of transfer functions with multile oles Béla Nagy 1, Máté Matolcsi 2, and Márta Szilvási 1 Deartment of Analysis, Technical University of Budaest (BME), H-1111, Budaest, Egry J. u.

More information

FAST AND EFFICIENT SIDE INFORMATION GENERATION IN DISTRIBUTED VIDEO CODING BY USING DENSE MOTION REPRESENTATIONS

FAST AND EFFICIENT SIDE INFORMATION GENERATION IN DISTRIBUTED VIDEO CODING BY USING DENSE MOTION REPRESENTATIONS 18th Euroean Signal Processing Conference (EUSIPCO-2010) Aalborg, Denmark, August 23-27, 2010 FAST AND EFFICIENT SIDE INFORMATION GENERATION IN DISTRIBUTED VIDEO CODING BY USING DENSE MOTION REPRESENTATIONS

More information

Statics and dynamics: some elementary concepts

Statics and dynamics: some elementary concepts 1 Statics and dynamics: some elementary concets Dynamics is the study of the movement through time of variables such as heartbeat, temerature, secies oulation, voltage, roduction, emloyment, rices and

More information

Age of Information: Whittle Index for Scheduling Stochastic Arrivals

Age of Information: Whittle Index for Scheduling Stochastic Arrivals Age of Information: Whittle Index for Scheduling Stochastic Arrivals Yu-Pin Hsu Deartment of Communication Engineering National Taiei University yuinhsu@mail.ntu.edu.tw arxiv:80.03422v2 [math.oc] 7 Ar

More information

JJMIE Jordan Journal of Mechanical and Industrial Engineering

JJMIE Jordan Journal of Mechanical and Industrial Engineering JJMIE Jordan Journal of Mechanical and Industrial Engineering Volume, Number, Jun. 8 ISSN 995-6665 Pages 7-75 Efficiency of Atkinson Engine at Maximum Power Density using emerature Deendent Secific Heats

More information

1 Extremum Estimators

1 Extremum Estimators FINC 9311-21 Financial Econometrics Handout Jialin Yu 1 Extremum Estimators Let θ 0 be a vector of k 1 unknown arameters. Extremum estimators: estimators obtained by maximizing or minimizing some objective

More information

Monopolist s mark-up and the elasticity of substitution

Monopolist s mark-up and the elasticity of substitution Croatian Oerational Research Review 377 CRORR 8(7), 377 39 Monoolist s mark-u and the elasticity of substitution Ilko Vrankić, Mira Kran, and Tomislav Herceg Deartment of Economic Theory, Faculty of Economics

More information

One-way ANOVA Inference for one-way ANOVA

One-way ANOVA Inference for one-way ANOVA One-way ANOVA Inference for one-way ANOVA IPS Chater 12.1 2009 W.H. Freeman and Comany Objectives (IPS Chater 12.1) Inference for one-way ANOVA Comaring means The two-samle t statistic An overview of ANOVA

More information

Distributed K-means over Compressed Binary Data

Distributed K-means over Compressed Binary Data 1 Distributed K-means over Comressed Binary Data Elsa DUPRAZ Telecom Bretagne; UMR CNRS 6285 Lab-STICC, Brest, France arxiv:1701.03403v1 [cs.it] 12 Jan 2017 Abstract We consider a networ of binary-valued

More information

On a Markov Game with Incomplete Information

On a Markov Game with Incomplete Information On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information

More information

Research Note REGRESSION ANALYSIS IN MARKOV CHAIN * A. Y. ALAMUTI AND M. R. MESHKANI **

Research Note REGRESSION ANALYSIS IN MARKOV CHAIN * A. Y. ALAMUTI AND M. R. MESHKANI ** Iranian Journal of Science & Technology, Transaction A, Vol 3, No A3 Printed in The Islamic Reublic of Iran, 26 Shiraz University Research Note REGRESSION ANALYSIS IN MARKOV HAIN * A Y ALAMUTI AND M R

More information

Principal Components Analysis and Unsupervised Hebbian Learning

Principal Components Analysis and Unsupervised Hebbian Learning Princial Comonents Analysis and Unsuervised Hebbian Learning Robert Jacobs Deartment of Brain & Cognitive Sciences University of Rochester Rochester, NY 1467, USA August 8, 008 Reference: Much of the material

More information

Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doped Fiber Amplifier

Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doped Fiber Amplifier Australian Journal of Basic and Alied Sciences, 5(12): 2010-2020, 2011 ISSN 1991-8178 Factors Effect on the Saturation Parameter S and there Influences on the Gain Behavior of Ytterbium Doed Fiber Amlifier

More information

The non-stochastic multi-armed bandit problem

The non-stochastic multi-armed bandit problem Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at

More information

Brownian Motion and Random Prime Factorization

Brownian Motion and Random Prime Factorization Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........

More information

The decision-feedback equalizer optimization for Gaussian noise

The decision-feedback equalizer optimization for Gaussian noise Journal of Theoretical and Alied Comuter Science Vol. 8 No. 4 4. 5- ISSN 99-634 (rinted 3-5653 (online htt://www.jtacs.org The decision-feedback eualizer otimization for Gaussian noise Arkadiusz Grzbowski

More information

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem

An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem An Ant Colony Otimization Aroach to the Probabilistic Traveling Salesman Problem Leonora Bianchi 1, Luca Maria Gambardella 1, and Marco Dorigo 2 1 IDSIA, Strada Cantonale Galleria 2, CH-6928 Manno, Switzerland

More information

Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process

Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process Using the Divergence Information Criterion for the Determination of the Order of an Autoregressive Process P. Mantalos a1, K. Mattheou b, A. Karagrigoriou b a.deartment of Statistics University of Lund

More information

Periodic scheduling 05/06/

Periodic scheduling 05/06/ Periodic scheduling T T or eriodic scheduling, the best that we can do is to design an algorithm which will always find a schedule if one exists. A scheduler is defined to be otimal iff it will find a

More information

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables

Improved Bounds on Bell Numbers and on Moments of Sums of Random Variables Imroved Bounds on Bell Numbers and on Moments of Sums of Random Variables Daniel Berend Tamir Tassa Abstract We rovide bounds for moments of sums of sequences of indeendent random variables. Concentrating

More information

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding

Homework Set #3 Rates definitions, Channel Coding, Source-Channel coding Homework Set # Rates definitions, Channel Coding, Source-Channel coding. Rates (a) Channels coding Rate: Assuming you are sending 4 different messages using usages of a channel. What is the rate (in bits

More information

Finding a sparse vector in a subspace: linear sparsity using alternating directions

Finding a sparse vector in a subspace: linear sparsity using alternating directions IEEE TRANSACTION ON INFORMATION THEORY VOL XX NO XX 06 Finding a sarse vector in a subsace: linear sarsity using alternating directions Qing Qu Student Member IEEE Ju Sun Student Member IEEE and John Wright

More information

Chapter 3. GMM: Selected Topics

Chapter 3. GMM: Selected Topics Chater 3. GMM: Selected oics Contents Otimal Instruments. he issue of interest..............................2 Otimal Instruments under the i:i:d: assumtion..............2. he basic result............................2.2

More information

The analysis and representation of random signals

The analysis and representation of random signals The analysis and reresentation of random signals Bruno TOÉSNI Bruno.Torresani@cmi.univ-mrs.fr B. Torrésani LTP Université de Provence.1/30 Outline 1. andom signals Introduction The Karhunen-Loève Basis

More information

BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO

BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO BEST POSSIBLE DENSITIES OF DICKSON m-tuples, AS A CONSEQUENCE OF ZHANG-MAYNARD-TAO ANDREW GRANVILLE, DANIEL M. KANE, DIMITRIS KOUKOULOPOULOS, AND ROBERT J. LEMKE OLIVER Abstract. We determine for what

More information

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model

Shadow Computing: An Energy-Aware Fault Tolerant Computing Model Shadow Comuting: An Energy-Aware Fault Tolerant Comuting Model Bryan Mills, Taieb Znati, Rami Melhem Deartment of Comuter Science University of Pittsburgh (bmills, znati, melhem)@cs.itt.edu Index Terms

More information

A Recursive Block Incomplete Factorization. Preconditioner for Adaptive Filtering Problem

A Recursive Block Incomplete Factorization. Preconditioner for Adaptive Filtering Problem Alied Mathematical Sciences, Vol. 7, 03, no. 63, 3-3 HIKARI Ltd, www.m-hiari.com A Recursive Bloc Incomlete Factorization Preconditioner for Adative Filtering Problem Shazia Javed School of Mathematical

More information

Metrics Performance Evaluation: Application to Face Recognition

Metrics Performance Evaluation: Application to Face Recognition Metrics Performance Evaluation: Alication to Face Recognition Naser Zaeri, Abeer AlSadeq, and Abdallah Cherri Electrical Engineering Det., Kuwait University, P.O. Box 5969, Safat 6, Kuwait {zaery, abeer,

More information

On Wald-Type Optimal Stopping for Brownian Motion

On Wald-Type Optimal Stopping for Brownian Motion J Al Probab Vol 34, No 1, 1997, (66-73) Prerint Ser No 1, 1994, Math Inst Aarhus On Wald-Tye Otimal Stoing for Brownian Motion S RAVRSN and PSKIR The solution is resented to all otimal stoing roblems of

More information

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES

RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES RANDOM WALKS AND PERCOLATION: AN ANALYSIS OF CURRENT RESEARCH ON MODELING NATURAL PROCESSES AARON ZWIEBACH Abstract. In this aer we will analyze research that has been recently done in the field of discrete

More information

Availability and Maintainability. Piero Baraldi

Availability and Maintainability. Piero Baraldi Availability and Maintainability 1 Introduction: reliability and availability System tyes Non maintained systems: they cannot be reaired after a failure (a telecommunication satellite, a F1 engine, a vessel

More information

Session 5: Review of Classical Astrodynamics

Session 5: Review of Classical Astrodynamics Session 5: Review of Classical Astrodynamics In revious lectures we described in detail the rocess to find the otimal secific imulse for a articular situation. Among the mission requirements that serve

More information

Randomly Weighted Series of Contractions in Hilbert Spaces

Randomly Weighted Series of Contractions in Hilbert Spaces Math. Scand. Vol. 79, o. 2, 996, (263-282) Prerint Ser. o. 5, 994, Math. Inst. Aarhus. Introduction Randomly Weighted Series of Contractions in Hilbert Saces G. PESKIR, D. SCHEIDER, M. WEBER Conditions

More information

Uncertainty Modeling with Interval Type-2 Fuzzy Logic Systems in Mobile Robotics

Uncertainty Modeling with Interval Type-2 Fuzzy Logic Systems in Mobile Robotics Uncertainty Modeling with Interval Tye-2 Fuzzy Logic Systems in Mobile Robotics Ondrej Linda, Student Member, IEEE, Milos Manic, Senior Member, IEEE bstract Interval Tye-2 Fuzzy Logic Systems (IT2 FLSs)

More information

Estimating function analysis for a class of Tweedie regression models

Estimating function analysis for a class of Tweedie regression models Title Estimating function analysis for a class of Tweedie regression models Author Wagner Hugo Bonat Deartamento de Estatística - DEST, Laboratório de Estatística e Geoinformação - LEG, Universidade Federal

More information

FINITE TIME THERMODYNAMIC MODELING AND ANALYSIS FOR AN IRREVERSIBLE ATKINSON CYCLE. By Yanlin GE, Lingen CHEN, and Fengrui SUN

FINITE TIME THERMODYNAMIC MODELING AND ANALYSIS FOR AN IRREVERSIBLE ATKINSON CYCLE. By Yanlin GE, Lingen CHEN, and Fengrui SUN FINIE IME HERMODYNAMIC MODELING AND ANALYSIS FOR AN IRREVERSIBLE AKINSON CYCLE By Yanlin GE, Lingen CHEN, and Fengrui SUN Performance of an air-standard Atkinson cycle is analyzed by using finite-time

More information

Beyond Worst-Case Reconstruction in Deterministic Compressed Sensing

Beyond Worst-Case Reconstruction in Deterministic Compressed Sensing Beyond Worst-Case Reconstruction in Deterministic Comressed Sensing Sina Jafarour, ember, IEEE, arco F Duarte, ember, IEEE, and Robert Calderbank, Fellow, IEEE Abstract The role of random measurement in

More information

Feedback-error control

Feedback-error control Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller

More information

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1)

1. INTRODUCTION. Fn 2 = F j F j+1 (1.1) CERTAIN CLASSES OF FINITE SUMS THAT INVOLVE GENERALIZED FIBONACCI AND LUCAS NUMBERS The beautiful identity R.S. Melham Deartment of Mathematical Sciences, University of Technology, Sydney PO Box 23, Broadway,

More information

Some Results on the Generalized Gaussian Distribution

Some Results on the Generalized Gaussian Distribution Some Results on the Generalized Gaussian Distribution Alex Dytso, Ronit Bustin, H. Vincent Poor, Daniela Tuninetti 3, Natasha Devroye 3, and Shlomo Shamai (Shitz) Abstract The aer considers information-theoretic

More information

3.4 Design Methods for Fractional Delay Allpass Filters

3.4 Design Methods for Fractional Delay Allpass Filters Chater 3. Fractional Delay Filters 15 3.4 Design Methods for Fractional Delay Allass Filters Above we have studied the design of FIR filters for fractional delay aroximation. ow we show how recursive or

More information

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III

AI*IA 2003 Fusion of Multiple Pattern Classifiers PART III AI*IA 23 Fusion of Multile Pattern Classifiers PART III AI*IA 23 Tutorial on Fusion of Multile Pattern Classifiers by F. Roli 49 Methods for fusing multile classifiers Methods for fusing multile classifiers

More information

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK

Towards understanding the Lorenz curve using the Uniform distribution. Chris J. Stephens. Newcastle City Council, Newcastle upon Tyne, UK Towards understanding the Lorenz curve using the Uniform distribution Chris J. Stehens Newcastle City Council, Newcastle uon Tyne, UK (For the Gini-Lorenz Conference, University of Siena, Italy, May 2005)

More information

Multivariable Generalized Predictive Scheme for Gas Turbine Control in Combined Cycle Power Plant

Multivariable Generalized Predictive Scheme for Gas Turbine Control in Combined Cycle Power Plant Multivariable Generalized Predictive Scheme for Gas urbine Control in Combined Cycle Power Plant L.X.Niu and X.J.Liu Deartment of Automation North China Electric Power University Beiing, China, 006 e-mail

More information

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS

ON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS #A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,

More information

Dynamic-Priority Scheduling. CSCE 990: Real-Time Systems. Steve Goddard. Dynamic-priority Scheduling

Dynamic-Priority Scheduling. CSCE 990: Real-Time Systems. Steve Goddard. Dynamic-priority Scheduling CSCE 990: Real-Time Systems Dynamic-Priority Scheduling Steve Goddard goddard@cse.unl.edu htt://www.cse.unl.edu/~goddard/courses/realtimesystems Dynamic-riority Scheduling Real-Time Systems Dynamic-Priority

More information

Research Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces

Research Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and

More information

On generalizing happy numbers to fractional base number systems

On generalizing happy numbers to fractional base number systems On generalizing hay numbers to fractional base number systems Enriue Treviño, Mikita Zhylinski October 17, 018 Abstract Let n be a ositive integer and S (n) be the sum of the suares of its digits. It is

More information