This paper focuses on evaluating the impact of different data layouts on the computational efficiency of GPU-accelerated Inverse Distance Weighting (IDW) interpolation algorithm. First we redesign and improve our previous GPU implementation that was performed by exploiting the feature of CUDA dynamic parallelism (CDP). Then we implement three versions of GPU implementations, i.e., the naive ver...

Parcels are the smallest units of land usually considered for urban development purposes. Analyses at parcel level allow taking into account administrative and physical environment buildings with accuracy (roads, surrounding buildings, local design rules building construction). In this article, we propose a free open source software application, namely Parcel Manager, whose aims twofold: (1) to...

ÐExploiting locality of references has become extremely important in realizing the potential performance of modern machines with deep memory hierarchies. The data access patterns of programs and the memory layouts of the accessed data sets play a critical role in determining the performance of applications running on these machines. This paper presents a cache locality optimization technique th...

Current graph visualization techniques gather information found in a database or a file and create output on the screen that represents that data. There are different types of layouts from which to choose, such as force-directed layouts, circle-layouts and spring layouts. These layouts are all either random, or based upon the edges in the graphs. They do not lend any weight to what the nodes mi...

Neural prosthetic systems have been designed to estimate continuous reach trajectories (motor prostheses) and to predict discrete reach targets (communication prostheses). In the latter case, reach targets are typically decoded from neural spiking activity during an instructed delay period before the reach begins. Such systems use targets placed in radially symmetric geometries independent of t...

We present a simple three-layer assignment algorithm for planar layouts generated by a class of layout algorithms. This class of algorithms includes simple variations of the following algorithms developed by Mehlhorn et al. (1986): (i) The algorithm that generates planar layouts for the two-terminal net CRP with dmax tracks. (ii) The algorithm that generates planar layouts for the twoand three-...

Layout managers are used to control the placement of widgets in graphical user interfaces (GUIs). Constraint-based layout managers are more powerful than other ones. However, they are also more complex and their layouts are prone to problems that usually require direct editing of constraints. Today, designers commonly use GUI builders to specify GUIs. The complexities of traditional approaches ...

The trend of using text messaging on mobile phones has grown rapidly in the last decade. However, mapping the alphabet to twelve phone keys introduces challenging ambiguities for text entry. This challenge is exacerbated in Chinese by the large phonetic alphabet and homophonic Chinese characters. In response, we propose a novel algorithm to generate keypad layouts that reduce ambiguity for Chin...

In digital signal processors (DSPs) variables are accessed using k address registers. The problem of finding a memory layout, for a set of variables, that minimizes the address-computation overhead is known as the General Offset Assignment (GOA) Problem. The most common approach to this problem is to partition the set of variables into k partitions and to assign each partition to an address reg...

PURPOSE This study sought to describe features of the physical space in which practices integrating primary care and behavioral health care work and to identify the arrangements that enable integration of care. METHODS We conducted an observational study of 19 diverse practices located across the United States. Practice-level data included field notes from 2-4-day site visits, transcripts fro...