Many real-world planning problems are oversubscription problems where all goals are not simultaneously achievable and the planner needs to find a feasible subset. We present complexity results for the so-called partial satisfaction and net benefit problems under various restrictions; this extends previous work by van den Briel et al. Our results reveal strong connections between these problems ...

Solving the BKP equation and comparing with the structure function of hadron for deep inelastic scattering processes we are able to find a relation between reggeizedN−gluon states and anomalous dimensions of QCD. To this end we perform analytical continuation of the Reggeon energy and compare exponents of two different twist-series expansions for the hadron structure function. This makes possib...

The present paper is devoted to the study of a zero-Mach number system with heat conduction but no viscosity. We work in the framework of general non-homogeneous Besov spaces B p,r(R), with p ∈ [2, 4] and for any d ≥ 2, which can be embedded into the class of globally Lipschitz functions. We prove a local in time well-posedness result in these classes for general initial densities and velocity ...

Implicit extrapolation is an eecient and unconditionally stable method of wave-eld continuation. Unfortunately, implicit wave extrapolation in three dimensions requires an expensive solution of a large system of linear equations. However, by mapping the computational domain into one dimension via the helix transform, we show that the matrix inversion problem can be recast in terms of an eecient...

Implicit extrapolation is an efficient and unconditionally stable method of wavefield continuation. Unfortunately, implicit wave extrapolation in three dimensions requires an expensive solution of a large system of linear equations. However, by mapping the computational domain into one dimension via the helix transform, we show that the matrix inversion problem can be recast in terms of an effi...

The direct geometrico-static problem of cable-driven parallel robots with 5 cables is presented. The study provides procedures for the identification of all equilibrium poses of the end-effector when cable lengths are assigned. A leastdegree univariate polynomial in the ideal governing the problem is obtained, thus showing that the latter has 140 solutions in the complex field. By a continuatio...

How many operations do we need on the average to compute an approximate root of a random Gaussian polynomial system? Beyond Smale’s 17th problem that asked whether a polynomial bound is possible, we prove a quasi-optimal bound (input size)1`op1q. This improves upon the previously known (input size) 3 2 `op1q bound. The new algorithm relies on numerical continuation along rigid continuation path...

This paper contains a computational approximation for the solution of a forward-backward differential equation that models nerve conduction in a myelinated axon. We look for a solution of an equation defined in R, which tends to known values at ±∞. Extending the approach introduced in [5, 10, 6] for linear case, a numerical method for the solution of problem, is adapted to non linear case using...