Motivated by applications in rigid body contact simulation we develop a numerically robust, randomized Quadratic Programming algorithm. We show that the resulting solver remains robust under highly constrained and redundant conditions, while also detecting infeasibility conditions. Its expected complexity is linear in the number constraints imposed and our experiments show that it performs well...

Abstract The ‘limits of markets’ debate broadly concerns the question when it is (im)permissible to have a market in some good. Markets can be tremendous benefit society, but many felt that certain goods should not for sale (e.g., sex, kidneys, bombs). Their argued corrupting, exploitative, or express form disrespect. In without Limits , Jason Brennan and Peter Jaworski recently contrary: For a...

Abstract Tenfold improvements in computation speed can be brought to the alternating direction method of multipliers (ADMM) for Semidefinite Programming with virtually no decrease robustness and provable convergence simply by projecting approximately cone. Instead computing projections via “exact” eigendecompositions that scale cubically matrix size cannot warm-started, we suggest using state-o...

In this paper we study the sources of dynamic energy during the execution of software on microprocessors suited for the Internet of Things (IoT) domain. Estimating the energy consumed by executing software is typically achieved by determining the most costly path through the program according to some energy model of the processor. Few models, however, adequately tackle the matter of dynamic ene...

Fully homomorphic encryption (FHE) is a form of publickey encryption that enables arbitrary computation over encrypted data. The past few years have seen several realizations of FHE under different assumptions, and FHE has been used as a building block in many cryptographic applications. Adaptive security for public-key encryption schemes is an important security notion proposed by Canetti et a...

In many applications, ranking of decision making units (DMUs) is a problematic technical task procedure to decision makers in data envelopment analysis (DEA), especially when there are extremely efficient DMUs. In such cases, many DEA models may usually get the same efficiency score for different DMUs. Hence, there is a growing interest in ranking techniques yet. The main purpose of this paper ...

In this paper we analyze a variety of standard techniques used in corpus linguistics and examine a number of issues relating to incorrect usage, the computational infeasibility of various approaches, and the inevitable sampling errors. We motivate much of the paper with applications from information retrieval but the techniques discussed and introduced are far more widely applicable, and some a...

T paper develops a method for moving quickly and cheaply from an arbitrary initial point at an extreme distance from the feasible region to a point that is relatively near the feasible region of a nonlinearly constrained model. The method is a variant of a projection algorithm that is shown to be robust, even in the presence of nonconvex constraints and infeasibility. Empirical results are pres...