Experimental results on the electrical characteristics of Hg-alkanethiol/arenethiol-Au molecular junctions are used to develop a physical model for the hysteretic negative-differential resistance NDR for these, and possibly other, metal-molecule-metal junctions. The dependence of the room-temperature current-voltage characteristic on sweep direction and sweep rate is examined. Based on several ...

Sweeping has become the workhorse algorithm for creating conforming hexahedral meshes of complex models. This paper describes progress on the automatic, robust generation of MultiSwept meshes in CUBIT. MultiSweeping extends the class of volumes that may be swept to include those with multiple source and multiple target surfaces. While not yet perfect, CUBIT’s MultiSweeping has recently become m...

It is proposed that the inertial range clustering of small heavy particles in fluid turbulence occurs as a result of the sweep-stick mechanism which causes inertial particles to cluster so as to mimic the clusters of points where the fluid acceleration is perpendicular to the direction of highest contraction between neighboring particles. Direct numerical simulations of inertial particles subje...

Observations of streamwise and crossflow instabilities on swept circular cylinders over a range of inclinations are presented. By considering sweep angles through the full range between the two extremes studied in the literature, we relate the streamwise vorticity of the unswept case (Kestin & Wood, J. Fluid Mech. 44) to the more aggressive crossflow instability at high sweep angles (Poll, J. F...

For applying the sweep-line method, a state space reduction technique, it is necessary to provide an automatic calculation of a progress measure. In [1], such a calculation has been proposed for Petri nets. The approach presented there may lead to suboptimal results, therefore the author suggested possible optimizations. In this paper, we check whether the proposed optimization goals indeed lea...

We present data structures for maintaining the relative convex hull of a set of points (sites) in the presence of pairwise non-crossing line segments (barriers) that subdivide a bounding box into simply connected faces. Our data structures have O((n + m) log n) size for n sites and m barriers. They support O(m) barrier insertions and O(n) site deletions in O((m + n) polylog (mn)) total time, an...

The greedy triangulation of a nite planar point set is obtained by repeatedly inserting a shortest diagonal that doesn't intersect those already in the plane. We show that the problem of constructing the greedy triangulation of a nite set of points with integer coordinates in the plane is P-complete. This is the rst known geometric P-complete problem where the input is given as a set of points....