Toward Mechanized Music Pedagogy

Size: px
Start display at page:

Download "Toward Mechanized Music Pedagogy"

Transcription

1 Tow Mehnize Musi Pegogy Lingfeng Yng Stnfo Univesity stt We n pt existing tehniques fo the sttistil moeling of musi to the moeling of the qulity of musil pefomne, esulting in fine-gine sttistil unestning of hness in musi pefomne. This ives I-ssiste pplitions fo impoving skill. We pesent moeling esults using vious poilisti moels to moel pefomne in the simplifie setting of hythm gmes. 1 Intoution Lening musil instument is h. Iniviully, thousns of olls in fees e spent tking lessons, n yes spent ptiing t suoptiml level. Ptie without onstnt expet supevision often involves negleting the el tehnil shotomings n wose, lening the wong hits. The e stte in whih we e essing ou shotomings n lening the ight hits is known s eliete ptie [Eisson et l. 1993]. How n mhines help us e in this stte moe often y utomtilly pointing out wht nees wok though the sttistil moeling of plye pefomne? Fist is the eutionl vlue of hving the sttistis lone. Fo exmple, if we know we miss note sequene ptiully often though the sttistis, we eome ette infome of wht note sequenes to ptie. Seon is the utomtion of seony pegogil elements suh s ptie songs; y otining the most-likely-to-miss note sequenes, we n use tehniques fom lgoithmi musi to synthesize ptie song tht speifilly tgets ptiul tehnil wekness. Thi, is n ojetive, etile meti of impovement; if n ute sttistil moel fome fo peiting misse note sequenes eomes inesingly inute fo t the plye fees it in the futue, pesumly fte ptiing n getting ette, we n tie tehnil impovement to the lowee empiil poilities of misse note sequenes vesus the peite poility. In this ppe we pesent how the vile-oe Mkov moel, moel often use to sttistilly moel musi, my e use to fom similly etile moels of the qulity of musil pefomne. 2 Relte Wok This is n extension of the wok in [Yng 2010]. Musi ognition. The most elte fiel woul e in musi ognition. Musi ognition is onene out ette unestning how people elte to musi. Reently, thee hs een some inteest in moeling musi ognition [Honing 2006]. It hs not een estlishe yet wht goo moels e in this spe. Seeing how well ou popose moels peit plye pefomne my le to ette unestning of how h songs e h n esy ones, esy. Vieo gmes n plye moeling. The next most elte fiel is in vieo gmes. Reently, thee hve een emi eseh effots in moeling plyes of vieo gmes. [Peesen et l. 2009] isusses how to moel fuzzy onepts suh e-mil: lyng@s.stnfo.eu s fun n stisftion in pltfom gmes. Thee is lso wok in moeling plye pefomne, ut fo iffeent gme types. [Dhen et l. 2009]. lgoithmi musi. Finlly, the moels we pln on using n lso e foun in lgoithmi musi, whih is onene with the moeling n genetion of musi itself. [onklin 2003] povies suvey of sttistil tehniques. [Momk 1996] gives n oveview of musi genetion tehniques. Thee is lso wok in using sttistil moels to peit the nmes of songs [ohu n De Feits 2003]. In ptiul, we popose to pt suh methos fom moeling o geneting musi to peiting plye pefomne. oly, we e inteeste in gining sttistil, musi-theoeti unestning of skill evelopment in musil pefomne. Mkov moels. Mkov moels hve titionlly een use to otin etile sttistis of sequentil infomtion, inluing musi. The simplest kin of Mkov moel is the Mkov hin, whee eh meme of sequene of nom viles is onitionlly epenent on the pevious meme. Vile-oe Mkov moels (VMMs), the lss of moel use in this wok, e n extension of Mkov hins tht llow ontext-speifi onitioning on ontexts of vying length. We w ou methos hevily fom [egleite et l. 2004] whih gives n oveview of the ville tehinques fo tining VMMs. Othe litetue oveing VMM tining exist, suh s [Shulz et l. 2008]. eent evelopment is Mkov nom fiels, whih itionlly genelize the shpe of onitioning ontexts. In ft, Mkov nom fiels wee use eenty in [Lvenko n Pikens 2003] to moel polyphoni musi. 3 Polem Domin In hythm gme, the plye hits notes y pessing uttons on n input evie. Eh utton on the input evie oespons to note. These input evies ten to e moele on tul instuments, ut the nume of notes they enoe is muh lowe; ommonly, the nume of notes is oun 5. Duing the ouse of the gme, the plye s gol is hit inoming notes in time to the musi; i.e., fte stting gme, t eh point in sequene of peetemine time intevls, the plye hs the hne to hit speifi note within timing winow. t high levels of ply, this n eome vey iffiult; it is ommon fo hythm gme to eplite the notes in tehnilly iffiult el musil piee one fo one. We n fomlize these onepts s follows. Fist is the epesenttion of songs in the hythm gme: song is sequene of (note, time) pis: S := {s i = (n i, t i), n i P, t i R, t i t i+1} N i=1, whee N is the nume of notes in the song n eh n i is fom finite set of pithes P = {0, 1,..., H}. We my epesent the plye s input s simil sequene

