<?xml version='1.0' encoding='UTF-8'?><rss xmlns:atom='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' version='2.0'><channel><atom:id>tag:blogger.com,1999:blog-7971129765203231703</atom:id><lastBuildDate>Fri, 25 Jul 2008 00:45:42 +0000</lastBuildDate><title>Donald W. Blair, Jr.</title><description/><link>http://people.umass.edu/dwblair/</link><managingEditor>noreply@blogger.com (D)</managingEditor><generator>Blogger</generator><openSearch:totalResults>2</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>25</openSearch:itemsPerPage><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-7971129765203231703.post-2687991288971641124</guid><pubDate>Wed, 21 May 2008 11:21:00 +0000</pubDate><atom:updated>2008-05-21T06:29:49.958-07:00</atom:updated><title>Recent</title><description>I'll be writing my thesis in Amherst, MA for most of the summer of 2008.</description><link>http://people.umass.edu/dwblair/2008/05/upcoming.html</link><author>noreply@blogger.com (D)</author></item><item><guid isPermaLink='false'>tag:blogger.com,1999:blog-7971129765203231703.post-911074995488497911</guid><pubDate>Mon, 19 May 2008 20:42:00 +0000</pubDate><atom:updated>2008-05-20T18:53:59.003-07:00</atom:updated><title>Research</title><description>&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://people.umass.edu/dwblair/uploaded_images/perc1-783904.gif"&gt;&lt;img style="margin: 0pt 10px 10px 0pt; float: left; cursor: pointer;" src="http://people.umass.edu/dwblair/uploaded_images/perc1-783899.gif" alt="" border="0" width="100" /&gt;&lt;/a&gt; &lt;span style="font-weight: bold;"&gt;Diameter of Random Clusters&lt;/span&gt; with Jon Machta (UMass).  I have been studying the critical behavior of the diameter of Potts Model clusters via numerical simulations.  Here the diameter corresponds to the "graph theoretic" definition of diameter -- the longest of all the shortest paths in the cluster.&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://people.umass.edu/dwblair/uploaded_images/melt3-733087.png"&gt;&lt;img style="float:left; margin:0 10px 10px 0;cursor:pointer; cursor:hand;" src="http://people.umass.edu/dwblair/uploaded_images/melt3-733067.png" width="100" border="0" alt="" /&gt;&lt;/a&gt; &lt;span style="font-weight: bold;"&gt;Melting Dynamics in Colloidal Crystallites&lt;/span&gt; with Alex Levine and Moumita Das (UCLA), Tony Dinsmore, John Savage, and Bob Guyer (all at UMass), and David Lacoste (ESPCI). Using simulation, theory, and experiment, we have been studying the melting and freezing dynamics of crystallites with both short- and long-ranged interparticle potentials.&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://people.umass.edu/dwblair/uploaded_images/grain1-771667.png"&gt;&lt;img style="float:left; margin:0 10px 10px 0;cursor:pointer; cursor:hand;" src="http://people.umass.edu/dwblair/uploaded_images/grain1-771651.png" width="100" border="0" alt="" /&gt;&lt;/a&gt; &lt;span style="font-weight: bold;"&gt;Phase Behavior of Granular Nematics&lt;/span&gt; with Narayanan Menon (UMass) and Sriram Ramaswamy (IISc). We have been simulating 2D, hard rod systems in order to study phase behavior as a function of aspect ratio and end-shape.  We plan to make connections to flocking dynamics in systems of self-propelled particles.&lt;br /&gt;&lt;br /&gt;&lt;a onblur="try {parent.deselectBloggerImageGracefully();} catch(e) {}" href="http://people.umass.edu/dwblair/uploaded_images/unsat1-798322.png"&gt;&lt;img style="float:left; margin:0 10px 10px 0;cursor:pointer; cursor:hand;" src="http://people.umass.edu/dwblair/uploaded_images/unsat1-798318.png" width="100" border="0" alt="" /&gt;&lt;/a&gt; &lt;span style="font-weight: bold;"&gt;Phase Transitions in Computational Complexity&lt;/span&gt;  with Jon Machta (UMass).  In recent years, the observation of what appear to be phase transitions in the computational complexity of "hard problems" in computer science (e.g. K-SAT) have led to the application of statistical physics techniques to these problems.  The percolation model is a simple model with a well-understood phase transition at a critical value of the bond (or spin) occupation probability, p_c.  We study the computational complexity of simulating the percolation model, and find that it also exhibits a phase transition at p_c.</description><link>http://people.umass.edu/dwblair/2008/05/i-am-completing-my-doctorate-in-physics.html</link><author>noreply@blogger.com (D)</author></item></channel></rss>