We introduce shortcut graphs and groups. Shortcut are in which cycles cannot embed without metric distortion. groups act properly cocompactly on graphs. These notions unify a surprisingly broad family of interest geometric group theory graph theory, including: the 1-skeletons systolic quadric complexes (in particular finitely presented C(6) C(4)-T(4) small cancellation groups), finite dimension...

A system which employs a stylus as an input device is suitable for creative activities like writing and painting. However, such a system does not always provide the user with a GUI that is easy to operate using the stylus. In addition, system usability is diminished because the stylus is not always integrated into the system in a way that takes into consideration the features of a pen. The purp...

a shortcut procedure as quick, easy-to use method for design and simulation of multicomponent batch distillation is used to predict the operating condition of recovering xylene from solvent in an existing batch distillation column in benzol refinery. the procedure can be used to investigate the effect of the operating parameters on the operation of column for three possible modes of batch disti...

We present an alternative to tree rebalancing for improving the expected search cost in weighted binary search trees. This alternative is based on the insertion of shortcut links between nodes in the search tree. We propose several shortcut models and give polynomial time algorithms to find the best shortcuts for two of these models.

Topology is an important network attribute that greatly affects the power, performance, cost, and design time/effort of NoCs. In this paper, we propose a novel NoC architecture that can exploit the benefits of both application-specific and regular NoC topologies. To this end, a subset of NoC links bypass the router pipeline stages and directly connect remotely located nodes. This results in an ...

Previous work introduced the concept of using tactical shortcut options to improve schedule conformance in terminal airspace. When a scheduling point is congested, aircraft are scheduled to longer nominal paths, holding shortcut path options in reserve for tactical use if an aircraft is late, thereby improving the schedule conformance, reducing the required scheduling buffer, and increasing thr...

Previous research has shown that people use linguistic distributional information during conceptual processing, and that it is especially useful for shallow tasks and rapid responding. Using two conceptual combination tasks, we showed that this linguistic shortcut extends to the processing of novel stimuli, is used in both successful and unsuccessful conceptual processing, and is evident in bot...

Given a rooted tree with n nodes, the tree shortcut problem is to add a set of shortcut edges to the tree such that the shortest path from each node to any of its ancestors is of length O(logn) and the degree increment of each node is constant. We consider in this paper the dynamic version of the problem, which supports node insertion and deletion. For insertion, a node can be inserted as a lea...