We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (\read-k" monotone CNF). Let f : f0;1g n ! f0;1g be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomial time algorithm for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f. The alg...

We consider the problem of scheduling n jobs to m machines of different speeds s.t. the makespan is minimized (Q||Cmax). We provide a fast and simple, deterministic monotone 3-approximation algorithm for Q||Cmax. Monotonicity is relevant in the context of truthful mechanisms: when each machine speed is only known to the machine itself, we need to motivate that machines declare their true speeds...

We consider exact learning monotone CNF formulas in which each variable appears at most some constant k times (\read-k" monotone CNF). Let f : f0;1g n ! f0;1g be expressible as a read-k monotone CNF formula for some natural number k. We give an incremental output polynomial time algorithm for exact learning both the read-k CNF and (not necessarily read restricted) DNF descriptions of f. The alg...

In this paper, we consider the monotone inclusion problem consisting of the sum of a continuous monotone map and a point-to-set maximal monotone operator with a separable two-block structure and introduce a framework of block-decomposition prox-type algorithms for solving it which allows for each one of the single-block proximal subproblems to be solved in an approximate sense. Moreover, by sho...

A general notion of completely monotone functionals on an ordered Banach algebra B into a proper H*-algebra A with an integral representation for such functionals is given. As an application of this result we have obtained a characterization for the generalized completely continuous monotone functions on weighted foundation semigroups. A generalized version of Bochner’s theorem on foundation se...

We consider asynchronous, parallel iterations for calculating enclosures of solutions of systems of nonlinear equations in IR n. Particularly, we will show how two classical theorems on the monotone convergence of some iterative methods for certain classes of nonlinear equations carry over to the asynchronous case.

In this paper, we study a modified residual-based a posteriori error estimator for the nonconforming linear finite element approximation to the interface problem. The reliability of the estimator is analyzed by a new and direct approach without using the Helmholtz decomposition. It is proved that the estimator is reliable with constant independent of the jump of diffusion coefficients across th...

We consider the global existence of strong solution u, corresponding to a class of fully nonlinear wave equations with strongly damped terms utt −kΔut f x,Δu g x, u,Du,D2u in a bounded and smooth domain Ω in R, where f x,Δu is a given monotone in Δu nonlinearity satisfying some dissipativity and growth restrictions and g x, u,Du,D2u is in a sense subordinated to f x,Δu . By using spatial sequen...

In this paper, we consider the existence of extreme solutions of the boundary value problem for a fractional order differential equation Dδu = f(t, u), t ∈ [0, T ], 0 < δ < 1, 0 < T < ∞, with a nonlinear boundary conditions g(u(0)) = u(T ). Under a lower solution α and un upper solution β with β ≤ α, we establish existence results of extreme solutions by means of the method of upper and lower s...

A monotone system of min-max-polynomial equations (min-maxMSPE) over the variables X1, . . . , Xn has for every i exactly one equation of the form Xi = fi(X1, . . . , Xn) where each fi(X1, . . . , Xn) is an expression built up from polynomials with non-negative coefficients, minimumand maximum-operators. The question of computing least solutions of min-maxMSPEs arises naturally in the analysis ...