The efficiency of collaboration among processors is a critical design metric for multiprocessor systemson-chip (MPSoCs). It is the communication architecture that determines the collaboration efficiency on the hardware side. Optical NoCs, which are based on optical interconnects and optical routers, offer a new approach to empowering ultra-high bandwidth with low power consumption. In this pape...

Given a vertex-labeled tree on n vertices we show how to obtain a straight-line, crossings-free drawing of it on a set of n labeled concentric tracks, such that the vertex labels match the track labels. The tracks can be defined by conic sections (such as circles, ellipses, circular arcs) or other smooth convex curves. We show that this type of embedding can be used to simultaneously embed tree...

We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n vertices and k crossings, where k is smaller than n by an iterated logarithmic factor. Specific problems we study include Voronoi diagrams and single-source shortest paths. Our algorithms all run in linear time in the ...

It is well known that only a special class of bandpass signals, called real-zero (RZ) signals can be uniquely represented (up to a scale factor) by their zero crossings, i.e., the time instants at which the signals change their sign. However, it is possible to invertibly map arbitrary bandpass signals into RZ signals, thereby, implicitly represent the bandpass signal using the mapped RZ signal'...

22 23 Implementation of highway-rail grade crossing warning systems, educational programs and 24 research on crossings have all contributed to a steady reduction in the risk to highway users of 25 grade crossings over the past several decades. Much less attention has been given to 26 understanding the effect of grade crossings on train safety and risk. Collisions at highway-rail 27 grade crossi...

We study the algorithmic aspect of edge bundling. A bundled crossing in a drawing of a graph is a group of crossings between two sets of parallel edges. The bundled crossing number is the minimum number of bundled crossings that group all crossings in a drawing of the graph. We show that the bundled crossing number is closely related to the orientable genus of the graph. If multiple crossings a...