The design flow for primary-shaped microcomponents and microsystems is presented. As a characteristic of microspecific design, the approach is predominantly driven by technology. To integrate the relevant technological demands and restrictions into the design synthesis for a realizable embodiment design in accordance with the specified function, design rules are defined. These represent mandato...

Control Flow Graph (CFG) is a compact representation of all executable paths of a program and it is central to most program analyses. Unfortunately, the direct use of a CFG has two major sources of imprecision: (a) the existence of infeasible paths, and (b) the merging of states along incoming edges of a control-flow merge. Addressing these two problems is the path-sensitivity issue, and it is ...

Social networks are abstract organizational structures that help us understand the relationships among a group of interconnected individuals. Much recent research has focused on understanding the structure of these networks. Yet the network itself is a conceptual topology. The key is the activity that flows along the network paths: the support offered, the information given, the gossip exchange...

This paper connects multi-agent path planning on graphs (roadmaps) to network flow problems, showing that the former can be reduced to the later, therefore enabling the application of combinatorial network flow algorithms, as well as general linear program techniques, to multi-agent path planning problems on graphs. Exploiting this connection, we show that when the goals are permutation invaria...

We present a new approach to information flow control (IFC), which exploits counterexample-guided abstraction refinement (CEGAR) technology. The CEGAR process is built on top of our existing IFC analysis in which illegal flows are characterized using program dependence graphs (PDG) and path conditions (as described in [12]). Although path conditions provide an already precise abstraction that c...

Path integration or ‘dead reckoning’ is the ability to keep track of relative position using self-motion signals that convey information about speed and direction of movement. Most animal species, including humans, exhibit some degree of path integration capability and neurophysiological studies have demonstrated that self-motion signals are sufficient to update internal representations of both...

The article studies the generalisation of the maximum flow of minimum cost problem for the case of maximum discrete dynamic flow of minimum travelling cost and travelling time. The approach is based on iteratively generating efficient extreme points in the objective space by solving a series of single objective maximum flow problems with different objective functions. On each of the iterations,...

Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow between them along the shortest path. Each edge gets some random total flow. In the n→∞ limit we find explicitly the empirical distribution of these edge-flows, suitably normalized.

In this paper we propose a method to determine the flow of large crowds of agents in a scene such that it is filled to capacity with smoothly moving agents. Our approach provides a focus on coordinated and cooperative motion across the entire crowd. This is done with a view to providing control which animators can use to quickly and easily populate and fill a scene, in addition to other previou...

Thousands of cardiac failure patients per year in the United States could benefit from long-term mechanical circulatory support as destination therapy. To provide an improvement over currently available devices, we have designed a fully implantable axial-flow ventricular assist device with a magnetically levitated impeller (LEV-VAD). In contrast to currently available devices, the LEV-VAD has a...