Concept Formation Using Graph Grammars
|
|
- Aileen Wade
- 8 years ago
- Views:
Transcription
1 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 (416 Ytes St.), Arlington, TX E-mil: {jonyer holder cook}@cse.ut.edu Phone: (817) , Fx: (817) Astrct Recognizing the expressive power of grph representtion nd the ility of certin grph grmmrs to generlize, we ttempt to use grph grmmr lerning for concept formtion. In this pper we descrie our initil progress towrd tht gol, nd focus on how certin grph grmmrs cn e lerned from exmples. We lso estlish grounds for using grph grmmrs in mchine lerning tsks. Severl exmples re presented to highlight the vlidity of the pproch. Introduction Grphs re importnt dt structures ecuse of their ility to represent ny kind of dt. Algorithms tht generte theories of grphs re of gret importnce in dt mining nd mchine lerning. In this pper we descrie n lgorithm which lerns grph grmmrs set of grmmr production rules tht descrie grph-sed dtse. The gol of our reserch is to dpt grph grmmr lerning for concept formtion, hoping tht the expressive power of grphs nd the ility of grph grmmrs to generlize will turn out to e powerful lerning prdigm. This pper presents initil progress towrd tht gol nd sets the stge for susequent work. Only few lgorithms exist for inference of grph grmmrs. An enumertive method for inferring limited clss of context-sensitive grph grmmrs is due to Brtsch-Spörl (1983). Other lgorithms utilize merging technique for hyperedge replcement grmmrs (Jeltsch nd
2 Kreowski 1991) nd regulr tree grmmrs (Crrsco et l. 1998). Our pproch is sed on method for discovering frequent sustructures in grphs (Cook nd Holder 2000). In the following section we discuss different types of grph grmmrs nd rgue how they cn e useful in mchine lerning. We then descrie the grph grmmrs we set out to lern nd define some terminology. Next, we present set of exmples to provide some visul insight with grph grmmrs efore we descrie the lgorithm. Then, we present working exmple on n rtificil domin to etter illustrte the lgorithm. Next, we discuss the types of grmmrs the lgorithm cn lern, s well s point out some of its limittions. We conclude with n overll ssessment of the pproch nd give directions for future work. Grph Grmmrs nd Mchine Lerning When lerning grmmr in generl, one hs to decide the intended use of the grmmr. Grmmrs hve two pplictions: to prse or to generte lnguge. Prser grmmrs re optimized for fst prsing, giving up little ccurcy which results in grmmrs tht over-ccept. Tht is, they will ccept sentences tht re not in the lnguge. Genertor grmmrs trde ccurcy for speed s well. As expected, they will not e le to generte the entire lnguge. A grmmr tht cn generte nd prse the sme lnguge exctly is very hrd to design nd is usully too ig nd slow to e prcticl. In this pper we re ddressing the prolem of inferring grph grmmrs from positive exmples. Our purpose is to use grmmr lerning s n pproch to dt mining, ut other uses cn lso e found. The generted grph grmmr will e our theory of the input domin. In mchine lerning, lgorithms in generl re ttempting to lern theories tht cn generlize to certin degree, so tht new, unseen dt cn e ccurtely ctegorized. Trnslted to
3 grmmr terms, we would like to lern grmmr tht ccepts more thn just the trining lnguge. Therefore, we would like to lern prser grmmrs, which hve the power to express more generl concepts thn the sum of the positive exmples. Grmmrs cn e context-sensitive nd context-free. Context-sensitive grph grmmrs re more expressive nd llow the specifiction of grph trnsformtions, since oth sides of the production cn e ritrry grphs. To strt with, however, we imed t lerning context-free grmmrs tht hve single-vertex non-terminls on the left side of production rules. This is not serious limittion, especilly since the vst mjority of grph grmmr prsers cn only del with exctly such grmmrs (Rekers nd Schürr 1995). So why lern grph grmmrs versus textul ones? Textul grmmrs re lso useful, ut they re limited to dtses tht cn e represented s sequence. An exmple of such dtse is DNA sequence. Most dtses, however, hve non-sequentil structure, nd mny hve significnt structurl components. Reltionl dtses re generlly good exmples, ut even more complex informtion cn e represented using grphs. Exmples include circuit digrms nd the world-wide we. Grph grmmrs cn still represent the simpler feture vector-type dtses s well s sequentil dtses (like the DNA mentioned previously). Grphs re mong the most expressive representtions, therefore n lgorithm tht cn lern theory of grph would e useful. We hve to emphsize tht our purpose in lerning grph grmmrs is not to provide n efficient grph prsing lgorithm. Grph prsing will e necessry for clssifying unseen exmple grphs, nd while the prsing efficiency of the grph grmmr will e concern here, it is not primry gol of the generliztion step.
4 Grph Grmmrs Before we get into the detils of inferring grph grmmrs, we first give generl overview of the type of grmmr we seek to lern. In this pper, nd in our reserch in generl, we re concerned with grph grmmrs of the set theoretic pproch, or expression pproch (Ngl 1987). In this pproch grph is pir of sets G = V, E where V is the set of vertices or nodes, nd E V V is the set of edges. Production rules re of the form S Æ P, where S nd P re grphs. When such rule is pplied to grph, n isomorphic copy of S is removed from the grph long with ll its incident edges, nd is replced with copy of P, together with edges connecting it to the grph. The new edges re given new lels to reflect their connection to the sustructure instnce. A specil cse of the set-theoretic pproch is the node-lel controlled grmmr, in which S consists of single leled node (Engelfriet nd Rozenerg 1991). This is the type of grmmr we re focusing on. In our cse, S is lwys non-terminl, ut P cn e ny grph, nd cn contin oth terminls nd non-terminls. Since we re going to lern grmmrs to e used for prsing, the emedding function is irrelevnt. Externl edges tht re incident on vertex in the sugrph eing replced (P) lwys get reconnected to the single vertex S. Recursive productions re of the form S Æ P S. The non-terminl S is on oth sides of the production, nd P is linked to S vi single edge. The complexity of the lgorithm is exponentil in the numer of edges considered etween recursive instnces, so we limit the lgorithm to one for now. If the grmmr is used for grph genertion, this rule will generte n infinitely long sequence of the grph P. If the lnguge is to e finite, stopping lterntive production is required. One such production is S Æ P S, which reds replce S with P S or nothing. For our purposes, however, we use the production S Æ P S P. The rule S Æ P S, when used for
5 prsing, would imply tht nothing cn e replced with S, introducing n ritrry numer of S s. At the sme time, it cnnot prse chin of P s of finite length s it would hve no strting point, since P S does not exist in the input grph. Rememer tht the stopping lterntive of grph genertor rule is the strting point of prser rule. When prsing grph, we strt from the complete grph nd work towrds single nonterminl. This is done y removing sugrphs from the grph tht mtch the right side of production nd inserting the non-terminl on the left side in our exmple, replce P S with S, nd finlly, P with S. An exmple of recursive production is shown in Figure 1c, (S 1 ). Alterntive productions re of the form S Æ P 1 P 2 P n. The non-terminl grph S cn e thought of s vrile hving possile vlues P 1, P 2,, P n. We will sometimes refer to such n S s vrile non-terminl, or simply vrile. If S is single vertex, nd P i re lso single vertices, then S is synonymous with regulr non-grph vrile. Its vlues re the vertex lels, which cn e lphnumeric vlues like numers (discrete or continuous) or string descriptions. An exmple of vrile is shown in Figure 1c, where S 2 hs possile vlues c nd d. Exmples Before presenting the lgorithm, couple of exmples re given here to further clrify wht we re trying to ccomplish. The first exmple is suggested y the uthors of Sequitur (Nevill- Mnning nd Witten 1997). Sequitur infers compositionl hierrchies from strings. It detects repetition nd fctors it out y forming rules in grmmr. The exmple string to e nlyzed is cdcd. The grmmr generted y Sequitur is shown in Figure 1. (Non-terminls re in itlic old font.) Our lgorithm, clled SudueGL, lerns grph grmmrs; therefore, the input hs to e in grph formt. This sequentil dt ws
6 represented y series of vertices hving lels ccording to the exmple, connected y single edges, s shown in Figure 1. The grph grmmr lerned y SudueGL is shown in Figure 1c, while its sequentil interprettion is shown in Figure 1d. The first ovious difference is tht SudueGL is le to lern recursive grmmrs. SudueGL s version of the grmmr is lso more generl, since it would prse string of ny length, nd the letters c nd d do not hve to follow in the sme order. This exmple will e referenced in the next section where we descrie the lgorithm. c d c d ) S c 2 d 2 ) S 1 S 2 S 1 S 2 c d S 2 c) S 1 S 2 S 1 S 2 c d S 2 d) Figure 1 First exmple: ) Grmmr y Sequitur ) Input grph to SudueGL c) Grph grmmr y SudueGL d) Equivlent string grmmr The next exmple is vrition of the previous one, with n x slightly reking the regulrity in the pttern: cdxcd. The grmmr lerned y Sequitur is shown in Figure 2 nd is very similr to the previous one in Figure 1. SudueGL, however, dded n extr production to its grmmr, resulting in the grmmr shown in Figure 2. S 1 x c 2 d 2 S 1 S 2 S 1 S 2 S 2 c d S 3 S 1 x S 1 ) Figure 2 Grmmrs y ) Sequitur nd ) SudueGL lerned from cdxcd. )
7 A third exmple is given lter, fter the introduction of the lgorithm. Tht exmple involves n rtificil domin which ws specificlly designed to highlight SudueGL s cpilities. The Lerning Algorithm The SudueGL lgorithm is sed on the Sudue (Cook nd Holder 2000) knowledge discovery lgorithm tht extrcts common sustructures from grphs. SudueGL tkes dt sets in grph formt s input, hence dtse needs to e represented s grph efore pssing it to SudueGL. The grph representtion includes the stndrd fetures of grphs: leled vertices nd leled edges. Edges cn e directed or undirected. No restrictions re plced on the input grph. When converting dt set to grph representtion, typiclly ojects nd dt re mpped to vertices, nd reltionships nd ttriutes re mpped to edges. Serch SudueGL performs n itertive serch on the input grph, ech itertion resulting in grmmr production. When production is found, the right side of the production is strcted wy from the input grph y replcing ech occurrence of it y the non-terminl on the left side. SudueGL keeps iterting until the entire input grph is strcted wy into single nonterminl. User-specified limits cn e plced on the numer of productions to e found, nd on the mximum size of ech production rule (in numer of vertices). For other user-defined options plese see erlier pulictions, or the user mnul, ville t In ech itertion SudueGL performs em serch for the est sustructure to e used in the next production rule. The serch strts y finding ech uniquely leled vertex nd ll their instnces in the input grph. In our first exmple the input grph (shown in Figure 1) hs 4 uniquely leled vertices,, c nd d, ech hving 4, 4, 2 nd 2 instnces, respectively. The sugrph definition nd ll instnces re referred to s sustructure. The
8 ExtendSugstructure serch opertor is pplied to ech of these single-vertex sustructures to produce 2-vertex sustructures. This opertor extends sustructure in ll possile directions, nd collects instnces tht mtch, possily resulting in severl new sustructures. In our exmple, extending the unique vertex will result in instnces like, c nd d. These re different from ech other, ut ech hve severl instnces of their own. These instnces re collected to form new sustructures. SudueGL ( grph G, int Bem, int Limit ) repet grmmr = {} queue Q = { v v hs unique lel in G } estsu = first sustructure in Q repet newq = {} for ech sustructure S in Q newsus = ExtendSustructure(S) recursivesus = RecursifySustructure(S) newq = newq U newsus U recursivesus Limit = Limit - 1 evlute sustructures in newq y MDL Q = sustructures in newq with top Bem compression scores if est sustructure in Q etter thn estsu then estsu = est sustructure in Q until Q is empty or Limit <= 0 grmmr = grmmr U estsu G = G compressed y estsu until estsu cnnot compress the grph G return grmmr ExtendSustructure (sustructure S) newsus = S extended y n djcent edge in ll possile wys vrsus = S extended y n djcent edge in ll possile wys, replcing the dded vertex with non-terminl return newsus U vrsus RecursifySustructure (sustructure S) recsus = ll possile chins of instnces of S, linked y single edge return recsus Figure 3 SudueGL s min discovery lgorithm. The resulting sustructures re evluted ccording to the minimum description length (MDL) principle, which sttes tht the est theory is the one tht minimizes the description length of the entire dt set. The MDL principle ws introduced y Rissnen (1989), nd pplied to grph-sed knowledge discovery y Cook nd Holder (1994). The vlue of sustructure
9 is computed y dividing the description length of the input grph y the sum of the description lengths of the sustructure nd the input grph compressed y the sustructure: Vlue(S) = DL(G) / (DL(S) + DL(G S)), where G is the input grph, S is the sustructure, nd G S is the input grph G compressed using S. DL stnds for description length. Sud uegl seeks to mximize the vlue. Only sustructures deemed the est y the MDL principle re kept for further extension. Heuristics re pplied to stop the extension process, lthough exhustive nlysis is lso possile. One heuristic involves trcking the serch spce for locl minim. The serch is ndoned if new locl minimum is not found fter certin numer of pplictions of the Extend-Sustructure opertor. This heuristic is used y defult. Another heuristic requires the user to specify the mximum size of sustructure. Once the size limit is reched, the serch termintes. There lso exists n solute limit on the numer of sustructures to consider during the serch process, which cn e specified y the user. These heuristics, like others in SudueGL, cn lso e used in comintion. Recursion Recursive productions re mde possile y the Recursify-Sustructure serch opertor. It is pplied to ech sustructure fter the ExtendSustructure opertor. Recursify-Sustructure checks ech instnce of the sustructure to see if it is connected to ny other instnce of the sme sustructure y n edge. If so, recursive production is possile. The opertor dds the connecting edge to the sustructure nd collects ll possile chins of instnces. If recursive production is found to e the est in n itertion, ech such chin of sugrphs is strcted wy y replcing them with single vertex.
10 Since SudueGL discovers commonly occurring sustructures first nd then ttempts to mke recursive production, SudueGL cn only discover recursive productions tht prse lists of sustructures. In other words, it cn only mke recursive productions out of lists of sustructures tht re connected y single edge, which hve to hve the sme lel etween ech memer sustructure of the list. The lgorithm is exponentil in the numer of edges considered in the recursion, so we limit SudueGL to single-edge recursive productions. Therefore, the system does not yet lern productions such s S Æ S. The stopping condition in the recursion is generted y removing the recursive vertex long with the edge tht connects it to the rest of the sugrph. Vriles The mjor insight ehind discovering vriles is tht the context they pper in hs to e constnt. In other words, the first step towrds discovering vriles is discovering commonly occurring structures. If these commonly occurring structures re connected to vrying vertices, these vrying vertices cn e turned into vriles. Vriles hve to e connected to ech instnce of the common sustructure the sme wy connected y n edge of the sme lel nd direction to the sme vertex. We give n exmple of this in the next section, ut looking t the input grph in Figure 4 nd the grmmr rule in Figure 7 t this point could e helpful. SudueGL discovers vriles inside the ExtendSu-structure serch opertor. As mentioned efore, SudueGL extends ech instnce of sustructure in ll possile wys nd collects the instnces tht still mtch. After this step, it collects ll instnces tht were extended y the sme edge, regrdless of wht vertex they point to (s long s tht vertex is not lredy in the sustructure). This new vertex, is replced with vrile (non-terminl) vertex. The sustructure is then evluted nd competes with others for top plcement. Generlly speking, if
11 the vrile hs the sme vlue for most of the instnces, the sustructure will rnk worse thn the equivlent structure without the vrile ecuse of the extr its needed to encode the vrile. On the other hd, if the vrile hs mny vlues, it helps to cover mny more instnces of the sustructure thn the equivlent structure without the vrile, nd will compress the input grph etter. Let us work n exmple to illustrte the ove explntion. An Illustrtive Exmple In this section we give working exmple of SudueGL s opertion. Consider the input grph shown in Figure 4. It is the grph representtion of n rtificilly generted domin. It fetures lists of sttic structures (squre shpe), list of chnging structure (tringle shpe), nd some dditionl rndom vertices nd edges. For clener ppernce we omitted edge lels in the figures. The edge lels within the tringle-looking sugrph re t, in the squre -looking sugrph s, nd the rest of the edges re leled next. c d e f k x y x y r x y x y z q z q z q z q Figure 4 Input grph. SudueGL strts out y collecting ll the unique vertices in the grph nd expnding them in ll possile directions. Let us follow the extension of vertex x keeping in mind tht the others re expnded in prllel. When we expnd vertex x in ll possile directions, it results in 2 - vertex sustructures, with edges (x, s, y), (x, s, z), (y, next, x), nd (x, next, r). The fist two
12 sustructures will rnk higher, since those hve four instnces nd will compress the grph etter thn the ltter two with only 2 nd 1 instnces respectively. S 1 x y S 1 x y c d e f z q z q k Figure 5 First production generted y SudueGL S 1 r S 1 Figure 6 Input grph, prsed y the first production Applying the ExtendSustructure opertor three more times will result in sustructure hving vertices {x, y, z, q} nd four edges connecting these four vertices. This sustructure hs four instnces. Being the iggest nd most common sustructure, it will rnk on the top. Executing the RecursifySustructure opertor will result in the recursive grmmr rule shown in Figure 5. The production covers two lists of two instnces of the sustructure. The recursive production ws constructed y checking ll outgoing edges of ech instnce to see if they re connected to ny other instnce. We cn see in Figure 4 tht the instnce in the lower left is connected to the instnce on its right, vi vertex y eing connected to vertex x. Sme is the sitution on the lower right side. Astrcting out these four instnces of the sustructure using the ove production results in the grph depicted in Figure 6. The next itertion of SudueGL will use this grph s its input grph to lern the next grmmr rule. Looking t the grph, one cn esily see tht the most common sustructure now is the tringle-looking sugrph. SudueGL will in fct find portion of tht simply y looking for sustructures tht re exctly the sme. This prt is the sustructure hving vertices {, } nd edge (, t, ). It hs four instnces. Extending this structure further y n edge nd vertex will dd different vertices for ech instnce: c, d, e, nd f. The resulting single instnce sustructures will not do well when evluted y the MDL mesure.
13 SudueGL t this point will generte nother sustructure with four instnces, replcing vertices c, d, e, nd f with non -terminl vertex (S 3 ) in the sustructure, therey creting vrile. This sustructure now hs four instnces, nd stnds the est chnce of getting selected for the next production. After the ExtendSustructure opertion, however, SudueGL will hnd the sustructure to Recursify-Sustructure to see if ny of the instnces re connected. Since ll four of them re connected y n edge, recursive sustructure is creted which will cover even more of the input grph, hving included three dditionl edges. Also, it is replced y single non-terminl in the input grph, versus four non-terminls when strcting out the instnces non-recursively, oney-one. The new productions generted in this itertion re shown in Figure 7. Astrcting wy these sustructures produces the grph shown in Figure 8. S 2 S 2 S 2 S 3 S 3 k S 1 r S 1 S 3 c d e f Figure 7 Second nd third productions y SudueGL Figure 8 Input grph prsed y the second nd third productions In the next itertion, SudueGL cnnot find ny recurring sustructures tht cn e strcted out to reduce the grph s description length. The grph in Figure 8, therefore ecomes the right side of the lst production. When this rule is executed, the grph is fully prsed. Discussion SudueGL required only minor extensions to Sudue minly ecuse of the roustness of the MDL heuristic. Grmmrs with lrge mounts of disjunction, either in the form of multiple
14 productions or lrge discrete rnges for vriles, trdeoff with simpler grmmrs with less coverge. The MDL mesure provides resonle trdeoff etween the two. The next step in our nlysis of the SudueGL pproch is to empiriclly vlidte the lgorithm nd find its limittions. Empiricl testing is difficult for grph grmmr lerning due to the shortge of competitors nd rel-world exmples. However, utomted testing my e possile y rndomly generting grph grmmrs, generting exmples from these grmmrs, nd then nlyze SudueGL s ehvior while ttempting to lern the originl grmmr. Rndom grph grmmr genertion is not trivil given the huge spce of possile grmmrs, ut such methodology would llow us some mesure of SudueGL s effectiveness in this domin. We hve lso considered complexity nlysis of SudueGL. Since we re limiting SudueGL to recursive productions involving only one connecting edge, the complexity is no more thn tht of Sudue, which is constrined to e polynomil in the size of the input grph. Conclusions nd Future Work In this pper we introduced n lgorithm, SudueGL, which is le to lern grph grmmrs from exmples. The lgorithm is sed on the erlier system clled Sudue which hs hd success in structurl dt mining for yers. SudueGL focuses on context-free prser grph grmmrs. Although incomplete, its current cpilities include finding sttic structures, finding vriles, nd finding recursive structures. As mentioned t the eginning, this pper reports on work in progress. Our future plns include expnding grph grmmr lerning with concept lerning, nd hndling continuous vlues. As future results wrrnt, we my llow vriles to tke on vlues tht re not restricted to e single vertices. We lso pln to investigte other wys to identify recursive structures, with
15 focus on llowing the recursive non-terminl to e emedded in sugrph, connecting with more thn single edge. We will evlute our progress y compring the system s performnce to some competing mchine lerning lgorithms, such s inductive logic progrmming systems. We lso hve plns to pply SudueGL to rel-world domins, such s circuit digrms nd protein sequences. References Brtsch-Sörl, B Grmmticl inference of grph grmmrs for syntctic pttern recognition. Lecture Notes in Computer Science, 153: 1-7. Crrsco, R. C., J. Oncin, nd J. Cler Stochstic inference of regulr tree lnguges. Lecture Notes in Artificil Intelligence, 1433: Cook, D. J., nd L. B. Holder Grph-Bsed Dt Mining. IEEE Intelligent Systems, 15(2), Cook, D. J., nd L. B. Holder Sustructure Discovery Using Minimum Description Length nd Bckground Knowledge. Journl of Artificil Intelligence Reserch, Volume 1, Engelfriet, J., nd G. Rozenerg Grph grmmrs sed on node rewriting: n introduction to NLC grmmrs. Lecture Notes in Computer Science, 532, Jeltsch, E., nd H. J. Kreowski Grmmticl inference sed on hyperedge replcement. Lecture Notes in Computer Science, 532: Ngl, M Set theoretic pproches to grph grmmrs. In H. Ehrig, M. Ngl, G. Rozenerg, nd A. Rosenfeld, editors, Grph Grmmrs nd Their Appliction to Computer Science, volume 291 of Lecture Notes in Computer Science, Nevill-Mnning, C. G., nd I. H. Witten Identifying Hierrchicl Structure in Sequences: A liner-time lgorithm. Journl of Artificil Intelligence Reserch, 7, Rekers, J., nd A. Schürr A Prsing Algorithm for Context-Sensitive Grph Grmmrs. Technicl report 95-05, Leiden University. Rissnen, J Stochstic Complexity in Sttisticl Inquiry. World Scientific Compny.
Reasoning 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 informationAntiSpyware Enterprise Module 8.5
AntiSpywre Enterprise Module 8.5 Product Guide Aout the AntiSpywre Enterprise Module The McAfee AntiSpywre Enterprise Module 8.5 is n dd-on to the VirusScn Enterprise 8.5i product tht extends its ility
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 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 informationSection 5-4 Trigonometric Functions
5- Trigonometric Functions Section 5- Trigonometric Functions Definition of the Trigonometric Functions Clcultor Evlution of Trigonometric Functions Definition of the Trigonometric Functions Alternte Form
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 informationP.3 Polynomials and Factoring. P.3 an 1. Polynomial STUDY TIP. Example 1 Writing Polynomials in Standard Form. What you should learn
33337_0P03.qp 2/27/06 24 9:3 AM Chpter P Pge 24 Prerequisites P.3 Polynomils nd Fctoring Wht you should lern Polynomils An lgeric epression is collection of vriles nd rel numers. The most common type of
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 informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationLINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES
LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of
More informationJava CUP. Java CUP Specifications. User Code Additions You may define Java code to be included within the generated parser:
Jv CUP Jv CUP is prser-genertion tool, similr to Ycc. CUP uilds Jv prser for LALR(1) grmmrs from production rules nd ssocited Jv code frgments. When prticulr production is recognized, its ssocited code
More informationA.7.1 Trigonometric interpretation of dot product... 324. A.7.2 Geometric interpretation of dot product... 324
A P P E N D I X A Vectors CONTENTS A.1 Scling vector................................................ 321 A.2 Unit or Direction vectors...................................... 321 A.3 Vector ddition.................................................
More informationScalable Mining of Large Disk-based Graph Databases
Sclle Mining of Lrge Disk-sed Grph Dtses Chen Wng Wei Wng Jin Pei Yongti Zhu Bile Shi Fudn University, Chin, {chenwng, weiwng1, 2465, shi}@fudn.edu.cn Stte University of New York t Bufflo, USA & Simon
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
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 informationModular Generic Verification of LTL Properties for Aspects
Modulr Generic Verifiction of LTL Properties for Aspects Mx Goldmn Shmuel Ktz Computer Science Deprtment Technion Isrel Institute of Technology {mgoldmn, ktz}@cs.technion.c.il ABSTRACT Aspects re seprte
More informationMorgan Stanley Ad Hoc Reporting Guide
spphire user guide Ferury 2015 Morgn Stnley Ad Hoc Reporting Guide An Overview For Spphire Users 1 Introduction The Ad Hoc Reporting tool is ville for your reporting needs outside of the Spphire stndrd
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More informationLecture 3 Gaussian Probability Distribution
Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike
More information5 a LAN 6 a gateway 7 a modem
STARTER With the help of this digrm, try to descrie the function of these components of typicl network system: 1 file server 2 ridge 3 router 4 ckone 5 LAN 6 gtewy 7 modem Another Novell LAN Router Internet
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationVirtual Machine. Part II: Program Control. Building a Modern Computer From First Principles. www.nand2tetris.org
Virtul Mchine Prt II: Progrm Control Building Modern Computer From First Principles www.nnd2tetris.org Elements of Computing Systems, Nisn & Schocken, MIT Press, www.nnd2tetris.org, Chpter 8: Virtul Mchine,
More informationOr more simply put, when adding or subtracting quantities, their uncertainties add.
Propgtion of Uncertint through Mthemticl Opertions Since the untit of interest in n eperiment is rrel otined mesuring tht untit directl, we must understnd how error propgtes when mthemticl opertions re
More informationA Conditional Model of Deduplication for Multi-Type Relational Data
A Conditionl Model of Dedupliction for Multi-Type Reltionl Dt Aron Culott, Andrew McCllum Deprtment of Computer Science University of Msschusetts Amherst, MA 01003 {culott, mccllum}@cs.umss.edu Astrct
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationTool Support for Feature-Oriented Software Development
Tool Support for Feture-Oriented Softwre Development FetureIDE: An Eclipse-Bsed Approch Thoms Leich leich@iti.cs.unimgdeurg.de Sven Apel pel@iti.cs.unimgdeurg.de Lur Mrnitz mrnitz@cs.unimgdeurg.de ABSTRACT
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 informationHow To Network A Smll Business
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationA Visual and Interactive Input abb Automata. Theory Course with JFLAP 4.0
Strt Puse Step Noninverted Tree A Visul nd Interctive Input Automt String ccepted! 5 nodes generted. Theory Course with JFLAP 4.0 q0 even 's, even 's q2 even 's, odd 's q1 odd 's, even 's q3 odd 's, odd
More informationGene Expression Programming: A New Adaptive Algorithm for Solving Problems
Gene Expression Progrmming: A New Adptive Algorithm for Solving Prolems Cândid Ferreir Deprtmento de Ciêncis Agráris Universidde dos Açores 9701-851 Terr-Chã Angr do Heroísmo, Portugl Complex Systems,
More informationOperations with Polynomials
38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
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 informationRecognition Scheme Forensic Science Content Within Educational Programmes
Recognition Scheme Forensic Science Content Within Eductionl Progrmmes one Introduction The Chrtered Society of Forensic Sciences (CSoFS) hs been ccrediting the forensic content of full degree courses
More information1. Introduction. 1.1. Texts and their processing
Chpter 1 3 21/7/97 1. Introduction 1.1. Texts nd their processing One of the simplest nd nturl types of informtion representtion is y mens of written texts. Dt to e processed often does not decompose into
More informationDAGmaps: Space Filling Visualization of Directed Acyclic Graphs
Journl of Grph Algorithms nd Applictions http://jg.info/ vol. 13, no. 3, pp. 319 347 (2009) DAGmps: Spce Filling Visuliztion of Directed Acyclic Grphs Vssilis Tsirs 1,2 Sofi Trintfilou 1,2 Ionnis G. Tollis
More informationRTL Power Optimization with Gate-level Accuracy
RTL Power Optimiztion with Gte-level Accurcy Qi Wng Cdence Design Systems, Inc Sumit Roy Clypto Design Systems, Inc 555 River Oks Prkwy, Sn Jose 95125 2903 Bunker Hill Lne, Suite 208, SntClr 95054 qwng@cdence.com
More informationEngineer-to-Engineer Note
Engineer-to-Engineer Note EE-280 Technicl notes on using Anlog Devices DSPs, processors nd development tools Visit our Web resources http://www.nlog.com/ee-notes nd http://www.nlog.com/processors or e-mil
More informationHillsborough Township Public Schools Mathematics Department Computer Programming 1
Essentil Unit 1 Introduction to Progrmming Pcing: 15 dys Common Unit Test Wht re the ethicl implictions for ming in tody s world? There re ethicl responsibilities to consider when writing computer s. Citizenship,
More informationSimulation of operation modes of isochronous cyclotron by a new interative method
NUKLEONIKA 27;52(1):29 34 ORIGINAL PAPER Simultion of opertion modes of isochronous cyclotron y new intertive method Ryszrd Trszkiewicz, Mrek Tlch, Jcek Sulikowski, Henryk Doruch, Tdeusz Norys, Artur Srok,
More informationHealth insurance exchanges What to expect in 2014
Helth insurnce exchnges Wht to expect in 2014 33096CAEENABC 02/13 The bsics of exchnges As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum mount
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 informationAll pay auctions with certain and uncertain prizes a comment
CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin
More informationUse Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.
Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationAPPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS
APPLICATION NOTE Revision 3.0 MTD/PS-0534 August 13, 2008 KODAK IMAGE SENDORS COLOR CORRECTION FOR IMAGE SENSORS TABLE OF FIGURES Figure 1: Spectrl Response of CMOS Imge Sensor...3 Figure 2: Byer CFA Ptterns...4
More informationJaERM Software-as-a-Solution Package
JERM Softwre-s--Solution Pckge Enterprise Risk Mngement ( ERM ) Public listed compnies nd orgnistions providing finncil services re required by Monetry Authority of Singpore ( MAS ) nd/or Singpore Stock
More informationHow To Study The Effects Of Music Composition On Children
C-crcs Cognitive - Counselling Reserch & Conference Services (eissn: 2301-2358) Volume I Effects of Music Composition Intervention on Elementry School Children b M. Hogenes, B. Vn Oers, R. F. W. Diekstr,
More informationOutline of the Lecture. Software Testing. Unit & Integration Testing. Components. Lecture Notes 3 (of 4)
Outline of the Lecture Softwre Testing Lecture Notes 3 (of 4) Integrtion Testing Top-down ottom-up ig-ng Sndwich System Testing cceptnce Testing istriution of ults in lrge Industril Softwre System (ISST
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 informationTreatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.
The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only
More informationPROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY
MAT 0630 INTERNET RESOURCES, REVIEW OF CONCEPTS AND COMMON MISTAKES PROF. BOYAN KOSTADINOV NEW YORK CITY COLLEGE OF TECHNOLOGY, CUNY Contents 1. ACT Compss Prctice Tests 1 2. Common Mistkes 2 3. Distributive
More informationIntroducing Kashef for Application Monitoring
WextWise 2010 Introducing Kshef for Appliction The Cse for Rel-time monitoring of dtcenter helth is criticl IT process serving vriety of needs. Avilbility requirements of 6 nd 7 nines of tody SOA oriented
More informationHow To Make A Network More Efficient
Rethinking Virtul Network Emedding: Sustrte Support for Pth Splitting nd Migrtion Minln Yu, Yung Yi, Jennifer Rexford, Mung Ching Princeton University Princeton, NJ {minlnyu,yyi,jrex,chingm}@princeton.edu
More informationT H E S E C U R E T R A N S M I S S I O N P R O T O C O L O F S E N S O R A D H O C N E T W O R K
Z E S Z Y T Y N A U K O W E A K A D E M I I M A R Y N A R K I W O J E N N E J S C I E N T I F I C J O U R N A L O F P O L I S H N A V A L A C A D E M Y 2015 (LVI) 4 (203) A n d r z e j M r c z k DOI: 10.5604/0860889X.1187607
More informationCS99S Laboratory 2 Preparation Copyright W. J. Dally 2001 October 1, 2001
CS99S Lortory 2 Preprtion Copyright W. J. Dlly 2 Octoer, 2 Ojectives:. Understnd the principle of sttic CMOS gte circuits 2. Build simple logic gtes from MOS trnsistors 3. Evlute these gtes to oserve logic
More informationBabylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity
Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University
More information. At first sight a! b seems an unwieldy formula but use of the following mnemonic will possibly help. a 1 a 2 a 3 a 1 a 2
7 CHAPTER THREE. Cross Product Given two vectors = (,, nd = (,, in R, the cross product of nd written! is defined to e: " = (!,!,! Note! clled cross is VECTOR (unlike which is sclr. Exmple (,, " (4,5,6
More informationLinear Programming in Database
9 Liner Progrmming in Dtse Akir Kwguchi nd Andrew Ngel Deprtment of Computer Science, The City College of New York. New York, New York United Sttes of Americ Keywords: liner progrmming, simple method,
More informationModeling POMDPs for Generating and Simulating Stock Investment Policies
Modeling POMDPs for Generting nd Simulting Stock Investment Policies Augusto Cesr Espíndol Bff UNIRIO - Dep. Informátic Aplicd Av. Psteur, 458 - Térreo Rio de Jneiro - Brzil ugusto.bff@uniriotec.br Angelo
More informationEcon 4721 Money and Banking Problem Set 2 Answer Key
Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in
More informationEnterprise Risk Management Software Buyer s Guide
Enterprise Risk Mngement Softwre Buyer s Guide 1. Wht is Enterprise Risk Mngement? 2. Gols of n ERM Progrm 3. Why Implement ERM 4. Steps to Implementing Successful ERM Progrm 5. Key Performnce Indictors
More informationHealth insurance marketplace What to expect in 2014
Helth insurnce mrketplce Wht to expect in 2014 33096VAEENBVA 06/13 The bsics of the mrketplce As prt of the Affordble Cre Act (ACA or helth cre reform lw), strting in 2014 ALL Americns must hve minimum
More informationIntegration. 148 Chapter 7 Integration
48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but
More informationDlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report
DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of
More informationLearning to Search Better than Your Teacher
Ki-Wei Chng University of Illinois t Urbn Chmpign, IL Akshy Krishnmurthy Crnegie Mellon University, Pittsburgh, PA Alekh Agrwl Microsoft Reserch, New York, NY Hl Dumé III University of Mrylnd, College
More informationBinary Representation of Numbers Autar Kaw
Binry Representtion of Numbers Autr Kw After reding this chpter, you should be ble to: 1. convert bse- rel number to its binry representtion,. convert binry number to n equivlent bse- number. In everydy
More informationAn Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process
An Undergrdute Curriculum Evlution with the Anlytic Hierrchy Process Les Frir Jessic O. Mtson Jck E. Mtson Deprtment of Industril Engineering P.O. Box 870288 University of Albm Tuscloos, AL. 35487 Abstrct
More informationExperiment 6: Friction
Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht
More informationDrawing Diagrams From Labelled Graphs
Drwing Digrms From Lbelled Grphs Jérôme Thièvre 1 INA, 4, venue de l Europe, 94366 BRY SUR MARNE FRANCE Anne Verroust-Blondet 2 INRIA Rocquencourt, B.P. 105, 78153 LE CHESNAY Cedex FRANCE Mrie-Luce Viud
More informationPentominoes. Pentominoes. Bruce Baguley Cascade Math Systems, LLC. The pentominoes are a simple-looking set of objects through which some powerful
Pentominoes Bruce Bguley Cscde Mth Systems, LLC Astrct. Pentominoes nd their reltives the polyominoes, polycues, nd polyhypercues will e used to explore nd pply vrious importnt mthemticl concepts. In this
More informationHow To Set Up A Network For Your Business
Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer
More informationEconomics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999
Economics Letters 65 (1999) 9 15 Estimting dynmic pnel dt models: guide for q mcroeconomists b, * Ruth A. Judson, Ann L. Owen Federl Reserve Bord of Governors, 0th & C Sts., N.W. Wshington, D.C. 0551,
More informationSource Code verification Using Logiscope and CodeReducer. Christophe Peron Principal Consultant Kalimetrix
Source Code verifiction Using Logiscope nd CodeReducer Christophe Peron Principl Consultnt Klimetrix Agend Introducing Logiscope: Improving confidence nd developer s productivity Bsed on stte-of-the-rt
More informationMath 135 Circles and Completing the Square Examples
Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for
More informationNew Internet Radio Feature
XXXXX XXXXX XXXXX /XW-SMA3/XW-SMA4 New Internet Rdio Feture EN This wireless speker hs een designed to llow you to enjoy Pndor*/Internet Rdio. In order to ply Pndor/Internet Rdio, however, it my e necessry
More information9 CONTINUOUS DISTRIBUTIONS
9 CONTINUOUS DISTIBUTIONS A rndom vrible whose vlue my fll nywhere in rnge of vlues is continuous rndom vrible nd will be ssocited with some continuous distribution. Continuous distributions re to discrete
More informationSection 7-4 Translation of Axes
62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the
More information6.2 Volumes of Revolution: The Disk Method
mth ppliction: volumes of revolution, prt ii Volumes of Revolution: The Disk Method One of the simplest pplictions of integrtion (Theorem ) nd the ccumultion process is to determine so-clled volumes of
More informationMathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100
hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by
More informationBasic Research in Computer Science BRICS RS-02-13 Brodal et al.: Solving the String Statistics Problem in Time O(n log n)
BRICS Bsic Reserch in Computer Science BRICS RS-02-13 Brodl et l.: Solving the String Sttistics Prolem in Time O(n log n) Solving the String Sttistics Prolem in Time O(n log n) Gerth Stølting Brodl Rune
More informationHelicopter Theme and Variations
Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the
More informationProtocol Analysis. 17-654/17-764 Analysis of Software Artifacts Kevin Bierhoff
Protocol Anlysis 17-654/17-764 Anlysis of Softwre Artifcts Kevin Bierhoff Tke-Awys Protocols define temporl ordering of events Cn often be cptured with stte mchines Protocol nlysis needs to py ttention
More informationVectors 2. 1. Recap of vectors
Vectors 2. Recp of vectors Vectors re directed line segments - they cn be represented in component form or by direction nd mgnitude. We cn use trigonometry nd Pythgors theorem to switch between the forms
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 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 information9.3. The Scalar Product. Introduction. Prerequisites. Learning Outcomes
The Sclr Product 9.3 Introduction There re two kinds of multipliction involving vectors. The first is known s the sclr product or dot product. This is so-clled becuse when the sclr product of two vectors
More informationWarm-up for Differential Calculus
Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:
More informationArchitecture and Data Flows Reference Guide
Architecture nd Dt Flows Reference Guide BlckBerry Enterprise Service 12 Version 12.0 Pulished: 2014-11-10 SWD-20141110103011848 Contents Components used in the BES12 solution... 5 Components used to mnge
More informationData replication in mobile computing
Technicl Report, My 2010 Dt repliction in mobile computing Bchelor s Thesis in Electricl Engineering Rodrigo Christovm Pmplon HALMSTAD UNIVERSITY, IDE SCHOOL OF INFORMATION SCIENCE, COMPUTER AND ELECTRICAL
More informationPerformance analysis model for big data applications in cloud computing
Butist Villlpndo et l. Journl of Cloud Computing: Advnces, Systems nd Applictions 2014, 3:19 RESEARCH Performnce nlysis model for big dt pplictions in cloud computing Luis Edurdo Butist Villlpndo 1,2,
More information0.1 Basic Set Theory and Interval Notation
0.1 Bsic Set Theory nd Intervl Nottion 3 0.1 Bsic Set Theory nd Intervl Nottion 0.1.1 Some Bsic Set Theory Notions Like ll good Mth ooks, we egin with definition. Definition 0.1. A set is well-defined
More informationDecision Rule Extraction from Trained Neural Networks Using Rough Sets
Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT
More informationUnit 6: Exponents and Radicals
Eponents nd Rdicls -: The Rel Numer Sstem Unit : Eponents nd Rdicls Pure Mth 0 Notes Nturl Numers (N): - counting numers. {,,,,, } Whole Numers (W): - counting numers with 0. {0,,,,,, } Integers (I): -
More informationA Network Management System for Power-Line Communications and its Verification by Simulation
A Network Mngement System for Power-Line Communictions nd its Verifiction y Simultion Mrkus Seeck, Gerd Bumiller GmH Unterschluerscher-Huptstr. 10, D-90613 Großhersdorf, Germny Phone: +49 9105 9960-51,
More informationAutomated Grading of DFA Constructions
Automted Grding of DFA Constructions Rjeev Alur nd Loris D Antoni Sumit Gulwni Dileep Kini nd Mhesh Viswnthn Deprtment of Computer Science Microsoft Reserch Deprtment of Computer Science University of
More informationMath 314, Homework Assignment 1. 1. Prove that two nonvertical lines are perpendicular if and only if the product of their slopes is 1.
Mth 4, Homework Assignment. Prove tht two nonverticl lines re perpendiculr if nd only if the product of their slopes is. Proof. Let l nd l e nonverticl lines in R of slopes m nd m, respectively. Suppose
More informationApplication-Level Traffic Monitoring and an Analysis on IP Networks
Appliction-Level Trffic Monitoring nd n Anlysis on IP Networks Myung-Sup Kim, Young J. Won, nd Jmes Won-Ki Hong Trditionl trffic identifiction methods bsed on wellknown port numbers re not pproprite for
More informationGFI MilArchiver 6 vs Quest Softwre Archive Mnger GFI Softwre www.gfi.com GFI MilArchiver 6 vs Quest Softwre Archive Mnger GFI MilArchiver 6 Quest Softwre Archive Mnger Who we re Generl fetures Supports
More information