Subsumption of Vertical Viewpoint Patterns
|
|
- Hilary May
- 5 years ago
- Views:
Transcription
1 Susumption of Vertil Viewpoint Ptterns Mthieu Bergeron 1 nd Drrell Conklin 2 1 CIRMMT, MGill University, Montrel, Cnd mthieu.ergeron@mil.mgill. 2 Deprtment of Computer Siene nd AI Universidd del Pís Vso, Sn Sestián, Spin IKERBASQUE, Bsque Foundtion for Siene, Bilo onklin@ikersque.org Astrt. This pper formlizes the vertil viewpoint pttern lnguge for polyphoni pttern representtion. The semntis of ptterns is given in terms of trnsltion to reltionl network form. The lnguge supports pttern susumption, n essentil inferene for pttern mining, development, nd refinement. Though omputed in wy entirely different to reltionl network mthing, this pper proves tht susumption inferenes re sound nd omplete with respet to the underlying reltionl lnguge. Keywords: Pttern susumption, Polyphoni ptterns, Musi representtion, Sore sliing, Computtionl musiology. 1 Motivtion Pttern reognition nd disovery re importnt topis in omputtionl musiology. Ptterns in musi n e used to desrie repetition within piees nd lso reurrene within orpus of piees. Ptterns my refer to, for exmple, melodi lines, hord sequenes, or to more omplex polyphoni strutures where temporl reltions exist etween overlpping events. Considering polyphony, nturl nd powerful representtion of polyphoni ptterns is grph strutures, where the nodes represent notes, or more generlly fetures of notes, nd edges represent their temporl reltions. Grph representtions require the omputtion of sugrph isomorphism to determine pttern to instne reltions, nd this hs onstrined their use in omputtionl musiology. The im of this pper is to elorte new formlism lled VVP (vertil viewpoint ptterns) for the representtion of polyphoni ptterns. The representtion omines the viewpoint formlism [1] with the ide of segmenting the polyphoni texture into slies [2]. As slie n ontin the ontinution of musil event, vriety of temporl reltions re supported. While this representtion does not hve the full power of grphs, it is suitly expressive for mny types of musil ptterns, speifilly ptterns where notes re temporlly ompt nd our in fixed numer of voies. The method ssumes tht ptterns hve the sme numer of voies thn the musil soure from whih instnes re drwn. This n require the extrtion C. Agon et l. (Eds.): MCM 2011, LNAI 6726, pp. 1 12, Springer-Verlg Berlin Heidelerg 2011
2 2 M. Bergeron nd D. Conklin of fixed voie textures from tul musil dt (e.g. [3] onsidered voie pirs extrted out of the four-voie texture of Bh horle hrmoniztions). A similr tehnique is lso required when using Humdrum, well-known toolkit for pttern mthing in symoli musi dt [4,5]. Although Humdrum supports polyphony, it n e diffiult to use for even simple ptterns [6]. For exmple, Figure 1 shows some Humdrum dt (fter preproessing to otin expliit event ontinutions nd extr spines with musil fetures) nd Humdrum pttern tht ptures the ide of ontrpuntl suspension. The regulr expressions in eh line of Humdrum pttern do two things : i) mth the eginning of events or the ontinution of events (this is the purpose of rkets in the pttern of Fig. 1, rket mthes the ontinution of n event nd the sene of rket mthes the eginning of n event); nd ii) mth fetures of those events y mthing orresponding vlues in dditionl olumns (this is the purpose of the tokens ending the lines of the pttern, dissonne feture is mthed on the first line nd, on the seond line, fetures enoding the melodi ontour of step down nd onsonne re mthed). ss tenor ont qul D B +s ons BB (B). ons FF# (B). diss (FF#) A# -s ons [-g A-G]+ [- # n]* [ˆ)]* [(] [-g A-G]+ [- # n]*.* diss$ [-g A-G]+ [- # n]* [)] [ˆ(]* [-g A-G]+ [- # n]* -s ons$ Fig. 1. A musil frgment in Humdrum (top) nd suspension pttern (ottom). The musil dt is preproessed to otin expliit event ontinutions, denoted y rkets, nd to dd extr spines ontining musil fetures: ont for melodi ontour nd qul for hrmoni intervl. In ddition to the required expertise in regulr expressions, more fundmentl diffiulties with developing Humdrum ptterns rise due to their opity nd lk of denottionl semntis. It is in generl not possile for omputtionl musiologist to inspet pttern nd from tht dedue wht frgments will e mthed. Lking denottionl semntis, it my e intrtly diffiult to develop nd refine ptterns. For exmple, simply dding nother melodi feture to pttern requires oth the existene of spine ontining tht feture nd, to referene the vlues of tht feture, the modifition of every line of the pttern in wy tht respets the spine ordering. This pper formlly defines the semntis of VVP showing how it expresses reltions etween temporlly relted events in ompt regions of time. The method offers ler syntx for ptterns tht re very similr to the ptterns tht Humdrum n express. In ddition, it is possile to formlly define the notion of pttern susumption in VVP, inditing when the piees mthed y one pttern re lwys superset of the piees mthed y nother. With forml
3 Susumption of Vertil Viewpoint Ptterns 3 susumption reltion the omputtionl musiologist my develop ptterns y progressive pttern speiliztion nd generliztion, ringing in fewer or more mthing dtse piees s desired. Furthermore, with pttern susumption it is possile to define dt mining lgorithms tht serh refinement grphs of the pttern spe [7]. This pper is orgnized s follows. Setion 2 defines R, reltionl pttern lnguge we replite nd extend from [8]. In tht lnguge, temporl reltions etween musil events re expliit nd n e visulized s network; nd the notion of pttern susumption is strightforwrd nd intuitive. Setion 3 developssemntisforvvp in terms of R, tht is, in terms of the reltions VVP pttern expresses etween musil events. Setion 4 defines pttern susumption for VVP nd shows tht it is sound nd omplete with respet to susumption in R. This is the key ontriution of this pper s it estlishes tht the denottionl semntis we give to VVP orretly ptures the mening of ptterns s they re eing speilized or instntited. This extends the work presented in [8], where the instntition of ptterns ws not onsidered. Finlly, Setion 5 further disusses the pplitions nd limittions of the urrent work. 2 Reltionl Ptterns A reltionl pttern expresses temporl reltions over event vriles. The temporl reltions we onsider here re: i) m(, ) ( meets : finishes when egins), ii) st(, ) ( nd strt together), nd iii) sw(, ) ( strts while is sounding). Formlly, the reltions re defined in Fig. 2 (see [8] for omprison etween these nd the well-known temporl reltions etween intervls [9]). This pper extends the reltionl pttern lnguge of [8] y inluding two new types of tomi formuls: i) toms of the form voie(ε, γ), whih indite tht some event ε elongs to voie γ; nd ii) toms of the form τ(ε,,ε,μ), whih either reord some si musil informtion out n event, for exmple pith(, A4#), or some musil reltion ouring etween mny events, for exmple intervl(,, M3). This yields the lnguge R, defined s follows: m(, ) when: offset(, μ), onset(, μ) st(, ) when: onset(, μ), onset(, μ) [!h] sw(, ) when: onset(, μ 1), onset(, μ 2), offset(, μ 3), μ 1 >μ 2, μ 1 <μ 3 Fig. 2. Reltionl definition of the three temporl reltions onsidered in this rtile
4 4 M. Bergeron nd D. Conklin Definition 1. r R::= ω,,ω with ω ::= m(ε, ε) st(ε, ε) sw(ε, ε) voie(ε, γ) τ(ε,,ε,μ) Reltionl networks re used to visulize the temporl reltions of pttern in R. Figure 3 exemplifies reltionl network (left) nd reltionl pttern (middle; the pttern is one of the mny disovered y the musi mining pproh developed in [3]). Musil informtion is given, for exmple, y the tom voie(, lto)whih speifies tht event is in the lto voie; or the tom ont(, -s), whih speifies tht event is rehed y downwrd melodi step. An event hs the musil feture ont(ε, μ) whih desries melodi ontour nd tkes the possile vlues lep up: +l; lepdown:-l; step up: +s; stepdown:-s; repet: r. The other musil feture used in this pper is qul(ε, ε, μ), the hrmoni intervl (non-ompound ditoni intervl etween lower nd higher pithes in the slie), tking the vlues ons (intervls P1, m3, M3, P5, m6, M6) nd diss (ll other intervls). Susumption in R n e defined s speil se of θ-susumption [10]: pttern r 1 susumes pttern r 2 iff there exists mpping θ of the event vriles of r 1 to the event vriles of r 2 suh tht r 1 θ is suset of r 2.For exmple, the following ptterns re in susumption reltion, denoted y R : Exmple 1. st(, d), voie(, lto) R with θ = nd dθ = st(, ), voie(, lto), voie(, tenor), qul(,, ons) R Instnes st m sw m(, ), st(, ), sw(, ), voie(, lto), voie(, lto), voie(, tenor), qul(,, diss) qul(,, ons) Fig. 3. Ptterns in R nd instnes from Bh horle hrmoniztions
5 3 Vertil Viewpoints Susumption of Vertil Viewpoint Ptterns 5 The vertil viewpoint method [3] represents polyphoni musi s slies. The ide is to segment the musil soure into series of time-spns, or slies. A new slie is reted whenever new event ppers. Events tht re still sounding t the onset time of tht new event hve ontinution reorded. This results in representtion of polyphoni musi tht is thoroughly sequentil, s the definition of VVP mkes ler. Definition 2. v VVP ::= [α,α,,α] with α ::= {δ,δ,,δ} δ ::= τ[γ] [γ] :μ Aording to Definition 2, VVP pttern v is sequene of feture sets. Eh feture set α enodes slie. A feture τ[γ] [γ] :μ inludes feture nme τ, voie lels γ nd feture vlue μ. For exmple, onsider Fig. 4. Note tht the sequene is displyed without the rkets nd tht omms re omitted within the sets (heneforth, we disply VVP ptterns tht wy to simplify presenttion). The pttern ontins two slies. In eh slie, feture of the form strts[γ] : μ indites whether, for some voie γ, the slie onerns the eginning of new event (strts[γ] : t) or the ontinution of some previously existing event (strts[γ] : f). To relte slies nd events, whih is neessry to give reltionl semntis to VVP, we lel these fetures with event vriles (not prt of the syntx of VVP). In Figure 4, the first slie onerns the ontinution of some event nd the eginning of new event, while the seond slie lso onerns the ontinution of nd the eginning of new event (this time lelled ). This yields the reltionl network shown in the figure. In ddition, the pttern speifies musil fetures, suh s melodi ontours in voie 1 (e.g. feture ont[1] :-l) nd onsonnt intervls etween voie 1 nd voie 0 (e.g. feture qul[1][0] :ons). In generl, the lelling of events in VVP pttern is done s follows. For the first feture set of the pttern, every voie is lelled with fresh event vrile. Then for the following feture sets, every voie exhiiting strts[γ i ]:t feture is lelled with fresh event vrile. Any other voie is lelled with its orreponding event vrile from the previous set. Figure 5 nd the exmple elow illustrte the lelling proess. VVP strts[0] : f strts[0] : f strts[1] : t strts[1] : t qul[1][0] : ons qul[1][0] : ons ont[1] : -l ont[1] : +l sw sw m 4 3 Instnes Fig. 4. A pttern in VVP nd the orresponding reltionl network. Instnes re tken from Bh horle hrmoniztions.
6 6 M. Bergeron nd D. Conklin slie A slie B slie C C5 B4 A4 G4 F4 E4 D4 C4 B3 A3 G3 d f g d f g F3 E3 D3 C3 B2 A2 G2 Fig. 5. Sliing of the polyphoni texture nd lelling of events Exmple 2. slie A slie B slie C strts[0] :t d strts[0] :t f strts[0] :t strts[1] :t strts[1] :f g strts[1] :t strts[2] :f strts[2] :f strts[2] :f The semntis of VVP ptterns is defined in terms of trnsltion to R. Wedo this vi the five rules presented in Fig. 6. The first three rules onern temporl reltions nd ll refer to the strt of new event (indited y feture of the form strts[γ] :t). The first rule onerns the se where two events strt in the sme slie nd st(, ) temporl reltion is reted. The seond rule speifies when to rete sw(, ) reltion. The event vrile orresponds to n event tht is strting in the urrent slie, while vrile orresponds to n event tht hs strted in the pst nd is eing prolonged into the urrent slie. The third rule ssigns m(, ) temporl reltion whenever n event strts. The event hs to e in the sme voie s the event (Fig. 6 nd heneforth, we indite this y horizontlly ligning the lels). Finlly, rules four nd five simply trnslte the informtion out voies nd musil fetures into their reltionl form. In rule 5, for every voie present in the musil feture τ[γ i ] : μ, the tom τ(,,μ) must refer to the event vrile tht lels tht voie.
7 Susumption of Vertil Viewpoint Ptterns 7 1) 2) 3) VVP R strts[γ i] : t st(, ) strts[γ j] : t strts[γ i] : t sw(, ) strts[γ j] : f strts[γ i] : t m(, ) VVP R 4) strts[γ i] : t voie(, γi) strts[γ] : t 5) τ(,,μ) τ[γ] : μ Fig. 6. Interprettion of VVP in terms of R Exmple 3. The following VVP pttern is trnslted to reltionl pttern y pplying the rules of Fig. 6: strts[0] : t strts[1] : t qul[0][1] : ons { strts[0] : f strts[1] : t } rule 1) st(, ) rule 2) sw(, ) rule 3) m(, ) rule 4) voie(, 0), voie(, 1), voie(, 1) rule 5) qul(,, ons) Note tht the semntis presented here onerns restrited form of VVP,where for exmple the strts[γ] :μ fetures re lwys present to expliitly indite the temporl onfigurtion of slie. The restrition is defined y the three well-formedness rules expressed elow. Definition 3. A well-formed VVP pttern ontins only feture sets of the following form nd stisfying the following rules: strts[γ 0] : μ strts[γ 1] : μ strts[γ n] : μ τ[γ i] : μ Every feture set refers to the sme voies nd for every voie it ontins feture of the form strts[γ] :μ There is t lest one feture strts[γ] :t per set Fetures of the form τ[γ i ] : μ only pper in set where the feture strts[γ i ]:t ppers
8 8 M. Bergeron nd D. Conklin The purpose of the first rule is to ensure tht ptterns n e interpreted s ompt in time. The seond rule is neessry s the opposite yields set where no new event is strting, whih does not hve ler interprettion in terms of events. The third is neessry s τ[γ i ] : μ is interpreted s ssigning feture to the urrent event in voie γ i. To give ler interprettion to VVP in terms of R, we must void ses where feture would e ssigned to the ontinution of n event (s this is impossile to represent in R). Notie how well-formed VVP pttern oinides with the typil use of regulr expressions in Humdrum pttern s desried in Set. 1: slie ontins informtion out the strt or ontinutions of events, nd out musil fetures. 4 Susumption for Vertil Viewpoints In this setion, the reltion of susumption for VVP is defined. This reltion is entirely different thn the θ-susumption of R defined in Set. 2 nd it diretly orresponds to how pttern mthing is implemented in VVP. We show tht susumption in VVP is sound nd omplete with respet to susumption in R, tking into ount the VVP to R trnsltion defined in the previous Set. 3. Susumption of vertil viewpoints is defined s follows. Definition 4. Given two VVP ptterns v 1 nd v 2,wesythtv 1 susumes v 2, written v 1 VVP v 2, iff there is mpping from the sets of v 1 to the sets of v 2 suh tht onseutive sets in v 1 re mpped to onseutive sets in v 2 ; nd tht tht every set in v 1 is mpped to superset in v 2. Informlly, we sy tht v 1 n e ligned with v 2 suh tht ligned sets re in superset reltion. Figure 7 illustrtes the notion of susumption in VVP. The figure shows suessive refinements of suspension pttern, strting from two-event pttern tht does not ontin ny musil reltions nd ulminting with three-event pttern tht expresses the pproprite temporl reltions, dissonne nd onsonne, nd resolution y melodi step down. Clim 1. Susumption for VVP is sound nd omplete with respet to susumption in R. Tht is, given v 1 nd v 2, nd their orresponding reltionl ptterns R(v 1 )ndr(v 2 ), we hve v 1 VVP v 2 iff R(v 1 ) R R(v 2 ). Cse v 1 VVP v 2. Suppose tht it is not true tht R(v 1 ) R R(v 2 ), then for ll vrile sustitution θ, itmustethesethtr(v 1 )θ ontins t lest one tom tht R(v 2 ) does not ontin. Then there must e one set in v 1 tht ontins feture tht its orresponding set in v 2 does not ontin. This ontrdits v 1 VVP v 2, so lerly we must hve R(v 1 ) R R(v 2 ).
9 Susumption of Vertil Viewpoint Ptterns 9 VVP { } strts[0] : f strts[1] : t VVP strts[0] : f strts[1] : t qul[1][0] : diss sw Instnes VVP strts[0] : f { } strts[0] : t strts[1] : t strts[1] : f qul[1][0] : diss VVP strts[0] : t strts[0] : f strts[1] : f strts[1] : t qul[0][1] : ons qul[1][0] : diss ont[0] : -s R m sw sw Fig. 7. Susumption in VVP nd the susumption of orresponding reltionl networks. Instnes re seleted from Bh horle hrmoniztions. Cse R(v 1 ) VVP R(v 2 ). The proof rests on three oservtions: i) given the lelling of events in v 1 nd v 2, the sustitution θ implied y R(v 1 ) R R(v 2 ) indues mpping from the feture sets of v 1 to the feture sets of v 2 ; ii) ny two onseutive sets in v 1 re mpped to onseutive sets in v 2 ; nd iii) ny set in v 1 is neessrily mpped to superset in v 2. From these onditions, it follows tht v 1 VVP v 2. First oservtion. Consider ny set in v 1. By definition, there is t lest one strts[γ i ]:t feture, nd it is ssigned fresh lel : v 1 : v 2 : strts[γ i] : t strts[γ j] : t strts[γ i] : t strts[γ j] : t θ = θ =
10 10 M. Bergeron nd D. Conklin The lel is is mpped to some y the sustitution θ implied y R(v 1 ) R R(v 2 ). As every strts[γ i ]:t feture in v 2 is lso ssigned fresh lel, the unmiguously refers to extly one set in v 2. Tht is, there is single set in v 2 where the lel is ssoited with strts[γ i ]:t feture. Note tht euse the feture strts[γ i ]:t implies n tom voie(,i)inr(v 1 )θ, it follows tht R(v 2 ) must lso ontin tht tom nd tht the strts[γ i ]:t fetures in v 1 nd v 2 re in the sme voie. In the se where seond fresh lel exists (e.g. in the exmple ove), it must lso mp to the sme set in v 2.Otherwise,wewouldhvest(, )in R(v 1 )θ, ut R(v 2 ) would not ontin st(, )sthestrts[γ] :t fetures ssoited with nd would pper in different sets, whih would ontrdit R(v 1 ) R R(v 2 ). This holds for ny other fresh lel nd ensures tht we hve proper mpping: ny set in v 1 is oupled with extly one set in v 2. Seond oservtion. Consider two onseutive sets in v 1 nd their orresponding sets in v 2 : { } { } strts[γ i] : t v 1 : v 2 : { } strts[γ i] : t { } strts[γ i] : f { } strts[γ i] : t θ = θ = Clerly, R(v 1 )θ nd R(v 2 ) oth ontin m(, ) reltion. This is only possile if v 2 ontins the pproprite suessive sets. Now suppose s ove tht the suessive sets in v 2 re not onseutive: { } { } v 1 : v 2 : { } d/ {strts[γ j] : t strts[γ i] : t strts[γ j] : μ } { } strts[γ i] : t d θ = θ = θ = dθ = d Consider one intervening feture set in v 2 (shown ove with lels, ). Tht setmusthvetlestonestrts[γ j ]:t feturethtwesupposehereinvoiej. Both vlues of strts[γ j ]:μ in the seond set of v 1 led to ontrdition. If strts[γ j ]:t, thenr(v 1 )θ ontins m(,d )reltionthtr(v 2 ) lerly does not ontin. If strts[γ j ]:f, then the lel is prolonged in v 1 nd R(v 1 )θ ontins sw(, )reltionthtr(v 2 ) nnot ontin s the equivlent lel is not prolonged y virtue the strts[γ j ]:t feture in the intervening set, whih retes the fresh lel. A similr resoning pplies for more thn one intervening set nd hene the oservtion holds. Third oservtion. The mpping indued y R(v 1 ) R R(v 2 ) neessrily mps every set in v 1 to superset in v 2. Suppose this is not true. Then some set in v 1 ontins feture tht its orresponding set in v 2 does not. If tht feture is
11 Susumption of Vertil Viewpoint Ptterns 11 of the form strts[γ i ]:μ, then lerly R(v 1 )θ ontins some temporl reltion tht R(v 2 ) does not ontin. If tht feture is of the form τ[γ i ] : μ, then y definition the set in v 1 lso ontins strts[γ i ]:t feture nd y rule 5 of Fig. 6, R(v 1 )θ willontinntomoftheformτ(ε,,ε,μ)thtr(v 2 ) will not ontin. In oth ses, this ontrdits R(v 1 ) R R(v 2 ) nd we must hve tht the sets of v 1 re ligned with supersets in v 2. By the three oservtions ove, we must hve tht v 1 VVP v 2. The result is signifint s it estlishes tht the semntis given in Set. 3 is fully onsistent with the implementtion of pttern mthing in VVP,whihis diret pplition of susumption. The steps tht were tken in order to estlish the result (e.g. the well-formedness onstrints of Set. 3) revel the pities nd limittions of VVP ptterns. As pointed out in Set. 1, the nlysis presented here provides insight, y nlogy, for understnding Humdrum ptterns nd, in generl, polyphoni ptterns sed on the ide of vertil slies. 5 Disussion This pper hs formlized the vertil viewpoint lnguge VVP for expressing polyphoni ptterns. This lnguge inspired y the Humdrum pttern representtion nd the eventul gol of this work is to fully inorporte VVP within Humdrum serh tool. A semntis for the pttern lnguge ws provided y developing trnsltion of VVP ptterns to more powerful reltionl network representtion R, itself suset of predite logi. The VVP lnguge is restrited to ptterns tht re ompt in time, in prtiulr ptterns where suessive events re neessrily ontiguous. Pttern lnguges suh s Humdrum nd SPP re more generl s they llow onfigurtions tht express gps etween suessive events [8]. The VVP lnguge supports the importnt inferene of susumption, nd this is done in wy entirely different to the underlying R representtion, whih requires the omputtion of mpping etween the vriles in two reltionl networks. In VVP susumption is omputed in mnner similr to string mthing, with the exeption tht hrters re now sets nd tht insted of testing for equlity, we test for the suset reltion. In the future, we intend to detil how effiient string mthing lgorithms n e dpted to ompute susumption in VVP. Susumption is n essentil notion of ny pttern representtion, s it llows the development of ptterns y progressive speiliztion nd generliztion therey mthing fewer or more instnes. Susumption is lso essentil within ny dt mining pplition tht employs the pttern representtion s it permits refinement serh of susumption txonomy of ptterns [1]. A min result of this pper is tht susumption VVP is sound nd omplete with respet to susumption in R. In the future we intend to explore how susumption txonomies in VVP n e used to index lrge sore dtses in Humdrum formt for rpid retrievl to musiologil queries, in wy similr to the use of onepts in Desription Logis [11]. Finlly, we lso intend to nlyze other
12 12 M. Bergeron nd D. Conklin representtion of polyphoni ptterns [12,13,14,15] y similrly expressing them in terms of reltionl lnguge. As ws the se for VVP, we ntiipte tht it will e only possile for susets of the lnguges, nd tht our efforts to find suh susets will help to shed light on the strengths nd weknesses of existing polyphoni pttern lnguges. Referenes 1. Conklin, D., Bergeron, M.: Representtion nd disovery of feture set ptterns in musi. Computer Musi Journl 32(1), (2008) 2. Mxwell, J.: An Artifil Intelligene Aproh to Computer-Implemented Anlysis of Hrmony in Tonl Musi. PhD thesis, Indin University (1984) 3. Conklin, D., Bergeron, M.: Disovery of ontrpuntl ptterns. In: ISMIR 2010: 11th Interntionl Soiety for Musi Informtion Retrievl Conferene, Utreht, The Netherlnds, pp (2010) 4. Huron, D.: Musi informtion proessing using the Humdrum T oolkit: Conepts, exmples, nd lessons. Comput. Musi J. 26, (2002) 5. Wild, J.: A review of the Humdrum Toolkit: Unix tools for musil reserh, reted y Dvid Huron. Musi Theory Online 2 (1996) 6. Jn, S.: Meme hunting with the Humdrum toolkit: Priniples, prolems, nd prospets. Computer Musi Journl 28(4), (2004) 7. De Redt, L.: A perspetive on indutive dtses. ACM SIGKDD Explortions Newsletter 4(2), (2002) 8. Bergeron, M., Conklin, D.: Temporl ptterns in polyphony. In: Chew, E., Childs, A., Chun, C.H. (eds.) MCM Communitions in Computer nd Informtion Siene, vol. 38, pp Springer, Heidelerg (2009) 9. Allen, J.: Mintining knowledge out temporl intervls. Communitions of the ACM 26(11), (1983) 10. Nienhuys-Cheng, S.-H., de Wolf, R.: Foundtions of Indutive Logi Progrmming. LNCS, vol Springer, Heidelerg (1997) 11. Bder, F.: Desription logis. In: Tessris, S., Frnoni, E., Eiter, T., Gutierrez, C., Hndshuh, S., Rousset, M.-C., Shmidt, R.A. (eds.) Resoning We. LNCS, vol. 5689, pp Springer, Heidelerg (2009) 12. Bergeron, M., Conklin, D.: Strutured polyphoni ptterns. In: Ninth Interntionl Conferene on Musi Informtion Retrievl, Phildelphi, USA, pp (2008) 13. Meredith, D., Lemström, K., Wiggins, G.A.: Algorithms for disovering repeted ptterns in multidimensionl representtions of polyphoni musi. Journl of New Musi Reserh 31(4), (2002) 14. Meudi, B., Sint-Jmes, E.: Automti extrtion of pproximte repetitions in polyphoni midi files sed on pereptive riteri. In: Wiil, U.K. (ed.) CMMR LNCS, vol. 2771, pp Springer, Heidelerg (2004) 15. Ukkonen, E., Lemström, K., Mäkinen, V.: Geometri lgorithms for trnsposition invrint ontent sed musi retrievl. In: Interntionl Conferene on Musi Informtion Retrievl (ISMIR), Bltimore, Mrylnd, USA, pp (2003)
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 informationFinite 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 information1 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 informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationCS311 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 informationCS 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 informationNON-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 informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationChapter 3. Vector Spaces. 3.1 Images and Image Arithmetic
Chpter 3 Vetor Spes In Chpter 2, we sw tht the set of imges possessed numer of onvenient properties. It turns out tht ny set tht possesses similr onvenient properties n e nlyzed in similr wy. In liner
More informationAlpha Algorithm: Limitations
Proess Mining: Dt Siene in Ation Alph Algorithm: Limittions prof.dr.ir. Wil vn der Alst www.proessmining.org Let L e n event log over T. α(l) is defined s follows. 1. T L = { t T σ L t σ}, 2. T I = { t
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationTechnische 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 informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationGlobal alignment. Genome Rearrangements Finding preserved genes. Lecture 18
Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re
More informationCompiler Design. Spring Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz
University of Southern Cliforni Computer Siene Deprtment Compiler Design Spring 7 Lexil Anlysis Smple Exerises nd Solutions Prof. Pedro C. Diniz USC / Informtion Sienes Institute 47 Admirlty Wy, Suite
More informationComputational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh
Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
More informationLesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.
27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we
More informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationA 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 informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationSymmetrical 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 informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationCounting 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 information12.4 Similarity in Right Triangles
Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right
More informationHyers-Ulam stability of Pielou logistic difference equation
vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More information6.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 informationCS 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 informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this
More informationAlpha Algorithm: A Process Discovery Algorithm
Proess Mining: Dt Siene in Ation Alph Algorithm: A Proess Disovery Algorithm prof.dr.ir. Wil vn der Alst www.proessmining.org Proess disovery = Ply-In Ply-In event log proess model Ply-Out Reply proess
More informationSystem 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 informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationThe Word Problem in Quandles
The Word Prolem in Qundles Benjmin Fish Advisor: Ren Levitt April 5, 2013 1 1 Introdution A word over n lger A is finite sequene of elements of A, prentheses, nd opertions of A defined reursively: Given
More informationILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS
ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu
More information1 Nondeterministic Finite Automata
1 Nondeterministic Finite Automt Suppose in life, whenever you hd choice, you could try oth possiilities nd live your life. At the end, you would go ck nd choose the one tht worked out the est. Then you
More informationLing 3701H / Psych 3371H: Lecture Notes 9 Hierarchic Sequential Prediction
Ling 3701H / Psyh 3371H: Leture Notes 9 Hierrhi Sequentil Predition Contents 9.1 Complex events.................................... 1 9.2 Reognition of omplex events using event frgments................
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationPrefix-Free Regular-Expression Matching
Prefix-Free Regulr-Expression Mthing Yo-Su Hn, Yjun Wng nd Derik Wood Deprtment of Computer Siene HKUST Prefix-Free Regulr-Expression Mthing p.1/15 Pttern Mthing Given pttern P nd text T, find ll sustrings
More informationCHENG Chun Chor Litwin The Hong Kong Institute of Education
PE-hing Mi terntionl onferene IV: novtion of Mthemtis Tehing nd Lerning through Lesson Study- onnetion etween ssessment nd Sujet Mtter HENG hun hor Litwin The Hong Kong stitute of Edution Report on using
More informationLearning Partially Observable Markov Models from First Passage Times
Lerning Prtilly Oservle Mrkov s from First Pssge s Jérôme Cllut nd Pierre Dupont Europen Conferene on Mhine Lerning (ECML) 8 Septemer 7 Outline. FPT in models nd sequenes. Prtilly Oservle Mrkov s (POMMs).
More informationTIME AND STATE IN DISTRIBUTED SYSTEMS
Distriuted Systems Fö 5-1 Distriuted Systems Fö 5-2 TIME ND STTE IN DISTRIUTED SYSTEMS 1. Time in Distriuted Systems Time in Distriuted Systems euse eh mhine in distriuted system hs its own lok there is
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationGeneralization of 2-Corner Frequency Source Models Used in SMSIM
Generliztion o 2-Corner Frequeny Soure Models Used in SMSIM Dvid M. Boore 26 Mrh 213, orreted Figure 1 nd 2 legends on 5 April 213, dditionl smll orretions on 29 My 213 Mny o the soure spetr models ville
More informationBİL 354 Veritabanı Sistemleri. Relational Algebra (İlişkisel Cebir)
BİL 354 Veritnı Sistemleri Reltionl lger (İlişkisel Ceir) Reltionl Queries Query lnguges: llow mnipultion nd retrievl of dt from dtse. Reltionl model supports simple, powerful QLs: Strong forml foundtion
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More information1 From NFA to regular expression
Note 1: How to convert DFA/NFA to regulr expression Version: 1.0 S/EE 374, Fll 2017 Septemer 11, 2017 In this note, we show tht ny DFA cn e converted into regulr expression. Our construction would work
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationCM10196 Topic 4: Functions and Relations
CM096 Topic 4: Functions nd Reltions Guy McCusker W. Functions nd reltions Perhps the most widely used notion in ll of mthemtics is tht of function. Informlly, function is n opertion which tkes n input
More informationCoalgebra, Lecture 15: Equations for Deterministic Automata
Colger, Lecture 15: Equtions for Deterministic Automt Julin Slmnc (nd Jurrin Rot) Decemer 19, 2016 In this lecture, we will study the concept of equtions for deterministic utomt. The notes re self contined
More informationEngr354: Digital Logic Circuits
Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost
More information#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS
#A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,
More informationCS 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= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationFormal Languages and Automata
Moile Computing nd Softwre Engineering p. 1/5 Forml Lnguges nd Automt Chpter 2 Finite Automt Chun-Ming Liu cmliu@csie.ntut.edu.tw Deprtment of Computer Science nd Informtion Engineering Ntionl Tipei University
More informationHomework 3 Solutions
CS 341: Foundtions of Computer Science II Prof. Mrvin Nkym Homework 3 Solutions 1. Give NFAs with the specified numer of sttes recognizing ech of the following lnguges. In ll cses, the lphet is Σ = {,1}.
More informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationA Functorial Query Language
A Funtoril Query Lnguge Ryn Wisnesky, Dvid Spivk Deprtment of Mthemtis Msshusetts Institute of Tehnology {wisnesky, dspivk}@mth.mit.edu Presented t Boston Hskell April 16, 2014 Outline Introdution to FQL.
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationSolutions 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 informationLogic Synthesis and Verification
Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most
More informationIntermediate Math Circles Wednesday, November 14, 2018 Finite Automata II. Nickolas Rollick a b b. a b 4
Intermedite Mth Circles Wednesdy, Novemer 14, 2018 Finite Automt II Nickols Rollick nrollick@uwterloo.c Regulr Lnguges Lst time, we were introduced to the ide of DFA (deterministic finite utomton), one
More informationCan one hear the shape of a drum?
Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:
More informationLecture 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 informationAutomatic Synthesis of New Behaviors from a Library of Available Behaviors
Automti Synthesis of New Behviors from Lirry of Aville Behviors Giuseppe De Giomo Università di Rom L Spienz, Rom, Itly degiomo@dis.unirom1.it Sestin Srdin RMIT University, Melourne, Austrli ssrdin@s.rmit.edu.u
More informationUnit 4. Combinational Circuits
Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute
More informationNecessary 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 information2.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 informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationReview of Gaussian Quadrature method
Review of Gussin Qudrture method Nsser M. Asi Spring 006 compiled on Sundy Decemer 1, 017 t 09:1 PM 1 The prolem To find numericl vlue for the integrl of rel vlued function of rel vrile over specific rnge
More informationAnalysis of Temporal Interactions with Link Streams and Stream Graphs
Anlysis of Temporl Intertions with n Strem Grphs, Tiphine Vir, Clémene Mgnien http:// ltpy@ LIP6 CNRS n Soronne Université Pris, Frne 1/23 intertions over time 0 2 4 6 8,,, n for 10 time units time 2/23
More informations the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p
Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationDescriptional Complexity of Non-Unary Self-Verifying Symmetric Difference Automata
Desriptionl Complexity of Non-Unry Self-Verifying Symmetri Differene Automt Lurette Mris 1,2 nd Lynette vn Zijl 1 1 Deprtment of Computer Siene, Stellenosh University, South Afri 2 Merk Institute, CSIR,
More informationMore on automata. Michael George. March 24 April 7, 2014
More on utomt Michel George Mrch 24 April 7, 2014 1 Automt constructions Now tht we hve forml model of mchine, it is useful to mke some generl constructions. 1.1 DFA Union / Product construction Suppose
More informationCS 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 informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More informationCS241 Week 6 Tutorial Solutions
241 Week 6 Tutoril olutions Lnguges: nning & ontext-free Grmmrs Winter 2018 1 nning Exerises 1. 0x0x0xd HEXINT 0x0 I x0xd 2. 0xend--- HEXINT 0xe I nd ER -- MINU - 3. 1234-120x INT 1234 INT -120 I x 4.
More informationFigure 1. The left-handed and right-handed trefoils
The Knot Group A knot is n emedding of the irle into R 3 (or S 3 ), k : S 1 R 3. We shll ssume our knots re tme, mening the emedding n e extended to solid torus, K : S 1 D 2 R 3. The imge is lled tuulr
More information1. For each of the following theorems, give a two or three sentence sketch of how the proof goes or why it is not true.
York University CSE 2 Unit 3. DFA Clsses Converting etween DFA, NFA, Regulr Expressions, nd Extended Regulr Expressions Instructor: Jeff Edmonds Don t chet y looking t these nswers premturely.. For ech
More informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More informationOutline. Theory-based Bayesian framework for property induction Causal structure induction
Outline Theory-sed Byesin frmework for property indution Cusl struture indution Constrint-sed (ottom-up) lerning Theory-sed Byesin lerning The origins of usl knowledge Question: how do people relily ome
More informationSingle-Player and Two-Player Buttons & Scissors Games (Extended Abstract)
Single-Plyer nd Two-Plyer Buttons & Sissors Gmes (Extended Astrt) Kyle Burke 1, Erik D. Demine 2, Hrrison Gregg 3, Roert A. Hern 4, Adm Hestererg 2, Mihel Hoffmnn 5, Hiro Ito 6, Irin Kostitsyn 7, Jody
More informationTOPIC: 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 informationCSE 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 informationLinear Algebra Introduction
Introdution Wht is Liner Alger out? Liner Alger is rnh of mthemtis whih emerged yers k nd ws one of the pioneer rnhes of mthemtis Though, initilly it strted with solving of the simple liner eqution x +
More informationwhere 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 information15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013
15-451/651: Design & nlysis of lgorithms Deemer 3, 2013 Leture #28 lst hnged: Novemer 28, 2013 Lst time we strted tlking out mehnism design: how to llote n item to the person who hs the mximum vlue for
More informationTransition systems (motivation)
Trnsition systems (motivtion) Course Modelling of Conurrent Systems ( Modellierung neenläufiger Systeme ) Winter Semester 2009/0 University of Duisurg-Essen Brr König Tehing ssistnt: Christoph Blume In
More informationOn Implicative and Strong Implicative Filters of Lattice Wajsberg Algebras
Glol Journl of Mthemtil Sienes: Theory nd Prtil. ISSN 974-32 Volume 9, Numer 3 (27), pp. 387-397 Interntionl Reserh Pulition House http://www.irphouse.om On Implitive nd Strong Implitive Filters of Lttie
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationMetodologie di progetto HW Technology Mapping. Last update: 19/03/09
Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t
More informationI1 = I2 I1 = I2 + I3 I1 + I2 = I3 + I4 I 3
2 The Prllel Circuit Electric Circuits: Figure 2- elow show ttery nd multiple resistors rrnged in prllel. Ech resistor receives portion of the current from the ttery sed on its resistnce. The split is
More informationA CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA
A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA PHILIP DANIEL AND CHARLES SEMPLE Astrt. Amlgmting smller evolutionry trees into single prent tree is n importnt tsk in evolutionry iology. Trditionlly,
More information