Academia.edu's office is at: 251 Kearny St., Suite 520, San Francisco, CA, 94108. To opt out of receiving these kinds of emails from Academia.edu, go to: http://academia.edu/optout/569e56cb0baedfe943b902eb28114a20

Academia.edu's office is at: 251 Kearny St., Suite 520, San Francisco, CA, 94108. To opt out of receiving these kinds of emails from Academia.edu, go to: http://academia.edu/optout/463f986d62d6c3bb4539385952e4186b

If you cannot evaluate it, don't bother developing it.

• Open Mics
• Look after baby
• Play piano at home, jazz standards mainly
• working out what I should be working at- development or support?

Tried it for a bit.

http://theness.com/neurologicablog/?p=287

 - has the low down.

Basically, dont believe the hype. It can help you get to sleep, calm you down, but no permanent cognitive benefits AFAICS

• displacement of nodes - total movement under a certain threshold means no more iterations

attempted but failed to work

• no concurrent requests - block access to the repositioning area; node count variable; nodes created & backed up whilst loop iterate is running; nodeCount is therefore altering, meaning non existing nodes are processed causing error.

solved this by preventing user access to function creating new users/ nodes ; UX gotcha -  the links look as though they are avaiilable - they ought to be turned off & on some how during the update cycle. 

• move node on graph

• line crossing algo. find new starting points if crossed after n iterations.downside is longer user wait. perhaps leave it to user to run "tidy graph" if unacceptably messy

•  search - user needs to know what name to put to start - search will counter that

• non-functional - some user instructions

• bug fixes - currently running breaks after say 30 or 40 new nodes - error trap points to attraction vectors; the linked to missing

fixed 16th march; was creating too many connections in the links array. bug tracking more sophisicated - using typeof to find that NaN was getting through so the addVectors function wasnt returing anything creating nulls

• auto explore - recursive? 1,2, or 3 levels deep.
• connect connections - leave a black dot with handle, user can expand
• categorisation of networks
• group together disparate users
• queue graph expansion requests; instead of block user clicks, adds those to be expanded to stack 
• a count of number of requests left
• on expand, change back ground to that users background
• expand only but stay at the node; two side panels
• location added to mix

e.g.:

[{"text":"another fine morning in starbucks","place":null,"truncated":false,"source":"web","in_reply_to_user_id":null,"favorited":false,"created_at":"Fri Mar 25 11:17:12 +0000 2011","coordinates":null,"in_reply_to_screen_name":null,"in_reply_to_status_id_str":null,"contributors":null,"geo":null,"user":{"profile_link_color":"c8a86f","description":"An occasional twitter user","location":"Aberdeen"

obviously cant guarantee a location / place / coordinates being set but I'm guessing enough bods like to set it for it to be worth while implementing.

• auto expand canvas if resize window (canvas is based on whats available)
• semantic nodes - or adheres to a common word; attracted to node which is on a grid

30th march. added auto canvas area adjust on window resize

discovered that mutex isnt working properly because 2 asynchronous requests can take part before "ready" is set to false. So 2 of the same users can be present :( this needs to be corrected.

about 23rd march - tried to connect connections but failed... 

graph still a bit messy when theres cyclic connections. looked into line crossing but too difficult to understand.