Path-sensitive data flow analysis pairs classical data flow analysis with an analysis of feasibility of paths to improve precision. In this paper we propose a framework for path-sensitive backward data flow analysis that is enhanced with an abstraction of the predicate domain. The abstraction is based on a three-valued logic. It follows the strategy that path predicates are simplified if possib...

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a pat...

Solid oxide fuel cells (SOFCs) in metallic housings were integrally and locally characterised. The tests were performed in counter flow operation for hydrogen concentrations from 2% to 100%, to identify concentration limitations and to optimise fuel utilisation. Cell characterisations were performed by spatially resolved electrochemical impedance spectroscopy (EIS), current density/voltage (i–V...

In this paper, we study a stochastic minimum cost flow (SMCF) problem under arc failure uncertainty, where an arc flow solution may correspond to multiple path flow representations. We assume that the failure of an arc will cause flow losses on all paths using that arc, and for any path carrying positive flows, the failure of any arc on the path will lose all flows carried by the path. We formu...

This paper presents a path recognition and virtual guides (VGs) design method for task of following based on human-robot collaboration (HRC). Firstly, support vector machine (SVM) combined with least squares (LS) is developed to recognize the desired human guidance. Secondly, VGs are designed admittance control collaborative following, which combine human's decision-making robot's accurate exec...

The adoption of a predictable ECO flow that eliminates violations in all signoff scenarios without inadvertently introducing new ones helps reduce the number of timing iterations required for final signoff. Static timing analysis tools provide predictable, signoff-accurate guidance to implementation tools with the following capabilities: ` ` Fix design rule constraint (DRC), setup, and hold vio...

Ford and Fulkerson’s original 1956 max flow/min cut paper formulated max flow in terms of flows on paths, rather than the more familiar flows on arcs. In 1974 Hoffman pointed out that Ford and Fulkerson’s original proof was quite abstract, and applied to a wide range of flow problems. In this abstract model we have capacitated elements, and linearly ordered subsets of elements called paths. Whe...

We consider a continuous path of bounded symmetric Fredholm bilinear forms with arbitrary endpoints on a real Hilbert space, and we prove a formula that gives the spectral flow of the path in terms of the spectral flow of the restriction to a finite codimensional closed subspace. We also discuss the case of restrictions to a continuous path of finite codimensional closed subspaces. As an applic...

*Correspondence: Antonio F. Miguel, Department of Physics, School of Sciences and Technology, University of Évora, Rua Romao Ramalho 59, 7000-671 Évora, Portugal e-mail: [email protected] The occurrence of configuration (design, shape, structure, rhythm) is a universal phenomenon that occurs in every flow system. Dendritic configuration (or tree-shaped configurations) is ubiquitous in nature and li...