7.2 Puiseux Expansions
|
|
- Silvester Daniel
- 5 years ago
- Views:
Transcription
1 7. Puiseux Expansions Given an algebraic funcion on an algebraic curve, we wish o compue is principle pars by locaing is poles and compuing series expansions here. Since he powers of y form a Cx basis for he curve s funcion field PROOF, our primary goal is o compue series expansions for y a arbirary poins on he curve. Wih such expansions in hand, i is sraighforward o consruc expansions for any algebraic funcion. A any poin where he discriminan is non-zero, a series expansion for y exiss as a power series in xα, which is a sraighforward applicaion of he Implici Funcion Theorem. Theorem 7.. Implici Funcion Theorem [Ru??] Theorem 9.8 is a real version of he heorem. [Gu05] Lecure 7 sars wih a complex version of he heorem. See hps://mah.sackexchange.com/quesions/ The wo-dimensional complex analyic version: Le f be an analyic mapping of an open se E C ino C, such ha fx, y = 0 and 0, hen an analyic funcion gx exiss such ha fx, gx = 0. df dy For ramificaion poins, we ll use a subsiuion of he form x = r α, where r is he ramificaion index, and consruc a power series, no in x α, bu in = x α /r, a Puiseux series. As a funcion of, boh x and y are analyic in an open neighborhood of = 0. x is analyic as a funcion of because of he I.F.T. applied o x = r α. y is analyic as a funcion of x because of he I.F.T. applied o he defining equaion of he curve. Composiion of analyic funcions are analyic, showing ha y is analyic as funcion of. These argumens hold in an open neighborhood of = 0. Coninuiy of he roos shows ha y is coninuous a = 0. Then use exisence of he Lauren series Silverman. and coninuiy of he roos HOW? o esablish analyiciy a he ramificaion poin. Singular poins will admi muliple Puiseux series, each one corresponding o a single cycle. The mos sraighforward way o compue Puiseux series is o use Newon polygons o deermine ramificaion, hen seup a rial series wih he correc ramificaion and subsiue i ino he curve s defining equaion. Le s assume ha we re expanding around he poin 0, 0, as his simplifies he analysis wih no loss of generaliy. Consider facoring he defining polynomial of he algebraic curve:
2 p n y n p n y n p 0 = y r y r y r n How migh we do his, if he polynomial is irreducible? We need o exend o a larger field where he polynomial s roos exis. The analysis above shows ha Puiseux series form a suiable exension. For each roo r i, define is order as he lowes power of ha appears in is Puiseux expansion, divided by is ramificaion index. Muliplying facors ogeher adds heir orders, so p 0 s order will be he sum of all of he r i s orders. Now le s consider increasing i by one. How does p 0 s order change? p is formed by adding ogeher all producs of n roos, so p s order will be lower han p 0 s order by he larges of r i s orders, unless here are muliple r i s wih he same order. In his case, cancellaion beween hese muliple erms could resul in p having a larger order han oherwise expeced. If here are j r i s wih he same larges order, increasing i by j will lower p i s order by j imes ha larges order. The Newon polygon is formed by ploing he orders of he p i coefficiens, wih i varying along he horizonal axis and he order ploed verically. The easies way o do his is o plo he powers of he monomials ha appear in he equaion, and consruc he polygon s lower convex hull. Thus, a segmen on he lower convex hull of he Newon polygon will correspond o as many soluions as he widh of he line segmen, each wih order equal o he change in heigh divided by he widh, i.e, he negaive slope of he line segmen. The denominaor of he slope will be he ramificaion index, and he numeraor of he slope will be he lowes exponen expeced in he expansion of y. Consider a Puiseux series corresponding o a single line segmen of he Newon polygon. Leing α be he x exponen and β be he y exponen, so he monomials in f have he form x α y β, hen he equaion of he line segmen is rα sβ = p, where r, s, and p are inegers and r and s are relaively prime. Making he subsiuion x = r and y = s u, we obain: fx, y = A αβ x α y β = A αβ rα sβ u β = p A αβ rαsβp u β }{{} g,u A leas wo of he rαsβp exponens will be zero hose monomials corresponding o he endpoins of he line segmen on he Newon polygon; all of he remaining exponens will be posiive. This means ha if we expand u in a power series in :
3 hen any power of u will have he form: u = u 0 u u u u β = U 0 u 0 U u 0, u U u 0, u, u U u 0, u, u, u and g, u will also have he form: g, u = G 0 u 0 G u 0, u G u 0, u, u G u 0, u, u, u In order for g, u = 0 a = 0, G 0 u 0 mus be zero, and since G 0 u 0 is a polynomial in u 0, his gives us a finie number of values for u 0 ha can solve our equaion. Now, by seing g, u = 0, can we obain u as a funcion of? The Implici Funcion Theorem saes ha we can, if δg δu o expand around. is no zero a he poin we wish δg δu 0, u 0 = δ δu G 0u 0 In shor, he roos of G 0 u 0 give us he saring values for our series expansion, and if he roos are simple, hen he Implici Funcion Theorem guaranees ha we ll have a unique series expansion for u as a funcion of. If any of he roos are no simple, hen we can repea his procedure for g, u. I can be shown [Bl47] 5 ha his procedure always erminaes.
4 puiseuxf,x,y,x0,y0,deg,[rafunc], adoped from implici_aylor in he Maxima disribuion, compues he Puiseux series of a funcion f in variables x and y, cenered around place x0, y0, o degree deg. An opional sevenh argumen rafunc specifies a raional funcion in x and y o be expanded; he defaul is y. rafunc may also be a differenial. Eiher x0 or y0, or boh, may be inf o reques expansions a infiniy. y0 may be false o reques expansions a all poins of he curve lying over x0. Limiaions. puiseux consrucs he Puiseux series coefficiens using Maxima s buil-in solve rouine, which is limied o solving polynomials using radicals. Therefore, puiseux can fail on algebraic curves of fifh degree and higher. Also, puiseux does no ye implemen he recursion case described above when δg is zero. δu puiseux_fracexp conrols wheher puiseux s resuls should be reurned as fracional powers in x, or using an auxilary variable. newon_polygon graphs he Newon polygon corresponding o an algebraic curve. Several auxilary funcions are also used; hese are inernal o he namespace puiseux: puiseux4 compues a Puiseux series corresponding o a single place on he algebraic curve; i is called muliple imes by puiseux if y0 is false. puiseux compues a Puiseux series corresponding o a single line segmen of he Newon polygon. puiseux compues a Puiseux series of y corresponding o a single line segmen of he Newon polygon. disribue_denominaorfrac, var, lim disribues he numeraor of a fracion over is denominaor, limiing he powers of var o be no higher han lim. recener_curvef,x,y,x0,y0 changes variables on an algebraic curve so ha a given poin x0,y0 is moved o 0,0. monomial_powersf,x,y,x0,y0 reurns a lis of he powers ha appear in he monomials of a recenered curve. lower_convex_poinslis akes a monomial_powers lis as inpu and reurns he subse corresponding o he lower convex hull of he Newon polygon. lower_convex_hulllis, x is used by newon_polygon o graph he lower convex hull.
5 %i4 in_namespacepuiseux$ %i5 recener_curvef,x,y,x0,y0 := block[xcoeff, newf:0], if x0 = inf hen f:subsx=/x, f, x0:0, if y0 = inf hen f:subsy=/y, f, y0:0, f : numrasimpf, f : expandsubs[y=yy0, x=xx0], f, for xpow: 0 hru hipowf, x do xcoeff : coefff, x, xpow, for ypow: 0 hru hipowxcoeff, y do newf : newf radcanrasimpcoeffxcoeff, y, ypow, newf $ %i /* why doesn' his produce cdos? */ aylorsinx,x,0,; %o x x %i7 monomial_powersf,x,y,x0,y0 := block [resul: [], xcoeff], f : recener_curvef,x,y,x0,y0, for xpow: 0 hru hipowf, x do xcoeff : coefff, x, xpow, if xcoeff # 0 hen for ypow: 0 hru hipowxcoeff, y do if coeffxcoeff, y, ypow # 0 hen resul: endcons[ypow,xpow], resul, resul $
6 %i8 /* lis is a lis of pairs, like [[0,], [0,], [,0 */ /* his funcion reurns he poins on he lower convex hull */ lower_convex_poinslis := block [resul, nx, slopes, lowes_slope], $ /* sep - sor he lis firs by increasing x values, */ /* hen by increasing y values */ lis: sorlis, lambda[u,v], u[] < v[] or u[] = v[] and u[] < v[], /* sep - discard all poins direcly above oher poins */ lis: lreducelambda[u,v], if lasu[] = v[] hen U else endconsv,u, lis, [lis[, /* sep - sar wih he poin on he y-axis, */ /* hen roae around he lower convex hull, */ /* adding poins as we go */ resul: [poplis], while lenghlis > 0 do nx: lasresul, slopes: maplambda[u], nx - u[] / nx - u[], lis, lowes_slope: sorslopes[], while lenghslopes > 0 and slopes[] > lowes_slope do popslopes, poplis, while lenghslopes > 0 and slopes[] = lowes_slope do popslopes, resul:endconspoplis, resul, resul %i9 /* his funcion graphs a line around he lower convex hull */ lower_convex_hullinlis, x := block[lis], lis: sorinlis, lambda[u,v], u[] < v[], while lenghlis >= and lis[][] < x do poplis, if lenghlis >= hen lis[][] x - lis[][] * lis[][] - lis[][] / lis[][] - lis[][] else %nan $
7 %i0 newon_polygonf, x, y, x0, y0 := block [newon_poins, convex_hull_poins, maxx, maxy, maxxy, filename], $ newon_poins : monomial_powersf,x,y,x0,y0, convex_hull_poins : lower_convex_poinsnewon_poins, maxx: lreducemax, mapfirs, convex_hull_poins, maxy: lreducemax, mapsecond, convex_hull_poins, maxxy: maxmaxx, maxy, filename: nex_pdf_filename, plod[[discree, newon_poins], 'lower_convex_hullconvex_hull_poins, l], [l,0,maxxy], [y,0,maxxy], [syle, poins, [lines, 5, [color, red, blue], [poin_ype, bulle], [legend, false], [xlabel, false], [xics, ], [yics, ], [ylabel, false], [pdf_file, filename], embed_laex_graphicfilename
8 %i puiseuxf,x,y,x0,y0,deg,r,s,p := block[n:maxdeg,s, xexpansion, yexpansion, res, allans, ans, eqns, deqn], if x0 # inf hen xexpansion: x0 ^r else xexpansion: /^r, yexpansion: y0 sum^i*a[i],i,s,n, res: subs[x=xexpansion, y=yexpansion], f/^p, res: expandnumradcanrasimpres, eqns: creae_liscoeffres,,i,i,0,n-s, /* eqns[] should be a polynomial in a[s] */ /* We can only handle is simple roos, so compue */ /* is derivaive o check ha */ deqn: diffeqns[], a[s], allans: sorradcansolveeqns[],a[s], /* Maxima's solve can' handle arbirary high powered */ /* polynomials. Check o see if i worked. */ if apply"", mulipliciies # hipoweqns[], a[s] hen error"nyi: solve didn' work in puiseux", /* If r >, hen we expec each soluion o be duplicaed */ /* r imes, differing only by r'h roos of uniy. These */ /* differen soluions all correspond o he same branch, */ /* so we'll remove all bu one of each. */ /* We exclude zero as a soluion, since zero corresponds */ /* o a higher degree soluion han he ones we're seeking. */ ans: [], for a in allans do if rhsa # 0 and no memberrasimpa^r, rasimpans^r hen if rasimpsubsa[s]=a, deqn = 0 hen error"nyi: muliple roo in puiseux" else ans: endconsa, ans, /* For each soluion o eqns[], solve he remaining eqns. */ /* IFT guaranees unique soluions o all eqns. */ ans: mapmakelis, ans, maplambda[oneans], block[eqns:subsoneans, eqns], for i: hru n-s do block[s:radcansolveeqns[i],a[si, if no lisps or lenghs # hen error"puiseux: inernal error", oneans: endconss[], oneans, eqns: subsoneans, eqns, subsoneans, yexpansion, ans $
9 %i /* puiseux_fracexp conrols wheher series are reurned wih * fracional exponens, or using an auxilary variable. */ puiseux_fracexp : false $ %i disribue_denominaorfrac, var, lim := block [resul: 0, n: numexpandfrac, d: denomexpandfrac], for i: lopown, var hru minhipown, var, lim hipowd, var do resul : resul radcanrecformrasimpcoeffn, var, i/d*var^i, resul $ %i4 puiseuxf,x,y,x0,y0,deg,r,s,p,b := block[xsubs, subs, differenial:, adjusmen:, maxpow, maxypow, rf:0, yserieslis, resul], if x0 # inf hen xsubs: x = x0 ^r, subs: ^r = x - x0 else xsubs: x = / ^r, subs: ^r = /x, /* deg is he highes -degree we wan in our final resul */ maxpow: deg, if no freeofdelx, b hen b: rasimpb/delx, if no freeofdelx, b hen error"puiseux: requesed differenial can' be normalized", differenial: del, if x0 # inf hen /* x= ^r -> dx = r ^r- d */ /* so we don' need as many erms o ge o maxpow */ maxpow : maxpow - r-, adjusmen : r * ^r- else /* x= ^-r -> dx = -r ^-r- d */ /* so we need more erms o ge o maxpow */ maxpow : maxpow r, adjusmen : -r * ^-r-, /* Expand each of he coefficiens of he requesed */ /* funcion as a Taylor or Lauren series in x, */ /* leaving y alone. We'll laer subsiue a Puiseux */ /* series for y. */ maxypow : 0, for i: 0 hru hipowb, y do block[icomponen], /* s is he lowes -degree expeced in he expansion of y */ /* if y0 is non-zero, hen use mins,0 insead of s */ /* herefore, maxpow-s*i is he highes -degree required in rf's expansion */ /* ceilingmaxpow-s*i/r is he highes x-degree required */ icomponen: rasimpsubsxsubs, aylorrasimpcoeffb, y, i, x, x0, ceilingmaxpow-mins,0*i/r * adjusmen, /* maxpowrf = minpowicomponen maxpowy * i */ if i # 0 hen maxypow: ceilingdeg - lopowicomponen,/i, rf: rf icomponen * y^i, /* expand y o he requesed degree */ yserieslis: puiseuxf,x,y,x0,y0,maxypow,r,s,p, maplambda[yseries], resul: rasimpsubsy=yseries, rf, resul: disribue_denominaorresul,, deg, if puiseux_fracexp hen subs=x-x0^/r, resul * differenial else [resul * differenial, subs], yserieslis $
10 %i5 puiseux4f,x,y,x0,y0,deg,rf := block[resul: [], lasslope : 0, sign, mp, pairs], if y0 # inf hen sign: - else /* If we're expanding y a infiniy, don' recener y, */ /* bu use upward sloping segmens on he Newon polygon */, y0 : 0, sign: /* Make a lis of all line segmens on he Newon polygon */ mp: lower_convex_poinsmonomial_powersf,x,y,x0,y0, if sign = - and mp[] = [0,0] hen errorconca"puiseux: coordinaes do no solve equaion of curve", if sign = and lasmp[] = 0 hen errorconca"puiseux: coordinaes do no solve equaion of curve", pairs: makelis[mp[i], mp[i, i, lenghmp-, for pair in pairs do block[dela, g, r, s, p], dela: pair[]-pair[], if dela[] * sign > 0 hen g: gcddela[],dela[], r: dela[]/g, s: -dela[]/g, p: pair[][]*r pair[][]*s, if s/r # lasslope hen resul: appendresul, puiseuxf,x,y,x0,y0,deg,r,s,p,rf, lasslope : s/r, resul $
11 %i puiseuxf,x,y,x0,y0,deg,[rafunc] := block[resul: [], rf], /* If he caller requesed a specific raional funcion o */ /* be expaned, use modulo o normalize i. Defaul is y. */ if lenghrafunc > 0 hen rf: maxima modulorafunc[], f, y else rf: y, /* If y0 is false, compue he possible soluions for y0. */ if y0 = false hen block[ys, f0], if x0 # inf hen f0 : subsx=x0, f else f0 : subsx=0, numrasimpsubsx=/x, f, ys : uniqueradcanrecformsolvef0, y, if apply"", mulipliciies # hipowf0, y hen error"nyi: solve didn' work in puiseux", for yi in ys do resul: appendresul, puiseux4f,x,y,x0,rhsyi,deg,rf, /* If subsiuing x0 ino f reduced hipowy, hen */ /* some of our soluions are a infiniy. */ if hipowf,y # hipowf0,y hen resul: appendresul, puiseux4f,x,y,x0,inf,deg,rf else resul: puiseux4f,x,y,x0,y0,deg,rf, resul $ %i7 %i8 %i9 exporpuiseux, puiseux_fracexp, newon_polygon$ in_namespacemaxima$ imporpuiseux$
12 Example 7.4. Consruc Puiseux expansions of y a he muliple poins of he curve y = x We normalize he defining polynomial by wriing i as y x = 0. Where does i have muliple poins? We compue he discriminan: %i4 discriminany^ x^ -, y; %o4 4 x x The muliple poins of y = x lie a he roos of he discriminan, which are x = ±. In boh cases, y = 0 is he only soluion, so he curve has muliple poins a x, y = ±, 0. The parial derivaive of he defining polynomial wih respec o x is x, which is non-zero, so neiher of hese muliple poins are singular; we ll ge ramificaion insead. The analysis is almos he same in boh cases, so I ll jus do, 0. Firs, consrucion of he Newon polygon requires recasing he curve s polynomial ino a form cenered abou he poin being analyzed, i.e, y x x = 0. Nex, we consruc he Newon polygon by ploing he monomial powers, puing he y exponens on he horizonal axis and he x exponens on he verical: 0 0 The only segmen on he Newon polygon s lower convex hull has slope / and widh, elling us ha wo of our roos he widh of he segmen will require a single Puiseux series wih ramificaion index he denominaor of he slope: x =
13 We know ha y can be expressed as a power series in wih iniial exponen he numeraor of he slope: y = a a a Now, subsiuing hese expressions for x and y ino he curve s defining equaion y x = 0 and seing all coefficiens of o zero, we find: %i45 rasimpsubs [x=^, y=a[]*a[]*^a[]*^], y^x^-; %o45 a a a 5 a a a 4 a a a a = 0 a a = 0 a a a = 0 The firs equaion ells us ha a = ± i, he second equaion ells us ha a = 0 and he hird equaion ells us ha a = ± i, so 4 x = ; y = ± [ ] i 4 i I would seem ha we have wo differen series o chose from. This is no really he case, as hey differ by only a 80 roaion in he -plane, as can been seen by subsiuing =, which ransforms one of he y-series ino he oher, while leaving he x-series unchanged. Le s confirm his resul wih Maxima: %i4 puiseuxy^ x^ -, x, y,, 0, ; %o4 [[ i i, = x Now, le s analyze he poin a infiniy. We move infiniy o a finie poin 0 wih he subsiuion x = u, hen combine all of our erms over a common denominaor and discard he denominaor. Our curve becomes: y u u = 0
14 0 0 The Newon polygon s lower convex hull has a single line segmen, slope, lengh, elling us ha we ll have wo separae poles, each wih ramificaion index. Thus, u can be used direcly as a uniformizing variable, and we posulae an expansion for y in he form: y = a u a 0 a u a u a u Plugging his ino y u u and seing all he resuling coefficiens o zero, we conclude: %i48 rasimpsubs [y=a[-]*/ua[0]a[]*ua[]*u^a[]*u^], y^*u^-u^; %o48 a u 8 a a u 7 a a a u a 0 a a a u 5 a a a 0 a a u 4 a a a 0 a u a a a 0 u a a 0 u a a = ±i; a 0 = 0; a = i; a = 0; a = 8 i y = ±i u iu 8 iu This ime, here is no ramificaion, since u, and no a power of u, is x. We acually have wo disinc series ha will yield wo differen values of y for each value of u. Geomerically, we have wo shees ha approach each oher and ouch a a singular poin where he curve is no locally Euclidean.
15 %i49 puiseuxy^ x^ -, x, y, inf, inf,, y; Example 7.5. %o49 [[ i 8 i i, = ], [ i x 8 i i, = x [Bl47] 8 Compue expansions a all muliple poins of y x y x = 0 We begin by compuing he discriminan of he equaion, which gives us he locaions of he muliple poins. %i50 discriminany^ x^*y x, y; %o50 x 4 x 7 7 The muliple poins lie over he roos of his equaion: x = 0 and he seven roos of 4x 7 7 = 0. Infiniy also needs o be examined. We begin wih x = 0: %i5 puiseuxy^ x^*y x, x, y, 0, false, 0; %o5 [[ 8, = x This resul shows ha we have a single cycle a x, y = 0, 0 wih hree shees. Now, le s look a a specimen roo of 4x 7 7 = 0: %i5 g: -7/4^/7; %o %i5 puiseuxy^ x^*y x, x, y, g, false, ;
16 %o5 [[ 7 i , = x ], [ , = x 7 7 We have one shee of wo cycles a g, /g and an ordinary poin a g, /g. Finally, le s look a wha happens when x goes o infiniy: %i54 puiseuxy^ x^*y x, x, y, inf, false, 0; 4 7 %o54 [[ 9, = ] [ 4, x i, = x Here we have an ordinary poin a, 0 and a single cycle of wo shees a,. Example 7.. Find he principal pars of y on he curve y = x The principal par of an algebraic funcion is he par of is series expansion wih negaive exponens. Theorem 7. saes ha an algebraic funcion is compleely deermined, up o adding a consan, by is principal pars. The firs sep is o locae he funcion s poles, which in his case is simply he places where he denominaor is zero, and ha s jus x = ±. Now, if we use puiseux, we can jus reques a series runcaed a he erm: %i55 puiseuxy^ x^ -, x, y,, 0, -, /y; %o55 [[ i, = x Example 7.7. Find he principal pars of x y dx on he curve y = x Differenial forms are no funcions, and have differen series expansions, due o he presence of he differenial, which mus be adjused a ramificaion poins. Le s expand x y a x = : %i5 puiseuxy^ x^ -, x, y,, 0, 5, x/y;
17 %o5 [[ 7 i i i 5 i, = x Now x =, so dx = d. Thus, muliplying x by dx and changing our y variable o will muliply all of he erms in our expansion by : %i57 puiseuxy^ x^ -, x, y,, 0,, x/y*delx; %o57 [[ 7 i 5 i 4 9 i Even hough x has a pole a x =, x dx does no! y y Is behavior a infiniy also requires analysis. i d, = x %i58 puiseuxy^ x^ -, x, y, inf, inf,, x/y; %o58 [[ i, = ] [, i, = x x x has no poles a infiniy, and approaches he limiing values ±i as x and y approach infiniy. The differenial x dx, on he oher hand, requires us o muliply y y by dx, and since x =, dx = d. %i59 puiseuxy^ x^ -, x, y, inf, inf, -, x/y * delx; %o59 [[ i d, = ] [ i d, x, = x In shor, while x has poles only a ±, 0, x dx has poles only a infiniy. y y Example 7.8. [Bl47] 8. Compue expansions a all muliple poins of he exercises in To faciliae his example, le s define an auxiliary funcion o perform he analysis:
18 %i0 analyze_muliple_poinsf, [args] := block [discriminan: discriminanf, y, deg], displaydiscriminan, deg : if lenghargs > 0 hen args[] else, for r in solvediscriminan, x do disppuiseuxf, x, y, rhsr, false, deg, disppuiseuxf, x, y, inf, false, 5 $ y y x = 0 %i analyze_muliple_poinsy^ - *y *x$ discriminan = 08 x x [[ ] 9, = x, [ 8 4 ] ] 9, = x [ [ 8 4 ] [ 9, = x i, 9, = x [[ 5 5, = x y y x %i analyze_muliple_poinsy^ *y - x$ discriminan = 7 x 4
19 [[ i 8 i, = x ] [ i i, 4 ] ] 9 i, = x i [ [ i 4 ] [ 9 i, = x i, 8 i i, = x i [[ 5, = x y y x %i analyze_muliple_poinsy^ - *y^ - x$ discriminan = 7 x x 4 [[ 4 ] 9, = x 4, [ 8, = x 4 [[ 8 i ], = x, [ 4 9, = x [[ , = x y 4 4y x This curve produces coordinaes ha aren recener ed properly.
20 puiseux: coordinaes do no solve equaion of curve %i4 errcachanalyze_muliple_poinsy^4-4*y - x$ discriminan = 5 x x x 9 puiseux: coordinaes do no solve equaion of curve y 4 xy %i5 analyze_muliple_poinsy^4*-*x*y^$ discriminan = 409 x x [[ ] i i, = x, [ i i, = x [[ ] [, = x,, = x [[ 5 8, = ] [ 5, x 8, = x y y x %i analyze_muliple_poinsy^-*y^x^, $ discriminan = 7 x x x
21 i i 7 i, = x, i i, = x 75 i i 5 59 i i i i i i 5 i 5 4 7, = x i, 4 59 i i 4 5 i 7 8 i, = x i [[ ] [ 8, = x 4, , = x
22 i i 7 i, = x, i 4 5 i 7 8 i, = x 75 i i 5 97 i 59 5 i 7 i i i 7 i, = x, 9 i 4 5 i 7 8 i, = x i i 5 97 i i i [[ ] [ 8, = x, 5 i i, = x 4 97 i
23 [[ ] [ ] 8, = x, 8, = x, [ 9, = x [ [ 4, = ] [ i 4, x ] [ i i, = i 4, x i i, = x y y x x %i7 analyze_muliple_poinsy^-*y*x^*-x^$ discriminan = 08 x x x 4 x , = x, 4 7, = x 9
24 5 9, = x i , 4, = x 5 i i 4, = x , 4 7 i 9, = x 5 i i 4, = x , 4 7 i 9, = x
25 [ [8 ] [ 4 9 9, = x, 5 ] [ 4 9, 5, = x, = x [ [8 ] [ 4 9 9, = x, 5 ] [ 4 9, 5, = x, = x [[ 4 4 4, = x y y x x %i8 analyze_muliple_poinsy^-*y*x^*-x^$ discriminan = 08 x x x x x
26 i 4 i 4 i i i, = x, 9 5 i 5, = x 7 i 4 4 i i i i, = x,, = x 9 5 i 5 7
27 4, i, = x 0 7, = x 4 i 5, = x 5 4, = x, 0 7 i i 4 4 i, = x i 9 5 i 5, i i, = x 7
28 i 4 i 4, = x 9 5 i 5, i 7, = x [[ i, = x ] [ i i i, ] [ i i, = x, i i, = x [[ i, = x ] [ i i, i, = x ] [ i i, i i, = x
29 [ [, = x ] [, ] [, = x,, = x [ ] , = i 5, x 4 i 4 4 i i 5 4 i, = i 5 4 i 4 4, x 5 i i i, = x 4 xx y 4 4x x y 4/7x 4 %i9 analyze_muliple_poins*x*x-*y^4-4*x-*x-*y^ 4/7*x-^4$ discriminan = 77 x x 4 x x x i 5 i 8 8 9, = x i 5, 8 i 8 9, = x 9 i i 8, 8 7 i, = x 9 i i 8, i 9 8, = x 7 9
30 [ 5 4 i i ], = x, 5 i i i i 4, = x, 5888, = x [ [ 4 ], = x, i 4 [ 5 i 8 5 i, = x i i ] [, = x, 5 i ], [ ] ], = x [[ i i 4 i, 4 = x i i i i i i , i i i i , i i i i , i i
31 i 5 [[ 5 i 4 7 i i 7 i 0 4 i, = x i ], 5 i i i 5 [ 5 i 4 48 i y 5 x y /5 5 x x, = x This funcion produces complicaed fifh degree equaions ha Maxima can solve. NYI: solve didn work in puiseux %i70 errcachanalyze_muliple_poins y^5 x^-*y^4-4^4/5^5*x^*x^-$ discriminan = x 4 x x 4 x 4 x x x 4 x x NYI: solve didn work in puiseux y axy x This funcion conains an exra variable and is, in fac, a family of algebraic curves. %i7 analyze_muliple_poinsy^ - *a*x*y x^$ discriminan = 7 x x 4 a i aan 0, a π aan 0, a π a i sin cos i a 4 i 4 a, = x, 7 a i 4 i 4 a i a, = x
32 i aan 0, a π aan 0, a π a i sin cos i a 4 i 4 a, = x, 7 a i 4 i 4 a i a, = x [[ aan 0, a π aan 0, a π a i sin cos ] [ a, = x 4 a, 7 a 5 4 a, = x 4 a [[ ] [ a, = x, aan 0, a i sin aan 0, a a cos, = x [ [4 a 5 a4 a 9 a, = ] [ i a 4, x ] [ i a i a, = i a 4, x i a i a, = x y xy x %i7 analyze_muliple_poinsy^ - x*y - x^$
33 discriminan = x 7 x 4 [[ 5 i 9, = x 4 ], [ , = x 4 7 [ [, = x ] [,, = x [[ , = x y x y x %i7 analyze_muliple_poinsy^ - *x^*y *x$ discriminan = 08 x x x x [ [ i 4 4 ] [ 9 i, = x i, 7 9 i i, = x i [[ 7 i 9 i, = x ] i i, [ 4 4 ] ] 9 i, = x i
34 [[ 7 9 i ] [, = x, 4 4 9, = x [[, = x [[ 4 4 ] [ 7 9, = x, 9, = x [ [8 5 8, = x ] [, = x, ] [, , = x y xy x %i74 analyze_muliple_poinsy^ - *x*y *x^$ discriminan = 08 x x [[ 8 8 ] [, = x,, = x [[ ] [ 5 9, = x, 9 i, = x [[ , = x
35 y y x %i75 analyze_muliple_poinsy^ - *y x^$ discriminan = 7 x x i i, = x sin 7 π i, = x i i cos 7 π, i [ 87 i 9 ] 7 5 i i, = x i sin 7 π i cos 7 π i, [ 87 i 9 7, = x ] i
36 i, = x, 5 i 5 i 9 7, = x i i, = x sin π i, = x i i cos π, i [ 87 i 9 ] 7 5 i i sin π i cos π, = x i i, [ 87 i 9 7, = x ] i
37 [ i, = x 5 i 5 π i sin π cos ], 9 7, = x 87 i 9 7, = x i 5 i 5, [ i, = x i i ] 87 i 9 7, = x i 5 i 5, i, = x [ i i ] [[ 9 7 ] [, = x, 5, = x
38 87 i 9 7, = x i 5 i 5, i, = x [ i i ] 87 i 9 7, = x i 5 i 5, i, = x [ i i ] [[ 9 7 ] [, = x 5, i, = x [ [, = ] [ ] [ i,, = i,, = x x x
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 informationQuantitative 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 informationEECS 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 informationIt 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 informationCENG 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 informationFill 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 informationSam 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 informationProject #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 informationAML710 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 information1.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 informationMATH Differential Equations September 15, 2008 Project 1, Fall 2008 Due: September 24, 2008
MATH 5 - Differenial Equaions Sepember 15, 8 Projec 1, Fall 8 Due: Sepember 4, 8 Lab 1.3 - Logisics Populaion Models wih Harvesing For his projec we consider lab 1.3 of Differenial Equaions pages 146 o
More informationEngineering 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 informationImplementing 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 information4. 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 informationSTEREO 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 informationChapter 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 informationA Principled Approach to. MILP Modeling. Columbia University, August Carnegie Mellon University. Workshop on MIP. John Hooker.
Slide A Principled Approach o MILP Modeling John Hooer Carnegie Mellon Universiy Worshop on MIP Columbia Universiy, Augus 008 Proposal MILP modeling is an ar, bu i need no be unprincipled. Slide Proposal
More informationSpline 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 informationNEWTON 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 informationCurves & 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 informationNumerical 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 information4.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 information4 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 informationRay Casting. Outline. Outline in Code
Foundaions of ompuer Graphics Online Lecure 10: Ray Tracing 2 Nus and ols amera Ray asing Ravi Ramamoorhi Ouline amera Ray asing (choose ray direcions) Ray-objec inersecions Ray-racing ransformed objecs
More informationShortest 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 informationCOMP26120: 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 informationTHERMAL 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 informationImage Content Representation
Image Conen Represenaion Represenaion for curves and shapes regions relaionships beween regions E.G.M. Perakis Image Represenaion & Recogniion 1 Reliable Represenaion Uniqueness: mus uniquely specify an
More informationCoded 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 informationEffects 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 informationPART 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 informationthe 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 informationAnnouncements 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 informationLast 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 informationLecture 18: Mix net Voting Systems
6.897: Advanced Topics in Crypography Apr 9, 2004 Lecure 18: Mix ne Voing Sysems Scribed by: Yael Tauman Kalai 1 Inroducion In he previous lecure, we defined he noion of an elecronic voing sysem, and specified
More informationScattering 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 informationMatlab5 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 informationToday. 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 informationProjection & 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 informationMIC2569. 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 informationData 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 informationRULES OF DIFFERENTIATION LESSON PLAN. C2 Topic Overview CALCULUS
CALCULUS C Topic Overview C RULES OF DIFFERENTIATION In pracice we o no carry ou iffereniaion from fir principle (a ecribe in Topic C Inroucion o Differeniaion). Inea we ue a e of rule ha allow u o obain
More informationDEFINITION OF THE LAPLACE TRANSFORM
74 CHAPER 7 HE LAPLACE RANSFORM 7 DEFINIION OF HE LAPLACE RANSFORM REVIEW MAERIAL Improper inegral wih infinie limi of inegraio Inegraion y par and parial fracion decompoiion INRODUCION In elemenary calculu
More informationAn 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 informationREDUCTIONS BBM ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM. Bird s-eye view. May. 12, Reduction.
BBM 0 - ALGORITHMS DEPT. OF COMPUTER ENGINEERING ERKUT ERDEM REDUCTIONS May., 0 Bird s-eye view Desideraa. Classify problems according o compuaional requiremens. complexiy order of growh examples linear
More informationFIELD 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 informationChapter 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 informationTest - 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 informationME 406 Assignment #1 Solutions
Assignmen#1Sol.nb 1 ME 406 Assignmen #1 Soluions PROBLEM 1 We define he funcion for Mahemaica. In[1]:= f@_d := Ep@D - 4 Sin@D (a) We use Plo o consruc he plo. In[2]:= Plo@f@D, 8, -5, 5
More informationChapter 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 informationSchedule. 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 informationWhy 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 informationMOTION 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 informationMotor 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 informationParametric equations 8A
Parameric equaions 8A a so () y () Susiue () ino (): y ( ) y 5, So he domain of f() is 6. y, So he range of f() is y 7. d so () y () Susiue () ino (): y y, 0 So he domain of f() is. 5 so 5 () y () Susiue
More informationMidterm 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 informationMass-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 informationStreamline Pathline Eulerian Lagrangian
Sreamline Pahline Eulerian Lagrangian Sagnaion Poin Flow V V V = + = + = + o V xi y j a V V xi y j o Pahline and Sreakline Insananeous Sreamlines Pahlines Sreaklines Maerial Derivaive Acceleraion
More informationSREM: A Novel Multicast Routing Algorithm - Comprehensive Cost Analysis
REM: A Novel Mulicas Rouing Algorihm - Comprehensive Cos Analysis Yewen Cao and Khalid Al-Begain chool of Compuing, Universiy of Glamorgan, CF37 DL, Wales, U.K E-mail:{ycao,kbegain}@glam.ac.uk Absrac Ever-increasing
More informationImage 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 informationIntegro-differential splines and quadratic formulae
Inegro-differenial splines and quadraic formulae I.G. BUROVA, O. V. RODNIKOVA S. Peersburg Sae Universiy 7/9 Universiesaya nab., S.Persburg, 9934 Russia i.g.burova@spbu.ru, burovaig@mail.ru Absrac: This
More informationOptimal Crane Scheduling
Opimal Crane Scheduling Samid Hoda, John Hooker Laife Genc Kaya, Ben Peerson Carnegie Mellon Universiy Iiro Harjunkoski ABB Corporae Research EWO - 13 November 2007 1/16 Problem Track-mouned cranes move
More informationComputer 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 informationThe Roots of Lisp paul graham
The Roos of Lisp paul graham Draf, January 18, 2002. In 1960, John McCarhy published a remarkable paper in which he did for programming somehing like wha Euclid did for geomery. 1 He showed how, given
More informationUSBFC (USB Function Controller)
USBFC () EIFUFAL501 User s Manual Doc #: 88-02-E01 Revision: 2.0 Dae: 03/24/98 (USBFC) 1. Highlighs... 4 1.1 Feaures... 4 1.2 Overview... 4 1.3 USBFC Block Diagram... 5 1.4 USBFC Typical Sysem Block Diagram...
More informationChapter 8 LOCATION SERVICES
Disribued Compuing Group Chaper 8 LOCATION SERVICES Mobile Compuing Winer 2005 / 2006 Overview Mobile IP Moivaion Daa ransfer Encapsulaion Locaion Services & Rouing Classificaion of locaion services Home
More informationA 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 informationMotion 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 informationCMPSC 274: Transac0on Processing Lecture #6: Concurrency Control Protocols
CMPSC 274: Transac0on Processing Lecure #6: Concurrency Conrol Proocols Divy Agrawal Deparmen of Compuer Science UC Sana Barbara 4.4.1 Timesamp Ordering 4.4.2 Serializa0on Graph Tes0ng 4.4.3 Op0mis0c Proocols
More informationA 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 informationLearning 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 informationAn Efficient Delivery Scheme for Coded Caching
201 27h Inernaional Teleraffic Congress An Efficien Delivery Scheme for Coded Caching Abinesh Ramakrishnan, Cedric Wesphal and Ahina Markopoulou Deparmen of Elecrical Engineering and Compuer Science, Universiy
More informationScheduling. 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 informationConstant-Work-Space Algorithms for Shortest Paths in Trees and Simple Polygons
Journal of Graph Algorihms and Applicaions hp://jgaa.info/ vol. 15, no. 5, pp. 569 586 (2011) Consan-Work-Space Algorihms for Shores Pahs in Trees and Simple Polygons Tesuo Asano 1 Wolfgang Mulzer 2 Yajun
More informationtr_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Report no TR-22/88
r_lisp.asc Page 1 McESE-FranzLISP: McMASTER EXPERT SYSTEM EXTENSION OF FranzLISP F. Franek Technical Repor no TR-22/88 Deparmen of Compuer Science and Sysems McMaser Universiy 1988 McESE-FranzLISP: McMASTER
More information! errors caused by signal attenuation, noise.!! receiver detects presence of errors:!
Daa Link Layer! The Daa Link layer can be furher subdivided ino:!.! Logical Link Conrol (LLC): error and flow conrol!.! Media Access Conrol (MAC): framing and media access! differen link proocols may provide
More informationDefinition 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 informationPrinciples of MRI EE225E / BIO265. Lecture 10. Instructor: Miki Lustig UC Berkeley, EECS. M. Lustig, EECS UC Berkeley
Principles of MRI Lecure 0 EE225E / BIO265 Insrucor: Miki Lusig UC Berkeley, EECS Bloch Eq. For Recepion No B() : 2 4 Ṁ x Ṁ y Ṁ z 3 5 = 2 6 4 T 2 ~ G ~r 0 ~G ~r T 2 0 0 0 T 3 2 7 5 4 M x M y M z 3 5 +
More informationVirtual Recovery of Excavated Archaeological Finds
Virual Recovery of Excavaed Archaeological Finds Jiang Yu ZHENG, Zhong Li ZHANG*, Norihiro ABE Kyushu Insiue of Technology, Iizuka, Fukuoka 820, Japan *Museum of he Terra-Coa Warrlors and Horses, Lin Tong,
More information1 œ 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 informationPacket Scheduling in a Low-Latency Optical Interconnect with Electronic Buffers
Packe cheduling in a Low-Laency Opical Inerconnec wih Elecronic Buffers Lin Liu Zhenghao Zhang Yuanyuan Yang Dep Elecrical & Compuer Engineering Compuer cience Deparmen Dep Elecrical & Compuer Engineering
More informationX-Splines : A Spline Model Designed for the End-User
X-Splines : A Spline Model Designed for he End-User Carole Blanc Chrisophe Schlic LaBRI 1 cours de la libéraion, 40 alence (France) [blancjschlic]@labri.u-bordeaux.fr Absrac his paper presens a new model
More informationOutline. 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 informationMOBILE COMPUTING. Wi-Fi 9/20/15. CSE 40814/60814 Fall Wi-Fi:
MOBILE COMPUTING CSE 40814/60814 Fall 2015 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationMOBILE COMPUTING 3/18/18. Wi-Fi IEEE. CSE 40814/60814 Spring 2018
MOBILE COMPUTING CSE 40814/60814 Spring 2018 Wi-Fi Wi-Fi: name is NOT an abbreviaion play on Hi-Fi (high fideliy) Wireless Local Area Nework (WLAN) echnology WLAN and Wi-Fi ofen used synonymous Typically
More informationM y. Image Warping. Targil 7 : Image Warping. Image Warping. 2D Geometric Transformations. image filtering: change range of image g(x) = T(f(x))
Hebrew Universi Image Processing - 6 Image Warping Hebrew Universi Image Processing - 6 argil 7 : Image Warping D Geomeric ransormaions hp://www.jere-marin.com Man slides rom Seve Seiz and Aleei Eros Image
More informationTraditional Rendering (Ray Tracing and Radiosity)
Tradiional Rendering (Ray Tracing and Radiosiy) CS 517 Fall 2002 Compuer Science Cornell Universiy Bidirecional Reflecance (BRDF) λ direcional diffuse specular θ uniform diffuse τ σ BRDF Bidirecional Reflecance
More informationDesign 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 informationNonparametric CUSUM Charts for Process Variability
Journal of Academia and Indusrial Research (JAIR) Volume 3, Issue June 4 53 REEARCH ARTICLE IN: 78-53 Nonparameric CUUM Chars for Process Variabiliy D.M. Zombade and V.B. Ghue * Dep. of aisics, Walchand
More informationCAMERA 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 informationAssignment 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 informationAnnouncements. 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 informationSimultaneous 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 informationparametric spline curves
arameric sline curves comuer grahics arameric curves 9 fabio ellacini curves used in many conexs fons animaion ahs shae modeling differen reresenaion imlici curves arameric curves mosly used comuer grahics
More informationMARSS Reference Sheet
MARSS Reference Shee The defaul MARSS model (form="marxss") is wrien as follows: x = B x 1 + u + C c + w where w MVN( Q ) y = Z x + a + D d + v where v MVN( R ) x 1 MVN(π Λ) or x MVN(π Λ) c and d are inpus
More informationSOT: Compact Representation for Triangle and Tetrahedral Meshes
SOT: Compac Represenaion for Triangle and Terahedral Meshes Topraj Gurung and Jarek Rossignac School of Ineracive Compuing, College of Compuing, Georgia Insiue of Technology, Alana, GA ABSTRACT The Corner
More informationTimers CT Range. CT-D Range. Electronic timers. CT-D Range. Phone: Fax: Web: -
CT-D Range Timers CT-D Range Elecronic imers Characerisics Diversiy: mulifuncion imers 0 single-funcion imers Conrol supply volages: Wide range: -0 V AC/DC Muli range: -8 V DC, 7 ime ranges from 0.0s o
More informationVoltair Version 2.5 Release Notes (January, 2018)
Volair Version 2.5 Release Noes (January, 2018) Inroducion 25-Seven s new Firmware Updae 2.5 for he Volair processor is par of our coninuing effors o improve Volair wih new feaures and capabiliies. For
More informationA Fast Non-Uniform Knots Placement Method for B-Spline Fitting
2015 IEEE Inernaional Conference on Advanced Inelligen Mecharonics (AIM) July 7-11, 2015. Busan, Korea A Fas Non-Uniform Knos Placemen Mehod for B-Spline Fiing T. Tjahjowidodo, VT. Dung, and ML. Han Absrac
More informationLow-Cost WLAN based. Dr. Christian Hoene. Computer Science Department, University of Tübingen, Germany
Low-Cos WLAN based Time-of-fligh fligh Trilaeraion Precision Indoor Personnel Locaion and Tracking for Emergency Responders Third Annual Technology Workshop, Augus 5, 2008 Worceser Polyechnic Insiue, Worceser,
More information