2 I := {(n i, t i), n i N, t i t i+1} M i=1. Misse notes s skill meti. In this setting we efine skill s the ility to epoue the note sequene utely; i.e., the moe notes misse eltive to the sme song, the lowe the skill of the plye. Howeve, thee e still mny iffeent wys in whih to mesue whethe note is misse. One wy is timing mesuement; fo eh s i = (p i, t i) I suh tht thee is no s j = (n j, t j) S within timing winow of t 0 of t i; t i t j > t 0/2 j. In genel, this is oolen peite P S,I : S {0, 1}. Note tht this oes not ptue ll the wys of missing note. in ptiul, it oes not ptue the se whee the plye plys too mny notes. This then les to lele vesion of S, S I. S I := {(n i, t i, P (s i)), s i S, n i, t i R, t i t i+1} N i=1. Miss te. We n then onsie S I s ising fom some poility istiution P ove ll x i S I. We fomulte the miss te t eh note, the ontext-speifi poility tht the plye will miss note, se on this notion: Refeene Use input Lele efeene Timing winow time Figue 1: We tke efeene song (lue, top) n use input ove tht song (geen, mile) to otin leling of the efeene song with eh note s hit (lue) o misse (e) (ottom). Hee we give n exmple fo 3 pithes {,, }. We use 7 pithes in ou tul system. M i = P ((x i) 3 = 1 x 1... x i 1) sttistilly fine gine notion of miss te is impotnt euse it llows fo moe effetive pplitions fo skill evelopment. Note tht we o not yet el with polyphoni musi, whee (n i, t i) pis with the sme t i e llowe. uently eing investigte is pting the Mkov nom fiel metho fo olleting sttistis on polyphoni musi [Lvenko n Pikens 2003] to olleting sttistis on pefomne qulity tking polyphonis into ount. 4 System Oveview To seve s pltfom fo this eseh, we hve evelope hythm gme tht is spinoff of the etmni IIDX [Konmi 1999] hythm gme; it ugments the egul gme with t olletion mehnism. The gme is omptile with existing file fomts use y the etmni moing ommunity; with this, we my test ou ies on tlog of songs tht e ley ville. In typil session, the pplition my e plye like the oiginl etmni IIDX; the plye stts the gme n selets fom menu of songs to ply, plys the song, n n optionlly ply nothe song. Unlike most hythm gmes, howeve, etile t is ollete pe ply; fte plying eh song, the sequenes S lele with misse notes fom I n the timestmp of the song long with text elimiting the ply session is ppene to log file. In ition to the t olletion e fetues tht epesent explotions into how we n pply the esults of moeling the t to ssisting skill evelopment. We inlue fility fo geneting ptie songs tht onsist of epets of the most likely note sequenes tht esult in misse note. s the sope of this ppe els with the moeling spet, we will not go into it hee. Leling of t. hol n othe timing infomtion is then stippe to poue sting with lphet onsisting of onseutive hit/miss symols s i {Hn, Mn} whee n is one of P musil pithes: H M H H M H M H M... The miss te t note i my then equivlently e lulte s M i = P (s i = Mn pith(s i) = n, s 1... s i 1). 5 Moeling In the setting of mehnizing musi pegogy, thee e thee spets we equie of ny moel tht n elize the poility quey ove. 1. The moel mkes ute peitions. This is le; the quey given ove shoul e le to peit wht notes the plye will get wong. 2. The moel genelizes. The quey given ove shoul e le to pefom these peitions on t tht is not fom the tining set. 3. The moel is esilient to t stvtion. euse we tget iniviul plyes, one shoul not e foe to genete vst tset of pefomnes efoe the moel is usle. The quey shoul give ute esults fom single plye on single plythough of single song. n estlishe metho fo moeling poilities ove stings is the Mkov hin of oe k, lso known s the k-gm moel. Eh onseutive ouene of k symols in the sting is mthe ginst the symol tht omes next. y umulting list of (k-sequene, next symol) pis, one lso umultes the onitionl poility P (s i s i 1... s i k ). These moels n e vey ute. Howeve, in this se we e inteeste in the ontextul miss te fom the eginning of the entie song. If we wee to use fixe-oe Mkov moels, this woul equie multiple moels of vey high oe (fo typil song, in the hunes). This woul equie

3 n enomous mount of pefomne t fom eh plye; s this mens the moel is not esilient to t stvtion we nnot use k-gm moel fo ou puposes. 6 Vile-Oe Mkov Moels euse fixe-oe moels nnot e pplie ptilly to ou moeling polem, we tun to vile-oe Mkov moels (VMMs). VMMs e n extension of fixe-oe Mkov moels wheein one is llowe to onition on ny ontext of ity length, not just those of fixe length, s is the se in fixe-oe Mkov (n-gm) moels. gfeef gfeef gfeef gfeef Figue 2: possile VMM fo sting. llowing onitioning on ity-length ontexts lets one onentte the poility mss to ontexts of iffeent lengths, potentilly esulting in muh ette uy n geneliztion while equiing muh less t. 6.1 Tining the VMM Sevel lgoithms exist fo lening vile-oe Mkov moels. Essentilly wht nees to e one to len VMM is to pik ontext to mth to eh symol in the lphet, n then len the poilities using these (symol, ontext) pis. The vition is in how ontexts e selete. To gin high uy n geneliztion, goo VMM lening lgoithms genelly len ontexts tht mximize the likelihoo of the tining sequene x T 1 = x 1... X T : ˆP (x T 1 ) = T ˆP (x i x 1... x i 1). i=1 The likelihoo is tken to e the joint poility of ll symols in the sequene ouing given ll pevious symols. It is not tivil to etemine whih ontexts will o this given finite omputtionl esoues. Sevel lgoithms selet these ontexts se on infomtion-theoeti piniples; in ft, ny lossless ompession lgoithm tht is se on stoing itiony of phses itionlly inues VMM ove the input sequene [egleite et l. 2004]. The LZ-78 lgoithm. One suh ompession lgoithm is the LZ-78 lgoithm, whih ompesses well (heives high likelihoo) while lso eing extemely fst. The LZ-78 lgoithm woks s follows (see Figue 2): sting is onsume fom eginning to en, uiling up phse itiony. The shotest phse not in the itiony is pse n insete into the itiony t eh step. The LZ-MS lgoithm. The LZ-MS lgoithm is vint. It hs two pmetes, M n S. LZ-MS pefoms the LZ- 78 lgoithm on S 0 1-symol shifts of the input sting n ktks y M symols eh time phse is pse, umulting moe omplete itiony in the poess. Futhe etils e ville in [egleite et l. 2004]. We employ the LZ-MS vint in ou VMM lening lgoithm. Figue 3: The LZ-78 lgoithm pplie to the sting. ε Figue 4: The eision tee oesponing to the phse itiony of. Fom phse itiony to eision tee. The LZ-78 lgoithm poues set of phses given n input sting. Thee is oesponing tee fom whih onitionl queies of ny ontext length my esily e lulte. We my onsie the phse set s eing genete y tking noneteministi wlks in the tee up to one level efoe the leves. Futhe etils of how this is woks is ville in [egleite et l. 2004]. onsie the phses {,,,,,, }. The fist hte in eh of the phses must e fom the lphet {,,,, }, hene the fist level in the tee is {,,,, }. Next, we onsie the seon hte given eh of the fist htes; given, it n e {,, }, n given, thee e no hoies, n given, it n e {}. We poee in simil fshion until ll the phses in the itiony e exhuste, then nothe lphet {,,,, } to the tee. n exmple of onitionl poility lute with wlks in the tee: on(n) = (n)/ 7 Results s sis(n) {n} (s) P ( ) = on(ɛ ɛ ) = 5/33 test of the LZ-MS-se VMM s peition uy n geneliztion ws un on single plythough of single song. The esulting lele sting ompise 700 symols in length. The VMM ws tine on 600 symols with ontiguous setion of 100 symols left out to seve s the test set.

