The homogenization method for topology optimization in stru tural design is by now well established (see [2℄, [3℄, [7℄, [8℄, [15℄, [16℄, [17℄, [18℄ and referen es therein). However, the theory is restri ted to omplian e or eigenfrequen y optimization (in the single or multiple loadings ase). The problem is that optimal mi rostru tures are unknown for general obje tive fun tions. Of ourse, in nu...

• In the present work we propose a study of the proportional mean residual life model using quantile functions instead of distribution functions employed in the traditional approach. Through various quantile-based reliability concepts ageing properties of the model are discussed. We present characterizations of the proportional mean residual life model by properties of measures of uncertainty i...

Recently, a general class of the Hermit--Hadamard-Fejer inequality on convex functions is studied in [H. Budak, March 2019, 74:29, textit{Results in Mathematics}]. In this paper, we establish a generalization of Hermit--Hadamard--Fejer inequality for fractional integral based on co-ordinated convex functions.Our results generalize and improve several inequalities obtained in earlier studies.

1 Introduction The size of an OBDD [1] largely depends on the variable ordering. It is important to clarify the lower bounds of OBDDs representing arithmetic functions. In this report, we investigate a lower bound of the size of OBDDs representing integer division. More precisely, we focus on each bit of the output of the n-bit / n-bit division, and prove that the size of OBDDs representing the...

In this paper, we obtain Jensen’s inequality for GG-convex functions. Also, we get in- equalities alike to Hermite-Hadamard inequality for GG-convex functions. Some examples are given.

In this paper we introduce the concept of topological number for locally convex topological spaces and prove some of its properties. It gives some criterions to study locally convex topological spaces in a discrete approach.

In order to make airplane main procedures more efficient and thus s and costs, the distribution of airplane em software will increasingly be p electronically over networks. Sinc software often implements vital func while on the other hand comm networks are in

Paul [ PJ first proved a 2.Sn-Iower bound for the network complex ity of an explicit boole an function. We mo dify the defi n ition of Pa ul's func tion a little a nd prove a 3n-I ower bound for th e network complexity of that function.-1

increasingly more of the func-tionality in today's telecommunication systems implemented in software, one of the most challenging tasks for PNOs is to assess the quality of the software in these systems and the capabilities of potential suppliers. In this article we describe the use of goal-oriented measurement and assessment as the basis for systematic quality improvements in software developm...

We consider operators of convolution generated by L func tions in L and various spaces of almost periodic functions It turns out to be that if such an operator is invertible in one of these spaces then it is in vertible in all the spaces we consider Further we prove that any convolution has identical norms in many natural couples of functional spaces