MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008

Size: px
Start display at page:

Download "MATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008"

Transcription

1 MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o 147. Afer reading his maerial consruc a lab repor addressing each of he following quesions for cases 3, 4, 6, 8 of able 1.1 on page 147: 1 1. Given a logisics growh model wih consan harvesing, dp (1 d = kp p ) a, k, N, a R +. (1) N (a) Consruc a lis of variables and parameers associaed wih (3) and describe he meaning of each. (b) Analicall solve (3) using he mehods discussed in secion 1. of he ex. (c) Discuss qualiaive behavior of he soluions o (3) hrough he equaion s: i. Equilibrium Poins ii. Phase Line (d) Using Euler s mehod and a slope field diagram address he following quesion: For a = a 1, wha will happen o he fish populaion for various iniial condiions?. Given a logisics growh model wih periodic harvesing, dp (1 d = kp p ) a(1 + sin(b)), k, N, a, b R +. () N (a) In his case wha do he parameers a and b represen? (b) Is i possible o solve (3) using he mehods discussed in secion 1. of he ex? (c) Using Euler s mehod and a slope field diagram address he following quesions: i. For a = a 1 and b = 1 wha will happen o he fish populaion for various iniial condiions? ii. For a = a and b = 1 wha will happen o he fish populaion for various iniial condiions? Explain wh here are no equilibrium poins and hus no phase line for his problem. 3. Summar and conclusions. In a shor essa forma summarize our resuls from he previous quesions. Compare and conras each of he wo models. Be sure o jusif our conclusions b referencing our previous summar and analsis. 1 Your repor should be well organized and clearl presened. If seps are unclear hen include more seps or make annoaions clarifing he procedure and purpose. Be sure o label and ile an included graphs or ables of daa. 1

2 Lab Repor - Logisics Populaion Models wih Harvesing In he following we respond o quesions associaed wih Lab 1.3 of Differenial Equaions. This repor is organized ino hree secions. In he firs secion we address a logisics growh model equaion wih consan harvesing hrough quaniaive, qualiaive and numerical analses. A similar analsis is conduced on he logisics growh model wih periodic harvesing in he second secion. The hird secion will consis of a summar of resuls and repor of conclusions associaed wih a comparison of hese wo models. 1. Logisics Growh Wih Consan Harvesing (a) Variable and Parameer Lising: dp ( d = f 1(p) = kp 1 p ) a, k, N, a R +. (3) N i. k growh parameer : This parameer describes he rae of growh of he populaion p. ii. N carring capaci : This parameer describes he oal amoun of p ha he resources can suppor. iii. a harvesing rae : This parameer describes he rae ha p will be aken from he ssem. iv. p populaion : This dependen variable describes he populaion as a funcion of ime. v. ime : This independen variable parameerizes he evoluion of he populaion, p. (b) To solve his ODE analicall we noe ha (3) is auonomous and herefore separable. Appling separaion of variables o (3) gives he following: which implies, dp ( kp 1 p n ) a = d = + C, C R (4) = ( A + B ) dp p p 1 p p (5) = A ln p p 1 + B ln p p (6) = ln (p p 1 ) A (p p ) B, (7) (p p 1 ) A (p p ) B = Ce, (8) where p 1 and p are roos o he quadraic polnomial in p and A = (p 1 p ) 1, B = (p p 1 ) 1 are found b parial fracions. If we assume he iniial populaion p() = p is given hen we find ha C = (p p 1 ) A (p p ) B. I is no, in general, clear how we should solve for p explicil. To do his we would need values for N, k, a o find p 1 and p and hus A and B. If hese numbers were known hen polnomial roo finding would give explici formula for p. (c) We now address he qualiaive informaion ha is given b he differenial equaion iself. To do his we firs find he equilibrium soluions of (3) b solving, o ge he equilibrium soluions, dp (1 d = = kp p ) a p Np + an N k p 1 () = p () = N + N N 4 an k N 4 an k =, (9), (1), (11)

3 assuming ha kn 4a. Oherwise, p 1 = p. We also noe ha p is no phsical for N 4 an k > N or N 4 a k < and ha for phsicall relevan cases p 1() > p () for all. To classif hese equilibria we define p 1 = p + and p = p appl linearizaion o ge, ( df dp = k 1 p ) ± (1) p=p± N ( ) = k ± 1 4a, (13) kn which implies ha p 1 = p + is a sink and p = p is a source. Figure 1.1 shows he phase line for he ssem for kn 4a and he special case where p 1 = p. (d) The following able correlaes figures o parameer choices in able 1.1 page 147. Figure Label Figure Tpe Choice Fig. 1. Slope Fields 3 Fig. 1.3 Euler s Mehod 3 Fig. 1.4 Slope Fields 4 Fig. 1.5 Euler s Mehod 4 Fig. 1.6 Slope Fields 6 Fig. 1.7 Euler s Mehod 6 Fig. 1.8 Slope Fields 8 Fig. 1.9 Euler s Mehod 8 From hese figures we can conclude ha as we increase he harvesing parameer he rajecories change giving rise o deca for paricular iniial populaions. This is due o he fac ha as a increases he equilibrium soluions of he ssem ge closer ogeher. As hese equilibria ge closer ogeher he source, p, moves up he p-axis and consequenl decaing rajecories wih iniial populaions beween zero and p are creaed. From his we can also conclude ha as he wo equilibria ge closer and closer o each oher he amoun of rajecories, which grow in ime decreases. Thus i is possible o increase he harvesing parameer o a poin where here are no iniial populaions, which grow in ime. Moreover, i is possible harves o a poin where here are no iniial populaions whose rajecor is viable in he long-erm. Using his model for a biological ssem gives insigh ino how much one could harves wihou desroing he populaion in finie-ime. This can be seen mahemaicall hrough he phase line in figure Logisics Growh Wih Periodic Harvesing dp ( d = f (p, ) = kp 1 p ) a(1 + sin(b)), k, N, a, b R +. (14) N (a) In his case we have ha b is a parameer, which conrols he frequenc of he periodic harvesing and a represens he overall ampliude of he periodic harvesing. We noe ha in his case he harvesing can be as much as a and as lile as. (b) Noing f (p, ) h(p)g() implies ha (14) is no separable. There is no clear wa o solve his differenial equaion analicall. 3

