Peacock Bundles: Bundle Coloring for Graphs with Globality-Locality Trade-off

Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual edges. We propose a solution: we optimize edge coloring to differentiate bundled edges. We quantify strength of bundling in a flexible pairwise fashion between edges, and among bundled edges, we quantify how dissimilar their colors should be by dissimilarity of their origins and destinations. We solve the resulting nonlinear optimization, which is also interpretable as a novel dimensionality reduction task. In large graphs the necessary compromise is whether to differentiate colors sharply between locally occurring strongly bundled edges ("local bundles"), or also between the weakly bundled edges occurring globally over the graph ("global bundles"); we allow a user-set global-local tradeoff. We call the technique "peacock bundles". Experiments show the coloring clearly enhances comprehensibility of graph layouts with edge bundling.Comment: Appears in the Proceedings of the 24th International Symposium on Graph Drawing and Network Visualization (GD 2016

Scalability considerations for multivariate graph visualization

Real-world, multivariate datasets are frequently too large to show in their entirety on a visual display. Still, there are many techniques we can employ to show useful partial views-sufficient to support incremental exploration of large graph datasets. In this chapter, we first explore the cognitive and architectural limitations which restrict the amount of visual bandwidth available to multivariate graph visualization approaches. These limitations afford several design approaches, which we systematically explore. Finally, we survey systems and studies that exhibit these design strategies to mitigate these perceptual and architectural limitations

Bundled Crossings Revisited

An effective way to reduce clutter in a graph drawing that has (many) crossings is to group edges that travel in parallel into \emph{bundles}. Each edge can participate in many such bundles. Any crossing in this bundled graph occurs between two bundles, i.e., as a \emph{bundled crossing}. We consider the problem of bundled crossing minimization: A graph is given and the goal is to find a bundled drawing with at most $k$ bundled crossings. We show that the problem is NP-hard when we require a simple drawing. Our main result is an FPT algorithm (in $k$) when we require a simple circular layout. These results make use of the connection between bundled crossings and graph genus.Comment: Appears in the Proceedings of the 27th International Symposium on Graph Drawing and Network Visualization (GD 2019

PENGARUH PENAMBAHAN LENSA NOZZLE DAN JUMLAH BLADE AIRFOIL TIPE NACA 4415 TERHADAP HASIL DAYA LISTRIK TURBIN ANGIN SUMBU HORISONTAL

Danur Lambang Pristiandaru. PENGARUH PENAMBAHAN LENSA NOZZLE TURBIN ANGIN DAN JUMLAH BLADE AIRFOIL TIPE NACA 4415 TERHADAP HASIL DAYA LISTRIK. Skripsi, Fakultas Keguruan dan Ilmu Pendidikan Universitas Sebelas Maret Surakarta. Januari 2016 Tujuan penelitian ini adalah: (1) Menyelidiki pengaruh jumlah blade pada turbin angin non-twisted blade tipe airfoil NACA 4415 terhadap daya listrik yang dihasilkan. (2) Menyelidiki pengaruh penambahan lensa nozzle pada turbin angin non-twisted blade tipe airfoil NACA 4415 terhadap daya listrik yang dihasilkan turbin angin. (3) Menyelidiki pengaruh bersama (interaksi) antara penambahan lensa nozzle dan jumlah blade terhadap daya listrik yang dihasilkan turbin angin. Penelitian ini menggunakan metode deskriptif kuantitatif. Sampel dalam penelitian ini adalah Turbin Angin Sumbu Horisontal (TASH) dengan desain blade airfoil NACA 4415 non-twisted. 3 desain lensa nozzle digunakan untuk mengetahui pengaruhnya terhadap peningkatan daya listrik TASH. Terdapat 3 variasi jumlah blade yaitu jumlah blade 2, jumlah blade 3, dan jumlah blade 4. Variasi kecepatan angin yang digunakan dalam penelitian ini adalah 2,5 m/s, 3,5 m/s, dan 4,5 m/s. Data diperoleh dengan melakukan pengujian TASH menggunakan angin rekayasa, daya listrik yang dihasilkan dibaca dan direkam oleh data logger. Data yang diperoleh dari hasil penelitian dimasukkan ke dalam tabel dan ditampilkan dalam bentuk grafik, kemudian dianalisis. Berdasarkan hasil penelitian dapat disimpulkan bahwa: (1) Adanya pengaruh variasi jumlah blade terhadap daya listrik turbin angin. TASH 3 blade menghasilkan daya listrik yang paling besar yaitu 0,7222 W pada kecepatan angin 4,5 m/s. (2) Adanya pengaruh penambahan lensa nozzle terhadap turbin angin. Lensa nozzle mampu meningkatkan hasil daya listrik turbin angin semua jenis variasi jumlah blade dibandingkan turbin angin tanpa lensa nozzle. (3) Ada pengaruh bersama yang signifikan antara variasi jumlah blade dan variasi jenis lensa terhadap daya listrik turbin angin. TASH 3 blade dengan lensa C pada kecepatan angin 4,5 m/s memiliki daya listrik tertinggi yaitu sebesar 0,82041 W. Daya listrik tersebut meningkat 13,60% dibanding TASH 3 blade tanpa penambahan lensa, yaitu 0,7222 W. Kata kunci: Turbin Angin, Lensa Nozzle, Daya Listrik, Data Logge

Visualization of Frequent Itemsets with Nested Circular Layout and Bundling Algorithm

International audienceFrequent itemset mining is one of the major data mining issues. Once generated by algorithms, the itemsets can be automatically processed, for instance to extract association rules. They can also be explored with visual tools, in order to analyze the emerging patterns. Graphical itemsets representation is a convenient way to obtain an overview of the global interaction structure. However, when the complexity of the database increases, the network may become unreadable. In this paper, we propose to display itemsets on concentric circles, each one being organized to lower the intricacy of the graph through an optimization process. Thanks to a graph bundling algorithm, we finally obtain a compact representation of a large set of itemsets that is easier to exploit. Colors accumulation and interaction operators facilitate the exploration of the new bundle graph and to illustrate how much an itemset is supported by the data

A Review of Temporal Data Visualizations Based on Space-Time Cube Operations

International audienceWe review a range of temporal data visualization techniques through a new lens, by describing them as series of op- erations performed on a conceptual space-time cube. These operations include extracting subparts of a space-time cube, flattening it across space or time, or transforming the cube's geometry or content. We introduce a taxonomy of elementary space-time cube operations, and explain how they can be combined to turn a three-dimensional space-time cube into an easily-readable two-dimensional visualization. Our model captures most visualizations showing two or more data dimensions in addition to time, such as geotemporal visualizations, dynamic networks, time-evolving scatterplots, or videos. We finally review interactive systems that support a range of operations. By introducing this conceptual framework we hope to facilitate the description, criticism and comparison of existing temporal data visualizations, as well as encourage the exploration of new techniques and systems

A discrete firefly algorithm to solve a rich vehicle routing problem modelling a newspaper distribution system with recycling policy

A real-world newspaper distribution problem with recycling policy is tackled in this work. In order to meet all the complex restrictions contained in such a problem, it has been modeled as a rich vehicle routing problem, which can be more specifically considered as an asymmetric and clustered vehicle routing problem with simultaneous pickup and deliveries, variable costs and forbidden paths (AC-VRP-SPDVCFP). This is the first study of such a problem in the literature. For this reason, a benchmark composed by 15 instances has been also proposed. In the design of this benchmark, real geographical positions have been used, located in the province of Bizkaia, Spain. For the proper treatment of this AC-VRP-SPDVCFP, a discrete firefly algorithm (DFA) has been developed. This application is the first application of the firefly algorithm to any rich vehicle routing problem. To prove that the proposed DFA is a promising technique, its performance has been compared with two other well-known techniques: an evolutionary algorithm and an evolutionary simulated annealing. Our results have shown that the DFA has outperformed these two classic meta-heuristics

ExoClock Project: An open platform for monitoring the ephemerides of Ariel targets with contributions from the public

The Ariel mission will observe spectroscopically around 1000 exoplanets to further characterise their atmospheres. For the mission to be as efficient as possible, a good knowledge of the planets' ephemerides is needed before its launch in 2028. While ephemerides for some planets are being refined on a per-case basis, an organised effort to collectively verify or update them when necessary does not exist. In this study, we introduce the ExoClock project, an open, integrated and interactive platform with the purpose of producing a confirmed list of ephemerides for the planets that will be observed by Ariel. The project has been developed in a manner to make the best use of all available resources: observations reported in the literature, observations from space instruments and, mainly, observations from ground-based telescopes, including both professional and amateur observatories. To facilitate inexperienced observers and at the same time achieve homogeneity in the results, we created data collection and validation protocols, educational material and easy to use interfaces, open to everyone. ExoClock was launched in September 2019 and now counts over 140 participants from more than 15 countries around the world. In this release, we report the results of observations obtained until the 15h of April 2020 for 119 Ariel candidate targets. In total, 632 observations were used to either verify or update the ephemerides of 83 planets. Additionally, we developed the Exoplanet Characterisation Catalogue (ECC), a catalogue built in a consistent way to assist the ephemeris refinement process. So far, the collaborative open framework of the ExoClock project has proven to be highly efficient in coordinating scientific efforts involving diverse audiences. Therefore, we believe that it is a paradigm that can be applied in the future for other research purposes, too

Scalability considerations for multivariate graph visualization

Real-world, multivariate datasets are frequently too large to show in their entirety on a visual display. Still, there are many techniques we can employ to show useful partial views-sufficient to support incremental exploration of large graph datasets. In this chapter, we first explore the cognitive and architectural limitations which restrict the amount of visual bandwidth available to multivariate graph visualization approaches. These limitations afford several design approaches, which we systematically explore. Finally, we survey systems and studies that exhibit these design strategies to mitigate these perceptual and architectural limitations