text:
-Group allows for viewing the addition and deletion of nodes (actors) and edges (relationships) over time, its major contribution is its focus on changing group memberships over time. By doing so, users can investigate the context of temporal group memberships for the pair. C-Group provides users with a flexible interface for defining (and redefining) groups interactively, and supports two novel visual representations of the evolving group memberships. This flexibility gives users alternate views that are appropriate for different network sizes and provides users with different insights into the grouping behavior. We demonstrate the utility of the tool on a scientific publication network.},
  author = {Kang, Hyunmo and Getoor, Lise and Singh, Lisa},
  doi = {10.1145/1345448.1345452},
  journal = {ACM SIGKDD Explorations Newsletter},
  keywords = {type:application, time:animation, paradigm:node-link, application:social, evaluation:case_study, weighted_graph, bipartite},
  number = {2},
  pages = {13--21},
  publisher = {ACM},
  title = {Visual analysis of dynamic group membership in temporal social networks},
  volume = {9},
  year = {2007}
}

@inproceedings{Kerracher2014Design,
  abstract = {This paper presents our work in mapping the design space of techniques for temporal graph visualisation. We identify two independent dimensions upon which the techniques can be classified: graph structural encoding and temporal encoding. Based on these dimensions, we create a matrix into which we organise existing techniques. We identify gaps in this design space which may prove interesting opportunities for the development of novel techniques. We also consider additional dimensions on which further useful classification could be made. In organising the disparate existing approaches from a wide range of domains, our classification will assist those new to the research area, and designers and evaluators developing systems for temporal graph data by raising awareness of the range of possible approaches available, and highlighting possible directions for further research.},
  author = {Kerracher, Natalie and Kennedy, Jessie and Chalmers, Kevin},
  booktitle = {EuroVis - Short Papers},
  doi = {10.2312/eurovisshort.20141149},
  keywords = {evaluation:survey, type:evaluation, time:generic, paradigm:generic, application:generic},
  pages = {7--11},
  publisher = {Eurographics Assocation},
  title = {The Design Space of Temporal Graph Visualisation},
  year = {2014}
}

