This paper presents a comparative study of several soft keyboard layouts for text entry on interactive whiteboards. We compare the traditional QWERTY with several other layouts, including theoretically optimal ones, such as FITALY. In contrast to previous work, we concentrate on novice performance, as few people ever gain expert status on whiteboards. The results show that for a population of r...

With the growth of residential rooftop PV adoption in recent decades, problem effective layout design has become increasingly important years. Although a number automated methods have been introduced, these tend to rely on simplifying assumptions and heuristics improve computational tractability. We demonstrate fully pipeline that attempts solve more general formulation with greater geometric f...

Several Over-the-Cell (OTC) routing algorithms have been proposed for two and three layer processes. All the existing OTC routers can be used only on the cell models for which they were developed for. In this paper, we develop a uni ed approach to multi-layer routing, motivated by over-the-cell routing, which can be used for full-custom layouts. Our approach can also be directly applied to stan...

We present a technique for generating and optimizing expressions for indexing complex array layouts. Our technique is built around a declarative, domain-specific layout language that provides support for arbitrarily-nested row-major, column-major, Z-Morton, and Hilbert curve layouts. To maintain programmability, we maintain a ‘logical,’ two-dimensional view of the data in physical memory, allow...

Visualizing graphs using virtual physical models is probably the most heavily used technique for drawing graphs in practice. There are many algorithms that are efficient and produce high-quality layouts. If one requires that the layout also respect a given set of non-uniform edge lengths, however, force-based approaches become problematic while energy-based layouts become intractable. In this p...

In a total order of the vertices of a graph, two edges with no endpoint in common can be crossing, nested, or disjoint. A k-stack (respectively, k-queue, k-arch) layout of a graph consists of a total order of the vertices, and a partition of the edges into k sets of pairwise non-crossing (respectively, non-nested, non-disjoint) edges. Motivated by numerous applications, stack layouts (also call...

We present an extended version of targeted projection pursuit, a high dimensional data exploration tool adapted for producing graph layouts using node-attributes. Attributes are generated based on detected events in the intrusion detection system and firewall logs and how often they occur for each IP address. Edges are the directed links between source and destination IPs. The layout is interac...

Parameter-specific and simulation-calibrated ring oscillator (RO) inverter layouts are described for identifying and quantitatively modeling sources of circuit performance variation from source/drain stress, shallow trench isolation (STI) stress, lithography, etch, and misalignment. This paper extends the RO approach by adding physical modeling/simulation of the sources of variability to tune t...

This thesis reports an automatic method for synthesizing MEMS mask-layouts. This method incorporates a forward simulation of fabrication into a general evolutionary algorithm loop. An initial random population of mask-layouts is generated. The fabrication of each layout is simulated through a digital process simulator to produce a 3D fabricated shape, which is compared to a user-specified desir...

Circular layouts are a popular graph drawing style, where vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, oneand two-sided circular layouts are equivalent to one-page and two-pa...