We construct a family of linear maximally recoverable codes with locality $r$ and dimension $r+1.$ For length $n$ $r\approx n^\alpha, 0\le\alpha\le 1$ the code alphabet is order $n^{1+3\alpha},$ which improves upon previously known constructions codes.

In this paper, we investigate the recoverable robust knapsack problem, where the uncertainty of the item weights follows the approach of Bertsimas and Sim [3, 4]. In contrast to the robust approach, a limited recovery action is allowed, i.e., upto k items may be removed when the actual weights are known. This problem is motivated by the assignment of traffic nodes to antennas in wireless networ...

While EER (Exhaust Energy Recovery) has been widely pursued for improving the total efficiency and reducing CO2 emissions of internal combustion engines, the maximum regenerated power from the exhaust energy has been proposed and calculated in terms of endoreversible cycle. In this paper, based on the experimental data of an EER system installed on a light duty gasoline engine, the exhaust ener...

Large-scale distributed systems are very attractive for the execution of parallel applications requiring a huge computing power. However, their high probability of site failure is unacceptable, especially for long time running applications. In this paper, we address this problem and propose a checkpointing mechanism relying on a recoverable distributed shared memory (DSM). Although most recover...

This paper shows how to use Barrier Certificates (BaCs) to design Simplex Architectures for hybrid systems. The Simplex architecture entails switching control of a plant over to a provably safe Baseline Controller when a safety violation is imminent under the control of an unverified Advanced Controller. A key step of determining the switching condition is identifying a recoverable region, wher...

We show that expander codes, when properly instantiated, are high-rate list recoverable codes with linear-time list recovery algorithms. List recoverable codes have been useful recently in constructing efficiently list-decodable codes, as well as explicit constructions of matrices for compressive sensing and group testing. Previous list recoverable codes with linear-time decoding algorithms hav...

Proceedings of the 8thWorkshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems, held on Septmeber 18 in Karlsruhe, Germany. ATMOS 2008 Preface 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems The 8th ATMOS workshop was held in Karlsruhe, September 18, 2008, within ALGO, a set of meetings related to algorithms. The ser...

Phylogenetic networks generalize evolutionary trees, and are commonly used to represent evolutionary histories of species that undergo reticulate evolutionary processes such as hybridization, recombination and lateral gene transfer. Recently, there has been great interest in trying to develop methods to construct rooted phylogenetic networks from triplets, that is rooted trees on three species....