Solving the Class Diagram Restructuring Transformation Case with FunnyQT
|
|
- Silas Neal
- 5 years ago
- Views:
Transcription
1 olving the lss Digrm Restruturing Trnsformtion se with FunnyQT Tssilo Horn Institute for oftwre Tehnology, University Kolenz-Lnu, Germny FunnyQT is moel querying n moel trnsformtion lirry for the funtionl Lisp-ilet lojure proviing rih n effiient querying n trnsformtion PI. This pper esries the FunnyQT solution to the TT 2013 lss Digrm Restruturing Trnsformtion se. This solution n the GROOVE solution shre the est overll solution wr for this se. 1 Introution FunnyQT is new moel querying n trnsformtion pproh whih is implemente s n PI for the funtionl, JVM-se Lisp-ilet lojure. It provies severl su-pis for implementing ifferent kins of queries n trnsformtions. For exmple, there is moel-to-moel trnsformtion PI, n there is n in-ple trnsformtion PI for writing progrmme grph trnsformtions. FunnyQT urrently supports EMF n JGrL moels, n it n e extene to other moeling frmeworks, too. For solving the tsks of this trnsformtion se 1, only FunnyQT s plin querying n moel mnipultion PIs hve een use, n the tsk is tkle lgorithmilly. 2 The ore Tsk The ore tsk s solution onsists of some helper funtions, funtion for fining sets of pullle properties n sorting them heuristilly in orer to hieve effetive results, the rules epite in the se esription [1], n funtion pplying the rules in orer to relize the trnsformtion. This setion strts with the helpers, then explins the funtion fining pullle properties, n then isusses the restruturing rules. The omplete soure oe is printe in ppenix. Helper Funtions. The helper funtions isusse in this setion re quite simple n ftor out funtionlity tht is use t severl ples in the rules. There re severl very simple helpers tht re not expline in etil. -prop! s new Property with some given nme n Type to some given Entity. elete-prop! eletes the property ientifie y given nme from given entity. The pull-up funtion gets list of [prop-nme type] tuples, set of soure entities, n trget entity. It then s new properties to the trget entity n eletes them from the soure entities. Lstly, there s mke-generliztion! whih retes new Generliztion etween su- n its super-entity, n there s mke-entity! tht retes new Entity. 1 This FunnyQT solution is ville t n on HRE (imge TT13::Uuntu12LT_TT13::FunnyQT.vi) Pieter Vn Gorp, Louis M. Rose, hristin Kruse (Es.): ixth Trnsformtion Tool ontest (TT 2013) EPT 135, 2013, pp , oi: /ept.135.9
2 76 olving the lss Digrm Restruturing Trnsformtion se with FunnyQT The funtion prop-type-set gets n Entity e n returns its set of [prop-nme type] tuples, i.e., there s one suh tuple for ny owne ttriute of e. 1 (efn prop-type-set [e] 2 (set (mp (fn [p] [(eget p :nme) (eget p :type)]) 3 (eget e :ownettriute)))) The filter-y-properties funtion gets olletion of [prop-nme type] tuples vi its pnts prmeter, n olletion of entities vi its entities prmeter. It returns the suset of entities for whih every entity efines ll of the given properties with ientil types. 1 (efn filter-y-properties [pnts entities] 2 (set (filter (fn [e] (forll? #(memer? % (prop-type-set e)) pnts)) 3 entities))) Restruturing Heuristis. This solution oesn t pull up one ttriute t time, ut inste it pulls up the mximl set of properties tht re shre y mximum of entities. I.e., the heuristis n e speifie s follows. Let P 1 n P 2 e sets of properties shre y the sets of entities E 1 n E 2, respetively. 1. If E 1 > E 2, then the solution pulls up the properties of P 1 inste of the properties of P 2. (Mximlity wrt. the numer of entities elring these properties) { 1 if P1 P 2. If E 1 = E 2, then the solution pulls up the properties of P i where i = 2. 2 otherwise (Mximlity wrt. the numer of pullle properties.) D N1 N2 D Mximl numer of elring entities N1 D N1 Mximl numer of pullle properties N1 Figure 1: Exmples for the heuristis Figure 1 illustrtes these heuristis with two exmples. In the left exmple, the property is shre y three lsses, wheres n re shre y only 2 lsses eh. If the trnsformtion pulls up first into new lss, n e pulle up only from n D into nother new lss. The numer of property elrtion ereses from 8 to 6, n remin uplite one, n 2 new lsses hve een rete. If the trnsformtion uses the first heuristi, it pulls up first euse tht s ommon to more lsses thn n. This lso results in 6 remining property elrtions, n remin uplite one, ut only one new lss hs een rete. In the right exmple, the set of properties {, } n {} re shre y two lsses oth. If the trnsformtion eies to pull up, the numer of property elrtions ereses from 7 to 6, n remin uplite one, n one new lss hs een rete. If the trnsformtion uses the seon heuristi, it pulls up n, n the numer of property elrtions ereses from 7 to 5, only remins uplite one, n gin one new lss hs een rete. The ommon-props funtion fins sets of pullle properties n sorts them oring to the heuristis. It is y fr the most omplex funtion of the trnsformtion. The funtion reeives set of entities vi its lsses prmeter n returns the properties ommon to mximl suset of these entities.
3 Tssilo Horn 77 1 (efn ommon-props [lsses] 2 (let [pes (set (mp (fn [pnt] [pnt (filter-y-properties [pnt] lsses)]) 3 (set (mpt prop-type-set lsses)))) 4 freq-mp (pply hsh-mp 5 (mpt (fn [[_ ents]] [ents (ount (filter #(= ents (seon %)) 6 pes))]) 7 pes)) 8 ollpse (fn ollpse [es] 9 (when-let [[pnt entities] (first es)] 10 (let [[s r] (split-with (fn [[_ ents]] (= entities ents)) es)] 11 (ons [(mp first s) entities] 12 (lzy-seq (ollpse r))))))] 13 (ollpse (into (sorte-set-y 14 (fn [[_ es :s ] [_ es :s ]] 15 (let [x (- (ount es) (ount es))] 16 (if (zero? x) 17 (let [x (- (freq-mp es) (freq-mp es))] 18 (if (zero? x) (ompre ) x)) 19 x)))) 20 pes)))) In line 2, pes is oun to set of tuples [pnt entity-set], where pnt is [prop-nme type] tuple n entity-set is the set of ll entities elring suh property. Tht is, pes hs the following form 2. #{[[pn1 t1] #{e1 e2 e3}] [[pn2 t2] #{e2 e3 e4 e5}] [[pn4 t2] #{e2 e3 e4}] [[pn3 t2] #{e1 e2 e3}]} In line 4, freq-mp is oun to hsh-mp tht mps to eh set of entities ouring in the items of pes the numer of ourenes in there. This mp is use to implement the seon heuristi. In line 8, lol funtion ollpse is efine. efore explining tht, first lines 13 to 22 re to e expline. Wht s one there is tht the entries of the set pes re put into sorte set. The sorting orer is etermine y the omprtor funtion efine in lines 14 to 21. It reeives two items of the pes set, ins their entity-sets to es n es, respetively, n then performs these heks: 1. If es ontins more entities thn es, shoul e sorte efore. This implements heuristi Else, if the entity set es ours more often in the items of pes, shoul e sorte efore. This implements heuristi Else, the sorting orer is not importnt n etermine y lojure s stnr ompre funtion tht proues stle orering upon ll ojets implementing omprle. s result, the sorte set hs the following struture, i.e., items with lrger entity sets re sorte efore items with smller entity sets. The item with pn2 is sorte efore the others euse it is shre y 4 entities. #{[[pn2 t2] #{e2 e3 e4 e5}] [[pn3 t2] #{e1 e2 e3}] [[pn1 t1] #{e1 e2 e3}] [[pn4 t2] #{e2 e3 e4}]} In se of eqully lrge entity sets, the numer of ourenes of the entity sets etermines the sorting orer, e.g., the items with pn1 n pn2 re sorte efore the item with pn4, euse their entity sets our twie wheres the entity set of pn4 ours only one. Finlly, this set is mngle y the lol ollpse funtion efine in lines 8 to 12. It simply ollpses (merges) jent items with equl entity sets, thus the result of the funtion hs the following form. ([([pn2 t2]) #{e2 e3 e4 e5}], [([pn1 t1] [pn3 t2]) #{e1 e2 e3}], [([pn4 t2]) #{e2 e3 e4}]} euse the items of pn1 n pn3 hve the sme entity set, they re merge into one item. 2 #{...} is lojure set literl.
4 78 olving the lss Digrm Restruturing Trnsformtion se with FunnyQT Restruturing Rules. The solution efines the funtion pull-up-helper shown in the next listing whih n implement ll three restruturing rules y prmeterizing it ppropritely. The funtion reeives the root moel ojet mo, superlss super, n set of entities lsses in whih to fin ommon properties,. In se of rule 1 n rule 2, super is the superlss of ll lsses, n in se of rule 3, the super prmeter is nil n lsses is the set of top-level lsses. 1 (efn pull-up-helper [mo super lsses] 2 (when (seq lsses) 3 (when-let [[pnts entities] (first (ommon-props lsses))] 4 (if (n super (= lsses entities)) 5 (pull-up mo pnts entities super) ;; rule 1 6 (when (> (ount entities) 1) 7 (let [n (mke-entity! mo)] ;; rule 2 if super is given, else rule 3 8 (pull-up mo pnts entities n) 9 (oseq [s entities] 10 (oseq [olgen (eget s :generliztion) 11 :when (= super (j olgen :generl))] 12 (eelete! olgen)) 13 (mke-generliztion! mo s n)) 14 (when super (mke-generliztion! mo n super)) 15 true)))))) When the set of lsses is not empty (line 2), n if there re ommon properties (line 3), the lrgest list of ommon properties mong the lists of properties elre y mximl numer of entities is oun to pnts, n the entities elring these properties re oun to entities. In se entities equls the set of ll lsses (line 4), the sitution is tht of rule 1, n ll properties in pnts re pulle up to super (line 5). In the other se, the mximl set of ommon properties is shre y mximl ut strit suset of lsses. Here, it hs to e ensure tht there re more thn one entity elring these properties (line 6), euse else the inheritne epth woul inrese without removing elrtions. Then, the sitution is tht of rule 2 if super is non-nil, n the sitution is tht of rule 3 if super is nil. In ny se, ll shre properties re pulle into new entity n (line 8), n the generliztions re pte y eleting the ol generliztions to super (lines 10-12), reting new generliztion to the new superlss n (line 13), n mking super superlss of n (line 14). The overll trnsformtion funtion simply lls the pull-up-helper funtion shown ove with pproprite prmetriztion s long s it n fin mth. Multiple Inheritne Extension. The solution isusse so fr works well lso if the initil moel lrey ontins multiple inheritne. However, they won t rete new entities tht speilize more thn one other entity. To exploit multiple inheritne in orer to restruture the moel resulting from the ore rules so tht there re no uplite properties, one itionl rule is use. It omputes the set of uplite properties of ll lsses, n then ts oring these heuristis. 1. If one of the entities elring the uplite property is top-level lss rete y the ore tsk, then the other entities eome its sulsses. Only top-level entities rete y the ore tsk re reuse, euse reusing one tht lrey existe in the originl lss moel mkes the result s type hierrhy inomptile with originl one, i.e., efore ws no sulss of, ut fterwrs it is. 2. Else, new entity is rete s superlss of the entities, n the property is pulle up. 3 Evlution The evlution results requeste y the se esription [1] re summrize in Tle 1.
5 Tssilo Horn 79 With 110 LO (ore + extension tsk), the solution s size is quite goo given tht its heuristis re more vne thn wht ws emne. Due to these heuristis, its effetiveness is 100% for ll provie n severl itionl moels (e.g., the ones in Figure 1). The se esription efines the omplexity s the sum of opertor ourenes, type referenes, n feture referenes. The FunnyQT solution onsists of 161 funtion lls (or lls to speil forms or mros), 4 type referenes, n 25 feture referenes. The evelopment effort hs een out 8 hours for the solution plus 2 hours for writing unit tests for it. The most hllenging n time-onsuming tsk hs een eveloping heuristis tht hieve 100% effetiveness in ll moels use for testing. ize (LO) 90 (ore only), 105 (ore + extension) omplexity 190 = 161 funlls + 4 type refs + 25 feture refs Effetiveness 100% Development effort pprox. 8 hours (solution) + 2 hours (tests) Exeution time 6 ses for the lrgest moel (testse2_10000.xmi) History of use pprox. 1 yer No. of se stuies pulishe: the 3 TT13 ses, unpulishe: pprox. 20 Mximum pility pprox. 2 million elements on HRE Tle 1: Evlution mesures The etile exeution times on HRE for the lrger moels re epite in Tle2. The lrgest provie moel testse2_10000 onsisting of elements 3 n e proesse in out six seons whih is more thn thousn times fster thn the referene UML-RD solution. Moel ore ore n Extension testse2_ ms 434 ms testse2_ ms 2585 ms testse2_ ms 6041 ms testse3 248 ms 268 ms testse2_ ms ms Tle 2: Detile exeution times on HRE To etermine the mximum pility of the solution, moels up to two millions of elements hve een rete. Given the limite mount of 800 M RM ville to the JVM proess on HRE, the moel with 2 million elements (testse2_200000) is out the mximum pility for the solution. The solution of this se uses only tiny prt of FunnyQT s fetures euse it ws est tkle lgorithmilly. ut next to the moel querying n moel mnipultion PIs use here, FunnyQT provies moel-to-moel trnsformtion PI, PIs for pttern mthing n progrmme grph trnsformtions, n there re more fetures to ome, mking FunnyQT equte for very ivergent set of trnsformtion tsks. Referenes [1] Kevin Lno & hekoufeh Kolhouz Rhimi (2013): se stuy: lss igrm restruturing. In Pieter Vn Gorp, Louis Rose & hristin Kruse, eitors: ixth Trnsformtion Tool ontest (TT 2013), EPT, this volume. 3 The moels testse2_n tully onsist of 10 n elements.
6 80 olving the lss Digrm Restruturing Trnsformtion se with FunnyQT The omplete oure oe of the olution 1 (efn -prop! [mo e pn t] 2 (let [p (erete! Property)] 3 (e! mo :propertys p) 4 (eset! p :nme pn) 5 (eset! p :type t) 6 (e! e :ownettriute p))) 7 8 (efn elete-prop! [e pn] 9 (let [p (first (filter #(= pn (eget % :nme)) 10 (eget e :ownettriute)))] 11 (eelete! p) 12 (eremove! e :ownettriute p))) (efn pull-up [mo pnts froms to] 15 (oseq [[pn t] pnts] 16 (-prop! mo to pn t) 17 (oseq [s froms] 18 (elete-prop! s pn))) 19 true) (efn mke-generliztion! [mo su super] 22 (let [gen (erete! Generliztion)] 23 (e! mo :generliztions gen) 24 (eset! gen :generl super) 25 (eset! gen :speifi su))) (efn mke-entity! [mo] 28 (let [e (erete! Entity)] 29 (e! mo :entitys e) 30 (eset! e :nme (str (gensym "Newlss"))))) (efn prop-type-set [e] 33 (set (mp (fn [p] [(eget p :nme) (eget p :type)]) 34 (eget e :ownettriute)))) (efn filter-y-properties [pnts entities] 37 (set (filter (fn [e] 38 (forll? #(memer? % (prop-type-set e)) pnts)) 39 entities))) (efn ommon-props [lsses] 42 (let [pes (set (mp (fn [pnt] 43 [pnt (filter-y-properties [pnt] lsses)]) 44 (set (mpt prop-type-set lsses)))) 45 freq-mp (pply hsh-mp 46 (mpt (fn [[_ ents]] 47 [ents (ount (filter #(= ents (seon %)) 48 pes))]) 49 pes)) 50 ollpse (fn ollpse [es] 51 (when-let [[pnt entities] (first es)] 52 (let [[s r] (split-with (fn [[_ ents]] 53 (= entities ents)) es)] 54 (ons [(mp first s) entities]
7 Tssilo Horn (lzy-seq (ollpse r))))))] 56 (ollpse (into (sorte-set-y 57 (fn [[_ es :s ] [_ es :s ]] 58 (let [x (- (ount es) (ount es))] 59 (if (zero? x) 60 (let [x (- (freq-mp es) (freq-mp es))] 61 (if (zero? x) 62 (ompre ) 63 x)) 64 x)))) 65 pes)))) (efn pull-up-helper [mo super lsses] 68 (when (seq lsses) 69 (when-let [[pnts entities] (first (ommon-props lsses))] 70 (if (n super (= lsses entities)) 71 (pull-up mo pnts entities super) ;; rule 1 72 (when (> (ount entities) 1) 73 (let [n (mke-entity! mo)] ;; if super rule 2, else rule 3 74 (pull-up mo pnts entities n) 75 (oseq [s entities] 76 (oseq [olgen (eget s :generliztion) 77 :when (= super (j olgen :generl))] 78 (eelete! olgen)) 79 (mke-generliztion! mo s n)) 80 (when super (mke-generliztion! mo n super)) 81 true)))))) (efn exploit-multiple-inheritne [mo] 84 (oseq [[pnts entities] (ommon-props (eget mo :entitys)) 85 :while (> (ount entities) 1)] 86 (let [[n reuse] 87 (if-let [top (first (filter 88 #(n (empty? (eget % :generliztion)) 89 (re-mthes #"Newlss.*" (eget % :nme))) 90 entities))] 91 [top true] 92 [(mke-entity! mo) flse])] 93 (oseq [[pn t] pnts] 94 (when-not reuse 95 (-prop! mo n pn t)) 96 (oseq [e (remove #(= n %) entities)] 97 (elete-prop! e pn) 98 (mke-generliztion! mo e n)))))) (efn pull-up-1-2 [mo] 101 (loop [lsses (eget mo :entitys), pplie flse] 102 (if (seq lsses) 103 (let [super (first lsses) 104 result (pull-up-helper 105 mo super (set (js super :speiliztion :speifi)))] 106 (reur (rest lsses) (or result pplie))) 107 pplie))) (efn pull-up-3 [mo] 110 (pull-up-helper mo nil (set (remove #(seq (eget % :generliztion))
8 82 olving the lss Digrm Restruturing Trnsformtion se with FunnyQT 111 (eget mo :entitys))))) (efn pull-up-ttriutes [moel multi-inheritne] 114 (let [mo (the (ellojets moel moel))] 115 (itertively #(let [r (pull-up-1-2 mo)] 116 (or (pull-up-3 mo) r))) 117 (when multi-inheritne (exploit-multiple-inheritne mo)) 118 moel))
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 information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationSection 2.1 Special Right Triangles
Se..1 Speil Rigt Tringles 49 Te --90 Tringle Setion.1 Speil Rigt Tringles Te --90 tringle (or just 0-60-90) is so nme euse of its ngle mesures. Te lengts of te sies, toug, ve very speifi pttern to tem
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationNumbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point
GCSE C Emple 7 Work out 9 Give your nswer in its simplest form Numers n inies Reiprote mens invert or turn upsie own The reiprol of is 9 9 Mke sure you only invert the frtion you re iviing y 7 You multiply
More information2.4 Theoretical Foundations
2 Progrmming Lnguge Syntx 2.4 Theoretil Fountions As note in the min text, snners n prsers re se on the finite utomt n pushown utomt tht form the ottom two levels of the Chomsky lnguge hierrhy. At eh level
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More informationXML and Databases. Exam Preperation Discuss Answers to last year s exam. Sebastian Maneth NICTA and UNSW
XML n Dtses Exm Prepertion Disuss Answers to lst yer s exm Sestin Mneth NICTA n UNSW CSE@UNSW -- Semester 1, 2008 (1) For eh of the following, explin why it is not well-forme XML (is WFC or the XML grmmr
More informationCS 360 Exam 2 Fall 2014 Name
CS 360 Exm 2 Fll 2014 Nme 1. The lsses shown elow efine singly-linke list n stk. Write three ifferent O(n)-time versions of the reverse_print metho s speifie elow. Eh version of the metho shoul output
More informationI 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 information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More information8 THREE PHASE A.C. CIRCUITS
8 THREE PHSE.. IRUITS The signls in hpter 7 were sinusoidl lternting voltges nd urrents of the so-lled single se type. n emf of suh type n e esily generted y rotting single loop of ondutor (or single winding),
More informationSolutions to Problem Set #1
CSE 233 Spring, 2016 Solutions to Prolem Set #1 1. The movie tse onsists of the following two reltions movie: title, iretor, tor sheule: theter, title The first reltion provies titles, iretors, n tors
More information18.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 informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationThe DOACROSS statement
The DOACROSS sttement Is prllel loop similr to DOALL, ut it llows prouer-onsumer type of synhroniztion. Synhroniztion is llowe from lower to higher itertions sine it is ssume tht lower itertions re selete
More informationLogic, Set Theory and Computability [M. Coppenbarger]
14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationEquivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.
Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions
More informationNow 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 informationLesson 2.1 Inductive Reasoning
Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,
More information1 This diagram represents the energy change that occurs when a d electron in a transition metal ion is excited by visible light.
1 This igrm represents the energy hnge tht ours when eletron in trnsition metl ion is exite y visile light. Give the eqution tht reltes the energy hnge ΔE to the Plnk onstnt, h, n the frequeny, v, of the
More informationEngr354: Digital Logic Circuits
Engr354: Digitl Logi Ciruits Chpter 4: Logi Optimiztion Curtis Nelson Logi Optimiztion In hpter 4 you will lern out: Synthesis of logi funtions; Anlysis of logi iruits; Tehniques for deriving minimum-ost
More informationFinite State Automata and Determinisation
Finite Stte Automt nd Deterministion Tim Dworn Jnury, 2016 Lnguges fs nf re df Deterministion 2 Outline 1 Lnguges 2 Finite Stte Automt (fs) 3 Non-deterministi Finite Stte Automt (nf) 4 Regulr Expressions
More informationAlgebra 2 Semester 1 Practice Final
Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers
More informationfor 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 informationParticle Physics. Michaelmas Term 2011 Prof Mark Thomson. Handout 3 : Interaction by Particle Exchange and QED. Recap
Prtile Physis Mihelms Term 2011 Prof Mrk Thomson g X g X g g Hnout 3 : Intertion y Prtile Exhnge n QED Prof. M.A. Thomson Mihelms 2011 101 Rep Working towrs proper lultion of ey n sttering proesses lnitilly
More informationA Primer on Continuous-time Economic Dynamics
Eonomis 205A Fll 2008 K Kletzer A Primer on Continuous-time Eonomi Dnmis A Liner Differentil Eqution Sstems (i) Simplest se We egin with the simple liner first-orer ifferentil eqution The generl solution
More informationMomentum and Energy Review
Momentum n Energy Review Nme: Dte: 1. A 0.0600-kilogrm ll trveling t 60.0 meters per seon hits onrete wll. Wht spee must 0.0100-kilogrm ullet hve in orer to hit the wll with the sme mgnitue of momentum
More informationExam Review. John Knight Electronics Department, Carleton University March 2, 2009 ELEC 2607 A MIDTERM
riting Exms: Exm Review riting Exms += riting Exms synhronous iruits Res, yles n Stte ssignment Synhronous iruits Stte-Grph onstrution n Smll Prolems lso Multiple Outputs, n Hrer omintionl Prolem riting
More informationIntermediate Math Circles Wednesday 17 October 2012 Geometry II: Side Lengths
Intermedite Mth Cirles Wednesdy 17 Otoer 01 Geometry II: Side Lengths Lst week we disussed vrious ngle properties. As we progressed through the evening, we proved mny results. This week, we will look t
More informationPart I: Study the theorem statement.
Nme 1 Nme 2 Nme 3 A STUDY OF PYTHAGORAS THEOREM Instrutions: Together in groups of 2 or 3, fill out the following worksheet. You my lift nswers from the reding, or nswer on your own. Turn in one pket for
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationLecture 11 Binary Decision Diagrams (BDDs)
C 474A/57A Computer-Aie Logi Design Leture Binry Deision Digrms (BDDs) C 474/575 Susn Lyseky o 3 Boolen Logi untions Representtions untion n e represente in ierent wys ruth tle, eqution, K-mp, iruit, et
More informationLecture 2: Cayley Graphs
Mth 137B Professor: Pri Brtlett Leture 2: Cyley Grphs Week 3 UCSB 2014 (Relevnt soure mteril: Setion VIII.1 of Bollos s Moern Grph Theory; 3.7 of Gosil n Royle s Algeri Grph Theory; vrious ppers I ve re
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationLesson 2.1 Inductive Reasoning
Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationAutomata 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= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More informationNondeterministic Finite Automata
Nondeterministi Finite utomt The Power of Guessing Tuesdy, Otoer 4, 2 Reding: Sipser.2 (first prt); Stoughton 3.3 3.5 S235 Lnguges nd utomt eprtment of omputer Siene Wellesley ollege Finite utomton (F)
More informationCSC2542 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 informationMaximum size of a minimum watching system and the graphs achieving the bound
Mximum size of minimum wthing system n the grphs hieving the oun Tille mximum un système e ontrôle minimum et les grphes tteignnt l orne Dvi Auger Irène Chron Olivier Hury Antoine Lostein 00D0 Mrs 00 Déprtement
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationSuppose we want to find the area under the parabola and above the x axis, between the lines x = 2 and x = -2.
Mth 43 Section 6. Section 6.: Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot
More informationTechnology Mapping Method for Low Power Consumption and High Performance in General-Synchronous Framework
R-17 SASIMI 015 Proeeings Tehnology Mpping Metho for Low Power Consumption n High Performne in Generl-Synhronous Frmework Junki Kwguhi Yukihie Kohir Shool of Computer Siene, the University of Aizu Aizu-Wkmtsu
More informationCommon 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 informationLecture Notes No. 10
2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite
More informationSymmetrical Components 1
Symmetril Components. Introdution These notes should e red together with Setion. of your text. When performing stedy-stte nlysis of high voltge trnsmission systems, we mke use of the per-phse equivlent
More informationCARLETON 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 informationGM1 Consolidation Worksheet
Cmridge Essentils Mthemtis Core 8 GM1 Consolidtion Worksheet GM1 Consolidtion Worksheet 1 Clulte the size of eh ngle mrked y letter. Give resons for your nswers. or exmple, ngles on stright line dd up
More informationA 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 informationANALYSIS AND MODELLING OF RAINFALL EVENTS
Proeedings of the 14 th Interntionl Conferene on Environmentl Siene nd Tehnology Athens, Greee, 3-5 Septemer 215 ANALYSIS AND MODELLING OF RAINFALL EVENTS IOANNIDIS K., KARAGRIGORIOU A. nd LEKKAS D.F.
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationSEMI-EXCIRCLE OF QUADRILATERAL
JP Journl of Mthemtil Sienes Volume 5, Issue &, 05, Pges - 05 Ishn Pulishing House This pper is ville online t http://wwwiphsiom SEMI-EXCIRCLE OF QUADRILATERAL MASHADI, SRI GEMAWATI, HASRIATI AND HESY
More informationBasic Derivative Properties
Bsic Derivtive Properties Let s strt this section by remining ourselves tht the erivtive is the slope of function Wht is the slope of constnt function? c FACT 2 Let f () =c, where c is constnt Then f 0
More information9.1 Day 1 Warm Up. Solve the equation = x x 2 = March 1, 2017 Geometry 9.1 The Pythagorean Theorem 1
9.1 Dy 1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 1, 2017 Geometry 9.1 The Pythgoren Theorem 1 9.1 Dy 2 Wrm Up Use the Pythgoren
More informationChapter 8 Roots and Radicals
Chpter 8 Roots nd Rdils 7 ROOTS AND RADICALS 8 Figure 8. Grphene is n inredily strong nd flexile mteril mde from ron. It n lso ondut eletriity. Notie the hexgonl grid pttern. (redit: AlexnderAIUS / Wikimedi
More informationSection 6.1 Definite Integral
Section 6.1 Definite Integrl Suppose we wnt to find the re of region tht is not so nicely shped. For exmple, consider the function shown elow. The re elow the curve nd ove the x xis cnnot e determined
More informationLecture 4: Graph Theory and the Four-Color Theorem
CCS Disrete II Professor: Pri Brtlett Leture 4: Grph Theory n the Four-Color Theorem Week 4 UCSB 2015 Through the rest of this lss, we re going to refer frequently to things lle grphs! If you hen t seen
More informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More information= x x 2 = 25 2
9.1 Wrm Up Solve the eqution. 1. 4 2 + 3 2 = x 2 2. 13 2 + x 2 = 25 2 3. 3 2 2 + x 2 = 5 2 2 4. 5 2 + x 2 = 12 2 Mrh 7, 2016 Geometry 9.1 The Pythgoren Theorem 1 Geometry 9.1 The Pythgoren Theorem 9.1
More informationLesson 2: The Pythagorean Theorem and Similar Triangles. A Brief Review of the Pythagorean Theorem.
27 Lesson 2: The Pythgoren Theorem nd Similr Tringles A Brief Review of the Pythgoren Theorem. Rell tht n ngle whih mesures 90º is lled right ngle. If one of the ngles of tringle is right ngle, then we
More informationUnfoldings 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 informationPOSITIVE 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 informationGrade 6. Mathematics. Student Booklet SPRING 2008 RELEASED ASSESSMENT QUESTIONS. Assessment of Reading,Writing and Mathematics, Junior Division
Gre 6 Assessment of Reing,Writing n Mthemtis, Junior Division Stuent Booklet Mthemtis SPRING 2008 RELEASED ASSESSMENT QUESTIONS Plese note: The formt of these ooklets is slightly ifferent from tht use
More informationAPPROXIMATION AND ESTIMATION MATHEMATICAL LANGUAGE THE FUNDAMENTAL THEOREM OF ARITHMETIC LAWS OF ALGEBRA ORDER OF OPERATIONS
TOPIC 2: MATHEMATICAL LANGUAGE NUMBER AND ALGEBRA You shoul unerstn these mthemtil terms, n e le to use them ppropritely: ² ition, sutrtion, multiplition, ivision ² sum, ifferene, prout, quotient ² inex
More informationSIMPLE NONLINEAR GRAPHS
S i m p l e N o n l i n e r G r p h s SIMPLE NONLINEAR GRAPHS www.mthletis.om.u Simple SIMPLE Nonliner NONLINEAR Grphs GRAPHS Liner equtions hve the form = m+ where the power of (n ) is lws. The re lle
More informationCS 373, Spring Solutions to Mock midterm 1 (Based on first midterm in CS 273, Fall 2008.)
CS 373, Spring 29. Solutions to Mock midterm (sed on first midterm in CS 273, Fll 28.) Prolem : Short nswer (8 points) The nswers to these prolems should e short nd not complicted. () If n NF M ccepts
More informationConvert the NFA into DFA
Convert the NF into F For ech NF we cn find F ccepting the sme lnguge. The numer of sttes of the F could e exponentil in the numer of sttes of the NF, ut in prctice this worst cse occurs rrely. lgorithm:
More informationWelcome. 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 informationCompression of Palindromes and Regularity.
Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationComparing the Pre-image and Image of a Dilation
hpter Summry Key Terms Postultes nd Theorems similr tringles (.1) inluded ngle (.2) inluded side (.2) geometri men (.) indiret mesurement (.6) ngle-ngle Similrity Theorem (.2) Side-Side-Side Similrity
More informationMetaheuristics for the Asymmetric Hamiltonian Path Problem
Metheuristis for the Asymmetri Hmiltonin Pth Prolem João Pero PEDROSO INESC - Porto n DCC - Fule e Ciênis, Universie o Porto, Portugl jpp@f.up.pt Astrt. One of the most importnt pplitions of the Asymmetri
More informationIdentifying and Classifying 2-D Shapes
Ientifying n Clssifying -D Shpes Wht is your sign? The shpe n olour of trffi signs let motorists know importnt informtion suh s: when to stop onstrution res. Some si shpes use in trffi signs re illustrte
More informationTHE PYTHAGOREAN THEOREM
THE PYTHAGOREAN THEOREM The Pythgoren Theorem is one of the most well-known nd widely used theorems in mthemtis. We will first look t n informl investigtion of the Pythgoren Theorem, nd then pply this
More informationLet s divide up the interval [ ab, ] into n subintervals with the same length, so we have
III. INTEGRATION Eonomists seem muh more intereste in mrginl effets n ifferentition thn in integrtion. Integrtion is importnt for fining the epete vlue n vrine of rnom vriles, whih is use in eonometris
More informationLecture 8: Abstract Algebra
Mth 94 Professor: Pri Brtlett Leture 8: Astrt Alger Week 8 UCSB 2015 This is the eighth week of the Mthemtis Sujet Test GRE prep ourse; here, we run very rough-n-tumle review of strt lger! As lwys, this
More informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
More informationLesson 55 - Inverse of Matrices & Determinants
// () Review Lesson - nverse of Mtries & Determinnts Mth Honors - Sntowski - t this stge of stuying mtries, we know how to, subtrt n multiply mtries i.e. if Then evlute: () + B (b) - () B () B (e) B n
More informationHS Pre-Algebra Notes Unit 9: Roots, Real Numbers and The Pythagorean Theorem
HS Pre-Alger Notes Unit 9: Roots, Rel Numers nd The Pythgoren Theorem Roots nd Cue Roots Syllus Ojetive 5.4: The student will find or pproximte squre roots of numers to 4. CCSS 8.EE.-: Evlute squre roots
More informationData Structures LECTURE 10. Huffman coding. Example. Coding: problem definition
Dt Strutures, Spring 24 L. Joskowiz Dt Strutures LEURE Humn oing Motivtion Uniquel eipherle oes Prei oes Humn oe onstrution Etensions n pplitions hpter 6.3 pp 385 392 in tetook Motivtion Suppose we wnt
More informationAP CALCULUS Test #6: Unit #6 Basic Integration and Applications
AP CALCULUS Test #6: Unit #6 Bsi Integrtion nd Applitions A GRAPHING CALCULATOR IS REQUIRED FOR SOME PROBLEMS OR PARTS OF PROBLEMS IN THIS PART OF THE EXAMINATION. () The ext numeril vlue of the orret
More information, 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 informationTotal score: /100 points
Points misse: Stuent's Nme: Totl sore: /100 points Est Tennessee Stte University Deprtment of Computer n Informtion Sienes CSCI 2710 (Trnoff) Disrete Strutures TEST 2 for Fll Semester, 2004 Re this efore
More informationSection 4.4. Green s Theorem
The Clulus of Funtions of Severl Vriles Setion 4.4 Green s Theorem Green s theorem is n exmple from fmily of theorems whih onnet line integrls (nd their higher-dimensionl nlogues) with the definite integrls
More informationStatistics in medicine
Sttistis in meiine Workshop 1: Sreening n ignosti test evlution Septemer 22, 2016 10:00 AM to 11:50 AM Hope 110 Ftm Shel, MD, MS, MPH, PhD Assistnt Professor Chroni Epiemiology Deprtment Yle Shool of Puli
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More information