for an n-by-n complex matrix a in a block form with the (possibly) nonzero blocks only on the diagonal above the main one, we consider two other matrices whose nonzero entries are along the diagonal above the main one and consist of the norms or minimum moduli of the diagonal blocks of a. in this paper, we obtain two inequalities relating the numeical radii of these matrices and also determine ...

in this paper, a new class of multifunctions, called generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions, has been de ned and studied. some characterizations and severalproperties concerning generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions are obtained. the re-lationships between generalized alpha (mu_{x};mu_{ y} )-continuous multifunctions and some known con-ce...

An upper bound is given on the cutoff rate of discrete memoryless channels. This upper bound, which coincides with a known lower bound, determines the cutoff rate, and settles a long-standing open problem.

We investigate two methods for proving lower bounds on the size of small-depth circuits, namely the approaches based on multiparty communication games and algebraic characterizations extending the concepts of the tensor rank and rigidity of matrices. Our methods are combinatorial, but we think that our main contribution concerns the algebraic concepts used in this area (tensor ranks and rigidit...

calculation of lateral earth pressure on retaining walls is one of the main issues in geotechnics. the upper and lower bound theorems of plasticity are used to analyze the stability of geotechnical structures include bearing capacity of foundations, lateral earth pressure on retaining walls and factor of safety of slopes. in this paper formulation of finite element limit analysis is introduced ...

A recent breadth-first branch and bound algorithm (BFBnB) for learning Bayesian network structures (Malone et al. 2011) uses two bounds to prune the search space for better efficiency; one is a lower bound calculated from pattern database heuristics, and the other is an upper bound obtained by a hill climbing search. Whenever the lower bound of a search path exceeds the upper bound, the path is...

In this paper we consider the problem of determining lower and upper bounds on probabilities of atomic propositions in sets of logical formulas represented by digraphs We establish a sharp upper bound as well as a lower bound that is not in general sharp We show further that under a certain condition the lower bound is sharp In that case we obtain a closed form solution for the possible probabi...

We derive a lower bound for the sample complexity of the Sample Average Approximation method for a certain class of multistage stochastic optimization problems. In previous works, upper bounds for such problems were derived. We show that the dependence of the lower bound with respect to the complexity parameters and the problem's data are comparable to the upper bound's estimates. Like previous...