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
Replay QoE measurement Old way: QoE = Server + Network Modern way: QoE = Servers + Network + Browser Browsers are smart Parallelism on multiple connections JavaScript execution can trigger additional queries Rendering introduces delays in resource access Caching and pre-fetching HTTP replay cannot approximate real Web browser access to resources 0.25s 0.25s 0.06s 1.02s 0.67s 0.90s 1.19s 0.14s 0.97s 1.13s 0.70s 0.28s 0.27s 0.12s 3.86s 1.88s Total network time GET /wiki/page 1 Analyze page GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET GET combined.min.css jquery-ui.css main-ltr.css commonPrint.css shared.css flaggedrevs.css Common.css wikibits.js jquery.min.js ajax.js mwsuggest.js plugins...js Print.css Vector.css raw&gen=css ClickTracking.js Vector...js js&useskin WikiTable.css CommonsTicker.css flaggedrevs.js Infobox.css Messagebox.css Hoverbox.css Autocount.css toc.css Multilingual.css mediawiki_88x31.png 2 Rendering + JavaScript GET GET GET GET GET GET GET GET GET ExtraTools.js Navigation.js NavigationTabs.js Displaytitle.js RandomBook.js Edittools.js EditToolbar.js BookSearch.js MediaWikiCommon.css 3 Rendering + JavaScript GET GET GET GET GET GET GET GET GET GET GET 4 GET GET GET GET GET GET page-base.png page-fade.png border.png 1.png external-link.png bullet-icon.png user-icon.png tab-break.png tab-current.png tab-normal-fade.png search-fade.png Rendering search-ltr.png arrow-down.png wiki.png portal-break.png portal-break.png arrow-right.png generate page send files send files mBenchLab – [email protected] BROWSERS MATTER FOR QOE? send files send files + 2.21s total rendering time 6
Citation Key for more information see: http://open.umich.edu/wiki/CitationPolicy Use + Share + Adapt { Content the copyright holder, author, or law permits you to use, share and adapt. } Public Domain – Government: Works that are produced by the U.S. Government. (USC 17 § 105) Public Domain – Expired: Works that are no longer protected due to an expired copyright term. Public Domain – Self Dedicated: Works that a copyright holder has dedicated to the public domain. Creative Commons – Zero Waiver Creative Commons – Attribution License Creative Commons – Attribution Share Alike License Creative Commons – Attribution Noncommercial License Creative Commons – Attribution Noncommercial Share Alike License GNU – Free Documentation License Make Your Own Assessment { Content Open.Michigan believes can be used, shared, and adapted because it is ineligible for copyright. } Public Domain – Ineligible: Works that are ineligible for copyright protection in the U.S. (USC 17 § 102(b)) *laws in your jurisdiction may differ { Content Open.Michigan has used under a Fair Use determination. } Fair Use: Use of works that is determined to be Fair consistent with the U.S. Copyright Act. (USC 17 § 107) *laws in your jurisdiction may differ Our determination DOES NOT mean that all uses of this 3rd-party content are Fair Uses and we DO NOT guarantee that your use of the content is Fair. To use this content you should do your own independent analysis to determine whether or not your use will be Fair.
Viewing and Taking Ownership • Viewing Ownership • View file or folder ownership of a file or folder from the Owner tab in the advanced security settings of the file/folder properties • Properties of file or folder /Security / Advanced / Owner • Taking Ownership • Take ownership of a file or folder from the Owner tab in the advanced security settings of the file/folder properties • Properties of file or folder / Security / Advanced / Owner /Edit • Select a new owner from the Change Owner to Box or add a new user to the list and select that new user (add a new user or group by using the Other Users or Groups button) • Use the Replace Owners on Subcontainers and Objects with caution. • Taking ownership does not automatically add the owner to the file/folder’s ACL. • Example: If an administrator has no permissions to a file or folder he/she can take ownership of the file/folder but administrators are not automatically added to the security tab of that file or folder – the new entry must be added. 2