We generalize some results of Borwein, Burke, Lewis, and Wang to mappings with values in metric (resp. ordered normed linear) spaces. We define two classes of monotone mappings between an ordered linear space and a metric space (resp. ordered linear space): K-monotone dominated and coneto-cone monotone mappings. K-monotone dominated mappings naturally generalize mappings with finite variation (...

The paper presents an economical model for double variable acceptance sampling with inspection errors. Taguchi cost function is used as acceptance cost while quality specification functions are normal with known variance. An optimization model is developed for double variables acceptance sampling scheme at the presence of inspection errors with either constant or monotone value functions. The m...

We introduce a flexible lifetime distribution called Burr III-Inverse Weibull (BIII-IW). The new proposed distribution has well-known sub-models. The BIII-IW density function includes exponential, left-skewed, right-skewed and symmetrical shapes. The BIII-IW model’s failure rate can be monotone and non-monotone depending on the parameter values. To show the importance of the BIII-IW distributio...

Monotone path polytopes arise as a special case of the construction of ber polytopes, introduced by Billera and Sturmfels. A simple example is provided by the permutahedron, which is a monotone path polytope of the standard unit cube. The permutahedron is the zonotope polar to the braid arrangement. We show how the zonotopes polar to the cones of certain deformations of the braid arrangement ca...

Distributed computation follows the models of discrete structures in combinatorial forms. In higher-dimensions, the simplex structures of topological spaces as well as homology are employed to model and analyze distributed asynchronous computations. However, the monotone spaces are the general forms of topological spaces and can be effectively employed to analyze distributed computation. This p...

This paper deals with the problem of selecting good negative binomial populations as compared with a standard or a control. The main results are based on the use of the empirical Bayes approach. First we derive the monotone empirical Bayes estimators of the concerned parameters. Based on these estimators, we construct monotone empirical Bayes selection rules. Asymptotic optimality properties of...

We prove exponential lower bounds for two classes of non-deterministic branching programs (nbps) with bounded repetition computing a class of functions representable by monotone 3-cnfs. The first class significantly generalizes monotone read-k-times nbps and the second class generalizes oblivious read k times branching programs. To the best of our knowledge, this is the first separation of mono...

The study of congestion games is central to the interplay between computer science and game theory. However, most work in this context does not deal with possible deviations by coalitions of players, a significant issue one may wish to consider. In order to deal with this issue we study the existence of strong and correlated strong equilibria in monotone congestion games. Our study of strong eq...

A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several papers and, recently, He and He [6] showed how to produce a monotone drawing of an arbitrary n-vertex tree that is contained in a 12n× 12n grid. In this paper, ...

n this paper , we propose a generalized iterative method forfinding a common element of the set of fixed points of a singlenonexpannsive mapping and the set of solutions of two variationalinequalities with inverse strongly monotone mappings and strictlypseudo-contractive of Browder-Petryshyn type mapping. Our resultsimprove and extend the results announced by many others.