The present paper considers the wire drawing process through a conical die and provides an approximate solution for force, assuming arbitrary hardening law. is based on upper bound theorem. However, this theorem does not apply to stationary flow of strain-hardening materials. Therefore, adopted engineering approach replace original material model with non-homogeneous, perfectly plastic model. k...

Edge projection is a specialization of Lovv asz and Plummer's clique projection when restricted to edges. We discuss some properties of the edge projection which are then exploited to develop a new upper bound procedure for the Maximum Cardinality Stable Set Problem (MSS Problem). The upper bound computed by our heuristic, incorporated in a branch-and-bound scheme in conjunction with Balas and ...

Let be a random sample from a normal distribution with unknown mean and known variance The usual estimator of the mean, i.e., sample mean is the maximum likelihood estimator which under squared error loss function is minimax and admissible estimator. In many practical situations, is known in advance to lie in an interval, say for some In this case, the maximum likelihood estimator...

is the expected value of the maximum of n independent copies of X i. We obtain an upper bound to the expected value of the maximum of X inequality is sharp in the sense that the quantity and its bound can be made as close to each other as we want. We also present related comparison results.

Abstract. Let G be a complete (undirected) graph with 3l vertices. Given a binary weight function on the edges of G, the binary maximum 2-path partitioning problem is to compute a set of of l vertex-disjoint simple 2-edge paths with maximum total edge weight. The problem is NP-hard [6]. In this paper we propose a simple local search algorithm with polynomial running time for the problem and ana...

In this paper, we consider maximum possible value for the sum of cardinalities hyperedges a hypergraph without Berge 4-cycle. We significantly improve previous upper bound provided by Gerbner and Palmer. Furthermore, provide construction that slightly improves lower bound.

In this paper, we establish a new bound tying together the effective length and the maximum correlation between the outputs of an arbitrary pair of Boolean functions which operate on two sequences of correlated random variables. We derive a new upper bound on the correlation between the outputs of these functions. The upper bound may find applications in problems in many areas which deal with c...

There is investigated generalized Tychonov well-posedness of the problem of minimization of error functionals over admissible sets formed by variable-basis functions, which include neural networks. For admissible sets formed by variable-basis functions of increasing complexity, rates of decrease of infima of error functionals are estimated. There are derived upper bounds on such rates that do n...

The classical perceptron rule provides a varying upper bound on the maximum margin, namely the length of the current weight vector divided by the total number of updates up to that time. Requiring that the perceptron updates its internal state whenever the normalized margin of a pattern is found not to exceed a certain fraction of this dynamic upper bound we construct a new approximate maximum ...

Two ways for bounding n-variables functions over a box, based on interval evaluations of first order derivatives, are compared. The optimal Baumann form gives the best lower bound using a center within the box. The “admissible simplex form”, proposed by the two last authors, uses point evaluations at n + 1 vertices of the box. We show that the Baumann center is within any “admissible simplex” a...