Fluent Merging: A General Technique to Improve Reachability Heuristics and Factored Planning
|
|
- Lambert Briggs
- 8 years ago
- Views:
Transcription
1 Fluent Merging: A Generl Tehnique to Improve Rehility Heuristis n Ftore Plnning Menkes vn en Briel Deprtment of Inustril Engineering Arizon Stte University Tempe AZ, menkes@su.eu Suro Kmhmpti Deprtment of Computer Siene Arizon Stte University Tempe AZ, ro@su.eu Thoms Vossen Lees Shool of Business University of Coloro t Bouler Bouler CO, vossen@oloro.eu Astrt Fluent merging is the proess of omining two or more fluents (stte vriles) into single super fluent. By ompiling in some of the inter-fluent intertions, fluent merging n (1) help improve informeness of relxe rehility heuristis, n (2) improve the effiieny of ftore plnning s it removes some of the intervrile epenenies. Although some speil ses of fluent merging hve een roun (uner other nmes), the tehnique in its full generlity hs not een exploite or nlyze. In this pper, we isuss the generl motivtions for n treoffs in fluent merging. We will rgue tht existing tehniques re too onservtive in ientifying mergele fluents. We will then provie some novel tehniques se on usl grph nlysis for ientifying mergele fluents. Introution In this pper we esrie fluent merging, the proess of omining two or more stte vriles into single super stte vrile. Fluent merging, when one juiiously, n le to etter heuristi estimtes n more effetive ftore plnning. Let us strt with n informl exmple to illustrte the ie of fluent merging (we shll formlize this lter). In simple Logistis prolem instne with one truk, one pkge, n two lotions, we my omine the fluents t(truk1, lo1) n t(truk1, lo2), whih tke vlues from {T, F }, into super-fluent. This new fluent tkes vlues from {T, F } {T, F }. On the fe of it, fluent merging seems like rther quixoti ie s it runs ounter to the onventionl wisom tht it is vntgeous to represent n reson with omins in terms of iniviul fluents (the so lle ftore representtions ). After ll, the strtegy of merging fluents n, in the extreme, le us to non-ftore representtion where single super-fluent hs n exponentil omin size, with eh omin vlue orresponing to eh of the sttes in the omin. The reson merging wins up eing useful in some ses is tht if we merge fluents tht hve strong epenenies, then their effetive omin n e muh Copyright 2007, Assoition for the Avnement of Artifiil Intelligene ( All rights reserve. smller thn the Crtesin prout of the iniviul vrile omins. In the logistis exmple ove, the merging proess n explite the ft tht only the vlues (T, F) n (F, T) re rehle for the merge fluent. Thus it removes the vlue omintions (T, T) n (F, F) from onsiertion. The ensuing omin reution s well s the ompiltion of negtive intertions turns out to e quite useful, s we shll see elow. Notie tht when we merge fluents, we nturlly win up with super-fluents tht re multi-vlue (even if we strte with oolen fluents). The populr ie of onverting omin from oolen to multi-vlue representtion, s esrie y (Eelkmp & Helmert 1999; Fox & Long 1998; Gerevini & Shuert 2000; Helmert 2006) n thus e seen s just speil se of fluent merging. Speifilly these methos fous on merging fluents tht hve strit mutul exlusion reltionships. Fluent merging oes not however hve to e onfine to fluents with strit mutul exlusions. We shll see tht merging fluents with strong inter-usl epenenies n lso e vntgeous. The most importnt spet of fluent merging is tht it ompiles-in some of the negtive intertions etween the fluents. This is illustrte well in the logistis exmple ove. The negtive intertion etween t(truk1, lo1) = T n t(truk1, lo2) = T is effetively remove y the ft tht the merge fluent oesn t hve {T, T } in its omin. This hs signifint impt on two moern ies for speeing up plnning: 1 Relxe rehility heuristis whih o rehility nlysis y ignoring negtive intertions n o more informe jo of istne estimtion fter fluent merging (sine some of the negtive intertions hve lrey een ompile-in). Ftore plnning tehniques tht ttempt to fin plns for iniviul fluents n omine them n enefit if fluents with epenenies re merge up front (sine this mens tht the merging phse will 1 While we fous on the ompiltion of negtive intertions, it is worth noting tht the erlier work y Eelkmp et. l. (Eelkmp & Helmert 1999) motivtes fluent merging from the perspetive of minimizing stte enoing length.
2 likely hve fewer ktrks). Both these vntges hve een mply, if iniretly, estlishe in the plnning literture. Prt of the reson for the improve performne of Fst-Downwr plnner (Helmert 2006) n e ttriute to the ft tht it oes fluent merging (in onverting oolen fluent omin esription into multi-vlue fluent esription). Our own reent work (vn en Briel et l. 2007) shows tht this type of informeness vntge lso hols for more generl forms of fluent merging. The vntge of fluent merging for ftore plnning is estlishe y our work (vn en Briel, Vossen, & Kmhmpti 2005) whih shows tht multi-vlue representtions n le to signifint performne improvements. While the foregoing pints mostly positive piture of fluent merging, s exhorte t the outset, fluent merging n only e goo in senrios where the originl omin esription ontins signifint numer of strongly epenent fluents. Speifilly, while merging reues the numer of fluents, it inreses their omin sizes. The ltter inrese n e exponentil in the numer of vriles merge. This worst se ours when the merge vriles re ompletely inepenent. However, the inrese n e offset with omin reution if the vriles re strongly epenent. 2 The prolem with existing fluent merging methos however is not so muh tht they on t le to omputtionl vntges, ut rther tht they re too onservtive. In prtiulr, the mutul-exlusion se multivlue moels foun y (Eelkmp & Helmert 1999; Helmert 2006) onsier merging fluents only when the effetive omin size goes from exponentil to liner. Speifilly, they will merge m oolen fluents tht form mutex lique into single multi-vlue vrile with m vlues (whih is reution of omin size from 2 m to m). While these merging strtegies will give onsierle omputtionl vntges when they re pplile, they re too onservtive n re often not pplile. Speifilly, we my hve sets of oolen fluents tht hve strong epenenies n yet o not quite form mutex lique. Fining n merging suh sets of fluents oul still e quite useful. The omin reution in suh ses my only e from 2 m to m k (for some smll k) inste of m n yet it is impressive nonetheless. For exmple, our reent work (vn en Briel et l. 2007) shows tht more ggressive merging n improve heuristi informeness. The hllenge of ourse is to ome up with pprohes tht n ientify suh fluent sets utomtilly. 2 It is even possile to hve omins where merging ll the fluents n still e goo ie. Consier the extreme exmple with n toms, two legl sttes (T,..., T) n (F,..., F), one tion tht toggles ll vriles from T to F, n one tion tht toggles ll vriles from F to T. In this se, we re etter off merging ll fluents into single superfluent tht esries the omplete rehle stte spe of the prolem. In the reminer of the pper, we provie some first steps towrs formlly efining the fluent merging prolem n eveloping methos tht re more ggressive in ientifying mergele fluents. Towrs the ltter, we esrie some tehniques se on novel nlysis of the usl grph. In wy, our work n e seen s n pplie pproh to the work on ftore plnning y Brfmn n Domshlk This pper is orgnize s follows. First, we provie some kgroun n efine the proess of fluent merging more formlly. Seon, we isuss the potentil use of fluent merging in improving heuristi estimtes n ftore plnning. Some onlusions re given t the en. Fluent Merging We ssume tht we re given SAS+ plnning tsk Π = C, A, s 0, s, whih llows oth oolen n multi-vlue stte esriptions, where: C = { 1,..., n } is finite set of stte vriles, where eh stte vrile C hs n ssoite omin V n n impliitly efine extene omin V + = V {u}, where u enotes the unefine vlue. For eh stte vrile C, s[] enotes the vlue of in stte s. The vlue of is si to e efine in stte s if n only if s[] u. The totl stte spe S = V 1... V n n the prtil stte spe S + = V V + n re impliitly efine. A is finite set of tions of the form pre, post, prev, where pre enotes the pre-onitions, post enotes the post-onitions, n prev enotes the previlonitions. For eh tion A, pre[], post[] n prev[] enotes the respetive onitions on stte vrile. The following two restritions re impose on ll tions: (1) One the vlue of stte vrile is efine, it n never eome unefine. Hene, for ll C, if pre[] u then pre[] post[] u; (2) A previl- n post-onition of n tion n never efine vlue on the sme stte vrile. Hene, for ll C, either post[] = u or prev[] = u or oth. We use A E to enote the tions tht hve n effet in stte vrile, n A V to enote the tions tht hve previl onition in. s 0 S enotes the initil stte n s S + enotes the gol stte. We sy tht stte s is stisfie y stte t if n only if for ll C we hve s[] = u or s[] = t[]. This implies tht if s [] = u for stte vrile, then ny efine vlue f V stisfies the gol for. Two importnt onstruts tht we use re the solle omin trnsition grph n usl grph. The omin trnsition grph DTG = (V, E ) of stte vrile is lele irete grph with noes for eh vlue f V. DTG ontins lele r (f, g) E if n only if there exists n tion with pre[] = f n post[] = g or pre[] = u n post[] = g. Eh r is lele y the set of tions with orresponing pre-
3 n post-onitions. For eh r (f 1, f 2 ) with lel in DTG we sy tht there is trnsition from f 1 to f 2 n tht tion hs n effet in. The usl grph CG Π = (V, E) of plnning tsk Π is irete grph with noes for eh stte vrile C. CG ontins n r ( 1, 2 ) E if n only if there exists n tion tht hs previl onition or preonition in 1 n n effet in 2. We efine fluent merging s the omposition of two or more stte vriles s follows. The term omposition is lso use in moel heking to efine the prllel omposition of utomt (Cssnrs & Lfortune 1999). Definition (Composition) Given the omin trnsition grph of two stte vriles 1, 2, the omposition of DTG 1 n DTG 2 is the omin trnsition grph DTG 1 2 = (V 1 2, E 1 2 ) where V 1 2 = V 1 V 2 ((f 1, f 2 ), (g 1, g 2 )) E 1 2 if f 1, g 1 V 1, f 2, g 2 V 2 n there exists n tion A suh tht one of the following onitions hol. pre[ 1 ] = f 1, post[ 1 ] = g 1, n pre[ 2 ] = f 2, post[ 2 ] = g 2 pre[ 1 ] = f 1, post[ 1 ] = g 1, n prev[ 2 ] = f 2, f 2 = g 2 pre[ 1 ] = f 1, post[ 1 ] = g 1, n f 2 = g 2 We sy tht DTG 1 2 is the ompose omin trnsition grph of DTG 1 n DTG 2. Exmple Consier the set of tions A = {,,, } n the set of stte vriles C = { 1, 2 } whose omin trnsition grphs hve V 1 = {f 1, f 2, f 3 }, V 2 = {g 1, g 2 } s the possile vlues, n E 1 = {(f 1, f 3 ), (f 3, f 2 ), (f 2, f 1 )}, E 2 = {(g 1, g 2 ), (g 2, g 1 )} s the possile trnsitions s shown in Figure 1. Merging stte vriles 1 n 2 retes new stte vrile whose omin is efine y the Crtesin prout V 1 V 2 s shown in Figure 1. Note tht some vlue omintions eome isonnete omponents, suh s (f 3, g 2 ). These isonnete omponents re unrehle from the initil stte n thus n sfely e ignore. Also, note tht some tions generte multiple instnes in the omposition, suh s tions n. These multiple instnes re generte if n tion hs n effet in one fluent, ut no effet or previl onition in the other fluent 3. The omposition of more thn two stte vriles n e otine y reting omposition over one or more ompose omin trnsition grphs. For exmple, DTG n e otine y reting the omposition etween DTG 1 2 n DTG 3. 3 As we shll see lter, one onsiertion in piking effetive merging strtegies is to ensure tht they on t inrese the numer of tions too muh. Ientifying Mergele Fluents Previously, mergele fluents hve een ientifie y looking t the oolen fluents tht form mutex lique. These type of fluent mergings re goo sine they eliminte mny unrehle vlue omintions. We introue two other wys to ientify mergele fluents se on usl grph nlysis. First, in orer to ientify mergele fluents we look for yles in the usl grph. Cusl yles re unesirle s they esrie two-wy epenenies etween stte vriles. Tht is, hnges in stte vrile 1 will epen on onitions in stte vrile 2, n vie vers. While it is possile tht usl yles involve more thn two stte vriles, we only onsier 2-yles (yles of length two). In prtiulr, we merge two fluents 1 n 2 if they form 2-yle in the usl grph n if the following onition hol. For ll A E 1 we hve (A E 2 A V 2 ) For ll A E 2 we hve (A E 1 A V 1 ) In other wors, for every tion tht hs n effet in stte vrile 1 ( 2 ) we hve tht tion hs n effet or previl onition in stte vrile 2 ( 1 ). The min reson for requiring this itionl onition is to ensure tht the tions o not generte multiple instnes in the omposition. This onition is quite restritive, ut s shown y the next exmple effetive nevertheless. Moreover, vn en Briel et l show tht this type of fluent merging les to improve network flow se rehility heuristis. Exmple Figure 2 shows n exmple of how fluent merging n remove usl 2-yles from the usl grph. The figure on the left shows the usl grph for typil stte esription of Zenotrvel prolem with two irplnes, two pssengers, n ny numer of ities. The stte esription is etermine y six stte vriles: one for eh pssenger Lo(person1) n Lo(person2) with vlues tht enote the lotion of the pssengers, one for eh irplne Lo(irplne1) n Lo(irplne2) with vlues tht enote the lotion of the irplnes, n one for the fuel tnk of eh irplne F uellevel(irplne1) n F uellevel(irplne2). The figure on the right shows the usl grph of the sme prolem, ut is se on stte esription in whih the stte vriles Lo(irplne1) n F uellevel(irplne1), n Lo(irplne2) n F uellevel(irplne2) hve een merge into super stte vriles. The vntgeous of the resulting stte esription shoul e ler. Fewer yles in the usl grph will le to etter hierrhil eompositions, whih oul le to improve plnning performne. Seon, in orer to ientify mergele fluents we look t pirs of toms (f 1, f 2 ) suh tht there exists n tion tht hs f 1 s previl onition n f 2 s elete effet. Speifilly, we look for usl links in the usl grph tht re introue y the tions with previl onition in one fluent n n effet in nother flu-
4 ent. Some hierrhil se plnners n hnle suh uslities quite well n simply inorporte them iretly into the hierrhil struture. For exmple, in the Logitis omin hierrhil plnner my first fin pln for eh pkge, use these plns to impose orere onitions on the truks, n then fin pln for eh truk. However, rehility heuristis tht o not exploit hierrhies my sometimes give poor estimtes even in some very simple plnning tsks. Exmple Figure 3 shows n exmple of how fluent merging n improve heuristi estimtes. The figure onsiers simple Logistis prolem with one truk, one pkge, n two lotions. In the initil stte we hve the truk t 2 (= t(truk1, lo2)) n the pkge t 1 (= t(pkge1, lo1)). Severl known rehility heuristis, inluing FF s relxe pln heuristi (Hoffmnn & Neel 2001), fil to reognize tht the truk nees to rive k to lotion 2 in orer to unlo the pkge. The figure shows the merge tom pirs n their orresponing trnsitions. If FF s relxe pln heuristi onsiers the tom pirs s single toms, it woul hve etete tht it nees to rive to lotion 1 to lo the pkge n then rive k to unlo the pkge. In Proeeings of the 17th Ntionl Conferene on Artifiil Intelligene (AAAI-2000), Helmert, M The Fst Downwr plnning system. Journl of Artifil Intelligene Reserh 26: Hoffmnn, J., n Neel, B The FF plnning system: Fst pln genertion through heuristi serh. Journl of Artifiil Intelligene Reserh 14: vn en Briel, M.; Benton, J.; Kmhmpti, S.; n Vossen, T An LP-se heuristi for optiml plnning. In Proeeings of the Interntionl Conferene of Priniples n Prtie of Constrint Progrmming (CP-2007). (To pper). vn en Briel, M.; Vossen, T.; n Kmhmpti, S Reviving integer progrmming pprohes for AI plnning: A rnh-n-ut frmework. In Proeeings of the Interntionl Conferene on Automte Plnning n Sheuling (ICAPS-2005), Conlusions We esrie the proess of fluent merging n showe how it n help improve rehility heuristis n ftore plnning. While fluent merging hs een roun uner the ie of onverting oolen to multi-vlue representtions, we introue methos tht re more generl in ientifying mergele fluents. Our reent work (vn en Briel et l. 2007) shows tht we n erive more informe heuristis y merging fluents without experiening too muh omputtionl overhe. We elieve, however, tht there my e other wys to ientify mergele fluents, whih either exten or generlize the wys tht we esrie. Referenes Brfmn, R., n Domshlk, C Ftore plnning: How, when, n when not. In Proeeings of the 21st Ntionl Conferene on Artifiil Intelligene (AAAI-2006), Cssnrs, C., n Lfortune, S Introution to Disrete Event Systems. Kluwer Aemi Pulishers. Eelkmp, S., n Helmert, M Exhiiting knowlege in plnning prolems to minimize stte enoing length. In Proeeings of the Europen Conferene on Plnning (ECP-1999), Fox, M., n Long, D The utomti inferene of stte invrints in TIM. Journl of Artifiil Intelligene Reserh 9: Gerevini, A., n Shuert, L. K Disovering stte onstrints in DISCOPLAN: Some new results.
5 f 1,,g 1 f 3,g 2 f 1,g 2 f 1 f 2 g 1 f 3,g 1 f 2,g 1 f 3 g 2 f 2,g 2 DTG 1 DTG 2 DTG 1 2 Figure 1: Two omin trnsition grphs n their omposition. Smll in-rs enote the initil stte of eh stte vrile. Lo(person1) Lo(person2) Lo(person1) Lo(person2) Lo(irplne1) Lo(irplne2) Lo(irplne1) Fuellevel(irplne1) Lo(irplne2) Fuellevel(irplne2) Fuellevel(irplne1) Fuellevel(irplne2) Figure 2: Fluent merging removes usl 2-yles from the usl grph for typil stte esription of the Zenotrvel omin. DTG(Pkge1,Truk1) 1,1 1,2 Unlo(p1,t1,l1) 2,1 2,2 Unlo(p1,t1,l2) Lo(p1,t1,l1) Lo(p1,t1,l2) T,1 T,2 Figure 3: Fluent merging improves heuristi estimtes in the Logistis omin.
Maximum area of polygon
Mimum re of polygon Suppose I give you n stiks. They might e of ifferent lengths, or the sme length, or some the sme s others, et. Now there re lots of polygons you n form with those stiks. Your jo is
More information1 Fractions from an advanced point of view
1 Frtions from n vne point of view We re going to stuy frtions from the viewpoint of moern lger, or strt lger. Our gol is to evelop eeper unerstning of wht n men. One onsequene of our eeper unerstning
More informationThe art of Paperarchitecture (PA). MANUAL
The rt of Pperrhiteture (PA). MANUAL Introution Pperrhiteture (PA) is the rt of reting three-imensionl (3D) ojets out of plin piee of pper or ror. At first, esign is rwn (mnully or printe (using grphil
More informationOn Equivalence Between Network Topologies
On Equivlene Between Network Topologies Tre Ho Deprtment of Eletril Engineering Cliforni Institute of Tehnolog tho@lteh.eu; Mihelle Effros Deprtments of Eletril Engineering Cliforni Institute of Tehnolog
More informationArc-Consistency for Non-Binary Dynamic CSPs
Ar-Consisteny for Non-Binry Dynmi CSPs Christin Bessière LIRMM (UMR C 9928 CNRS / Université Montpellier II) 860, rue de Sint Priest 34090 Montpellier, Frne Emil: essiere@rim.fr Astrt. Constrint stisftion
More informationMATH PLACEMENT REVIEW GUIDE
MATH PLACEMENT REVIEW GUIDE This guie is intene s fous for your review efore tking the plement test. The questions presente here my not e on the plement test. Although si skills lultor is provie for your
More informationGENERAL OPERATING PRINCIPLES
KEYSECUREPC USER MANUAL N.B.: PRIOR TO READING THIS MANUAL, YOU ARE ADVISED TO READ THE FOLLOWING MANUAL: GENERAL OPERATING PRINCIPLES Der Customer, KeySeurePC is n innovtive prout tht uses ptente tehnology:
More informationFormal concept analysis-based class hierarchy design in object-oriented software development
Forml onept nlysis-se lss hierrhy esign in ojet-oriente softwre evelopment Roert Goin 1, Petko Vlthev 2 1 Déprtement informtique, UQAM, C.P. 8888, su. Centre Ville, Montrél (Q), Cn, H3C 3P8 2 DIRO, Université
More informationDiaGen: A Generator for Diagram Editors Based on a Hypergraph Model
DiGen: A Genertor for Digrm Eitors Bse on Hypergrph Moel G. Viehstet M. Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny Emil: fviehste,minsg@informtik.uni-erlngen.e
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More informationVolumes by Cylindrical Shells: the Shell Method
olumes Clinril Shells: the Shell Metho Another metho of fin the volumes of solis of revolution is the shell metho. It n usull fin volumes tht re otherwise iffiult to evlute using the Dis / Wsher metho.
More informationOn the Utilization of Spatial Structures for Cognitively Plausible and Efficient Reasoning
To pper in: Proeeings of the IEEE Interntionl Conferene on Systems, Mn, n Cyernetis. Chigo, 18-21 Otoer 1992. On the Utiliztion of Sptil Strutures for Cognitively Plusile n Effiient Resoning Christin Freks
More informationForensic Engineering Techniques for VLSI CAD Tools
Forensi Engineering Tehniques for VLSI CAD Tools Jennifer L. Wong, Drko Kirovski, Dvi Liu, Miorg Potkonjk UCLA Computer Siene Deprtment University of Cliforni, Los Angeles June 8, 2000 Computtionl Forensi
More informationCHAPTER 31 CAPACITOR
. Given tht Numer of eletron HPTER PITOR Net hrge Q.6 9.6 7 The net potentil ifferene L..6 pitne v 7.6 8 F.. r 5 m. m 8.854 5.4 6.95 5 F... Let the rius of the is R re R D mm m 8.85 r r 8.85 4. 5 m.5 m
More informationEquivalence Checking. Sean Weaver
Equivlene Cheking Sen Wever Equivlene Cheking Given two Boolen funtions, prove whether or not two they re funtionlly equivlent This tlk fouses speifilly on the mehnis of heking the equivlene of pirs of
More informationBypassing Space Explosion in Regular Expression Matching for Network Intrusion Detection and Prevention Systems
Bypssing Spce Explosion in Regulr Expression Mtching for Network Intrusion Detection n Prevention Systems Jignesh Ptel, Alex Liu n Eric Torng Dept. of Computer Science n Engineering Michign Stte University
More informationS-Scrum: a Secure Methodology for Agile Development of Web Services
Worl of Computer Siene n Informtion Tehnology Journl (WCSIT) ISSN: 2221-0741 Vol. 3, No. 1, 15-19, 2013 S-Srum: Seure Methoology for Agile Development of We Servies Dvou Mougouei, Nor Fzli Moh Sni, Mohmm
More informationBoğaziçi University Department of Economics Spring 2016 EC 102 PRINCIPLES of MACROECONOMICS Problem Set 5 Answer Key
Boğziçi University Deprtment of Eonomis Spring 2016 EC 102 PRINCIPLES of MACROECONOMICS Prolem Set 5 Answer Key 1. One yer ountry hs negtive net exports. The next yer it still hs negtive net exports n
More informationLesson 2.1 Inductive Reasoning
Lesson.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 1, 16,,. 400, 00, 100, 0,,,. 1 8, 7, 1, 4,, 4.,,, 1, 1, 0,,. 60, 180, 10,
More informationVectors Summary. Projection vector AC = ( Shortest distance from B to line A C D [OR = where m1. and m
. Slr prout (ot prout): = osθ Vetors Summry Lws of ot prout: (i) = (ii) ( ) = = (iii) = (ngle etween two ientil vetors is egrees) (iv) = n re perpeniulr Applitions: (i) Projetion vetor: B Length of projetion
More informationComputing the 3D Voronoi Diagram Robustly: An Easy Explanation
Computing the 3D Voronoi Digrm Roustly: An Esy Explntion Hugo Leoux Delft University of Tehnology (OTB setion GIS Tehnology) Jffln 9, 2628BX Delft, the Netherlns h.leoux@tuelft.nl Astrt Mny lgorithms exist
More informationReturn of Organization Exempt From Income Tax
PUBLIC DISCLOSURE COPY Form 99 Return of Orgniztion Exempt From Inome Tx Uner setion 51, 527, or 4947(1) of the Internl Revenue Coe (exept privte fountions) OMB 1545-47 Do not enter Soil Seurity numers
More informationREMO: Resource-Aware Application State Monitoring for Large-Scale Distributed Systems
: Resoure-Awre Applition Stte Monitoring for Lrge-Sle Distriuted Systems Shiong Meng Srinivs R. Kshyp Chitr Venktrmni Ling Liu College of Computing, Georgi Institute of Tehnology, Atlnt, GA 332, USA {smeng,
More informationQuick Guide to Lisp Implementation
isp Implementtion Hndout Pge 1 o 10 Quik Guide to isp Implementtion Representtion o si dt strutures isp dt strutures re lled S-epressions. The representtion o n S-epression n e roken into two piees, the
More informationData Quality Certification Program Administrator In-Person Session Homework Workbook 2015-2016
Dt Qulity Certifition Progrm Aministrtor In-Person Session Homework Workook 2015-2016 Plese Note: Version 1.00: Pulishe 9-1-2015 Any exerises tht my e upte fter this printing n e foun online in the DQC
More informationWord Wisdom Correlations to the Common Core State Standards, Grade 6
Reing Stnrs for Informtionl Text Key Ies n Detils 1 Cite textul eviene to support nlysis of wht the text sys expliitly s well s inferenes rwn from the text. 6, 7, 12, 13, 18, 19, 28, 29, 34, 35, 40, 41,
More informationAngles 2.1. Exercise 2.1... Find the size of the lettered angles. Give reasons for your answers. a) b) c) Example
2.1 Angles Reognise lternte n orresponing ngles Key wors prllel lternte orresponing vertilly opposite Rememer, prllel lines re stright lines whih never meet or ross. The rrows show tht the lines re prllel
More informationVisualization of characteristics of the contact network between spheres in 3D assembly
Int. Agrophys., 2013, 27, 275-281 oi: 10.2478/v10247-012-0095-6 INTERNATIONAL Agrophysis www.interntionl-grophysis.org Visuliztion of hrteristis of the ontt network etween spheres in 3D ssemly R. Koy³k*
More informationLesson 1: Getting started
Answer key 0 Lesson 1: Getting strte 1 List the three min wys you enter t in QuikBooks. Forms, lists, registers 2 List three wys to ess fetures in QuikBooks. Menu r, Ion Br, Centers, Home pge 3 Wht ookkeeping
More informationNational Firefighter Ability Tests And the National Firefighter Questionnaire
Ntionl Firefighter Aility Tests An the Ntionl Firefighter Questionnire PREPARATION AND PRACTICE BOOKLET Setion One: Introution There re three tests n questionnire tht mke up the NFA Tests session, these
More information- DAY 1 - Website Design and Project Planning
Wesite Design nd Projet Plnning Ojetive This module provides n overview of the onepts of wesite design nd liner workflow for produing wesite. Prtiipnts will outline the sope of wesite projet, inluding
More informationYou should have the following for this examination a multiple-choice answer sheet a pen with black or blue ink
8575-001 Aess Certifite in English Lnguge Tehing Fountions of English Lnguge Tehing Smple pper 2 You shoul hve the following for this exmintion multiple-hoie nswer sheet pen with lk or lue ink This question
More informationClause Trees: a Tool for Understanding and Implementing Resolution in Automated Reasoning
Cluse Trees: Tool for Understnding nd Implementing Resolution in Automted Resoning J. D. Horton nd Brue Spener University of New Brunswik, Frederiton, New Brunswik, Cnd E3B 5A3 emil : jdh@un. nd spener@un.
More informationWords Symbols Diagram. abcde. a + b + c + d + e
Logi Gtes nd Properties We will e using logil opertions to uild mhines tht n do rithmeti lultions. It s useful to think of these opertions s si omponents tht n e hooked together into omplex networks. To
More informationReturn of Organization Exempt From Income Tax
Form 990 Deprtment of the Tresury Internl Revenue Servie Return of Orgniztion Exempt From Inome Tx Uner setion 501(), 527, or 4947()(1) of the Interni Revenue Coe (exept lk lung enefit trust or privte
More informationcontrol policies to be declared over by associating security
Seure XML Querying with Seurity Views Wenfei Fn University of Edinurgh & Bell Lortories wenfei@infeduk Chee-Yong Chn Ntionl University of Singpore hny@ompnusedusg Minos Groflkis Bell Lortories minos@reserhell-lsom
More informationEQUATIONS OF LINES AND PLANES
EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint
More informationRevised products from the Medicare Learning Network (MLN) ICD-10-CM/PCS Myths and Facts, Fact Sheet, ICN 902143, downloadable.
DEPARTMENT OF HEALTH AND HUMAN SERVICES Centers for Meire & Meii Servies Revise prouts from the Meire Lerning Network (MLN) ICD-10-CM/PCS Myths n Fts, Ft Sheet, ICN 902143, ownlole. MLN Mtters Numer: SE1325
More informationCorrigendum-II Dated:19.05.2011
10(21)/2010-NICSI NATIONAL INFORMATICS CENTRE SERVICES In. (NICSI) (A Government of Ini Enterprise uner NIC) Ministry of Communition & Informtion Tehnology Hll 2 & 3, 6 th Floor, NBCC Tower 15, Bhikiji
More informationOUTLINE SYSTEM-ON-CHIP DESIGN. GETTING STARTED WITH VHDL August 31, 2015 GAJSKI S Y-CHART (1983) TOP-DOWN DESIGN (1)
August 31, 2015 GETTING STARTED WITH VHDL 2 Top-down design VHDL history Min elements of VHDL Entities nd rhitetures Signls nd proesses Dt types Configurtions Simultor sis The testenh onept OUTLINE 3 GAJSKI
More informationParallel-Task Scheduling on Multiple Resources
Parallel-Task Sheuling on Multiple Resoures Mike Holenerski, Reiner J. Bril an Johan J. Lukkien Department of Mathematis an Computer Siene, Tehnishe Universiteit Einhoven Den Doleh 2, 5600 AZ Einhoven,
More information2. Properties of Functions
2. PROPERTIES OF FUNCTIONS 111 2. Properties of Funtions 2.1. Injetions, Surjetions, an Bijetions. Definition 2.1.1. Given f : A B 1. f is one-to-one (short han is 1 1) or injetive if preimages are unique.
More informationHydromagnetic Unsteady Mixed Convection Flow Past an Infinite Vertical Porous Plate
pplie Mthemtis. ; (): 39-45 DO:.593/j.m..5 Hyromgneti Unstey Mixe Convetion Flo Pst n nfinite ertil Porous Plte B.. Shrm T. Chn R. C. Chuhry Deprtment of Mthemtis Birl nstitute of Tehnology & Siene Pilni
More informationModule 5. Three-phase AC Circuits. Version 2 EE IIT, Kharagpur
Module 5 Three-hse A iruits Version EE IIT, Khrgur esson 8 Three-hse Blned Suly Version EE IIT, Khrgur In the module, ontining six lessons (-7), the study of iruits, onsisting of the liner elements resistne,
More informationChapter. Contents: A Constructing decimal numbers
Chpter 9 Deimls Contents: A Construting deiml numers B Representing deiml numers C Deiml urreny D Using numer line E Ordering deimls F Rounding deiml numers G Converting deimls to frtions H Converting
More informationSECTION 7-2 Law of Cosines
516 7 Additionl Topis in Trigonometry h d sin s () tn h h d 50. Surveying. The lyout in the figure t right is used to determine n inessile height h when seline d in plne perpendiulr to h n e estlished
More informationA sufficient statistic approach to disability insurance with application to the United States Social Security Disability Insurance program
Insurne Mrkets n Compnies: Anlyses n Aturil Computtions, Volume, Issue, 202 Henry R. Hytt (USA) A suffiient sttisti pproh to isility insurne with pplition to the Unite Sttes Soil Seurity Disility Insurne
More information50 MATHCOUNTS LECTURES (10) RATIOS, RATES, AND PROPORTIONS
0 MATHCOUNTS LECTURES (0) RATIOS, RATES, AND PROPORTIONS BASIC KNOWLEDGE () RATIOS: Rtios re use to ompre two or more numers For n two numers n ( 0), the rtio is written s : = / Emple : If 4 stuents in
More informationOrthopoles and the Pappus Theorem
Forum Geometriorum Volume 4 (2004) 53 59. FORUM GEOM ISSN 1534-1178 Orthopoles n the Pppus Theorem tul Dixit n Drij Grinerg strt. If the verties of tringle re projete onto given line, the perpeniulrs from
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 information1.2 The Integers and Rational Numbers
.2. THE INTEGERS AND RATIONAL NUMBERS.2 The Integers n Rtionl Numers The elements of the set of integers: consist of three types of numers: Z {..., 5, 4, 3, 2,, 0,, 2, 3, 4, 5,...} I. The (positive) nturl
More information1. Definition, Basic concepts, Types 2. Addition and Subtraction of Matrices 3. Scalar Multiplication 4. Assignment and answer key 5.
. Definition, Bsi onepts, Types. Addition nd Sutrtion of Mtries. Slr Multiplition. Assignment nd nswer key. Mtrix Multiplition. Assignment nd nswer key. Determinnt x x (digonl, minors, properties) summry
More informationBUSINESS PROCESS MODEL TRANSFORMATION ISSUES The top 7 adversaries encountered at defining model transformations
USINESS PROCESS MODEL TRANSFORMATION ISSUES The top 7 dversries enountered t defining model trnsformtions Mrion Murzek Women s Postgrdute College for Internet Tehnologies (WIT), Institute of Softwre Tehnology
More informationOxCORT v4 Quick Guide Revision Class Reports
OxCORT v4 Quik Guie Revision Clss Reports This quik guie is suitble for the following roles: Tutor This quik guie reltes to the following menu options: Crete Revision Clss Reports pg 1 Crete Revision Clss
More informationSOLVING EQUATIONS BY FACTORING
316 (5-60) Chpter 5 Exponents nd Polynomils 5.9 SOLVING EQUATIONS BY FACTORING In this setion The Zero Ftor Property Applitions helpful hint Note tht the zero ftor property is our seond exmple of getting
More informationJCM TRAINING OVERVIEW Multi-Download Module 2
Multi-Downlo Moule 2 JCM Trining Overview Mrh, 2012 Mrh, 2012 CLOSING THE MDM2 APPLICATION To lose the MDM2 Applition proee s follows: 1. Mouse-lik on the 'File' pullown Menu (See Figure 35 ) on the MDM2
More informationTowards Zero-Overhead Static and Adaptive Indexing in Hadoop
Nonme mnusript No. (will e inserted y the editor) Towrds Zero-Overhed Stti nd Adptive Indexing in Hdoop Stefn Rihter Jorge-Arnulfo Quiné-Ruiz Stefn Shuh Jens Dittrih the dte of reeipt nd eptne should e
More informationUnit 5 Section 1. Mortgage Payment Methods & Products (20%)
Unit 5 Setion 1 Mortgge Pyment Methos & Prouts (20%) There re tully only 2 mortgge repyment methos ville CAPITAL REPAYMENT n INTEREST ONLY. Cpitl Repyment Mortgge Also lle Cpitl & Interest mortgge or repyment
More informationPLWAP Sequential Mining: Open Source Code
PL Sequentil Mining: Open Soure Code C.I. Ezeife Shool of Computer Siene University of Windsor Windsor, Ontrio N9B 3P4 ezeife@uwindsor. Yi Lu Deprtment of Computer Siene Wyne Stte University Detroit, Mihign
More informationRotating DC Motors Part II
Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors
More information2. Use of Internet attacks in terrorist activities is termed as a. Internet-attack b. National attack c. Cyberterrorism d.
Moule2.txt 1. Choose the right ourse of tion one you feel your mil ount is ompromise?. Delete the ount b. Logout n never open gin. Do nothing, sine no importnt messge is there. Chnge psswor immeitely n
More informationForeign Debt and The Gold Standard: Comparing Russian and Japanese Experience in Late XIX Century Ivan Medovikov
Foreign Det n The Gol Stnr: Compring Russin n Jpnese Experiene in Lte XIX Century Ivn Meovikov Astrt The following work will exmine risk premiums on government et issue y Russin n Jpnese governments in
More informationREVIEW OF THE EMPLOYMENT RELATIONS ACT 2000: PART 9 PERSONAL GRIEVANCES
REVIEW OF THE EMPLOYMENT RELATIONS ACT 2000: PART 9 PERSONAL GRIEVANCES Summry of sumissions April 2010 TABLE OF CONTENTS Exeutive Summry 3 Introution 6 Sumitter involvement in personl grievnes 9 Prt C:
More informationGood practice in prescribing and managing medicines and devices
You n fin the ltest version of this guine on our wesite t www.gm-uk.org/guine. Referenes to Goo meil prtie upte in Mrh 2013 Goo prtie in presriing n mnging meiines n evies 1 In Goo meil prtie (2013) 1
More informationTheoretical and Computational Properties of Preference-based Argumentation
Theoretil nd Computtionl Properties of Preferene-sed Argumenttion Ynnis Dimopoulos 1 nd Pvlos Moritis 2 nd Leil Amgoud 3 Astrt. During the lst yers, rgumenttion hs een gining inresing interest in modeling
More informationc b 5.00 10 5 N/m 2 (0.120 m 3 0.200 m 3 ), = 4.00 10 4 J. W total = W a b + W b c 2.00
Chter 19, exmle rolems: (19.06) A gs undergoes two roesses. First: onstnt volume @ 0.200 m 3, isohori. Pressure inreses from 2.00 10 5 P to 5.00 10 5 P. Seond: Constnt ressure @ 5.00 10 5 P, isori. olume
More informationCARROLL COLLEGE. Reference Guide for Sophomores and Juniors
CARROLL COLLEGE M O N T A N A Referene Guie for Sophomores n Juniors CHOOSING THE RIGHT COLLEGE College Plnning Cheklist A Few Questions to Ask Yourself SOPHOMORE YEAR Tke n pln hllenging high shool ourses.
More informationUNCORRECTED SAMPLE PAGES
6 Chpter Length, re, surfe re n volume Wht you will lern 6A Length n perimeter 6B Cirumferene of irles n perimeter of setors 6C Are of qurilterls n tringles 6D Are of irles 6E Perimeter n re of omposite
More informationWHAT HAPPENS WHEN YOU MIX COMPLEX NUMBERS WITH PRIME NUMBERS?
WHAT HAPPES WHE YOU MIX COMPLEX UMBERS WITH PRIME UMBERS? There s n ol syng, you n t pples n ornges. Mthemtns hte n t; they love to throw pples n ornges nto foo proessor n see wht hppens. Sometmes they
More informationHow To Balance Power In A Distribution System
NTERNATONA JOURNA OF ENERG, ssue 3, ol., 7 A dynmilly S bsed ompt ontrol lgorithm for lod blning in distribution systems A. Kzemi, A. Mordi Koohi nd R. Rezeipour Abstrt An lgorithm for pplying fixed pitor-thyristorontrolled
More informationSE3BB4: Software Design III Concurrent System Design. Sample Solutions to Assignment 1
SE3BB4: Softwre Design III Conurrent System Design Winter 2011 Smple Solutions to Assignment 1 Eh question is worth 10pts. Totl of this ssignment is 70pts. Eh ssignment is worth 9%. If you think your solution
More informationPUBLIC-TRANSIT VEHICLE SCHEDULES USING A MINIMUM CREW-COST APPROACH
TOTAL LOGISTIC MANAGEMENT No. PP. Avishi CEDER PUBLIC-TRANSIT VEHICLE SCHEDULES USING A MINIMUM CREW-COST APPROACH Astrt: Commonly, puli trnsit genies, with view towrd effiieny, im t minimizing the numer
More informationCalculating Principal Strains using a Rectangular Strain Gage Rosette
Clulting Prinipl Strins using Retngulr Strin Gge Rosette Strin gge rosettes re used often in engineering prtie to determine strin sttes t speifi points on struture. Figure illustrtes three ommonly used
More informationThe remaining two sides of the right triangle are called the legs of the right triangle.
10 MODULE 6. RADICAL EXPRESSIONS 6 Pythgoren Theorem The Pythgoren Theorem An ngle tht mesures 90 degrees is lled right ngle. If one of the ngles of tringle is right ngle, then the tringle is lled right
More informationRegular Sets and Expressions
Regulr Sets nd Expressions Finite utomt re importnt in science, mthemtics, nd engineering. Engineers like them ecuse they re super models for circuits (And, since the dvent of VLSI systems sometimes finite
More informationPLANNING FOR COASTLINE CHANGE
COSALC COAST AND BEACH STABILITY IN THE CARIBBEAN ISLANDS PLANNING FOR COASTLINE CHANGE 1 COASTAL DEVELOPMENT SETBACK GUIDELINES IN ANTIGUA AND BARBUDA y Dr. Gillin Cmers. June, 1998. Environment n Development
More informationFAULT TREES AND RELIABILITY BLOCK DIAGRAMS. Harry G. Kwatny. Department of Mechanical Engineering & Mechanics Drexel University
SYSTEM FAULT AND Hrry G. Kwtny Deprtment of Mechnicl Engineering & Mechnics Drexel University OUTLINE SYSTEM RBD Definition RBDs nd Fult Trees System Structure Structure Functions Pths nd Cutsets Reliility
More information1 GSW IPv4 Addressing
1 For s long s I ve een working with the Internet protools, people hve een sying tht IPv6 will e repling IPv4 in ouple of yers time. While this remins true, it s worth knowing out IPv4 ddresses. Even when
More informationEuropean Convention on Products Liability in regard to Personal Injury and Death
Europen Trety Series - No. 91 Europen Convention on Produts Liility in regrd to Personl Injury nd Deth Strsourg, 27.I.1977 The memer Sttes of the Counil of Europe, signtory hereto, Considering tht the
More informationAppendix D: Completing the Square and the Quadratic Formula. In Appendix A, two special cases of expanding brackets were considered:
Appendi D: Completing the Squre nd the Qudrtic Formul Fctoring qudrtic epressions such s: + 6 + 8 ws one of the topics introduced in Appendi C. Fctoring qudrtic epressions is useful skill tht cn help you
More informationLearning Subregular Classes of Languages with Factored Deterministic Automata
Lerning Suregulr Clsses of Lnguges with Ftored Deterministi Automt Jeffrey Heinz Dept. of Linguistis nd Cognitive Siene University of Delwre heinz@udel.edu Jmes Rogers Dept. of Computer Siene Erlhm College
More informationDATABASDESIGN FÖR INGENJÖRER - 1056F
DATABASDESIGN FÖR INGENJÖRER - 06F Sommr 00 En introuktionskurs i tssystem http://user.it.uu.se/~ul/t-sommr0/ lt. http://www.it.uu.se/eu/course/homepge/esign/st0/ Kjell Orsorn (Rusln Fomkin) Uppsl Dtse
More informationConcept Formation Using Graph Grammars
Concept Formtion Using Grph Grmmrs Istvn Jonyer, Lwrence B. Holder nd Dine J. Cook Deprtment of Computer Science nd Engineering University of Texs t Arlington Box 19015 (416 Ytes St.), Arlington, TX 76019-0015
More information2 DIODE CLIPPING and CLAMPING CIRCUITS
2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of
More informationUNIVERSITY AND WORK-STUDY EMPLOYERS WEBSITE USER S GUIDE
UNIVERSITY AND WORK-STUDY EMPLOYERS WEBSITE USER S GUIDE Tble of Contents 1 Home Pge 1 2 Pge 2 3 Your Control Pnel 3 4 Add New Job (Three-Step Form) 4-6 5 Mnging Job Postings (Mnge Job Pge) 7-8 6 Additionl
More informationSECURITY ISSUES IN THE OPTIMIZED LINK STATE ROUTING PROTOCOL VERSION 2 (OLSRV2)
SECURITY ISSUES IN THE OPTIMIZED LINK STATE ROUTING PROTOCOL VERSION 2 (OLSRV2) Ulrih Hererg n Thoms Clusen Hiperom@LI, Eole Polytehnique, Frne ulrih@hererg.nme, thoms@thomslusen.org ABSTRACT Moile A ho
More informationA Language-Neutral Representation of Temporal Information
A Lnguge-Neutrl Representtion of Temporl Informtion Rihrd Cmpell*, Tkko Aikw, Zixin Jing, Crmen Lozno, Mite Melero nd Andi Wu Mirosoft Reserh One Mirosoft Wy, Redmond, WA 98052 USA {rihmp, tkko, jingz,
More informationSmall Businesses Decisions to Offer Health Insurance to Employees
Smll Businesses Decisions to Offer Helth Insurnce to Employees Ctherine McLughlin nd Adm Swinurn, June 2014 Employer-sponsored helth insurnce (ESI) is the dominnt source of coverge for nonelderly dults
More informationOrthodontic marketing through social media networks: The patient and practitioner s perspective
Originl rtile Orthodonti mrketing through soil medi networks: The ptient nd prtitioner s perspetive Kristin L. Nelson ; Bhvn Shroff ; l M. Best ; Steven J. Linduer d BSTRCT Ojetive: To (1) ssess orthodonti
More informationGenerating In-Line Monitors For Rabin Automata
Generting In-Line Monitors For Rin Automt Hugues Chot, Rphel Khoury, nd Ndi Twi Lvl University, Deprtment of Computer Science nd Softwre Engineering, Pvillon Adrien-Pouliot, 1065, venue de l Medecine Queec
More informationInnovation in Software Development Process by Introducing Toyota Production System
Innovtion in Softwre Development Proess y Introduing Toyot Prodution System V Koihi Furugki V Tooru Tkgi V Akinori Skt V Disuke Okym (Mnusript reeived June 1, 2006) Fujitsu Softwre Tehnologies (formerly
More informationMulti-level Visualization of Concurrent and Distributed Computation in Erlang
Multi-level Visuliztion of Conurrent nd Distriuted Computtion in Erlng Roert Bker r440@kent..uk Peter Rodgers P.J.Rodgers@kent..uk Simon Thompson S.J.Thompson@kent..uk Huiqing Li H.Li@kent..uk Astrt This
More informationProviding Protection in Multi-Hop Wireless Networks
Technicl Report, My 03 Proviing Protection in Multi-Hop Wirele Network Greg Kupermn MIT LIDS Cmrige, MA 039 gregk@mit.eu Eytn Moino MIT LIDS Cmrige, MA 039 moino@mit.eu Atrct We conier the prolem of proviing
More informationLearn to Recognize Sptil Structure Through Compre Recognition
Stroke-Bse Performnce Metrics for Hnwritten Mthemticl Expressions Richr Znii rlz@cs.rit.eu Amit Pilly p2731@rit.eu eprtment of Computer Science Rochester Institute of Technology, NY, SA Hrol Mouchère hrol.mouchere@univ-nntes.fr
More informationInterior and exterior angles add up to 180. Level 5 exterior angle
22 ngles n proof Ientify interior n exterior ngles in tringles n qurilterls lulte interior n exterior ngles of tringles n qurilterls Unerstn the ie of proof Reognise the ifferene etween onventions, efinitions
More informationGAO POSTSECONDARY EDUCATION. Student Outcomes Vary at For-Profit, Nonprofit, and Public Schools. Report to Congressional Requesters
GAO United Sttes Government Aountbility Offie Report to Congressionl Requesters Deember 2011 POSTSECONDARY EDUCATION Outomes Vry t For-Profit, Nonprofit, nd Publi Shools GAO-12-143 Contents Letter 1 Limited
More informationOne Minute To Learn Programming: Finite Automata
Gret Theoreticl Ides In Computer Science Steven Rudich CS 15-251 Spring 2005 Lecture 9 Fe 8 2005 Crnegie Mellon University One Minute To Lern Progrmming: Finite Automt Let me tech you progrmming lnguge
More informationBayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom
Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the
More informationRatio and Proportion
Rtio nd Proportion Rtio: The onept of rtio ours frequently nd in wide vriety of wys For exmple: A newspper reports tht the rtio of Repulins to Demorts on ertin Congressionl ommittee is 3 to The student/fulty
More informationp-q Theory Power Components Calculations
ISIE 23 - IEEE Interntionl Symposium on Industril Eletronis Rio de Jneiro, Brsil, 9-11 Junho de 23, ISBN: -783-7912-8 p-q Theory Power Components Clultions João L. Afonso, Memer, IEEE, M. J. Sepúlved Freits,
More information