Evaluating a weighted graph polynomial for graphs of bounded tree-width

We show that for any $k$ there is a polynomial time algorithm to evaluate the weighted graph polynomial $U$ of any graph with tree-width at most $k$ at any point. For a graph with $n$ vertices, the algorithm requires $O(a_k n^{2k+3})$ arithmetical operations, where $a_k$ depends only on $k$

The Metamorphosis of the Defense Industry

The downsizing of the United States defense industry in recent years had a multitude of effects on defense and defense-related manufacturers. Besides the inevitable loss of jobs, these firms essentially had to reinvent themselves in order to compete in the commercial sector more effectively. Moreover, the defense cutbacks also resulted in implications for the U.S. as a whole. These include questionable preparedness for armed conflict, as well as the potential loss of defense-related suppliers that could affect the ability to sustain armed conflict. These and other insights were gleaned from plant-level interviews and tours of several, small defense-related manufacturers