The robustness of connectivity and the efficiency of paths are incompatible in many real networks. We propose a self-organization mechanism for incrementally generating onion-like networks with positive degree-degree correlations whose robustness is nearly optimal. As a spatial extension of the generation model based on cooperative copying and adding shortcut, we show that the growing networks ...

| To eeciently transfer large amounts of diverse traac over high-speed links, modern integrated networks require more eecient packet-switching techniques that can capitalize on recent advances in switch hardware. Several promising approaches attempt to improve performance by creating dedicated \shortcut" connections for long-lived traac ows, at the expense of the network overhead for establishi...

Analysts need to keep track of their analytic findings, observations, ideas, and hypotheses throughout the analysis process. While some visual analytics tools support such note-taking needs, these notes are often represented as objects separate from the data and in a workspace separate from the data visualizations. Representing notes the same way as the data and integrating them with data visua...

Article history: Received 8 January 2017 Accepted 27 March 2017 Available online xxxx

Previous research has shown that people use both embodied perceptual simulations and linguistic distributional knowledge during conceptual processing, with linguistic information especially useful for shallow tasks and rapid responding. Using two conceptual combination tasks, we show that this linguistic shortcut is evident in both shallow and deep conceptual processing of novel stimuli. Specif...

This article describes how, in the high-level software packages used by non-statisticians, approximate non-parametric bootstrap samples can be created and analyzed without physically creating new data sets, or resorting to complex programming. The comparable performance of this shortcut method, which uses Poisson rather than multinomial frequencies for the numbers of copies of each observation,...

Cartographers collect more data than they need, and so must simplify coastlines, boundaries, and other linear features to display a map at a given scale. Many simplification methods, however, can introduce intersections that were not originally present, corrupting the features. Kulik suggests a simple shortcut operation for polygonal lines: remove a point pi and connect its former neighbors pi−...

Visitors who browse the web from wireless PDAs, cell phones, and pagers are frequently stymied by web interfaces optimized for desktop PCs. Simply replacing graphics with text and reformatting tables does not solve the problem, because deep link structures can still require minutes to traverse. In this paper we develop an algorithm, MINPATH, that automatically improves wireless web navigation b...

Efficient algorithms are necessary for solving problems effectively. However, efficient algorithms are hard to develop, implement, and maintain. Therefore, it has been very difficult for those with little algorithmic knowledge to solve their problems based on efficient algorithms. In this paper, we introduce a way to develop efficient algorithms for finding optimal sequences, especially sequenc...

Do humans integrate experience on specific routes into metric survey knowledge of the environment, or do they depend on a simpler strategy of landmark navigation? The authors tested this question using a novel shortcut paradigm during walking in a virtual environment. The authors find that participants could not take successful shortcuts in a desert world but could do so with dispersed landmark...