4 Reeive opeting hteisti (vg pefomne in leve-100-out oss vlition on single 700-note plythough 1.0 Tue positive te Rnom pefomne 0.4 VMM_LZMS VMM_LZMS_ontext3 1-gm 2-gm gm 4-gm 5-gm Flse positive te Figue 5: The eeive opeting hteisti of the LZ-MS VMM moel on the peition quey P (x i = Mn pith(x i) = n, x 1... x i 1). Note the infeio pefomne of oth the LZ-MS VMM moel n 1-to-5-gm moels on the simplifie fixe-oe-k peition queies P (x i = Mn pith(x i) = n, x i 1... x i k ). Reeive opeting hteisti. In Figue 5 we see tht the lgoithm hieves ette thn nom pefomne in its eeive opeting hteisti, whih is otine y using the peite poility ˆp long with some theshol poility θ [0, 1] whee if ˆp > θ, we eie tht the note ws misse, n if the note tully is some Mn, it is tue positive, else it is flse positive. The eeive opeting hteisti is the uve otine y plotting tue/flse positive pefomne ove sevel θ [0, 1]. The sme evlution meti is use in [Lvenko n Pikens 2003]. We elieve simil meti is ppopite fo peiting misse notes s it is fo note ouenes in genel. ompison with othe moels. Thee e two eisions we me in ou setting tht emn ompison: one is the hoie of VMMs ove fixe-oe Mkov moels. nothe is the hoie of onitioning stting fom the vey eginning of the song P (x i = Mn pith(x i) = n, x 1... x i 1) whih is vile-oe quey, vesus on some fixe-oe ontext P (x i = Mn pith(x i) = n, x i 1... x i k ). In Figue 5, we see tht peition uy n geneliztion ility of the LZ-MS VMM lgoithm is ipple when given the fixe-size quey, while fixe-oe moels o ette with the fixe-size quey, they o not o s well s the LZ-MS VMM lgoithm on the vile-oe quey. Finlly, the ility of the vile-oe quey to peit note misses is emonstte to e supeio to tht of the fixesize quey, t lest with these ptiul eliztions (VMMs n fixe-oe Mkov moels). We o not inlue fixe-oe moel esults on the moe vile-oe quey euse it equies the lening of n oe-t-lest-100 Mkov moel, whih in this setting woul lely not wok ue to t stvtion; unning suh moel on ou tining set esulte in unifom nswes, s the moel lene vey low poility of seeing ny note onitione on length-100 ontext. etinly othe ltentives exist, like smoothe omintions of fixe-oe moels n ltentive wys of lening VMMs. They e not inlue euse we onsie these essentilly VMMs, n ou ompison is etween VMMs n non-v MMs, not mong VMMs. Pefomne. The fste pefoming lening lgoithm is, the ette it n e use in el-time pplition suh s hythm gmes. It is ette to get feek in fom of n upte istiution quikly fte plying eh song. Fo the 700-note tining set efeene in Figue 5, the lening lgoithm onstute the phse itiony n eision tee on the oe of tenths of seons on n 2.66 GHz Intel Xeon (using 1 oe). Miss-te queies ppohe el-time pefomne (on the oe of huneths of seons). This pefomne pofile llows the lening lgoithm to e use fo evey song tht the plye plys, n the peition lgoithm fo iniviul notes in plythough. The lening n peition lgoithms wee implemente in Hskell with little eg to spe leks fom lzy evlution n miniml memoiztion; even highe pefomne shoul e in eh though pogm optimiztions. 8 Limittions n Futue Wok ugmenttions to the system. One ntul next step is to push the softwe out to moe uses n hve the ollete t e ville in lou-sevies-like fshion. This woul enle the olletion of t t lge sle, in tun enling the usge of lening lgoithms tht equie muh moe t ut n potentilly e muh moe esiptive. In ptiul, it woul enle plye to ompe pefomne vesus othe plyes, n to see how othe plyes impove thei tehnique, in tems of how the lene sttistis hnge fo nothe plye se on wht songs she plye. Mkov Rnom Fiels. esies not eing le to el with polyphoniity, the itei of VMMs tht ontext e ontiguous is quite limiting. Thee is potentil to use ette moel. We e uently evluting Mkov Rnom Fiels using the metho of [Lvenko n Pikens 2003]. The wk of this metho e tht it is muh slowe thn using VMMs with LZ-MS; it oul only e use in n offline mnne. Howeve, it my pove to e moe ute. The fetues lene y the metho my lso e qulittively insightful to the musiin inteeste in impoving tehnique. Intetive mhine lening. potentilly useful ugmenttion to ny ontext-se poility moel, whih eltes to intetive mhine lening, is to let the ontexts e seletle y the use, fixing set of them, n then seleting the est se on some othe lgoithm. This is euse often the use hs petty goo ie of wht kins of musil ontexts they mke mistkes in. Othe pplitions. uently onsiee pplitions inlue the utomti synthesis of h enough ptie songs n tools to tk tehnil pogess t fine-gine level. Wht othe pplitions e thee? Finlly, the genel e of I-ssiste humn lening is pomising eseh ietion. We ve spent lot of time tehing omputes how to o things ette so muh tht the omputes might s well e tehing us.

5 Refeenes egleite, R., El-Yniv, R., n Yon, G On peition using vile oe Mkov moels. Jounl of tifiil Intelligene Reseh 22, 1, ohu, E., n De Feits, N Nme Tht Song! Poilisti ppoh to Queying on Musi n Text. vnes in neul infomtion poessing systems, onklin, D Musi genetion fom sttistil moels. In Poeeings of the IS 2003 Symposium on tifiil Intelligene n etivity in the ts n Sienes, itesee, Dhen,., noss,., n Ynnkkis, G Plye moeling using self-ogniztion in tom ie: unewol. In Poeeings of the IEEE Symposium on omputtionl Intelligene n Gmes (IG2009), Milno, Itly. itu. k/ ynnkkis/ig09 IOI. pf. Eisson, K., Kmpe, R., n Tesh-R ome, The ole of eliete ptie in the quisition of expet pefomne. PSYHOLOGIL REVIEW-NEW YORK- 100, Honing, H omputtionl moeling of musi ognition: se stuy on moel seletion. Musi Peeption 23, 5, Konmi etmni IIDX. Lvenko, V., n Pikens, J Polyphoni musi moeling with nom fiels. In Poeeings of the eleventh M intentionl onfeene on Multimei, M, Momk, J Gmm se musi omposition. omplex systems 96, Peesen,., Togelius, J., n Ynnkkis, G Moeling plye expeiene in supe mio os. In IEEE Symposium on omputtionl Intelligene n Gmes, IG 2009, Shulz, M., Weese, D., Rush, T., D oing,., Reinet, K., n Vingon, M Fst n ptive vile oe mkov hin onstution. lgoithms in ioinfomtis, Yng, L Moeling Plye Pefomne in Rhythm Gmes. To ppe in: SIGGRPH si 2010 tehnil skethes.

Data Compression LZ77. Jens Müller Universität Stuttgart

Data Compression LZ77. Jens Müller Universität Stuttgart Dt Compession LZ77 Jens Mülle Univesität Stuttgt 2008-11-25 Outline Intoution Piniple of itiony methos LZ77 Sliing winow Exmples Optimiztion Pefomne ompison Applitions/Ptents Jens Mülle- IPVS Univesität

More information

Illustrating the space-time coordinates of the events associated with the apparent and the actual position of a light source

Illustrating the space-time coordinates of the events associated with the apparent and the actual position of a light source Illustting the spe-time oointes of the events ssoite with the ppent n the tul position of light soue Benh Rothenstein ), Stefn Popesu ) n Geoge J. Spi 3) ) Politehni Univesity of Timiso, Physis Deptment,

