IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.最新文献

筛选
英文 中文
Angular brushing of extended parallel coordinates 扩展平行坐标的角刷
IEEE Symposium on Information Visualization, 2002. INFOVIS 2002. Pub Date : 2002-10-28 DOI: 10.1109/INFVIS.2002.1173157
H. Hauser, Florian Ledermann, H. Doleisch
{"title":"Angular brushing of extended parallel coordinates","authors":"H. Hauser, Florian Ledermann, H. Doleisch","doi":"10.1109/INFVIS.2002.1173157","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173157","url":null,"abstract":"In this paper we present angular brushing for parallel coordinates (PC) as a new approach to highlighting rational data-properties, i.e., features which - in a non-separable way - depend on two data dimensions. We also demonstrate smooth brushing as an intuitive tool for specifying nonbinary degree-of-interest functions (for focus+context visualization). We also briefly describe our implementation as well as its application to the visualization of CFD data.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122394783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 270
Internet traffic: visualization, discovery, and very large displays 互联网流量:可视化、发现和非常大的显示
IEEE Symposium on Information Visualization, 2002. INFOVIS 2002. Pub Date : 2002-10-28 DOI: 10.1109/INFVIS.2002.1173140
W. Cleveland
{"title":"Internet traffic: visualization, discovery, and very large displays","authors":"W. Cleveland","doi":"10.1109/INFVIS.2002.1173140","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173140","url":null,"abstract":"For a decade, the ruling common wisdom for Internet traffic held that it was everywhere bursty: over periods lasting tens of milliseconds to hundreds, the traffic was either much below its average rate or much above. In other words, the traffic was not smooth, not staying at all times close to its average. It was bursty on the cable running down a street, carrying the merged traffic of a small number of cable modem users in one section of a town. It was bursty on the core fiber of an Internet service provider, carrying the merged traffic of thousands of users from all over the country. The Internet was designed to accommodate the bursty traffic. The routers and switches that forward traffic from one place to the next were designed for burstiness, and Internet service providers allocated traffic loads on the devices based on an assumption of burstiness. Recently, it was discovered that the old common wisdom is not true. Visualization played a fundamental role in the discovery. The old wisdom held up for links with a small numbers of users. But as the number of users increases, the burstiness dissipates, and the traffic becomes smooth. Design of the high-load part of the Internet needs to be rethought. The old wisdom had persisted for high-load links because the databases of traffic measurements from them are immense, and the traffic measurements had not been studied in their fullest detail, which is necessary to see the smoothing. Visualization tools allowed the detail to be seen, and allowed the verification of a mathematical theory that predicts the smoothing. To see the detail, individual visual displays were created that take up an amount of virtual screen real estate measured in hundreds of pages. It is a simple idea: if you have a lot of data, and you want to see it in detail, you need a lot of space. What is needed now is a rich set of ideas and methods for navigating such very large displays.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131849663","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Case study: visualizing sets of evolutionary trees 案例研究:可视化进化树集
IEEE Symposium on Information Visualization, 2002. INFOVIS 2002. Pub Date : 2002-10-28 DOI: 10.1109/INFVIS.2002.1173150
N. Amenta, J. Klingner
{"title":"Case study: visualizing sets of evolutionary trees","authors":"N. Amenta, J. Klingner","doi":"10.1109/INFVIS.2002.1173150","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173150","url":null,"abstract":"We describe a visualization tool which allows a biologist to explore a large set of hypothetical evolutionary trees. Interacting with such a dataset allows the biologist to identify distinct hypotheses about how different species or organisms evolved, which would not have been clear from traditional analyses. Our system integrates a point-set visualization of the distribution of hypothetical trees with detail views of an individual tree, or of a consensus tree summarizing a subset of trees. Efficient algorithms were required for the key tasks of computing distances between trees, finding consensus trees, and laying out the point-set visualization.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"79 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116344736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 97
Arc diagrams: visualizing structure in strings 圆弧图:可视化字符串结构
IEEE Symposium on Information Visualization, 2002. INFOVIS 2002. Pub Date : 2002-10-28 DOI: 10.1109/INFVIS.2002.1173155
M. Wattenberg
{"title":"Arc diagrams: visualizing structure in strings","authors":"M. Wattenberg","doi":"10.1109/INFVIS.2002.1173155","DOIUrl":"https://doi.org/10.1109/INFVIS.2002.1173155","url":null,"abstract":"This paper introduces a new visualization method, the arc diagram, which is capable of representing complex patterns of repetition in string data. Arc diagrams improve over previous methods such as dotplots because they scale efficiently for strings that contain many instances of the same subsequence. This paper describes design and implementation issues related to arc diagrams and shows how they may be applied to visualize such diverse data as music, text, and compiled code.","PeriodicalId":293232,"journal":{"name":"IEEE Symposium on Information Visualization, 2002. INFOVIS 2002.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2002-10-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132290299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 297
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信