Trees and graphs are two data structures that are commonly used in representing different kinds of data. They also have many associated algorithms taught in different courses. It is thus beneficial to have a tool that could be used by students, teachers and programmers to visually trace how their algorithms work. The work in this paper presents, CHR-Graph, an easy-to-use platform for animating trees and graphs and their correlated algorithms using Constraint Handling Rules (CHR).
{"title":"CHR-Graph: A Platform for Animating Tree and Graph Algorithms","authors":"Nada Sharaf, Slim Abdennadher, Thom W. Frühwirth","doi":"10.1109/iV.2017.58","DOIUrl":"https://doi.org/10.1109/iV.2017.58","url":null,"abstract":"Trees and graphs are two data structures that are commonly used in representing different kinds of data. They also have many associated algorithms taught in different courses. It is thus beneficial to have a tool that could be used by students, teachers and programmers to visually trace how their algorithms work. The work in this paper presents, CHR-Graph, an easy-to-use platform for animating trees and graphs and their correlated algorithms using Constraint Handling Rules (CHR).","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122405645","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}
Samiha Fadloun, P. Poncelet, Julien Rabatel, M. Roche, A. Sallaberry
Energy based algorithms are powerful techniques for laying out graphs. They tend to generate aesthetically pleasing graph embeddings, exhibiting symmetries and community structures. When dealing with large graphs, an important drawback of these algorithms is to produce embeddings where many nodes overlap, leading to cluttering issues. While several approaches have been proposed for node overlap removal on 2D graph layouts, to the best of our knowledge, there is no work dedicated to 1D graph layouts. In this paper, we first define 4 requirements for 1D graph node overlap removal. Then, we propose a O(|V|log(|V|)) time algorithm meeting these requirements. We illustrate our approach with two case studies based on arc diagrams where nodes are positioned by applying a MDS technique to highlight community structures. Finally, we compare our technique with alternatives from 2D graph techniques, and a discussion highlights some properties of the results.
{"title":"Node Overlap Removal for 1D Graph Layout","authors":"Samiha Fadloun, P. Poncelet, Julien Rabatel, M. Roche, A. Sallaberry","doi":"10.1109/iV.2017.14","DOIUrl":"https://doi.org/10.1109/iV.2017.14","url":null,"abstract":"Energy based algorithms are powerful techniques for laying out graphs. They tend to generate aesthetically pleasing graph embeddings, exhibiting symmetries and community structures. When dealing with large graphs, an important drawback of these algorithms is to produce embeddings where many nodes overlap, leading to cluttering issues. While several approaches have been proposed for node overlap removal on 2D graph layouts, to the best of our knowledge, there is no work dedicated to 1D graph layouts. In this paper, we first define 4 requirements for 1D graph node overlap removal. Then, we propose a O(|V|log(|V|)) time algorithm meeting these requirements. We illustrate our approach with two case studies based on arc diagrams where nodes are positioned by applying a MDS technique to highlight community structures. Finally, we compare our technique with alternatives from 2D graph techniques, and a discussion highlights some properties of the results.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130690110","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}
Models of human information seeking reveal that search, in particular ad-hoc retrieval, is non-linear and iterative. Despite these findings, todays search user interfaces do not support non-linear navigation, like for example backtracking in time. In this work, we propose QueryCrumbs, a compact and easy-to-understand visualization for navigating the search query history supporting iterative query refinement. We apply a multi-layered interface design to support novices and firsttime users as well as intermediate users. The formative evaluation with first-time and intermediate users showed that the interactions can be easily performed, and the visual encodings were well understood without instructions. Results indicate that QueryCrumbs can support users when searching for information in an iterative manner.
{"title":"QueryCrumbs: A Compact Visualization for Navigating the Search Query History","authors":"C. Seifert, Jörg Schlötterer, M. Granitzer","doi":"10.1109/IV.2017.23","DOIUrl":"https://doi.org/10.1109/IV.2017.23","url":null,"abstract":"Models of human information seeking reveal that search, in particular ad-hoc retrieval, is non-linear and iterative. Despite these findings, todays search user interfaces do not support non-linear navigation, like for example backtracking in time. In this work, we propose QueryCrumbs, a compact and easy-to-understand visualization for navigating the search query history supporting iterative query refinement. We apply a multi-layered interface design to support novices and firsttime users as well as intermediate users. The formative evaluation with first-time and intermediate users showed that the interactions can be easily performed, and the visual encodings were well understood without instructions. Results indicate that QueryCrumbs can support users when searching for information in an iterative manner.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127721356","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}
A. V. Richthofen, Wei Zeng, Shiho Asada, R. Burkhard, F. Heisel, S. Arisona, S. Schubiger-Banz
This paper presents a method and case study to visualize the urban stock of materials and its availability for use in building future cities. Re-using material from existing buildings for new buildings can be seen as a source for construction materials in times of depleting natural resources. The authors explain the concept of "urban mining" and the challenges, such as "How much resources are available in a city? Today? In the near future?" We explore what data are needed to answer the questions, and then discuss how to best visualize the data in an effective and intuitive way. We apply the concept to an exemplary real-world district in Singapore that is in transformation. Then, we discuss features of a visual tool prototype and explain the thinking behind the design, e.g., how the spatial and temporal dimensions can be presented. Lastly, we conclude the paper with an outlook of future challenges. The paper presents a multi-disciplinary approach with researchers from computer science, architecture, graphic design and material science, and contributes to the discussion of how to visualize knowledge and plan sustainable future cities.
{"title":"Urban Mining: Visualizing the Availability of Construction Materials for Re-use in Future Cities","authors":"A. V. Richthofen, Wei Zeng, Shiho Asada, R. Burkhard, F. Heisel, S. Arisona, S. Schubiger-Banz","doi":"10.1109/iV.2017.34","DOIUrl":"https://doi.org/10.1109/iV.2017.34","url":null,"abstract":"This paper presents a method and case study to visualize the urban stock of materials and its availability for use in building future cities. Re-using material from existing buildings for new buildings can be seen as a source for construction materials in times of depleting natural resources. The authors explain the concept of \"urban mining\" and the challenges, such as \"How much resources are available in a city? Today? In the near future?\" We explore what data are needed to answer the questions, and then discuss how to best visualize the data in an effective and intuitive way. We apply the concept to an exemplary real-world district in Singapore that is in transformation. Then, we discuss features of a visual tool prototype and explain the thinking behind the design, e.g., how the spatial and temporal dimensions can be presented. Lastly, we conclude the paper with an outlook of future challenges. The paper presents a multi-disciplinary approach with researchers from computer science, architecture, graphic design and material science, and contributes to the discussion of how to visualize knowledge and plan sustainable future cities.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125335970","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}
Aarón Ayllón-Benítez, P. Thébault, J. Fernández-breis, Manuel Quesada-Martínez, Fleur Mougin, Romain Bourqui
Nowadays, one of the main challenges in biology is to make use of several sources of data to improve our understanding of life. When analyzing experimental data, researchers aim at clustering genes that show a similar behavior through specific external conditions. Thus, the functional interpretation of genes is crucial and involves making use of the whole subset of terms that annotate these genes and which can be relatively large and redundant. The manual expertise to clearly decipher the main functions that may be related to the gene set is timeconsuming and becomes impracticable when the number of gene sets increases, like in the case of vaccine/drug trials. To overcome this drawback, it may be necessary to reduce the dataset with the aim to apply visualization approaches. In this paper, we propose a new pipeline combining enrichment and annotation terms simplification to produce a synthetic visualization of several gene sets simultaneously. We illustrate the efficiency of our method on a case study aiming at analyzing the immune response in diseases.
{"title":"Deciphering Gene Sets Annotations with Ontology Based Visualization","authors":"Aarón Ayllón-Benítez, P. Thébault, J. Fernández-breis, Manuel Quesada-Martínez, Fleur Mougin, Romain Bourqui","doi":"10.1109/iV.2017.18","DOIUrl":"https://doi.org/10.1109/iV.2017.18","url":null,"abstract":"Nowadays, one of the main challenges in biology is to make use of several sources of data to improve our understanding of life. When analyzing experimental data, researchers aim at clustering genes that show a similar behavior through specific external conditions. Thus, the functional interpretation of genes is crucial and involves making use of the whole subset of terms that annotate these genes and which can be relatively large and redundant. The manual expertise to clearly decipher the main functions that may be related to the gene set is timeconsuming and becomes impracticable when the number of gene sets increases, like in the case of vaccine/drug trials. To overcome this drawback, it may be necessary to reduce the dataset with the aim to apply visualization approaches. In this paper, we propose a new pipeline combining enrichment and annotation terms simplification to produce a synthetic visualization of several gene sets simultaneously. We illustrate the efficiency of our method on a case study aiming at analyzing the immune response in diseases.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"193 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114004393","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}
The paper presents automated relational technology ART Studio that generates end-user decision trees from relational data automatically. End-users navigate down these tree structures to pinpoint information managed by the RDBMS. This decision tree reflects and selfreferences data in the database; it turns the data inside out. To generate this visualization, the Studio models a uniform pattern of data in the RDBMS called the Aleph data relation. Earlier research reports that the Aleph is a mechanically derived parent-child data relationship that is ubiquitous throughout the database. The paper will now argue that the Aleph is a complex mathematical object that is dense and compact. Subsequently, its identity is multifaceted. On the computer, its physical symbols represent both an IF-THEN construct, as well as a rich and expressive predicate that replace the need for creating SQL SELECT commands. To support this claim the author draws on two sources: 1) Codd's view of the relational database as a form of predicate calculus, and 2) the author's nascent theory of meta-symbols. The bridging metaphor between these two ideas is the fact that data symbols can be viewed in linguistic terms as tokens and types. The paper will show how the Alephbased decision tree models database tables and their data. It has a logical correspondence with the tables attributes and tuples. The paper shows how predicates in its pathways map to predicates in Codd's tuple components. This point is made to highlight how Alephbased decision trees project Codd's view of the RDBMS as a form of predicate calculus.
{"title":"A Decision Tree Interface Based on Predicate Calculus","authors":"H. P. Zellweger","doi":"10.1109/iV.2017.68","DOIUrl":"https://doi.org/10.1109/iV.2017.68","url":null,"abstract":"The paper presents automated relational technology ART Studio that generates end-user decision trees from relational data automatically. End-users navigate down these tree structures to pinpoint information managed by the RDBMS. This decision tree reflects and selfreferences data in the database; it turns the data inside out. To generate this visualization, the Studio models a uniform pattern of data in the RDBMS called the Aleph data relation. Earlier research reports that the Aleph is a mechanically derived parent-child data relationship that is ubiquitous throughout the database. The paper will now argue that the Aleph is a complex mathematical object that is dense and compact. Subsequently, its identity is multifaceted. On the computer, its physical symbols represent both an IF-THEN construct, as well as a rich and expressive predicate that replace the need for creating SQL SELECT commands. To support this claim the author draws on two sources: 1) Codd's view of the relational database as a form of predicate calculus, and 2) the author's nascent theory of meta-symbols. The bridging metaphor between these two ideas is the fact that data symbols can be viewed in linguistic terms as tokens and types. The paper will show how the Alephbased decision tree models database tables and their data. It has a logical correspondence with the tables attributes and tuples. The paper shows how predicates in its pathways map to predicates in Codd's tuple components. This point is made to highlight how Alephbased decision trees project Codd's view of the RDBMS as a form of predicate calculus.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117136013","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}
Christophe Kiennert, P. Rocher, M. Ivanova, A. Rozeva, Mariana Durcheva, Joaquín García
E-Assessment is an innovative form for the evaluation of learners' knowledge and skills in online education, as well as in blended-learning environments, where part of the assessment activities is carried out online. As e-assessment involves online communication channel between learners and educators, as well as data transfer and storage, security measures are required to protect the environment against system and network attacks. The issue concerning security is challenging from both educational and technical point of views. Such issues are discussed under the scope of the TeSLA project. Educational challenging problems at e-assessment are analyzed and technical architectural recommendations for securing the e-assessment system according to the General Data Protection Regulation are provided.
{"title":"Security Challenges in e-Assessment and Technical Solutions","authors":"Christophe Kiennert, P. Rocher, M. Ivanova, A. Rozeva, Mariana Durcheva, Joaquín García","doi":"10.1109/iV.2017.70","DOIUrl":"https://doi.org/10.1109/iV.2017.70","url":null,"abstract":"E-Assessment is an innovative form for the evaluation of learners' knowledge and skills in online education, as well as in blended-learning environments, where part of the assessment activities is carried out online. As e-assessment involves online communication channel between learners and educators, as well as data transfer and storage, security measures are required to protect the environment against system and network attacks. The issue concerning security is challenging from both educational and technical point of views. Such issues are discussed under the scope of the TeSLA project. Educational challenging problems at e-assessment are analyzed and technical architectural recommendations for securing the e-assessment system according to the General Data Protection Regulation are provided.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127223448","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}
Partially drawn links are a possibility to reduce visual clutter in node-link visualizations of relational data caused by link crossings. Although partial links have some benefits concerning task performance, they exhibit issues regarding target node ambiguities. In this paper, we provide the results of a user study that investigates the performance in terms of task accuracy when judging target nodes to which partial links are pointing. We vary the link lengths and link directions as independent variables and measure the task accuracy as dependent variable while the exposure duration for each stimulus is fixed. The major result of our user study is that people tend to make more target node judgment errors with shorter link lengths. Moreover, the direction of the partial links also has an impact on the accuracy. With these results, we are able to choose appropriate parameter settings for graphs drawn with partial links. This can be regarded as a novel graph drawing criterion for improving the readability of graphs represented with partial links.
{"title":"A User Study on Judging the Target Node in Partial Link Drawings","authors":"Michael Burch","doi":"10.1109/iV.2017.43","DOIUrl":"https://doi.org/10.1109/iV.2017.43","url":null,"abstract":"Partially drawn links are a possibility to reduce visual clutter in node-link visualizations of relational data caused by link crossings. Although partial links have some benefits concerning task performance, they exhibit issues regarding target node ambiguities. In this paper, we provide the results of a user study that investigates the performance in terms of task accuracy when judging target nodes to which partial links are pointing. We vary the link lengths and link directions as independent variables and measure the task accuracy as dependent variable while the exposure duration for each stimulus is fixed. The major result of our user study is that people tend to make more target node judgment errors with shorter link lengths. Moreover, the direction of the partial links also has an impact on the accuracy. With these results, we are able to choose appropriate parameter settings for graphs drawn with partial links. This can be regarded as a novel graph drawing criterion for improving the readability of graphs represented with partial links.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126153539","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}
LOOM is advanced as a new visualisation for changes in ranks and trends in power-law data that is changing dynamically over time. A comparison between LOOM and existing methods for visualising such data (e.g., time-series graphs, typical analytics dashboards). Several exemplar data sets are shown, using LOOM, drawn from the tracking of news stories on Twitter. The basis for the LOOM visualisation is elaborated and it is shown how it avoids the pitfalls arising in other line-graph representations.
{"title":"LOOM: Showing the Dynamics of Power Laws in Twitter Data","authors":"Maryanne Doyle, Mark T. Keane","doi":"10.1109/iV.2017.50","DOIUrl":"https://doi.org/10.1109/iV.2017.50","url":null,"abstract":"LOOM is advanced as a new visualisation for changes in ranks and trends in power-law data that is changing dynamically over time. A comparison between LOOM and existing methods for visualising such data (e.g., time-series graphs, typical analytics dashboards). Several exemplar data sets are shown, using LOOM, drawn from the tracking of news stories on Twitter. The basis for the LOOM visualisation is elaborated and it is shown how it avoids the pitfalls arising in other line-graph representations.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122407688","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}
Daniel Limberger, W. Scheibel, Matthias Trapp, J. Döllner
This paper presents a novel technique for combining 2D and 2.5D treemaps using multi-perspective views to leverage the advantages of both treemap types. It enables a new form of overview+detail visualization for tree-structured data and contributes new concepts for real-time rendering of and interaction with treemaps. The technique operates by tilting the graphical elements representing inner nodes using affine transformations and animated state transitions. We explain how to mix orthogonal and perspective projections within a single treemap. Finally, we show application examples that benefit from the reduced interaction overhead.
{"title":"Mixed-Projection Treemaps: A Novel Approach Mixing 2D and 2.5D Treemaps","authors":"Daniel Limberger, W. Scheibel, Matthias Trapp, J. Döllner","doi":"10.1109/iV.2017.67","DOIUrl":"https://doi.org/10.1109/iV.2017.67","url":null,"abstract":"This paper presents a novel technique for combining 2D and 2.5D treemaps using multi-perspective views to leverage the advantages of both treemap types. It enables a new form of overview+detail visualization for tree-structured data and contributes new concepts for real-time rendering of and interaction with treemaps. The technique operates by tilting the graphical elements representing inner nodes using affine transformations and animated state transitions. We explain how to mix orthogonal and perspective projections within a single treemap. Finally, we show application examples that benefit from the reduced interaction overhead.","PeriodicalId":410876,"journal":{"name":"2017 21st International Conference Information Visualisation (IV)","volume":"132 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122501274","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：