Navigation Read each page carefully! Some pages will have questions to test your knowledge. Responding correctly to the question will advance you to the next page. When you click on a hyperlink - it will minimize the power point screen and then open up the selected Internet page. To get back to the power point simply click on the power point screen and it will return to the screen that you were viewing. Pages that do not contain knowledge checks, simply click the “next” button in the lower right-hand corner of the screen. If you wish to go back click the “back” button. If you wish to go to the home page, simply click the “home” button. It’s easy! back | home | next
View full slide show




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
View full slide show




Not All 20 Point Fonts Are Equal 20  A - Can You Read B - Can You Read C - Can You Read D - Can You Read E - Can You Read F - Can You Read G - Can You Read H - Can You Read I - Can You Read 16  J - Can You Read K - Can You Read L - Can You Read M - Can You Read N - Can You Read O - Can You Read P - Can You Read Q - Can You Read R - Can You Read 14  J - Can You Read K - Can You Read L - Can You Read M - Can You Read O - Can You Read P - Can You Read Q - Can You Read R - Can You Read 12  J - Can You Read K - Can You Read L - Can You Read M - Can You Read N - Can You Read O - Can You Read P - Can You Read Q - Can You Read R - Can You Read My Students Tell Me That They Like The Readability Of Ariel Font I never use fonts smaller than 20 point for lecture.
View full slide show




Skip Lists One One possibility possibility for for improving improving the the efficiency efficiency of of list list traversals traversals is is the the idea idea of of a a “skip “skip list”. list”. Assume Assume that that the the “values” “values” of of the the data data held held in in the the list list are are evenly evenly distributed distributed between between some some value value   and and some some value value , , and and assume assume that that there there will will be be approximately approximately N N values values in in the the list. list. Each node has a “data” field Each node has a “data” field and and an an array array of of at at most most n n “next” “next” pointers, pointers, where where n n is is log log22 N. N. When a new value When a new value is is inserted, inserted, randomly randomly assign assign it it kk “next” “next” pointers pointers in in such such a a way way that that half half of of the the time, time, the the node node gets gets 1 1 “next” “next” pointer, pointer, aa quarter quarter of of the the time time it it gets gets 2 2 “next” “next” pointers, pointers, n-1)th of the time it and and so so on on up up to to (1/2 (1/2n-1 )th of the time it gets CS 240 either gets either n-1 n-1 or or n n pointers. pointers. Yes, it’s pretty complicated, but it essentially enables you to search a linked list in logarithmic time (rather than that awful linear time)! 17
View full slide show