Circulations are similar to flows in capacity-constrained networks, with the difference that they also observe lower bounds and, unlike flows, are not directed from a source to a sink. We give a new description of circulations in networks using a technique introduced by Kawahara; he applied the same methods to network flows. We show the power and flexibility of his approach in a new application...

A new residual-type flux-free error estimator is presented. It computes upper and lower bounds of the error in energy norm with the ultimate goal of obtaining bounds for outputs of interest. The proposed approach precludes the main drawbacks of standard residual type estimators circumventing the need of flux-equilibration and resulting in a simple implementation that uses standard resources ava...

We propose a novel approach to cross-lingual part-of-speech tagging and dependency parsing for truly low-resource languages. Our annotation projection-based approach yields tagging and parsing models for over 100 languages. All that is needed are freely available parallel texts, and taggers and parsers for resource-rich languages. The empirical evaluation across 30 test languages shows that our...

Article history: The study investigates the impact of trade openness on economic growth in the long run. We apply the ARDL Accepted 28 July 2012 bounds testing approach to test for a long run relationship and the augmented production function by incorporating financial development as an additional determinant of economic growth using the framework of

Attacks that exploit out-of-bounds errors in C and C++ programs are still prevalent despite many years of research on bounds checking. Previous backwards compatible bounds checking techniques, which can be applied to unmodified C and C++ programs, maintain a data structure with the bounds for each allocated object and perform lookups in this data structure to check if pointers remain within bou...

In this paper we formulate an algorithm for finding smooth graphs with small independence numbers. To this end we formalize a family of satisfaction problems and propose a branch-and-bound-based approach for solving them. Strong bounds are obtained by exploiting graph-theoretic aspects including new results obtained in cooperation with leading graph theorists. Based on a partial solution we der...