More information

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s:

Chapter 7. Kleene s Theorem. 7.1 Kleene s Theorem. The following theorem is the most important and fundamental result in the theory of FA s: Chpte 7 Kleene s Theoem 7.1 Kleene s Theoem The following theoem is the most impotnt nd fundmentl esult in the theoy of FA s: Theoem 6 Any lnguge tht cn e defined y eithe egul expession, o finite utomt,

More information

The Area of a Triangle

The Area of a Triangle The e of Tingle tkhlid June 1, 015 1 Intodution In this tile we will e disussing the vious methods used fo detemining the e of tingle. Let [X] denote the e of X. Using se nd Height To stt off, the simplest

More information

COMPUTER AIDED ANALYSIS OF KINEMATICS AND KINETOSTATICS OF SIX-BAR LINKAGE MECHANISM THROUGH THE CONTOUR METHOD

COMPUTER AIDED ANALYSIS OF KINEMATICS AND KINETOSTATICS OF SIX-BAR LINKAGE MECHANISM THROUGH THE CONTOUR METHOD SINTIFI PROINGS XIV INTRNTIONL ONGRSS "MHINS. THNOLОGIS. MTRILS." 17 - SUMMR SSSION W ISSN 55-X PRINT ISSN 55-1 OMPUTR I NLYSIS OF KINMTIS N KINTOSTTIS OF SIX-R LINKG MHNISM THROUGH TH ONTOUR MTHO Pof.so..

More information

Week 8. Topic 2 Properties of Logarithms

Week 8. Topic 2 Properties of Logarithms Week 8 Topic 2 Popeties of Logithms 1 Week 8 Topic 2 Popeties of Logithms Intoduction Since the esult of ithm is n eponent, we hve mny popeties of ithms tht e elted to the popeties of eponents. They e

More information

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science.

Andersen s Algorithm. CS 701 Final Exam (Reminder) Friday, December 12, 4:00 6:00 P.M., 1289 Computer Science. CS 701 Finl Exm (Reminde) Fidy, Deeme 12, 4:00 6:00 P.M., 1289 Comute Siene. Andesen s Algoithm An lgoithm to uild oints-to gh fo C ogm is esented in: Pogm Anlysis nd Seiliztion fo the C ogmming Lnguge,

More information

Mathematical Reflections, Issue 5, INEQUALITIES ON RATIOS OF RADII OF TANGENT CIRCLES. Y.N. Aliyev

Mathematical Reflections, Issue 5, INEQUALITIES ON RATIOS OF RADII OF TANGENT CIRCLES. Y.N. Aliyev themtil efletions, Issue 5, 015 INEQULITIES ON TIOS OF DII OF TNGENT ILES YN liev stt Some inequlities involving tios of dii of intenll tngent iles whih inteset the given line in fied points e studied

More information

