Recent research has shown that the use of submillimeter-scale tapered post arrays could generate the so-called pancake bouncing, which is characterized by the fast shedding of impinging drops from the surface in a pancake shape without undergoing the retraction stage as observed on conventional superhydrophobic surfaces. Despite this exciting discovery, the fabrication of this unique superhydro...

The star and pancake networks were recently proposed as attractive alternatives to the hypercube topology for interconnecting processors in a parallel computer. However, few parallel algorithms are known for these networks. In this paper, we present several data communication schemes and basic algorithms for these two networks. These algorithms are then used to develop parallel solutions to var...

In this paper, we propose an O(n) algorithm that finds a fault-free path between any pair of non-faulty nodes in an n-pancake graph with n−2 faulty clusters whose diameters are at most 2. The lengths of the paths obtained by our algorithm are at most d◦(Pn)+7 where d◦(Pn) = b5(n+1)/3c represents the upper bound of the diameter of Pn given by Gates and Papadimitriou. According to the computer ex...

Gluten-free pancakes were prepared using rice flour and rice flour replaced with various amounts, at 10, 20 and 40%, of sweet potato flour. Textural properties of the cooked pancakes, such as hardness and chewiness generally increased with time after cooking, whereas they decreased with increased sweet potato flour replacement. On the other hand, cohesiveness decreased with time, but increased ...

The l-component (edge) connectivity of a graph G, denoted by cκl(G) (cλl(G)), is the minimum number vertices (edges) whose removal from G results in disconnected with at least l components. pancake Pn popular underlying topology for distributed systems. In paper, we determine cκl(Pn) and cλl(Pn) 3 ≤ 5.

In this paper, we present an experimental investigation on the pancake problem. Also called sorting by prefix reversals (SBPR), this problem is linked to the genome rearrangement problem also called sorting by reversals (SBR). The pancake problem is a NP-hard problem. Until now, the best theoretical R-approximation was 2 with an algorithm which gives a 1.22 experimental R-approximation on stack...

We develop a general and demonstrably widely applicable technique for determining the asymptotic conditional diagnosability of interconnection networks prevalent within parallel computing under the comparison diagnosis model. We apply our technique to replicate (yet extend) existing results for hypercubes and k-ary n-cubes before going on to obtain new results as regards folded hypercubes, panc...