4 (c) Though here are no clear analic soluions we can sill use qualiaive and numerical echniques o he problem. The following able correlaes figures o parameer choices in able 1.1 page 147 for a = a 1 and b = 1. Figure Label Figure Tpe Choice Fig. 1.1 Slope Fields 3 Fig Euler s Mehod 3 Fig. 1.1 Slope Fields 4 Fig Euler s Mehod 4 Fig Slope Fields 6 Fig Euler s Mehod 6 Fig Slope Fields 8 Fig Euler s Mehod 8 Figures 1.18 and 1.19 show slope fields and numerical approximaions for a = a and b = 1. In general we noice similar behavior of he populaion as we did in par (1). Specificall, as we increase he ampliude of he harvesing parameer we creae rajecories are shifed in he negaive direcion. However, in his case, since he ssem is non-auonomous here are no classical equilibrium soluions. Insead, for his ssem, hose rajecories, which do no go exinc end o a sead long-erm oscillaor behavior. 3. Conclusions and Summar In his lab we are presened wo possible models for populaion harvesing. Wih hese models one can conclude ha here is a relaionship beween harvesing rae and he long-erm populaion. We, in general, noe ha increased harvesing leads o more exincion-rajecories. Moreover, i is possible o use he auonomous ssem o infer behaviors of he non-auonomous ssem. While he auonomous ssem has equilibrium soluions he non-auonomous seems o have wha could be considered sead-sae soluions. These sead-sae soluion can be used, like equilibrium soluions, as reference poins o describe he behavior of neighboring soluions. While i is clear how he presence of consan harvesing can shif an auonomous ssem s equilibrium soluion i is no obvious ha his should be rue of a non-auonomous ssem. If we compare Figure 1.1 and Figure 1.6 we see ha for paricular harvesing values boh populaions sele o a rajecor ha remains viable in he long-erm. In conras o his we have Figures 1.8 and 1.16, which show ha he effec of increased harvesing ends o lead o he loss of he populaion in finie-ime. If we hink of hese long-erm paerns as sead-sae soluion hen we can conclude ha he effec of harvesing is o shif hese sead-sae soluions, which creaes iniial populaions desined for exincion similar o he auonomous ssem. Equilibrium soluions as well as sead-sae soluions make i possible o deermine he long-erm behavior of a paricular soluion saisfing an iniial condiion. This is imporan o he phsical reali of he mahemaical model, because one would naurall like o know how much harvesing can ake place wihou decimaing a paricular populaion. Since i is unlikel ha consan harvesing is possible for a paricular populaion i makes sense o consider periodic harvesing insead. While here are clearl qualiaive similariies in he models here are some ineresing quaniaive differences. If we compare Figure 1.13 o Figure 1.5 we see ha oscillaor harvesing has a derimenal effec causing he purple rajecor o go exinc more quickl han in he consan harvesing case. l, sinusoidal harvesing, while more complicaed, does no guaranee he long-erm viabili of all iniial populaions. This is because he harvesing does no ake ino accoun he curren populaion a he ime of harves. A wa o avoid his deca o exincion is o harves he populaion a a rae proporional o he populaion iself. In his wa he harvesing rae will decrease when he populaion is low and possibl migh save a populaion from exincion. This mehod is oulined in problems and 1 of chaper one secion seven of he ex and shows ha his more complicaed auonomous model gives beer(safer) resuls when a populaion ges ver low. 4

5 Figures Figure 1.1 Slope Line for kn 4a. N + N 4 an k p 1 () = N N 4 an k p () =, sink, source Slope Line for kn = 4a. p() = N, node In general, i is no obvious wh his case ields a node. The bes wa o hink abou i is he following: 1. Think of f 1 (p) as a parabola ha opens downward in he f 1 plane and has roos p 1 and p.. As a increases he parabola is shifed in he negaive f 1 direcion. This causes he roos o ge closer ogeher. 3. When kn = 4a he roos join and become a double roo and f 1 is negaive on boh sides of his roo. This implies ha he roo (aka equilibrium soluion) is a node. You ma wan o draw a picure of his o convince ourself. I is ineresing o noe ha his sor of change in he equilibria of an auonomous ODE wih respec o a parameer is called a bifurcaion, specificall a saddle-node bifurcaion, and is highl imporan in he sud of ODE s and heir connecions o mahemaical chaos. We do no have ime for his secion, 1.7 of our ex. I is accessible wih he background we have and hose ineresed should check i ou. 5

6 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.1 max 5 max 1.5 dela = = -.74.**(1-/5)-.1 d/d= -.38 Equaions Runge Kua 4 Draw s max 5 max 1.5 dela.5 6

7 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

8 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.16 max 1 max 1.5 dela.5 1 = =.5 1.**(1-/5)-.16 d/d= -.7 Equaions Runge Kua 4 Draw s max 1 max 1.5 dela.5 8

9 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

10 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.9 max 1 max 1.5 dela =.718 =.83.**(1-/5)-.9 d/d= -.37 Equaions Runge Kua 4 Draw s max 1 max 1.5 dela.5 1

11 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

12 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.4 max 1 max 1.5 dela Equaions Runge Kua 4 Draw s.**(1-/5)-.4 max 1 max 1.5 dela.5 1

13 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

14 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.1*(1+sin()) max 5 max 1.5 dela.5 5 = 9.56 =.7 1.**(1-/5)-.1*(1+sin()) d/d= -.9 Equaions Runge Kua 4 Draw s max 5 max 1.5 dela.5 14

15 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) E

16 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.16*(1+sin()) max 1 max 1.5 dela.5 1 = =.5 1.**(1-/5)-.16*(1+sin()) d/d= -.7 Equaions Runge Kua 4 Draw s max 1 max 1.5 dela.5 16

17 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) E

18 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.9*(1+sin()) max 1 max 1.5 dela Equaions Runge Kua 4 Draw s.**(1-/5)-.9*(1+sin()) max 1 max 1.5 dela.5 18

19 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

20 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.4*(1+sin()) max 1 max 1.5 dela = = 1.37.**(1-/5)-.4*(1+sin()) d/d= -.54 Equaions Runge Kua 4 Draw s max 1 max 1.5 dela.5

21 Figure DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

