Debit. Credit. trigger start. start. abort. commit. commit

Size: px
Start display at page:

Download "Debit. Credit. trigger start. start. abort. commit. commit"

Transcription

1 Suerviory Control of Workow Sheuling C. Wlle y P. Jenen z N. Sorkr Eletril Engineering & Comuter Siene The Univerity of Mihign Ann Arbor, MI USA fwlle,jenen,orkrg@ee.umih.eu Abtrt Workow h beome n imortnt rigm for itribute t n omuting ytem in wie rnge of lition re. In workow, tk exeuting on utonomou, heterogeneou ytem re oorinte through t n ontrol ow ontrint. An imortnt hllenge in workow mngement i the heuling of tion n oertion erforme by the onurrently exeuting tk. The legl interleving mong the tk mut be eie, n heuling ontrol mehnim mut be generte o tht the exeution rogreorretly n eiently. The heuling iue i rtiulrly iult beue the exeution ontrint my be lition-ei, n ertin utonomou tk exeution my be outie the oe of workow ontrol. We ue tehnique te from uerviory ontrol theory of irete event ytem for eifying n generting heuling ontroller in workow environment. We ue our moeling roh to eify the tk n the eenenie nite tte utomt. To ount for utonomou exeution hrteriti, ome of the event trnition in the tk utomt my be ientie being outie the ontrol of the workow mnger. Uing the tehnique in uerviory ontrol theory, we how how the exitene of heuler my be etermine n how heuler my be obtine lgorithmilly. Furthermore, where the reie l of orret exeution i foun to be untenble, we how how to n bet roximtion l n how to erive heuler for uh l. Thu we rovie n eetive men of moeling workow ytem n generting the heuling mehnim to mnge them. 1 Introution Workow ytem hve gine rominene in reent yer for lition in buine roee, hoitl minitrtion, ollbortion tehnologie, n mnufturing ontrol, mong other re. Workow re hrterize by tk whih e n mniulte hre t reoure, with lition-ei intertk eenenie. Thee tk my run on utonomou, heterogeneou ltform, involve intertion outie the omuting ytem, n emn ivere orretneonition with regr to their interleve exeution. In thi er we exmine hllenging roblem in workow, the eient n orret mngement heule for the tion n oertion tht rereent the exeution of the ytem. A n exmle, onier omuting ytem to it hoitl mngement n minitrtion. A tyil workow eribe for uh ytem my onit of everl tk uh entering the tient t into In Proeeing of Interntionl Workho on Avne Trntion Moel n Arhiteture (ATMA), e. E. Bertino, S. Jjoi n L. Kerhberg, 1996, 36{46. y Suorte in rt by NSF grnt CCR n ONR grnt N z Suorte in rt by ooertive fellowhi from IBM Toronto Lbortory. 1

2 tbe, obtining informtion on erlier viit n meil hitory, ertining inurne informtion, entering the meil ttennt' ignoti, reribing tretment meiine, eing ot n billing the tient. There my be reeene ontrint (e.g., initite rerition only fter ignoti re entere) or otentil t onit (e.g., hek reribe tretment gint llergie in the meil hitory) tht roribe ertin kin of interleve exeution mong the tk. Eh tk itelf my onit of everl tion n oertion whih re orere mong themelve. Furthermore, thee tk my exeute on ierent ltform n my hve utonomou exeution hrteriti, o ome of the oertion n tion within eh tk my be outie the ontrol of ny workow uerviion one the tk i initite. Dt my be onurrently hre mong ome of the tk tht re ermitte to exeute t the me time (e.g., the tk ertining to meil hitory n inurne). The bove erition houl inite tht mnging workow ytem ihllenging. Not only re there intr-tk orering (whih reumbly my be hnle utonomouly), but lo omlex intertk eenenie. Logil eenenie rie from the e to hre t reoure, n erformne ontrint rie from the eire to imoe the fewet retrition on the utonomou exeution. To omoun the roblem, ome of the tion within the iniviul tk my be unontrollble by n externl workow heuler. Our roh to the roblem of workow heuling roee follow. Firt we moel workow ytem irete event ytem. Eh tk in workow my be regre et of irete event orere to exeute in re-eie mnner, n the irete event ytem of the iniviul tkn be ombine to moel of the ytem whole. Seon, we ue tehnique from uerviory ontrol theory [RW89] for uh ytem to obtin orret n eient heuler tht mnge workow ytem. Our roh, though not the ne to ll workow roblem, goe te further in unertning n olving everl of the iultie eribe bove. We re in goo oition to tte unequivolly wht i oible, n how to hieve the oible, with the moel tht we eribe. In reent yer, there h been onierble work in the re of workow mngement (e.g. ee [GHS95, KR95, AAA + 96] ). Our work i relte to [ASSR93, ST94, Kle91, Gun93] in tht we re moeling tk in workow ytem nite tte utomt. Temorl logi [ST94] n nite-tte utomt [ASSR93] hve been ue to eify eenenie n heuling. Our metho i imilr to [ASSR93] in tht we moel tk nite-tte utomt, but ierent from it in tht we t the well-unertoo tehnique of uerviory ontrol theory to rovie frmework for workow ytem. Moreover, number of imortnt reult ertining to ierent kin of event (e.g., unontrollble, utonomou event) re lo hnle. 2 Deribing Workow In thi etion we introue the notion of workow n ome relte terminology. We eribe n exmle whih we ue ubequently for illutrtive uroe. 2.1 Denition A workow i n orgnize et of tk. Tk re emntilly oherent unit of work whih my be exeute on ivere, heterogeneou ltform. Eh tk onit of event to be exeute in reene orer. An event i n tion to be rrie out on the ytem; e.g., tk initition or termintion, or t e or ute. Event notition re ent to the workow heuler, whih ontrol tk exeution by eletively llowing n reventing event from ourring. A workow heuler i therefore ive in nture, llowing tk to hooe the event they exeute but limiting their rnge of hoie. Some tk my involve event tht re outie the ontrol of the workow heuler. If heuler i notie of uh n event, it nnot revent it from ourring. A workow orgnize it tk by etblihing reltionhi between event of ierent tk. Thee intertk eenenie, like the truture of the tk themelve, re ene by the workow eigner. The 2

3 Debit Creit trt trigger trt reommit reommit bort ommit bort ommit ommit Figure 1: The T RANS workow. tk of heuler i to enure heule, or equene of event, tht tie both the tk eition n the intertk eenenie. 2.2 Exmle: the T RAN S workow Conier imle workow T RAN S, illutrte in Figure 1. T RAN S trnfer fun between bnk ount by ebiting one ount n reiting the other. The workow ontin tk ebit whih trigger tk reit. Both tk involve trt event, termintion event (either ommit or bort), n n intervening re-ommit event. Eh tk i require to be tomi: it mut either exeute to omletion or not exeute t ll. We ume tht the filure of reit i tolerte but not tht of ebit; no work houl be ommitte if ebit fil. Hene the tk reit n omlete uefully only if ebit omlete uefully. There re two intertk eenenie in thi workow. Firt, if ebit i to trt work, reit mut lo trt, with ebit reeing reit. Thi trigger eeneny involve both o-ourrene onition (i.e. if ebit trt, then reit trt) n temorl onition (i.e. if reit n ebit both trt, then ebit trt before reit). Seon, it mut be enure tht reit homlete or will omlete uefully before ebit i llowe to o o. Thiommit eeneny i imly o-ourrene onition (i.e. if reit ommit, then ebit mut hve ommitte or mut ommit lter). Let n rereent the trt n ommit event of reit, n let n rereent the trt n ommit event of ebit. We ene the reltion trigger n ommit whih hol between event. Then our eenenien be exree ( trigger ) ^ ( ommit ). 3 Suerviory Control of Direte Event In thi etion we reent relevnt mteril from [RW89] for irete event ytem n the reult from uerviory ontrol theory tht re relevnt to workow heuling. 3.1 Direte event ytem Direte event ytem (DES) re ynmi ytem in whih tte hnge re ue by intntneou ourrene of event. Thee event my emnte from outie or within the ytem, my or my not be ontrollble by the ytem, n my our t reitble or unreitble time intervl. Workown be urtely moele DES, ine the workow heuler reeive event notition in irete fhion. 3

4 3.1.1 Lnguge In workow heuling, we re interete in ontrolling the equene of event tht the ytem generte. We itinguih the tye of event tht n our in workow with lbel. The event et of the ytem i the et of ll uh lbel, n rereent the et of ll nite tring over inluing the emty tring. A lnguge over i imly ubet of. We n ene lnguge to rereent the et of ll event equene tht the ytem n generte n the et of ll legl equene tht heuler houl llow. If tring w i vli event equene, then ll event ub-equene generte before w re lo vli. We ue the onet of rex loure to rereent thi roerty. A tring u i rex of tring v 2 if for ome w 2, v = uw. The rex loure L of L i the et of ll rexe of tring in L: fu : (9v 2 )(uv 2 L)g. If L = L then L i rex-loe. The behvior of DES i moele rex-loe lnguge L over n event et Lnguge genertor We n rereent the behvior of workow in term of lnguge genertor G. G i nite tte utomton (FSA) (Q; ; ; i; M) oniting of nite tte et Q, nite event et, rtil trnition funtion : Q! Q, n initil tte i 2 Q, n et of mrke tte M Q. The behvior of the ytem iture by oniering ll equene of trnition tht n be tken from the initil tte. We exten the funtion to tring of event: if q 2 Q, then (q; ) = q n for ll w 2 ; 2, (q; w) = ((q; w); ). We ene the behvior of G to be L(G) = fw 2 : (i; w) efineg. The genertor' mrke tte M rereent tte of tiftory omletion. We ene the mrke behvior of G to be L M (G) = fw 2 : (i; w) 2 Mg. It i lwy the e tht L M (G) L(G), but it i lo eirble tht L M (G) = L(G). Thi men tht every equene of event generte by G n be extene to rrive t tte of tiftory omletion. When thi i the e, we y tht G i nonbloking. Given genertor A n B, we n rereent the onurrent exeution of the genertor by the hue rout G = A k B of thee genertor. The tte of G onit of ir of tte A B, the event et i A [ B, the initil tte i the ir (i A ; i B ), n the mrke tteonit of ll ir f(; t) : 2 M A ^ t 2 M B g. The trnition funtion i ene follow: 8 ( A (q; ); B (r; )) if A (q; ) n B (r; ) re ene; >< G ((q; r); ) = ( A (q; ); r) if A (q; ) ene n B (r; ) unene; >: (q; B (r; )) if A (q; ) unene n B (r; ) ene 3.2 Suerviory ontrol In thi etion we iu how ontroller or uervior n enfore orretneonition on DES. A ontrolle ytem i moele feebk loo between genertor n uervior. At eh event ourrene, the uervior ontrol the et of oible event by ibling ertin event (reventing them from ourring). The event et i rtitione into et of ontrollble event (thoe whih n be ible) n et u of unontrollble event Feebk loo of ontrol A illutrte in Figure 2, when n event our, the genertor G move from iturrent tte q to tte G (q; ) n notie it uervior of the event' ourrene. After eh event ulie by G, the uervior en et of event, the ontrol inut, to G. Thee re the event enble in G' new tte G (q; ). Unontrollble event re lwy enble: u. The event generte by G re ontrine by the ontrol inut; eh event ent from G to the uervior ihoen from the urrent vlue of. We moel the uervior DES, n in rtiulr n FSA S. The uervior'ontrol tion re then etermine by the trnition truture of S. The uervior n genertor run in rllel. If G i in 4

5 Suervior Genertor Figure 2: Feebk loo of ontrol. tte q n S i in tte r, then event i enble if n only if G (q; ) n S (r; ) re ene. If both re ene, then G move to tte G (q; ) n S move to tte S (r; ) Controllbility We my k wht lngugen be relize by uerviory ontroller of the tye eribe bove. If ll event re ontrollble, the ontrol roblem i trivil, n ny lnguge generte by n FSA (i.e. ny regulr lnguge) n be relize; t eh tte, the uervior n ible the event for whih it utomton h no trnition ene. Controller eign i more omlite if there re unontrollble event, the uervior my not be ble to ible ertin event tht le outie it trnition truture. For lnguge K to be ontrollble, eh unontrollble event mut le to th from whih ome tring in K n be ttine. In rtiulr, K iontrollble if K u \ L(G) K; for ny rex of tring in K, if n unontrollble event i e, the reult i till rex of tring in K. For workow heuling, we wnt olution tht i not only ontrollble but lo nonbloking. The uervior mut enure tht mrke tte i lwy rehble. To hrterize the onition uner whih nonbloking olution i oible, we introue the notion of L M (G) loure. A lnguge K L M (G) i L M (G)-loe if K \ L M (G) = K. To ttin L M (G) loure, we mut enure ll the tring in K re in L M (G) n tht ny mrke rex of tring in K i itelf in K. To voi bloking, we mut not exlue ny mrke rex tht le to eire tring k, ele there will be no wy to reh k. Note tht our roh enure tht the workow heuler mintin heule tht i lwy extenible to orret one. Therefore, tte from whih no legl trnition re vilble never rie. The reult for ontrollbility, tken from [RW87b], re ummrize follow. Fix genertor G tht generte lnguge L(G) n mrke lnguge L M (G). For nonemty K L(G) there exit uervior S relizing K if n only if K i rex-loe n ontrollble. For nonemty K L M (G) there exit uervior S relizing K it mrke lnguge, n the ytem i nonbloking if n only if K iontrollble n L M (G)-loe Controllble ublnguge If given lnguge K i foun to be unontrollble, we woul like to n ontrollble lnguge K tht i loe n roximtion to K oible. In workow heuling, thi men ning ontroller tht llow mny vli heule oible while not llowing ny invli heule. It i not obviou riori whether unique, otiml (in term of the lrget number of etble heule) roximtion lwy exit, or how to n it if it oe exit. Neverthele, it i the e tht the l C(K) of ontrollble 5

6 ublnguge of K iloe uner et union n h unique ureml element K " uner et inluion [WR88b]. If, in workow heuling, we mut ontrol the ytem o tht the ontrint imliit in K re never violte, then K " i the bet olution oible. Furthermore, if we moel the genertor n uervior FSA, n lgorithm i vilble to omute K " tht i of omlexity O(mn), where m n n re the number of tte of the genertor n uervior Moulr ynthei of ontroller Sheuling workow involve enforing et of intertk eenenie imultneouly. If eh eeneny n be exree in term of n FSA, uervior n be hieve by tking the rout of ll the eeneny utomt. The reult however my uer from n exonentil tte e inree. For exmle, the rout of n eeneny utomt with m tte eh my hve mny m n tte. A wy of voiing thi roblem i to introue itionl truture into the moel, moulrizing the uervior into et of ineenent ontrint enforer. The eeneny utomt in D re run in rllel, n the ontrol inut i the interetion of the ontrol inut of ll the utomt. A moulr uervior i obviouly eirble, the quetion rie to when uh uervior i oible. The nwer een on whether the ontrint lnguge re non-oniting. Lnguge K 1 n K 2 re non-oniting if K 1 \ K 2 = K 1 \ K 2 ; for every rex tht K 1 n K 2 hve in ommon, there mut be wor they hve in ommon tht ontin thi rex. If the eire lnguge i not ontrollble, we nee to ue n roximtion. A before, we n ue the oertion " to n n otiml olution. In the e of non-oniting ontrint lnguge, the " oertor ommute with the interetion oertor. Thi men tht n otiml uervior (in term of the mximum number of etble heule) n be hieve eiently by lying the " oertor to eh eition lnguge n intereting the reult. We ummrize the bove reult, tken from [RW87, WR88]: If K 1 ; : : : K n re non-oniting, L M (G)-loe n ontrollble, then K 1 \ : : : \ K n i L M (G)-loe n ontrollble. If K " 1 ; : : : K" n re non-oniting, then K " 1 \ : : : \ K" n = (K 1 \ : : : \ K n ) ". 4 Alying Suerviory Control to Workow We now ue the enition n reult of the reviou etion to frme workow heuling uerviory ontrol roblem. We ene our DES moel of workow, uing our T RANS workow n exmle, n then ly the reult of uerviory ontrol theory to n the otiml moulr olution. 4.1 Workow irete event ytem Eh tk in workow eie eenenie between it event. The workow to thee et of eenenie tht hol between event of ierent tk. We ene workow W to be ir (T ; D), oniting of et T of tk (eh eifying et of intr-tk eenenie) n et D of intertk eenenie. Both tk n intertk eenenie re moele DES, n in rtiulr FSA Tk Eh tk T in T i n FSA (Q T ; T ; T ; i T ; M T ). Q T i nite et of tte, T i nite event et, T i rtil funtion Q T T! Q T, i T 2 Q T, n M T Q T. The event et of eh tk re ijoint: (8T; U 2 T ; T 6= U)( T \ U = ;). We n moel the unontrolle workow by k T 2T T, the rout of ll the tk in the workow. We ume tht the workow heuler n itinguih between event in tk, o eh event ourrene i unique within tk: (8q; r 2 Q T )(8 2 T )[( T (q; ) efine ^ T (r; ) efine)! (q = r)]. 6

7 G : G : Figure 3: Tkreit n ebit moele FSA. G : Figure 4: Conurrent exeution of reit n ebit moele n FSA. Eh tk begin with trt event n terminte with ommit event or n bort event. In ition there i re-ommit event tht reee termintion. A eh tk i tomi, it mut run to omletion or not t ll. Therefore the initil tte n the tte following termintion re the mrke tte. The tkreit n ebit re moele erte utomt G n G in Figure 3 n ingle utomton G = G k G in Figure Intertk eenenie Eh eeneny D in D i DES, n in rtiulr n FSA. Unlike the tk utomt, eeneny utomton h no rivte event et; rther, it event et onit of ll the event et of the tk utomt. Let = S T 2T T ; then D i n FSA (Q D ; ; D ; i D ; M D ), where Q D i nite, D i rtil funtion Q D! Q D, i D 2 Q D, n M D Q D. The T RANS workow h the intertk eenenie ( trigger ) ^ ( ommit ); we n rereent thee ontrint by the utomt D n D hown in Figure Suerviory ontrol of workow We re rey to ly the reult of Suerviory ontrol theory to our moel of the T RANS workow. We begin by ening our eition lnguge of orret heule. We then tet for ontrollbility n 7

8 D : trigger D : ommit {, } { } {, } { } { } Figure 5: Automt rereenting the intertk eenenie of T RAN S Figure 6: Genertor for eition lnguge K. bloking of thi lnguge, generte n otiml (in term of the mximum number of etble heule) ontrollble nonbloking lnguge n tet thi lnguge for moulrity Seition lnguge From the eition of the genertor G n the eenenie D n D we wih to ene the legl lnguge K of the workow ytem. K mut be ubet of eh of the lnguge L(D ) n L(D ) generte by the eeneny utomt, n it mut be ubet of the lnguge L(G). The eire lnguge i K = L(G) \ L(D ) \ L(D ), n the eire mrke lnguge i K M = L M (G) \ L M (D ) \ L M (D ). The hue rout G k D k D, generting K with mrke lnguge K M, i illutrte in Figure Controllbility We ue the reult reente in etion to etermine whether K M iontrollble. We n how tht K M i not ontrollble (i.e. K M u \ L(G) 6 K M ) by the following ounterexmle. Conier the 8

9 () 11 (b) Figure 7: Contrution of genertor for K " M : () genertor H 1, (b) genertor H 2. tring k = K M. If we exten thi tring by ing the event 1 2 u, we get the tring K M. Intuitively, thin be exline follow. The tring k rereent heule in whih the reit tk i llowe to ommit without the ebit tk hving ommitte erlier. For the ommit eeneny to hol between reit n ebit, the ebit tk mut then ommit. Thi however nnot be gurntee, ebit my bort inte (e.g. ue to filure of the ite where ebit i running), n event outie the ontrol of the workow heuler Contrution of otiml ontroller Sine the lnguge K M i not ontrollble, K " M 6= K M, o n otiml uervior in the ene of etion will only be ble to llow ubet of K M. We ue the lgorithm of [WR88b] iue in etion to ontrut genertor for K " M with mrke lnguge K" M. We trt with n FSA H 0, ub-utomton of G tht generte K with mrke lnguge K M. H 0 i imly the hue rout G k D k D, hown in Figure 6. We tke the trim of thi FSA, removing ll tte tht re unrehble from the initil tte or from whih mrke tte i unrehble. Thi remove tte 21, 31, 41, 51 n 45. The reulting FSA H 1 i hown in Figure 7. We now omre the unontrollble trnition of H 1 with thoe of G. If there i n unontrollble trnition (q; ) in G whih le from tte q in H 1 to tte r not in H 1, we mut remove q from H 1. There i uh trnition, (43; ), o we remove tte 43 n ll trnition to n from it. We then tke the trim, removing tte 42. The reult H 2 i hown in Figure 7. Comring H 2 with G, we n no unontrollble trnition in G tht le from tte in H 2 to tte 9

10 Figure 8: Genertor for K " n K ". not in H 2. A thi itertion leve H 2 unhnge, xoint i rehe, o the lgorithm terminte. H 2 generte K " M with mrke lnguge K" M Moulr olution While the ontroller olution in the reviou etion oe not uer from lrge tte e, we n till tet whether moulr olution of the tye eribe in etion i oible for our exmle. Let K n K be the lnguge generte by the eeneny utomt D n D. We n ontrut genertor for K " n K " uing the lgorithm of [WR88b]; the genertor re hown in Figure 8. Our gol i to ue thee genertor in ontroller for the lnguge K " = (K \ K ) ". The lnguge reulting from the rllel ue of thee genertor, eribe in etion 3.2.4, i K " \ K". Next, by inetion, we ee tht K " n K " re non-oniting, i.e. K \ K = K \ K. Thi imlie tht K " \ K" = (K \ K ) ", n hene tht the moulr roh roue the eire lnguge K. 5 Conluion In thi er, we hve ree iue in heuling utonomou tk in workow environment. We hve rovie frmework te from the well-unertoo omin of irete event ontrol ytem theory. Our frmework i be on nite-tte utomt n rovie rtil mehnim for eifying eenenie mong the tk. Given et of eenenie, we re ble to reon bout the exitene of heuler n to relize heuler when they exit. Furthermore, we rovie the men to imoe intertk eition by regulr lnguge whih filitte lition-ei eenenie to be mnte eily. There re everl iue within our frmework tht nee to be reolve. Thee inlue filure reovery, hnling intrtbility roblem tht my rie, imlementtion tehnique, et. Severl imle toolkit exit for the eition n mniultion of irete event ytemontrol, n we exet to ue them with our roh to it in the eveloment of workow mngement ytem. Referene [AAA + 96] G. Alono, D. Agrwl, A. El Abbi, M. Kmth, R. Gunthor, n C. Mohn. Avne trntion moel in workow ontext. In Proeeing of the Twelfth Interntionl Conferene 10

11 on Dt Engineering, [ASSR93] P.C. Attie, M.P. Singh, A. Sheth, n M. Ruinkiewiz. Seifying n enforing intertk eenenie. In Proeeing of the Nineteenth Interntionl Conferene on Very Lrge Dt Be, ge 134{145, [GHS95] D. Georgkooulo, M. Hornik, n A. Sheth. An overview of workow mngement: from roe moeling to workow utomtion infrtruture. Ditribute n Prllel Dtbe, 3:119{153, [Gun93] R. Gunthor. Extene trntion roeing be on eeneny rule. In Proeeing of RIDE-IMS, ge 207{214, [Kle91] J. Klein. Avne rule riven trntion mngement. In Proeeing of the Thirty-ixth IEEE Comuter Soiety Interntionl Conferene, ge 562{567, [KR95] M. Kmth n K. Rmmrithm. Moeling, orretne n ytem iue in uorting vne tbe lition uing workow mngement ytem. Tehnil Reort 95-50, Univerity of Mhuett, [RW87] [RW87b] [RW89] [ST94] [WR88] [WR88b] P.J. Rmge n W.M. Wonhm. Moulr feebk logi for irete event ytem. SIAM Journl of Control n Otimiztion, 25(5):1202{1218, My P.J. Rmge n W.M. Wonhm. Suerviory ontrol of l of irete-event roee. SIAM Journl of Control n Otimiztion, 25(1):206{230, Jnury P.J. Rmge n W.M. Wonhm. The ontrol of irete event ytem. Proeeing of the IEEE, 77(1):81{98, Jnury M.P. Singh n C. Tomlinon. Workow exeution through itribute event. In Proeeing of the Sixth Interntionl Conferene on Mngement of Dt, W.M. Wonhm n P.J. Rmge. Moulr uervior ontrol of irete event ytem. Mthemtil Control, Signl, n Sytem, 1(1):13{30, Jnury W.M. Wonhm n P.J. Rmge. On the ureml ontrollble ublnguge of given lnguge. SIAM Journl of Control n Otimiztion, 25(3):637{659, My

An Application of Fuzzy Soft Set in Multicriteria Decision Making Problem

An Application of Fuzzy Soft Set in Multicriteria Decision Making Problem Interntion Journ of Comuter Aition (0975 8887) Voume 8 No, Jnury 0 An Aition of Fuzzy Soft Set in Mutiriteri Deiion Mking Probem P K D Dertment of Mthemti NERIST Nirjui, Arunh Preh R Borgohin Dertment

More information

CSCI565 - Compiler Design

CSCI565 - Compiler Design CSCI565 - Compiler Deign Spring 6 Due Dte: Fe. 5, 6 t : PM in Cl Prolem [ point]: Regulr Expreion nd Finite Automt Develop regulr expreion (RE) tht detet the longet tring over the lphet {-} with the following

More information

A NEW COMBINED BRACKETING METHOD FOR SOLVING NONLINEAR EQUATIONS

A NEW COMBINED BRACKETING METHOD FOR SOLVING NONLINEAR EQUATIONS Aville online t htt://ik.org J. Mth. Comut. Si. 3 (013), No. 1, 87-93 ISSN: 197-5307 A NEW COMBINED BRACKETING METHOD FOR SOLVING NONLINEAR EQUATIONS M.A. HAFIZ Dertment of mthemti, Fulty of Siene nd rt,

More information

PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1. Sahika Genc, Stéphane Lafortune

PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1. Sahika Genc, Stéphane Lafortune PREDICTABILITY IN DISCRETE-EVENT SYSTEMS UNDER PARTIAL OBSERVATION 1 Shik Gen, Stéhne Lfortune Dertment of Eletril Engineering n Comuter Siene, University of Mihign, 1301 Bel Avenue, Ann Aror, MI 48109-2122,

More information

EE Control Systems LECTURE 8

EE Control Systems LECTURE 8 Coyright F.L. Lewi 999 All right reerved Udted: Sundy, Ferury, 999 EE 44 - Control Sytem LECTURE 8 REALIZATION AND CANONICAL FORMS A liner time-invrint (LTI) ytem cn e rereented in mny wy, including: differentil

More information

positive definite (symmetric with positive eigenvalues) positive semi definite (symmetric with nonnegative eigenvalues)

positive definite (symmetric with positive eigenvalues) positive semi definite (symmetric with nonnegative eigenvalues) Chter Liner Qudrtic Regultor Problem inimize the cot function J given by J x' Qx u' Ru dt R > Q oitive definite ymmetric with oitive eigenvlue oitive emi definite ymmetric with nonnegtive eigenvlue ubject

More information

APPENDIX 2 LAPLACE TRANSFORMS

APPENDIX 2 LAPLACE TRANSFORMS APPENDIX LAPLACE TRANSFORMS Thi ppendix preent hort introduction to Lplce trnform, the bic tool ued in nlyzing continuou ytem in the frequency domin. The Lplce trnform convert liner ordinry differentil

More information

ECE 274 Digital Logic RTL Design: Introduction. Digital Design. RTL Design: Capture Behavior, Convert to Circuit. Introduction.

ECE 274 Digital Logic RTL Design: Introduction. Digital Design. RTL Design: Capture Behavior, Convert to Circuit. Introduction. i ni e z ECE 274 igitl ogi T eign: ntroution (Vhi): Ch. 5.1 5.2 Chpter 5: egiter-trnfer evel (T) eign lie to ompny the textbook, Firt Eition, by, John Wiley n on Publiher, 2007. http://www.vhi.om Copyright

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

C. C^mpenu, K. Slom, S. Yu upper boun of mn. So our result is tight only for incomplete DF's. For restricte vlues of m n n we present exmples of DF's

C. C^mpenu, K. Slom, S. Yu upper boun of mn. So our result is tight only for incomplete DF's. For restricte vlues of m n n we present exmples of DF's Journl of utomt, Lnguges n Combintorics u (v) w, x{y c OttovonGuerickeUniversitt Mgeburg Tight lower boun for the stte complexity of shue of regulr lnguges Cezr C^mpenu, Ki Slom Computing n Informtion

More information

Internal Model Control

Internal Model Control Internal Model Control Part o a et o leture note on Introdution to Robut Control by Ming T. Tham 2002 The Internal Model Prinile The Internal Model Control hiloohy relie on the Internal Model Prinile,

More information

APPLIED THERMODYNAMICS TUTORIAL 6 AIR-VAPOUR MIXTURES

APPLIED THERMODYNAMICS TUTORIAL 6 AIR-VAPOUR MIXTURES APPLIED THERMODYNAMICS TUTORIAL 6 AIR-APOUR MIXTURES In thi tutoril you will do the following. Revie the UNIERSAL GAS LAW Lern DALTONS LAW OF PARTIAL PRESSURES Aly thee lw to mixture of wter vour nd ir.

More information

Physics 111. Lecture 11 (Walker: 6.1-2) Friction Forces. Frictional Forces. Microscopic Friction. Friction vs. Area

Physics 111. Lecture 11 (Walker: 6.1-2) Friction Forces. Frictional Forces. Microscopic Friction. Friction vs. Area Phyi 111 Leture 11 (Wler: 6.1-2) rition ore ritionl ore rition h it bi in urfe tht re not ompletely mooth: September 25, 2009 Leture 11 1/28 Leture 11 2/28 Surfe Roughne Miroopi rition Adheion rition v.

More information

is the cut off frequency in rads.

is the cut off frequency in rads. 0 ELETRIAL IRUITS 9. HIGH RDER ATIVE FILTERS (With Tle) Introdution Thi development explin how to deign Butterworth (Mximlly Flt) or heyhev (Equl Ripple) Low P, High P or Bnd P tive filter. Thi tretment

More information

Compiler Design. Fall Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Fall Lexical Analysis. Sample Exercises and Solutions. Prof. Pedro C. Diniz Univerity of Southern Cliforni Computer Siene Deprtment Compiler Deign Fll 6 Lexil Anlyi Smple Exerie nd Solution Prof. Pedro C. Dini USC / Informtion Siene Intitute 4676 Admirlty Wy, Suite Mrin del Rey,

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

Hadamard-Type Inequalities for s-convex Functions

Hadamard-Type Inequalities for s-convex Functions Interntionl Mthemtil Forum, 3, 008, no. 40, 965-975 Hdmrd-Type Inequlitie or -Convex Funtion Mohmmd Alomri nd Mlin Dru Shool o Mthemtil Siene Fulty o Siene nd Tehnology Univeriti Kebngn Mlyi Bngi 43600

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

Unfoldings of Networks of Timed Automata

Unfoldings of Networks of Timed Automata Unfolings of Networks of Time Automt Frnk Cssez Thoms Chtin Clue Jr Ptrii Bouyer Serge H Pierre-Alin Reynier Rennes, Deemer 3, 2008 Unfolings [MMilln 93] First efine for Petri nets Then extene to other

More information

MATH4455 Module 10 Evens, Odds and Ends

MATH4455 Module 10 Evens, Odds and Ends MATH4455 Module 10 Even, Odd nd End Min Mth Conept: Prity, Ple Vlue Nottion, Enumertion, Story Prolem Auxiliry Ide: Tournment, Undireted grph I. The Mind-Reding Clultor Prolem. How doe the mind-reding

More information

HARMONIC BALANCE SOLUTION OF COUPLED NONLINEAR NON-CONSERVATIVE DIFFERENTIAL EQUATION

HARMONIC BALANCE SOLUTION OF COUPLED NONLINEAR NON-CONSERVATIVE DIFFERENTIAL EQUATION GNIT J. nglesh Mth. So. ISSN - HRMONIC LNCE SOLUTION OF COUPLED NONLINER NON-CONSERVTIVE DIFFERENTIL EQUTION M. Sifur Rhmn*, M. Mjeur Rhmn M. Sjeur Rhmn n M. Shmsul lm Dertment of Mthemtis Rjshhi University

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

Tutorial 2 Euler Lagrange ( ) ( ) In one sentence: d dx

Tutorial 2 Euler Lagrange ( ) ( ) In one sentence: d dx Tutoril 2 Euler Lgrnge In one entene: d Fy = F d Importnt ft: ) The olution of EL eqution i lled eterml. 2) Minmum / Mimum of the "Mot Simple prolem" i lo n eterml. 3) It i eier to olve EL nd hek if we

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

Laboratory for Foundations of Computer Science. An Unfolding Approach. University of Edinburgh. Model Checking. Javier Esparza

Laboratory for Foundations of Computer Science. An Unfolding Approach. University of Edinburgh. Model Checking. Javier Esparza An Unfoling Approh to Moel Cheking Jvier Esprz Lbortory for Fountions of Computer Siene University of Einburgh Conurrent progrms Progrm: tuple P T 1 T n of finite lbelle trnsition systems T i A i S i i

More information

Type 2: Improper Integrals with Infinite Discontinuities

Type 2: Improper Integrals with Infinite Discontinuities mth imroer integrls: tye 6 Tye : Imroer Integrls with Infinite Disontinuities A seond wy tht funtion n fil to be integrble in the ordinry sense is tht it my hve n infinite disontinuity (vertil symtote)

More information

TANGO: A notation for describing advanced transaction. models. Sergio Bandinelli, Stefano Ceri, Miguel Felder. CEFRIEL { Politecnico di Milano

TANGO: A notation for describing advanced transaction. models. Sergio Bandinelli, Stefano Ceri, Miguel Felder. CEFRIEL { Politecnico di Milano TNGO: nottion for deribing dvned trntion model ergio Bndinelli, tefno eri, Miguel Felder EFRIEL { Politenio di Milno GOODTEP EPRIT-III projet No. 6115 GOODTEP Tehnil Report No. 019 Mrh, 1994 btrt The lil

More information

STABILITY and Routh-Hurwitz Stability Criterion

STABILITY and Routh-Hurwitz Stability Criterion Krdeniz Technicl Univerity Deprtment of Electricl nd Electronic Engineering 6080 Trbzon, Turkey Chpter 8- nd Routh-Hurwitz Stbility Criterion Bu der notlrı dece bu deri ln öğrencilerin kullnımın çık olup,

More information

Lecture 2: Cayley Graphs

Lecture 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 information

ECSE 4440 Control System Engineering. Project 1. Controller Design of a Second Order System TA

ECSE 4440 Control System Engineering. Project 1. Controller Design of a Second Order System TA ECSE 4440 Control Sytem Enineerin Project 1 Controller Dein of a Secon Orer Sytem TA Content 1. Abtract. Introuction 3. Controller Dein for a Sinle Penulum 4. Concluion 1. Abtract The uroe of thi roject

More information

F / x everywhere in some domain containing R. Then, + ). (10.4.1)

F / x everywhere in some domain containing R. Then, + ). (10.4.1) 0.4 Green's theorem in the plne Double integrls over plne region my be trnsforme into line integrls over the bounry of the region n onversely. This is of prtil interest beuse it my simplify the evlution

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

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

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

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

CS241 Week 6 Tutorial Solutions

CS241 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 information

PHYSICS 211 MIDTERM I 22 October 2003

PHYSICS 211 MIDTERM I 22 October 2003 PHYSICS MIDTERM I October 3 Exm i cloed book, cloed note. Ue onl our formul heet. Write ll work nd nwer in exm booklet. The bck of pge will not be grded unle ou o requet on the front of the pge. Show ll

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

Analysis of Feedback Control Systems

Analysis of Feedback Control Systems Colorado Shool of Mine CHEN403 Feedbak Control Sytem Analyi of Feedbak Control Sytem ntrodution to Feedbak Control Sytem 1 Cloed oo Reone 3 Breaking Aart the Problem to Calulate the Overall Tranfer Funtion

More information

Figure 1 Siemens PSSE Web Site

Figure 1 Siemens PSSE Web Site Stability Analyi of Dynamic Sytem. In the lat few lecture we have een how mall ignal Lalace domain model may be contructed of the dynamic erformance of ower ytem. The tability of uch ytem i a matter of

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

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

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

Applicability of Matrix Inverse in Simple Model of Economics An Analysis

Applicability of Matrix Inverse in Simple Model of Economics An Analysis IOSR Journl of Mthemtic IOSR-JM e-issn: 78-578, p-issn: 39-765X. Volume, Iue 5 Ver. VI Sep-Oct. 4, PP 7-34 pplicility of Mtrix Invere in Simple Moel of Economic n nlyi Mr. nupm Srm Deprtment of Economic

More information

Nondeterministic Automata vs Deterministic Automata

Nondeterministic 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 information

Artificial Intelligence Markov Decision Problems

Artificial Intelligence Markov Decision Problems rtificil Intelligence Mrkov eciion Problem ilon - briefly mentioned in hpter Ruell nd orvig - hpter 7 Mrkov eciion Problem; pge of Mrkov eciion Problem; pge of exmple: probbilitic blockworld ction outcome

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

I 3 2 = I I 4 = 2A

I 3 2 = I I 4 = 2A ECE 210 Eletril Ciruit Anlysis University of llinois t Chigo 2.13 We re ske to use KCL to fin urrents 1 4. The key point in pplying KCL in this prolem is to strt with noe where only one of the urrents

More information

Analysis of Temporal Interactions with Link Streams and Stream Graphs

Analysis 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 information

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1.

, g. Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g. Solution 1. Exerise Genertor polynomils of onvolutionl ode, given in binry form, re g, g j g. ) Sketh the enoding iruit. b) Sketh the stte digrm. ) Find the trnsfer funtion T. d) Wht is the minimum free distne of

More information

ISOTHERMAL REACTOR DESIGN (4) Marcel Lacroix Université de Sherbrooke

ISOTHERMAL REACTOR DESIGN (4) Marcel Lacroix Université de Sherbrooke ISOTHERML RETOR DESIGN (4) Marcel Lacroix Université de Sherbrooke ISOTHERML RETOR DESIGN: OBJETIVE TO DESIGN VRIOUS TYES OF IDEL ISOTHERML RETORS USING THE FOLLOWING TOOLS: 1. MOLE BLNE OR DESIGN EQUTION:

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

CSC 373: Algorithm Design and Analysis Lecture 9

CSC 373: Algorithm Design and Analysis Lecture 9 CSC 373: Algorihm Deign n Anlyi Leure 9 Alln Boroin Jnury 28, 2013 1 / 16 Leure 9: Announemen n Ouline Announemen Prolem e 1 ue hi Friy. Term Te 1 will e hel nex Mony, Fe in he uoril. Two nnounemen o follow

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

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

Search: Cost & Heuristics

Search: Cost & Heuristics 9/9/ CSE 7: Artiiil Intelligene Autumn 0 Pizz? Announements Serh: Cost & Heuristis Dn Wel Projet : Serh online tomorrow ue Mony 0/ ue We / Strt! With slies rom Dn Klein, Sturt Russell, Anrew Moore, Luke

More information

Lyapunov-type inequality for the Hadamard fractional boundary value problem on a general interval [a; b]; (1 6 a < b)

Lyapunov-type inequality for the Hadamard fractional boundary value problem on a general interval [a; b]; (1 6 a < b) Lypunov-type inequlity for the Hdmrd frctionl boundry vlue problem on generl intervl [; b]; ( 6 < b) Zid Ldjl Deprtement of Mthemtic nd Computer Science, ICOSI Lbortory, Univerity of Khenchel, 40000, Algeri.

More information

Prefix-Free Regular-Expression Matching

Prefix-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 information

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz

Welcome. Balanced search trees. Balanced Search Trees. Inge Li Gørtz Welome nge Li Gørt. everse tehing n isussion of exerises: 02110 nge Li Gørt 3 tehing ssistnts 8.00-9.15 Group work 9.15-9.45 isussions of your solutions in lss 10.00-11.15 Leture 11.15-11.45 Work on exerises

More information

Reinforcement learning

Reinforcement learning Reinforcement lerning Regulr MDP Given: Trnition model P Rewrd function R Find: Policy π Reinforcement lerning Trnition model nd rewrd function initilly unknown Still need to find the right policy Lern

More information

SOME COPLANAR POINTS IN TETRAHEDRON

SOME COPLANAR POINTS IN TETRAHEDRON Journl of Pure n Applie Mthemtis: Avnes n Applitions Volume 16, Numer 2, 2016, Pges 109-114 Aville t http://sientifivnes.o.in DOI: http://x.oi.org/10.18642/jpm_7100121752 SOME COPLANAR POINTS IN TETRAHEDRON

More information

Chapter 2: Rigid Body Motions and Homogeneous Transforms

Chapter 2: Rigid Body Motions and Homogeneous Transforms Chater : igi Bo Motion an Homogeneou Tranform (original lie b Stee from Harar) ereenting oition Definition: oorinate frame Aetn n of orthonormal bai etor anning n For eamle When rereenting a oint we nee

More information

TP 10:Importance Sampling-The Metropolis Algorithm-The Ising Model-The Jackknife Method

TP 10:Importance Sampling-The Metropolis Algorithm-The Ising Model-The Jackknife Method TP 0:Importnce Smpling-The Metropoli Algorithm-The Iing Model-The Jckknife Method June, 200 The Cnonicl Enemble We conider phyicl ytem which re in therml contct with n environment. The environment i uully

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-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 information

6. Suppose lim = constant> 0. Which of the following does not hold?

6. Suppose lim = constant> 0. Which of the following does not hold? CSE 0-00 Nme Test 00 points UTA Stuent ID # Multiple Choie Write your nswer to the LEFT of eh prolem 5 points eh The k lrgest numers in file of n numers n e foun using Θ(k) memory in Θ(n lg k) time using

More information

International Journal of Scientific & Engineering Research, Volume 4, Issue 8, August ISSN

International Journal of Scientific & Engineering Research, Volume 4, Issue 8, August ISSN Interntionl Journl of Scientific & Engineering Reerc Volume Iue 8 ugut- 68 ISSN 9-558 n Inventory Moel wit llowble Sortge Uing rpezoil Fuzzy Number P. Prvti He & ocite Profeor eprtment of Mtemtic ui- E

More information

SPACE VECTOR PULSE- WIDTH-MODULATED (SV-PWM) INVERTERS

SPACE VECTOR PULSE- WIDTH-MODULATED (SV-PWM) INVERTERS CHAPTER 7 SPACE VECTOR PULSE- WIDTH-MODULATED (SV-PWM) INVERTERS 7-1 INTRODUCTION In Chpter 5, we briefly icue current-regulte PWM inverter uing current-hyterei control, in which the witching frequency

More information

Chapter 4 Regular Grammar and Regular Sets. (Solutions / Hints)

Chapter 4 Regular Grammar and Regular Sets. (Solutions / Hints) C K Ngpl Forml Lnguges nd utomt Theory Chpter 4 Regulr Grmmr nd Regulr ets (olutions / Hints) ol. (),,,,,,,,,,,,,,,,,,,,,,,,,, (),, (c) c c, c c, c, c, c c, c, c, c, c, c, c, c c,c, c, c, c, c, c, c, c,

More information

CSC2542 State-Space Planning

CSC2542 State-Space Planning CSC2542 Stte-Spe Plnning Sheil MIlrith Deprtment of Computer Siene University of Toronto Fll 2010 1 Aknowlegements Some the slies use in this ourse re moifitions of Dn Nu s leture slies for the textook

More information

CHOOSING THE NUMBER OF MODELS OF THE REFERENCE MODEL USING MULTIPLE MODELS ADAPTIVE CONTROL SYSTEM

CHOOSING THE NUMBER OF MODELS OF THE REFERENCE MODEL USING MULTIPLE MODELS ADAPTIVE CONTROL SYSTEM Interntionl Crpthin Control Conference ICCC 00 ALENOVICE, CZEC REPUBLIC y 7-30, 00 COOSING TE NUBER OF ODELS OF TE REFERENCE ODEL USING ULTIPLE ODELS ADAPTIVE CONTROL SYSTE rin BICĂ, Victor-Vleriu PATRICIU

More information

Topics to be covered. Topology defined by TX range. Power/Topology Control. Power/Topology Control. Changes Topology

Topics to be covered. Topology defined by TX range. Power/Topology Control. Power/Topology Control. Changes Topology Power/Topology Control Topi to be overe Power/Topology Control problem. Importane of power ontrol Minimum-energy Path-preerving Graph Algorithm Performane of the algorithm Diuion/quetion/omment Wire network

More information

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS

POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS Bull. Koren Mth. So. 35 (998), No., pp. 53 6 POSITIVE IMPLICATIVE AND ASSOCIATIVE FILTERS OF LATTICE IMPLICATION ALGEBRAS YOUNG BAE JUN*, YANG XU AND KEYUN QIN ABSTRACT. We introue the onepts of positive

More information

4-4 E-field Calculations using Coulomb s Law

4-4 E-field Calculations using Coulomb s Law 1/11/5 ection_4_4_e-field_clcultion_uing_coulomb_lw_empty.doc 1/1 4-4 E-field Clcultion uing Coulomb Lw Reding Aignment: pp. 9-98 Specificlly: 1. HO: The Uniform, Infinite Line Chrge. HO: The Uniform Dik

More information

Table of Content. c 1 / 5

Table of Content. c 1 / 5 Tehnil Informtion - t nd t Temperture for Controlger 03-2018 en Tble of Content Introdution....................................................................... 2 Definitions for t nd t..............................................................

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

Graduate Algorithms CS F-18 Flow Networks

Graduate Algorithms CS F-18 Flow Networks Grue Algorihm CS673-2016F-18 Flow Nework Dvi Glle Deprmen of Compuer Siene Univeriy of Sn Frnio 18-0: Flow Nework Diree Grph G Eh ege weigh i piy Amoun of wer/eon h n flow hrough pipe, for inne Single

More information

A Graph-based Decentralization Proposal for Convex Non Linear Separable Problems with Linear Constraints

A Graph-based Decentralization Proposal for Convex Non Linear Separable Problems with Linear Constraints Proeedings of the World Congress on Engineering nd Comuter Siene Vol I WCECS, 5 Otober,, Sn Frniso, USA A Grhbsed Deentrlition Proosl for Convex Non Liner Serble Problems with Liner Constrints Jime Cerd,

More information

THE SOLAR SYSTEM. We begin with an inertial system and locate the planet and the sun with respect to it. Then. F m. Then

THE SOLAR SYSTEM. We begin with an inertial system and locate the planet and the sun with respect to it. Then. F m. Then THE SOLAR SYSTEM We now want to apply what we have learned to the olar ytem. Hitorially thi wa the great teting ground for mehani and provided ome of it greatet triumph, uh a the diovery of the outer planet.

More information

Optimization of Fuzzy Inventory Model for Allowable Shortage

Optimization of Fuzzy Inventory Model for Allowable Shortage S.Rexlin Jeykumri Interntionl Journl o omputer Siene n Mobile omputin Vol.5 Iue.8 uut- 06 p. - vilble Online t www.ijm.om Interntionl Journl o omputer Siene n Mobile omputin Montly Journl o omputer Siene

More information

Solutions to assignment 3

Solutions to assignment 3 D Sruure n Algorihm FR 6. Informik Sner, Telikeplli WS 03/04 hp://www.mpi-.mpg.e/~ner/oure/lg03/inex.hml Soluion o ignmen 3 Exerie Arirge i he ue of irepnie in urreny exhnge re o rnform one uni of urreny

More information

Reinforcement Learning and Policy Reuse

Reinforcement Learning and Policy Reuse Reinforcement Lerning nd Policy Reue Mnuel M. Veloo PEL Fll 206 Reding: Reinforcement Lerning: An Introduction R. Sutton nd A. Brto Probbilitic policy reue in reinforcement lerning gent Fernndo Fernndez

More information

Introduction to Graphical Models

Introduction to Graphical Models Introution to Grhil Moels Kenji Fukumizu The Institute of Sttistil Mthemtis Comuttionl Methoology in Sttistil Inferene II Introution n Review 2 Grhil Moels Rough Sketh Grhil moels Grh: G V E V: the set

More information

Compression of Palindromes and Regularity.

Compression 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 information

A Disambiguation Algorithm for Finite Automata and Functional Transducers

A Disambiguation Algorithm for Finite Automata and Functional Transducers A Dismigution Algorithm for Finite Automt n Funtionl Trnsuers Mehryr Mohri Cournt Institute of Mthemtil Sienes n Google Reserh 51 Merer Street, New York, NY 1001, USA Astrt. We present new ismigution lgorithm

More information

Families of Solutions to Bernoulli ODEs

Families of Solutions to Bernoulli ODEs In the fmily of solutions to the differentil eqution y ry dx + = it is shown tht vrition of the initil condition y( 0 = cuses horizontl shift in the solution curve y = f ( x, rther thn the verticl shift

More information

Soft and Fast Starting Induction Motors Using Controllable Resistive Type Fault Current Limiter

Soft and Fast Starting Induction Motors Using Controllable Resistive Type Fault Current Limiter Soft n Ft Strting Inution Motor Uing Controllle eitive Type Fult Current Limiter Neri Seye Behz n Mihel Negnevitky, Senior memer, IEEE Shool of Engineering, Univerity of Tmni Hort TAS 7000, Autrli Neri.Seyeehz@ut.eu.u

More information

Inverse Kinematics 1 1/21/2018

Inverse Kinematics 1 1/21/2018 Invere Kinemati 1 Invere Kinemati 2 given the poe of the end effetor, find the joint variable that produe the end effetor poe for a -joint robot, given find 1 o R T 3 2 1,,,,, q q q q q q RPP + Spherial

More information

Petri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering

Petri Nets. Rebecca Albrecht. Seminar: Automata Theory Chair of Software Engeneering Petri Nets Ree Alreht Seminr: Automt Theory Chir of Softwre Engeneering Overview 1. Motivtion: Why not just using finite utomt for everything? Wht re Petri Nets nd when do we use them? 2. Introdution:

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

The Intouch Triangle and the OI-line

The Intouch Triangle and the OI-line Forum Geometriorum Volume 4 004 15 134. FORUM GEOM ISSN 1534-1178 The Intouh Tringle nd the OI-line Eri Dnneel Abtrt. We prove ome intereting reult relting the intouh tringle nd the OI line of tringle.

More information

The Shortest Path Problem Graph Algorithms - 3

The Shortest Path Problem Graph Algorithms - 3 Algorithm Deign nd Anli Vitor Admhik C - pring Leture Feb, Crnegie Mellon Univerit The hortet Pth Problem Grph Algorithm - The hortet Pth Problem Given poitivel weighted grph G with oure verte, find the

More information

Experimental Simulation of Digital IIR Filter Design Technique Based on Butterworth and Impulse Invariance Concepts

Experimental Simulation of Digital IIR Filter Design Technique Based on Butterworth and Impulse Invariance Concepts Exerimental Simulation of Digital IIR Filter Deign Tehnique Bae on Butterworth an Imule Invariane Conet Vorao Patanaviit Aumtion Univerity of Thailan Bangkok, Thailan e-mail: Patanaviit@yahoo.om Abtrat

More information

EXERCISES FOR SECTION 6.3

EXERCISES FOR SECTION 6.3 y 6. Secon-Orer Equation 499.58 4 t EXERCISES FOR SECTION 6.. We ue integration by part twice to compute Lin ωt Firt, letting u in ωt an v e t t,weget Lin ωt in ωt e t e t lim b in ωt e t t. in ωt ω e

More information

Chapter #3 EEE Subsea Control and Communication Systems

Chapter #3 EEE Subsea Control and Communication Systems EEE 87 Chter #3 EEE 87 Sube Cotrol d Commuictio Sytem Cloed loo ytem Stedy tte error PID cotrol Other cotroller Chter 3 /3 EEE 87 Itroductio The geerl form for CL ytem: C R ', where ' c ' H or Oe Loo (OL)

More information

Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets

Critical Percolation Probabilities for the Next-Nearest-Neighboring Site Problems on Sierpinski Carpets Critial Perolation Probabilitie for the Next-Nearet-Neighboring Site Problem on Sierpinki Carpet H. B. Nie, B. M. Yu Department of Phyi, Huazhong Univerity of Siene and Tehnology, Wuhan 430074, China K.

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

Bisimulation, Games & Hennessy Milner logic

Bisimulation, 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 information

Calculate the efficiency associated with one rotation of the axle

Calculate the efficiency associated with one rotation of the axle We cn clculte the efficiency of one rottion of the xle by exining the work one. k Mx Your Rie: Workheet hi ctivity will tke you through the tep neee to optiize the work ue in your ouetrp cr. ollow thi

More information

2.0 ANALYTICAL MODELS OF THERMAL EXCHANGES IN THE PYRANOMETER

2.0 ANALYTICAL MODELS OF THERMAL EXCHANGES IN THE PYRANOMETER 2.0 ANAYTICA MODE OF THERMA EXCHANGE IN THE PYRANOMETER In Chapter 1, it wa etablihe that a better unertaning of the thermal exchange within the intrument i neceary to efine the quantitie proucing an offet.

More information

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata

CS103B Handout 18 Winter 2007 February 28, 2007 Finite Automata CS103B ndout 18 Winter 2007 Ferury 28, 2007 Finite Automt Initil text y Mggie Johnson. Introduction Severl childrens gmes fit the following description: Pieces re set up on plying ord; dice re thrown or

More information