Welcome to the Three Ring %CIRCOS: An Example of Creating a Circular Graph without a Polar Axis
|
|
- Shona Patience Lindsey
- 5 years ago
- Views:
Transcription
1 PharmaSUG Paper DV14 Welcome to the Three Rng %CIRCOS: An Example of Creatng a Crcular Graph wthout a Polar Axs Jeffrey Meyers, Mayo Clnc ABSTRACT An nternal graphcs challenge between SAS and R programmers wthn Mayo Clnc led to the creaton of a CIRCOS plot wth the SAS 9.4M3 features. A CIRCOS plot s a crcular vsualzaton of the relatonshp between objects, postons and other tme-pont related data. The CIRCOS plot features a curved rectangle for each node or object around the permeter of the crcle, and a Bézer curve for each path between nodes that s pulled towards the center of the crcle. Each rectangle and curve s sze s determned by ther proporton of the total populaton. The prmary challenge of creatng ths plot wth the current SAS SG procedures s that these procedures do not nclude polar axes to smplfy plottng crcular or curved objects. The macro %CIRCOS s an example of overcomng these lmtatons creatvely usng trgonometry to prove that these types of graphs are stll possble wthout polar axes. INTRODUCTION The Mayo Clnc Bomedcal Statstcs and Informatcs dvson has programmers that use SAS, R and other statstcal software. Many programmers prmarly focus on one of the software packages, and perodcally the dvson hosts a challenge between the programmers n the Anythng You Can Do I Can Do Better theme. The most recent challenge was centered on utlzng and demonstratng the newest features avalable n both SAS and R graphcs. It was durng ths challenge that one of the short comngs of the newest SAS graphng software was made evdent: the absence of polar axes to create round or crcular plots. The task was to create a CIRCOS plot whch s almost entrely based upon curved rectangles rotated n a crcle around a center pont. Fgure 1 s an example of a CIRCOS plot paths per percent Fgure 1. The CIRCOS plot dsplays connectons between groups and s explaned n more detal later n the paper. 1
2 In addton to the lack of polar axes, SAS does not nclude nnate features for creatng curved rectangles or a curved axs. Ths paper focuses on overcomng these lmtatons to meet the challenge and create a hgh-qualty CIRCOS plot wthn a Cartesan axs envronment, to nspre other programmers to fnd creatve methods of producng graphs currently unavalable n the current envronment, and to encourage SAS to consder addng another axs type to ther repertore. THE CURRENT LIMITATIONS The most straghtforward method of plottng shapes around a crcle s to use a polar axs whch s not currently an opton wthn the SAS graphcs procedures. The followng s a comparson of creatng a curved rectangle n a polar axs versus lnear axes. DRAWING A CURVED RECTANGLE IN A POLAR AXIS Polar axes revolve from an orgn axs (P) and have two coordnates: a dstance (d) and an angle (θ). The dstance gves the radus of a crcle drawn, and the angle gves the arc drawn from the orgn axs. Fgure 2 s an example of a polar axs. (d,θ) d (0,0) P (d,0) Fgure 2. An arc s drawn by specfyng a dstance (d) and an angle (θ). The arc s drawn from the orgn axs (P) to the current poston. The followng llustrates the ease of drawng a curved rectangle on a polar axs: Fgure 3 s an example of drawng a curved rectangle on a polar axs. θ (d 1,θ 2 ) (d 1,θ 1 ) (d 2,θ 2 ) (d 2,θ 1 ) (0,0) P Fgure 3. A curved rectangle can be drawn wth two dstances and an arc between two angles. Drawng arcs from θ 1 to θ 2 at dstances d 1 and d 2 and then connectng (d 1, θ 1 ), (d 1, θ 2 ), (d 2, θ 2 ), (d 2, θ 1 ) wth reference to the orgn axs (P) would yeld a perfect curved rectangle for a CIRCOS plot. Ths would be an easy setup for a POLYGON plot statement f a polar axs was avalable. 2
3 DRAWING A CURVED RECTANGLE IN LINEAR AXES There are currently no functons or plot types n the SG graphcs set to create an arc, but due to the freedom of lnear axes the concept of an arc can be created by connectng enough ponts usng straght lne along the rght curve.(.e. usng straght lne to approxmate the curve). The more ponts that are drawn the smoother the arc becomes. Fgure 4 s an example of drawng an arc wthn lnear axes. 3 Ponts 5 Ponts 7 Ponts FIGURE 4. The more ponts that are used to draw the arc the smoother the arc becomes. Ths s an neffcent method to create a curve, but one of the only methods to create an exact curved polygon wth current avalable methods. Wth ths method n mnd and wth the rght equatons SAS can be forced nto drawng curved polygons wthn lnear axes. THE UNIT CIRCLE The unt crcle s a concept from trgonometry that bases a crcle of radus 1 around the 0, 0 coordnates of Cartesan (lnear) axes. Note that the notaton (a, b) n the followng fgure stands for the poston of the ponts. Fgure 5 s the unt crcle. (0,1) (-1,0) (0,0) (1,0) (0,-1) Fgure 5. The unt crcle s centered at the Cartesan coordnates 0, 0 and has a radus of 1. 3
4 Tracng around the crcle can be easly accomplshed usng the basc trgonometry equatons sne and cosne wth a specfed angle. The followng equaton dsplays how to calculate the x and y coordnates for each provded angle: x d cos( ) y d sn( ) The coordnates are smply the dstance (radus of crcle) multpled by the functon of the angle (Θ) where the angle s measured counter clockwse from the x-axs. The unt crcle smplfes these equatons by makng d equal to 1. Arcs can be easly plotted around ths crcle by creatng x and y coordnates from across an angle. A quarter crcle arc can be created by plottng ponts from Θ equal to 0 degrees up to Θ equal to 90 degrees. Note that the SIN and COS functons n SAS use angles measured n radans whch can be converted from degrees wth the followng equaton One complete crcle s 360 degrees whch s equvalent to two p radans. WHAT IS A CIRCOS PLOT? A CIRCOS plot s a condensed crcular vsualzaton of the relatonshp between objects, postons and other tme-pont related data. They are bult out of two prmary components: the outer crcle and the nner connectng curves. There are many optonal add-ons dependng on the software beng used such as havng multple layers of outer crcles and addng other dstrbuton graphs such as hstograms wthn the crcle. The program hghlghted wth ths paper creates CIRCOS plots wth three prmary peces: the outer crcle, an nner crcle, and the connectng curves. The followng s the code used to create the randomly generated dataset and correspondng macro call: data random; call streamnt(123); do = 1 to 100; u = rand("unform"); u2 = rand("unform"); before = 1 + floor(7*u); after = 4 + floor(7*u2); format before after z2.; drop u u2; run; %CIRCOS(DATA=random, BEFORE=before, AFTER=after, PLOTNAME=example1, PLOTTYPE=emf, BORDER=1); OUTER CIRCLE The outer crcle uses curved rectangles to vsually convey the proporton of the total number of paths enterng and leavng each group. The axs s prnted on the outer border of the rectangles wth each tck mark representng one percentage pont of the total sample sze. Each group s labeled wth the label rotated to be perpendcular to the crcle, and each group s colored dfferently. 4
5 Fgure 6 dsplays the Outer Crcle of the CIRCOS plot wth the unt crcle overlayed. (0,1) (-1,0) (0,0) (1,0) (0,-1) Fgure 6. Each group s colored dfferently wthn the Outer Crcle, and the lengths are determned by the groups proporton of the total populaton. A percentage of the total crcle (macro default of 5%) s used to provde a gap between the groups. INNER CIRCLE The nner crcle vsually represents what proporton of the group s leavng to another group (called path hereafter) versus what proporton of the group s arrvng from another group. The more complete the nner crcle bar s the more paths that are leavng to other groups. A blank bar means all paths are gong to that group. Fgure 7 adds n the Inner Crcle to Fgure 6. (0,1) (-1,0) (0,0) (1,0) (0,-1) Fgure 7. The Inner Crcle dsplays how many paths are leavng a group versus endng at a group. The absence of an Inner Crcle bar ndcates that all paths are endng at a group. 5
6 CONNECTING CURVES The curves showng the connectons from one group to another are known as Bézer curves. These are curves that revolve around three ponts: start, end, and a mdpont. The curve s pulled n the drecton of the mdpont as t bends from the start to the end. These curves wdths are dfferent at the start and end wth both beng proportonal to the number of paths leavng or enterng the group wth that curve. Suppose there are two groups A and B. Group A has 20 patents leavng and group B has 30 patents enterng. Specfcally, there are 10 patents gong from group A to group B. Ths Bézer curve wll be 50% of the wdth of group A s departng paths and 33.3% of the ncomng paths to group B potentally gvng dfferent wdths at the start and end of the curve. Fgure 8 adds n the Connectng Curves to Fgure 7. (0,1) (-1,0) (0,0) (1,0) (0,-1) Fgure 8. The Connectng Curves match the color of the group they are departng from. The wdths at the start and end of the curves depend on that path s proporton of the startng and endng groups. The curves are pulled closer to the center of the crcle dependng on how far apart the startng and endng groups are. AXIS AND LABELS Each group on the OUTER CIRCLE contans ts own axs that runs across the outer border. Each tckmark s equvalent to one percent of the crcle, and each ffth tck-mark s double the sze of the others. The label for each group s centered wthn the OUTER CIRCLE rectangle and faces towards the center of the crcle. 6
7 Fgure 9 adds n the labels and axes to Fgure 8. (0,1) (-1,0) (0,0) (1,0) (0,-1) 10 Fgure 9. Each groups axs s ndependent of the other groups. Each label s rotated to face the center of the crcle and s anchored to the mdpont of each OUTER CIRCLE rectangle. CREATING THE PLOT DATASET GENERAL METHODS The CIRCOS macro s based on calculatng coordnates around the unt crcle wthn Cartesan or lnear coordnates. These coordnates are computed wthn DATA steps makng use of DO loops and the array facltes. The unts used for all calculatons are based on percentages meanng the percentage of the crcumference of the crcle or a percentage of the radus of the crcle. POLYGON PLOT NOTE The SAS Graph Template Language plot statement POLYGONPLOT s used to create nearly all the objects wthn the graph. The way POLYGONPLOT works s that t s gven x and y coordnates that t connects n the order of the coordnates. At the last set of coordnates POLYGONPLOT wll connect the last coordnate to the frst coordnate and then fll nsde the shape to create the fnal object. OUTER CIRCLE The length of each group s rectangle s equal to that group s proporton of the total number of paths: L Paths _ out n 1 ( Paths _ out Paths _ n Paths _ n ) Ths proporton s then drectly appled to the crcumference of the outer crcle. If group A has twenty percent of the total paths, then group A wll encompass twenty percent of the outer crcle. The wdth of the outer crcle rectangles are determned by the user wth the parameter BARWIDTH. BARWIDTH can be between 5 and 50 percent, and determnes how much of the radus of the crcle the rectangle wll cover. A bar wdth of fve percent would mean the nsde arc of the rectangle would be drawn at radus 0.95 and the outer arc of the rectangle would be drawn at radus
8 The code to generate the coordnates for the outer crcle rectangles s run wthn a DATA step. The code below reles on two macro varables and two varables calculated earler n the macro: 1. POINTS: macro varable that determnes how many x and y coordnates are computed for each arc. Default s BARWIDTH: macro varable that determnes the wdth of the rectangle. Default s 0.05 (5% of the unt crcle) 3. PERCENT: macro calculated varable for the current group s proporton of the outer crcle 4. _CUM: macro calculated varable that determnes how far around the outer crcle the graph has progressed The actual DATA step code s the followng: /*Draws the outer part of the rectangle*/ do =_cum*2 to (_cum+percent)*2 by percent/&ponts; x=cos(constant("p")*); y=sn(constant("p")*); /*Draws the nner part of the rectangle. Drawn at (1-&barwdth) of the dstance from the center*/ do =(_cum+percent)*2 to _cum *2 by -percent/&ponts; x=(1-&barwdth)*cos(constant("p")*); y=(1-&barwdth)*sn(constant("p")*); The frst DO loop draws the outer arc of the rectangle, and the second DO loop draws the same arc n the reverse drecton closer to the center of the crcle. The loop s multpled by two to account for a full crcle beng 2*p radans. The sdes of the rectangles beng separated and the change n drecton that the coordnates are drawn s due to the nature of the POLYGON plot that s used to make the graph. INNER CIRCLE The length of each group s nner rectangle s equal to that group s proporton of paths leavng to total paths: L Paths Paths _ out _ out Paths _ n Very smlar code s then used to create the coordnates for the nner rectangles. The only dfference s changng the dstance that the arcs are drawn at. Two new varables are added: 1. INNERGAP: macro varable determnes how much space s between outer crcle, nner crcle, and Bézer curves. 2. PCT_START: Pre-calculated varable for the proporton of paths leavng the current group The actual DATA step code s the followng: /*Draws the outer part of the rectangle*/ f pct_start>0 then do =_cum*2 to (_cum+pct_start)*2 by pct_start/&ponts; x=(1-&barwdth-&nnergap/2)*cos(constant("p")*); y=(1-&barwdth-&nnergap/2)*sn(constant("p")*); 8
9 /*Draws the nner part of the rectangle. Drawn at (1-&barwdth) of the dstance from the center*/ f pct_start>0 then do =(_cum+pct_start)*2 to _cum*2 by -pct_start/&ponts; x=(1-&barwdth-&nnergap/2-&barwdth/2)*cos(constant("p")*); y=(1-&barwdth-&nnergap/2-&barwdth/2)*sn(constant("p")*); BÉZIER CURVES The curves that connect one group to another wthn the crcle are known as quadratc Bézer curves whch connect three ponts and are created wth the followng equaton: 2 2 B ( t) (1 t) P0 2(1 t) tp1 t P2,0 t The defntons of the components are as follows: P 0 : startng pont P 1 : md-pont P 2 : end-pont t: represents the pont between the start and end of the curve as a proporton 1 A beneft of usng the unt crcle to make ths macro s that the md-pont s always the center of the crcle whch has coordnates of (0, 0). The result of ths smplfes the equaton to the followng: 2 2 B ( t) (1 t) P0 t P2,0 t 1 One Bézer curve s calculated for each sde of the shape, and these curves are then connected wth arcs usng the same prevous methods. Ths method gves the connectng curves the look of beng wder at the start and endng ponts than t s n the mddle and wll pull the curves more towards the center of the crcle the further away the startng pont s from the endng pont. The DATA step code that calculates the coordnates for the Bézer curves s as follows: /**Draw one sde of connectng Bézer curve**/ do = 0 to 1 by 1/&ponts; x=(1-)**2*bx1b + 2*(1-)**0 + **2*bx2a; y=(1-)**2*by1b + 2*(1-)**0 + **2*by2a; The varables bx1b and by1b are the x and y coordnates for the start of the curve (P 0 ), and the varables bx2a and by2a are the x and y coordnates for the end of the curve (P 2 ). The md-pont (P1) n ths case s 0 whch s why the second sum s multpled by 0. Calculatng the coordnates for all of the Bézer curves requres a number of pre-calculatons and organzaton. Each curve has the followng components: 9
10 1. Two ponts at the start of the curve to form the arc around the crcle wthn the begnnng group 2. Two ponts at the end of the curve to form the arc around the crcle wthn the endng group 3. The proporton of paths leavng the begnnng group each curve contans 4. The proporton of paths enterng the endng group each curve contans 5. The order n whch the curves are plotted to avod overlappng curves from the same group The CIRCOS macro computes the proporton each path takes up from the total crcle, from the startng group, and from the endng group. These values are combned n a dataset that contans the startng ponts and total proportons for each group around the outer crcle. The paths are ordered by how close each startng and endng group are to each other wth condtonal logc to wegh the drecton curves wll be gong. Groups that are closer together clockwse wll favor havng a curve begnnng to the left sde of the startng group, and the reverse for groups that are closer together counter-clockwse. CIRCULAR AXES The crcular axes are drawn n two peces: the lnes and the tck-marks. The lnes are drawn wth the same methods as the outsde of the OUTER CIRCLE rectangles. The tck-marks are created by plottng one pont at the outer edge of the OUTER CIRCLE and another further out on a lne perpendcular to the crcle. Every ffth tck-mark s twce the sze of the others. The DATA step code to create the coordnates s the followng: /*Moves along OUTER CIRCLE border*/ do =(_cum*2+0.02) to (_cum+percent)*2 by 0.02; /*Each tck has ts own dentfer for plottng*/ tck+1; /*x,y coordnates for the base of the tck-mark*/ xtck=cos(constant("p")*); ytck=sn(constant("p")*); /*Every ffth tck-mark s longer*/ f mod(tck,5)=0 then do; xtck=(1.025)*cos(constant("p")*); ytck=(1.025)*sn(constant("p")*); /*Other tck-marks are shorter*/ else do; xtck=(1.0125)*cos(constant("p")*); ytck=(1.0125)*sn(constant("p")*); 10
11 LABELS Three varables are requred to be calculated n order to plot the labels: the x-coordnate, the y-coordnate and the rotaton requred to face the label towards the center of the crcle. The x and y coordnates are calculated at the center of each of the OUTER CIRCLE groups, and then the followng herarchcal equaton s used to calculate the rotaton (R): 270, x 1 90, x 1 0, y 1 R 180, y arccos( y)*, x arcsn( y)*, x 0 2 The value for rotaton s calculated from the formula usng the equaton that frst meets the coordnate s condtons workng from the top down. Ths s calculated wthn the macro usng the SQL procedure and the followng query: /*Creates the dataset used for the text plot. Plots the labels half a barwdth beyond crcle*/ create table _text (drop=x y) as select dstnct _levels_ as text,_cum,percent, cos(constant("p")*2*(_cum+percent/2)) as x, sn(constant("p")*2*(_cum+percent/2)) as y, (1+&barwdth/2)*calculated x as x_text, (1+&barwdth/2)*calculated y as y_text, case when calculated x=1 then 270 when calculated x=-1 then 90 when calculated y=1 then 0 when calculated y=-1 then 180 when calculated x >0 then 0-arcos(calculated y) *360/(2*constant("p")) when calculated x <0 then 90-arsn(calculated y) *360/(2*constant("p")) else. end as rotate from _crcle2; The CALCULATED opton n the SQL procedure allows a reference to a pre-calculated varable wthn the query. The X_TEXT and Y_TEXT coordnates add a buffer to push the label text outsde the crcle. The CASE statement acts as a seres of IF-ELSE logc takng the frst true condton. GENERATING THE PLOT Creatng the plot s straghtforward after all of the coordnates have been calculated. The macro uses the polygon plot along wth the graphcs SUBPIXEL opton to create all of the shapes, and then uses a seres plot to make the axes and tck-marks. The graph s desgned n the TEMPLATE procedure usng the Graph Template Language (GTL) and s rendered wth the SGRENDER procedure. 11
12 POLYGON PLOT The POLYGONPLOT statement n GTL was made avalable n SAS 9.4M1 and draws a polygon per nputted x and y coordnates. The polygon s drawn n the order of the x and y coordnates, and upon reachng the last set of coordnates wll connect the end and the start of the polygon together. A fully connected polygon has the opton to have a fll color wthn the fnal shape. Multple shapes can be drawn from the same x and y varables due to a thrd requred varable: ID. The ID varable determnes dfferent shapes. An example data set for a POLYGONPLOT would look lke the followng table: Table 1 s a sample data set to nput nto a POLYGONPLOT statement. X Y ID Table 1. The X and Y varables contan the x and y coordnates, respectvely. The ID varable separates the coordnates nto two dfferent shapes. The above set of coordnates and ID varables would create two trangles back to back on the y-axs. Fgure 10 s the graph created by table d 1 2 Fgure 10. The two separate trangles are drawn usng the coordnates n the data set descrbed by table 1. The ID varable dstngushes where one shape ends and another begns. 12
13 Fgure 11 dsplays the OUTER CIRCLE wth and wthout the plotted ponts used n the POLYGONPLOT statement (0,1) (0,1) (-1,0) (0,0) (1,0) (-1,0) (0,0) (1,0) (0,-1) (0,-1) Fgure 11. Each of the nner and outer arcs of the rectangles contans the same number of ponts (determned by the macro call). The other two sdes of the rectangles that connect these arcs do not requre any ponts as the polygon plot wll connect them automatcally. Another ID can be used to color the rectangles and Bézer curves ndvdually usng the GROUP opton. SUBPIXEL OPTION The SUBPIXEL opton s new wth SAS 9.4M3 and allows for the creaton of smoother curves. Ths opton makes the CIRCOS plot shapes take less ponts to create smooth curves and thus less processng tme. Fgure 12 s fgure 1 wthout the SUBPIXEL opton Fgure 12. Wthout the subpxel opton enabled the edges are much waver and jagged. 13
14 PLOTTING THE AXES The axes are created usng two SERIESPLOT statements. The frst seres plot draws the axs lne around the OUTER CIRCLE and the second draws the tck-marks: /**Uses the same coordnates that draw the outer border of the OUTER CIRCLE rectangles to plot the axs lne**/ /*The EVAL functon subsets the coordnates usng a varable prevously calculated n the data*/ seresplot x=eval(fn(outlne=1,x,.)) y=y / lneattrs=(color=black pattern=1 thckness=2) group=bfr_d; /**Uses the coordnates for the tck-marks calculated earler. Each tckmark s gven a unque dentfer to separate them usng the GROUP opton**/ seresplot x=xtck y=ytck / lneattrs=(color=black pattern=1 thckness=2) group=tckmark; PLOTTING THE LABELS The labels are created usng the TEXTPLOT statement. Ths statement requres an x-coordnate, a y- coordnate, and a varable contanng the label. A prevously calculated rotate varable s used to rotate the text to face the center of the crcle. The text s centered and justfed on the bottom of the text box. The GTL code s shown below: /*Plots the labels around the crcle*/ textplot x=x_text y=y_text text=text / rotate=rotate textattrs=(color=black sze=12pt weght=bold) poston=top vcenter=bbox; CONCLUSION The need to meet new challenges wthn current lmtatons drves the nnovaton of creatve technques, and nspres SAS to keep addng addtonal graph features. The CIRCOS macro s such an example that wll hopefully add to the potental of a new axs type to be developed for the already mpressve Statstcal Graphcs (SG) engne. CONTACT INFORMATION Your comments and questons are valued and encouraged. Contact the author at: Jeffrey Meyers Mayo Clnc Meyers.jeffrey@mayo.edu / jpmeyers.spa@gmal.com 14
R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes
SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationProgramming in Fortran 90 : 2017/2018
Programmng n Fortran 90 : 2017/2018 Programmng n Fortran 90 : 2017/2018 Exercse 1 : Evaluaton of functon dependng on nput Wrte a program who evaluate the functon f (x,y) for any two user specfed values
More informationComputer models of motion: Iterative calculations
Computer models o moton: Iteratve calculatons OBJECTIVES In ths actvty you wll learn how to: Create 3D box objects Update the poston o an object teratvely (repeatedly) to anmate ts moton Update the momentum
More information3D vector computer graphics
3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres
More informationComplex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.
Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal
More informationSupport Vector Machines
/9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationAP PHYSICS B 2008 SCORING GUIDELINES
AP PHYSICS B 2008 SCORING GUIDELINES General Notes About 2008 AP Physcs Scorng Gudelnes 1. The solutons contan the most common method of solvng the free-response questons and the allocaton of ponts for
More informationNotes on Organizing Java Code: Packages, Visibility, and Scope
Notes on Organzng Java Code: Packages, Vsblty, and Scope CS 112 Wayne Snyder Java programmng n large measure s a process of defnng enttes (.e., packages, classes, methods, or felds) by name and then usng
More informationTN348: Openlab Module - Colocalization
TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages
More informationIntroduction to Geometrical Optics - a 2D ray tracing Excel model for spherical mirrors - Part 2
Introducton to Geometrcal Optcs - a D ra tracng Ecel model for sphercal mrrors - Part b George ungu - Ths s a tutoral eplanng the creaton of an eact D ra tracng model for both sphercal concave and sphercal
More informationAccounting for the Use of Different Length Scale Factors in x, y and z Directions
1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationMATHEMATICS FORM ONE SCHEME OF WORK 2004
MATHEMATICS FORM ONE SCHEME OF WORK 2004 WEEK TOPICS/SUBTOPICS LEARNING OBJECTIVES LEARNING OUTCOMES VALUES CREATIVE & CRITICAL THINKING 1 WHOLE NUMBER Students wll be able to: GENERICS 1 1.1 Concept of
More informationCircuit Analysis I (ENGR 2405) Chapter 3 Method of Analysis Nodal(KCL) and Mesh(KVL)
Crcut Analyss I (ENG 405) Chapter Method of Analyss Nodal(KCL) and Mesh(KVL) Nodal Analyss If nstead of focusng on the oltages of the crcut elements, one looks at the oltages at the nodes of the crcut,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationTEST-05 TOPIC: OPTICS COMPLETE
Q. A boy s walkng under an nclned mrror at a constant velocty V m/s along the x-axs as shown n fgure. If the mrror s nclned at an angle wth the horzontal then what s the velocty of the mage? Y V sn + V
More informationAssignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.
Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton
More informationLife Tables (Times) Summary. Sample StatFolio: lifetable times.sgp
Lfe Tables (Tmes) Summary... 1 Data Input... 2 Analyss Summary... 3 Survval Functon... 5 Log Survval Functon... 6 Cumulatve Hazard Functon... 7 Percentles... 7 Group Comparsons... 8 Summary The Lfe Tables
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationProblem Set 3 Solutions
Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,
More informationREFRACTION. a. To study the refraction of light from plane surfaces. b. To determine the index of refraction for Acrylic and Water.
Purpose Theory REFRACTION a. To study the refracton of lght from plane surfaces. b. To determne the ndex of refracton for Acrylc and Water. When a ray of lght passes from one medum nto another one of dfferent
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationROBOT KINEMATICS. ME Robotics ME Robotics
ROBOT KINEMATICS Purpose: The purpose of ths chapter s to ntroduce you to robot knematcs, and the concepts related to both open and closed knematcs chans. Forward knematcs s dstngushed from nverse knematcs.
More informationComputer Animation and Visualisation. Lecture 4. Rigging / Skinning
Computer Anmaton and Vsualsaton Lecture 4. Rggng / Sknnng Taku Komura Overvew Sknnng / Rggng Background knowledge Lnear Blendng How to decde weghts? Example-based Method Anatomcal models Sknnng Assume
More informationUNIT 2 : INEQUALITIES AND CONVEX SETS
UNT 2 : NEQUALTES AND CONVEX SETS ' Structure 2. ntroducton Objectves, nequaltes and ther Graphs Convex Sets and ther Geometry Noton of Convex Sets Extreme Ponts of Convex Set Hyper Planes and Half Spaces
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More information2D Raster Graphics. Integer grid Sequential (left-right, top-down) scan. Computer Graphics
2D Graphcs 2D Raster Graphcs Integer grd Sequental (left-rght, top-down scan j Lne drawng A ver mportant operaton used frequentl, block dagrams, bar charts, engneerng drawng, archtecture plans, etc. curves
More information2x x l. Module 3: Element Properties Lecture 4: Lagrange and Serendipity Elements
Module 3: Element Propertes Lecture : Lagrange and Serendpty Elements 5 In last lecture note, the nterpolaton functons are derved on the bass of assumed polynomal from Pascal s trangle for the fled varable.
More information9. BASIC programming: Control and Repetition
Am: In ths lesson, you wll learn: H. 9. BASIC programmng: Control and Repetton Scenaro: Moz s showng how some nterestng patterns can be generated usng math. Jyot [after seeng the nterestng graphcs]: Usng
More informationKinematics of pantograph masts
Abstract Spacecraft Mechansms Group, ISRO Satellte Centre, Arport Road, Bangalore 560 07, Emal:bpn@sac.ernet.n Flght Dynamcs Dvson, ISRO Satellte Centre, Arport Road, Bangalore 560 07 Emal:pandyan@sac.ernet.n
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationReading. 14. Subdivision curves. Recommended:
eadng ecommended: Stollntz, Deose, and Salesn. Wavelets for Computer Graphcs: heory and Applcatons, 996, secton 6.-6., A.5. 4. Subdvson curves Note: there s an error n Stollntz, et al., secton A.5. Equaton
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationSolutions to Programming Assignment Five Interpolation and Numerical Differentiation
College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent
More informationModeling Concave Globoidal Cam with Swinging Roller Follower: A Case Study
Modelng Concave Globodal Cam wth Swngng Roller Follower: A Case Study Nguyen Van Tuong, and Premysl Pokorny Abstract Ths paper descrbes a computer-aded desgn for desgn of the concave globodal cam wth cylndrcal
More informationMachine Learning 9. week
Machne Learnng 9. week Mappng Concept Radal Bass Functons (RBF) RBF Networks 1 Mappng It s probably the best scenaro for the classfcaton of two dataset s to separate them lnearly. As you see n the below
More informationBrave New World Pseudocode Reference
Brave New World Pseudocode Reference Pseudocode s a way to descrbe how to accomplsh tasks usng basc steps lke those a computer mght perform. In ths week s lab, you'll see how a form of pseudocode can be
More informationAgenda & Reading. Simple If. Decision-Making Statements. COMPSCI 280 S1C Applications Programming. Programming Fundamentals
Agenda & Readng COMPSCI 8 SC Applcatons Programmng Programmng Fundamentals Control Flow Agenda: Decsonmakng statements: Smple If, Ifelse, nested felse, Select Case s Whle, DoWhle/Untl, For, For Each, Nested
More informationA high precision collaborative vision measurement of gear chamfering profile
Internatonal Conference on Advances n Mechancal Engneerng and Industral Informatcs (AMEII 05) A hgh precson collaboratve vson measurement of gear chamferng profle Conglng Zhou, a, Zengpu Xu, b, Chunmng
More informationLoop Permutation. Loop Transformations for Parallelism & Locality. Legality of Loop Interchange. Loop Interchange (cont)
Loop Transformatons for Parallelsm & Localty Prevously Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Loop nterchange Loop transformatons and transformaton frameworks
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationAnalysis of 3D Cracks in an Arbitrary Geometry with Weld Residual Stress
Analyss of 3D Cracks n an Arbtrary Geometry wth Weld Resdual Stress Greg Thorwald, Ph.D. Ted L. Anderson, Ph.D. Structural Relablty Technology, Boulder, CO Abstract Materals contanng flaws lke nclusons
More informationCMPS 10 Introduction to Computer Science Lecture Notes
CPS 0 Introducton to Computer Scence Lecture Notes Chapter : Algorthm Desgn How should we present algorthms? Natural languages lke Englsh, Spansh, or French whch are rch n nterpretaton and meanng are not
More informationThe Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole
Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng
More informationVRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,
VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual
More information3-Wheel Swerve Drive - The Trouble with Tribots
3-Wheel Swerve Drve - The Trouble wth Trbots Clem McKown - FRC Team 1640 17-August-2014 Executve Summary FRC's 2013 change n robot permeter rules (to 112 nch maxmum overall permeter from the earler maxmum
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationLOOP ANALYSIS. The second systematic technique to determine all currents and voltages in a circuit
LOOP ANALYSS The second systematic technique to determine all currents and voltages in a circuit T S DUAL TO NODE ANALYSS - T FRST DETERMNES ALL CURRENTS N A CRCUT AND THEN T USES OHM S LAW TO COMPUTE
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationHermite Splines in Lie Groups as Products of Geodesics
Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the
More informationAPPLICATION OF A COMPUTATIONALLY EFFICIENT GEOSTATISTICAL APPROACH TO CHARACTERIZING VARIABLY SPACED WATER-TABLE DATA
RFr"W/FZD JAN 2 4 1995 OST control # 1385 John J Q U ~ M Argonne Natonal Laboratory Argonne, L 60439 Tel: 708-252-5357, Fax: 708-252-3 611 APPLCATON OF A COMPUTATONALLY EFFCENT GEOSTATSTCAL APPROACH TO
More informationBiostatistics 615/815
The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts
More informationSkew Angle Estimation and Correction of Hand Written, Textual and Large areas of Non-Textual Document Images: A Novel Approach
Angle Estmaton and Correcton of Hand Wrtten, Textual and Large areas of Non-Textual Document Images: A Novel Approach D.R.Ramesh Babu Pyush M Kumat Mahesh D Dhannawat PES Insttute of Technology Research
More informationWightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK
Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your
More informationParallel Numerics. 1 Preconditioning & Iterative Solvers (From 2016)
Technsche Unverstät München WSe 6/7 Insttut für Informatk Prof. Dr. Thomas Huckle Dpl.-Math. Benjamn Uekermann Parallel Numercs Exercse : Prevous Exam Questons Precondtonng & Iteratve Solvers (From 6)
More informationSynthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007
Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons
More informationParameter estimation for incomplete bivariate longitudinal data in clinical trials
Parameter estmaton for ncomplete bvarate longtudnal data n clncal trals Naum M. Khutoryansky Novo Nordsk Pharmaceutcals, Inc., Prnceton, NJ ABSTRACT Bvarate models are useful when analyzng longtudnal data
More informationwith Optic65 and Optic25 Cameras FOR OUTDOOR TRACKING ONLY unless used in conjunction with the Indoor Tracking Accessory.
wth Optc6 and Optc Cameras Quck Start Gude FOR OUTDOOR TRACKING ONLY unless used n conjuncton wth the Indoor Trackng Accessory. CONGRATULATIONS ON SCORING YOUR SOLOSHOT Our category-creatng lne of personal
More informationMulti-view 3D Position Estimation of Sports Players
Mult-vew 3D Poston Estmaton of Sports Players Robbe Vos and Wlle Brnk Appled Mathematcs Department of Mathematcal Scences Unversty of Stellenbosch, South Afrca Emal: vosrobbe@gmal.com Abstract The problem
More informationFeature Reduction and Selection
Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components
More informationSlide 1 SPH3UW: OPTICS I. Slide 2. Slide 3. Introduction to Mirrors. Light incident on an object
Slde 1 SPH3UW: OPTICS I Introducton to Mrrors Slde 2 Lght ncdent on an object Absorpton Relecton (bounces)** See t Mrrors Reracton (bends) Lenses Oten some o each Everythng true or wavelengths
More informationAMath 483/583 Lecture 21 May 13, Notes: Notes: Jacobi iteration. Notes: Jacobi with OpenMP coarse grain
AMath 483/583 Lecture 21 May 13, 2011 Today: OpenMP and MPI versons of Jacob teraton Gauss-Sedel and SOR teratve methods Next week: More MPI Debuggng and totalvew GPU computng Read: Class notes and references
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationA fault tree analysis strategy using binary decision diagrams
Loughborough Unversty Insttutonal Repostory A fault tree analyss strategy usng bnary decson dagrams Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Addtonal Informaton:
More informationCS1100 Introduction to Programming
Factoral (n) Recursve Program fact(n) = n*fact(n-) CS00 Introducton to Programmng Recurson and Sortng Madhu Mutyam Department of Computer Scence and Engneerng Indan Insttute of Technology Madras nt fact
More informationA DATA ANALYSIS CODE FOR MCNP MESH AND STANDARD TALLIES
Supercomputng n uclear Applcatons (M&C + SA 007) Monterey, Calforna, Aprl 15-19, 007, on CD-ROM, Amercan uclear Socety, LaGrange Par, IL (007) A DATA AALYSIS CODE FOR MCP MESH AD STADARD TALLIES Kenneth
More informationKiran Joy, International Journal of Advanced Engineering Technology E-ISSN
Kran oy, nternatonal ournal of Advanced Engneerng Technology E-SS 0976-3945 nt Adv Engg Tech/Vol. V/ssue /Aprl-une,04/9-95 Research Paper DETERMATO O RADATVE VEW ACTOR WTOUT COSDERG TE SADOWG EECT Kran
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationMonte Carlo Rendering
Monte Carlo Renderng Last Tme? Modern Graphcs Hardware Cg Programmng Language Gouraud Shadng vs. Phong Normal Interpolaton Bump, Dsplacement, & Envronment Mappng Cg Examples G P R T F P D Today Does Ray
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationECONOMICS 452* -- Stata 11 Tutorial 6. Stata 11 Tutorial 6. TOPIC: Representing Multi-Category Categorical Variables with Dummy Variable Regressors
ECONOMICS * -- Stata 11 Tutoral Stata 11 Tutoral TOPIC: Representng Mult-Category Categorcal Varables wth Dummy Varable Regressors DATA: wage1_econ.dta (a Stata-format dataset) TASKS: Stata 11 Tutoral
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationSample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam
Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans
More informationInverse Kinematics (part 2) CSE169: Computer Animation Instructor: Steve Rotenberg UCSD, Spring 2016
Inverse Knematcs (part 2) CSE169: Computer Anmaton Instructor: Steve Rotenberg UCSD, Sprng 2016 Forward Knematcs We wll use the vector: Φ... 1 2 M to represent the array of M jont DOF values We wll also
More informationNAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics
Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson
More informationON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE
Yordzhev K., Kostadnova H. Інформаційні технології в освіті ON SOME ENTERTAINING APPLICATIONS OF THE CONCEPT OF SET IN COMPUTER SCIENCE COURSE Yordzhev K., Kostadnova H. Some aspects of programmng educaton
More informationLoop Transformations for Parallelism & Locality. Review. Scalar Expansion. Scalar Expansion: Motivation
Loop Transformatons for Parallelsm & Localty Last week Data dependences and loops Loop transformatons Parallelzaton Loop nterchange Today Scalar expanson for removng false dependences Loop nterchange Loop
More informationSequential search. Building Java Programs Chapter 13. Sequential search. Sequential search
Sequental search Buldng Java Programs Chapter 13 Searchng and Sortng sequental search: Locates a target value n an array/lst by examnng each element from start to fnsh. How many elements wll t need to
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationVFH*: Local Obstacle Avoidance with Look-Ahead Verification
2000 IEEE Internatonal Conference on Robotcs and Automaton, San Francsco, CA, Aprl 24-28, 2000, pp. 2505-25 VFH*: Local Obstacle Avodance wth Look-Ahead Verfcaton Iwan Ulrch and Johann Borensten The Unversty
More informationOn Some Entertaining Applications of the Concept of Set in Computer Science Course
On Some Entertanng Applcatons of the Concept of Set n Computer Scence Course Krasmr Yordzhev *, Hrstna Kostadnova ** * Assocate Professor Krasmr Yordzhev, Ph.D., Faculty of Mathematcs and Natural Scences,
More informationNews. Recap: While Loop Example. Reading. Recap: Do Loop Example. Recap: For Loop Example
Unversty of Brtsh Columba CPSC, Intro to Computaton Jan-Apr Tamara Munzner News Assgnment correctons to ASCIIArtste.java posted defntely read WebCT bboards Arrays Lecture, Tue Feb based on sldes by Kurt
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationCSE 326: Data Structures Quicksort Comparison Sorting Bound
CSE 326: Data Structures Qucksort Comparson Sortng Bound Steve Setz Wnter 2009 Qucksort Qucksort uses a dvde and conquer strategy, but does not requre the O(N) extra space that MergeSort does. Here s the
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationAn Approach in Coloring Semi-Regular Tilings on the Hyperbolic Plane
An Approach n Colorng Sem-Regular Tlngs on the Hyperbolc Plane Ma Louse Antonette N De Las Peñas, mlp@mathscmathadmueduph Glenn R Lago, glago@yahoocom Math Department, Ateneo de Manla Unversty, Loyola
More information5.0 Quality Assurance
5.0 Dr. Fred Omega Garces Analytcal Chemstry 25 Natural Scence, Mramar College Bascs of s what we do to get the rght answer for our purpose QA s planned and refers to planned and systematc producton processes
More informationParallel matrix-vector multiplication
Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more
More informationWhy visualisation? IRDS: Visualization. Univariate data. Visualisations that we won t be interested in. Graphics provide little additional information
Why vsualsaton? IRDS: Vsualzaton Charles Sutton Unversty of Ednburgh Goal : Have a data set that I want to understand. Ths s called exploratory data analyss. Today s lecture. Goal II: Want to dsplay data
More informationImproving Low Density Parity Check Codes Over the Erasure Channel. The Nelder Mead Downhill Simplex Method. Scott Stransky
Improvng Low Densty Party Check Codes Over the Erasure Channel The Nelder Mead Downhll Smplex Method Scott Stransky Programmng n conjuncton wth: Bors Cukalovc 18.413 Fnal Project Sprng 2004 Page 1 Abstract
More informationA SYSTOLIC APPROACH TO LOOP PARTITIONING AND MAPPING INTO FIXED SIZE DISTRIBUTED MEMORY ARCHITECTURES
A SYSOLIC APPROACH O LOOP PARIIONING AND MAPPING INO FIXED SIZE DISRIBUED MEMORY ARCHIECURES Ioanns Drosts, Nektaros Kozrs, George Papakonstantnou and Panayots sanakas Natonal echncal Unversty of Athens
More information