Chapter 2: Introduction to Maple V
|
|
- Flora Leonard
- 5 years ago
- Views:
Transcription
1 Chapter 2: Introdution to Maple V 2-1 Working with Maple Worksheets Try It! (p. 15) Start a Maple session with an empty worksheet. The name of the worksheet should be Untitled (1). Use one of the standard methods for your platform to maximize the worksheet (that is, expand the Maple worksheet so that it ompletely fills the window). The result should be very similar to Figure 2-1. See Figure 2-1 on page 15 of the text. Try It! (p. 16) Ativate balloon help in your urrent session. Then, use it to display the desriptions of eah of the ions in the toolbar. Follow the diretions found in the text on page 16 immediately preeding this Try It! (p. 16). Try It! (p. 17) Use the toggle swithes at the top of the View menu to see how the interfae hanges when various menu bars are hidden from view. When finished, be sure that all bars are visible. See the disussion that immediately preedes this Try It! (p. 17) This exerise is intended to familiarize you with Maple s interfae and the terminology used to desribe the different omponents of the interfae. I reommend having all three ion bars visible at all times. Try It! (p. 20) Use the Copy and Paste method just desribed to omplete the verifiation that the seond solution satisfies the two equations. restart; To get to a state from whih it is possible to omplete the Try It!, exeute the following ommands (from pages ): f := x^3 + x; f := x 3 + x g := a*x^2; g := ax 2 df := diff( f, x ); df := 3 x dg := diff( g, x ); dg := 2 ax SOL := solve( { f = g, df = dg }, { x, a } ); SOL := { a= 2, x= 1 }, { x= -1, a = -2} subs( SOL[1], [ a, x, f = g, df = dg ] ); [ 21,, 2= 2, 4= 4] To verify that the seond solution in SOL also satisfies the two equations, opy the previous line to an input region, hange SOL[1] to SOL[2], and exeute the ommand. The new ommand and its result should look like: subs( SOL[2], [ a, x, f = g, df = dg ] ); [-2,-1,-2 = -2, 4= 4] Try It! (p. 21) Open the worksheet first.mws loated on the Toolkit homepage. Compare this Page 1
2 worksheet with the one you have just reated, myfirst.mws. See the worksheet first.mws that an be obtained from Addison-Wesley or from one of the authors (Meade). The relevant URLs are ftp://ftp.aw.om/seng/authors/meade/first.mws and Note to Publisher: Please onfirm that the AW URL is/will be appropriate. What do you need to make this possible? Try It! (p. 21) To explore the ramifiations of the fat that all worksheets within the same Maple session aess the same Maple kernel, reate a new worksheet (the default name should be alled Untitled (2). ) Enter and exeute the ommand f; in the new worksheet. The result should be the expression representing the funtion f that was entered in the worksheet now titled myfirst.mws. Note that even though there is nothing in Untitled (2) to indiate how f reeived a value, the result learly shows that Untitled (2) is sharing information with myfirst.mws, and any other ommand exeuted within this Maple session. The output from the ommand f; in Untitled (2) should be x 3 + x If you have not followed the text, you will likely see that there is no value assigned to the name f. In this ase you should repeat enough of the disussion in the text to give a value to f in another worksheet. Try It! (p. 23) Use the subs ommand to determine the exat loation of the seond point of intersetion for the derivatives. Are the answers you obtained in reasonable agreement symbolially and graphially? Why is this point not a solution to the tangeny problem? restart; The following assignments from the text are needed f := x^3 + x; f := x 3 + x g := a*x^2; g := ax 2 G2 := subs( a=2, g ); G2 := 2 x 2 df := diff( f, x ); df := 3 x dg2 := diff( G2, x ); dg2 := 4 x The intersetion(s) of the derivatives an be found using solve( df=dg2, x ); 1, 3 1 The intersetion at x = other intersetion ours at x = 1 is the point of tangeny disussed on page 22. The 1 (this an also be estimated from the plot and 3 the tools provided on the Maple interfae). To omplete this exerise, examine the values of the funtions and their derivatives at x = 1. This produes: 3 Page 2
3 subs( x=1/3, [ f, G2, df, dg2 ] ); ,,, While it is obvious that f and G2 both have slope 4 3 at x = 1, the funtion values 3 1 are not the same. Sine the two funtions do not interset at the point x = 3, this annot be a point of tangeny. Try It! (p. 24) The insertion of an exeution group after the ursor and onversion of a region between text and input are used so often that shortuts are provided on the tool bar. Use balloon help to loate the ions on the tool bar that orrespond to a) inserting a new exeution group after the ursor, b) inserting and formatting inert text, and ) inserting Maple ommands in a text region. These ions are a) the 11th ion from the left in the tool bar ( [ ) b) the 10th ion from the left in the tool bar ( T ) ) the 9th ion from the left in the tool bar ( \Sigma ) Note to Publisher: it would be nie to be able to inlude these ions as inserts in the IG. What do you need to make this possible? 2.2 Using Online Help Try It! (p. 25) The online help page that desribes most features of the Maple worksheet an be aessed using help(worksheet);. Load this help doument. Clik the highlighted string Help System Guide. This opens another help doument. Loate and read the information about searhing the table of ontents. To get started, exeute the following ommand help(worksheet); Note: alternate methods of aessing online help Two alternate methods of aessing the same help doument are to lik on this hyperlink or to exeute the ommand?worksheet Note that the help ommand requires a semi-olon, the? ommand does not. The only other ommand in Maple that does not require a semi-olon or olon is the quit ommand. Following the instrutions in the Try It!, you should see the following setion (whih was inserted into this worksheet via opy and paste) : How do I searh the table of ontents? Choose Contents from the Help menu. The ensuing help page is the top-level table of ontents of the help system. Clik on a hyperlink to see more details. Try It! (p. 27) Plae the ursor on the word plot in the plot ommand toward the bottom of the myseond.mws worksheet. Use ontext-based help to aess the help for the plot ommand. Read this information, and the examples, to find out how to modify the plot ommand to ause f and f to be displayed in blue and the graphs of g and g in red. To get an idea of how the worksheet myseond.mws should appear, obtain a opy of Page 3
4 the worksheet seond.mws from Addison-Wesley or from one of the authors (Meade). The relevant URLs are and To omplete this exerise, the following definitions are needed: f := x^3 + x; f := x 3 + x g := a * x^2; g := ax 2 df := diff( f, x ); df := 3 x G1 := subs( a=2, g ); G1 := 2 x 2 dg1 := subs( a=2, dg ); dg1 := 4 x To reate the plot desribed in the Try It!, it is neessary to speify the olor= option in the plot ommand. The final ommand and plot should look something like: plot( [ f, G1, df, dg1 ], x=-2..2, olor = [ blue, red, blue, red ], title= Graphial verifiation when a=2 ); Graphial verifiation when a= x What If? (p. 37) Suppose the material is heated. How would this hange the stress-strain urve? Would the toughness inrease or derease? Why? As the temperature inreases, the Young s modulus (E) dereases. As a result, assuming the strain is held onstant, the stress ( σ = E ε) also dereases. In terms of the stress-strain urve, the temperature inrease will lower the urve. Sine the lowering of the stress-strain urve redues the area under the urve, the toughness will also be redued. 2.3 Advaned Worksheet Features Page 4
5 Try It! (p. 38) Open the worksheet[howto] help doument. This worksheet ontains a long olletion of setions. Loate and expand the setions related to exeution groups and to setions. Consult these referenes for detailed information about exeution groups and setions. The help doument assoiated with the keyword worksheet[howto] an be aessed via any of the standard methods (hyperlink, help ommand, or? ommand). For example,?worksheet[howto] The information about exeution groups and setions has been opied here for your onveniene. Exeution Groups The exeution group is the fundamental omputation and doumentation element for the worksheet. Eah exeution group is enlosed in a large square braket at the left. The text you are reading now is embedded in an exeution group. It an ontain Maple input ommands, the output from a Maple omputation, explanatory text and graphis. Notie that an exeution group may ontain zero, one, or more Maple input ommands. If you plae the ursor in an input ommand and press [Enter], Maple V exeutes all the input ommands in the urrent exeution group. How do I delete an exeution group? See the setion on Deleting. How do I enlose several exeution groups in a setion? Highlight the exeution groups that you would like to enlose in a setion. Next, hoose Indent from the Format menu. How do I insert an exeution group? See the setion on Inserting. How do I insert text above an exeution group? Clik the exeution group braket (the large square braket to the left of the prompt(s)). Then hoose Paragraph from the Insert menu and Before from the ensuing submenu. How do I insert text below an exeution group? Clik the braket enlosing the exeution group to selet it. Then hoose Paragraph from the Insert menu and After from the ensuing submenu. How do I join exeution groups? See the setion on Joining. How do I remove an exeution group from a setion? Position your ursor in the exeution group that you would like to remove from a setion. Next, hoose Outdent from the Format menu. How do I show (hide) exeution group ranges? By default, Maple V displays the exeution group ranges. To hide them, selet Show Group Ranges from the View menu. Notie that if you return to the View menu, the hek mark beside Show Group Ranges has disappeared. How do I split an exeution group? See Splitting. Also see the setions on Deleting., Inserting, Joining, and Splitting. Setions A setion is enlosed in a large square braket with a box at the top. How do I ollapse a setion? With your mouse, lik on the box ([-]) to the left of the setion heading. How do I ollapse all the setions in a worksheet? Choose Collapse All Setions from the View menu. Page 5
6 How do I delete a setion? See Deleting. How do I enlose one or more exeution groups in a setion? Highlight the exeution groups that you would like to enlose in a setion. Next, hoose Indent from the Format menu. How do I expand a setion? Clik on the box ([+]) to the left of the setion heading. How do I expand all the setions in a worksheet? Choose Expand All Setions from the View menu. How do I insert a setion? See Inserting.. How do I join setions? See Joining. How do I show (hide) setion ranges? Choose Show Setion Ranges from the View menu. How do I split a setion? See Splitting. Problems (pp ) Problem 1 Repeat the graphial and symboli verifiation that a = 2 is another solution to the tangeny problem. Add these results, with appropriate doumentation and explanation to the worksheet mythird.mws. The worksheet third.mws presents one solution to this problem. A opy of the worksheet third.mws an be obtained from Addison-Wesley or from one of the authors (Meade). The relevant URLs are ftp://ftp.aw.om/seng/authors/meade/third.mws and Problem 2 Convert all textual mathematial expressions in the worksheet reated in Problem 1 to inline math expressions. Also, in a new setion at the end of the worksheet, reate hyperlinks to the help douments for eah of the Maple ommands used in this worksheet and to the help douments most relevant to the interfae features used in this worksheet. Call the resulting worksheet myfourth.mws. The worksheet fourth.mws, available from Addison-Wesley or from one of the authors (Meade), provides one possible solution to this problem. The relevant URLs are ftp://ftp.aw.om/seng/authors/meade/fourth.mws and Problem 3 Create a new worksheet, alled referene.mws, that ontains links to examples and help and other introdutory material. Use hyperlinks to reate links to ommonly aessed online help douments, inluding worksheet, worksheet[howto], worksheet[glossary], student, and help. As you progress through this module, you should update this worksheet with new links, summaries of main tehniques, examples, and any other information you find useful. A barebones version of the worksheet referene.mws an be downloaded from Addison-Wesley or from one of the authors (Meade). The relevant URLs are ftp://ftp.aw.om/seng/authors/meade/referenes.mws and Problem 4 Estimate the modulus of toughness of the omposite material disussed in Appliation 2 when the area under the third segment of the stress-strain urve is Page 6
7 approximated by two trapezoides with a ommon side of ε=5.3%. What is the orresponding error in the modulus of toughness, relative to the smallest estimate of the toughness? (What benefit is obtained by using the smallest estimate in this omparison?) In preparation to answer this question we repeat the ommands (with some minor simplifiations) from the Appliation setion of the text (pp ) restart; with(student): pt1 := [0,0]: pt2 := [0.028,330]: pt3 := [ 0.032, 330 ]: pt4 := [ 0.053, 440 ]: pt5 := [ 0.074, 360 ]: E := ( pt2[2]-pt1[2] ) / ( pt2[1] - pt1[1] ); E := tough[elast] := evalf( 1/2 * ( pt2[1] - pt1[1] ) * ( pt2[2] - pt1[2] ), 2 ); tough[onst] := evalf( ( pt3[1] - pt2[1] ) * pt2[2], 2 ); tough[min] := evalf( ( pt5[1] - pt3[1] ) * pt5[2], 2 ) ; tough[max] := evalf( ( pt5[1] - pt3[1] ) * pt4[2], 2 ) ; tough elast := 4.6 tough onst := 1.3 tough min := 15. tough max := 18. Ttough[min] := evalf( tough[elast] + tough[onst] + tough[min], 2 ); Ttough[max] := evalf( tough[elast] + tough[onst] + tough[max], 2 ); Ttough min := 21. Ttough max := 24. Ttough[err] := ( Ttough[max] - Ttough[min] ) / Ttough[min]; Ttough err := QUAD := sigma = a*epsilon^2 + b*epsilon + ; EQ1 := evalf( subs( epsilon=pt3[1], sigma=pt3[2], QUAD ), 2 ); EQ2 := evalf( subs( epsilon=pt4[1], sigma=pt4[2], QUAD ), 2 ); EQ3 := evalf( subs( epsilon=pt5[1], sigma=pt5[2], QUAD ), 2 ); QUAD := σ = aε 2 + bε+ EQ1 := 330. =.0010 a b+ EQ2 := 440. =.0028 a b+ EQ3 := 360. =.0055 a b+ SOLN2 := solve( { EQ1, EQ2, EQ3 }, { a, b, } ): SOLN2 := evalf( SOLN2, 2 ); stress := subs( SOLN2, rhs(quad) ); SOLN2 := { = -210., b = , a = } stress := ε ε 210. tough[quad4r] := rightsum( stress, epsilon= ): tough[quad4r] := evalf( tough[quad4r], 2 ); Ttough[quad4R] := evalf( tough[elast] + tough[onst] + tough[quad4r], 2 ); tough quad4r := 18. Ttough quad4r := 24. tough[quad4t] := evalf( trapezoid( stress, epsilon= ), 2 ); tough quad4t := 16. tough[quad4s] := evalf( simpson( stress, epsilon= ), 2 ); tough quad4s := 17. Ttough[quad4S] := evalf( tough[elast] + tough[onst] + tough[quad4s], 2 ); Page 7
8 Ttough quad4s := 23. error[min] := abs( Ttough[quad4S] - Ttough[min] ) / Ttough[quad4S]; error[max] := abs( Ttough[quad4S] - Ttough[max] ) / Ttough[quad4S]; error[quad4r] := abs( Ttough[quad4S] - Ttough[quad4R] ) / Ttough[quad4S]; error min := error max := error quad4r := And, now, the solution of the urrent problem is found by obtaining the trapezoidal approximation to the toughness between ε =.032 and ε =.074. This is the same as the quad4t approximation exept that the optional seond argument of the trapezoid ommand must be used to indiate that only 2 trapezoids are to be used. tough[quad2t] := trapezoid( stress, epsilon= , 2 ): tough[quad2t] := evalf( tough[quad2t], 2 ); tough quad2t := 16. The total modulus of toughness is Ttough[quad2T] := evalf( tough[elast] + tough[onst] + tough[quad2t], 2 ); Ttough quad2t := 22. The relative error, ompared to the lowest estimate, is error[quad2t] := abs( Ttough[quad2T] - Ttough[min] ) / Ttough[min]; error quad2t := The omputation of the error relative to the lowest estimate is not likely to underestimate the atual error. (This is a result of the fat that the denominator is smaller.) Problem 5 This hapter used rightbox and rightsum to approximate the area under the quadrati urve with the default number of retangles. How many retangles are needed to approximate the area to four digits of auray. (Hint: This question an be answered by trial-and-error; onsult the on-line help for the neessary modifiation to the syntax of rightbox and rightsum.) This solution requires the parts of the Appliation that diretly relate to the omputation of the quadrati setion of the stress-strain urve. restart; with(student): pt3 := [ 0.032, 330 ]: pt4 := [ 0.053, 440 ]: pt5 := [ 0.074, 360 ]: QUAD := sigma = a*epsilon^2 + b*epsilon + ; EQ1 := evalf( subs( epsilon=pt3[1], sigma=pt3[2], QUAD ), 2 ); EQ2 := evalf( subs( epsilon=pt4[1], sigma=pt4[2], QUAD ), 2 ); EQ3 := evalf( subs( epsilon=pt5[1], sigma=pt5[2], QUAD ), 2 ); QUAD := σ = aε 2 + bε+ EQ1 := 330. =.0010 a b+ EQ2 := 440. =.0028 a b+ EQ3 := 360. =.0055 a b+ SOLN2 := solve( { EQ1, EQ2, EQ3 }, { a, b, } ): SOLN2 := evalf( SOLN2, 2 ); stress := subs( SOLN2, rhs(quad) ); SOLN2 := { b= , a = , = -210.} stress := ε ε 210. tough[quad4r] := evalf( rightsum( stress, epsilon= ) ); tough quad4r := Page 8
9 The plan is to double the number of retangles until the first four digits of the approximations stabalize. evalf( rightsum( stress, epsilon= , 8 ) ); evalf( rightsum( stress, epsilon= , 16 ) ); evalf( rightsum( stress, epsilon= , 32 ) ); evalf( rightsum( stress, epsilon= , 64 ) ); evalf( rightsum( stress, epsilon= , 128 ) ); evalf( rightsum( stress, epsilon= , 256 ) ); evalf( rightsum( stress, epsilon= , 512 ) ); At this point it an now be said that the four-digit approximation to the area under the stress-strain urve for <= ε <= is This estimate is obtained with 128 retangles. Problem 6 Repeat the previous problem with trapezoid and simpson. What do these results tell you about the approximation errors assoiated with the use of retangles, trapezoids, and quadratis to approximate the area under the parabola? This solution requires the parts of the Appliation that diretly relate to the omputation of the quadrati setion of the stress-strain urve. restart; with(student): pt3 := [ 0.032, 330 ]: pt4 := [ 0.053, 440 ]: pt5 := [ 0.074, 360 ]: QUAD := sigma = a*epsilon^2 + b*epsilon + ; EQ1 := evalf( subs( epsilon=pt3[1], sigma=pt3[2], QUAD ), 2 ); EQ2 := evalf( subs( epsilon=pt4[1], sigma=pt4[2], QUAD ), 2 ); EQ3 := evalf( subs( epsilon=pt5[1], sigma=pt5[2], QUAD ), 2 ); QUAD := σ = aε 2 + bε+ EQ1 := 330. =.0010 a b+ EQ2 := 440. =.0028 a b+ EQ3 := 360. =.0055 a b+ SOLN2 := solve( { EQ1, EQ2, EQ3 }, { a, b, } ): SOLN2 := evalf( SOLN2, 2 ); stress := subs( SOLN2, rhs(quad) ); SOLN2 := { = -210., b = , a = } stress := ε ε 210. The doubling algorithm used in Problem 5 will be used here with trapezoid and simpson replaing rightsum. To begin the searh for the four-digit approximation with trapezoid, reall the approximation obtained in the Appliation tough[quad4t] := evalf( trapezoid( stress, epsilon= ) ); tough quad4t := evalf( trapezoid( stress, epsilon= , 8 ) ); evalf( trapezoid( stress, epsilon= , 16 ) ); Page 9
10 evalf( trapezoid( stress, epsilon= , 32 ) ); evalf( trapezoid( stress, epsilon= , 64 ) ); evalf( trapezoid( stress, epsilon= , 128 ) ); evalf( rightsum( stress, epsilon= , 256 ) ); evalf( rightsum( stress, epsilon= , 512 ) ); As in Problem 5, the four-digit approximation to the area under the stress-strain urve for <= ε <= is But, now this estimate is obtained with only 64 retangles. For Simpson s Rule we begin by realling the estimate when four subintervals (two parabolas) are used to estimate the area tough[quad4s] := evalf( simpson( stress, epsilon= ) ); tough quad4s := As the number of subintervals is doubled: evalf( simpson( stress, epsilon= , 8 ) ); evalf( simpson( stress, epsilon= , 16 ) ); These results do not hange as the number of subintervals is inreased (exept possibly for the last digit - whih is not signifiant). The reason for this is that the stress is a quadrati funtion and Simpson s Rule is exat for quadrati funtions. The four-digit approximation agrees with our previous results, but is obtained with muh less work (in fat, only 2 subintervals are needed). evalf( simpson( stress, epsilon= , 2 ) ); While this is only one example, the fat that the different quadrature rules have different onvergene rates. The onvergene rate for Simpson s Rule, whih uses quadrati approximations to the funtion, is faster than the Trapezoid Rule, whih uses linear funtions. And, the "Right-Hand" Rule, whih uses onstants to approximate the funtion, requires the most subintervals to obtain the same auray. Problem 7 The integral of a nonnegative funtion is the limit of the area of retangles. In the previous problems, you estimated the area under the quadrati urve to two digits of auray. Compute the exat area under the urve as an integral. First, use the online help to find the Maple ommand for omputing definite integrals. How does this value ompare to the approximation in this hapter and in Problem 6? Corretion The previous problems estimated the area under the quadrati urve to four (not two) digits of auray. This does not hange the urrent problem in any way. This solution requires the parts of the Appliation that diretly relate to the omputation of the quadrati setion of the stress-strain urve. restart; with(student): pt3 := [ 0.032, 330 ]: pt4 := [ 0.053, 440 ]: pt5 := [ 0.074, 360 ]: Page 10
11 QUAD := sigma = a*epsilon^2 + b*epsilon + ; EQ1 := evalf( subs( epsilon=pt3[1], sigma=pt3[2], QUAD ), 2 ); EQ2 := evalf( subs( epsilon=pt4[1], sigma=pt4[2], QUAD ), 2 ); EQ3 := evalf( subs( epsilon=pt5[1], sigma=pt5[2], QUAD ), 2 ); QUAD := σ = aε 2 + bε+ EQ1 := 330. =.0010 a b+ EQ2 := 440. =.0028 a b+ EQ3 := 360. =.0055 a b+ SOLN2 := solve( { EQ1, EQ2, EQ3 }, { a, b, } ): SOLN2 := evalf( SOLN2, 2 ); stress := subs( SOLN2, rhs(quad) ); SOLN2 := { = -210., b = , a = } stress := ε ε 210. This problem an be solved using either int or Int. The advantage of using Int is that it gives the user a hane to hek that the orret integral has been entered before the alulation is performed. tough[exat] := Int( stress, epsilon= ); := tough exat ε ε 210. dε tough[exat] := evalf( tough[exat] ); tough exat := Note that this result is exatly the same as the result obtained by Simpson s Rule in Problem 6. This is further verifiation that Simpson s Rule is exat for this problem. Problem 8 Investigate the usage of stats[fit] as a means of fitting the data to a quadrati funtion. Verify results in a worksheet. Then ollet more data, and ompute the revised fit and orresponding ontribution to the modulus of toughness. Investigate the benefits of olleting more data and using fit to obtain a better approximation to the Young s modulus. There are many ways to approah this problem. For information on the fit ommand, see the setion Least Squares Fit to Data (p. 105) in Chapter 4. Problem 9 This hapter presented tehniques for the insertion of new setions, exeution groups, text regions, and other ommon elements of a Maple worksheet. Elements an also be removed from a worksheet. The only menu seletion that relates to deletion is Delete Paragraph (under Edit). Use the on-line help to learn how to delete a setion and exeution group. See the worksheet,howto help doument. If you look at the Exeution Group or Setion setion you will be referred to the Deleting setion. These onnetions are made via bookmarks (whih are not otherwise disussed in this module). For more information about bookmarks, see the Bookmarks setion in the worksheet,howto help doument. Problem 10 Create doumented worksheets, inluding hyperlinks to relevant help douments for the solution to Example1-1 and for the five-step problem-solving proess used to analyze Appliation 1 in Chapter 1. s are similar to previously disussed sample worksheets. No detailed solution provided. Page 11
12 Page 12
OvidSP Quick Reference Card
OvidSP Quik Referene Card Searh in any of several dynami modes, ombine results, apply limits, use improved researh tools, develop strategies, save searhes, set automati alerts and RSS feeds, share results...
More informationUCSB Math TI-85 Tutorials: Basics
3 UCSB Math TI-85 Tutorials: Basis If your alulator sreen doesn t show anything, try adjusting the ontrast aording to the instrutions on page 3, or page I-3, of the alulator manual You should read the
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Page 1 of 7 Connetion Guide Installing the printer loally (Windows) Note: When installing a loally attahed printer, if the operating system is not supported y the Software and Doumentation CD, then the
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationReading Object Code. A Visible/Z Lesson
Reading Objet Code A Visible/Z Lesson The Idea: When programming in a high-level language, we rarely have to think about the speifi ode that is generated for eah instrution by a ompiler. But as an assembly
More informationAlgorithms for External Memory Lecture 6 Graph Algorithms - Weighted List Ranking
Algorithms for External Memory Leture 6 Graph Algorithms - Weighted List Ranking Leturer: Nodari Sithinava Sribe: Andi Hellmund, Simon Ohsenreither 1 Introdution & Motivation After talking about I/O-effiient
More information1. The collection of the vowels in the word probability. 2. The collection of real numbers that satisfy the equation x 9 = 0.
C HPTER 1 SETS I. DEFINITION OF SET We begin our study of probability with the disussion of the basi onept of set. We assume that there is a ommon understanding of what is meant by the notion of a olletion
More informationType of document: Usebility Checklist
Projet: JEGraph Type of doument: Usebility Cheklist Author: Max Bryan Version: 1.30 2011 Envidate GmbH Type of Doumet Developer guidelines User guidelines Dutybook Speifiation Programming and testing Test
More informationVideo Data and Sonar Data: Real World Data Fusion Example
14th International Conferene on Information Fusion Chiago, Illinois, USA, July 5-8, 2011 Video Data and Sonar Data: Real World Data Fusion Example David W. Krout Applied Physis Lab dkrout@apl.washington.edu
More informationConnection Guide. Installing the printer locally (Windows) What is local printing? Installing the printer using the Software and Documentation CD
Connetion Guide Page 1 of 5 Connetion Guide Installing the printer loally (Windows) Note: If the Software and Doumentation CD does not support the operating system, you must use the Add Printer Wizard.
More informationWORKSHOP 20 CREATING PCL FUNCTIONS
WORKSHOP 20 CREATING PCL FUNCTIONS WS20-1 WS20-2 Problem Desription This exerise involves reating two PCL funtions that an be used to easily hange the view of a model. The PCL funtions are reated by reording
More informationGraphs in L A TEX. Robert A. Beeler. January 8, 2017
Graphs in L A TEX Robert A. Beeler January 8, 2017 1 Introdution This doument is to provide a quik and dirty guide for building graphs in L A TEX. Muh of the doument is devoted to examples of things that
More informationOn - Line Path Delay Fault Testing of Omega MINs M. Bellos 1, E. Kalligeros 1, D. Nikolos 1,2 & H. T. Vergos 1,2
On - Line Path Delay Fault Testing of Omega MINs M. Bellos, E. Kalligeros, D. Nikolos,2 & H. T. Vergos,2 Dept. of Computer Engineering and Informatis 2 Computer Tehnology Institute University of Patras,
More informationCleanUp: Improving Quadrilateral Finite Element Meshes
CleanUp: Improving Quadrilateral Finite Element Meshes Paul Kinney MD-10 ECC P.O. Box 203 Ford Motor Company Dearborn, MI. 8121 (313) 28-1228 pkinney@ford.om Abstrat: Unless an all quadrilateral (quad)
More informationAnalysis of input and output configurations for use in four-valued CCD programmable logic arrays
nalysis of input and output onfigurations for use in four-valued D programmable logi arrays J.T. utler H.G. Kerkhoff ndexing terms: Logi, iruit theory and design, harge-oupled devies bstrat: s in binary,
More informationCalculation of typical running time of a branch-and-bound algorithm for the vertex-cover problem
Calulation of typial running time of a branh-and-bound algorithm for the vertex-over problem Joni Pajarinen, Joni.Pajarinen@iki.fi Otober 21, 2007 1 Introdution The vertex-over problem is one of a olletion
More informationAdobe Certified Associate
Adobe Certified Assoiate About the Adobe Certified Assoiate (ACA) Program The Adobe Certified Assoiate (ACA) program is for graphi designers, Web designers, video prodution designers, and digital professionals
More informationTLP 350CV Setup Guide
TLP 350V Setup Guide The Extron TouhLink 3.5 inh able ubby TLP 350V provide users with aess to AV onnetivity using onvenient pullout ables. It also provides simple and versatile onfiguration and ontrol
More informationStarter Kit B80 User Guide. Version: 01 DocId: Starter_Kit_B80_v01. User Guide
Starter Kit B80 User Guide Version: 01 DoId: Starter_Kit_B80_v01 User Guide User Guide: Starter Kit B80 User Guide Version: 01 Date: 2012-08-14 DoId: Status Starter_Kit_B80_v01 GENERAL NOTE THE USE OF
More informationTriangles. Learning Objectives. Pre-Activity
Setion 3.2 Pre-tivity Preparation Triangles Geena needs to make sure that the dek she is building is perfetly square to the brae holding the dek in plae. How an she use geometry to ensure that the boards
More informationThe Happy Ending Problem
The Happy Ending Problem Neeldhara Misra STATUTORY WARNING This doument is a draft version 1 Introdution The Happy Ending problem first manifested itself on a typial wintery evening in 1933 These evenings
More informationAn Event Display for ATLAS H8 Pixel Test Beam Data
An Event Display for ATLAS H8 Pixel Test Beam Data George Gollin Centre de Physique des Partiules de Marseille and University of Illinois April 17, 1999 g-gollin@uiu.edu An event display program is now
More informationLearning Convention Propagation in BeerAdvocate Reviews from a etwork Perspective. Abstract
CS 9 Projet Final Report: Learning Convention Propagation in BeerAdvoate Reviews from a etwork Perspetive Abstrat We look at the way onventions propagate between reviews on the BeerAdvoate dataset, and
More information13.1 Numerical Evaluation of Integrals Over One Dimension
13.1 Numerial Evaluation of Integrals Over One Dimension A. Purpose This olletion of subprograms estimates the value of the integral b a f(x) dx where the integrand f(x) and the limits a and b are supplied
More informationCA Agile Requirements Designer 2.x Implementation Proven Professional Exam (CAT-720) Study Guide Version 1.0
Exam (CAT-720) Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationIntroductory Programming, IMM, DTU Systematic Software Test. Software test (afprøvning) Motivation. Structural test and functional test
Introdutory Programming, IMM, DTU Systemati Software Test Peter Sestoft a Programs often ontain unintended errors how do you find them? Strutural test Funtional test Notes: Systemati Software Test, http://www.dina.kvl.dk/
More informationCA Test Data Manager 4.x Implementation Proven Professional Exam (CAT-681) Study Guide Version 1.0
Implementation Proven Professional Study Guide Version 1.0 PROPRIETARY AND CONFIDENTIAL INFORMATION 2017 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer
More informationAutomatic Physical Design Tuning: Workload as a Sequence Sanjay Agrawal Microsoft Research One Microsoft Way Redmond, WA, USA +1-(425)
Automati Physial Design Tuning: Workload as a Sequene Sanjay Agrawal Mirosoft Researh One Mirosoft Way Redmond, WA, USA +1-(425) 75-357 sagrawal@mirosoft.om Eri Chu * Computer Sienes Department University
More informationThe Minimum Redundancy Maximum Relevance Approach to Building Sparse Support Vector Machines
The Minimum Redundany Maximum Relevane Approah to Building Sparse Support Vetor Mahines Xiaoxing Yang, Ke Tang, and Xin Yao, Nature Inspired Computation and Appliations Laboratory (NICAL), Shool of Computer
More informationDetection and Recognition of Non-Occluded Objects using Signature Map
6th WSEAS International Conferene on CIRCUITS, SYSTEMS, ELECTRONICS,CONTROL & SIGNAL PROCESSING, Cairo, Egypt, De 9-31, 007 65 Detetion and Reognition of Non-Oluded Objets using Signature Map Sangbum Park,
More informationA {k, n}-secret Sharing Scheme for Color Images
A {k, n}-seret Sharing Sheme for Color Images Rastislav Luka, Konstantinos N. Plataniotis, and Anastasios N. Venetsanopoulos The Edward S. Rogers Sr. Dept. of Eletrial and Computer Engineering, University
More informationSCREEN LAYOUT AND HANDLING
Sreen layout & handling SCREEN LAYOUT AND HANDLING Generally, 7-1 Keyboard shortuts, 7-3 Keyboard Must Know, 7-5 Generally It is not intended that the manual or on-line Help should replae knowledge of
More informationFinding the Equation of a Straight Line
Finding the Equation of a Straight Line You should have, before now, ome aross the equation of a straight line, perhaps at shool. Engineers use this equation to help determine how one quantity is related
More information1 The Knuth-Morris-Pratt Algorithm
5-45/65: Design & Analysis of Algorithms September 26, 26 Leture #9: String Mathing last hanged: September 26, 27 There s an entire field dediated to solving problems on strings. The book Algorithms on
More informationSystem-Level Parallelism and Throughput Optimization in Designing Reconfigurable Computing Applications
System-Level Parallelism and hroughput Optimization in Designing Reonfigurable Computing Appliations Esam El-Araby 1, Mohamed aher 1, Kris Gaj 2, arek El-Ghazawi 1, David Caliga 3, and Nikitas Alexandridis
More informationOptimizing Correlated Path Queries in XML Languages. Technical Report CS November 2002
Optimizing Correlated Path Queries in XML Languages Ning Zhang and M. Tamer Özsu Tehnial Report CS-2002-36 November 2002 Shool Of Computer Siene, University of Waterloo, {nzhang,tozsu}@uwaterloo.a 1 Abstrat
More informationCA Release Automation 5.x Implementation Proven Professional Exam (CAT-600) Study Guide Version 1.1
Exam (CAT-600) Study Guide Version 1.1 PROPRIETARY AND CONFIDENTIAL INFORMATION 2016 CA. All rights reserved. CA onfidential & proprietary information. For CA, CA Partner and CA Customer use only. No unauthorized
More informationDirect-Mapped Caches
A Case for Diret-Mapped Cahes Mark D. Hill University of Wisonsin ahe is a small, fast buffer in whih a system keeps those parts, of the ontents of a larger, slower memory that are likely to be used soon.
More informationDrawing lines. Naïve line drawing algorithm. drawpixel(x, round(y)); double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx; double y = y0;
Naïve line drawing algorithm // Connet to grid points(x0,y0) and // (x1,y1) by a line. void drawline(int x0, int y0, int x1, int y1) { int x; double dy = y1 - y0; double dx = x1 - x0; double m = dy / dx;
More informationDesign Patterns. Patterns.mkr Page 223 Wednesday, August 25, :17 AM
Patterns.mkr Page 223 Wednesday, August 25, 1999 2:17 AM Design Patterns n the earlier hapters, we have seen that a entral goal of objet-oriented programming is the support of ode reuse. This hapter examines
More informationPipelined Multipliers for Reconfigurable Hardware
Pipelined Multipliers for Reonfigurable Hardware Mithell J. Myjak and José G. Delgado-Frias Shool of Eletrial Engineering and Computer Siene, Washington State University Pullman, WA 99164-2752 USA {mmyjak,
More informationExtracting Partition Statistics from Semistructured Data
Extrating Partition Statistis from Semistrutured Data John N. Wilson Rihard Gourlay Robert Japp Mathias Neumüller Department of Computer and Information Sienes University of Strathlyde, Glasgow, UK {jnw,rsg,rpj,mathias}@is.strath.a.uk
More informationA Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks
A Partial Sorting Algorithm in Multi-Hop Wireless Sensor Networks Abouberine Ould Cheikhna Department of Computer Siene University of Piardie Jules Verne 80039 Amiens Frane Ould.heikhna.abouberine @u-piardie.fr
More informationOutline: Software Design
Outline: Software Design. Goals History of software design ideas Design priniples Design methods Life belt or leg iron? (Budgen) Copyright Nany Leveson, Sept. 1999 A Little History... At first, struggling
More informationAlgorithms, Mechanisms and Procedures for the Computer-aided Project Generation System
Algorithms, Mehanisms and Proedures for the Computer-aided Projet Generation System Anton O. Butko 1*, Aleksandr P. Briukhovetskii 2, Dmitry E. Grigoriev 2# and Konstantin S. Kalashnikov 3 1 Department
More informationZDT -A Debugging Program for the Z80
ZDT -A Debugging Program for the Z80 il I,, 1651 Third Ave.. New York, N.Y. 10028 (212) 860-o300 lnt'l Telex 220501 ZOT - A DEBUGGING PROGRAM FOR THE ZAO Distributed by: Lifeboat Assoiates 1651 Third Avenue
More informationDetecting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry
Deteting Moving Targets in Clutter in Airborne SAR via Keystoning and Multiple Phase Center Interferometry D. M. Zasada, P. K. Sanyal The MITRE Corp., 6 Eletroni Parkway, Rome, NY 134 (dmzasada, psanyal)@mitre.org
More informationContents Contents...I List of Tables...VIII List of Figures...IX 1. Introduction Information Retrieval... 8
Contents Contents...I List of Tables...VIII List of Figures...IX 1. Introdution... 1 1.1. Internet Information...2 1.2. Internet Information Retrieval...3 1.2.1. Doument Indexing...4 1.2.2. Doument Retrieval...4
More informationDECT Module Installation Manual
DECT Module Installation Manual Rev. 2.0 This manual desribes the DECT module registration method to the HUB and fan airflow settings. In order for the HUB to ommuniate with a ompatible fan, the DECT module
More informationHEXA: Compact Data Structures for Faster Packet Processing
Washington University in St. Louis Washington University Open Sholarship All Computer Siene and Engineering Researh Computer Siene and Engineering Report Number: 27-26 27 HEXA: Compat Data Strutures for
More informationPASCAL 64. "The" Pascal Compiler for the Commodore 64. A Data Becker Product. >AbacusiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510
PASCAL 64 "The" Pasal Compiler for the Commodore 64 A Data Beker Produt >AbausiII Software P.O. BOX 7211 GRAND RAPIDS, MICK 49510 7010 COPYRIGHT NOTICE ABACUS Software makes this pakage available for use
More informationDepartment of Electrical Engineering and Computer Science MASSACHUSETTS INSTITUTE OF TECHNOLOGY Fall Test I Solutions
Department of Eletrial Engineering and Computer iene MAACHUETT INTITUTE OF TECHNOLOGY 6.035 Fall 2016 Test I olutions 1 I Regular Expressions and Finite-tate Automata For Questions 1, 2, and 3, let the
More informationRelevance for Computer Vision
The Geometry of ROC Spae: Understanding Mahine Learning Metris through ROC Isometris, by Peter A. Flah International Conferene on Mahine Learning (ICML-23) http://www.s.bris.a.uk/publiations/papers/74.pdf
More informationSemi-Supervised Affinity Propagation with Instance-Level Constraints
Semi-Supervised Affinity Propagation with Instane-Level Constraints Inmar E. Givoni, Brendan J. Frey Probabilisti and Statistial Inferene Group University of Toronto 10 King s College Road, Toronto, Ontario,
More informationAdapting K-Medians to Generate Normalized Cluster Centers
Adapting -Medians to Generate Normalized Cluster Centers Benamin J. Anderson, Deborah S. Gross, David R. Musiant Anna M. Ritz, Thomas G. Smith, Leah E. Steinberg Carleton College andersbe@gmail.om, {dgross,
More informationGraph-Based vs Depth-Based Data Representation for Multiview Images
Graph-Based vs Depth-Based Data Representation for Multiview Images Thomas Maugey, Antonio Ortega, Pasal Frossard Signal Proessing Laboratory (LTS), Eole Polytehnique Fédérale de Lausanne (EPFL) Email:
More informationPathRings. Manual. Version 1.0. Yongnan Zhu December 16,
PathRings Version 1.0 Manual Yongnan Zhu E-mail: yongnan@umb.edu Deember 16, 2014-1 - PathRings This tutorial introdues PathRings, the user interfae and the interation. For better to learn, you will need
More informationAn Optimized Approach on Applying Genetic Algorithm to Adaptive Cluster Validity Index
IJCSES International Journal of Computer Sienes and Engineering Systems, ol., No.4, Otober 2007 CSES International 2007 ISSN 0973-4406 253 An Optimized Approah on Applying Geneti Algorithm to Adaptive
More informationIncremental Mining of Partial Periodic Patterns in Time-series Databases
CERIAS Teh Report 2000-03 Inremental Mining of Partial Periodi Patterns in Time-series Dataases Mohamed G. Elfeky Center for Eduation and Researh in Information Assurane and Seurity Purdue University,
More informationAn Efficient and Scalable Approach to CNN Queries in a Road Network
An Effiient and Salable Approah to CNN Queries in a Road Network Hyung-Ju Cho Chin-Wan Chung Dept. of Eletrial Engineering & Computer Siene Korea Advaned Institute of Siene and Tehnology 373- Kusong-dong,
More informationA DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR
Malaysian Journal of Computer Siene, Vol 10 No 1, June 1997, pp 36-41 A DYNAMIC ACCESS CONTROL WITH BINARY KEY-PAIR Md Rafiqul Islam, Harihodin Selamat and Mohd Noor Md Sap Faulty of Computer Siene and
More informationA Novel Bit Level Time Series Representation with Implication of Similarity Search and Clustering
A Novel Bit Level Time Series Representation with Impliation of Similarity Searh and lustering hotirat Ratanamahatana, Eamonn Keogh, Anthony J. Bagnall 2, and Stefano Lonardi Dept. of omputer Siene & Engineering,
More informationVolume 3, Issue 9, September 2013 International Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 9, September 2013 ISSN: 2277 128X International Journal of Advaned Researh in Computer Siene and Software Engineering Researh Paper Available online at: www.ijarsse.om A New-Fangled Algorithm
More informationSeries/1 GA File No i=:: IBM Series/ Battery Backup Unit Description :::5 ~ ~ >-- ffi B~88 ~0 (] II IIIIII
Series/1 I. (.. GA34-0032-0 File No. 51-10 a i=:: 5 Q 1 IBM Series/1 4999 Battery Bakup Unit Desription B88 0 (] o. :::5 >-- ffi "- I II1111111111IIIIII1111111 ---- - - - - ----- --_.- Series/1 «h: ",
More informationSparse Certificates for 2-Connectivity in Directed Graphs
Sparse Certifiates for 2-Connetivity in Direted Graphs Loukas Georgiadis Giuseppe F. Italiano Aikaterini Karanasiou Charis Papadopoulos Nikos Parotsidis Abstrat Motivated by the emergene of large-sale
More informationZ Combinatorial Filters: Sensor Beams, Obstacles, and Possible Paths
Z Combinatorial Filters: Sensor Beams, Obstales, and Possible Paths BENJAMIN TOVAR, Northwestern University FRED COHEN, University of Rohester LEONARDO BOBADILLA, University of Illinois JUSTIN CZARNOWSKI,
More informationLAB 4: Operations on binary images Histograms and color tables
LAB 4: Operations on binary images Histograms an olor tables Computer Vision Laboratory Linköping University, Sween Preparations an start of the lab system You will fin a ouple of home exerises (marke
More informationthe data. Structured Principal Component Analysis (SPCA)
Strutured Prinipal Component Analysis Kristin M. Branson and Sameer Agarwal Department of Computer Siene and Engineering University of California, San Diego La Jolla, CA 9193-114 Abstrat Many tasks involving
More informationMATH STUDENT BOOK. 12th Grade Unit 6
MATH STUDENT BOOK 12th Grade Unit 6 Unit 6 TRIGONOMETRIC APPLICATIONS MATH 1206 TRIGONOMETRIC APPLICATIONS INTRODUCTION 3 1. TRIGONOMETRY OF OBLIQUE TRIANGLES 5 LAW OF SINES 5 AMBIGUITY AND AREA OF A TRIANGLE
More informationA Load-Balanced Clustering Protocol for Hierarchical Wireless Sensor Networks
International Journal of Advanes in Computer Networks and Its Seurity IJCNS A Load-Balaned Clustering Protool for Hierarhial Wireless Sensor Networks Mehdi Tarhani, Yousef S. Kavian, Saman Siavoshi, Ali
More informationrepresent = as a finite deimal" either in base 0 or in base. We an imagine that the omputer first omputes the mathematial = then rounds the result to
Sientifi Computing Chapter I Computer Arithmeti Jonathan Goodman Courant Institute of Mathemaial Sienes Last revised January, 00 Introdution One of the many soures of error in sientifi omputing is inexat
More informationWhat are Cycle-Stealing Systems Good For? A Detailed Performance Model Case Study
What are Cyle-Stealing Systems Good For? A Detailed Performane Model Case Study Wayne Kelly and Jiro Sumitomo Queensland University of Tehnology, Australia {w.kelly, j.sumitomo}@qut.edu.au Abstrat The
More informationWe P9 16 Eigenray Tracing in 3D Heterogeneous Media
We P9 Eigenray Traing in 3D Heterogeneous Media Z. Koren* (Emerson), I. Ravve (Emerson) Summary Conventional two-point ray traing in a general 3D heterogeneous medium is normally performed by a shooting
More informationBSPLND, A B-Spline N-Dimensional Package for Scattered Data Interpolation
BSPLND, A B-Spline N-Dimensional Pakage for Sattered Data Interpolation Mihael P. Weis Traker Business Systems 85 Terminal Drive, Suite Rihland, WA 995-59-946-544 mike@vidian.net Robert R. Lewis Washington
More informationTavultesoft Keyboard Manager. User s Guide and Reference. Tavultesoft
Tavultesoft Keyboard Manager User s Guide and Referene VERSION 4.0 Tavultesoft This doumentation may be freely opied, but the opyright notie must not be altered or removed. No part of this doumentation
More informationColouring contact graphs of squares and rectilinear polygons de Berg, M.T.; Markovic, A.; Woeginger, G.
Colouring ontat graphs of squares and retilinear polygons de Berg, M.T.; Markovi, A.; Woeginger, G. Published in: nd European Workshop on Computational Geometry (EuroCG 06), 0 Marh - April, Lugano, Switzerland
More informationZ Combinatorial Filters: Sensor Beams, Obstacles, and Possible Paths
Z Combinatorial Filters: Sensor Beams, Obstales, and Possible Paths BENJAMIN TOVAR, Northwestern University FRED COHEN, University of Rohester LEONARDO BOBADILLA, University of Illinois JUSTIN CZARNOWSKI,
More informationOFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM S. SRIDARAN. Thesis submitted to the Faculty of the
OFF-LINE ROBOT VISION SYSTEM PROGRAMMING USING A COMPUTER AIDED DESIGN SYSTEM by S. SRIDARAN Thesis submitted to the Faulty of the Virginia Polytehni Institute and State University in partial fulfillment
More informationINTERPOLATED AND WARPED 2-D DIGITAL WAVEGUIDE MESH ALGORITHMS
Proeedings of the COST G-6 Conferene on Digital Audio Effets (DAFX-), Verona, Italy, Deember 7-9, INTERPOLATED AND WARPED -D DIGITAL WAVEGUIDE MESH ALGORITHMS Vesa Välimäki Lab. of Aoustis and Audio Signal
More informationAutomated System for the Study of Environmental Loads Applied to Production Risers Dustin M. Brandt 1, Celso K. Morooka 2, Ivan R.
EngOpt 2008 - International Conferene on Engineering Optimization Rio de Janeiro, Brazil, 01-05 June 2008. Automated System for the Study of Environmental Loads Applied to Prodution Risers Dustin M. Brandt
More informationDynamic Programming. Lecture #8 of Algorithms, Data structures and Complexity. Joost-Pieter Katoen Formal Methods and Tools Group
Dynami Programming Leture #8 of Algorithms, Data strutures and Complexity Joost-Pieter Katoen Formal Methods and Tools Group E-mail: katoen@s.utwente.nl Otober 29, 2002 JPK #8: Dynami Programming ADC (214020)
More informationTitle: Time-Based Tree Graphs for Stabilized Force Structure Representations
Paper for the 8 th International Command & Control Researh & Tehnology Symposium Title: Time-Based Tree Graphs for Stabilized Fore Struture Representations Submitted by: Sam Chamberlain U.S. Army Researh
More informationPBFT: A Byzantine Renaissance. The Setup. What could possibly go wrong? The General Idea. Practical Byzantine Fault-Tolerance (CL99, CL00)
PBFT: A Byzantine Renaissane Pratial Byzantine Fault-Tolerane (CL99, CL00) first to be safe in asynhronous systems live under weak synhrony assumptions -Byzantine Paos! The Setup Crypto System Model Asynhronous
More informationthe machine and check the components Basic User s Guide
Quik Setup Guide Start Here MFC-7860DW Please read the Safety and Legal ooklet first efore you set up your mahine. Then, please read this Quik Setup Guide for the orret setup and installation. To view
More informationStable Road Lane Model Based on Clothoids
Stable Road Lane Model Based on Clothoids C Gakstatter*, S Thomas**, Dr P Heinemann*, Prof Gudrun Klinker*** *Audi Eletronis Venture GmbH, **Leibniz Universität Hannover, ***Tehnishe Universität Münhen
More information特集 Road Border Recognition Using FIR Images and LIDAR Signal Processing
デンソーテクニカルレビュー Vol. 15 2010 特集 Road Border Reognition Using FIR Images and LIDAR Signal Proessing 高木聖和 バーゼル ファルディ Kiyokazu TAKAGI Basel Fardi ヘンドリック ヴァイゲル Hendrik Weigel ゲルド ヴァニーリック Gerd Wanielik This paper
More informationConnection Guide. Supported operating systems. Installing the printer using the Software and Documentation CD. Connection Guide
Connetion Guide Page 1 of 6 Connetion Guide Supported operating systems Using the software CD, you an install the printer software on the following operating systems: Windows 8.1 Windows Server 2012 R2
More informationBoundary Correct Real-Time Soft Shadows
Boundary Corret Real-Time Soft Shadows Bjarke Jakobsen Niels J. Christensen Bent D. Larsen Kim S. Petersen Informatis and Mathematial Modelling Tehnial University of Denmark {bj, nj, bdl}@imm.dtu.dk, kim@deadline.dk
More informationConstructing Hierarchies for Triangle Meshes
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS VOL. 4 NO. APRIL-JUNE 1998 145 Construting Hierarhies for Triangle Meshes Tran S. Gieng Bernd Hamann Member IEEE Kenneth I. Joy Member IEEE Gregory
More informationEXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Distribution Category UC-705 EXODUS II: A Finite Element Data Model Larry A. Shoof, Vitor R. Yarberry Computational Mehanis and Visualization Department
More informationInterconnection Styles
Interonnetion tyles oftware Design Following the Export (erver) tyle 2 M1 M4 M5 4 M3 M6 1 3 oftware Design Following the Export (Client) tyle e 2 e M1 M4 M5 4 M3 M6 1 e 3 oftware Design Following the Export
More informationTree Awareness for Relational DBMS Kernels: Staircase Join
Tree Awareness for Relational DBMS Kernels: Stairase Join Torsten Grust 1 and Maurie van Keulen 2 1 Department of Computer and Information Siene, University of Konstanz, P.O. Box D188, 78457 Konstanz,
More informationEvolutionary Feature Synthesis for Image Databases
Evolutionary Feature Synthesis for Image Databases Anlei Dong, Bir Bhanu, Yingqiang Lin Center for Researh in Intelligent Systems University of California, Riverside, California 92521, USA {adong, bhanu,
More informationGray Codes for Reflectable Languages
Gray Codes for Refletable Languages Yue Li Joe Sawada Marh 8, 2008 Abstrat We lassify a type of language alled a refletable language. We then develop a generi algorithm that an be used to list all strings
More informationSAND Unlimited Release Printed November 1995 Updated November 29, :26 PM EXODUS II: A Finite Element Data Model
SAND92-2137 Unlimited Release Printed November 1995 Updated November 29, 2006 12:26 PM EXODUS II: A Finite Element Data Model Gregory D. Sjaardema (updated version) Larry A. Shoof, Vitor R. Yarberry Computational
More informationAN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING
AN INTRODUCTION TO FORTRAN AND NUMERICAL MODELING Dr. L. W. Shwartz Department of Mehanial Engineering University of Delaware September, 2000 INTRODUCTION The first part of this short doument ontains a
More informationCOST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY
COST PERFORMANCE ASPECTS OF CCD FAST AUXILIARY MEMORY Dileep P, Bhondarkor Texas Instruments Inorporated Dallas, Texas ABSTRACT Charge oupled devies (CCD's) hove been mentioned as potential fast auxiliary
More informationParametric Abstract Domains for Shape Analysis
Parametri Abstrat Domains for Shape Analysis Xavier RIVAL (INRIA & Éole Normale Supérieure) Joint work with Bor-Yuh Evan CHANG (University of Maryland U University of Colorado) and George NECULA (University
More informationQuery Evaluation Overview. Query Optimization: Chap. 15. Evaluation Example. Cost Estimation. Query Blocks. Query Blocks
Query Evaluation Overview Query Optimization: Chap. 15 CS634 Leture 12 SQL query first translated to relational algebra (RA) Atually, some additional operators needed for SQL Tree of RA operators, with
More informationA Novel Validity Index for Determination of the Optimal Number of Clusters
IEICE TRANS. INF. & SYST., VOL.E84 D, NO.2 FEBRUARY 2001 281 LETTER A Novel Validity Index for Determination of the Optimal Number of Clusters Do-Jong KIM, Yong-Woon PARK, and Dong-Jo PARK, Nonmembers
More information