Deprecated: Assigning the return value of new by reference is deprecated in /home/ubietyla/public_html/blog/wp-settings.php on line 399

Deprecated: Assigning the return value of new by reference is deprecated in /home/ubietyla/public_html/blog/wp-includes/cache.php on line 99

Deprecated: Assigning the return value of new by reference is deprecated in /home/ubietyla/public_html/blog/wp-includes/query.php on line 21
ubietylab.net — Ubiety Lab Blog

ubietylab.net

Ubiety Lab Blog

ubietylab.net header image 1

UbiGraph alpha-0.2.4 released

June 24th, 2008 · No Comments · Uncategorized

This release has major performance improvements, and adds some attributes for arrows.

Download now ➠

Here are some benchmark results for Ubuntu 64-bit 8.04:

Version Wall time to construct 10×10x10 cube graph (3701 API calls) API calls per second
Python (xmlrpclib), 1 CPU 6.2 s 600
Python (xmlrpclib), 2 CPUs 3.5 s 1060
C API (xmlrpc-c), 1 CPU 2.3 s 1600
C API (xmlrpc-c), 2 CPUs 2.1 s 1700
Direct linking with UbiGraph server (not possible with the free
version)
0.004 s 925000

UbiGraph alpha-0.2.4, 23 June 2008

  • Lots of performance improvements, and a new section in the user’s guide
    about performance tuning
  • New edge attributes: arrow_position, arrow_length, arrow_radius,
    arrow_reverse
  • New edge stroke kind: “none”, does not draw the edge, but still draws
    decorations (i.e. arrowhead and label)
  • New examples: arrows.py, routing.py
  • Bug fix: vertex “visible” attribute not handled properly

→ No CommentsTags:

NetworkX + UbiGraph

June 19th, 2008 · No Comments · Uncategorized

NetworkX is a Python package for working with complex networks. Aric Hagberg, one of its authors, has put together an interface between NetworkX and UbiGraph.

The interface is now included in NetworkX. To see the UbiGraph demos, do this:

$ svn co https://networkx.lanl.gov/svn/networkx/trunk networkx
$ cd networkx
$ python setup.py install
$ cd doc/examples/ubigraph
$ python atlas.py

(Tip: you’ll need a more recent version of Python than 2.3.5, the default version that comes with Mac OS X 10.4.)

→ No CommentsTags:

Web traffic visualization

June 17th, 2008 · No Comments · Uncategorized

A new demo has been posted that shows how Ubigraph can visualize website traffic in real time:

→ No CommentsTags:

Visualizing a game-playing algorithm

June 17th, 2008 · 1 Comment · Uncategorized

Arnar Birgisson, Hilmar Finnsson and Stefán Freyr Stefánsson from Reykjavik University put together this visualization of the general game-playing system CADIA-player. For more information, see their post.

Note: video doesn’t start until 0:12.


Game Playing Algorithm visualized.

→ 1 CommentTags:

Routing on a Hypercube

June 17th, 2008 · No Comments · Uncategorized

The upcoming release (0.2.4) adds several attributes for controlling the placement and size of arrowheads.  These can be manipulated to produce animations:

→ No CommentsTags:

New Python API for UbiGraph

May 30th, 2008 · 2 Comments · Uncategorized

I just started programming in Python a couple of weeks ago, but I’m already in love with it. Here’s a taste of the new Python API included with the latest release of UbiGraph. It is such an easy, expressive language!

import ubigraph

U = ubigraph.Ubigraph()
U.clear()

x = U.newVertex(shape="sphere", color="#ffff00")

smallRed = U.newVertexStyle(shape="sphere", color="#ff0000", size="0.2")

previous_r = None
for i in range(0,10):
  r = U.newVertex(style=smallRed, label=str(i))
  U.newEdge(x,r,arrow=True)
  if previous_r != None:
    U.newEdge(r,previous_r,spline=True,stroke="dashed")
  previous_r = r

→ 2 CommentsTags:

Ubigraph alpha-0.2.3 released

May 30th, 2008 · No Comments · Uncategorized

This is really a two-for-one release, as alpha-0.2.2 was a stealth fizzle due to build problems (now solved). We now support 8 linux platforms, and both Intel and PowerPC Mac OS X 10.4+. There are subtantially fewer dynamic library dependencies. We’re confident we can build for pretty much any flavour of linux now, so if you can’t get one of the versions to work, let us know (support@ubietylab.net).

Lots of new features since the last (announced) release: a nifty Python API that will be fun to play with (see the Quick Start), XMLRPC client callbacks when a vertex is double-clicked, arrows, autozoom, fullscreen mode, oriented edges, toggling labels, better documentation and lots of new examples. It’s faster and more stable.  And there’s a nice Ruby API contributed by mootoh.

Download now ➠

Version alpha-0.2.3, 29 May 2008
* Better Python API: examples/Python/ubigraph_example.py
* Reduced dependency on shared libraries

Version alpha-0.2.2, 28 May 2008
* XMLRPC callbacks on left double-click; see Python/callback.py
and Python/callback_webcrawler.py
* New platforms supported: Mac OS X PowerPC, Ubuntu 6.06
* arrowheads are back (will be more customizable in future)
* New API methods: new_vertex_style_w_id(s,parent) and
new_edge_style_w_id(s,parent)
* Performance and numeric-stability improvements
* Fullscreen mode (right-mouse button menu)
* Autozoom (disable via right-mouse button menu if it annoys)
* Toggle labels: right-mouse button menu, or press ‘l’ or ‘L’
* Added ‘oriented’ attribute for edges: see e.g. Python/tree.py
* New example: Python/multiedge.py
* Ruby interface (rubigraph) by mootoh
* Higher rate of XMLRPC requests processed without reducing the framerate
* Improved error reporting; use ubigraph_server -quiet to suppress warnings
* Brought C API up to date
* API now guarantees that generated id’s are in the range 0×40000000-0×7fffffff.
* Bug fix: jittery vertices caused by threading issues
* Bug fix: colors with uppercase hex digits
* Bug fix: segfault due to non-threadsafe code on big graphs (#768202)
* Bug fix: style changes that affect layout now exit idle mode

→ No CommentsTags:

Grapes

May 27th, 2008 · 4 Comments · Uncategorized

Here’s a little demo showing how edge widths are useful for drawing trees.  

→ 4 CommentsTags:

Client callbacks via XMLRPC

May 27th, 2008 · No Comments · Uncategorized

The next version of ubigraph has client callbacks via XMLRPC. Here’s a demo of browsing the link structure of planetmath.org. Left double-clicks result in a callback to the python client, which grabs the page from the web, extracts its links, and updates the graph.

→ No CommentsTags:

Visualizing register colouring and coalescing algorithms

May 26th, 2008 · No Comments · Uncategorized

Florent Bouchez, a PhD student at ENS Lyon, has posted some splendid animations of register colouring and coalescing algorithms he is working on. I especially like the coalescing movie. (Note: the version of quicktime on my computer doesn’t recognize the codec, I had to use VLC.)

 

→ No CommentsTags: