Deterministic equilibrium flows in transport networks can be investigated by means of Markov's processes defined on the dual graph representations of the network. Sustained movement patterns are generated by a subset of automorphisms of the graph spanning the spatial network of a city naturally interpreted as random walks. Random walks assign absolute scores to all nodes of a graph and embed sp...

Data-flow is a natural approach to parallelism. However, describing dependencies and control between finegrained data-flow tasks can be complex and present unwanted overheads. TALM (TALM is an Architecture and Language for Multi-threading) introduces a user-defined coarse-grained parallel data-flow model, where programmers identify code blocks, called superinstructions, to be run in parallel an...

A unified graphical modeling technique, “Switching Flow-Graph” is developed to study the nonlinear dynamic behavior of pulse-width-modulated (PWM) switching converters. Switching converters are variable structure systems with linear subsystems. Each subsystem can be represented by a flow-graph. The Switching Flow-Graph is obtained by combining the flowgraphs of the subsystems through the use of...

Communications devices intended for use in securitycritical applications must be rigorously evaluated to ensure they preserve data confidentiality. This process includes tracing the flow of classified information through the device’s circuitry. Previous work has shown how this can be done using graph analysis techniques for each of the device’s distinct operating modes. However, such analyses o...

Let f : Σ1 7→ Σ2 be a map between compact Riemannian manifolds of constant curvature. This article considers the evolution of the graph of f in Σ1×Σ2 by the mean curvature flow. Under suitable conditions on the curvature of Σ1 and Σ2 and the differential of the initial map, we show that the flow exists smoothly for all time. At each instant t, the flow remains the graph of a map ft and ft conve...

Estimating per-pixel motion between video frames, known as optical flow, is a long-standing problem in understanding and analysis. Most contemporary flow techniques largely focus on addressing the cross-image matching with feature similarity, few methods considering how to explicitly reason over given scene for achieving holistic understanding. In this work, taking fresh perspective, we introdu...

s away much detail about the actual execution of a program from application developers: developers only specify logical relationships between data; the Datalog compiler constructs a suitable execution plan by extracting data and control flow from the Datalogprogram. Compared to emerging distributed programming languages for GPUs such as Map-Reduce [64], Datalog expresses a richer set of relatio...