Meeting with Worthy, May 9, 2014

Questions/Discussion

1. Annual Progress Report: How much information to give? What should I discuss as topic?
2. Timing for summer, being out for next Thursday afternoon/Friday, if possible
3. Proposing: Possible over summer without taking credits, or need to wait until fall?
   • Committee: Glenn Wasson is still interested
4. Temporal Sets (Time-Dependent Sets)
   • New ideas for using timespans in the structure (insert for a given time span). Is the performance hit worth it?
   • See figure 1 example
5. Time-dependent Data Structures (generalized to temporal pointers with temporal aspects on the nodes)
   • Using partial computation
     • Degree (in and out) can be easily done by storing the degree at each node. Increment for next time is faster
     • Connectivity - can we denote connected components or the size thereof?
     • Farness (1/closeness) - can we store the sum of distance to all other nodes? How often need to recompute?
6. To Note: When visualizing social networks, knowing the future structure is very good (see BrInMa10.pdf, fig 2)
7. Some papers
   • See notes on website for 3 paper summaries

To Do

1. Look into Artificial Intelligence books. DONE.
   • Frame problem (when new knowledge comes in, change the known set of proofs/knowledge into another set)
   • Truth Maintenance Systems
2. Working sankey diagrams. DONE.
3. Finish the annual report. DONE.
   • Worthy asked Wes about the requirements in SIS
   • Goals: Propose early fall
   • Add research assistant with IATH and what I did here
4. Write algorithms and implement temporal sets
   • Marriages are perfect examples, see below
5. Build table structure for extended marriages (tribes?) so we don’t have to build them on the fly from the DB every time.
6. Add a sankey visualization with choices for church organization (currently Q12, 70) DONE.
7. Add time slider to sankey viz. THURS.
8. Directed graph viz with a person, the marriages they are linked to (adoption, birth, marriage) WED
9. Add levels of separation to sankey (0 is just the marriage requested, 1 would be their parents’ marriages and children’s marriages, etc) WED.
10. Fix out points so that if children get married, they go to the same dummy node at the end. DONE.

Discussion

1. Precompute structure
   • Build a table structure for the extended marriages (plural marriages) so that we don’t have to build every time directly from the database.
     • What is the order of marriages in these marriage units or tribes?
       • Is the order time dependent?
       • Are new root marriages formed when the original wife dies? divorces?
       • Do changes in root marriage change the order of the marriages?
       • Can a new wife be married in as root marriage, or will the next-in-line temporally take that position?
       • How do you get a new root marriage?