22 Figure Equaions Runge Kua 4 Draw s.**(1-/5)-.5*(1+sin()) max 1 max 1.5 dela Equaions Runge Kua 4 Draw s.**(1-/5)-.5*(1+sin()) max 1 max 1.5 dela.5 Figure 1.19

23 DELTA T.15 k _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k) _k _k f(_k,_k)

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes.

Sam knows that his MP3 player has 40% of its battery life left and that the battery charges by an additional 12 percentage points every 15 minutes. 8.F Baery Charging Task Sam wans o ake his MP3 player and his video game player on a car rip. An hour before hey plan o leave, he realized ha he forgo o charge he baeries las nigh. A ha poin, he plugged

More information

1.4 Application Separable Equations and the Logistic Equation

1.4 Application Separable Equations and the Logistic Equation 1.4 Applicaion Separable Equaions and he Logisic Equaion If a separable differenial equaion is wrien in he form f ( y) dy= g( x) dx, hen is general soluion can be wrien in he form f ( y ) dy = g ( x )

More information

Numerical Solution of ODE

Numerical Solution of ODE Numerical Soluion of ODE Euler and Implici Euler resar; wih(deools): wih(plos): The package ploools conains more funcions for ploing, especially a funcion o draw a single line: wih(ploools): wih(linearalgebra):

More information

Fill in the following table for the functions shown below.

Fill in the following table for the functions shown below. By: Carl H. Durney and Neil E. Coer Example 1 EX: Fill in he following able for he funcions shown below. he funcion is odd he funcion is even he funcion has shif-flip symmery he funcion has quarer-wave

More information

CENG 477 Introduction to Computer Graphics. Modeling Transformations

CENG 477 Introduction to Computer Graphics. Modeling Transformations CENG 477 Inroducion o Compuer Graphics Modeling Transformaions Modeling Transformaions Model coordinaes o World coordinaes: Model coordinaes: All shapes wih heir local coordinaes and sies. world World

More information

NEWTON S SECOND LAW OF MOTION

NEWTON S SECOND LAW OF MOTION Course and Secion Dae Names NEWTON S SECOND LAW OF MOTION The acceleraion of an objec is defined as he rae of change of elociy. If he elociy changes by an amoun in a ime, hen he aerage acceleraion during

More information

Chapter Six Chapter Six

Chapter Six Chapter Six Chaper Si Chaper Si 0 CHAPTER SIX ConcepTess and Answers and Commens for Secion.. Which of he following graphs (a) (d) could represen an aniderivaive of he funcion shown in Figure.? Figure. (a) (b) (c)

More information

Project #1 Math 285 Name:

Project #1 Math 285 Name: Projec #1 Mah 85 Name: Solving Orinary Differenial Equaions by Maple: Sep 1: Iniialize he program: wih(deools): wih(pdeools): Sep : Define an ODE: (There are several ways of efining equaions, we sar wih

More information

Mass-Spring Systems and Resonance

Mass-Spring Systems and Resonance Mass-Spring Sysems and Resonance Comparing he effecs of damping coefficiens An ineresing problem is o compare he he effec of differen values of he damping coefficien c on he resuling moion of he mass on

More information

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = );

It is easier to visualize plotting the curves of cos x and e x separately: > plot({cos(x),exp(x)},x = -5*Pi..Pi,y = ); Mah 467 Homework Se : some soluions > wih(deools): wih(plos): Warning, he name changecoords has been redefined Problem :..7 Find he fixed poins, deermine heir sabiliy, for x( ) = cos x e x > plo(cos(x)

More information

Gauss-Jordan Algorithm

Gauss-Jordan Algorithm Gauss-Jordan Algorihm The Gauss-Jordan algorihm is a sep by sep procedure for solving a sysem of linear equaions which may conain any number of variables and any number of equaions. The algorihm is carried

More information

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time

Quantitative macro models feature an infinite number of periods A more realistic (?) view of time INFINIE-HORIZON CONSUMPION-SAVINGS MODEL SEPEMBER, Inroducion BASICS Quaniaive macro models feaure an infinie number of periods A more realisic (?) view of ime Infinie number of periods A meaphor for many

More information

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional);

Network management and QoS provisioning - QoS in Frame Relay. . packet switching with virtual circuit service (virtual circuits are bidirectional); QoS in Frame Relay Frame relay characerisics are:. packe swiching wih virual circui service (virual circuis are bidirecional);. labels are called DLCI (Daa Link Connecion Idenifier);. for connecion is

More information

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves

AML710 CAD LECTURE 11 SPACE CURVES. Space Curves Intrinsic properties Synthetic curves AML7 CAD LECTURE Space Curves Inrinsic properies Synheic curves A curve which may pass hrough any region of hreedimensional space, as conrased o a plane curve which mus lie on a single plane. Space curves

More information

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS

FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS FIELD PROGRAMMABLE GATE ARRAY (FPGA) AS A NEW APPROACH TO IMPLEMENT THE CHAOTIC GENERATORS Mohammed A. Aseeri and M. I. Sobhy Deparmen of Elecronics, The Universiy of Ken a Canerbury Canerbury, Ken, CT2

More information

Engineering Mathematics 2018

Engineering Mathematics 2018 Engineering Mahemaics 08 SUBJET NAME : Mahemaics II SUBJET ODE : MA65 MATERIAL NAME : Par A quesions REGULATION : R03 UPDATED ON : November 06 TEXTBOOK FOR REFERENE To buy he book visi : Sri Hariganesh

More information

Chapter 4 Sequential Instructions

Chapter 4 Sequential Instructions Chaper 4 Sequenial Insrucions The sequenial insrucions of FBs-PLC shown in his chaper are also lised in secion 3.. Please refer o Chaper, "PLC Ladder diagram and he Coding rules of Mnemonic insrucion",

More information

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch

MIC2569. Features. General Description. Applications. Typical Application. CableCARD Power Switch CableCARD Power Swich General Descripion is designed o supply power o OpenCable sysems and CableCARD hoss. These CableCARDs are also known as Poin of Disribuion (POD) cards. suppors boh Single and Muliple

More information

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report)

Implementing Ray Casting in Tetrahedral Meshes with Programmable Graphics Hardware (Technical Report) Implemening Ray Casing in Terahedral Meshes wih Programmable Graphics Hardware (Technical Repor) Marin Kraus, Thomas Erl March 28, 2002 1 Inroducion Alhough cell-projecion, e.g., [3, 2], and resampling,

More information

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS

MOTION DETECTORS GRAPH MATCHING LAB PRE-LAB QUESTIONS NME: TE: LOK: MOTION ETETORS GRPH MTHING L PRE-L QUESTIONS 1. Read he insrucions, and answer he following quesions. Make sure you resae he quesion so I don hae o read he quesion o undersand he answer..

More information

4.1 3D GEOMETRIC TRANSFORMATIONS

4.1 3D GEOMETRIC TRANSFORMATIONS MODULE IV MCA - 3 COMPUTER GRAPHICS ADMN 29- Dep. of Compuer Science And Applicaions, SJCET, Palai 94 4. 3D GEOMETRIC TRANSFORMATIONS Mehods for geomeric ransformaions and objec modeling in hree dimensions

More information

EECS 487: Interactive Computer Graphics

EECS 487: Interactive Computer Graphics EECS 487: Ineracive Compuer Graphics Lecure 7: B-splines curves Raional Bézier and NURBS Cubic Splines A represenaion of cubic spline consiss of: four conrol poins (why four?) hese are compleely user specified

More information

Scattering at an Interface: Normal Incidence

Scattering at an Interface: Normal Incidence Course Insrucor Dr. Raymond C. Rumpf Office: A 337 Phone: (915) 747 6958 Mail: rcrumpf@uep.edu 4347 Applied lecromagneics Topic 3f Scaering a an Inerface: Normal Incidence Scaering These Normal noes Incidence

More information

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom.

1 œ DRUM SET KEY. 8 Odd Meter Clave Conor Guilfoyle. Cowbell (neck) Cymbal. Hi-hat. Floor tom (shell) Clave block. Cowbell (mouth) Hi tom. DRUM SET KEY Hi-ha Cmbal Clave block Cowbell (mouh) 0 Cowbell (neck) Floor om (shell) Hi om Mid om Snare Floor om Snare cross sick or clave block Bass drum Hi-ha wih foo 8 Odd Meer Clave Conor Guilfole

More information

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification

Spline Curves. Color Interpolation. Normal Interpolation. Last Time? Today. glshademodel (GL_SMOOTH); Adjacency Data Structures. Mesh Simplification Las Time? Adjacency Daa Srucures Spline Curves Geomeric & opologic informaion Dynamic allocaion Efficiency of access Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

An Improved Square-Root Nyquist Shaping Filter

An Improved Square-Root Nyquist Shaping Filter An Improved Square-Roo Nyquis Shaping Filer fred harris San Diego Sae Universiy fred.harris@sdsu.edu Sridhar Seshagiri San Diego Sae Universiy Seshigar.@engineering.sdsu.edu Chris Dick Xilinx Corp. chris.dick@xilinx.com

More information

Coded Caching with Multiple File Requests

Coded Caching with Multiple File Requests Coded Caching wih Muliple File Requess Yi-Peng Wei Sennur Ulukus Deparmen of Elecrical and Compuer Engineering Universiy of Maryland College Park, MD 20742 ypwei@umd.edu ulukus@umd.edu Absrac We sudy a

More information

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL

CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL CAMERA CALIBRATION BY REGISTRATION STEREO RECONSTRUCTION TO 3D MODEL Klečka Jan Docoral Degree Programme (1), FEEC BUT E-mail: xkleck01@sud.feec.vubr.cz Supervised by: Horák Karel E-mail: horak@feec.vubr.cz

More information

STEREO PLANE MATCHING TECHNIQUE

STEREO PLANE MATCHING TECHNIQUE STEREO PLANE MATCHING TECHNIQUE Commission III KEY WORDS: Sereo Maching, Surface Modeling, Projecive Transformaion, Homography ABSTRACT: This paper presens a new ype of sereo maching algorihm called Sereo

More information

Michiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters

Michiel Helder and Marielle C.T.A Geurts. Hoofdkantoor PTT Post / Dutch Postal Services Headquarters SHORT TERM PREDICTIONS A MONITORING SYSTEM by Michiel Helder and Marielle C.T.A Geurs Hoofdkanoor PTT Pos / Duch Posal Services Headquarers Keywords macro ime series shor erm predicions ARIMA-models faciliy

More information

Boyce - DiPrima 8.4, Multistep Methods

