About me:



Hello.

My name is Chuck Cartledge. I am a perennial student. An adjunct professor at Old Dominion University, Norfolk, Virginia and Tidewater Community College, Virginia Beach, Virginia. I strongly believe that the field of computer science continues to change, and that everything that we learn or are taught has a half life of about 3 years. Because of this belief, I have spent what some consider to be an inordinate amount of time going back to the education well and replenishing my skill set.

To paraphrase the old adage "the more tools you have in your tool bag, the fewer problems look like nails." (See Maslow for the true quote.)

Teaching: classes that I have taught, am teaching, and might teach.

Founder of the Tidewater Big Data Enthusiasts Meetup

What the past has held:

A reasonably current resume.
A collection of pictures that needs to be updated.

Recent publications:

2014 Joint Conference on Digital Libraries; London, UK: When Should I Make Preservation Copies of Myself?
2012 ODU CS Department Technical Report: When Should I Make Preservation Copies of Myself?
2011 ODU CS Department Technical Report: Connectivity Damage to a Graph by the Removal of an Edge or a Vertex
Hypertext 2010 - Analysis of graphs for Digital Preservation Suitability
Hypertext 2010 - Analysis of graphs for Digital Preservation Suitability presentation (be careful, there are mouse click and timed animations)
JCDL 2009 - Unsupervised Creation of Small World Networks for Preservation of Digital Objects (paper)
JCDL 2009 - A Framework for Digital Object Self-Preservation (Doctoral Consortium)
JCDL 2009 - Doctoral Consortium PowerPoint presentation (be careful, there are mouse click and timed animations)
JCDL 2008 - Self-Arranging Preservation Networks (poster)

On line links and videos

Movies and what-not in support of my PhD

How DOs preservation copies are spread across a set of hosts (from a host's perspective).

There are 1,000 DOs that desire to have at least 3 and no more than 5 preserved copies of themselves. Each host can have at most 5 preservation copies, and an unlimited number of locally owned/supported DOs. As each DO is added to the system, it is assigned to a host (a blue line going up) and (hopefully) a copy is preserved (red line going down). Both DOs and copies appear to be spread across all hosts evenly randomly.

How DOs preservation copies are spread across a set of hosts (from a node's perspective).

There are 1,000 DOs that desire to have at least 3 and no more than 5 preserved copies of themselves. A "wandering" DO will make connections to "fixed" DOs and then attempt to preserve copies of itself on the hosts that those fixed nodes live on. If the host has room available, then a copy will be preserved there. If the host does not have room, then the "originators" of the preserved copies will be queried to see if they have met their minimum desired number of copies. If the originator has met that minimum goal, then the originator will sacrifice one copy on that host to make room for the requesting DO. The number of preservation copies that a DO can have will grow from 0 to the minimum and then drift from the minimum to the maximum. The number of copies will never go back below the minimum.

The results of different preservation policies on the same graph.

Policy 1
Policy 2
Policy 3