A Study of Some Integral Problems Using Maple

A Study of Some Integral Problems Using Maple Mthemtis n Sttistis (): -, 0 DOI: 0.89/ms.0.000 http://www.hpub.og A Stuy of Some Integl Poblems Ug Mple Chii-Huei Yu Deptment of Mngement n Infomtion, Nn Jeon Univesity of Siene n Tehnology, Tinn City,

More information

Lecture 6: Coding theory

Lecture 6: Coding theory Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those

More information

10 Statistical Distributions Solutions

10 Statistical Distributions Solutions Communictions Engineeing MSc - Peliminy Reding 1 Sttisticl Distiutions Solutions 1) Pove tht the vince of unifom distiution with minimum vlue nd mximum vlue ( is ) 1. The vince is the men of the sques

More information

10.3 The Quadratic Formula

10.3 The Quadratic Formula . Te Qudti Fomul We mentioned in te lst setion tt ompleting te sque n e used to solve ny qudti eqution. So we n use it to solve 0. We poeed s follows 0 0 Te lst line of tis we ll te qudti fomul. Te Qudti

More information

Prerna Tower, Road No 2, Contractors Area, Bistupur, Jamshedpur , Tel (0657) ,

Prerna Tower, Road No 2, Contractors Area, Bistupur, Jamshedpur , Tel (0657) , R Pen Towe Rod No Conttos Ae Bistupu Jmshedpu 8 Tel (67)89 www.penlsses.om IIT JEE themtis Ppe II PART III ATHEATICS SECTION I (Totl ks : ) (Single Coet Answe Type) This setion ontins 8 multiple hoie questions.

More information

Module 4: Moral Hazard - Linear Contracts

Module 4: Moral Hazard - Linear Contracts Module 4: Mol Hzd - Line Contts Infomtion Eonomis (E 55) Geoge Geogidis A pinipl employs n gent. Timing:. The pinipl o es line ontt of the fom w (q) = + q. is the sly, is the bonus te.. The gent hooses

More information

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply

More information

Optimization. x = 22 corresponds to local maximum by second derivative test

Optimization. x = 22 corresponds to local maximum by second derivative test Optimiztion Lectue 17 discussed the exteme vlues of functions. This lectue will pply the lesson fom Lectue 17 to wod poblems. In this section, it is impotnt to emembe we e in Clculus I nd e deling one-vible

More information

Influence of the Magnetic Field in the Solar Interior on the Differential Rotation

Influence of the Magnetic Field in the Solar Interior on the Differential Rotation Influene of the gneti Fiel in the Sol Inteio on the Diffeentil ottion Lin-Sen Li * Deptment of Physis Nothest Noml Univesity Chnghun Chin * Coesponing utho: Lin-Sen Li Deptment of Physis Nothest Noml Univesity

More information

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014

CS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014 S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown

More information

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4

CSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4 Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones

More information

Finite State Automata and Determinisation

Finite State Automata and Determinisation Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions

More information

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x

( ) D x ( s) if r s (3) ( ) (6) ( r) = d dr D x SIO 22B, Rudnick dpted fom Dvis III. Single vile sttistics The next few lectues e intended s eview of fundmentl sttistics. The gol is to hve us ll speking the sme lnguge s we move to moe dvnced topics.

More information

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs

Counting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if

More information

Edinburgh Research Explorer

Edinburgh Research Explorer Einugh Reseh Exploe Chteizing XML Twig Queies with Exmples Cittion fo pulishe vesion: Stwoko, S & Wiezoek, P 2015, Chteizing XML Twig Queies with Exmples. in 18th Intentionl Confeene on Dtse Theoy, ICDT

More information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6 CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 491G Combinatorial Optimization Lecture Notes CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,

More information

Eigenvectors and Eigenvalues

Eigenvectors and Eigenvalues MTB 050 1 ORIGIN 1 Eigenvets n Eigenvlues This wksheet esries the lger use to lulte "prinipl" "hrteristi" iretions lle Eigenvets n the "prinipl" "hrteristi" vlues lle Eigenvlues ssoite with these iretions.

More information

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106

18.06 Problem Set 4 Due Wednesday, Oct. 11, 2006 at 4:00 p.m. in 2-106 8. Problem Set Due Wenesy, Ot., t : p.m. in - Problem Mony / Consier the eight vetors 5, 5, 5,..., () List ll of the one-element, linerly epenent sets forme from these. (b) Wht re the two-element, linerly

More information

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system

Previously. Extensions to backstepping controller designs. Tracking using backstepping Suppose we consider the general system 436-459 Advnced contol nd utomtion Extensions to bckstepping contolle designs Tcking Obseves (nonline dmping) Peviously Lst lectue we looked t designing nonline contolles using the bckstepping technique

More information

International Journal of Computer Engineering and Applications, Volume XII, Issue III, March 18, ISSN

International Journal of Computer Engineering and Applications, Volume XII, Issue III, March 18,   ISSN Intentionl Jounl of Compute Engineeing n Applitions, Volume XII, Issue III, Mh 18, www.ije.om ISSN 2321-3469 WORTHWHILE STRATAGEM FOR PROCUREMENT OF LOSSLESS COMPRESSION BY ENCOMPASSED EXTENDED HUFFMAN

More information

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,

Surds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233, Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.

More information

Ch. 2.3 Counting Sample Points. Cardinality of a Set

Ch. 2.3 Counting Sample Points. Cardinality of a Set Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of

More information

The DOACROSS statement

The DOACROSS statement The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete

More information

6.5 Improper integrals

6.5 Improper integrals Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =

More information

Math 4318 : Real Analysis II Mid-Term Exam 1 14 February 2013

Math 4318 : Real Analysis II Mid-Term Exam 1 14 February 2013 Mth 4318 : Rel Anlysis II Mid-Tem Exm 1 14 Febuy 2013 Nme: Definitions: Tue/Flse: Poofs: 1. 2. 3. 4. 5. 6. Totl: Definitions nd Sttements of Theoems 1. (2 points) Fo function f(x) defined on (, b) nd fo

