This paper develops an algorithm for solving a standard-form linear program directly from an infeasible "warm start,"i.e., directly from a given infeasible solution x that satisfies A = b but x X 0. The algorithm is a potential function reduction algorithm, but the potential function is somewhat different than other interior-point method potential functions, and is given by F(x, B) = q In (ct x...

This paper aarms that quantiication of life-critical software reliability is infeasible using statistical methods whether applied to standard software or fault-tolerant software. The key assumption of software fault tolerance|separately programmed versions fail independently|is shown to be problematic. This assumption cannot be justiied by experimentation in the ultrareliability region and subj...

A recent line of work has explored the use of physically uncloneable functions (PUFs) for secure computation, with the goals of (1) achieving universal composability without additional setup, and/or (2) obtaining unconditional security (i.e., avoiding complexity-theoretic assumptions). Initial work assumed that all PUFs, even those created by an attacker, are honestly generated. Subsequently, r...

The context of this work is the reconstruction of Petri net models for biological systems from experimental data. Such methods aim at generating all network alternatives fitting the given data. For a successful reconstruction, the data need to satisfy two properties: reproducibility and monotonicity. In this paper, we focus on a necessary preprocessing step for a recent reconstruction approach....

We prove a new outer bound on the rate-distortion region for the multiterminal source-coding problem. This bound subsumes the best outer bound in the literature and improves upon it strictly in some cases. The improved bound enables us to obtain a new, conclusive result for the binary erasure version of the “CEO problem.” The bound recovers many of the converse results that have been establishe...

Systems of polynomial equations with coefficients over a field K can be used to concisely model combinatorial problems. In this way, a combinatorial problem is feasible (e.g., a graph is 3colorable, hamiltonian, etc.) if and only if a related system of polynomial equations has a solution over the algebraic closure of the field K. In this paper, we investigate an algorithm aimed at proving combi...

Constraint handling techniques are mainly designed for evolutionary algorithms to solve constrained multiobjective optimization problems (CMOPs). Most multiojective particle swarm optimization (MOPSO) designs adopt these existing constraint handling techniques to deal with CMOPs. In the proposed constrained MOPSO, information related to particles’ infeasibility and feasibility status is utilize...

Many software engineering applications utilize static program analyses to gain information about programs. Some applications perform static analysis over the whole program's call graph, while others are more interested in speci c call chains within a program's call graph. A particular static call chain for an object-oriented program may in fact be impossible to execute, or infeasible, such that...

The conventional data envelopment analysis (DEA) assumes that the inputs and outputs are real values. However, in many real world instances, some inputs and outputs must be in integer values. While integer-valued DEA models have been proposed, the current paper develops an integer-valued DEA super-efficiency model. Super-efficiency DEA models are known to have the problem of infeasibility. Rece...

A wide range of optimization problems arising from engineering applications can be formulated as Mixed Integer NonLinear Programmming problems (MINLPs). Duran and Grossmann (1986) suggest an outer approximation scheme for solving a class of MINLPs that are linear in the integer variables by a nite sequence of relaxed MILP master programs and NLP subproblems. Their idea is generalized by treatin...