3D Image Representation through Hierarchical Tensor Decomposition, Based on SVD with Elementary Tensor of size 2 2 2
|
|
- Kathryn Preston
- 6 years ago
- Views:
Transcription
1 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev 3D Imge Represenion roug Hierrcicl ensor Decomposiion, Bse on SVD wi Elemenry ensor of size ROUME KOUCHEV Rio Communicions n Vieo ecnologies ecnicl Universiy of Sofi Bul. Kl. Orisky 8, Sofi BULGARIA rkounc@u-sofi.g; p:// ROUMIAA KOUCHEVA K Engineering Druj, Bl. 44/ BULGARIA kouncev_r@yoo.com Asrc: - As i is known, groups of correle D imges of vrious kin coul e represene s 3D imges, wic re memiclly escrie s 3 r orer ensors. Vrious generlizions of e Singulr Vlue Decomposiion (SVD exis, ime e ensor escripion reucion. In is work, new pproc is presene for 3 r orer ensor ecomposiion, were unlike e fmous meos for ecomposiion componens efiniion, ierive clculions re no use. e sic srucure uni of e new ecomposiion is n elemenry ensor (E of size, wic uils e 3D ensors of size, were = n. e ecomposiion of e single ЕТ is execue y using Hierrcicl -level SVD, were (in ec level e SVD of size (SVD is pplie on ll su-mrices oine fer e elemenry ensor unfoling. e so clcule new su-mrices of e SVD in ec ierrcicl level, re rerrnge in ccornce wi e lessening of eir corresponing singulr vlues. e compuionl complexiy of e new ensor ecomposiion is lower n of e ecomposiions, se on ierive meos, n permis prllel clculions for ll SVD for e su-mrices in given ierrcicl level. Key-Wors: - 3D imges, ensor ecomposiion, Hierrcicl SVD (HSVD, elemenry ensor of size. Inroucion In e ls yers, e scienific ineres ime e processing, nlysis n recogniion of 3D imges, represene roug ensor ecomposiion, ws significnly increse. e sic meos for ensor ecomposiion [,,3,4] re ifferen muliliner exensions of e mrix SVD, clle Muliliner SVD (MSVD, or generlizions of e SVD mrix for iger-orer ensors, clle Higer- Orer SVD (HOSVD. Suc re e fmous meos: CADECOM/ARAFAC (C or Cnonicl olyic Decomposiion, were e ensor is represene s sum of rnk-one ensors; e ucker ecomposiion, wic is iger-orer form of e rincipl Componen Anlysis (CA; e Kruskl ecomposiion, ec. e componens of e ensor ecomposiion re clcule y using vrious meos, suc s, for exmple: e ensor power ierion; e QR-fcorizion, e Higer- Orer Eigenvlue Decomposiion (HOEVD; e Jcoi lgorim, ec. o ennce e ecomposiion of e 3 r orer ensors, wic represen sequences of D correle imges, in is pper is propose non-ierive meo for Hierrcicl SVD (HSVD, se on e SVD of size (SVD [5]. e sic ie is o represen e ensor ecomposiion of size (for =n roug ierrcicl ree-like srucure of n levels. In e firs ierrcicl level e ensor is ivie in elemenry ensors (ЕТ of size, rnsforme ino mrix form, n processe wi SVD. e ecomposiion componens of ll mrices of size re rerrnge in ccornce wi e lessening of eir singulr vlues n rnsforme ck ino corresponing E. In ec consecuive ierrcicl level e eges of e cues, wic represen ll Es, re increse wice, in resul of wic eir voxels re inerlce. ese increse Es re rnsforme gin ino mrices, eir su-mrices re ecompose roug SVD, n rerrnge following e lessening of eir singulr vlues. en, e so oine mrices re rnsforme ino ensors gin, ec. e essence of e new meo is given in e following secions of is pper. 3D imge represenion roug ensor ecomposiion formulion e ensor form is suile for e represenion of 3D imges, wic correspon o sequences of correle D imges of e kin: compuer omogrpy imges, ulrsoun imges, mulispecrl n yper specrl imges of sill ojecs, moving ojecs, ec. For illusrion only, E-ISS: Volume, 6
2 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev on Fig. is sown e 3D silouee imge sequence, represene y 3-orer ensor []. Fig.. 3D silouee imge sequence, represene y ir-orer ensor e min vnge of e ensor represenion is, i reins o mximum egree e correlion eween e 3D-imge voxels in ll ree orogonl irecions. As resul of e C ecomposiion, ec 3D ensor is represene s sum of 3D ensors of sme size, wose vrinces (respecively, weigs ecrese rpily. Ec ensor in is sum is n ouer prouc of 3 muully orogonl vecors. e im of e ensor ecomposiion is o cieve full ecorrelion of e sum componens. Ec ensor is efine y relively smll numer of prmeers, n from is i follows, e generl represenion of e firs severl ensors in e ecomposiion, wic ve mximum weig, is significnly smller n of e ecompose ensor. e ecomposiion of e kin MSVD permis o reuce e ensor represenion roug cuing-off e ensors wi smlles weigs, reining minimum men-squre pproximion error. In is work, new pproc is propose for ensors clculion (i.e., e ecomposiion componens, y using e HSVD. For is, in ec ierrcicl level, on ll su-mrices of size, wic uil e rnsforme ensor, is pplie SVD. e su-mrices re rerrnge in ccornce wi eir singulr vlues, n e mrices, weige is wy, re rnsforme ck ino corresponing ensors (ecomposiion componens. In e nex secions of e pper is escrie e НSVD for 3-orer ensor, se on e mrix SVD. 3 SVD clculion for mrix of size Ec mrix [X] of size coul e ecompose roug SVD, s follows [6]: u u [X] c u u u UV U V u A 3 M 3 were v v v,v v,v 3 v v u u 3 [C] [C x =, x =, x =c, x = - elemens of mrix [X]; A A M /A; /A; ; ; R R U ; A R U ; A R Q Q V ; A Q V ; A Q R A ; A ; A ; A ; R Q Q RQ ; R Q ; 3 R Q ; 4 R Q ; A 4 ; c ; c ; c ; c. ( Here n re e singulr vlues of e mrix [X were ; U, U n V, V re is lef n rig eigen vecors, for wic [X][X] sus n [X] [X] svs for s=,. Here s s re e corresponing eigenvlues of e wo symmericl mrices: [ X][X] n [X] [X]. From Eq. ( i follows, mrices [C ] n [C ] coul e represene s follows: A (A (A (A (A [ C ], A (A (A (A (A A (A (A (A (A [ C ]. A (A (A (A (A In corresponence wi Eq. (, e elemens of [C ] n [C ] re efine y e four prmeers,,, ( E-ISS: Volume, 6
3 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev n, i.e., e ecomposiion, represene y Eq. (, is no overcomplee. 4 Clculion of e Hierrcicl SVD for ensor of size e ensor of size, noe s Т, is e kernel of e ecomposiion for e 3 r -orer ensor of size for = n. Afer moe- unfoling (or mricizion e elemenry ensor, is oine: e f unfol( [X ] [X] c g (3 In e firs level of e HSVD lgorim for e ensor Т (HSVD, on ec of e mrices [X ] n [X ] is pplie SVD of size (SVD, n in resul is go: [ X ] [C] [C c e f [ X] [C ] [C ] g (4 e so oine mrices [C i,j ] of size for i,j=, in Eq. (4 re rerrnge in new couples in corresponence o eir singulr vlues. Afer e rerrngemen, e firs couple of mrices [C ] n [C wic ve ig singulr vlue, efines e ensor ( y reverse mricizion, n e secon couple [C ] n [C ] wic ve lower singulr vlue - e ensor (. en: ( ( (5 Afer moe-3 unfoling of o ensors, is oine: unfol ( unfol( [X ] [X ] [X ] [X ] ( ( (6 In e secon level of HSVD, on ec mrix [X i,j ] of size is pplie SVD n in resul is go: [X [X ] [C ] [C ] [C ] [C [X [X ] [C ] [C ] [C ] [C ]. (7 e so clcule mrices [C i,j,k ] of size for i,j,k =, re rerrnge ino 4 new couples wi similr singulr vlues in orer, efine y is ecrese. Ec of ese 4 couples of mrices y reverse mricizion efines corresponing ensor of size. Afer eir moe- unfoling, is oine: unfol{ unfol{ (} unfol{ (} unfol{ [C ] [C ] [C ] [C ] [C ] [C ] [C ] [C ]. ( ( ( ( (} (} (8 In resul of e execuion of e wo levels of e HSVD, e ensor Т is represene s: i j ( j( ( (i. ( ( ( ( ( ( (9 On Fig. is sown e ecomposiion lgorim for e elemenry ensor Т. Afer e ecomposiion, e ensors in e sum re rrnge in corresponence o e lessening of e s vlues for e su-mrices, oine roug unfoling ll ensors in e sum. e voxels wi lrges ensor vlues re coloure in re, n e smlles - in lue. On Fig. 3 is sown e clculion grp of e -level HSVD lgorim for e elemenry ensor, se on e muliple clculion of SVD in ec ierrcicl level. Afer e execuion of e clculions for given level, e elemens of e su-mrices oine for e SVD re rerrnge in ccornce wi e lessening of e s vlues, n re rnsforme ck ino new elemenry ensors: wo ensors ( n ( - fer e en of e firs level, n four ensors (, (, ( n ( - fer e secon level. 5 Clculion of e HSVD for ensor of size n In e firs level of e HSVD lgorim e ensor Т (for =4, sown on Fig. 4, is ivie ino eig elemenry ensors (i for i=,,..,8 (cues of size. In ccornce wi is lgorim, ec elemenry ensor is ecompose ino 4 new ensors Т j( (i for j=,,3,4 of sme size. In e s level of HSVD, on ec ensor Т j( (i compose of 8 voxels of sme colour (yellow, re, green, lue, wie, purple, lig lue, n ornge, is pplie HSVD. Afer e rerrngemen of e elemenry ensors, n eir inegrion, re oine four new 4 ensors Т j( (i. E-ISS: Volume, 6
4 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev [X] c ( ( ( ( 3 e [X] g 5 7 HSVD xx ( 4 f voxel ( 3 SVD x [C ] [C ] 7 SVD x 6 c e f SVD x g SVD x [X ] Rerrengemen 4 Level 8 ( ( 5 [X ] [C ] [C ] Rerrengemen Rerrengemen X ] [C ] [C ] g e f [ X ] [C ] [C ] c [ 3 4 SVD x 7 8 SVD x 6 [X] c 3 e [X] g f6 8 [C ] [C ] Level [C ] [C ] [C ] [C ] [C ] [C ] ( + ( + ( + ( Fig.. wo-level HSVD lgorim for elemenry ensor of size se on e SVD ensor e f [X ] g c [X ] unfol [X ] c [X ] e g f X ] c [ [X ] c e [X] [X] [C] [C [C ] [C [X [X] ] [C] [C Level Rerrngemen Level [ C] [ C ] [ C] [ C ] [ C ] c(, c(, [ C ] c(, c(, SVD x [ C] c(, c(, c(, c(, c(, c(, [ C] c(, c(, c(, c(, [X ] c(, c(, [X ] c(, c(, c(, c(, SVD x SVD SVD SVD [C(] x 3/4 C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, [ C ] [ C ] [ C ] C(, [ C ] C(, C(, C(, C(, c(, c(, C(, f c(, c(, C(, SVD x C(, SVD SVD x SVD SVD SVD [C(] x [X ] [X ] C(, c(, c(, 5/6 C(, g c(, C(, c(, C(, [X ] C(, c(, c(, C(, c(, c(, C(, C(, [C] [C] Rerrngemen [ C ] [ C ] [ C] [ C ] [C] C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, [ C ] [ C ] [ C] C(, [ C C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, C(, [C] e f [ X ] [C] [C ]. g [X] [X] [X ] [C [X ] [C ] [C ] [C ]. [C] [C] [C] [C] Fig. 3. e flow grp of e -level HSVD for e elemenry ensor, se on e SVD E-ISS: Volume, 6
5 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev ensor Elemenry ensor In e secon level of e HSVD lgorim ec of e four ensors Т j( (i is ivie ino eig su-ensors i,k( (j for i=,, j=, n k=, in e wy, efine y e spil ne for voxel inerlcing s sown on Fig. 5. e colour of e voxels in ec cue correspons o from e firs level of e HSVD lgorim. On ec expne elemenry ensor (oule size ensor, sown on Fig. 5, is pplie once gin e НSVD lgorim. Fig. 4. e ensor Т is ivie ino eig elemenry ensors (i for i=,,..,8 in e firs HSVD level, were e HSVD is pplie on ec group of voxels of sme color (8 in ol ensor 4 ensor 3 ensor ensor Elemenry exene ensor Fig. 5. Division of ensors Т i( (j ino e elemenry ensors j( (i in e secon HSVD level, were e HSVD is pplie on ec group of voxels of sme color (3 in ol Afer e execuion of e s ecomposiion level, e ensor Т is represene s sum of 4 componens: j(444 (i i j ( e so clcule 4 ensors Т i( (j re rrnge in corresponence wi e lessening of e men singulr vlues (e energy of e elemenry ensors i,k( (j, for i=,, j=,, k=,. e ensors Т i( (j re rerrnge in ccornce wi e energy ecrese of e ЕТs i,k( (j, wic uil em. In ccornce wi Fig., on ec ЕТ is pplie e wo-level НSVD gin. Afer e execuion of e secon ecomposiion level, e ensor Т 444 is represene s sum of 6 componens: j(444 (i i j ( e compuionl grp of e -level HSVD ecomposiion is sown on Fig. 6. E-ISS: Volume, 6
6 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev runce 3D HSVD Rejece componen Reine componen Rerrngemen ensor Rerrngemen Level of 3D HSVD Rerrngemen Rerrngemen ensor pproximion Level of 3D HSVD Fig.6.Srucure of e compuionl grps of e full n runce 4-level inry ree for e execuion of e -level 3D HSVD 444 lgorim se on e SVD Level Level Level 3 Fig.7. Secion for ensor of size in levels,, n 3 of e 3-level HSVD 888 lgorim, se on e SVD (ec ensor ere is represene s mrix of size 8 8; in ec level, e SVD is execue 6 imes e so clcule 6 ensors Т j( (i re rrnge in ccornce wi e ecresing vlues of e singulr vlues of kernels, i,k( (j, wic compose em, for i=,, j=, n k=,. In e s level of e full HSVD 444, e HSVD is execue 8 imes, n in e n level - 3 imes. In e cse, wen e ensor is of size 8 8 8, e corresponing HSVD lgorim if of 3 levels: in e firs level re oine 4 ensors of sme size; in e secon - 6 ensors, n in e ls, ir level - 64 ensors. On Fig. 7 re sown e corresponing secions of e iniil ensor in e firs ecomposiion level, n of one ensor in e secon n ir levels. In e secon level re sown only 8 of e sumrices of size, on wic is pplie e SVD, n in e ir level - only four of e sumrices of size. e elemens of ec sumrix re coloure in sme colour: re, green, lue, yellow. E-ISS: Volume, 6
7 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev 6 Generl HSVD cse for ensor of size e ecomposiion of ensors Т n Т 888 coul e generlize for e cse, wen e ensor is of size for = n. As resul of e use of e HSVD lgorim, e ensor n n n is represene s sum of = n singulr ensors: n n n i j n n n n n (i. ( j( e singulr ensors n n n (i of size j( n n n re rrnge in ccornce wi e ecresing vlues of e energies of i,k( (j for i, j, k =,,.., n, wic uil em. e numer of ierrcicl levels neee for e execuion of e HSVD lgorim for = n, is n. 7 Exmple for ensor ecomposiion of size Le e voxels of e elemenry ensor Т, represene in corresponence wi Eq. (3, ve e vlues: =, =, c=, e=, f=, j=, =. en Eq. (3 ecomes: unfol( [X ] [X] Afer pplying e SVD on ec of e mrices [X ] n [X is oine: X ] [C] [C [ X] [C ] [C ] [ were: [ C ], [ C ], [ C ], [ C ], Afer e rerrngemen of e voxels of e ensors ( n ( compose y e mrices [C [C [C [C followe y moe- 3 unfoling of o ensors, e nex four mrices re oine: [ X ] ; [ X] ; [ X ] ; [ X]. On ec of ese mrices is en pplie once more SVD, n s resul is oine: [X [C ] [C were ] [C ] [C [X [X ] [C ] [C ] [C [ C ], [ C ], [ C ], ] [C [X ] [ C] [C] [C ] [C ] [C ]. e vlues of e voxels of ensors (, (, (, n ( (ec of size, compose y e mrices [C [C [C [C [C [C [C [C re given on Fig. 8. In is cse, e voxels coloure in re only ( in ol, ve nonzero vlues. e remining voxels, coloure in lue (lf of ese, corresponing o e secon ensor, n ll voxels of e ir n four ensors in e ecomposiion ve nonzero vlues. 8 Evluion of e ecomposiion componens energy, n eir muul correlion 8.. ensor energy e energy of ec ensor, represene y e ecomposiion (, is efine y e relion: (i, j,k, (3 i j k s s were (i, j,k re e voxels of e ensor Т, n s is e energy of ec ensor s for s=,,.,, in ccornce wi Eq. (. In e cse for =, e energy of e ensors s for s=,,3,4 is efine y e relions: 3( ; ( ;. (4 3 4 E-ISS: Volume, 6
8 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev ( ( ( ( X ] X ] [ [ HSVD xx ( ( SVD x SVD x [X ] [X ] [ X] [C ] [C ] [ X] [C] [C ] Rerrengemen (+/ (+/ (-/ (-/ SVD x SVD x [ X ] Level [C ] [C ] [C ] [C ] (+/ (+/ (-/ (-/ SVD x ( SVD ( x [ X ] Rerrengemen Rerrengemen (+/ (+/ (-/ (-/ [C ] [C ] Level [C ] [C ] [C ] [C ] [C ] [C ] (-/ (-/ (+/ (+/ ( + ( + ( + ( Fig. 8. Exmple: wo-level HSVD for elemenry ensor Т o evlue e energy ( of e firs ensor in e ecomposiion, regring e ol energy ( coul e use e relion elow: 4 3( 3. (5 s 4( 4 ( / / s If =4 n = is oine =.95, i.e. 95% of e ol energy of e ensor Т re concenre in e firs ecomposiion ensor,. In priculr, if =, en = n in e firs ensor is concenre e ol energy (%, for ny vlue of. 8.. Muul correlion e muul correlion eween couples of ecomposiion ensors R( р, р+ is efine y eir sclr prouc: R(p,p p(i, j,k p(i, j,k. (6 i j k For e exmple from Fig. 7 e muul correlion R( р, р+ for р=,,3 eween ensor couples, is corresponingly: R(, ( ; R(,3 R(3,4, i.e., i rpily ecreses o zero. is resul sows e so oine ensor componens in e ecomposiion re significnly ecorrele. e ormlize Correlion Funcion (CF in respec of e firs one, is: for s ; R(, s ( (, for s ; (7 s R(, 3( for s,3. For e cse, wen =4 n =, on Fig. 9 is sown e grpic represenion of e funcion (s. CF (s,8,6,4, ormlize Correlion Funcion, 3 s Fig. 9. e ormlize Correlion Funcion of e ecomposiion componens E-ISS: Volume, 6
9 WSEAS RASACIOS on SIGAL ROCESSIG Roumen Kouncev, Roumin Kouncev 9 Compuionl complexiy of e new ierrcicl ensor ecomposiion In corresponence wi [6 e compuionl complexiy of new lgorim for ecomposiion of e ensor [ n n n ], is O( 4n. e comprison wi e H-ucker ensor ecomposiion О(3 3n +3 4n sows, for e new ecomposiion i is pproximely 3 imes lower. Bu, e neee memory soul e ou /3 lrger, n for e H-ucker ensor ecomposiion. Conclusions e sic vnges of e new pproc for clculion of e ierrcicl ensor ecomposiion, use o represen 3D imges of vrious kin, re s follows: e offere HSVD lgorim, unlike e H- ucker ensor ecomposiion, s lower compuionl complexiy n oes no nee ierive clculions; In ccornce wi Eqs. (3 n (9, in ec ierrcicl level is execue repeely sme ecomposiion of elemenry ensors of size, wic permis eir prllel clculion; e comprison wi e fmous ensor ecomposiions sows, e HSVD lgorim opens new n eer iliies o ennce e efficiency of e sysems for rel-ime processing of 3D imges, n lso in e 3D compuer vision sysems n 3D ojecs recogniion. References: [] H. Lu, K. lniois, A. Venesnopoulos, MCA: Muliliner rincipl Componen Anlysis of ensor Ojecs, IEEE rnscions on eurl eworks, Vol. 9, o, Jnury 8, pp [] G. Bergqvis, E. Lrsson, e Higer-Orer Singulr Vlue Decomposiion: eory n n Applicion, IEEE Signl rocessing Mgzine, Vol. 7, Iss. 3,, pp [3] A. Cicocki, D. Mnic, A. n, C. Cif, G. Zou, Q. Zo, L. De Luwer, ensor Decomposiions for Signl rocessing Applicions, IEEE Signl rocessing Mgzine, Vol. 3, Iss., 5, pp [4] L. De Luwer, B. De Moor, n J. Vnewlle, A Muliliner Singulr Vlue Decomposiion, SIAM Journl of Mrix Anlysis n Applicions, Vol. 4,, pp [5] R. Kouncev, R. Kouncev, Rix-( Hierrcicl SVD for muli-imensionl imges, roc. of e IEEE Inern. Conf. on elecommunicions in Moern Sellie, Cle n Brocsing Services (ELSIKS 5, is, Seri, Oc. 5, pp [6] R. Kouncev, R. Kouncev, Hierrcicl Decomposiion of D/3D Imges, se on SVD, Inernionl J. of Mulimei n Imge rocessing (IJMI, Vol. 5, Iss. 3/4, Sepemer/Decemer 5, pp E-ISS: Volume, 6
Lecture 10 Splines Introduction to Splines
ES8 Economerics. Inroducion o Splines. Esiming Spline Mehod One. Esiming Spline Mehod To.4 Cuic Splines Lecure Splines. Inroducion o Splines Firs pplied Poirier & Grer (974) in sud of profi res in hree
More informationGrade 11 Physics Homework 3. Be prepared to defend your choices in class!
Gre 11 Physics Homework 3 Be prepre o efen your choices in clss! 1. The grph shows he riion wih ime of he elociy of n objec. Which one of he following grphs bes represens he riion wih ime of he ccelerion
More informationJorge Salvador Marques, Stereo Reconstruction
Jorge Slvdor Mrques, Sereo Reconsrucion roblem Gol: reconsruc he D she of objecs in he scene from or more imges. Jorge Slvdor Mrques, Jorge Slvdor Mrques, secil cse f f f f b model reconsrucion, b - fb,
More informationOn the number of reduced trees, cographs, and series-parallel graphs by compression
IPSJ SIG Tecnicl Report Vol.0-AL-7 No.6 0//8 On te number o reuce trees, cogrps, n series-prllel grps by compression Tkeki Uno, Ryuei Uer n Sin-ici Nkno We give n eicient encoing n ecoing sceme or computing
More informationChapter 2. 3/28/2004 H133 Spring
Chpter 2 Newton believe tht light ws me up of smll prticles. This point ws ebte by scientists for mny yers n it ws not until the 1800 s when series of experiments emonstrte wve nture of light. (But be
More informationCL-Path in B-Spline Form with Global Error Control for 3-Axis Sculptured Surface Machining
n Inernionl onference on Mechnicl, Proucion n Auomobile Engineering (IMPAE'0) Singpore April 8-9, 0 -Ph in B-Spline Form wih Globl Error onrol for 3-Axis Sculpure Surfce Mchining Mqsoo Ahme. Khn, n Zezhong.
More informationFig.1. Let a source of monochromatic light be incident on a slit of finite width a, as shown in Fig. 1.
Answer on Question #5692, Physics, Optics Stte slient fetures of single slit Frunhofer diffrction pttern. The slit is verticl nd illuminted by point source. Also, obtin n expression for intensity distribution
More informationCEE598 - Visual Sensing for Civil Infrastructure Eng. & Mgmt.
CEE598 - Visul Sensing for Civil Infrsrucure Eng. & Mgm. Session 2 Review of Liner Algebr nd Geomeric Trnsformions Mni Golprvr-Frd Deprmen of Civil nd Environmenl Engineering Deprmen of Compuer Science
More informationProblem Final Exam Set 2 Solutions
CSE 5 5 Algoritms nd nd Progrms Prolem Finl Exm Set Solutions Jontn Turner Exm - //05 0/8/0. (5 points) Suppose you re implementing grp lgoritm tt uses ep s one of its primry dt strutures. Te lgoritm does
More informationAnswer Key Lesson 6: Workshop: Angles and Lines
nswer Key esson 6: tudent Guide ngles nd ines Questions 1 3 (G p. 406) 1. 120 ; 360 2. hey re the sme. 3. 360 Here re four different ptterns tht re used to mke quilts. Work with your group. se your Power
More informationBefore We Begin. Introduction to Spatial Domain Filtering. Introduction to Digital Image Processing. Overview (1): Administrative Details (1):
Overview (): Before We Begin Administrtive detils Review some questions to consider Winter 2006 Imge Enhncement in the Sptil Domin: Bsics of Sptil Filtering, Smoothing Sptil Filters, Order Sttistics Filters
More informationCS 314 Principles of Programming Languages
CS 314 Principles of Progrmming Lnguges Lecure 10: Synx Direced Trnslion Zheng (Eddy) Zhng Rugers Universiy Februry 19, 2018 Clss Informion Homework 2 is sill being grded. Projec 1 nd homework 4 will be
More information4452 Mathematical Modeling Lecture 4: Lagrange Multipliers
Mth Modeling Lecture 4: Lgrnge Multipliers Pge 4452 Mthemticl Modeling Lecture 4: Lgrnge Multipliers Lgrnge multipliers re high powered mthemticl technique to find the mximum nd minimum of multidimensionl
More informationAVolumePreservingMapfromCubetoOctahedron
Globl Journl of Science Frontier Reserch: F Mthemtics nd Decision Sciences Volume 18 Issue 1 Version 1.0 er 018 Type: Double Blind Peer Reviewed Interntionl Reserch Journl Publisher: Globl Journls Online
More informationProjective geometry- 2D
Projecive geomer- D Acknowledgemens Marc Pollefes: for allowing e use of is ecellen slides on is opic p://www.cs.unc.edu/~marc/mvg/ Ricard Harle and Andrew Zisserman, "Muliple View Geomer in Compuer Vision"
More informationSystems I. Logic Design I. Topics Digital logic Logic gates Simple combinational logic circuits
Systems I Logic Design I Topics Digitl logic Logic gtes Simple comintionl logic circuits Simple C sttement.. C = + ; Wht pieces of hrdwre do you think you might need? Storge - for vlues,, C Computtion
More informationGauss-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 information10.5 Graphing Quadratic Functions
0.5 Grphing Qudrtic Functions Now tht we cn solve qudrtic equtions, we wnt to lern how to grph the function ssocited with the qudrtic eqution. We cll this the qudrtic function. Grphs of Qudrtic Functions
More informationEnergy/Performance Design of Memory Hierarchies for Processor-in-Memory Chips
Energy/Performnce Design of Memory Hierrchies for Processor-in-Memory Chips Michel Hung, Jose Renu, Seung-Moon Yoo, Josep Torrells Deprmen of Compuer Science Deprmen of Elecricl n Compuer Engineering Universiy
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 informationCSCI1950 Z Computa4onal Methods for Biology Lecture 2. Ben Raphael January 26, hhp://cs.brown.edu/courses/csci1950 z/ Outline
CSCI1950 Z Comput4onl Methods for Biology Lecture 2 Ben Rphel Jnury 26, 2009 hhp://cs.brown.edu/courses/csci1950 z/ Outline Review of trees. Coun4ng fetures. Chrcter bsed phylogeny Mximum prsimony Mximum
More informationGENG2140 Modelling and Computer Analysis for Engineers
GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points
More informationPremaster Course Algorithms 1 Chapter 6: Shortest Paths. Christian Scheideler SS 2018
Premster Course Algorithms Chpter 6: Shortest Pths Christin Scheieler SS 8 Bsic Grph Algorithms Overview: Shortest pths in DAGs Dijkstr s lgorithm Bellmn-For lgorithm Johnson s metho SS 8 Chpter 6 Shortest
More informationMATH 25 CLASS 5 NOTES, SEP
MATH 25 CLASS 5 NOTES, SEP 30 2011 Contents 1. A brief diversion: reltively prime numbers 1 2. Lest common multiples 3 3. Finding ll solutions to x + by = c 4 Quick links to definitions/theorems Euclid
More informationLily Yen and Mogens Hansen
SKOLID / SKOLID No. 8 Lily Yen nd Mogens Hnsen Skolid hs joined Mthemticl Myhem which is eing reformtted s stnd-lone mthemtics journl for high school students. Solutions to prolems tht ppered in the lst
More informationSome necessary and sufficient conditions for two variable orthogonal designs in order 44
University of Wollongong Reserch Online Fculty of Informtics - Ppers (Archive) Fculty of Engineering n Informtion Sciences 1998 Some necessry n sufficient conitions for two vrile orthogonl esigns in orer
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 informationx )Scales are the reciprocal of each other. e
9. Reciprocls A Complete Slide Rule Mnul - eville W Young Chpter 9 Further Applictions of the LL scles The LL (e x ) scles nd the corresponding LL 0 (e -x or Exmple : 0.244 4.. Set the hir line over 4.
More informationOn the Detection of Step Edges in Algorithms Based on Gradient Vector Analysis
On the Detection of Step Edges in Algorithms Bsed on Grdient Vector Anlysis A. Lrr6, E. Montseny Computer Engineering Dept. Universitt Rovir i Virgili Crreter de Slou sin 43006 Trrgon, Spin Emil: lrre@etse.urv.es
More informationDynamic Programming. Andreas Klappenecker. [partially based on slides by Prof. Welch] Monday, September 24, 2012
Dynmic Progrmming Andres Klppenecker [prtilly bsed on slides by Prof. Welch] 1 Dynmic Progrmming Optiml substructure An optiml solution to the problem contins within it optiml solutions to subproblems.
More informationCOMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.
COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those
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 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 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 informationHow much does the migration aperture actually contribute to the migration result?
Migraion aperure conribuion How muc does e migraion aperure acually conribue o e migraion resul? Suang Sun and Jon C. Bancrof ABSTRACT Reflecion energy from a linear reflecor comes from e inegran oer an
More informationGreedy Algorithms Spanning Trees
Greedy Algoritms Spnning Trees Cpter 1, Wt mkes greedy lgoritm? Fesible Hs to stisfy te problem s constrints Loclly Optiml Te greedy prt Hs to mke te best locl coice mong ll fesible coices vilble on tt
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 informationA dual of the rectangle-segmentation problem for binary matrices
A dul of the rectngle-segmenttion prolem for inry mtrices Thoms Klinowski Astrct We consider the prolem to decompose inry mtrix into smll numer of inry mtrices whose -entries form rectngle. We show tht
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationEECS 281: Homework #4 Due: Thursday, October 7, 2004
EECS 28: Homework #4 Due: Thursdy, October 7, 24 Nme: Emil:. Convert the 24-bit number x44243 to mime bse64: QUJD First, set is to brek 8-bit blocks into 6-bit blocks, nd then convert: x44243 b b 6 2 9
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 informationData Structures and Algorithms
Daa Srucures and Algorihms The maerial for his lecure is drawn, in ar, from The Pracice of Programming (Kernighan & Pike) Chaer 2 1 Goals of his Lecure Hel you learn (or refresh your memory) abou: Common
More informationC 0 C 1. p 1 (x 0,y 0 ) p 2 I 1. p 3. (x 0,y 0,d) C 2 C 3 I 2 I 3
c 1998 IEEE. Proc. of In. Conference on Compuer Vision, Bombai, January 1998 1 A Maximum-Flow Formulaion of he N-camera Sereo Corresponence Problem Sebasien Roy Ingemar J. Cox NEC Research Insiue Inepenence
More informationNearest-Neighbor and Fault-Tolerant Quantum Circuit Implementation
Neres-Neighbor nd Ful-olern Qunum Circui Implemenion Lxmidhr Biswl, Chndn Bndyopdhyy, Anupm Chopdhyy 2, Rober Wille 3, Rolf Drechsler 4, fizur Rhmn Indin Insiue of Engineering cience nd echnology hibpur,
More informationCompanion Mathematica Notebook for "What is The 'Equal Weight View'?"
Compnion Mthemtic Notebook for "Wht is The 'Equl Weight View'?" Dvid Jehle & Brnden Fitelson July 9 The methods used in this notebook re specil cses of more generl decision procedure
More informationOn Crossing-Critical Graphs
Petr Hliněný, CS FEI, VŠB TU Ostrv 1 On Crossing-Criticl Grps Petr Hliněný On Crossing-Criticl Grps Deprtment of Computer Science e-mil: petr.lineny@vsb.cz ttp://www.cs.vsb.cz/lineny * Supporte prtly by
More informationAlgorithm Design (5) Text Search
Algorithm Design (5) Text Serch Tkshi Chikym School of Engineering The University of Tokyo Text Serch Find sustring tht mtches the given key string in text dt of lrge mount Key string: chr x[m] Text Dt:
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 informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
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 informationMany analog implementations of CPG exist, typically using operational amplifier or
FPGA Implementtion of Centrl Pttern Genertor By Jmes J Lin Introuction: Mny nlog implementtions of CPG exist, typiclly using opertionl mplifier or trnsistor level circuits. These types of circuits hve
More informationTries. Yufei Tao KAIST. April 9, Y. Tao, April 9, 2013 Tries
Tries Yufei To KAIST April 9, 2013 Y. To, April 9, 2013 Tries In this lecture, we will discuss the following exct mtching prolem on strings. Prolem Let S e set of strings, ech of which hs unique integer
More informationDYNAMIC ROUTING ALGORITHMS IN VP-BASED ATM NETWORKS
DYNAMIC ROUTING ALGORITHMS IN VP-BASED ATM NETWORKS Hon-Wi Chu n Dnny H K Tsng Deprtment of Electricl & Electronic Engineering The Hong Kong University of Science & Technology, Cler Wter By, Kowloon, Hong
More informationSection 3.1: Sequences and Series
Section.: Sequences d Series Sequences Let s strt out with the definition of sequence: sequence: ordered list of numbers, often with definite pttern Recll tht in set, order doesn t mtter so this is one
More informationA Static Geometric Medial Axis Domain Decomposition in 2D Euclidean Space
A Sttic Geometric Meil Axis Domin Decomposition in D Euclien Spce LEONIDAS LINARDAKIS n NIKOS CHRISOCHOIDES College of Willim n Mry We present geometric omin ecomposition metho n its implementtion, which
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 information2 Computing all Intersections of a Set of Segments Line Segment Intersection
15-451/651: Design & Anlysis of Algorithms Novemer 14, 2016 Lecture #21 Sweep-Line nd Segment Intersection lst chnged: Novemer 8, 2017 1 Preliminries The sweep-line prdigm is very powerful lgorithmic design
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 informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationF. R. K. Chung y. University ofpennsylvania. Philadelphia, Pennsylvania R. L. Graham. AT&T Labs - Research. March 2,1997.
Forced convex n-gons in the plne F. R. K. Chung y University ofpennsylvni Phildelphi, Pennsylvni 19104 R. L. Grhm AT&T Ls - Reserch Murry Hill, New Jersey 07974 Mrch 2,1997 Astrct In seminl pper from 1935,
More information1 How to use. You should define the new volumes in your configuration file which would include the following lines somewhere:
Te new stuffs not liste in te previous versions of tis mnul or upte prts re mrke wit. Tis mnul escries te new volume-spes tt re not liste in te Epics mnul. More tn twenty new sppes re efine n simple config
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 informationCOMP 423 lecture 11 Jan. 28, 2008
COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring
More informationSuffix trees, suffix arrays, BWT
ALGORITHMES POUR LA BIO-INFORMATIQUE ET LA VISUALISATION COURS 3 Rluc Uricru Suffix trees, suffix rrys, BWT Bsed on: Suffix trees nd suffix rrys presenttion y Him Kpln Suffix trees course y Pco Gomez Liner-Time
More informationCSCI 104. Rafael Ferreira da Silva. Slides adapted from: Mark Redekopp and David Kempe
CSCI 0 fel Ferreir d Silv rfsilv@isi.edu Slides dpted from: Mrk edekopp nd Dvid Kempe LOG STUCTUED MEGE TEES Series Summtion eview Let n = + + + + k $ = #%& #. Wht is n? n = k+ - Wht is log () + log ()
More information5 ANGLES AND POLYGONS
5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.
More informationWhat are suffix trees?
Suffix Trees 1 Wht re suffix trees? Allow lgorithm designers to store very lrge mount of informtion out strings while still keeping within liner spce Allow users to serch for new strings in the originl
More information1 Finding Trigonometric Derivatives
MTH 121 Fall 2008 Essex County College Division of Matematics Hanout Version 8 1 October 2, 2008 1 Fining Trigonometric Derivatives 1.1 Te Derivative as a Function Te efinition of te erivative as a function
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 informationHybrid Video Coding. Thomas Wiegand: Digital Image Communication Hybrid Video Coding 1
Hri Vieo Coing Principle of Hri Vieo Coing Moion-Compene Preicion Bi Allocion Moion Moel Moion Eimion Efficienc of Hri Vieo Coing Thom Wiegn: Digil Imge Communicion Hri Vieo Coing I h een cuomr in he p
More informationCOSC 3213: Computer Networks I Chapter 6 Handout # 7
COSC 3213: Compuer Neworks I Chaper 6 Handou # 7 Insrucor: Dr. Marvin Mandelbaum Deparmen of Compuer Science York Universiy F05 Secion A Medium Access Conrol (MAC) Topics: 1. Muliple Access Communicaions:
More informationChapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.
Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml
More informationParallel Square and Cube Computations
Prllel Squre nd Cube Computtions Albert A. Liddicot nd Michel J. Flynn Computer Systems Lbortory, Deprtment of Electricl Engineering Stnford University Gtes Building 5 Serr Mll, Stnford, CA 945, USA liddicot@stnford.edu
More information1 Quad-Edge Construction Operators
CS48: Computer Grphics Hndout # Geometric Modeling Originl Hndout #5 Stnford University Tuesdy, 8 December 99 Originl Lecture #5: 9 November 99 Topics: Mnipultions with Qud-Edge Dt Structures Scribe: Mike
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationApplied Databases. Sebastian Maneth. Lecture 13 Online Pattern Matching on Strings. University of Edinburgh - February 29th, 2016
Applied Dtses Lecture 13 Online Pttern Mtching on Strings Sestin Mneth University of Edinurgh - Ferury 29th, 2016 2 Outline 1. Nive Method 2. Automton Method 3. Knuth-Morris-Prtt Algorithm 4. Boyer-Moore
More informationRepresentation of Numbers. Number Representation. Representation of Numbers. 32-bit Unsigned Integers 3/24/2014. Fixed point Integer Representation
Representtion of Numbers Number Representtion Computer represent ll numbers, other thn integers nd some frctions with imprecision. Numbers re stored in some pproximtion which cn be represented by fixed
More informationP(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have
Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using
More information1. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES)
Numbers nd Opertions, Algebr, nd Functions 45. SEQUENCES INVOLVING EXPONENTIAL GROWTH (GEOMETRIC SEQUENCES) In sequence of terms involving eponentil growth, which the testing service lso clls geometric
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationMatlab s Numerical Integration Commands
Mtlb s Numericl Integrtion Commnds The relevnt commnds we consider re qud nd dblqud, triplequd. See the Mtlb help files for other integrtion commnds. By the wy, qud refers to dptive qudrture. To integrte:
More informationWORKSHOP 9 HEX MESH USING SWEEP VECTOR
WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re
More informationRational Numbers---Adding Fractions With Like Denominators.
Rtionl Numbers---Adding Frctions With Like Denomintors. A. In Words: To dd frctions with like denomintors, dd the numertors nd write the sum over the sme denomintor. B. In Symbols: For frctions c nd b
More informationProcedure Abstraction
Compiler Design Procedure Absrcion Hwnsoo Hn Conrol Absrcion Procedures hve well-defined conrol-flow The Algol-60 procedure cll Invoked cll sie, wih some se of cul prmeers Conrol reurns o cll sie, immediely
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationMORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES
MORPHOLOGICAL SEGMENTATION OF IMAGE SEQUENCES B. MARCOTEGUI and F. MEYER Ecole des Mines de Paris, Cenre de Morphologie Mahémaique, 35, rue Sain-Honoré, F 77305 Fonainebleau Cedex, France Absrac. In image
More informationUser Adjustable Process Scheduling Mechanism for a Multiprocessor Embedded System
Proceedings of he 6h WSEAS Inernaional Conference on Applied Compuer Science, Tenerife, Canary Islands, Spain, December 16-18, 2006 346 User Adjusable Process Scheduling Mechanism for a Muliprocessor Embedded
More informationOptics. Diffraction at a double slit and at multiple slits. LD Physics Leaflets P Bi. Wave optics Diffraction. Objects of the experiments
Optics Wve optics Diffrction LD Physics Leflets Diffrction t ouble slit n t multiple slits Objects of the experiments g Investigting iffrction t ouble slit for vrious slit spcings. g Investigting iffrction
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 informationa < a+ x < a+2 x < < a+n x = b, n A i n f(x i ) x. i=1 i=1
Mth 33 Volume Stewrt 5.2 Geometry of integrls. In this section, we will lern how to compute volumes using integrls defined by slice nlysis. First, we recll from Clculus I how to compute res. Given the
More informationRevisit: Limits at Infinity
Revisit: Limits t Infinity Limits t Infinity: Wewrite to men the following: f () =L, or f ()! L s! + Conceptul Mening: Thevlueoff () willbesclosetol s we like when is su Forml Definition: Forny"> 0(nomtterhowsmll)thereeistsnM
More informationElement-based
Proceeings of te 12t NTCIR Conference on Evaluation of Information Access Tecnologies June 7-10 2016 Tokyo Japan Element-base Retrieval@MobileClick-2 Atsusi eyaki Tokyo Institute of Tecnology keyaki@lsc.cs.titec.ac.jp
More informationCS 241 Week 4 Tutorial Solutions
CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it
More informationAngle properties of lines and polygons
chievement Stndrd 91031 pply geometric resoning in solving problems Copy correctly Up to 3% of workbook Copying or scnning from ES workbooks is subject to the NZ Copyright ct which limits copying to 3%
More informationLETKF compared to 4DVAR for assimilation of surface pressure observations in IFS
LETKF compred to 4DVAR for ssimiltion of surfce pressure oservtions in IFS Pu Escrià, Mssimo Bonvit, Mts Hmrud, Lrs Isksen nd Pul Poli Interntionl Conference on Ensemle Methods in Geophysicl Sciences Toulouse,
More informationIllumination and Shading
Illumintion nd hding In order to produce relistic imges, we must simulte the ppernce of surfces under vrious lighting conditions. Illumintion models: given the illumintion incident t point on surfce, wht
More informationCMSC 430 Introduction to Compilers. Spring Register Allocation
CMSC 430 Introuction to Compilers Spring 2016 Register Allocation Introuction Change coe that uses an unoune set of virtual registers to coe that uses a finite set of actual regs For ytecoe targets, can
More informationDigital Design. Chapter 1: Introduction. Digital Design. Copyright 2006 Frank Vahid
Chpter : Introduction Copyright 6 Why Study?. Look under the hood of computers Solid understnding --> confidence, insight, even better progrmmer when wre of hrdwre resource issues Electronic devices becoming
More information10.2 Graph Terminology and Special Types of Graphs
10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the
More informationDeletion The Two Child Case 10 Delete(5) Deletion The Two Child Case. Balanced BST. Finally
Deletion Te Two Cild Cse Delete() Deletion Te Two Cild Cse Ide: Replce te deleted node wit vlue gurnteed to e etween te two cild sutrees! Options: succ from rigt sutree: findmin(t.rigt) pred from left
More information