More information

2-Way Finite Automata Radboud University, Nijmegen. Writer: Serena Rietbergen, s Supervisor: Herman Geuvers

2-Way Finite Automata Radboud University, Nijmegen. Writer: Serena Rietbergen, s Supervisor: Herman Geuvers 2-Wy Finite Automt Rdoud Univesity, Nijmegen Wite: Seen Rietegen, s4182804 Supeviso: Hemn Geuves Acdemic Ye 2017-2018 Contents 1 Intoduction 3 2 One wy utomt, deteministic nd non-deteministic 5 3 Ovehed

More information

Section 2.3. Matrix Inverses

Section 2.3. Matrix Inverses Mtri lger Mtri nverses Setion.. Mtri nverses hree si opertions on mtries, ition, multiplition, n sutrtion, re nlogues for mtries of the sme opertions for numers. n this setion we introue the mtri nlogue

More information

Language Processors F29LP2, Lecture 5

Language Processors F29LP2, Lecture 5 Lnguge Pocessos F29LP2, Lectue 5 Jmie Gy Feuy 2, 2014 1 / 1 Nondeteministic Finite Automt (NFA) NFA genelise deteministic finite utomt (DFA). They llow sevel (0, 1, o moe thn 1) outgoing tnsitions with

More information

Factorising FACTORISING.

Factorising FACTORISING. Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will

More information

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition

Data Structures LECTURE 10. Huffman coding. Example. Coding: problem definition Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt

More information

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.

1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides. 1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the

More information

Electric Potential. and Equipotentials

Electric Potential. and Equipotentials Electic Potentil nd Euipotentils U Electicl Potentil Review: W wok done y foce in going fom to long pth. l d E dl F W dl F θ Δ l d E W U U U Δ Δ l d E W U U U U potentil enegy electic potentil Potentil

More information

FI 2201 Electromagnetism

FI 2201 Electromagnetism FI 1 Electomgnetism Alexnde A. Isknd, Ph.D. Physics of Mgnetism nd Photonics Resech Goup Electosttics ELECTRIC PTENTIALS 1 Recll tht we e inteested to clculte the electic field of some chge distiution.

More information

Analysis of Variance for Multiple Factors

Analysis of Variance for Multiple Factors Multiple Fto ANOVA Notes Pge wo Fto Anlsis Anlsis of Vine fo Multiple Ftos Conside two ftos (tetments) A nd B with A done t levels nd B done t levels. Within given tetment omintion of A nd B levels, leled

More information

U>, and is negative. Electric Potential Energy

U>, and is negative. Electric Potential Energy Electic Potentil Enegy Think of gvittionl potentil enegy. When the lock is moved veticlly up ginst gvity, the gvittionl foce does negtive wok (you do positive wok), nd the potentil enegy (U) inceses. When

More information

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems.

Physics 505 Fall 2005 Midterm Solutions. This midterm is a two hour open book, open notes exam. Do all three problems. Physics 55 Fll 5 Midtem Solutions This midtem is two hou open ook, open notes exm. Do ll thee polems. [35 pts] 1. A ectngul ox hs sides of lengths, nd c z x c [1] ) Fo the Diichlet polem in the inteio

More information

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL:

PYTHAGORAS THEOREM WHAT S IN CHAPTER 1? IN THIS CHAPTER YOU WILL: PYTHAGORAS THEOREM 1 WHAT S IN CHAPTER 1? 1 01 Squres, squre roots nd surds 1 02 Pythgors theorem 1 03 Finding the hypotenuse 1 04 Finding shorter side 1 05 Mixed prolems 1 06 Testing for right-ngled tringles

More information

Fourier-Bessel Expansions with Arbitrary Radial Boundaries

