We show the universality of the VEDIC network in simulating other well known interconnection networks b y generating the parameters of the VEDtC network automatically. Algorithms are given to represent chordal rings, toroidal meshes, binary hypercubes, kary n-cubes, and Cayley graphs star graph and pancake graph, as VEDIC networks. Using these parameters the VEDIC network can be used as a tool ...

Using parallel three-dimensional molecular dynamics simulations of line-like coupled pancake vortices, we consider the e€ect of inter-layer coupling strength and pinning correlation on the magnetization curves of anisotropic super-conductors. Columnar pins produce the largest critical current and are insensitive to layer interaction strength. Point pins are increasingly e€ective at pinning the ...

The uniformly frustrated layered XY model is analyzed in its Villain form. A decouple pancake vortex liquid phase is identified. It is bounded by both first-order and secondorder decoupling lines in the magnetic field versus temperature plane. These transitions, respectively, can account for the flux-lattice melting and for the flux-lattice depinning observed in the mixed phase of clean high-te...

A k-container C(u, v) of a graph G is a set of kdisjoint paths joining u to v. A k-container C(u, v) of G is k∗-container if C(u, v) spans G. A graph G is k∗-connected if there exists a k∗-container between any two distinct vertices. Let κ(G) be the connectivity of G. In this paper, we prove that the n-dimensional burnt pancake graph Bn is n∗connected for any positive integer n.

Sorting by Prefix Reversals, also known as Pancake Flipping, is the problem of transforming a given permutation into the identity permutation, where the only allowed operations are reversals of a prefix of the permutation. The problem complexity is still unknown, and no algorithm with an approximation ratio better than 3 is known. We present the first polynomial-time 2-approximation algorithm t...

To examine the performance of the dynamic Smagorinsky model in a controlled fashion on anisotropic grids, simulations of forced isotropic turbulence are performed using highly anisotropic discretizations. The resulting model coefficients are compared with an earlier prediction. Two extreme cases are considered: pancake-like grids, for which two directions are poorly resolved compared to the thi...

This survey paper presents the historical development of some problems on Cayley graphs which are interesting to graph and group theorists such as Hamiltonicity or diameter problems, to computer scientists and molecular biologists such as pancake problem or sorting by reversals, to coding theorists such as the vertex reconstruction problem related to error-correcting codes but not related to Ul...