Boyce - DiPrima 8.4, Multistep Methods Boyce - DiPrima 8., Mulisep Mehods Secion 8., p. 67: Iniializaion In[1]:= In[]:= Impor "ColorNames.m" DiffEqs` Runga-Kua Mehod Implemen one sep of he Runge-Kua Mehod. In[]:= Clear y,, h, f ; eqn : y' f,

More information

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley.

Shortest Path Algorithms. Lecture I: Shortest Path Algorithms. Example. Graphs and Matrices. Setting: Dr Kieran T. Herley. Shores Pah Algorihms Background Seing: Lecure I: Shores Pah Algorihms Dr Kieran T. Herle Deparmen of Compuer Science Universi College Cork Ocober 201 direced graph, real edge weighs Le he lengh of a pah

More information

COMP26120: Algorithms and Imperative Programming

COMP26120: Algorithms and Imperative Programming COMP26120 ecure C3 1/48 COMP26120: Algorihms and Imperaive Programming ecure C3: C - Recursive Daa Srucures Pee Jinks School of Compuer Science, Universiy of Mancheser Auumn 2011 COMP26120 ecure C3 2/48

More information

An Adaptive Spatial Depth Filter for 3D Rendering IP

An Adaptive Spatial Depth Filter for 3D Rendering IP JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, VOL.3, NO. 4, DECEMBER, 23 175 An Adapive Spaial Deph Filer for 3D Rendering IP Chang-Hyo Yu and Lee-Sup Kim Absrac In his paper, we presen a new mehod

More information

4 Error Control. 4.1 Issues with Reliable Protocols

4 Error Control. 4.1 Issues with Reliable Protocols 4 Error Conrol Jus abou all communicaion sysems aemp o ensure ha he daa ges o he oher end of he link wihou errors. Since i s impossible o build an error-free physical layer (alhough some shor links can

More information

Evaluation and Improvement of Region-based Motion Segmentation

Evaluation and Improvement of Region-based Motion Segmentation Evaluaion and Improvemen of Region-based Moion Segmenaion Mark Ross Universiy Koblenz-Landau, Insiue of Compuaional Visualisics, Universiässraße 1, 56070 Koblenz, Germany Email: ross@uni-koblenz.de Absrac

More information

Hyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE

Hyelim Oh. School of Computing, National University of Singapore, 13 Computing Drive, Singapore SINGAPORE RESEARCH ARTICLE FREE VERSUS FOR-A-FEE: THE IMPACT OF A PAYWALL ON THE PATTERN AND EFFECTIVENESS OF WORD-OF-MOUTH VIA SOCIAL MEDIA Hyelim Oh School of Compuing, Naional Universiy of Singapore, 13 Compuing

More information

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding

Image segmentation. Motivation. Objective. Definitions. A classification of segmentation techniques. Assumptions for thresholding Moivaion Image segmenaion Which pixels belong o he same objec in an image/video sequence? (spaial segmenaion) Which frames belong o he same video sho? (emporal segmenaion) Which frames belong o he same

More information

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough

Today. Curves & Surfaces. Can We Disguise the Facets? Limitations of Polygonal Meshes. Better, but not always good enough Today Curves & Surfaces Moivaion Limiaions of Polygonal Models Some Modeling Tools & Definiions Curves Surfaces / Paches Subdivision Surfaces Limiaions of Polygonal Meshes Can We Disguise he Faces? Planar

More information

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12].

In Proceedings of CVPR '96. Structure and Motion of Curved 3D Objects from. using these methods [12]. In Proceedings of CVPR '96 Srucure and Moion of Curved 3D Objecs from Monocular Silhouees B Vijayakumar David J Kriegman Dep of Elecrical Engineering Yale Universiy New Haven, CT 652-8267 Jean Ponce Compuer

More information

Definition and examples of time series

Definition and examples of time series Definiion and examples of ime series A ime series is a sequence of daa poins being recorded a specific imes. Formally, le,,p be a probabiliy space, and T an index se. A real valued sochasic process is

More information

the marginal product. Using the rule for differentiating a power function,

the marginal product. Using the rule for differentiating a power function, 3 Augu 07 Chaper 3 Derivaive ha economi ue 3 Rule for differeniaion The chain rule Economi ofen work wih funcion of variable ha are hemelve funcion of oher variable For example, conider a monopoly elling

More information

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models

Simultaneous Precise Solutions to the Visibility Problem of Sculptured Models Simulaneous Precise Soluions o he Visibiliy Problem of Sculpured Models Joon-Kyung Seong 1, Gershon Elber 2, and Elaine Cohen 1 1 Universiy of Uah, Sal Lake Ciy, UT84112, USA, seong@cs.uah.edu, cohen@cs.uah.edu

More information

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems

Why not experiment with the system itself? Ways to study a system System. Application areas. Different kinds of systems Simulaion Wha is simulaion? Simple synonym: imiaion We are ineresed in sudying a Insead of experimening wih he iself we experimen wih a model of he Experimen wih he Acual Ways o sudy a Sysem Experimen

More information

MB86297A Carmine Timing Analysis of the DDR Interface

MB86297A Carmine Timing Analysis of the DDR Interface Applicaion Noe MB86297A Carmine Timing Analysis of he DDR Inerface Fujisu Microelecronics Europe GmbH Hisory Dae Auhor Version Commen 05.02.2008 Anders Ramdahl 0.01 Firs draf 06.02.2008 Anders Ramdahl

More information

Optics and Light. Presentation

Optics and Light. Presentation Opics and Ligh Presenaion Opics and Ligh Wha comes o mind when you hear he words opics and ligh? Wha is an opical illusion? Opical illusions can use color, ligh and paerns o creae images ha can be

More information

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS

A METHOD OF MODELING DEFORMATION OF AN OBJECT EMPLOYING SURROUNDING VIDEO CAMERAS A METHOD OF MODELING DEFORMATION OF AN OBJECT EMLOYING SURROUNDING IDEO CAMERAS Joo Kooi TAN, Seiji ISHIKAWA Deparmen of Mechanical and Conrol Engineering Kushu Insiue of Technolog, Japan ehelan@is.cnl.kuech.ac.jp,

More information

Motion along a Line. Describing Motion along a Line

Motion along a Line. Describing Motion along a Line Moion along a Line Describing Moion: Displacemen Velociy Acceleraion Uniformly Acceleraed Moion Free Fall Describing Moion along a Line Wha is he posiion, elociy, and acceleraion of he blue do a each insan

More information

Video Content Description Using Fuzzy Spatio-Temporal Relations

Video Content Description Using Fuzzy Spatio-Temporal Relations Proceedings of he 4s Hawaii Inernaional Conference on Sysem Sciences - 008 Video Conen Descripion Using Fuzzy Spaio-Temporal Relaions rchana M. Rajurkar *, R.C. Joshi and Sananu Chaudhary 3 Dep of Compuer

More information

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012)

Effects needed for Realism. Ray Tracing. Ray Tracing: History. Outline. Foundations of Computer Graphics (Fall 2012) Foundaions of ompuer Graphics (Fall 2012) S 184, Lecure 16: Ray Tracing hp://ins.eecs.berkeley.edu/~cs184 Effecs needed for Realism (Sof) Shadows Reflecions (Mirrors and Glossy) Transparency (Waer, Glass)

More information

Chapter 3 MEDIA ACCESS CONTROL

Chapter 3 MEDIA ACCESS CONTROL Chaper 3 MEDIA ACCESS CONTROL Overview Moivaion SDMA, FDMA, TDMA Aloha Adapive Aloha Backoff proocols Reservaion schemes Polling Disribued Compuing Group Mobile Compuing Summer 2003 Disribued Compuing

More information

Learning in Games via Opponent Strategy Estimation and Policy Search

Learning in Games via Opponent Strategy Estimation and Policy Search Learning in Games via Opponen Sraegy Esimaion and Policy Search Yavar Naddaf Deparmen of Compuer Science Universiy of Briish Columbia Vancouver, BC yavar@naddaf.name Nando de Freias (Supervisor) Deparmen

More information

A Matching Algorithm for Content-Based Image Retrieval

A Matching Algorithm for Content-Based Image Retrieval A Maching Algorihm for Conen-Based Image Rerieval Sue J. Cho Deparmen of Compuer Science Seoul Naional Universiy Seoul, Korea Absrac Conen-based image rerieval sysem rerieves an image from a daabase using

More information

Computer representations of piecewise

Computer representations of piecewise Edior: Gabriel Taubin Inroducion o Geomeric Processing hrough Opimizaion Gabriel Taubin Brown Universiy Compuer represenaions o piecewise smooh suraces have become vial echnologies in areas ranging rom

More information

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding

Analysis of Various Types of Bugs in the Object Oriented Java Script Language Coding Indian Journal of Science and Technology, Vol 8(21), DOI: 10.17485/ijs/2015/v8i21/69958, Sepember 2015 ISSN (Prin) : 0974-6846 ISSN (Online) : 0974-5645 Analysis of Various Types of Bugs in he Objec Oriened

More information

4. Minimax and planning problems

4. Minimax and planning problems CS/ECE/ISyE 524 Inroducion o Opimizaion Spring 2017 18 4. Minima and planning problems ˆ Opimizing piecewise linear funcions ˆ Minima problems ˆ Eample: Chebyshev cener ˆ Muli-period planning problems

More information

THERMAL PHYSICS COMPUTER LAB #3 : Stability of Dry Air and Brunt-Vaisala Oscillations

THERMAL PHYSICS COMPUTER LAB #3 : Stability of Dry Air and Brunt-Vaisala Oscillations THERMAL PHYSICS COMPUTER LAB #3 : Sabiliy of Dry Air and Brun-Vaisala Oscillaions Consider a parcel of dry air of volume V, emperaure T and densiy ρ. I displace he same volume V of surrounding air of emperaure

More information

*Corresponding author: Mattenstrasse 26, CH-4058 Basel,

*Corresponding author: Mattenstrasse 26, CH-4058 Basel, Simulaing Organogenesis in COMSOL: Image-based Modeling Z. Karimaddini 1,, E. Unal 1,,3, D. Menshykau 1, and D. Iber* 1, 1 Deparemen for Biosysems Science and Engineering, ETH Zurich, Swizerland Swiss

More information

Announcements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions

Announcements For The Logic of Boolean Connectives Truth Tables, Tautologies & Logical Truths. Outline. Introduction Truth Functions Announcemens For 02.05.09 The Logic o Boolean Connecives Truh Tables, Tauologies & Logical Truhs 1 HW3 is due nex Tuesday William Sarr 02.05.09 William Sarr The Logic o Boolean Connecives (Phil 201.02)

More information

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version

Test - Accredited Configuration Engineer (ACE) Exam - PAN-OS 6.0 Version Tes - Accredied Configuraion Engineer (ACE) Exam - PAN-OS 6.0 Version ACE Exam Quesion 1 of 50. Which of he following saemens is NOT abou Palo Alo Neworks firewalls? Sysem defauls may be resored by performing

More information

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures

Curves & Surfaces. Last Time? Today. Readings for Today (pick one) Limitations of Polygonal Meshes. Today. Adjacency Data Structures Las Time? Adjacency Daa Srucures Geomeric & opologic informaion Dynamic allocaion Efficiency of access Curves & Surfaces Mesh Simplificaion edge collapse/verex spli geomorphs progressive ransmission view-dependen

More information

Motor Control. 5. Control. Motor Control. Motor Control

Motor Control. 5. Control. Motor Control. Motor Control 5. Conrol In his chaper we will do: Feedback Conrol On/Off Conroller PID Conroller Moor Conrol Why use conrol a all? Correc or wrong? Supplying a cerain volage / pulsewidh will make he moor spin a a cerain

More information

The Impact of Product Development on the Lifecycle of Defects

The Impact of Product Development on the Lifecycle of Defects The Impac of Produc Developmen on he Lifecycle of Rudolf Ramler Sofware Compeence Cener Hagenberg Sofware Park 21 A-4232 Hagenberg, Ausria +43 7236 3343 872 rudolf.ramler@scch.a ABSTRACT This paper invesigaes

More information

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state

Outline. EECS Components and Design Techniques for Digital Systems. Lec 06 Using FSMs Review: Typical Controller: state Ouline EECS 5 - Componens and Design Techniques for Digial Sysems Lec 6 Using FSMs 9-3-7 Review FSMs Mapping o FPGAs Typical uses of FSMs Synchronous Seq. Circuis safe composiion Timing FSMs in verilog

More information

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases

Landmarks: A New Model for Similarity-Based Pattern Querying in Time Series Databases Lmarks: A New Model for Similariy-Based Paern Querying in Time Series Daabases Chang-Shing Perng Haixun Wang Sylvia R. Zhang D. So Parker perng@cs.ucla.edu hxwang@cs.ucla.edu Sylvia Zhang@cle.com so@cs.ucla.edu

More information

Image Based Computer-Aided Manufacturing Technology

Image Based Computer-Aided Manufacturing Technology Sensors & Transducers 03 by IFSA hp://www.sensorsporal.com Image Based Compuer-Aided Manufacuring Technology Zhanqi HU Xiaoqin ZHANG Jinze LI Wei LI College of Mechanical Engineering Yanshan Universiy

More information

Real Time Integral-Based Structural Health Monitoring

Real Time Integral-Based Structural Health Monitoring Real Time Inegral-Based Srucural Healh Monioring The nd Inernaional Conference on Sensing Technology ICST 7 J. G. Chase, I. Singh-Leve, C. E. Hann, X. Chen Deparmen of Mechanical Engineering, Universiy

More information

Handling uncertainty in semantic information retrieval process

Handling uncertainty in semantic information retrieval process Handling uncerainy in semanic informaion rerieval process Chkiwa Mounira 1, Jedidi Anis 1 and Faiez Gargouri 1 1 Mulimedia, InfoRmaion sysems and Advanced Compuing Laboraory Sfax Universiy, Tunisia m.chkiwa@gmail.com,

More information

Design Alternatives for a Thin Lens Spatial Integrator Array

Design Alternatives for a Thin Lens Spatial Integrator Array Egyp. J. Solids, Vol. (7), No. (), (004) 75 Design Alernaives for a Thin Lens Spaial Inegraor Array Hala Kamal *, Daniel V azquez and Javier Alda and E. Bernabeu Opics Deparmen. Universiy Compluense of

More information

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets?

Last Time: Curves & Surfaces. Today. Questions? Limitations of Polygonal Meshes. Can We Disguise the Facets? Las Time: Curves & Surfaces Expeced value and variance Mone-Carlo in graphics Imporance sampling Sraified sampling Pah Tracing Irradiance Cache Phoon Mapping Quesions? Today Moivaion Limiaions of Polygonal

More information

Point Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display

Point Cloud Representation of 3D Shape for Laser- Plasma Scanning 3D Display Poin Cloud Represenaion of 3D Shape for Laser- Plasma Scanning 3D Displa Hiroo Ishikawa and Hideo Saio Keio Universi E-mail {hiroo, saio}@ozawa.ics.keio.ac.jp Absrac- In his paper, a mehod of represening

More information

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate

M(t)/M/1 Queueing System with Sinusoidal Arrival Rate 20 TUTA/IOE/PCU Journal of he Insiue of Engineering, 205, (): 20-27 TUTA/IOE/PCU Prined in Nepal M()/M/ Queueing Sysem wih Sinusoidal Arrival Rae A.P. Pan, R.P. Ghimire 2 Deparmen of Mahemaics, Tri-Chandra

More information

Wiley Plus. Assignment 1 is online:

Wiley Plus. Assignment 1 is online: Wile Plus Assignmen 1 is online: 6 problems from chapers and 3 1D and D Kinemaics Due Monda Ocober 5 Before 11 pm! Chaper II: Kinemaics In One Dimension Displacemen Speed and Veloci Acceleraion Equaions

More information

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks

Less Pessimistic Worst-Case Delay Analysis for Packet-Switched Networks Less Pessimisic Wors-Case Delay Analysis for Packe-Swiched Neworks Maias Wecksén Cenre for Research on Embedded Sysems P O Box 823 SE-31 18 Halmsad maias.wecksen@hh.se Magnus Jonsson Cenre for Research

More information

Probabilistic Detection and Tracking of Motion Discontinuities

Probabilistic Detection and Tracking of Motion Discontinuities Probabilisic Deecion and Tracking of Moion Disconinuiies Michael J. Black David J. Flee Xerox Palo Alo Research Cener 3333 Coyoe Hill Road Palo Alo, CA 94304 fblack,fleeg@parc.xerox.com hp://www.parc.xerox.com/fblack,fleeg/

More information

Announcements. TCP Congestion Control. Goals of Today s Lecture. State Diagrams. TCP State Diagram

Announcements. TCP Congestion Control. Goals of Today s Lecture. State Diagrams. TCP State Diagram nnouncemens TCP Congesion Conrol Projec #3 should be ou onigh Can do individual or in a eam of 2 people Firs phase due November 16 - no slip days Exercise good (beer) ime managemen EE 122: Inro o Communicaion

More information

Midterm Exam Announcements

Midterm Exam Announcements Miderm Exam Noe: This was a challenging exam. CSCI 4: Principles o Programming Languages Lecure 1: Excepions Insrucor: Dan Barowy Miderm Exam Scores 18 16 14 12 10 needs improvemen 8 6 4 2 0 0-49 50-59

More information

BEST DYNAMICS NAMICS CRM A COMPILATION OF TECH-TIPS TO HELP YOUR BUSINESS SUCCEED WITH DYNAMICS CRM

BEST DYNAMICS NAMICS CRM A COMPILATION OF TECH-TIPS TO HELP YOUR BUSINESS SUCCEED WITH DYNAMICS CRM DYNAMICS CR A Publicaion by elogic s fines Microsof Dynamics CRM Expers { ICS CRM BEST OF 2014 A COMPILATION OF TECH-TIPS TO HELP YOUR BUSINESS SUCCEED WITH DYNAMICS CRM NAMICS CRM { DYNAMICS M INTRODUCTION

More information

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures.

Schedule. Curves & Surfaces. Questions? Last Time: Today. Limitations of Polygonal Meshes. Acceleration Data Structures. Schedule Curves & Surfaces Sunday Ocober 5 h, * 3-5 PM *, Room TBA: Review Session for Quiz 1 Exra Office Hours on Monday (NE43 Graphics Lab) Tuesday Ocober 7 h : Quiz 1: In class 1 hand-wrien 8.5x11 shee

More information

A Numerical Study on Impact Damage Assessment of PC Box Girder Bridge by Pounding Effect

A Numerical Study on Impact Damage Assessment of PC Box Girder Bridge by Pounding Effect A Numerical Sudy on Impac Damage Assessmen of PC Box Girder Bridge by Pounding Effec H. Tamai, Y. Sonoda, K. Goou and Y.Kajia Kyushu Universiy, Japan Absrac When a large earhquake occurs, displacemen response

More information

Autonomic Cognitive-based Data Dissemination in Opportunistic Networks

Autonomic Cognitive-based Data Dissemination in Opportunistic Networks Auonomic Cogniive-based Daa Disseminaion in Opporunisic Neworks Lorenzo Valerio, Marco Coni, Elena Pagani and Andrea Passarella IIT-CNR, Pisa, Ialy Email: {marco.coni,andrea.passarella,lorenzo.valerio}@ii.cnr.i

More information

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates

A Fast Stereo-Based Multi-Person Tracking using an Approximated Likelihood Map for Overlapping Silhouette Templates A Fas Sereo-Based Muli-Person Tracking using an Approximaed Likelihood Map for Overlapping Silhouee Templaes Junji Saake Jun Miura Deparmen of Compuer Science and Engineering Toyohashi Universiy of Technology

More information

Exercise 3: Bluetooth BR/EDR

Exercise 3: Bluetooth BR/EDR Wireless Communicaions, M. Rupf. Exercise 3: Blueooh BR/EDR Problem 1: Blueooh Daa Raes. Consider he ACL packe 3-DH5 wih a maximum user payload of 1021 byes. a) Deermine he maximum achievable daa rae in

More information

(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS

(Structural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS (Srucural Time Series Models for Describing Trend in All India Sunflower Yield Using SAS Himadri Ghosh, Prajneshu and Savia Wadhwa I.A.S.R.I., Library Avenue, New Delhi-110 01 him_adri@iasri.res.in, prajnesh@iasri.res.in,

More information

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics

A non-stationary uniform tension controlled interpolating 4-point scheme reproducing conics A non-saionary uniform ension conrolled inerpolaing 4-poin scheme reproducing conics C. Beccari a, G. Casciola b, L. Romani b, a Deparmen of Pure and Applied Mahemaics, Universiy of Padova, Via G. Belzoni

More information

V103 TRIPLE 10-BIT LVDS TRANSMITTER FOR VIDEO. General Description. Features. Block Diagram

V103 TRIPLE 10-BIT LVDS TRANSMITTER FOR VIDEO. General Description. Features. Block Diagram General Descripion The V103 LVDS display inerface ransmier is primarily designed o suppor pixel daa ransmission beween a video processing engine and a digial video display. The daa rae suppors up o SXGA+

More information

Restorable Dynamic Quality of Service Routing

Restorable Dynamic Quality of Service Routing QOS ROUTING Resorable Dynamic Qualiy of Service Rouing Murali Kodialam and T. V. Lakshman, Lucen Technologies ABSTRACT The focus of qualiy-of-service rouing has been on he rouing of a single pah saisfying

More information

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR

PART 1 REFERENCE INFORMATION CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONITOR . ~ PART 1 c 0 \,).,,.,, REFERENCE NFORMATON CONTROL DATA 6400 SYSTEMS CENTRAL PROCESSOR MONTOR n CONTROL DATA 6400 Compuer Sysems, sysem funcions are normally handled by he Monior locaed in a Peripheral

More information

Improving Ranking of Search Engines Results Based on Power Links

Improving Ranking of Search Engines Results Based on Power Links IPASJ Inernaional Journal of Informaion Technology (IIJIT) Web Sie: hp://www.ipasj.org/iijit/iijit.hm A Publisher for Research Moivaion... Email: edioriiji@ipasj.org Volume 2, Issue 9, Sepember 2014 ISSN

More information

Distributed Task Negotiation in Modular Robots

Distributed Task Negotiation in Modular Robots Disribued Task Negoiaion in Modular Robos Behnam Salemi, eer Will, and Wei-Min Shen USC Informaion Sciences Insiue and Compuer Science Deparmen Marina del Rey, USA, {salemi, will, shen}@isi.edu Inroducion

More information

CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING

CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING CHANGE DETECTION - CELLULAR AUTOMATA METHOD FOR URBAN GROWTH MODELING Sharaf Alkheder, Jun Wang and Jie Shan Geomaics Engineering, School of Civil Engineering, Purdue Universiy 550 Sadium Mall Drive, Wes

More information

FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore National Laboratory Livermore, California

FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore National Laboratory Livermore, California FLOW VISUALIZATION USING MOVING TEXTURES * Nelson Max Lawrence Livermore Naional Laboraor Livermore, California Barr Becker Lawrence Livermore Naional Laboraor Livermore, California SUMMARY We presen a

More information

EP2200 Queueing theory and teletraffic systems

EP2200 Queueing theory and teletraffic systems EP2200 Queueing heory and eleraffic sysems Vikoria Fodor Laboraory of Communicaion Neworks School of Elecrical Engineering Lecure 1 If you wan o model neworks Or a comple daa flow A queue's he key o help

More information

Matlab5 5.3 symbolisches Lösen von DGLn

Matlab5 5.3 symbolisches Lösen von DGLn C:\Si5\Ingmah\symbmalab\DGLn_N4_2.doc, Seie /5 Prof. Dr. R. Kessler, Homepage: hp://www.home.hs-karlsruhe.de/~kero/ Malab5 5.3 symbolisches Lösen von DGLn % Beispiele aus Malab 4.3 Suden Ediion Handbuch

More information

Projection & Interaction

Projection & Interaction Projecion & Ineracion Algebra of projecion Canonical viewing volume rackball inerface ransform Hierarchies Preview of Assignmen #2 Lecure 8 Comp 236 Spring 25 Projecions Our lives are grealy simplified

More information

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u

Open Access Research on an Improved Medical Image Enhancement Algorithm Based on P-M Model. Luo Aijing 1 and Yin Jin 2,* u = div( c u ) u Send Orders for Reprins o reprins@benhamscience.ae The Open Biomedical Engineering Journal, 5, 9, 9-3 9 Open Access Research on an Improved Medical Image Enhancemen Algorihm Based on P-M Model Luo Aijing

More information

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012

Scheduling. Scheduling. EDA421/DIT171 - Parallel and Distributed Real-Time Systems, Chalmers/GU, 2011/2012 Lecture #4 Updated March 16, 2012 EDA421/DIT171 - Parallel and Disribued Real-Time Sysems, Chalmers/GU, 2011/2012 Lecure #4 Updaed March 16, 2012 Aemps o mee applicaion consrains should be done in a proacive way hrough scheduling. Schedule

More information

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2

Data Structures and Algorithms. The material for this lecture is drawn, in part, from The Practice of Programming (Kernighan & Pike) Chapter 2 Daa Srucures and Algorihms The maerial for his lecure is drawn, in par, from The Pracice of Programming (Kernighan & Pike) Chaper 2 1 Moivaing Quoaion Every program depends on algorihms and daa srucures,

More information

Assignment 2. Due Monday Feb. 12, 10:00pm.

Assignment 2. Due Monday Feb. 12, 10:00pm. Faculy of rs and Science Universiy of Torono CSC 358 - Inroducion o Compuer Neworks, Winer 218, LEC11 ssignmen 2 Due Monday Feb. 12, 1:pm. 1 Quesion 1 (2 Poins): Go-ack n RQ In his quesion, we review how

More information

TUTORING TEXTS IN MATHCAD

TUTORING TEXTS IN MATHCAD TUTORING TEXTS IN MATHCAD MIROSLAV DOLOZÍILEK and ANNA RYNDOVÁ Faculy of Mechanical Engineering, Brno Universiy of Technology Technická, 616 69 Brno, Czech Republic E-ail: irdo@fyzika.fe.vubr.cz Absrac

More information