Fourier-Bessel Expansions with Arbitrary Radial Boundaries Applied Mthemtics,,, - doi:./m.. Pulished Online My (http://www.scirp.og/jounl/m) Astct Fouie-Bessel Expnsions with Aity Rdil Boundies Muhmmd A. Mushef P. O. Box, Jeddh, Sudi Ai E-mil: mmushef@yhoo.co.uk

More information

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.

Equivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts. Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions

More information

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by

Class Summary. be functions and f( D) , we define the composition of f with g, denoted g f by Clss Summy.5 Eponentil Functions.6 Invese Functions nd Logithms A function f is ule tht ssigns to ech element D ectly one element, clled f( ), in. Fo emple : function not function Given functions f, g:

More information

2.4 Theoretical Foundations

2.4 Theoretical Foundations 2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level

More information

Statistics in medicine

Statistics in medicine Sttistis in meiine Workshop 1: Sreening n ignosti test evlution Septemer 22, 2016 10:00 AM to 11:50 AM Hope 110 Ftm Shel, MD, MS, MPH, PhD Assistnt Professor Chroni Epiemiology Deprtment Yle Shool of Puli

More information

Mitosis vs meiosis: Lecture Outline 10/26/05. Independent Assortment

Mitosis vs meiosis: Lecture Outline 10/26/05. Independent Assortment Lectue Outline 10/26/05 Consequences of meiosis Gmetes e geneticlly vile Inepenent ssotment Cossing ove Lots of pctice polems Eos in meiosis Why epouce sexully? Mitosis vs meiosis: Mitosis ensues exct

More information

Fluids & Bernoulli s Equation. Group Problems 9

Fluids & Bernoulli s Equation. Group Problems 9 Goup Poblems 9 Fluids & Benoulli s Eqution Nme This is moe tutoil-like thn poblem nd leds you though conceptul development of Benoulli s eqution using the ides of Newton s 2 nd lw nd enegy. You e going

More information

Ch 26 - Capacitance! What s Next! Review! Lab this week!

Ch 26 - Capacitance! What s Next! Review! Lab this week! Ch 26 - Cpcitnce! Wht s Next! Cpcitnce" One week unit tht hs oth theoeticl n pcticl pplictions! Cuent & Resistnce" Moving chges, finlly!! Diect Cuent Cicuits! Pcticl pplictions of ll the stuff tht we ve

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite! Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:

More information

CS 573 Automata Theory and Formal Languages

CS 573 Automata Theory and Formal Languages Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple

More information

Chapter Seven Notes N P U1C7

Chapter Seven Notes N P U1C7 Chpte Seven Notes N P UC7 Nme Peiod Setion 7.: Angles nd Thei Mesue In fling, hitetue, nd multitude of othe fields, ngles e used. An ngle is two diffeent s tht hve the sme initil (o stting) point. The

More information

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005

CARLETON UNIVERSITY. 1.0 Problems and Most Solutions, Sect B, 2005 RLETON UNIVERSIT eprtment of Eletronis ELE 2607 Swithing iruits erury 28, 05; 0 pm.0 Prolems n Most Solutions, Set, 2005 Jn. 2, #8 n #0; Simplify, Prove Prolem. #8 Simplify + + + Reue to four letters (literls).

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 6: Minigoals Towards Simplifying and Rewriting Expressions MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy

More information

Topics for Review for Final Exam in Calculus 16A

Topics for Review for Final Exam in Calculus 16A Topics fo Review fo Finl Em in Clculus 16A Instucto: Zvezdelin Stnkov Contents 1. Definitions 1. Theoems nd Poblem Solving Techniques 1 3. Eecises to Review 5 4. Chet Sheet 5 1. Definitions Undestnd the

More information

Properties and Formulas

Properties and Formulas Popeties nd Fomuls Cpte 1 Ode of Opetions 1. Pefom ny opetion(s) inside gouping symols. 2. Simplify powes. 3. Multiply nd divide in ode fom left to igt. 4. Add nd sutt in ode fom left to igt. Identity

More information

A Study on the Properties of Rational Triangles

A Study on the Properties of Rational Triangles Interntionl Journl of Mthemtis Reserh. ISSN 0976-5840 Volume 6, Numer (04), pp. 8-9 Interntionl Reserh Pulition House http://www.irphouse.om Study on the Properties of Rtionl Tringles M. Q. lm, M.R. Hssn

More information

Solids of Revolution

Solids of Revolution Solis of Revolution Solis of revolution re rete tking n re n revolving it roun n is of rottion. There re two methos to etermine the volume of the soli of revolution: the isk metho n the shell metho. Disk

More information

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2.

Data Structures. Element Uniqueness Problem. Hash Tables. Example. Hash Tables. Dana Shapira. 19 x 1. ) h(x 4. ) h(x 2. ) h(x 3. h(x 1. x 4. x 2. Element Uniqueness Poblem Dt Stuctues Let x,..., xn < m Detemine whethe thee exist i j such tht x i =x j Sot Algoithm Bucket Sot Dn Shpi Hsh Tbles fo (i=;i

More information

Discrete Model Parametrization

Discrete Model Parametrization Poceedings of Intentionl cientific Confeence of FME ession 4: Automtion Contol nd Applied Infomtics Ppe 9 Discete Model Pmetition NOKIEVIČ, Pet Doc,Ing,Cc Deptment of Contol ystems nd Instumenttion, Fculty

More information

Probability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright

Probability The Language of Chance P(A) Mathletics Instant Workbooks. Copyright Proility The Lnguge of Chne Stuent Book - Series L-1 P(A) Mthletis Instnt Workooks Copyright Proility The Lnguge of Chne Stuent Book - Series L Contents Topis Topi 1 - Lnguge of proility Topi 2 - Smple

More information

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx

for all x in [a,b], then the area of the region bounded by the graphs of f and g and the vertical lines x = a and x = b is b [ ( ) ( )] A= f x g x dx Applitions of Integrtion Are of Region Between Two Curves Ojetive: Fin the re of region etween two urves using integrtion. Fin the re of region etween interseting urves using integrtion. Desrie integrtion

More information

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b

where the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}

More information

Deterministic simulation of a NFA with k symbol lookahead

Deterministic simulation of a NFA with k symbol lookahead Deteministic simultion of NFA with k symbol lookhed SOFSEM 7 Bl Rvikum, Clifoni Stte Univesity (joint wok with Nic Snten, Univesity of Wteloo) Oveview Definitions: DFA, NFA nd lookhed DFA Motivtion: utomted

More information

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA

Common intervals of genomes. Mathieu Raffinot CNRS LIAFA Common intervls of genomes Mthieu Rffinot CNRS LIF Context: omprtive genomis. set of genomes prtilly/totlly nnotte Informtive group of genes or omins? Ex: COG tse Mny iffiulties! iology Wht re two similr

More information

dx was area under f ( x ) if ( ) 0

dx was area under f ( x ) if ( ) 0 13. Line Integls Line integls e simil to single integl, f ( x) dx ws e unde f ( x ) if ( ) 0 Insted of integting ove n intevl [, ] (, ) f xy ds f x., we integte ove cuve, (in the xy-plne). **Figue - get

More information

Lecture 4. Electric Potential

Lecture 4. Electric Potential Lectue 4 Electic Ptentil In this lectue yu will len: Electic Scl Ptentil Lplce s n Pissn s Eutin Ptentil f Sme Simple Chge Distibutins ECE 0 Fll 006 Fhn Rn Cnell Univesity Cnsevtive Ittinl Fiels Ittinl

More information

Lesson 55 - Inverse of Matrices & Determinants

Lesson 55 - Inverse of Matrices & Determinants // () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n

More information

Topic II.1: Frequent Subgraph Mining

Topic II.1: Frequent Subgraph Mining Topi II.1: Fequent Sugph Mining Disete Topis in Dt Mining Univesität des Slndes, Süken Winte Semeste 2012/13 T II.1-1 TII.1: Fequent Sugph Mining 1. Definitions nd Polems 1.1. Gph Isomophism 2. Apioi-Bsed

More information

Lecture 10. Solution of Nonlinear Equations - II

Lecture 10. Solution of Nonlinear Equations - II Fied point Poblems Lectue Solution o Nonline Equtions - II Given unction g : R R, vlue such tht gis clled ied point o the unction g, since is unchnged when g is pplied to it. Whees with nonline eqution

More information

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:

22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of: 22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)

More information

This immediately suggests an inverse-square law for a "piece" of current along the line.

This immediately suggests an inverse-square law for a piece of current along the line. Electomgnetic Theoy (EMT) Pof Rui, UNC Asheville, doctophys on YouTube Chpte T Notes The iot-svt Lw T nvese-sque Lw fo Mgnetism Compe the mgnitude of the electic field t distnce wy fom n infinite line

More information

Homework 3 MAE 118C Problems 2, 5, 7, 10, 14, 15, 18, 23, 30, 31 from Chapter 5, Lamarsh & Baratta. The flux for a point source is:

Homework 3 MAE 118C Problems 2, 5, 7, 10, 14, 15, 18, 23, 30, 31 from Chapter 5, Lamarsh & Baratta. The flux for a point source is: . Homewok 3 MAE 8C Poblems, 5, 7, 0, 4, 5, 8, 3, 30, 3 fom Chpte 5, msh & Btt Point souces emit nuetons/sec t points,,, n 3 fin the flux cuent hlf wy between one sie of the tingle (blck ot). The flux fo

More information

Swinburne Research Bank

Swinburne Research Bank Swinune Reseh Bnk http://esehnk.swinune.edu.u Zhou, R., Liu, C., Wng, J., & Li, J. (2009). Continment etween unions of XPth queies. Oiginlly pulished in X. Zhou, H. Yokot, K. Deng, & Q. Liu (eds.) Poeedings

More information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd

More information

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )

Necessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 ) Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us

More information

Behavior Composition in the Presence of Failure

Behavior Composition in the Presence of Failure Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re

More information

Symmetrical Components 1

Symmetrical Components 1 Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent

More information

Automata and Regular Languages

Automata and Regular Languages Chpter 9 Automt n Regulr Lnguges 9. Introution This hpter looks t mthemtil moels of omputtion n lnguges tht esrie them. The moel-lnguge reltionship hs multiple levels. We shll explore the simplest level,

More information

8 THREE PHASE A.C. CIRCUITS

8 THREE PHASE A.C. CIRCUITS 8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),

More information

Incremental Maintenance of XML Structural Indexes

Incremental Maintenance of XML Structural Indexes Inementl Mintenne of XML Stutul Indexes Ke Yi Ho He Ion Stnoi Jun Yng Dept. Compute Siene Duke Univesity yike@s.duke.edu Dept. Compute Siene Duke Univesity hohe@s.duke.edu IBMT.J.Wtson Reseh Cente is@us.ibm.om

More information

NON-DETERMINISTIC FSA

NON-DETERMINISTIC FSA Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is

More information

Lesson 2.1 Inductive Reasoning

Lesson 2.1 Inductive Reasoning Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,

More information

Part I: Study the theorem statement.

Part I: Study the theorem statement. Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for

More information

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game.

Physical Security Countermeasures. This entire sheet. I m going to put a heptadecagon into game. Phsicl Secuit Countemesues This entie sheet Telmo, AHI I m going to put heptdecgon into gme. Cssie Hung Mechnicl lockpicking is mechnicked geometic constuctions with compss nd stightedge. Ech lock will

More information

in the wost cse. (All logithms in this ppe e se logithms.) The est known soting metho, clle mege insetion y Knuth [9], is ue to Leste Fo J. n Selme Jo

in the wost cse. (All logithms in this ppe e se logithms.) The est known soting metho, clle mege insetion y Knuth [9], is ue to Leste Fo J. n Selme Jo On lowe ouns fo selecting the mein Doit Do John H st y Stn Ulfeg y Ui Zwick June 4, 997 Astct We pesent efomultion of the n+o(n) lowe oun of Bent n John fo the nume of compisons neee fo selecting the mein

More information

On Some Hadamard-Type Inequalıtıes for Convex Functıons

On Some Hadamard-Type Inequalıtıes for Convex Functıons Aville t htt://vuedu/ Al Al Mth ISSN: 93-9466 Vol 9, Issue June 4, 388-4 Alictions nd Alied Mthetics: An Intentionl Jounl AAM On Soe Hdd-Tye Inequlıtıes o, Convex Functıons M Ein Özdei Detent o Mthetics

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System Validation (IN4387) November 2, 2012, 14:00-17:00 System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:

More information

Mark Scheme (Results) January 2008

Mark Scheme (Results) January 2008 Mk Scheme (Results) Jnuy 00 GCE GCE Mthemtics (6679/0) Edecel Limited. Registeed in Englnd nd Wles No. 4496750 Registeed Office: One90 High Holbon, London WCV 7BH Jnuy 00 6679 Mechnics M Mk Scheme Question

More information

5 - Determinants. r r. r r. r r. r s r = + det det det

5 - Determinants. r r. r r. r r. r s r = + det det det 5 - Detemts Assote wth y sque mtx A thee s ume lle the etemt of A eote A o et A. Oe wy to efe the etemt, ths futo fom the set of ll mtes to the set of el umes, s y the followg thee popetes. All mtes elow

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now we must transform the original model so we can use the new parameters. = S max. Recruits MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with

More information

TOPIC: LINEAR ALGEBRA MATRICES

TOPIC: LINEAR ALGEBRA MATRICES Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED

More information

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap

Particle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly

More information

CS 275 Automata and Formal Language Theory

CS 275 Automata and Formal Language Theory CS 275 utomt nd Forml Lnguge Theory Course Notes Prt II: The Recognition Prolem (II) Chpter II.5.: Properties of Context Free Grmmrs (14) nton Setzer (Bsed on ook drft y J. V. Tucker nd K. Stephenson)

More information