@article{Kerracher2014Tasks,
  abstract = {In [1], we describe the design and development of a task taxonomy for temporal graph visualisation. This paper details the full instantiation of that task taxonomy. Our task taxonomy is based on the Andrienko framework [2], which uses a systematic approach to develop a formal task framework for visual tasks specifically associated with Exploratory Data Analysis. The Andrienko framework is intended to be applicable to all types of data, however, it does not consider relational (graph) data. We therefore extended both their data model and task framework for temporal graph data, and instantiated the extended version to produce a comprehensive list of tasks of interest during exploratory analysis of temporal graph data. As expected, our instantiation of the framework resulted in a very large task list; with more than 144 variations of attribute based tasks alone, it is too large to fit in a standard journal paper, hence we provide the detailed listing in this document.},
  author = {Kerracher, Natalie and Kennedy, Jessie and Chalmers, Kevin},
  comment = {Supplementary material for Kerracher2014Design},
  journal = {arXiv preprint arXiv:1402.2867},
  keywords = {type:evaluation, evaluation:survey, tasks, taxonomy, time:generic, paradigm:generic, application:generic},
  series = {arXiv},
  title = {Tasks for Temporal Graph Visualisation},
  url = {http://arxiv.org/abs/1402.2867},
  year = {2014}
}

@inproceedings{Kimelman1995Reduction,
  abstract = {Graphs are used extensively in software visualization to represent both static aspects of software structure and dynamic aspects of execution-time behavior. However, for realistic subject software systems, there are far too many nodes and edges in the displayed graphs to be comprehensible to an end user. Further, for presentation of dynamics, continual change and redisplay of such large graphs is too demanding for conventional workstation computational resources. This paper poses the problem of “reduction” or “abstraction” in dynamically changing graphs, and proposes a combination of techniques that can be used to reduce the visual complexity of a graph, without obscuring the significant information that it was meant to convey. The abstract graph can be comprehended more readily and it changes far less frequently than the full graph. As well, when the abstract graph does change, it requires far less computation for layout and redisplay. These abstraction techniques are illustrated by way of examples showing their use in systems for visualization of object-oriented and multi-layer software systems.},
  author = {Kimelman, Doug and Leban, Bruce and Roth, Tova and Zernik, Dror},
  booktitle = {Graph Drawing},
  doi = {10.1007/3-540-58950-3_373},
  keywords = {type:application, time:generic, paradigm:generic, application:software_engineering, program_execution, evaluation:case_study},
  pages = {218--225},
  publisher = {Springer},
  series = {GD},
  title = {Reduction of visual complexity in dynamic graphs},
  year = {1995}
}

@article{Kobourov2012Spring,
  abstract = {Force-directed algorithms are among the most flexible methods for calculating layouts of simple undirected graphs. Also known as spring embedders, such algorithms calculate the layout of a graph using only information contained within the structure of the graph itself, rather than relying on domain-specific knowledge. Graphs drawn with these algorithms tend to be aesthetically pleasing, exhibit symmetries, and tend to produce crossing-free layouts for planar graphs. In this survey we consider several classical algorithms, starting from Tutte's 1963 barycentric method, and including recent scalable multiscale methods for large and dynamic graphs.},
  author = {Kobourov, Stephen G},
  journal = {arXiv preprint arXiv:1201.3011},
  keywords = {type:evaluation, paradigm:node-link, force-directed\_layout, time:animation, evaluation:none, application:generic},
  series = {CoRR},
  title = {Spring Embedders and Force Directed Graph Drawing Algorithms},
  url = {http://arxiv.org/abs/1201.3011},
  year = {2012}
}

@article{Kumar2006Visual,
  abstract = {Quasi-trees, namely graphs with tree-like structure, appear in many application domains, including bioinformatics and computer networks. Our new SPF approach exploits the structure of these graphs with a two-level approach to drawing, where the graph is decomposed into a tree of biconnected components. The low-level biconnected components are drawn with a force-directed approach that uses a spanning tree skeleton as a starting point for the layout. The higher-level structure of the graph is a true tree with meta-nodes of variable size that contain each biconnected component. That tree is drawn with a new area-aware variant of a tree drawing algorithm that handles high-degree nodes gracefully, at the cost of allowing edge-node overlaps. SPF performs an order of magnitude faster than the best previous approaches, while producing drawings of commensurate or improved quality},
  author = {Kumar, Gautam and Garland, Michael},
  doi = {10.1109/tvcg.2006.193},
  issn = {1077-2626},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {force-directed\_layout, clustering, paradigm:node-link, time:animation, evaluation:case\_study, application:business, application:biology, type:technique, compound_graph, offline\_problem, mental\_map, weighted_graph, special-purpose_layout},
  number = {5},
  pages = {805--812},
  series = {TVCG},
  title = {Visual Exploration of Complex Time-Varying Graphs},
  volume = {12},
  year = {2006}
}

@article{Lad2006Visualizing,
  abstract = {Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes.},
  author = {Lad, Mohit and Massey, Daniel and Zhang, Lixia},
  doi = {10.1109/TVCG.2006.108},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:infrastructure},
  number = {6},
  pages = {1450--1460},
  publisher = {IEEE},
  series = {TVCG},
  title = {Visualizing internet routing changes},
  volume = {12},
  year = {2006}
}

@inproceedings{Lee2006Mental,
  abstract = {Information visualization has attracted much attention in recent years in many fields of science and engineering. In many applications, graphs are 'dynamic' in the sense that changes are constantly applied to a graph to reflect the evolution of the system behaviour represented by the graph. In the past, the concept of the so-called "mental map" has largely been ignored. Users often have to spend a lot of time relearning the redrawn graphs. This paper proposes an effective way to release the user from such kind of a distasteful job by maintaining a high degree of the "mental map" for general graphs when graphs are redrawn. Our experimental results suggest this new approach to be promising.},
  author = {Lee, Yi-Yi and Lin, Chun-Cheng and Yen, Hsu-Chun},
  booktitle = {Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation},
  keywords = {type:technique, paradigm:node-link, mental_map, time:animation, evaluation:case_study, application:generic, online_problem, general-purpose_layout},
  pages = {179--188},
  publisher = {Australian Computer Society, Inc.},
  series = {APVis},
  title = {Mental map preserving graph drawing using simulated annealing},
  year = {2006}
}

@inproceedings{Li2013Visual,
  abstract = {As a novel type of real-time social networking service, microblogging has already become ubiquitous and an irreplaceable tool. Tracking in the pulse of retweeting propagation is important and meaningful. In this paper, we investigate how information propagation in a specific microblogging platform evolves to identify relevant patterns and understand dynamic attributes of information propagation and the underlying sociological motivations. More specifically, based on the node-link diagram, we propose three efficient strategies to map the multiple attributes of information propagation graph to appropriate visual elements. For revealing the dynamic attributes, we propose two models: the depth-varying and the time-varying parallel data model to illustrate the temporal evolution efficiently. We also present a novel method by combining the traditional scatter plot with Hough transformation to represent the distribution of propagation instances and trace the propagation speeds. We integrate our methods to a visual mining tool and develop several interactive features. We demonstrate how our approaches improve the understanding of the propagation graph from a visual perspective by employing propagation datasets collected from Sina Weibo, the largest microblogging service provider in mainland China. Meanwhile, this visual mining tool has been evaluated by data analysts and successfully used in Sina Corporation as a helpful assistant to them.},
  author = {Li, Quan and Qu, Huamin and Chen, Li and Wang, Robert and Yong, Junhai and Si, Detan},
  booktitle = {Proceedings of the 6th International Symposium on Visual Information Communication and Interaction},
  doi = {10.1145/2493102.2493108},
  keywords = {type:application, time:timeline, time:animation, evaluation:expert, paradigm:node-link, social_media, application:social},
  organization = {ACM},
  pages = {44--53},
  series = {VINCI},
  title = {Visual analysis of retweeting propagation network in a microblogging platform},
  year = {2013}
}

@article{Liao2013Visual,
  abstract = {The amount of information flowing across communication networks has rapidly increased. The highly dynamic and complex networks, represented as large graphs, make the analysis of such networks increasingly challenging. In this paper, we provide a brief overview of several useful visualization techniques for the analysis of spatiotemporal anomalies in large-scale networks. We make use of community-based similarity graphs (CSGs), temporal expansion model graphs (TEMGs), correlation graphs (CGs), high-dimension projection graphs (HDPGs), and topology-preserving compressed graphs (TPCGs). CSG is used to detect anomalies based on community membership changes rather than individual nodes and edges and therefore may be more tolerant to the highly dynamic nature of large networks. TEMG transforms network topologies into directed trees so that efficient search is more likely to be performed for anomalous changes in network behavior and routing topology in large dynamic networks. CG and HDPG are used to examine the complex relationship of data dimensions among graph nodes through transformation in a high-dimensional space. TPCG groups nodes with similar neighbor sets into mega-nodes, thus making graph visualization and analysis more scalable to large networks. All the methods target efficient large-graph anomaly visualization from different perspectives and together provide valuable insights.},
  author = {Liao, Qi and Shi, Lei and Wang, Chen},
  doi = {10.1147/JRD.2013.2249356},
  journal = {IBM Journal of Research and Development},
  keywords = {type:application, paradigm:node-link, application:infrastructure, evaluation:case_study, time:timeline},
  number = {3/4},
  pages = {13:1-13:12},
  publisher = {IBM},
  title = {Visual analysis of large-scale network anomalies},
  volume = {57},
  year = {2013}
}

@inproceedings{Lin2010ContexTour,
  abstract = {Huge amounts of rich context social network data are generated everyday from various applications such as FaceBook and Twitter. These data involve multiple social relations which are community-driven and dynamic in nature. The complex interplay of these characteristics poses tremendous challenges on the users who try to understand the underlying patterns in the social media. We introduce an exploratory analytical framework, ContexTour, which generates visual representations for exploring multiple dimensions of community activities, including relevant topics, representative users and the community-generated content, as well as their evolutions. ContexTour consists of two novel and complementary components: (1) Dynamic Relational Clustering (DRC) that efficiently tracks the community evolution and smoothly adapts to the community changes, and (2) Dynamic Network Contour-map (DNC) that visualizes the community activities and evolutions in various dimensions. In our experiments, we demonstrate ContexTour through case studies on the DBLP dataset. The visual results capture interesting and reasonable evolution in Computer Science research communities. Quantitatively, we show 85-165X performance gain of our DRC algorithm over the baseline method.},
  author = {Lin, Yu-Ru and Sun, Jimeng and Cao, Nan and Liu, Shixia},
  booktitle = {Proceedings of the 2010 SIAM International Conference on Data Mining},
  doi = {10.1137/1.9781611972801.37},
  keywords = {mental\_map, compound_graph, clustering, type:technique, paradigm:node-link, map\_metaphor, time:animation, evaluation:case\_study, evaluation:algorithmic, application:document, special-purpose_layout},
  pages = {418--429},
  series = {SDM},
  title = {{ContexTour}: Contextual Contour Visual Analysis on Dynamic Multi-Relational Clustering},
  year = {2010}
}

@article{Loubier2008Temporal,
  abstract = {This article presents a tool namely VisuGraph, designed to support temporal data visualization by means of graph representation that offers users a synthetic view of knowledge, difficult to extract from a data corpus. The temporal dimension adds the possibility to situate past, but also present or future events and strategies. In this context, we propose a graph-morphing algorithm in order to highlight major tendencies and significant data changes during different periods of time. The goal is to present an animation based on a graph of temporal data, with every period pooled, followed up by each period graph successively. Our approach is based on a space-time analogy like for a clock. For each period, we propose to design a temporal mark, represented in a chronological order in the extremities of the visualization frame, like the hours on a clock. Each element of data is placed near the temporal marks according to its presence during each period. Thus, visualization of the successive periods makes it possible to detect persisting or temporary data and to detect a chronology in the changes in relations.},
  author = {Loubier, Elo\"ise and Dousset, Bernard},
  journal = {Safety and Reliability for Managing Risk},
  keywords = {type:technique, paradigm:node-link, time:animation, force-directed_layout, evaluation:case_study, offline_problem, application:document, general-purpose_layout, transition_problem},
  number = {02},
  pages = {2008--16},
  series = {ESREL},
  title = {Temporal and relational data representation by graph morphing},
  volume = {14},
  year = {2008}
}

@article{Mashima2012Visualizing,
  abstract = {Maps offer a familiar way to present geographic data (continents, countries), and additional information (topography, geology), can be displayed with the help of contours and heat-map overlays. In this paper, we consider visualizing large-scale dynamic relational data by taking advantage of the geographic map metaphor. We describe a map-based visualization system which uses animation to convey dynamics in large data sets, and which aims to preserve the viewer’s mental map while also offering readable views at all times. Our system is fully functional and has been used to visualize user traffic on the Internet radio station last.fm, as well as TV-viewing patterns from an IPTV service. All map images in this paper are available in high-resolution at [1] as are several movies illustrating the dynamic visualization.},
  author = {Mashima, Daisuke and Kobourov, Stephen G and Hu, Yifan},
  doi = {10.1109/TVCG.2011.288},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {map\_metaphor, mental\_map, type:technique, paradigm:node-link, time:animation, evaluation:case\_study, application:media, compound_graph, special-purpose_layout},
  number = {9},
  pages = {1424--1437},
  publisher = {IEEE},
  series = {TVCG},
  title = {Visualizing Dynamic Data with Maps},
  volume = {18},
  year = {2012}
}

@article{Misue1995Layout,
  abstract = {Many models in software and information engineering use graph representations; examples are data flow diagrams, state transition diagrams, flow charts, PERT charts, organization charts, Petri nets and entity-relationship diagrams. The usefulness of these graph representations depends on the quality of the layout of the graphs. Automatic graph layout, which can release humans from graph drawing, is now available in several visualization systems. Most automatic layout facilities take a purely combinatorial description of a graph and produce a layout of the graph; these methods are called 'layout creation' methods. For interactive systems, another kind of layout is needed: a facility which can adjust a layout after a change is made by the user or by the application. Although layout adjustment is essential in interactive systems, most existing layout algorithms are designed for layout creation. The use of a layout creation method for layout adjustment may totally rearrange the layout and thus destroy the user's 'mental map' of the diagram; thus a set of layout adjustment methods, separate from layout creation methods, is needed. This paper discusses some layout adjustment methods and the preservation of the 'mental map' of the diagram. First, several models are proposed to make the concept of 'mental map' more precise. Then two kinds of layout adjustments are described. One is an algorithm for rearranging a diagram to avoid overlapping nodes, and the other is a method aimed at changing the focus of interest of the user without destroying the mental map. Next, some experience with visualization systems in which the techniques have been employed is also described.},
  author = {Misue, Kazuo and Eades, Peter and Lai, Wei and Sugiyama, Kozo},
  doi = {10.1006/jvlc.1995.1010},
  issn = {1045926X},
  journal = {Journal of Visual Languages \& Computing},
  keywords = {type:technique, paradigm:node-link, time:animation, evaluation:case\_study, compound_graph, application:software\_engineering, application:social, online\_problem, mental\_map, general-purpose_layout},
  number = {2},
  pages = {183--210},
  title = {Layout Adjustment and the Mental Map},
  volume = {6},
  year = {1995}
}

@article{Moody2005Dynamic,
  abstract = {Increased interest in longitudinal social networks and the recognition that visualization fosters theoretical insight create a need for dynamic network visualizations, or network ``movies.'' This article confronts theoretical questions surrounding the temporal representations of social networks and technical questions about how best to link network change to changes in the graphical representation. The authors divide network movies into (1) static flip books, where node position remains constant but edges cumulate over time, and (2) dynamic movies, where nodes move as a function of changes in relations. Flip books are particularly useful in contexts where relations are sparse. For more connected networks, movies are often more appropriate. Three empirical examples demonstrate the advantages of different movie styles. A new software program for creating network movies is discussed in the appendix.},
  author = {Moody, James and McFarland, Daniel A and Bender-deMoll, Skye},
  doi = {10.1086/421509},
  journal = {American Journal of Sociology},
  keywords = {time:animation, paradigm:node-link, application:social, type:application, evaluation:case_study},
  number = {4},
  pages = {1206--1241},
  title = {Dynamic Network Visualisation},
  volume = {110},
  year = {2005}
}

@inproceedings{Nesbitt2002Applying,
  abstract = {Graphs are a commonly used data structure for representing relational information. Drawings of these structures, as node and link diagrams, can provide a useful visualization of the underlying abstract data. This makes drawings of graphs a useful tool in information visualization. Indeed graph drawing has been applied in many application areas including software engineering, knowledge management and for depicting communication networks. The spatial layout can help the user build up a cognitive model or 'mental map' of the information structure. Many automatic algorithms for producing drawings of a graph have been implemented. In many domains it is also common for the underlying information to be dynamic and this means the graph drawing must be updated. Unfortunately, even small changes to the underlying data can result in dramatic changes to the final drawing and this means the user may totally lose their previous 'mental map'. Animation between the two versions of the layout is one approach that can assist the user to make the transition between the two drawings. We have been examining how to apply the Gestalt principles of organisation to this animation phase. The aim is to assist the user in understanding the structural and visual changes that have occurred in the layout. Results of that work are described with relevant examples.},
  author = {Nesbitt, Keith V and Friedrich, Carsten},
  booktitle = {Proceedings of the 6th International Conference on Information Visualisation},
  doi = {10.1109/IV.2002.1028859},
  keywords = {gestalt_laws, mental_map, type:technique, paradigm:node-link, time:animation, evaluation:case_study, application:generic, compound_graph, general-purpose_layout, transition_problem},
  pages = {737--743},
  publisher = {IEEE},
  series = {IV},
  title = {Applying Gestalt Principles to Animated Visualizations of Network Data},
  year = {2002}
}

@inproceedings{North1996Incremental,
  abstract = {Graph drawings are a basic component of user interfaces that display relationships between objects. Generating incrementally stable layouts is important for many applications. This paper describes DynaDAG, a new heuristic for incremental layout of directed acyclic graphs drawn as hierarchies, and its application in the DynaGraph system.},
  author = {North, Stephen C},
  booktitle = {Graph Drawing},
  doi = {10.1007/BFb0021824},
  keywords = {paradigm:node-link, type:technique, acyclic_graph, mental_map, time:animation, application:generic, evaluation:none, online_problem, special-purpose_layout},
  organization = {Springer},
  pages = {409--418},
  series = {GD},
  title = {Incremental layout in {DynaDAG}},
  year = {1996}
}

@article{Oelke2013Fingerprint,
  abstract = {In prose literature often complex dynamics of interpersonal relationships can be observed between the different characters. Traditionally, node-link diagrams are used to depict the social network of a novel. However, static graphs can only visualize the overall social network structure but not the development of the networks over the course of the story, while dynamic graphs have the serious problem that there are many sudden changes between different portions of the overall social network. In this paper we explore means to show the relationships between the characters of a plot and at the same time their development over the course of a novel. Based on a careful exploration of the design space, we suggest a new visualization technique called Fingerprint Matrices. A case study exemplifies the usage of Fingerprint Matrices and shows that they are an effective means to analyze prose literature with respect to the development of relationships between the different characters.},
  author = {Oelke, Daniela  and Kokkinakis, Dimitrios  and Keim, Daniel A},
  doi = {10.1111/cgf.12124},
  journal = {Computer Graphics Forum},
  keywords = {type:application, paradigm:matrix, time:timeline, evaluation:case\_study, application:social},
  number = {3pt4},
  pages = {371--380},
  series = {CGF},
  title = {{Fingerprint Matrices}: Uncovering the dynamics of social networks in prose literature},
  volume = {32},
  year = {2013}
}

@inproceedings{Ogawa2008StarGate,
  abstract = {With the success of open source software projects, such as Apache and Mozilla, comes the opportunity to study the development process. In this paper, we present StarGate: a novel system for visualizing software projects. Whereas previous software project visualizations concentrated mainly on the source code changes, we literally place the developers in the center of our design. Developers are grouped visually into clusters corresponding to the areas of the file repository they work on the most. Connections are drawn between people who communicate via email. The changes to the repository are also displayed. With StarGate, it is easy to look beyond the source code and see trends in developer activity. The system can be used by anyone interested in the project, but it especially benefits project managers, project novices and software engineering researchers.},
  author = {Ogawa, Michael and Ma, Kwan-Liu},
  booktitle = {Proceedings of the IEEE Pacific Visualization Symposium},
  doi = {10.1109/PACIFICVIS.2008.4475476},
  keywords = {type:application, time:animation, paradigm:node-link, application:software_engineering, software_evolution, radial, evaluation:case_study},
  pages = {191--198},
  publisher = {IEEE},
  series = {PacificVis},
  title = {{StarGate}: A unified, interactive visualization of software projects},
  year = {2008}
}

@article{Ogawa2009codeswarm,
  abstract = {In May of 2008, we published online a series of software visualization videos using a method called code_swarm. Shortly thereafter, we made the code open source and its popularity took off. This paper is a study of our code swarm application, comprising its design, results and public response. We share our design methodology, including why we chose the organic information visualization technique, how we designed for both developers and a casual audience, and what lessons we learned from our experiment. We validate the results produced by code_swarm through a qualitative analysis and by gathering online user comments. Furthermore, we successfully released the code as open source, and the software community used it to visualize their own projects and shared their results as well. In the end, we believe code_swarm has positive implications for the future of organic information design and open source information visualization practice.},
  author = {Ogawa, Michael and Ma, Kwan-Liu},
  doi = {10.1109/TVCG.2009.123},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:application, paradigm:node-link, omitted_links, time:animation, time:timeline, evaluation:user_study, application:software_engineering, software_evolution},
  number = {6},
  pages = {1097--1104},
  publisher = {IEEE},
  series = {TVCG},
  title = {code\_swarm: A design study in organic software visualization},
  volume = {15},
  year = {2009}
}

@inproceedings{Perer2012MatrixFlow,
  abstract = {To develop a visual analytic system to help medical professionals improve disease diagnosis by providing insights for understanding disease progression. We develop MatrixFlow, a visual analytic system that takes clinical event sequences of patients as input, constructs time-evolving networks and visualizes them as a temporal flow of matrices. MatrixFlow provides several interactive features for analysis: 1) one can sort the events based on the similarity in order to accentuate underlying cluster patterns among those events; 2) one can compare co-occurrence events over time and across cohorts through additional line graph visualization. MatrixFlow is applied to visualize heart failure (HF) symptom events extracted from a large cohort of HF cases and controls (n},
  author = {Perer, Adam and Sun, Jimeng},
  booktitle = {AMIA Annual Symposium Proceedings},
  keywords = {type:application, time:timeline, paradigm:matrix, evaluation:case_study, application:biology},
  pages = {716},
  publisher = {American Medical Informatics Association},
  series = {AMIA},
  title = {{MatrixFlow}: Temporal network visual analytics to track symptom evolution during disease progression},
  volume = {2012},
  year = {2012}
}

@inproceedings{Pohl2008Interactive,
  abstract = {A variety of applications especially in the area of Web 2.0 produce frequently altering hierarchical networks. Thus application operators, members of community websites but also media scientists often are interested in gaining deeper insights in the complex structures of their project and its development over time. In order to enable a suitable visualization of such networks it is not only required to implement an intelligent data management but also a suitable network drawing engine that cares for the user's needs --- especially for visualization of network dynamics. This paper presents the  Xldn  visualization tool that enables visual exploration of evolving hierarchical networks. It includes a layout generation algorithm that allows for the preservation of the mental map --- a crucial property when visualizing dynamic networks. By utilization of an efficient data management and a parallel implementation of the graph drawing algorithm  Xldn  provides a reasonably fast and interactive network visualization. This way  Xldn  facilitates an in-depth evolution analysis of large hierarchic networks.},
  author = {Pohl, Mathias and Birke, Peter},
  booktitle = {Proceedings of the 10th International Conference on Visual Information Systems},
  doi = {10.1007/978-3-540-85891-1\_8},
  isbn = {978-3-540-85890-4},
  journal = {Visual Information Systems. Web-Based Visual Information Search and Management},
  keywords = {type:technique, paradigm:node-link, compound_graph, mental\_map, time:animation, evaluation:none, application:social, special-purpose_layout},
  pages = {56--67},
  publisher = {Springer-Verlag},
  series = {VISUAL},
  title = {Interactive Exploration of Large Dynamic Networks},
  year = {2008}
}

@inproceedings{Pupyrev2010Analyzing,
  abstract = {In this paper, we consider the problem of analysis and visualization of online conversations (chat histories, email archives, etc.). We present a dynamic graph drawing algorithm based on modification of multidimensional scaling. The algorithm builds a layout of sequence of graphs and produces a slice view of the evolution of online communications. The method have been applied for visualization of two real-world datasets. We show how to use these visualizations for analyzing and extracting hidden temporal patterns from online conversation data.},
  author = {Pupyrev, Sergey and Tikhonov, Alexey},
  booktitle = {Proceedings of the 10th International Conference on Intelligent Systems Design and Applications},
  doi = {10.1109/ISDA.2010.5687175},
  keywords = {type:application, paradigm:node-link, time:timeline, evaluation:case\_study, application:social, social_media},
  organization = {IEEE},
  pages = {748--753},
  series = {ISDA},
  title = {Analyzing Conversations with Dynamic Graph Visualization},
  year = {2010}
}

@incollection{Purchase2007Important,
  abstract = {While some research has been performed on the human understanding of static graph layout algorithms, dynamic graph layout algorithms have only recently been developed sufficiently to enable similar investigations. This paper presents the first empirical analysis of a dynamic graph layout algorithm, focusing on the assumption that maintaining the  ” mental map” between time-slices assists with the comprehension of the evolving graph. The results confirm this assumption with respect to some categories of tasks.},
  author = {Purchase, Helen C and Hoggan, Eve and G\"org, Carsten},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-540-70904-6_19},
  isbn = {978-3-540-70903-9},
  keywords = {mental\_map, type:evaluation, paradigm:node-link, time:animation, evaluation:user_study, application:generic},
  pages = {184--195},
  publisher = {Springer},
  series = {GD},
  title = {How Important Is the ``Mental Map''? -- An Empirical Investigation of a Dynamic Graph Layout Algorithm Graph Drawing},
  year = {2007}
}

@incollection{Purchase2008Extremes,
  abstract = {Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs which represent changing relational information over time. Like the static layout algorithms that preceded these, empirical work lags behind their design, and assumptions are made about how users’ comprehension may be enhanced without human data to support them. This paper presents an experiment investigating an existing dynamic layout algorithm, focusing on the effect of the preservation of the mental map on comprehension. The results indicate that extremes produce better performance, suggesting that individual preference may be important.},
  author = {Purchase, Helen C and Samra, Amanjit},
  booktitle = {Diagrammatic Representation and Inference},
  doi = {10.1007/978-3-540-87730-1_9},
  keywords = {mental\_map, paradigm:node-link, type:evaluation, mental\_map, evaluation:user\_study, time:animation, application:social},
  pages = {60--73},
  publisher = {Springer},
  series = {Diagrams},
  title = {Extremes are better: Investigating mental map preservation in dynamic graphs},
  year = {2008}
}

@inproceedings{Reitz2009Focused,
  abstract = {Many applications feature large hierarchic dynamic graphs that change over time. Often, these changes are more important than the graphs themselves.In our approach, areas of interests in dynamic graphs are detected based on user preferences. The user is guided from one area of interest to another in such a way that reduced contextual information is shown. To this end, dynamic graph layout mechanisms are extended by a reprocessing that decides what to show and a post processing that stages the animation based on spatial information.},
  author = {Reitz, Florian and Pohl, Mathias and Diehl, Stephan},
  booktitle = {Proceedings of the 13th International Conference on Information Visualisation},
  doi = {10.1109/iv.2009.24},
  isbn = {978-0-7695-3733-7},
  keywords = {paradigm:node-link, time:animation, compound_graph, evaluation:case\_study, application:software\_engineering, type:technique, special-purpose_layout},
  pages = {679--684},
  publisher = {IEEE},
  series = {IV},
  title = {Focused Animation of Dynamic Compound Digraphs},
  year = {2009}
}

@article{Reitz2010Framework,
  abstract = {Understanding constellations in large data collections has become a common task. One obstacle a user has to overcome is the internal complexity of these repositories. For example, extracting connected data from a normalized relational database requires knowledge of the table structure which might not be available for the casual user. In this paper we present a visualization framework which presents the collection as a set of entities and relations (on the data level). Using rating functions, we divide large relation networks into small graphs which resemble ego-centered networks. These graphs are connected so the user can browse from one to another. To further assist the user, we present two views which embed information on the evolution of the relations into the graphs. Each view emphasizes another aspect of temporal development. The framework can be adapted to any repository by a flexible data interface and a graph configuration file. We present some first web-based applications including a visualization of the DBLP data set. We use the DBLP visualization to evaluate our approach.},
  author = {Reitz, Florian},
  journal = {arXiv preprint arXiv:1009.5183},
  keywords = {type:technique, paradigm:node-link, time:timeline, ego\_network, evaluation:case\_study, evaluation:user\_study, application:document, integrated_node-link, radial},
  series = {CoRR},
  title = {A Framework for an Ego-Centered and Time-Aware Visualization of Relations in Arbitrary Data Repositories},
  url = {http://arxiv.org/abs/1009.5183},
  year = {2010}
}

@article{Rey2010Controlling,
  abstract = {The experiment investigated whether controlling presentation speed as well as labels, which display the names of the currently presented nodes in interactive dynamic graphs, affects comprehension performance. Dynamic graphs are animated graphical representations of nodes and edges representing mathematical structures used to model relations between different objects over time. After being tested on spatial imagination and linguistic thinking, 111 students had to answer twelve multiple choice comprehension questions about six interactive dynamic graphs while working with them. For each question, participants were randomly assigned to one cell of a 2 (with or without a scrollbar to adjust the presentation speed of the visualization) × 2 (with labels displaying all names of the currently presented nodes in the dynamic graphs or with tooltips displaying only one node name if the mouse cursor hovers over this node) factorial design. Scrollbars, which allow adjusting the presentation speed, were rarely used and did not foster learners’ comprehension performance. Labels displaying all names of the currently presented nodes fostered learners’ comprehension performance compared to tooltips. The higher the ability for linguistic thinking of the participants, the more their comprehension performance benefited from labels. These results are consistent with the cognitive-affective theory of learning with media.},
  author = {Rey, G\"unter D and Diehl, Stephan},
  doi = {10.1027/1864-1105/a000021},
  journal = {Journal of Media Psychology: Theories, Methods, and Applications},
  keywords = {type:evaluation, time:animation, paradigm:node-link, evaluation:user\_study, application:generic},
  number = {4},
  pages = {160--170},
  publisher = {Hogrefe Publishing},
  title = {Controlling presentation speed, labels, and tooltips in interactive dynamic graphs},
  volume = {22},
  year = {2010}
}

@incollection{Rohrschneider2010Visual,
  abstract = {We extend our previous work on the exploration of static metabolic networks to evolving, and therefore dynamic, pathways. We apply our visualization software to data from a simulation of early metabolism. Thereby, we show that our technique allows us to test and argue for or against different scenarios for the evolution of metabolic pathways. This supports a profound and efficient analysis of the structure and properties of the generated metabolic networks and its underlying components, while giving the user a vivid impression of the dynamics of the system. The analysis process is inspired by Ben Shneiderman’s mantra of information visualization. For the overview, user-defined diagrams give insight into topological changes of the graph as well as changes in the attribute set associated with the participating enzymes, substances and reactions. This way, “interesting features” in time as well as in space can be recognized. A linked view implementation enables the navigation into more detailed layers of perspective for in-depth analysis of individual network configurations.},
  author = {Rohrschneider, Markus and Ullrich, Alexander and Kerren, Andreas and Stadler, Peter F and Scheuermann, Gerik},
  booktitle = {Advances in Visual Computing},
  doi = {10.1007/978-3-642-17289-2_31},
  keywords = {paradigm:node-link, time:timeline, time:animation, type:application, application:biology, evaluation:case_study},
  pages = {316--327},
  publisher = {Springer},
  series = {ISVC},
  title = {Visual network analysis of dynamic metabolic pathways},
  year = {2010}
}

@article{Rufiange2013DiffAni,
  ISSN = {1077-2626},
  abstract = {Visualization of dynamically changing networks (graphs) is a significant challenge for researchers. Previous work has experimentally compared animation, small multiples, and other techniques, and found trade-offs between these. One potential way to avoid such trade-offs is to combine previous techniques in a hybrid visualization. We present two taxonomies of visualizations of dynamic graphs: one of non-hybrid techniques, and one of hybrid techniques. We also describe a prototype, called DiffAni, that allows a graph to be visualized as a sequence of three kinds of tiles: diff tiles that show difference maps over some time interval, animation tiles that show the evolution of the graph over some time interval, and small multiple tiles that show the graph state at an individual time slice. This sequence of tiles is ordered by time and covers all time slices in the data. An experimental evaluation of DiffAni shows that our hybrid approach has advantages over non-hybrid techniques in certain cases.},
  author = {Rufiange, S{\'e}bastien and McGuffin, Michael J},
  doi = {10.1109/TVCG.2013.149},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {type:technique, paradigm:node-link, evaluation:user\_study, application:generic, graph\_difference, taxonomy, time:timeline, time:animation, time_aggregation, animated_timeline},
  number = {12},
  pages = {2556-2565},
  series = {TVCG},
  title = {{DiffAni}: Visualizing Dynamic Graphs with a Hybrid of Difference Maps and Animation},
  volume = {19},
  year = {2013}
}

@inproceedings{Rufiange2014AniMatrix,
  abstract = {Software designs are ever changing to adapt to new environments and requirements. Tracking and understanding changes in modules and relationships in a software project is difficult, but even more so when the software goes through several types of changes. The typical complexity and size of software also makes it harder to grasp software evolution patterns. In this paper, we present an interactive matrix-based visualization technique that, combined with animation, depicts how software designs evolve. For example, it shows which new modules and couplings are added and removed over time. Our generic visualization supports dynamic and weighted digraphs and is applied in the context of software evolution. Analyzing source code changes is important to determine the software’s structural organization and identify quality issues over time. To demonstrate our approach, we explore open-source repositories and discuss some of our findings regarding these evolving software designs.},
  author = {Rufiange, S{\'e}bastien and Melan{\c{c}}on, Guy},
  booktitle = {Proceedings of the 2nd IEEE Working Conference on Software Visualization},
  keywords = {type:technique, time:animation, paradigm:matrix, application:software_engineering, evaluation:case_study, taxonomy, transition_problem, weighted_graph, multivariate_graph, directed_graph},
  pages = {137--146},
  series = {VISSOFT},
  title = {{AniMatrix}: A Matrix-Based Visualization of Software Evolution},
  url = {http://conferences.computer.org/vissoft/2014/papers/6150a137.pdf},
  year = {2014}
}

@article{Rufiange2014Visualizing,
  abstract = {Identifying and tracking evolving software structures at a design level is a challenging task. Although there are ways to visualize this information statically, there is a need for methods that help analyzing the evolution of software design elements. In this paper, we present a new visual approach to identify variability zones in software designs and explore how they evolve over time. To verify the usefulness of our approach, we did a user study in which participants had to browse software histories and find visual patterns. Most participants were able to find interesting observations and found our approach intuitive and useful. We present a number of design aspects that were observed by participants and the authors using our IHVis tool on four open-source projects.},
  author = {Rufiange, S{\'e}bastien and Fuhrman, Christopher P},
  doi = {10.1016/j.jss.2013.10.044},
  journal = {Journal of Systems and Software},
  keywords = {type:application, paradigm:node-link, evaluation:user_study, software_evolution, application:software_engineering, graph_difference, time:timeline, time:animation, juxtaposed_node-link},
  number = {0},
  pages = {231--249},
  publisher = {Elsevier},
  series = {JSS},
  title = {Visualizing protected variations in evolving software designs},
  volume = {88},
  year = {2014}
}

@inproceedings{Saffrey2008Mental,
  abstract = {The design of automatic layout algorithms for single graphs is a well established field, and some recent studies show how these algorithms affect human understanding. By contrast, layout algorithms for graphs that change over time are relatively immature, and few studies exist to evaluate their effectiveness empirically. This paper presents two new dynamic graph layout algorithms and empirical investigations of how effective these algorithms are with respect to human understanding. Central to each algorithm is the "mental map": the degree to which the layout supports continuous understanding. This work aims to evaluate the importance of the mental map, alongside traditional static graph aesthetics, in answering questions about dynamic graphs. We discover that a simple concept of the mental map is not sufficient for increasing understanding of the graph.},
  author = {Saffrey, Peter and Purchase, Helen C},
  booktitle = {Proceedings of the 9th Conference on Australasian User Interface},
  keywords = {time:animation, mental\_map, paradigm:node-link, evaluation:user\_study, type:evaluation, application:generic},
  pages = {85--93},
  publisher = {Australian Computer Society, Inc.},
  series = {AUIC},
  title = {The ``mental map'' versus ``static aesthetic'' compromise in dynamic graphs: a user study},
  year = {2008}
}

@inproceedings{Sallaberry2012Clustering,
  abstract = {In this paper, we present a new approach to exploring dynamic graphs. We have developed a new clustering algorithm for dynamic graphs which finds an ideal clustering for each time-step and links the clusters together. The resulting time-varying clusters are then used to define two visual representations. The first view is an overview that shows how clusters evolve over time and provides an interface to find and select interesting time-steps. The second view consists of a node link diagram of a selected time-step which uses the clustering to efficiently define the layout. By using the time-dependant clustering, we ensure the stability of our visualization and preserve user mental map by minimizing node motion, while simultaneously producing an ideal layout for each time step. Also, as the clustering is computed ahead of time, the second view updates in linear time which allows for interactivity even for graphs with upwards of tens of thousands of nodes.},
  author = {Sallaberry, Arnaud and Muelder, Chris and Ma, Kwan-Liu},
  booktitle = {Graph Drawing},
  doi = {10.1007/978-3-642-36763-2_43},
  keywords = {paradigm:node-link, type:technique, clustering, application:infrastructure, evaluation:case\_study, time:timeline, time:animation, linear\_arrangement, mental\_map, compound_graph},
  pages = {487-498},
  publisher = {Springer},
  series = {GD},
  survey:data = {(n:41928, e:218080, t:421)},
  title = {Clustering, Visualizing, and Navigating for Large Dynamic Graphs},
  year = {2012}
}

@inproceedings{Saraiya2005Visualization,
  abstract = {The most common approach to support analysis of graphs with associated time series data include: overlay of data on graph vertices for one timepoint at a time by manipulating a visual property (e.g. color) of the vertex, along with sliders or some such mechanism to animate the graph for other timepoints. Alternatively, data from all the timepoints can be overlaid simultaneously by embedding small charts into graph vertices. These graph visualizations may also be linked to other visualizations (e.g., parallel co-ordinates) using brushing and linking. This paper describes a study performed to evaluate and rank graph+timeseries visualization options based on users' performance time and accuracy of responses on predefined tasks. The results suggest that overlaying data on graph vertices one timepoint at a time may lead to more accurate performance for tasks involving analysis of a graph at a single timepoint, and comparisons between graph vertices for two distinct timepoints. Overlaying data simultaneously for all the timepoints on graph vertices may lead to more accurate and faster performance for tasks involving searching for outlier vertices displaying different behavior than the rest of the graph vertices for all timepoints. Single views have advantage over multiple views on tasks that require topological information. Also, the number of attributes displayed on nodes has a non trivial influence on accuracy of responses, whereas the number of visualizations affect the performance time.},
  author = {Saraiya, Purvi and Lee, Peter and North, Chris},
  booktitle = {Proceedings of the 2005 IEEE Symposium on Information Visualization},
  doi = {10.1109/INFVIS.2005.1532151},
  isbn = {0-7803-9464-x},
  keywords = {paradigm:node-link, type:evaluation, time:timeline, application:biology, evaluation:user\_study},
  pages = {225-232},
  publisher = {IEEE Computer Society},
  series = {InfoVis},
  title = {Visualization of Graphs with Associated Timeseries Data},
  year = {2005}
}

@misc{Shannon2007Considerations,
  abstract = {In this survey paper we discuss the considerations involved in modeling, visualising and exploring dynamic graphs—those graphs which are continually changing in structure to reflect the evolution of the system they are representing. The design of algorithms to analyse and generate visualisations of dynamic graphs pose both a technical and perceptual problem. A range of additional issues beyond those encountered for static graphs are uncovered, from the need for efficient dynamic data structures and algorithms to the difficulties of keeping a visualisation understandable for the user while it is constantly changing its form.},
  author = {Shannon, Ross and Quigley, Aaron J},
  keywords = {type:evaluation, paradigm:node-link, mental_map, time:animation, evaluation:survey, application:generic},
  title = {Considerations in Dynamic Graph Drawing: A Survey},
  url = {http://rossshannon.com/publications/softcopies/rs2007-dynamic-graphs-survey.pdf},
  year = {2007}
}

@inproceedings{Shi2011Dynamic,
  abstract = {The dynamic network visualization has been a challenging topic due to the complexity introduced by the extra time dimension. Existing solutions to this problem are usually good for the overview and presentation, but not for the interactive analysis. We propose in this paper a new approach which only considers the dynamic network central to a focus node (aka dynamic ego network). The navigation of the entire network is achieved by switching the focus node with user interactions. With this approach, the complexity of the compressed dynamic network is greatly reduced without sacrificing the network and time affinity central to the focus node. As a result, we are able to present each dynamic ego network in a single static view, well supporting user analysis on temporal network patterns. We describe our general framework including the network data pre-processing, 1.5D network and trend visualization design, layout algorithms, as well as several customized interactions. In addition, we show that our approach can also be extended to visualize the event-based and multimodal dynamic networks. Finally, we demonstrate, through two practical case studies, the effectiveness of our solution in support of visual evidence and pattern discovery.},
  author = {Shi, Lei and Wang, Chen and Wen, Zhen},
  booktitle = {Proceedings of the 2011 IEEE Pacific Visualization Symposium},
  doi = {10.1109/PACIFICVIS.2011.5742388},
  keywords = {paradigm:node-link, type:technique, application:social, application:document, evaluation:case\_study, time:timeline, ego\_network, integrated_node-link, directed_graph, force-directed_layout},
  pages = {179--186},
  publisher = {IEEE},
  series = {PacificVis},
  title = {Dynamic network visualization in {1.5D}},
  year = {2011}
}

@incollection{Smuc2014Connect,
  abstract = {In recent years, the analysis of dynamic network data has become an increasingly prominent research issue. While several visual analytics techniques with the focus on the examination of temporal evolving networks have been proposed in recent years, their effectiveness and utility for end users need to be further analyzed. When dealing with techniques for dynamic network analysis, which integrate visual, computational, and interactive components, users become easily overwhelmed by the amount of information displayed—even in case of small sized networks. Therefore we evaluated visual analytics techniques for dynamic networks during their development, performing intermediate evaluations by means of mock-up and eye-tracking studies and a final evaluation of the running interactive prototype, traceing three pathways of development in detail: The first one focused on the maintenance of the user’s mental map throughout changes of network structure over time, changes caused by user interactions, and changes of analytical perspectives. The second one addresses the avoidance of visual clutter, or at least its moderation. The third pathway of development follows the implications of unexpected user behaviour and multiple problem solving processes. Aside from presenting solutions based on the outcomes of our evaluation, we discuss open and upcoming problems and set out new research questions.},
  author = {Smuc, Michael and Federico, Paolo and Windhager, Florian and Aigner, Wolfgang and Zenk, Lukas and Miksch, Silvia},
  booktitle = {Handbook of Human Centric Visualization},
  doi = {10.1007/978-1-4614-7485-2_25},
  keywords = {type:evaluation, evaluation:user_study, mental_map, application:social, paradigm:node-link, time:timeline, juxtaposed_node-link, superimposed_node-link, 3d, evaluation:expert},
  pages = {623--650},
  publisher = {Springer},
  title = {How do you connect moving dots? Insights from user studies on dynamic network visualizations},
  year = {2014}
}

@incollection{Stab2010SemaTime,
  abstract = {Timeline based visualizations arrange time-dependent entities along a time-axis and are used in many different domains like digital libraries, criminal investigation and medical information systems to support users in understanding chronological structures. By the use of semantic technologies, the information is categorized in a domain-specific, hierarchical schema and specified by semantic relations. Commonly semantic relations in timeline visualizations are depicted by interconnecting entities with a directed edge. However it is possible that semantic relations change in the course of time. In this paper we introduce a new timeline visualization for time-dependent semantics called SemaTime that offers a hierarchical categorization of time-dependent entities including navigation and filtering features. We also present a novel concept for visualizing time-dependent relations that allows the illustration of time-varying semantic relations and affords an easy understandable visualization of complex, time-dependent interrelations.},
  author = {Stab, Christian and Nazemi, Kawa and Fellner, Dieter W},
  booktitle = {Advances in Visual Computing},
  doi = {10.1007/978-3-642-17277-9_53},
  isbn = {978-3-642-17276-2},
  keywords = {type:application, time:timeline, paradigm:node-link, evaluation:case\_study, application:document},
  pages = {514--523},
  publisher = {Springer},
  series = {ISVC},
  title = {{SemaTime} -- Timeline Visualization of Time-Dependent Relations and Semantics},
  year = {2010}
}

@inproceedings{Stein2010PixelOriented,
  abstract = {We propose a new approach to visualize social networks. Most common network visualizations rely on graph drawing. While without doubt useful, graphs suffer from limitations like cluttering and important patterns may not be realized especially when networks change over time. Our approach adapts pixel-oriented visualization techniques to social networks as an addition to traditional graph visualizations. The visualization is exemplified using social networks based on corporate wikis.},
  author = {Stein, Klaus and Wegener, Ren\'e and Schlieder, Christoph},
  booktitle = {Proceedings of the 2010 International Conference on Advances in Social Networks Analysis and Mining},
  doi = {10.1109/asonam.2010.18},
  isbn = {978-0-7695-4138-9},
  keywords = {type:technique, paradigm:matrix, time:timeline, evaluation:case\_study, application:social, intra-cell_timelines},
  pages = {233--240},
  publisher = {IEEE},
  series = {ASONAM},
  title = {Pixel-Oriented Visualization of Change in Social Networks},
  year = {2010}
}

@inproceedings{Toyoda2005System,
  abstract = {We propose WebRelievo, a system for visualizing and analyzing the evolution of the web structure based on a large Web archive with a series of snapshots. It visualizes the evolution with a time series of graphs, in which nodes are web pages, and edges are relationships between pages. Graphs can be clustered to show the overview of changes in graphs. WebRelievo aligns these graphs according to their time, and automatically determines their layout keeping positions of nodes synchronized over time, so that the user can keep track pages and clusters. This visualization enables us to understand when pages appeared, how their relationships have evolved, and how clusters are merged and split over time. Current implementation of WebRelievo is based on six Japanese web archives crawled from 1999 to 2003. The user can interactively browse those graphs by changing the focused page and by changing layouts of graphs. Using WebRelievo we can answer historical questions, and to investigate changes in trends on the Web. We show the feasibility of WebRelievo by applying it to tracking trends in P2P systems and search engines for mobile phones, and to investigating link spamming.},
  author = {Toyoda, Masashi and Kitsuregawa, Masaru},
  booktitle = {Proceedings of the 16th ACM Conference on Hypertext and Hypermedia},
  doi = {10.1145/1083356.1083387},
  keywords = {type:application, paradigm:node-link, time:timeline, application:document, clustering, evaluation:case_study},
  pages = {151--160},
  publisher = {ACM},
  series = {HYPERTEXT},
  title = {A system for visualizing and analyzing the evolution of the web with a time series of graphs},
  year = {2005}
}

@inproceedings{Trier2006Towards,
  abstract = {Communities of Practice regularly utilize virtual means of communication. The according software support provides its members with many sophisticated features for generating content and for communicating with each other via the internet or intranet. However, functionalities to monitor, assess, coordinate, and communicate the quality and development of the underlying electronicnetworks of experts are frequently missing. To meet this need of increased manageability, this contribution introduces a Social Network Intelligence software approach which aims at supporting the comprehension of the structure and value of electronic communities by automatically extracting and mining available electronic data of various types of virtual communication networks, like e-mail archives, discussion groups, or instant messaging communication. Experimental structural visualizations employing Social Network Analysis methods are combined with Keyword Extraction to move towards a Social Network Intelligence approach which generates transparency of complex virtual communication networks. Together with a comprehensive visualization method, an approach for software-supported communication network measurement and evaluation is suggested. It supports the identification of important participants, topics, or clusters in the network, evaluates the interpersonal communication structure and visually traces the evolvement of the knowledge exchange over time.},
  author = {Trier, Matthias},
  booktitle = {Virtuelle Organisationen und Neue Medien},
  keywords = {time:animation, type:application, paradigm:node-link, evaluation:case_study, application:social},
  pages = {331--342},
  publisher = {TUDPress},
  title = {Towards a social network intelligence tool for visual analysis of virtual communication networks},
  year = {2006}
}

@inproceedings{Vehlow2013Radial,
  abstract = {We propose a novel radial layered matrix visualization for dynamic directed weighted graphs in which the vertices can also be hierarchically organized. Edges are represented as color-coded arcs within the radial diagram. Their positions are defined by polar coordinates instead of Cartesian coordinates as in traditional adjacency matrix representations: the angular position of an edge within an annulus is given by the angle bisector of the two related vertices, the radial position depends linearly on the angular distance between these vertices. The exploration of time-varying relational data is facilitated by aligning graph patterns radially. Furthermore, our approach incorporates several interaction techniques to explore dynamic patterns such as trends and countertrends. The usefulness is illustrated by two case studies analyzing large dynamic call graphs acquired from open source software projects.},
  author = {Vehlow, Corinna and Burch, Michael and Schmauder, Hansj\"org and Weiskopf, Daniel},
  booktitle = {Proceedings of the 17th International Conference Information Visualisation},
  doi = {10.1109/IV.2013.6},
  keywords = {time:timeline, paradigm:matrix, compound_graph, evaluation:case_study, application:software_engineering, radial, type:technique, layered_matrices},
  pages = {51-58},
  publisher = {IEEE},
  series = {IV},
  title = {Radial Layered Matrix Visualization of Dynamic Graphs},
  year = {2013}
}

@article{Vehlow2013iVUN,
  abstract = {Background Mathematical models are nowadays widely used to describe biochemical reaction networks. One of the main reasons for this is that models facilitate the integration of a multitude of different data and data types using parameter estimation. Thereby, models allow for a holistic understanding of biological processes. However, due to measurement noise and the limited amount of data, uncertainties in the model parameters should be considered when conclusions are drawn from estimated model attributes, such as reaction fluxes or transient dynamics of biological species. We developed the visual analytics system iVUN that supports uncertainty-aware analysis of static and dynamic attributes of biochemical reaction networks modeled by ordinary differential equations. The multivariate graph of the network is visualized as a node-link diagram, and statistics of the attributes are mapped to the color of nodes and links of the graph. In addition, the graph view is linked with several views, such as line plots, scatter plots, and correlation matrices, to support locating uncertainties and the analysis of their time dependencies. As demonstration, we use iVUN to quantitatively analyze the dynamics of a model for Epo-induced JAK2/STAT5 signaling. Our case study showed that iVUN can be used to perform an in-depth study of biochemical reaction networks, including attribute uncertainties, correlations between these attributes and their uncertainties as well as the attribute dynamics. In particular, the linking of different visualization options turned out to be highly beneficial for the complex analysis tasks that come with the biological systems as presented here.},
  author = {Vehlow, Corinna and Hasenauer, Jan and Kramer, Andrei and Raue, Andreas and Hug, Sabine and Timmer, Jens and Radde, Nicole and Theis, Fabian J and Weiskopf, Daniel},
  doi = {10.1186/1471-2105-14-S19-S2},
  journal = {BMC Bioinformatics},
  keywords = {type:application, time:animation, time:timeline, paradigm:node-link, directed_graph, evaluation:case_study, application:biology},
  number = {Suppl 19},
  pages = {S2},
  publisher = {BioMed Central Ltd},
  title = {{iVUN}: interactive Visualization of Uncertain biochemical reaction Networks},
  volume = {14},
  year = {2013}
}

@article{Vehlow2014Visualizing,
  abstract = {The community structure of graphs is an important feature that gives insight into the high-level organization of objects within the graph. In real-world systems, the graph topology is oftentimes not static but changes over time and hence, also the community structure changes. Previous timeline-based approaches either visualize the dynamic graph or the dynamic community structure. In contrast, our approach combines both in a single image and therefore allows users to investigate the community structure together with the underlying dynamic graph. Our optimized ordering of vertices and selection of colors in combination with interactive highlighting techniques increases the traceability of communities along the time axis. Users can identify visual signatures, estimate the reliability of the derived community structure, and investigate whether community evolution interacts with changes in the graph topology. The utility of our approach is demonstrated in two application examples.},
  author = {Vehlow, Corinna and Beck, Fabian and Auw\"{a}rter, Patrick and Weiskopf, Daniel},
  comment = {to appear},
  journal = {Computer Graphics Forum},
  keywords = {type:technique, application:social, application:sports, time:timeline, paradigm:node-link, evaluation:case_study, clustering, compound_graph, linear_arrangement, juxtaposed_node-link, force-directed_layout},
  title = {Visualizing the Evolution of Communities in Dynamic Graphs},
  url = {http://www.visus.uni-stuttgart.de/uploads/tx_vispublications/CGF_Vehlow.pdf},
  year = {2014}
}

@article{Westenberg2008Visualizing,
  abstract = {DNA microarrays are used to measure the expression levels of thousands of genes simultaneously. In a time series experiment, the gene expressions are measured as a function of time. We present an application for integrated visualization of genome expression and network dynamics in both regulatory networks and metabolic pathways. Integration of these two levels of cellular processes is necessary, since it provides the link between the measurements at the transcriptional level (gene expression levels approximated from microarray data) and the phenotype (the observable characteristics of an organism) at the functional and behavioral level. The integration requires visualization approaches besides traditional clustering and statistical analysis methods. Our application can (i) visualize the data from time series experiments in the context of a regulatory network and KEGG metabolic pathways; (ii) identify and visualize active regulatory subnetworks from the gene expression data; (iii) perform a statistical test to identify and subsequently visualize pathways that are affected by differentially expressed genes. We present a case study, which demonstrates that our approach and application both facilitates and speeds up data analysis tremendously in comparison to a more traditional approach that involves many manual, laborious, and error-prone steps.},
  author = {Westenberg, Michel A and Van Hijum, Sacha AFT and Kuipers, Oscar P and Roerdink, Jos BTM},
  doi = {10.1111/j.1467-8659.2008.01221.x},
  journal = {Computer Graphics Forum},
  keywords = {type:application, time:timeline, paradigm:node-link, evaluation:case_study, application:biology},
  number = {3},
  pages = {887--894},
  publisher = {Blackwell Publishing Ltd},
  series = {CGF},
  title = {Visualizing genome expression and regulatory network dynamics in genomic and metabolic context},
  volume = {27},
  year = {2008}
}

@article{Windhager2011Visual,
  abstract = {Despite its well-known potential for applied use in organizations, social network analysis seems to fail relevant business analytical requirements in the areas of organizational change and software usability for non-expert users like managers and consultants. This position paper takes on this challenge by outlining a strategy of user-driven software development which aims to shift analytical procedures from the numerical to the visual realm. As network dynamics can be visualized using various methods, a comparative analysis of their respective strengths and weaknesses lays the basis for the suggested integration of additional visual methods into network exploration and interpretation procedures.},
  author = {Windhager, Florian and Zenk, Lukas and Federico, Paolo},
  doi = {10.1016/j.sbspro.2011.07.056},
  journal = {Procedia -- Social and Behavioral Sciences},
  keywords = {type:evaluation, paradigm:node-link, time:animation, time:timeline, evaluation:survey, application:social, application:business},
  pages = {59--68},
  publisher = {Elsevier},
  title = {Visual enterprise network analytics -- visualizing organizational change},
  volume = {22},
  year = {2011}
}

@inproceedings{Yang2008Visual,
  abstract = {In this article we describe a visual-analytic tool for the interrogation of evolving interaction network data such as those found in social, bibliometric, WWW and biological applications. The tool we have developed incorporates common visualization paradigms such as zooming, coarsening and filtering while naturally integrating information extracted by a previously described event-driven framework for characterizing the evolution of such networks. The visual front-end provides features that are specifically useful in the analysis of interaction networks, capturing the dynamic nature of both individual entities as well as interactions among them. The tool provides the user with the option of selecting multiple views, designed to capture different aspects of the evolving graph from the perspective of a node, a community or a subset of nodes of interest. Standard visual templates and cues are used to highlight critical changes that have occurred during the evolution of the network. A key challenge we address in this work is that of scalability - handling large graphs both in terms of the efficiency of the back-end, and in terms of the efficiency of the visual layout and rendering. Two case studies based on bibliometric and Wikipedia data are presented to demonstrate the utility of the toolkit for visual knowledge discovery.},
  author = {Yang, Xintian and Asur, Sitaram and Parthasarathy, Srinivasan and Mehta, Sameep},
  booktitle = {Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining},
  doi = {10.1145/1401890.1402011},
  keywords = {paradigm:node-link, application:document, compound_graph, time:animation, evaluation:case_study, type:application},
  pages = {1016--1024},
  publisher = {ACM},
  series = {KDD},
  title = {A visual-analytic toolkit for dynamic interaction graphs},
  year = {2008}
}

@article{Yi2010TimeMatrix,
  abstract = {Visualization plays a crucial role in understanding dynamic social networks at many different levels (i.e., group, subgroup, and individual). Node-link-based visualization techniques are currently widely used for these tasks and have been demonstrated to be effective, but it was found that they also have limitations in representing temporal changes, particularly at the individual and subgroup levels. To overcome these limitations, this article presents a new network visualization technique, called  ” TimeMatrix,” based on a matrix representation. Interaction techniques, such as overlay controls, a temporal range slider, semantic zooming, and integrated network statistical measures, support analysts in studying temporal social networks. To validate the design, the article presents a user study involving three social scientists analyzing inter-organizational collaboration data. The study demonstrates how TimeMatrix may help analysts gain insights about the temporal aspects of network data that can be subsequently tested with network analytic methods.},
  author = {Yi, Ji Soo and Elmqvist, Niklas and Lee, Seungyoon},
  doi = {10.1080/10447318.2010.516722},
  journal = {International Journal of Human-Computer Interaction},
  keywords = {type:technique, paradigm:matrix, time:timeline, evaluation:expert, application:social, sparklines, compound_graph, directed_graph, multivariate_graph, tasks, intra-cell_timelines},
  number = {11-12},
  pages = {1031--1051},
  publisher = {Taylor \& Francis},
  title = {{TimeMatrix}: Analyzing Temporal Social Networks Using Interactive Matrix-Based Visualizations},
  volume = {26},
  year = {2010}
}

@article{Zaidi2014Analysis,
  abstract = {This chapter provides an overview of the different techniques and methods that exist for the analysis and visualization of dynamic networks. Basic definitions and formal notations are discussed and important references are cited. A major reason for the popularity of the field of dynamic networks is its applicability in a number of diverse fields. The field of dynamic networks is in its infancy and there are so many avenues that need to be explored. From developing network generation models to developing temporal metrics and measures, from structural analysis to visual analysis, there is room for further exploration in almost every dimension where dynamic networks are studied. Recently, with the availability of dynamic data from various fields, the empirical study and experimentation with real data sets has also helped maturate the field. Furthermore, researchers have started to develop foundations and theories based on these datasets which in turn has resulted lots of activity among research communities.},
  author = {Zaidi, Faraz and Muelder, Chris and Sallaberry, Arnaud},
  journal = {arXiv preprint arXiv:1409.5034},
  keywords = {evaluation:survey, type:evaluation, time:generic, paradigm:node-link, application:generic},
  series = {arXiv},
  title = {Analysis and Visualization of Dynamic Networks},
  url = {http://arxiv.org/abs/1409.5034},
  year = {2014}
}

@inproceedings{Zaman2011Effect,
  abstract = {We present a new system for visualizing and merging differences in diagrams that uses animation, dual views, a storyboard, relative re-layout, and layering. We ran two user studies investigating the benefits of the system. The first user study compared pairs of hierarchical diagrams with matching node positions. The results underscore that naïve dual-view visualization is undesirable. On the positive side, participants particularly liked the dual-view with difference layer technique. The second user study focused on diagrams with partially varying node positions and difference visualization and animation. We found evidence that both techniques are beneficial, and that the combination was preferred.},
  author = {Zaman, Loutfouz and Kalra, Ashish and Stuerzlinger, Wolfgang},
  booktitle = {Proceedings of Graphics Interface 2011},
  keywords = {mental\_map, graph\_difference, time:animation, time:timeline, paradigm:node-link, type:evaluation, evaluation:user\_study, application:business},
  pages = {183--190},
  publisher = {Canadian Human-Computer Communications Society},
  series = {GI},
  title = {The Effect of Animation, Dual View, Difference Layers, and Relative Re-Layout in Hierarchical Diagram Differencing},
  year = {2011}
}

@article{vandenElzen2013Dynamic,
  ISSN = {1077-2626},
  abstract = {Networks are present in many fields such as finance, sociology, and transportation. Often these networks are dynamic: they have a structural as well as a temporal aspect. In addition to relations occurring over time, node information is frequently present such as hierarchical structure or time-series data. We present a technique that extends the Massive Sequence View (MSV) for the analysis of temporal and structural aspects of dynamic networks. Using features in the data as well as Gestalt principles in the visualization such as closure, proximity, and similarity, we developed node reordering strategies for the MSV to make these features stand out that optionally take the hierarchical node structure into account. This enables users to find temporal properties such as trends, counter trends, periodicity, temporal shifts, and anomalies in the network as well as structural properties such as communities and stars. We introduce the circular MSV that further reduces visual clutter. In addition, the (circular) MSV is extended to also convey time-series data associated with the nodes. This enables users to analyze complex correlations between edge occurrence and node attribute changes. We show the effectiveness of the reordering methods on both synthetic and a rich real-world dynamic network data set.},
  author = {van den Elzen, Stef and Holten, Danny and Blaas, Jorik and van Wijk, Jarke J},
  comment = {Extended version of a PacificVis 13 paper.},
  doi = {10.1109/TVCG.2013.263},
  journal = {IEEE Transactions on Visualization and Computer Graphics},
  keywords = {paradigm:node-link, time:timeline, evaluation:case_study, evaluation:case_study, type:technique, linear\_arrangement, radial, compound_graph, integrated_node-link, application:business, application:social},
  number = {8},
  pages = {1087-1099},
  series = {TVCG},
  title = {Dynamic Network Visualization with Extended Massive Sequence Views},
  volume = {20},
  year = {2013}
}

@article{vonLandesberger2011Visual,
  abstract = {The analysis of large graphs plays a prominent role in various fields of research and is relevant in many important application areas. Effective visual analysis of graphs requires appropriate visual presentations in combination with respective user interaction facilities and algorithmic graph analysis methods. How to design appropriate graph analysis systems depends on many factors, including the type of graph describing the data, the analytical task at hand, and the applicability of graph analysis methods. The most recent surveys of graph visualization and navigation techniques were presented by Herman et al. [HMM00] and Diaz [DPS02]. The first work surveyed the main techniques for visualization of hierarchies and graphs in general that had been introduced until 2000. The second work concentrated on graph layouts introduced until 2002. Recently, new techniques have been developed covering a broader range of graph types, such as time-varying graphs. Also, in accordance with ever growing amounts of graph-structured data becoming available, the inclusion of algorithmic graph analysis and interaction techniques becomes increasingly important. In this State-of-the-Art Report, we survey available techniques for the visual analysis of large graphs. Our review firstly considers graph visualization techniques according to the type of graphs supported. The visualization techniques form the basis for the presentation of interaction approaches suitable for visual graph exploration. As an important component of visual graph analysis, we discuss various graph algorithmic aspects useful for the different stages of the visual graph analysis process.},
  author = {von Landesberger, Tatiana and Kuijper, Arjan and Schreck, Tobias and Kohlhammer, J\"orn and van Wijk, Jarke J and Fekete, Jean-Daniel and Fellner, Dieter W},
  doi = {10.1111/j.1467-8659.2011.01898.x},
  journal = {Computer Graphics Forum},
  keywords = {type:evaluation, paradigm:generic, time:animation, time:timeline, evaluation:survey, application:generic},
  number = {6},
  pages = {1719--1749},
  series = {CGF},
  title = {Visual Analysis of Large Graphs},
  volume = {30},
  year = {2011}
}

@article{vonLandesberger2013Visual,
  abstract = {Contagion is a process whereby the collapse of a node in a network leads to the collapse of neighboring nodes and thereby sets off a chain reaction in the network. It thus creates a special type of time-dependent network. Such processes are studied in various applications, for example, in financial network analysis, infection diffusion prediction, supply-chain management, or gene regulation. Visual analytics methods can help analysts examine contagion effects. For this purpose, network visualizations need to be complemented with specific features to illustrate the contagion process. Moreover, new visual analysis techniques for comparison of contagion need to be developed. In this paper, we propose a system geared to the visual analysis of contagion. It includes the simulation of contagion effects as well as their visual exploration. We present new tools able to compare the evolution of the different contagion processes. In this way, propagation of disturbances can be effectively analyzed. We focus on financial networks; however, our system can be applied to other use cases as well.},
  author = {von Landesberger, Tatiana and Diel, Simon and Bremm, Sebastian and Fellner, Dieter W},
  doi = {10.1177/1473871613487087},
  journal = {Information Visualization},
  keywords = {type:application, paradigm:node-link, time:animation, evaluation:case\_study, application:business},
  publisher = {SAGE Publications},
  title = {Visual analysis of contagion in networks},
  year = {2013}
}

license_type: permissive

branch_name: refs/heads/master

extension: bib


text:
@article{item1,
author = {Freely, I.P.},
title = {A small paper},
journal = {The journal of small papers},
year = 1997,
note = {to appear},
}

@article{item2,
author = {Jass, Hugh},
title = {A big paper},
journal = {The journal of big papers},
year = 7991,
volume = {MCMXCVII},
}

@article{item3,
author = {Doe, John},
title = {A medium paper},
journal = {Some medium papers},
year = 1337,
}

@string{ase = {{IEEE--ACM} International Conference on Automated Software
	Engineering (ASE)}}

@string{asplos = {International Conference on Architectural Support for
    Programming Languages and Operating Systems (ASPLOS)}}

license: MIT

repository: noureddine-as/pandoc-markdown-template

repo_name: noureddine-as/pandoc-markdown-template


text:
#
# xprop_1.2.2.bb
#
require xorg-app-common.inc

SUMMARY = "Utility to display window and font properties of an X server"

DESCRIPTION = "The xprop utility is for displaying window and font \
properties in an X server. One window or font is selected using the \
command line arguments or possibly in the case of a window, by clicking \
on the desired window. A list of properties is then given, possibly with \
formatting information."

LIC_FILES_CHKSUM = "file://COPYING;md5=e226ab8db88ac0bc0391673be40c9f91"

DEPENDS += " libxmu virtual/libx11"

PE = "1"

SRC_URI[md5sum] = "fae3d2fda07684027a643ca783d595cc"
SRC_URI[sha256sum] = "9bee88b1025865ad121f72d32576dd3027af1446774aa8300cce3c261d869bc6"

#
# debian
#
inherit debian-package
DEBIAN_SECTION = "x11"
DPR = "0"
DPN = "x11-utils"

# Apply debian patch by quilt
DEBIAN_PATCH_TYPE = "quilt"

S = "${DEBIAN_UNPACK_DIR}/${PN}"

repository: takuya-t/meta-debian

repo_name: takuya-t/meta-debian

branch_name: refs/heads/daisy

extension: bb


text:
@inproceedings{sf2a10,
 author = {J.-P. Folcher and A. Abelli and A. Ferrari and M.
Carbillet},
 booktitle = {Semaine de l'Astrophysique Fran ̧caise, SF2A},
 pages = {71--72},
 title = {Some results on disturbance rejection control for an
adaptive optics system},
 year = {2010}
}

repository: andferrari/academic-kickstart

repo_name: andferrari/academic-kickstart

gha_license_id: MIT


text:
SUMMARY = "watchdog"
DESCRIPTION = "watchdog"
LICENSE = "CLOSED"

SRC_URI =  " \
    file://init.service \
    file://src/ \
"

do_compile() {
  cd ${WORKDIR}/src
  make
}

do_install () {

    install -d ${D}${sysconfdir}
    install -m 0644 ${WORKDIR}/init.service ${D}${sysconfdir}
    install -d ${D}${bindir}
    install -m 0744 ${WORKDIR}/src/watchdog ${D}${bindir}
}

license: MIT,Unlicense

repository: oldcrazyeye/xiaopi

detected_licenses: MIT Unlicense

repo_name: oldcrazyeye/xiaopi


text:
/*网页的版心*/
.w{
	width: 1190px;
	margin: auto;
}
.fr{
	float: right;
}
.fl{
	float: left;
}
.style-red{
	color: #f10215!important;
}
/**{*/
/*	margin: 0;*/
/*	padding: 0;*/
/*}*/
img{
	vertical-align: top;
}
li{
	list-style: none;
}
ul,ol{
	margin: 0;
	padding: 0;
}
input,button{
	padding: 0;
	border: 0;
}
a{
	text-decoration: none;
}
h1,h5,p,dl,dd{
	margin: 0;
}
.clearfix:before,.clearfix:after {
  content:"";
  display: table;  /* 这句话可以出发BFC BFC可以清除浮动,BFC我们后面讲 */
}
.clearfix:after {
 clear:both;
}
.clearfix {
  *zoom:1;
}
	@font-face {
  font-family: 'icomoon';
  src:  url('../fonts/icomoon.eot?7kkyc2');
  src:  url('../fonts/icomoon.eot?7kkyc2#iefix') format('embedded-opentype'),
    url('../fonts/icomoon.ttf?7kkyc2') format('truetype'),
    url('../fonts/icomoon.woff?7kkyc2') format('woff'),
    url('../fonts/icomoon.svg?7kkyc2#icomoon') format('svg');
  font-weight: normal;
  font-style: normal;
}
body{
	background-color: #f4f4f4;
}
/*京东的 顶部 start*/

.J_event{
	height: 80px;
	background-color: #000;
}
.J_event a{
	height: 80px;
	display: block;
	background: url(../images/top.jpg) no-repeat;
	position: relative;
}
.J_event a i{
	height: 15px;
	width: 15px;
	position: absolute;
	right: 0;
	top: 5px;
	font-family: "icomoon";
	font-style: normal;
	color: #666;
	background: rgba(0,0,0,.4);
	text-align: center;
	line-height: 15px;
}
/*京东的 顶部 end*/
/*导航栏模块开始*/
.shortcut{
	height: 28px;
	background-color: #E3E4E5;
	border: 1px solid #DDDDDD;
	color: #9D9D9D;
	font-size: 12px;
	line-height: 30px;
}
.shortcut a{
	color: #9D9D9D;
	font-size: 12px;
	text-decoration: none;
}
.shortcut a:hover{
	color: #c81623;
}
.shortcut .fl li{
	margin-left: 200px;
	height: 30px;
}
.shortcut .fr li{
	float: left;
}
.pos{
	font-family: "icomoon";
	font-style: normal;
	color: #f10215;
	font-size: 14px;
}
.spacer{
	width: 1px;
	height: 10px;
	background-color: #ccc;
	margin: 10px 10px 0;
}
.dropdown{
	padding-right: 15px;
	position: relative;
}
.dropdown i{
	font-family: "icomoon";
	font-style: normal;
	position: absolute;
	right: -2px;
	top: -2px;
	font-size: 14px;
}
.erweima{
	width: 60px;
	height: 60px;
	border: 1px solid #ccc;
	/*padding: 3px;*/
	position: absolute;
	left: -8px;
	top: 29px;
}
/*导航栏模块结束*/
/*header 部分开始*/
.inner {
	height: 140px;
	position: relative;
}
.logo{
	width: 190px;
	height: 170px;
	position: absolute;
	left: 0;
	top: -30px;
	box-shadow: 0 -12px 10px rgba(0,0,0,.2);
}
.logo h1{
	margin: 0;
}
.logo a{
	display: block;
	width: 190px;
	height: 170px;
	background: url(../images/logo.png) #fff no-repeat;
	text-indent: -99999px;
	overflow: hidden;
}
.search{
	width: 550px;
	height: 35px;
	background-color: purple;
	position: absolute;
	left: 320px;
	top: 25px;
}
.search input{
	width: 493px;
	height: 33px;
	border: 1px solid #f10215;
	padding-left: 5px;
	outline: none;
	color: #98a4c1;
	float: left;
	/*cursor: pointer;*/
}
.search button{
	width: 50px;
	height: 35px;
	background-color: #f10215;
	float: left;
}
.search button i{
	font-family: "icomoon";
	font-style: normal;
	color: #fff2f3;
	font-size: 18px;
}
.cerama{
	font-family: "icomoon";
	font-style: normal;
	position: absolute;
	right: 62px;
	top: 6px;
	color: #b7b6b7;
	font-size: 18px;
	cursor: pointer;
}
.search:hover .cerama{
	color: #f10215;
}
.hotword{
	width: 490px;
	height: 18px;
	position: absolute;
	left: 320px;
	top: 70px;
}
.hotword a{
	font-size: 12px;
	color: #999999;
}
.mycar{
	width: 188px;
	height: 33px;
	border: 1px solid #e3e4e5;
	position: absolute;
	top: 25px;
	right: 100px;
	text-align: center;
	line-height: 33px;
	color: #f10215;
	cursor: pointer;
}
.mycar a{
	color: #f10215;
	font-size: 12px;
}
.mycar i{
	font-family: "icomoon";
	font-style: normal;
	margin-right: 3px;
}
.mycar s {
    position: absolute;
    top: 5px;
    left: 140px;
    text-decoration: none;
    background-color: #f10215;
    height: 16px;
    line-height: 16px;
    font-size: 12px;
    padding: 0 3px;
    border-radius: 7px;
    color: #fff;
}
.computer{
	position: absolute;
	right: 0;
	bottom: 10px;
	cursor: pointer;
}
.navitems{
	width: 715px;
	height: 40px;
	position: absolute;
	bottom: 0;
	left: 200px;
	line-height: 40px;
}
.navitems ul{
	float: left;
}
.navitems ul li{
	float: left;
	margin-left: 30px;
}
.navitems li a{
	color: #555555;
	font-size: 16px;
	font-weight: 700;
	display: block;
}
.navitems li a:hover{
	color: #f10215;
}
.navitems .spacer{
	float: left;
	margin-top: 15px;
	margin-right: -10px;
	margin-left: 20px;
}
/*header 部分结束*/
/*页面底部分开始*/
.footer {
	height: 560px;
	background-color: #EAEAEA;
}
.footer-service {
	border-bottom: 1px solid #DEDEDE;
}
.footer-service-inner {
	padding: 30px 0;

}
.footer-service-inner li {
	float: left;
	width: 297px;
	height: 42px;
}
.service_unit {
	width: 225px;
	height: 42px;
	margin: 0 auto;
	position: relative;
}
.service_unit h5 {
	width: 36px;
	height: 42px;
	position: absolute;
	top: 0;
	left: 0;
	background: url(../images/ico.png) no-repeat;
	text-indent: -999px;
	overflow: hidden;
}
.service_unit p {
	line-height: 42px;
	margin-left: 45px;
	font-size: 18px;
	font-weight: 700;

}
.service_unit .kuai {
	background-position: 0 -44px;
}
.service_unit .hao {
	background-position: 0 -86px;
}
.service_unit .sheng {
	background-position: 0 -128px;
}
.help {
	height: 180px;
	/* background-color: pink; */
	padding-top: 20px;
}
.help dl {
	float: left;
	width: 195px;
}
.help dt {
	font-size: 14px;
	font-weight: 700;
	color: #666;
	height: 30px;
}
.help dd {
	height: 22px;
}
.help dd a{
	color: #727272;
	font-size: 12px;
}
.help dd a:hover {
	color: #f10215;
}

.help .cover {
	float: right;
	width: 207px;
	height: 150px;
	background: url(../images/ico_footer.png) no-repeat;
}
.cover dt {
	text-align: center;
}
.help .info {
	width: 175px;
	height: 50px;
	font-size: 12px;
	margin-top: 5px;
	margin-left: 10px;
	line-height: 18px;
	color: #727272;
}
.more {
	text-align: right;
	padding-right: 10px;
}

/* 版权模块 */
.copyright {
	border-top: 1px solid #ccc;
	padding-top: 15px;
}
.links {
	text-align: center;
}
.links a {
	color: #727272;
	font-size: 12px;
}
.links span {
	font-size: 12px;
	color: #D4CDCD;
	margin: 0 6px;
}
.c-info {
	font-size: 12px;
	color: #9E9E9B;
	text-align: center;
	line-height: 20px;
	margin-top: 10px;
}
.tupian {
	text-align: center;
	margin-top: 10px;
}
.tupian a{
	width: 103px;
	height: 32px;
	display: inline-block;
	background: url(../images/ico_footer.png) no-repeat 0 -151px;
}
.tupian .kexin {
	background-position: -104px -151px;
}
/*页面底部分结束*/

repository: StruggleT/Static-Page

repo_name: StruggleT/Static-Page

extension: css


text:
body {
	background-color: #FFAA00;
	font-family: 'Lucida Sans', 'Lucida Sans Regular', 'Lucida Grande', 'Lucida Sans Unicode', Geneva, Verdana, sans-serif;
	color:white;
	text-align: center;
}

h2 {
	font-size: 1.2em;
	font-weight: bold;
	text-transform: uppercase;
}

button {
	background-color: darkorange;
	color:white;
	font-size: 1.0em;
	font-weight: bold;
	padding: 5px;
	border: 2px solid white;
	border-radius: 6px;
	box-shadow: 3px 3px 3px #ff7500;
	cursor: pointer;
	text-transform: uppercase;
}

.success {
	margin:5px;
	font-weight: bold;
	font-size: 1.0em;
}

.error {
	color:red;
	margin:5px;
	font-weight: bold;
	font-size: 1.0em;
}

.button-group {
	margin-top: 4px;
	margin-bottom: 4px;
}

.field {
	margin: 10px 4px;
	font-weight: bold;
}

.field label {
	width: 7em;
	display: inline-block;
	text-align: right;
}

.field.text-center label {
	text-align: center;
	width: 4.2em;
}

.field input[type=checkbox] {
	padding: 5px;
}

.field input[type=text] {
	width: 200px;
	padding: 5px;
	border: 2px solid white;
	border-radius: 6px;
}

.group {
	margin: 0.5em;
	border: 2px solid white;
	border-radius: 6px;
}

.prompt {
	display: none;
	position: absolute;
	top: 0;
	left: 0;
	width: 100%;
	height: 100%;
	z-index: 10;
	background-color: #ff7500;
}

.prompt.active {
	display: block;
}


text:
@import url('https://fonts.googleapis.com/css2?family=Lato:wght@300&family=Montserrat:wght@100;400&display=swap');

body {
  font-family: 'Lato', sans-serif;
  font-family: 'Montserrat', sans-serif;
  letter-spacing: 0.15em;
}

license: Unlicense

repository: avcdsld/industrial-revolution-mint

repo_name: avcdsld/industrial-revolution-mint

branch_name: refs/heads/main


text:
/* Default Styles for DavyWebz main site and blog index/posts */

*{background: rgb(242,242,242);
font-family: "Lucida Console",monospace; color: #550000
}

h{font-family: "Verdana",Arial,sans-serif; font-weight: bold;}

.caption{text-align: center; font-style: italic; font-size: .9em}


text:
@article{Odahara_2015,
  doi = {10.1371/journal.pone.0137798},
  url = {https://doi.org/10.1371\%2Fjournal.pone.0137798},
  year = 2015,
  month = {sep},
  publisher = {Public Library of Science ({PLoS})},
  volume = {10},
  number = {9},
  pages = {e0137798},
  author = {Shunichi Odahara and Kan Uchiyama and Takahiro Kubota and Zensho Ito and Shinichiro Takami and Hiroko Kobayashi and Keisuke Saito and Shigeo Koido and Toshifumi Ohkusa},
  editor = {Simon Patrick Hogan},
  title = {A Prospective Study Evaluating Metabolic Capacity of Thiopurine and Associated Adverse Reactions in Japanese Patients with Inflammatory Bowel Disease ({IBD})},
  journal = {{PLOS} {ONE}}
}

repository: larmcr/px

repo_name: larmcr/px


text:
% SRS Bibliography References

@book{RobertsonAndRobertson2012,
	Author = {James Robertson and Suzanne Robertson},
	Date-Added = {2016-09-22 13:54:40 +0000},
	Date-Modified = {2016-09-22 14:01:42 +0000},
	Edition = {16},
	Publisher = {Atlantic Systems Guild Limited},
	Title = {Volere Requirements Specification Template},
	Year = {2012}}

@misc{PhotosensitiveEpilepsy,
  title = {Photosensitive Epilepsy},
  author = {{Epilepsy Society}},
  howpublished = {\url{https://www.epilepsysociety.org.uk/photosensitive-epilepsy#.V_pneOArKCg}},
  note = {Accessed: 2016-10-09}
}

@misc{RogueHistory,
  title = {{Rogue - Exploring the Dungeons of Doom (1980)}},
  author = {{Petri Kuittinen}},
  year = "2001",
  howpublished = {\url{https://web.archive.org/web/20071217100401/http://users.tkk.fi/~eye/roguelike/rogue.html}},
  note = {Accessed: 2016-10-07}
}

@misc{RoguelikeDefinition,
  title = {{What is a Roguelike}},
  author = {{Slash}},
  howpublished = {\url{http://www.roguetemple.com/roguelike-definition/}},
  note = {Accessed: 2016-10-07}
}

@misc{LibtcodHome,
  title = {{[Libtcod] Overview}},
  howpublished = {\url{https://bitbucket.org/libtcod/libtcod/}},
  note = {Accessed: 2016-10-07}
}

@article{RogueAI,
  title = {{An expert system outperforms mere mortals as it conquers the feared Dungeons of Doom}},
  journal = "Scientific American",
  year = "1985",
  volume = "252",
  month = "February",
  pages = "18-21",
  note = {Accessed: 2016-10-11}
}

@article{GameAnger,
  title = {{Violent video games and anger as predictors of aggression}},
  author = {{Gary W. Giumetti and Patrick M. Markey}},
  journal = "Journal of Research in Personality",
  year = "2007",
  note = {Accessed: 2016-10-11}
}

repository: Mandrenkov/RogueReborn

repo_name: Mandrenkov/RogueReborn