Influence of viscoelastic nature on the intermittent peel-front dynamics of adhesive tape

We investigate the influence of viscoelastic nature of the adhesive on the intermittent peel front dynamics by extending a recently introduced model for peeling of an adhesive tape. As time and rate-dependent deformation of the adhesives are measured in stationary conditions, a crucial step in incorporating the viscoelastic effects applicable to unstable intermittent peel dynamics is the introduction of a dynamization scheme that eliminates the explicit time dependence in terms of dynamical variables. We find contrasting influences of viscoelastic contribution in different regions of tape mass, roller inertia, and pull velocity. As the model acoustic energy dissipated depends on the nature of the peel front and its dynamical evolution, the combined effect of the roller inertia and pull velocity makes the acoustic energy noisier for small tape mass and low-pull velocity while it is burstlike for low-tape mass, intermediate values of the roller inertia and high-pull velocity. The changes are quantified by calculating the largest Lyapunov exponent and analyzing the statistical distributions of the amplitudes and durations of the model acoustic energy signals. Both single and two stage power-law distributions are observed. Scaling relations between the exponents are derived which show that the exponents corresponding to large values of event sizes and durations are completely determined by those for small values. Th scaling relations are found to be satisfied in all cases studied. Interestingly, we find only five types of model acoustic emission signals among multitude of possibilities of the peel front configurations.

Faster Algorithms for Incremental Topological Ordering.Robert Tarjan

We present two online algorithms for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm takes O(m 1/2) amortized time per arc and our second algorithm takes O(n 2.5/m) amortized time per arc, where n is the number of vertices and m is the total number of arcs. For sparse graphs, our O(m 1/2) bound improves the best previous bound by a factor of logn and is tight to within a constant factor for a natural class of algorithms that includes all the existing ones. Our main insight is that the two-way search method of previous algorithms does not require an ordered search, but can be more general, allowing us to avoid the use of heaps (priority queues). Instead, the deterministic version of our algorithm uses (approximate) median-finding; the randomized version of our algorithm uses uniform random sampling. For dense graphs, our O(n 2.5/m) bound improves the best previously published bound by a factor of n 1/4 and a recent bound obtained independently of our work by a factor of logn. Our main insight is that graph search is wasteful when the graph is dense and can be avoided by searching the topological order space instead. Our algorithms extend to the maintenance of strong components, in the same asymptotic time bounds.