Solution Set #1
|
|
- Derek Goodman
- 5 years ago
- Views:
Transcription
1 Soluton Set #. Fnd epressons and setch the results of the followng operatons: (a) COMB RECT The spacng of the elements of the COMB functon matches the wdth of the rectangle; we can do ths n ether doman easly, but I ll to the frequency doman frst: n n o n F COMB RECT F COMB F RECT o o COMB [ ] SINC [ ]! () δ [ ] SINC [ ] COMB RECT () () () () () + + µ δ δ () 0 () δ [] F {() δ []} [] SINC [ ] SINC [ ] SINC [ ] SINC SINC [] (unts of delta ) g [] (red sold) and f [] SINC (blue dashed), showng the the nput IS recovered correctly.
2 (b) COMB TRI F n COMB TRI o COMB TRI F n n COMB F TRI o o COMB [ ] SINC [ ]! () δ [ ] SINC [ ] () () () () () + + µ δ δ () 0 () δ [] F {() δ []} [] SINC [ ] SINC [ ] SINC [ ] SINC SINC [] (unts of delta ) g [] (red sold) and f [] SINC (blue dashed), showng the the nput IS recovered correctly.
3 (c) COMB SINC F n COMB SINC o COMB RECT n n F COMB F SINC o o COMB [ ] RECT [ ]! () δ [ ] RECT [ ] () () () () () + + µ δ δ () 0 () δ [] F {() δ []} [] RECT [ ] RECT [ ] RECT [ ] RECT RECT [] (unts of delta ) g [] (red sold) and f [] SINC (blue dashed), showng the the nput IS recovered correctly. 3
4 (d) COMB SINC n F COMB SINC h o COMB SINC h n n F COMB F SINC o h o COMB [ ] TRI[ ]! () δ [ ] TRI[ ] () () () () () + + µ δ δ () 0 () δ [] F {() δ []} [] TRI[ ] TRI[ ] TRI[ ] TRI TRI[] (unts of delta ) g [] (red sold) and f [] SINC (blue dashed), showng the the nput IS recovered correctly. 4
5 . For s [] COMB [], h [] SINC [], andf n [] SINC (n,, 3), fnd the forms of and n setch the three functons g n [] (f n [] s []) h [] Soluton: (straght off of the fnal eam) ³ h g [] (f [] s []) h [] SINC COMB [] SINC [] SINC [] COMB [] SINC [] + n + n δ [ n] SINC [n] δ [ n] + n SINC [] δ [ n] + SINC [ ] δ [ ( )] + SINC [0] δ [ 0] + SINC [+] δ [ (+)] + δ [] g [] (f [] s []) h [] δ [] SINC [] SINC [] g [] SINC [] 6 SINC [] f [] y g [] (red sold) and f [] SINC [] (blue dashed), showng the the nput s not recovered correctly. ³ h g [] (f [] s []) h [] SINC h SINC + COMB [] + n n SINC h n COMB [] SINC [] SINC δ [ n] δ [ n] + SINC δ [ ( )] + SINC [0] δ [ 0] + SINC + + n h! SINC n δ [ n] SINC [] δ [ (+)] + 5
6 whch sn t much help, so let s evaluate n the frequency doman Setch them: G [] (F {f []} F {s []}) F {h []} (F [] S []) H [] n h F [] F {f []} F SINC o TRI[] TRI S [] F {s []} F {COMB []} COMB [] H [] F {h []} RECT [] µ G [] TRI COMB [] RECT [] h (a) F [] S [] TRI (F [] S []) RECT [] TRI COMB [], (b)rect [] (blue) and n o (red); (c) F TRI h h SINC whch shows that G [] TRI g [] SINC f [] y g [] (red sold) and f [] SINC (blue dashed), showng the the nput IS recovered correctly. 6
7 Graph t: ³ h g 3 [] (f 3 [] s []) h [] SINC 3 F 3 [] F {f 3 []} 3 TRI[3] 3 TRI S [] F {COMB []} COMB [] " # F 3 [] COMB [] 3 TRI COMB [] 3 COMB [] " # 3 SINC [] F 3 [] S [] (red) and (F 3 [] S []) H [] (blue) From the graph, we see that the transfer functon cuts out the central replca of the trangle from the sawtooth spectrum. Thus the mage g 3 [] s: g 3 [] SINC f 3 [] 3 y g [] (red sold) and f 3 [] SINC 3 (blue dashed), showng the the nput IS recovered correctly. Note that f [] and f 3 [] were correctly maged by the system, but that f [] s not. 7
8 3. A samplng functon s [] s used to sample a sgnal f [] as follows: f s [] f [] s []. Thesampled functon f s [] s then passed through a lnear shft-nvarant system wth transfer functon H [] to produce an output g []. For: f [] SINC [00] s [] s COMB [ s ] H [] RECT (a) Fnd the mnmum samplng rate Nyqust (Nyqust rate) that wll permt eact recovery of f [] from f s [];.e., such that g [] α f [] (α s a constant). F [] F SINC [00] ª 00 TRI 00 ma 00 cycles unt Nyqust ma 00 cycles unt s F s [] F{f [] SAMP []} 00 TRI COMB 00 s 00 TRI COMB G s [] F s [] H [] µ 00 TRI TRI 00 g s [] SINC [00] (b) Fnd g [] when s Nyqust,andsetch. COMB 00 δ [] 00 TRI s Nyqust 00 cycles unt f s [] SINC [00] (00 COMB [00]) F s [] 00 TRI 00 COMB 00 TRI as seen n graph + n TRI δ [ 00n] RECT s n + n δ 00 n 00n TRI [] 00 8
9 G s [] [] RECT RECT h g s [] 00SINC [00] 00 SINC 00 9
10 4. As n the prevous problem, f s [] f [] s []. Wth: f [] SINC [0] s [] (RECT [] s COMB [ s ]) RECT [00] H [] RECT s (a) Fnd g [] f s s chosen to be the usual Nyqust rate assocated wth a COMB samplng functon of nfnte etent. Soluton: Ths problem s meant to llustrate the dffculty wth the Gasll epresson for realstc samplng. What does t mean to Frst calculate the epressons n the frequency doman: F{f []} F [] 0 RECT Nyqust 0 cycles ³ s [] RECT 0 COMB [0] 5 µ S [] F{s []} 5 SINC [5] COMB 0 unt RECT [00] SINC F [] S [] µµ 0 RECT 5 SINC [5] COMB SINC The last SINC functon 00 SINC s wde compared to the other functons 00 µ µ F [] S [] ' 0 RECT 5SINC [5] COMB SINC 00 µ 0 RECT COMB 5SINC [5] SINC 00 µ 0 RECT COMB 5SINC [5] SINC 00 µ ' 0 RECT COMB SINC 00 The narrow SINC functon creates rpple n the convoluton, but of small ampltude: G [] (F [] F{SAMP []}) H [] µµ ' 0 RECT COMB SINC RECT 00 0 ' 0 RECT RECT RECT 0 ½ ¾ g [] 'F 0 RECT SINC [0] SINC 0 0, but somewhat smoother because the ampltude near ' 5 s somewhat attenuated (b) Fnd g [] f s s chosen to be twce the Nyqust rate determned n part a. s Nyqust 0 cycles unt F [] S [] µµ 0 RECT 5SINC [5] COMB 0 µ ' 0 RECT COMB SINC 00 µ ' 0 RECT COMB SINC 00 G [] g [] agan wll closely reproduce f [] 0 0 RECT SINC 00 0
11 (c) What parameter changes wll mprove sgnal recovery? Sgnal recovery s enhanced by ncreasng the wdth of RECT 5 h and decreasng the wdth of RECT 00 n s [] (d) Can f [] ever be recovered eactly n ths case? NO!
12 5. Consder the followng sequence of operatons appled to the nput functon f []: g [] ((f [] p []) s []) h [] f [] SINC [0] p [] 00 RECT [00] s [] RECT 5 s COMB [ s ] H [] RECT s (a) Fnd g [] f s s the usual Nyqust rate for deal samplng wth a COMB functon of nfnte etent. f [] SINC [0] F [] 0 RECT cycles 0 ma 5 unt length p [] 00 RECT [00] P [] SINC p [] blurs f [] slghtly 00 s [] RECT 5 s COMB [ s ] S [] 5 SINC [5] COMB s H [] RECT h [] SINC s s s NY Q cycles ma NY Q 0 unt length ma 0 unt G [] ((F [] P []) S []) H [] µµ 0 RECT SINC (5 SINC [5]) COMB RECT µµ 0 RECT [] (5 SINC [5]) COMB RECT 0 0 0!! + 0 RECT (5 SINC [5]) 0 δ [ 0 ] RECT 0 0!! RECT (5 SINC [5]) δ [ 0 ] RECT RECT SINC [5] 0 s 0 f [] p [] SINC [0] 00 RECT [00] SINC [0] wth slght blurrng g [] 50 SINC [0] 5 RECT 0 SINC [0] RECT 5 5 (b) Fnd g [] f s s twce the rate used n part (a). cycles ma ma 5 unt length cycles NY Q 0 unt length 0 unt
13 µµ G [] 0 RECT SINC (5 SINC [5]) COMB !! 0 RECT (5 SINC [5]) δ [ 0 ] RECT 0 0 RECT (5 SINC [5]) 0 g [] 0 SINC [0] RECT (wndowedsincfuncton) 5 RECT 0 0 (c) What parameter changes wll mprove the fdelty of g [] compared to f []? ncrease s,maep[] narrower whle retanng unt area (d) Do choces of the parameters est that allow f [] to be recovered eactly? fnte support of s [] and nfnte support of f [] g [] s always alased, so cannot be recovered eactly. 3
IMGS-261 Solutions to Homework #9
IMGS-6 Solutons to Homework #9. For f [] SINC [] sn[π], use the modulaton theorem to evaluate and sketch π the Fourer transform of f [] f [] f [] (f []) Soluton: We know that F{RECT []} SINC [] so we use
More informationSIMG Solution Set #5
SIMG-77-005 Soluton Set #5. For each of the transfer functons, sketch H n [ξ] and evaluate and sketch the correspondng mpulse response h n []. Also classfy the flters as lowpass, hghpass, phase, etc. (a)
More informationThe Fourier Transform
e Processng ourer Transform D The ourer Transform Effcent Data epresentaton Dscrete ourer Transform - D Contnuous ourer Transform - D Eamples + + + Jean Baptste Joseph ourer Effcent Data epresentaton Data
More informationMath1110 (Spring 2009) Prelim 3 - Solutions
Math 1110 (Sprng 2009) Solutons to Prelm 3 (04/21/2009) 1 Queston 1. (16 ponts) Short answer. Math1110 (Sprng 2009) Prelm 3 - Solutons x a 1 (a) (4 ponts) Please evaluate lm, where a and b are postve numbers.
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationChapter 5. Solution of System of Linear Equations. Module No. 6. Solution of Inconsistent and Ill Conditioned Systems
Numercal Analyss by Dr. Anta Pal Assstant Professor Department of Mathematcs Natonal Insttute of Technology Durgapur Durgapur-713209 emal: anta.bue@gmal.com 1 . Chapter 5 Soluton of System of Lnear Equatons
More informationMaximal Margin Classifier
CS81B/Stat41B: Advanced Topcs n Learnng & Decson Makng Mamal Margn Classfer Lecturer: Mchael Jordan Scrbes: Jana van Greunen Corrected verson - /1/004 1 References/Recommended Readng 1.1 Webstes www.kernel-machnes.org
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationGrover s Algorithm + Quantum Zeno Effect + Vaidman
Grover s Algorthm + Quantum Zeno Effect + Vadman CS 294-2 Bomb 10/12/04 Fall 2004 Lecture 11 Grover s algorthm Recall that Grover s algorthm for searchng over a space of sze wors as follows: consder the
More informationComplex Numbers, Signals, and Circuits
Complex Numbers, Sgnals, and Crcuts 3 August, 009 Complex Numbers: a Revew Suppose we have a complex number z = x jy. To convert to polar form, we need to know the magntude of z and the phase of z. z =
More informationFor all questions, answer choice E) NOTA" means none of the above answers is correct.
0 MA Natonal Conventon For all questons, answer choce " means none of the above answers s correct.. In calculus, one learns of functon representatons that are nfnte seres called power 3 4 5 seres. For
More informationQuadratic speedup for unstructured search - Grover s Al-
Quadratc speedup for unstructured search - Grover s Al- CS 94- gorthm /8/07 Sprng 007 Lecture 11 001 Unstructured Search Here s the problem: You are gven a boolean functon f : {1,,} {0,1}, and are promsed
More informationCopyright 2004 by Oxford University Press, Inc.
JT as an Amplfer &a Swtch, Large Sgnal Operaton, Graphcal Analyss, JT at D, asng JT, Small Sgnal Operaton Model, Hybrd P-Model, TModel. Lecture # 7 1 Drecton of urrent Flow & Operaton for Amplfer Applcaton
More informationFE REVIEW OPERATIONAL AMPLIFIERS (OP-AMPS)( ) 8/25/2010
FE REVEW OPERATONAL AMPLFERS (OP-AMPS)( ) 1 The Op-amp 2 An op-amp has two nputs and one output. Note the op-amp below. The termnal labeled l wth the (-) sgn s the nvertng nput and the nput labeled wth
More information8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 493 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces you have studed thus far n the text are real vector spaces because the scalars
More informationThe Fundamental Theorem of Algebra. Objective To use the Fundamental Theorem of Algebra to solve polynomial equations with complex solutions
5-6 The Fundamental Theorem of Algebra Content Standards N.CN.7 Solve quadratc equatons wth real coeffcents that have comple solutons. N.CN.8 Etend polnomal denttes to the comple numbers. Also N.CN.9,
More information% & 5.3 PRACTICAL APPLICATIONS. Given system, (49) , determine the Boolean Function, , in such a way that we always have expression: " Y1 = Y2
5.3 PRACTICAL APPLICATIONS st EXAMPLE: Gven system, (49) & K K Y XvX 3 ( 2 & X ), determne the Boolean Functon, Y2 X2 & X 3 v X " X3 (X2,X)", n such a way that we always have expresson: " Y Y2 " (50).
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More information), it produces a response (output function g (x)
Lnear Systems Revew Notes adapted from notes by Mchael Braun Typcally n electrcal engneerng, one s concerned wth functons of tme, such as a voltage waveform System descrpton s therefore defned n the domans
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationAPPENDIX A Some Linear Algebra
APPENDIX A Some Lnear Algebra The collecton of m, n matrces A.1 Matrces a 1,1,..., a 1,n A = a m,1,..., a m,n wth real elements a,j s denoted by R m,n. If n = 1 then A s called a column vector. Smlarly,
More informationCHAPTER-5 INFORMATION MEASURE OF FUZZY MATRIX AND FUZZY BINARY RELATION
CAPTER- INFORMATION MEASURE OF FUZZY MATRI AN FUZZY BINARY RELATION Introducton The basc concept of the fuzz matr theor s ver smple and can be appled to socal and natural stuatons A branch of fuzz matr
More informationStanford University CS359G: Graph Partitioning and Expanders Handout 4 Luca Trevisan January 13, 2011
Stanford Unversty CS359G: Graph Parttonng and Expanders Handout 4 Luca Trevsan January 3, 0 Lecture 4 In whch we prove the dffcult drecton of Cheeger s nequalty. As n the past lectures, consder an undrected
More informationChapter Newton s Method
Chapter 9. Newton s Method After readng ths chapter, you should be able to:. Understand how Newton s method s dfferent from the Golden Secton Search method. Understand how Newton s method works 3. Solve
More informationn α j x j = 0 j=1 has a nontrivial solution. Here A is the n k matrix whose jth column is the vector for all t j=0
MODULE 2 Topcs: Lnear ndependence, bass and dmenson We have seen that f n a set of vectors one vector s a lnear combnaton of the remanng vectors n the set then the span of the set s unchanged f that vector
More informationSome modelling aspects for the Matlab implementation of MMA
Some modellng aspects for the Matlab mplementaton of MMA Krster Svanberg krlle@math.kth.se Optmzaton and Systems Theory Department of Mathematcs KTH, SE 10044 Stockholm September 2004 1. Consdered optmzaton
More informationNumerical Algorithms for Visual Computing 2008/09 Example Solutions for Assignment 4. Problem 1 (Shift invariance of the Laplace operator)
Numercal Algorthms for Vsual Computng 008/09 Example Solutons for Assgnment 4 Problem (Shft nvarance of the Laplace operator The Laplace equaton s shft nvarant,.e., nvarant under translatons x x + a, y
More informationModule 2. Random Processes. Version 2 ECE IIT, Kharagpur
Module Random Processes Lesson 6 Functons of Random Varables After readng ths lesson, ou wll learn about cdf of functon of a random varable. Formula for determnng the pdf of a random varable. Let, X be
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationLECTURE V. 1. More on the Chinese Remainder Theorem We begin by recalling this theorem, proven in the preceeding lecture.
LECTURE V EDWIN SPARK 1. More on the Chnese Remander Theorem We begn by recallng ths theorem, proven n the preceedng lecture. Theorem 1.1 (Chnese Remander Theorem). Let R be a rng wth deals I 1, I 2,...,
More informationExercises. 18 Algorithms
18 Algorthms Exercses 0.1. In each of the followng stuatons, ndcate whether f = O(g), or f = Ω(g), or both (n whch case f = Θ(g)). f(n) g(n) (a) n 100 n 200 (b) n 1/2 n 2/3 (c) 100n + log n n + (log n)
More informationEEL 6266 Power System Operation and Control. Chapter 3 Economic Dispatch Using Dynamic Programming
EEL 6266 Power System Operaton and Control Chapter 3 Economc Dspatch Usng Dynamc Programmng Pecewse Lnear Cost Functons Common practce many utltes prefer to represent ther generator cost functons as sngle-
More informationExercise Solutions to Real Analysis
xercse Solutons to Real Analyss Note: References refer to H. L. Royden, Real Analyss xersze 1. Gven any set A any ɛ > 0, there s an open set O such that A O m O m A + ɛ. Soluton 1. If m A =, then there
More informationCopyright 2017 by Taylor Enterprises, Inc., All Rights Reserved. Adjusted Control Limits for P Charts. Dr. Wayne A. Taylor
Taylor Enterprses, Inc. Control Lmts for P Charts Copyrght 2017 by Taylor Enterprses, Inc., All Rghts Reserved. Control Lmts for P Charts Dr. Wayne A. Taylor Abstract: P charts are used for count data
More informationOne-sided finite-difference approximations suitable for use with Richardson extrapolation
Journal of Computatonal Physcs 219 (2006) 13 20 Short note One-sded fnte-dfference approxmatons sutable for use wth Rchardson extrapolaton Kumar Rahul, S.N. Bhattacharyya * Department of Mechancal Engneerng,
More informationACTM State Calculus Competition Saturday April 30, 2011
ACTM State Calculus Competton Saturday Aprl 30, 2011 ACTM State Calculus Competton Sprng 2011 Page 1 Instructons: For questons 1 through 25, mark the best answer choce on the answer sheet provde Afterward
More informationDifferentiating Gaussian Processes
Dfferentatng Gaussan Processes Andrew McHutchon Aprl 17, 013 1 Frst Order Dervatve of the Posteror Mean The posteror mean of a GP s gven by, f = x, X KX, X 1 y x, X α 1 Only the x, X term depends on the
More informationIntroduction to Density Functional Theory. Jeremie Zaffran 2 nd year-msc. (Nanochemistry)
Introducton to Densty Functonal Theory Jereme Zaffran nd year-msc. (anochemstry) A- Hartree appromatons Born- Oppenhemer appromaton H H H e The goal of computatonal chemstry H e??? Let s remnd H e T e
More informationTHE CHINESE REMAINDER THEOREM. We should thank the Chinese for their wonderful remainder theorem. Glenn Stevens
THE CHINESE REMAINDER THEOREM KEITH CONRAD We should thank the Chnese for ther wonderful remander theorem. Glenn Stevens 1. Introducton The Chnese remander theorem says we can unquely solve any par of
More information= z 20 z n. (k 20) + 4 z k = 4
Problem Set #7 solutons 7.2.. (a Fnd the coeffcent of z k n (z + z 5 + z 6 + z 7 + 5, k 20. We use the known seres expanson ( n+l ( z l l z n below: (z + z 5 + z 6 + z 7 + 5 (z 5 ( + z + z 2 + z + 5 5
More informationLectures - Week 4 Matrix norms, Conditioning, Vector Spaces, Linear Independence, Spanning sets and Basis, Null space and Range of a Matrix
Lectures - Week 4 Matrx norms, Condtonng, Vector Spaces, Lnear Independence, Spannng sets and Bass, Null space and Range of a Matrx Matrx Norms Now we turn to assocatng a number to each matrx. We could
More informationReport on Image warping
Report on Image warpng Xuan Ne, Dec. 20, 2004 Ths document summarzed the algorthms of our mage warpng soluton for further study, and there s a detaled descrpton about the mplementaton of these algorthms.
More informationNON-LINEAR CONVOLUTION: A NEW APPROACH FOR THE AURALIZATION OF DISTORTING SYSTEMS
NON-LINEAR CONVOLUTION: A NEW APPROAC FOR TE AURALIZATION OF DISTORTING SYSTEMS Angelo Farna, Alberto Belln and Enrco Armellon Industral Engneerng Dept., Unversty of Parma, Va delle Scenze 8/A Parma, 00
More informationFourier Transform. Additive noise. Fourier Tansform. I = S + N. Noise doesn t depend on signal. We ll consider:
Flterng Announcements HW2 wll be posted later today Constructng a mosac by warpng mages. CSE252A Lecture 10a Flterng Exampel: Smoothng by Averagng Kernel: (From Bll Freeman) m=2 I Kernel sze s m+1 by m+1
More informationWeek 2. This week, we covered operations on sets and cardinality.
Week 2 Ths week, we covered operatons on sets and cardnalty. Defnton 0.1 (Correspondence). A correspondence between two sets A and B s a set S contaned n A B = {(a, b) a A, b B}. A correspondence from
More information3.6 Limiting and Clamping Circuits
3/10/2008 secton_3_6_lmtng_and_clampng_crcuts 1/1 3.6 Lmtng and Clampng Crcuts Readng Assgnment: pp. 184-187 (.e., neglect secton 3.6.2) Another applcaton of juncton dodes Q: What s a lmter? A: A 2-port
More informationMultilayer Perceptron (MLP)
Multlayer Perceptron (MLP) Seungjn Cho Department of Computer Scence and Engneerng Pohang Unversty of Scence and Technology 77 Cheongam-ro, Nam-gu, Pohang 37673, Korea seungjn@postech.ac.kr 1 / 20 Outlne
More informationCHAPTER 13. Exercises. E13.1 The emitter current is given by the Shockley equation:
HPT 3 xercses 3. The emtter current s gen by the Shockley equaton: S exp VT For operaton wth, we hae exp >> S >>, and we can wrte VT S exp VT Solng for, we hae 3. 0 6ln 78.4 mv 0 0.784 5 4.86 V VT ln 4
More informationSampling Theory MODULE V LECTURE - 17 RATIO AND PRODUCT METHODS OF ESTIMATION
Samplng Theory MODULE V LECTURE - 7 RATIO AND PRODUCT METHODS OF ESTIMATION DR. SHALABH DEPARTMENT OF MATHEMATICS AND STATISTICS INDIAN INSTITUTE OF TECHNOLOG KANPUR Propertes of separate rato estmator:
More information2.3 Nilpotent endomorphisms
s a block dagonal matrx, wth A Mat dm U (C) In fact, we can assume that B = B 1 B k, wth B an ordered bass of U, and that A = [f U ] B, where f U : U U s the restrcton of f to U 40 23 Nlpotent endomorphsms
More informationarxiv:cs.cv/ Jun 2000
Correlaton over Decomposed Sgnals: A Non-Lnear Approach to Fast and Effectve Sequences Comparson Lucano da Fontoura Costa arxv:cs.cv/0006040 28 Jun 2000 Cybernetc Vson Research Group IFSC Unversty of São
More informationII. PASSIVE FILTERS. H(j ω) Pass. Stop
II. PASSIE FILTES Frequency-selectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called pass band). The ampltude of sgnals outsde ths range of frequences
More information= 1.23 m/s 2 [W] Required: t. Solution:!t = = 17 m/s [W]! m/s [W] (two extra digits carried) = 2.1 m/s [W]
Secton 1.3: Acceleraton Tutoral 1 Practce, page 24 1. Gven: 0 m/s; 15.0 m/s [S]; t 12.5 s Requred: Analyss: a av v t v f v t a v av f v t 15.0 m/s [S] 0 m/s 12.5 s 15.0 m/s [S] 12.5 s 1.20 m/s 2 [S] Statement:
More informationPolynomial Regression Models
LINEAR REGRESSION ANALYSIS MODULE XII Lecture - 6 Polynomal Regresson Models Dr. Shalabh Department of Mathematcs and Statstcs Indan Insttute of Technology Kanpur Test of sgnfcance To test the sgnfcance
More informationLecture Note 3. Eshelby s Inclusion II
ME340B Elastcty of Mcroscopc Structures Stanford Unversty Wnter 004 Lecture Note 3. Eshelby s Incluson II Chrs Wenberger and We Ca c All rghts reserved January 6, 004 Contents 1 Incluson energy n an nfnte
More informationErrors for Linear Systems
Errors for Lnear Systems When we solve a lnear system Ax b we often do not know A and b exactly, but have only approxmatons  and ˆb avalable. Then the best thng we can do s to solve ˆx ˆb exactly whch
More informationModule 14: THE INTEGRAL Exploring Calculus
Module 14: THE INTEGRAL Explorng Calculus Part I Approxmatons and the Defnte Integral It was known n the 1600s before the calculus was developed that the area of an rregularly shaped regon could be approxmated
More informationBallot Paths Avoiding Depth Zero Patterns
Ballot Paths Avodng Depth Zero Patterns Henrch Nederhausen and Shaun Sullvan Florda Atlantc Unversty, Boca Raton, Florda nederha@fauedu, ssull21@fauedu 1 Introducton In a paper by Sapounaks, Tasoulas,
More informationComplete subgraphs in multipartite graphs
Complete subgraphs n multpartte graphs FLORIAN PFENDER Unverstät Rostock, Insttut für Mathematk D-18057 Rostock, Germany Floran.Pfender@un-rostock.de Abstract Turán s Theorem states that every graph G
More informationA NEW DISCRETE WAVELET TRANSFORM
A NEW DISCRETE WAVELET TRANSFORM ALEXANDRU ISAR, DORINA ISAR Keywords: Dscrete wavelet, Best energy concentraton, Low SNR sgnals The Dscrete Wavelet Transform (DWT) has two parameters: the mother of wavelets
More informationGeometric drawings of K n with few crossings
Geometrc drawngs of K n wth few crossngs Bernardo M. Ábrego, Slva Fernández-Merchant Calforna State Unversty Northrdge {bernardo.abrego,slva.fernandez}@csun.edu ver 9 Abstract We gve a new upper bound
More informationSolutions to Selected Exercises
6 Solutons to Selected Eercses Chapter Secton.. a. f ( 0) b. Tons of garbage per week s produced by a cty wth a populaton of,000.. a. In 99 there are 0 ducks n the lake b. In 000 there are 0 ducks n the
More informationChapter 9: Statistical Inference and the Relationship between Two Variables
Chapter 9: Statstcal Inference and the Relatonshp between Two Varables Key Words The Regresson Model The Sample Regresson Equaton The Pearson Correlaton Coeffcent Learnng Outcomes After studyng ths chapter,
More informationSection 3.6 Complex Zeros
04 Chapter Secton 6 Comple Zeros When fndng the zeros of polynomals, at some pont you're faced wth the problem Whle there are clearly no real numbers that are solutons to ths equaton, leavng thngs there
More informationA 2D Bounded Linear Program (H,c) 2D Linear Programming
A 2D Bounded Lnear Program (H,c) h 3 v h 8 h 5 c h 4 h h 6 h 7 h 2 2D Lnear Programmng C s a polygonal regon, the ntersecton of n halfplanes. (H, c) s nfeasble, as C s empty. Feasble regon C s unbounded
More informationLecture 10: Euler s Equations for Multivariable
Lecture 0: Euler s Equatons for Multvarable Problems Let s say we re tryng to mnmze an ntegral of the form: {,,,,,, ; } J f y y y y y y d We can start by wrtng each of the y s as we dd before: y (, ) (
More information8.1 Arc Length. What is the length of a curve? How can we approximate it? We could do it following the pattern we ve used before
.1 Arc Length hat s the length of a curve? How can we approxmate t? e could do t followng the pattern we ve used before Use a sequence of ncreasngly short segments to approxmate the curve: As the segments
More information(b) i(t) for t 0. (c) υ 1 (t) and υ 2 (t) for t 0. Solution: υ 2 (0 ) = I 0 R 1 = = 10 V. υ 1 (0 ) = 0. (Given).
Problem 5.37 Pror to t =, capactor C 1 n the crcut of Fg. P5.37 was uncharged. For I = 5 ma, R 1 = 2 kω, = 5 kω, C 1 = 3 µf, and C 2 = 6 µf, determne: (a) The equvalent crcut nvolvng the capactors for
More informationComplex Numbers Alpha, Round 1 Test #123
Complex Numbers Alpha, Round Test #3. Wrte your 6-dgt ID# n the I.D. NUMBER grd, left-justfed, and bubble. Check that each column has only one number darkened.. In the EXAM NO. grd, wrte the 3-dgt Test
More informationDepartment of Electrical and Computer Engineering FEEDBACK AMPLIFIERS
Department o Electrcal and Computer Engneerng UNIT I EII FEEDBCK MPLIFIES porton the output sgnal s ed back to the nput o the ampler s called Feedback mpler. Feedback Concept: block dagram o an ampler
More information55:041 Electronic Circuits
55:04 Electronc Crcuts Feedback & Stablty Sectons of Chapter 2. Kruger Feedback & Stablty Confguraton of Feedback mplfer S o S ε S o ( S β S ) o Negate feedback S S o + β β s the feedback transfer functon
More informationA random variable is a function which associates a real number to each element of the sample space
Introducton to Random Varables Defnton of random varable Defnton of of random varable Dscrete and contnuous random varable Probablty blt functon Dstrbuton functon Densty functon Sometmes, t s not enough
More informationLinear Feature Engineering 11
Lnear Feature Engneerng 11 2 Least-Squares 2.1 Smple least-squares Consder the followng dataset. We have a bunch of nputs x and correspondng outputs y. The partcular values n ths dataset are x y 0.23 0.19
More informationNegative Binomial Regression
STATGRAPHICS Rev. 9/16/2013 Negatve Bnomal Regresson Summary... 1 Data Input... 3 Statstcal Model... 3 Analyss Summary... 4 Analyss Optons... 7 Plot of Ftted Model... 8 Observed Versus Predcted... 10 Predctons...
More informationGEO-SLOPE International Ltd, Calgary, Alberta, Canada Vibrating Beam
GEO-SLOPE Internatonal Ltd, Calgary, Alberta, Canada www.geo-slope.com Introducton Vbratng Beam Ths example looks at the dynamc response of a cantlever beam n response to a cyclc force at the free end.
More informationThe path of ants Dragos Crisan, Andrei Petridean, 11 th grade. Colegiul National "Emil Racovita", Cluj-Napoca
Ths artcle s wrtten by students. It may nclude omssons and mperfectons, whch were dentfed and reported as mnutely as possble by our revewers n the edtoral notes. The path of ants 07-08 Students names and
More informationThe Gaussian classifier. Nuno Vasconcelos ECE Department, UCSD
he Gaussan classfer Nuno Vasconcelos ECE Department, UCSD Bayesan decson theory recall that we have state of the world X observatons g decson functon L[g,y] loss of predctng y wth g Bayes decson rule s
More informationThe L(2, 1)-Labeling on -Product of Graphs
Annals of Pure and Appled Mathematcs Vol 0, No, 05, 9-39 ISSN: 79-087X (P, 79-0888(onlne Publshed on 7 Aprl 05 wwwresearchmathscorg Annals of The L(, -Labelng on -Product of Graphs P Pradhan and Kamesh
More information55:041 Electronic Circuits
55:04 Electronc Crcuts Feedback & Stablty Sectons of Chapter 2. Kruger Feedback & Stablty Confguraton of Feedback mplfer Negate feedback β s the feedback transfer functon S o S S o o S S o f S S S S fb
More information( ) 2 ( ) ( ) Problem Set 4 Suggested Solutions. Problem 1
Problem Set 4 Suggested Solutons Problem (A) The market demand functon s the soluton to the followng utlty-maxmzaton roblem (UMP): The Lagrangean: ( x, x, x ) = + max U x, x, x x x x st.. x + x + x y x,
More informationProblem Set 9 Solutions
Desgn and Analyss of Algorthms May 4, 2015 Massachusetts Insttute of Technology 6.046J/18.410J Profs. Erk Demane, Srn Devadas, and Nancy Lynch Problem Set 9 Solutons Problem Set 9 Solutons Ths problem
More informationProblem Do any of the following determine homomorphisms from GL n (C) to GL n (C)?
Homework 8 solutons. Problem 16.1. Whch of the followng defne homomomorphsms from C\{0} to C\{0}? Answer. a) f 1 : z z Yes, f 1 s a homomorphsm. We have that z s the complex conjugate of z. If z 1,z 2
More informationNotes prepared by Prof Mrs) M.J. Gholba Class M.Sc Part(I) Information Technology
Inverse transformatons Generaton of random observatons from gven dstrbutons Assume that random numbers,,, are readly avalable, where each tself s a random varable whch s unformly dstrbuted over the range(,).
More informationImprovement in Estimating the Population Mean Using Exponential Estimator in Simple Random Sampling
Bulletn of Statstcs & Economcs Autumn 009; Volume 3; Number A09; Bull. Stat. Econ. ISSN 0973-70; Copyrght 009 by BSE CESER Improvement n Estmatng the Populaton Mean Usng Eponental Estmator n Smple Random
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More informationU.C. Berkeley CS294: Beyond Worst-Case Analysis Luca Trevisan September 5, 2017
U.C. Berkeley CS94: Beyond Worst-Case Analyss Handout 4s Luca Trevsan September 5, 07 Summary of Lecture 4 In whch we ntroduce semdefnte programmng and apply t to Max Cut. Semdefnte Programmng Recall that
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationPhysics 4B. Question and 3 tie (clockwise), then 2 and 5 tie (zero), then 4 and 6 tie (counterclockwise) B i. ( T / s) = 1.74 V.
Physcs 4 Solutons to Chapter 3 HW Chapter 3: Questons:, 4, 1 Problems:, 15, 19, 7, 33, 41, 45, 54, 65 Queston 3-1 and 3 te (clockwse), then and 5 te (zero), then 4 and 6 te (counterclockwse) Queston 3-4
More information+ v i F02E2P2 I. Solution (a.) The small-signal transfer function of the stages can be written as, V out (s) V in (s) = g m1 /g m3.
ECE 6440 Summer 003 Page 1 Homework Assgnment No. 7 s Problem 1 (10 ponts) A fourstage rng oscllator used as the VCO n a PLL s shown. Assume that M1 and M are matched and M3 and M4 are matched. Also assume
More informationfind (x): given element x, return the canonical element of the set containing x;
COS 43 Sprng, 009 Dsjont Set Unon Problem: Mantan a collecton of dsjont sets. Two operatons: fnd the set contanng a gven element; unte two sets nto one (destructvely). Approach: Canoncal element method:
More information8.6 The Complex Number System
8.6 The Complex Number System Earler n the chapter, we mentoned that we cannot have a negatve under a square root, snce the square of any postve or negatve number s always postve. In ths secton we want
More informationNumerical Transient Heat Conduction Experiment
Numercal ransent Heat Conducton Experment OBJECIVE 1. o demonstrate the basc prncples of conducton heat transfer.. o show how the thermal conductvty of a sold can be measured. 3. o demonstrate the use
More informationEstimation of the composition of the liquid and vapor streams exiting a flash unit with a supercritical component
Department of Energ oltecnco d Mlano Va Lambruschn - 05 MILANO Eercses of Fundamentals of Chemcal rocesses rof. Ganpero Gropp Eercse 8 Estmaton of the composton of the lqud and vapor streams etng a unt
More informationEEE 241: Linear Systems
EEE : Lnear Systems Summary #: Backpropagaton BACKPROPAGATION The perceptron rule as well as the Wdrow Hoff learnng were desgned to tran sngle layer networks. They suffer from the same dsadvantage: they
More informationMath 426: Probability MWF 1pm, Gasson 310 Homework 4 Selected Solutions
Exercses from Ross, 3, : Math 26: Probablty MWF pm, Gasson 30 Homework Selected Solutons 3, p. 05 Problems 76, 86 3, p. 06 Theoretcal exercses 3, 6, p. 63 Problems 5, 0, 20, p. 69 Theoretcal exercses 2,
More informationWorkshop: Approximating energies and wave functions Quantum aspects of physical chemistry
Workshop: Approxmatng energes and wave functons Quantum aspects of physcal chemstry http://quantum.bu.edu/pltl/6/6.pdf Last updated Thursday, November 7, 25 7:9:5-5: Copyrght 25 Dan Dll (dan@bu.edu) Department
More informationLossy Compression. Compromise accuracy of reconstruction for increased compression.
Lossy Compresson Compromse accuracy of reconstructon for ncreased compresson. The reconstructon s usually vsbly ndstngushable from the orgnal mage. Typcally, one can get up to 0:1 compresson wth almost
More informationSolutions to Homework 7, Mathematics 1. 1 x. (arccos x) (arccos x) 1
Solutons to Homework 7, Mathematcs 1 Problem 1: a Prove that arccos 1 1 for 1, 1. b* Startng from the defnton of the dervatve, prove that arccos + 1, arccos 1. Hnt: For arccos arccos π + 1, the defnton
More informationMATH 567: Mathematical Techniques in Data Science Lab 8
1/14 MATH 567: Mathematcal Technques n Data Scence Lab 8 Domnque Gullot Departments of Mathematcal Scences Unversty of Delaware Aprl 11, 2017 Recall We have: a (2) 1 = f(w (1) 11 x 1 + W (1) 12 x 2 + W
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More information