The self-cleaning function of superhydrophobic surfaces is conventionally attributed to the removal of contaminating particles by impacting or rolling water droplets, which implies the action of external forces such as gravity. Here, we demonstrate a unique self-cleaning mechanism whereby the contaminated superhydrophobic surface is exposed to condensing water vapor, and the contaminants are au...

Spontaneous movement of condensed matter provides a new insight to efficiently improve condensation heat transfer on superhydrophobic surface. However, very few reports have shown the jumping behaviors on the sprayable superhydrophobic coatings. Here, we developed a sprayable silica nano-porous coating assembled by fluorinated nano-chains to survey the condensates' dynamics. The dewdrops were c...

Due to high impact forces and low duty cycles, monopedal jumping robots are particularly susceptible to failure from a slipping foot. Spines provide a solution to reduce slip, but there has been little research on how to effectively engage them into a surface with a dynamic jumping robot. Previous robots utilizing spines operate in different regimes of surface approach speed and cycle time. For...

An L-segment consists of a horizontal and a vertical straight line which form an L. In an L-embedding of a graph, each vertex is represented by an Lsegment, and two segments intersect each other if and only if the corresponding vertices are adjacent in the graph. If the corner of each L-segment in an Lembedding lies on a straight line, we call it a monotone L-embedding. In this paper we give a ...

Basin-Hopping (BH) or Monte-Carlo Minimization (MCM) is so far the most reliable algorithms in chemical physics to search for the lowest-energy structure of atomic clusters and macromolecular systems. BH transforms the complex energy landscape into a collection of basins, and explores them by hopping, which is achieved by randomMonte Carlo moves and acceptance/rejection using the Metropolis cri...

In characteristic zero one can define invariants of singularities using all divisors over the ambient variety. A key result that makes these invariants computable says that they can be determined by the divisors on a resolution of singularities. For example, if a is a sheaf of ideals on a nonsingular variety, then to every nonnegative real number λ one associates the multiplier ideal J (a). The...

Mustaţǎ, Takagi and Watanabe define F-thresholds, which are invariants of a pair of ideals in a ring of characteristic p > 0. In their paper, it is proved that F-thresholds are equal to jumping numbers of test ideals on regular local rings. In this note, we give formulas of F-thresholds and F-jumping coefficients on toric rings. By these formulas, we prove that there exists an inequality betwee...

This paper proposes implementations of the well-known traffic policing mechanisms for high speed networks. The implementations are based on a high performance development environment and are described through commented block diagrams. The considered mechanisms are Leaky Bucket with variants, Jumping Window, Triggered Jumping Window, Continuous Sliding Window, Discretized Sliding Window and Time...

Lanczos-type algorithms are well known for their inherent instability. They typically breakdown when relevant orthogonal polynomials do not exist. Current approaches to avoiding breakdown rely on jumping over the non-existent polynomials to resume computation. This jumping strategy may have to be used many times during the solution process. We suggest an alternative to jumping which consists in...

Jumping is used in nature by many small animals to locomote in cluttered environments or in rough terrain. It offers small systems the benefit of overcoming relatively large obstacles at a low energetic cost. In order to be able to perform repetitive jumps in a given direction, it is important to be able to upright after landing, steer and jump again. In this article, we review and evaluate the...