Using computer simulations we study how a corona of polymer molecules grafted to cellulose nanocrystal aggregate (CNA) particles influences the interaction between pairs of parallel CNAs. The resulting distance and orientation (face-to-face versus edge-to-edge) dependence is very rich and counterintuitive. Although the unperturbed polymer corona assumes cylindrical symmetry relatively quickly a...

DESIGNING DISTANCE-PRESERVING FAULT-TOLERANT TOPOLOGIES By Sitarama Swamy Kocherlakota The objective of designing a fault-tolerant communication network (CN) is to maintain its functionality in the presence of failures. The approaches taken in designing fault-tolerant systems can be classified, in general, by the functionality criteria. There are two functionality criteria that have received mu...

Let (x,y) be an edge of a graph G. Then the rotation of (x, y) about xis the operation of removing (x, y) from G and inserting (x, y') as an edge, where y' is a vertex of G. The rotation distance between graphs G and H is the minimum number of rotations necessary to transform G into H. Lower and upper bounds are given on the rotation distance of two graphs in terms of their greatest common subg...

We show that the set of vertices in a treeT of smallest weight balance is the (branchweight) centroid. We characterize the set of edges in T with smallest weight-edge difference in terms of the vertices of smallest weight balance. A similar characterization is obtained for the set of edges in T with smallest distance-edge difference in terms of the vertices of smallest distance balance. This yi...

(Automatic) Search Approach – fully automatic search exploring the impact of using frames sampled at 2 second intervals rather than keyframes: • UIowa07AS01 – required ASR using noun phrases and entities • UIowa07AS02 – required non-ASR run color histogram * edge * distance • UIowa07AS03 – color histogram similarity • UIowa07AS04 – product of maximal histogram, edge, distance similarities for s...

A set D of vertices in a graph G is a distance-k dominating set if every vertex of G either is in D or is within distance k of at least one vertex in D. A distance-k dominating set of G of minimum cardinality is called a minimum distance-k dominating set of G. For any graph G and for a subset F of the edge set of G the set F is an edge dominating set of G if every edge of G either is in D or is...