The Gephi project is part again of the Google Summer of Code in 2011!
This is a global program that offers student developers stipends to write code for various open source software projects, fund over a three month period (5000USD per student). Through this, accepted student applicants are paired with a mentor from the participating projects, thus gaining exposure to real-world software development scenarios and the opportunity for employment in areas related to their academic pursuits.
Thanks to Google to support our small organization. The program really made a huge boost in development and community. I would like also to thank organizers and engineers for their great job on organizing and providing the infrastructure and tools.
The GSoC is on the starting block!We are currently welcoming potential students and guide them through their proposals. This year, mentors are:
- Eytar Adar is mentoring Scripting Gephi
- Cezary Bartosiak is mentoring Timeline player and movie creation
- Mathieu Bastian is mentoring Scripting Gephi & Preview Refactoring & Web-based network visualization with WebGL
- Julian Bilcke is mentoring Web-based network visualization with WebGL & Automated build & Maven
- Sébastien Heymann is mentoring New Visualization Engine & Timeline player and movie creation
- Eduardo Ramos Ibañez is mentoring Indexed Attributes API using Lucene
- Antonio Patriarca is mentoring New Visualization Engine
- Christian Tominski is mentoring Preview Refactoring
Detailed proposal descriptions can be found on the wiki.
In 2010, 5 students were selected on these subjects:
- André Panisson – Graph Streaming API
- Antonio Patriarca – Shader Engine
- Cezary Bartosiak – Dynamic attributes and statistics
- Martin Škurla – Adding support for Neo4j in Gephi
- Yi Du – Direct Social Networks Import
Mid-term blog articles:
In 2009, 4 students were selected on these subjects:
- Patrick McSweeney on Network Algorithms and Statistics module
This proposal calls for the implementation of 9 network algorithms and metrics which will enhance Gephi’s user experience by providing information about the network which is not usually apparent from mere visual introspection. The proposed network metrics are: HITS, PageRank, clustering coefficient, network diameter, mean shortest path, betweenness centrality, modularity, degree-distribution and closeness centrality.
- PhD in Physics at Syracuse University, US
Gephi is able to export its network as SVG or PDF format. Using vectorial drawings for graph have many benefits like infinite zooming or clear shapes. The aim of this proposal is to develop a preview module in Gephi for seeing how the output will exactly looks like with the given parameters.
Spatialization plays an important role in rendering networks, specially when the size of the networks are huge and the complexity of current spatialization techniques starts to dominate. This proposal is about developing and implementing a highly scalable distributed spatialization algorithm, so that Gephi can ideally spatialize and render massive networks (~1M nodes).
I propose to add a new graphical component to Gephi, that will use the current slice-based storage of Gephi to provide an intuitive temporal graph navigation. This implementation will be designed with performance and ease of use in mind.