The LADARVision system utilizes a small fixed diameter excimer laser beam coupled with a high fidelity eye tracking system to perform wavefront-guided refractive surgery. The fixed small beam provides a consistent ablation per pulse. By delivering many identical pulses in a predetermined pattern, which includes an optimized custom blend zone, the laser is able to ablate complex (higher order) c...

This article is a critical survey of models designed for pricing fixed-income securities and their associated term structures of market yields. Our primary focus is on the interplay between the theoretical specification of dynamic term structure models and their empirical fit to historical changes in the shapes of yield curves. We begin by overviewing the dynamic term structure models that have...

Given a tree T spanning a set of points S in the plane, we study the problem of drawing T using only line segments aligned with a fixed set of directions C. The vertices in the drawing must lie within a given distance r of each original point p ∈ S, and an objective function counting the number of bends must be minimised. We propose five versions of this problem using different objective functi...

A three-dimensional grid-drawing of a graph represents the vertices by distinct points in Z (called grid-points), and represents each edge as a polyline between its endpoints with bends (if any) also at gridpoints, such that distinct edges only intersect at common endpoints, and each edge only intersects a vertex that is an endpoint of that edge. This topic has been previously studied in [1–5]....

We consider drawings of trees in which all edges incident to leaves can be extended to infinite rays without crossing, partitioning the plane into infinite convex polygons. Among all such drawings we seek the one maximizing the angular resolution of the drawing. We find linear time algorithms for solving this problem, both for plane trees and for trees without a fixed embedding. In any such dra...

Let r and w be a fixed positive numbers, w < r. In a bold drawing of a graph, every vertex is represented by a disk of radius r, and every edge by a narrow rectangle of width w. We solve a problem of van Kreveld [K09] by showing that every graph admits a bold drawing in which the region occupied by the union of the disks and rectangles representing the vertices and edges does not contain any di...

The influence of solid-state drawing on the morphology of melt-spun poly(L-lactic acid) (PLLA) tapes, and the accompanying changes in mechanical and degradation behaviour have been studied. Mechanical properties are found to be strongly dependent on both applied draw ratio and drawing temperature. Moduli of these highly oriented tapes are significantly increased compared to as-extruded tapes at...

Let G be a graph embedded in the plane and let A be an arrangement of pseudolines intersecting the drawing of G. An aligned drawing of G and A is a planar polyline drawing Γ of G with an arrangement A of lines so that Γ and A are homeomorphic to G and A. We show that if A is stretchable and every edge e either entirely lies on a pseudoline or intersects at most one pseudoline, then G and A have...

Cognitive experiments show that humans can read graph drawings in which all edge crossings are at right angles equally well as they can read planar drawings; they also show that the readability of a drawing is heavily affected by the number of bends along the edges. A graph visualization whose edges can only cross perpendicularly is called a RAC (Right Angle Crossing) drawing. This paper initia...

a new method for increasing ldr in deep drawing is application of anti-lock braking system (abs) on blank holder. in this method, instead of applying a constant force on blank and control the metal flow, the abs system holds and releases the blank several times (20 to 50 times) which results increasing ldr. this study investigates the effect of different parameters of abs on improving the condi...