CCR (Corners of Circumscribing Coordinate Rectangle) (rnd-f, rnd-g, then lin-d) f=MinVecX≡(minXx1..minXxn) g≡MaxVecX≡(maxXx1..maxXxn), d≡(g-f)/|g-f| Sequence thru main diagonal pairs, {f, g} lexicographically. For each, create d. Notes: No calculation required to find f and g (assuming f1=MnVec RnGp>4 none start  g1=MxVec RnGp>4 Sub 0 7 vir18... Clus1 1 47 ver30 Sub 0 53 ver49.. Clus2 0 74 set14 SubClus1 Lin>4 none f2=0001 RnGp>4 none CCR-1. Do SpS((x-f)o(x-f)) round gap analysis CCR-2. Do SpS((x-g)o(x-g)) rnd gap analysis. CCR-3. Do SpS((xod)) linear gap analysis. SubCluster2 g2=1110 RnGp>4 none This ends SubClus2 = 47 setosa only Lin>4 none f1=0000 RnGp>4 none g1=1111 RnGp>4 none Lin>4 none f3=0010 RnGp>4 none f2=0001 RnGp>4 none g2=1110 RnGp>4 none Lin>4 none Lin>4 none f3=0010 RnGp>4 none g3=1101 RnGp>4 none Lin>4 none f4=0011 RnGp>4 none f4=0011 RnGp>4 none g4=1100 RnGp>4 none Lin>4 none f5=0100 RnGp>4 none g5=1011 RnGp>4 none Lin>4 none g3=1101 RnGp>4 none g4=1100 RnGp>4 none Lin>4 none f5=0100 RnGp>4 none g5=1011 RnGp>4 none Lin>4 none f6=0101 RnGp>4 none g6=1010 RnGp>4 none f6=0101 RnGp>4 1 19 set26 0 28 ver49 0 31 set42 0 31 ver8 0 32 set36 0 32 ver44 1 35 ver11 0 41 ver13 ver49 0.0 19.8 3.9 21.3 3.9 7.2 Lin>4 none f7=0110 RnGp>4 none g7=1001 RnGp>4 none Lin>4 none f8=0111 RnGp>4 none g8=1000 RnGp>4 none Lin>4 none f7=0110 RnGp>4 1 28 ver13 0 33 vir49 f8=0111 RnGp>4 none set42 ver8 19.8 3.9 0.0 21.6 21.6 0.0 10.4 23.9 21.8 1.4 23.8 4.6 set36 ver44 ver11 21.3 3.9 7.2 10.4 21.8 23.8 23.9 1.4 4.6 0.0 24.2 27.1 24.2 0.0 3.6 27.1 3.6 0.0 g6=1010 RnGp>4 none g7=1001 RnGp>4 none g8=1000 RnGp>4 none Lin>4 none Lin>4 none Lin>4 none MaxVecX and MinVecX have been calculated and residualized when PTreeSetX was captured.) 3. (and 2.?) may be unproductive in finding new subclusters (either because 1 finds almost all or because 2 and/or 3 find the same ones) and could be skipped (very likely if dimension is high, since the main diagonal corners are typically far from X, in a high dimensional vector space and thus the radii of a round gap is large and large radii rnd gaps are near linear, suggesting a will find all the subclusters that b and c would find. 2. good!, else setosa/versicolor+virginica are not separated! 3. is unproductive, suggesting productive to calculate 1., 2. but having done that, 3. will probably not be productive. Next consider only 3. to see if it is as productive as 1.+2. Subc2.1 ver49 ver8 ver44 ver11 CCR is as good as the combo (projection on d appears to be as accurate as the combination of square length of f and of g). This is probably because the round gaps (centered at the corners) are nearly linear by the time they get to the set X itself. To compare the time costs, we note: Combo (p-x)o(p-x) = pop + xox2xop = pop + k=1..nxk2 + k=1..n(-2pk)xk has n multiplications in the second term, n scalar multiplications and n additions in the third term. For both p=f and p=g, then, it takes 2n multiplications, 2n scalar multiplications and 2n additions. For CCR, xod = k=1..n(dk)xk involves n scalar mults and n additions. It appears to be cheaper (timewise) This ends SubClus1 = 95 ver and vir samples only
View full slide show




CCR(fgd) (Corners of Circumscribing Coordinate Rectangle) f1=minVecX≡(minXx1..minXxn) (0000) g1=MaxVecX≡(MaxXx1..MaxXxn) (1111), d=(g-f)/|g-f| Sequence thru main diagonal pairs, {f, g} lexicographically. For each, create d. f1=MnVec RnGp>4 none start  g1=MxVec RnGp>4 Sub 0 7 vir18... Clus1 1 47 ver30 Sub 0 53 ver49.. Clus2 0 74 set14 SubClus1 Lin>4 none f2=0001 RnGp>4 none CCR(f) Do SpS((x-f)o(x-f)) round gap analysis CCR(g) Do SpS((x-g)o(x-g)) round gap analysis. CCR(d) Do SpS((xod)) linear gap analysis. Notes: No calculation required to find f and g (assuming MaxVecX and minVecX have been calculated and residualized when PTreeSetX was captured.) SubCluster2 g2=1110 RnGp>4 none This ends SubClus2 = 47 setosa only Lin>4 none f1=0000 RnGp>4 none g1=1111 RnGp>4 none Lin>4 none f3=0010 RnGp>4 none f2=0001 RnGp>4 none g2=1110 RnGp>4 none Lin>4 none Lin>4 none f3=0010 RnGp>4 none g3=1101 RnGp>4 none Lin>4 none f4=0011 RnGp>4 none f4=0011 RnGp>4 none g4=1100 RnGp>4 none Lin>4 none f5=0100 RnGp>4 none g5=1011 RnGp>4 none Lin>4 none If the dimension is high, since the main diagonal corners are liekly far from X and thus the large radii make the round gaps nearly linear. g3=1101 RnGp>4 none g4=1100 RnGp>4 none Lin>4 none f5=0100 RnGp>4 none g5=1011 RnGp>4 none Lin>4 none f6=0101 RnGp>4 none g6=1010 RnGp>4 none f6=0101 RnGp>4 1 19 set26 0 28 ver49 0 31 set42 0 31 ver8 0 32 set36 0 32 ver44 1 35 ver11 0 41 ver13 ver49 0.0 19.8 3.9 21.3 3.9 7.2 Lin>4 none f7=0110 RnGp>4 none g7=1001 RnGp>4 none Lin>4 none f8=0111 RnGp>4 none f7=0110 RnGp>4 1 28 ver13 0 33 vir49 f8=0111 RnGp>4 none set42 ver8 19.8 3.9 0.0 21.6 21.6 0.0 10.4 23.9 21.8 1.4 23.8 4.6 g6=1010 RnGp>4 none g7=1001 RnGp>4 none g8=1000 RnGp>4 none g8=1000 RnGp>4 none Lin>4 none set36 ver44 ver11 21.3 3.9 7.2 10.4 21.8 23.8 23.9 1.4 4.6 0.0 24.2 27.1 24.2 0.0 3.6 27.1 3.6 0.0 This ends SubClus1 = 95 ver and vir samples only Lin>4 none Lin>4 none Lin>4 none Subc2.1 ver49 ver8 ver44 ver11
View full slide show




How Do I Reset My Password? • Log in, then click My Options in the upper right corner. – Enter an email address if none is listed. – In Change Password, enter your new password, and then re-enter your new password for confirmation. – Enter your current password in the lower left corner. – Click Save.
View full slide show




How Do I Reset My Password? • Log in, then click My Options in the upper right corner. – Enter an email address if none is listed. – In Change Password, enter your new password, and then re-enter your new password for confirmation. – Enter your current password in the lower left corner. – Click Save.
View full slide show




Case 2: Deleting node (current) has one child Operation 3: Delete Example: delete the node with item (35/data) root ABST 65/data 30/data height 25/data 75/data 45/data / parent 20/data / / 40/data 68/data / / 55/data / 80/data 78/data / / 88/data / / current 35/data / 42/data / / 60/data / / 38/data 36/data / / 39/data / / Delete 1. Find the deleting node (current) and its parent 2. Delete current The first step is similar to Search. We only consider the step of delete current. if (current.Left = null or current.Right = null) { if (current.Right = null) if (current = root) root: = current.Left; else if (parent.Left = current) parent.Left: = current.Left; else parent.Right: = current.Left; else if (current.Left = null) if (current = root) root: = current.Right; else if (parent.Left = current) parent.Left: = current.Right; else parent.Right: = current.Right; } Time Complexity 1. Find the deleting node (current) and its parent: O(height of BST) 2. Delete current: O(1) Therefore, the time complexity for case 1 is O(height of BST) Average case: O(lg n) Worst case: O(n) where n is the size of the BST
View full slide show




The operation of the Atmega32 can be reset due to various events • Power-on Reset – The MCU is reset when the supply voltage is below the Power-on Reset threshold (VPOT). • External Reset – The MCU is reset when a low level is present on the RESET pin for longer than the minimum pulse length. • Brown-out Reset – The MCU is reset when the supply voltage VCC is below the Brown-out Reset threshold (VBOT) and the Brown-out Detector is enabled. • JTAG AVR Reset – The MCU is reset as long as there is a logic one in the Reset Register, one of the scan chains of the JTAG system. Refer to the section “IEEE 1149.1 (JTAG) Boundary-scan” on page 225 for details. • Watchdog Reset – The MCU is reset when the Watchdog Timer period expires and the Watchdog is enabled. Watchdog Timers 2
View full slide show




d3 Sub 0 Clus1 1 Sub 0 Clus2 0 10 19 30 69 set23...50set+vir39 set25 ver49...50ver_49vir vir19 d5 (f5=vir23, g5=set14) none f5 none g5 none d5 (f5=vir32, g5=set14) none f5 none g5 none d5 (f5=vir6, g5=set14) none f5 none g5 none (d1+d3)/sqr(2) clus1 none (d1+d3)/sqr(2) clus2: ver49 ver8 ver44 ver11 0 57.3 ver49 0.0 3.9 3.9 7.2 0 58.0 ver8 3.9 0.0 1.4 4.6 0 58.7 ver44 3.9 1.4 0.0 3.6 1 60.1 ver11 7.2 4.6 3.6 0.0 0 64.3 ver10 none (d3+d4)/sqr(2) clus1 none (d3+d4)/sqr(2) clus2 none (d1+d3+d4)/sqr(3) clus1 1 44.5 set19 0 55.4 vir39 (d1+d3+d4)/sqr(3) clus2 none (d1+d2+d3+d4)/sqr(4) clus1 (d1+d2+d3+d4)/sqr(4) clus2 none d5 (f5=vir19, g5=set14) none f5 1 0.0 vir19 clus2 0 4.1 vir23 g5 none d5 (f5=vir18, g5=set14) none f5 1 0.0 vir18 clus2 1 4.1 vir32 0 8.2 vir6 g5 none
View full slide show




Total Order Plans: Partial Order Plans: Start Left Sock Right Sock Left Sock on Right Sock on Left Shoe Right Shoe Left Shoe on Start Start Start Start Start Start Right Sock Right Sock Left Sock Left Sock Right Sock Left Sock Left Sock Left Sock Right Sock Right Sock Right Shoe Right Shoe Left Shoe Left Sock Right Shoe Left Sock Left Shoe Right Shoe Left Shoe Right Sock Right Shoe on Finish Finish Finish Left Shoe Finish Right Shoe Left Shoe Finish Finish Right Shoe Finish
View full slide show




Model Structure Tree Structure Specified for the Nested Logit Model Sample proportions are marginal, not conditional. Choices marked with * are excluded for the IIA test. ----------------+----------------+----------------+----------------+------+--Trunk (prop.)|Limb (prop.)|Branch (prop.)|Choice (prop.)|Weight|IIA ----------------+----------------+----------------+----------------+------+--Trunk{1} 1.00000|TRAVEL 1.00000|PRIVATE .55714|AIR .27619| 1.000| | | |CAR .28095| 1.000| | |PUBLIC .44286|TRAIN .30000| 1.000| | | |BUS .14286| 1.000| ----------------+----------------+----------------+----------------+------+--+---------------------------------------------------------------+ | Model Specification: Table entry is the attribute that | | multiplies the indicated parameter. | +--------+------+-----------------------------------------------+ | Choice |******| Parameter | | |Row 1| GC TTME INVT INVC A_AIR | | |Row 2| AIR_HIN1 A_TRAIN TRA_HIN3 A_BUS BUS_HIN4 | +--------+------+-----------------------------------------------+ |AIR | 1| GC TTME INVT INVC Constant | | | 2| HINC none none none none | |CAR | 1| GC TTME INVT INVC none | | | 2| none none none none none | |TRAIN | 1| GC TTME INVT INVC none | | | 2| none Constant HINC none none | |BUS | 1| GC TTME INVT INVC none | | | 2| none none none Constant HINC | +---------------------------------------------------------------+
View full slide show




Jagged arrays  Implemented as arrays of arrays , 4 index type index lower bound index upper bound address address , 3 , 3 index type index type index lower bound index lower bound index upper bound index upper bound address address , 7 , 7 index type index type index lower bound index lower bound index upper bound index upper bound address address , 4 , 4 index type index type index lower bound index lower bound index upper bound index upper bound address address , 5 , 5 index type index type index lower bound index lower bound index upper bound index upper bound address address 24
View full slide show




Create Database SQL Management Studio 1. 2. 3. 4. 5. 6. In Object Explorer, connect to an instance of the SQL Server Database Engine and then expand that instance. Right-click Databases, and then click New Database. In New Database, enter a database name. To create the database by accepting all default values, click OK; otherwise, continue with the following optional steps. To change the owner name, click (…) to select another owner. To change the default values of the primary data and transaction log files, in the Database files grid, click the appropriate cell and enter the new value. For more information, see Add Data or Log Files to a Database. 7. To change the collation of the database, select the Options page, and then select a collation from the list. 8. To change the recovery model, select the Options page and select a recovery model from the list. 9. To change database options, select the Options page, and then modify the database options. For a description of each option, see Setting Database Options. 10.To add a new filegroup, click the Filegroups page. Click Add and then enter the values for the filegroup. 11.To add an extended property to the database, select the Extended Properties page. 1. In the Name column, enter a name for the extended property. 2. In the Value column, enter the extended property text. For example, enter one or more statements that describe the database. 12.To create the database, click OK. Ref: http://msdn.microsoft.com/en-us/library/ms186312.aspx
View full slide show




How Do I Reset My Password?  After logging in, click the My Options link in the upper right corner.     Fill in your new Password then re-enter for confirmation. Fill in your old Password where requested in the lower left corner. Be sure to add an email address if none is listed. Click Save.
View full slide show




How Do I Reset My Password?  After logging in, click the My Options link in the upper right corner.     Fill in your new Password then re-enter for confirmation. Fill in your old Password where requested in the lower left corner. Be sure to add an email address if none is listed. Click Save.
View full slide show