A new method for structural topology optimization is introduced which employs the Isogeometric Analysis (IA) method. In this approach, an implicit function is constructed over the whole domain by Non-Uniform Rational B-Spline (NURBS) basis functions which are also used for creating the geometry and the surface of solution of the elasticity problem. Inspiration of the level set method zero level...

In many applications such as wireless communications and subband adaptive filtering, we need to design non-uniform filter banks (NUFB), which may lead to better performances and reduced hardware complexity when compared to uniform filter bank. NUFB satisfying linear phase property for all the constituent filters, are desirable in applications such as speech and image processing and in communica...

The available shear correction factors have mainly been developed for homogeneous isotropic plates and/or assuming that no shear tractions are imposed on the top and bottom surfaces of the plate. In the present research, a more general case of a circular functionally graded plate subjected to non-uniform normal and shear tractions at the top and bottom surfaces is considered. These non-uniform ...

in most of the multi–criteria decision–analysis (mcda) problems in which the choquet integral is used as aggregation function, the coefficients of choquet integral (capacity) are not known in advance. actually, they could be calculated by capacity definition methods. in these methods, the preference information of decision maker (dm) is used to constitute a possible solution space. the methods ...

A study of female-male differences in F F2: and F3 of var ious vowels within eight different languages revea ls univer sa l tendencies of departure f rom a simple uniform scaling. These have been quantified and adopted a s a basis for a vowel-category-specific normalization procedure which, on the average, reduces the female-male variance to one-half of that remaining after a simple uniform sca...

A subset of the vertices in a hypergraph is a cover if it intersects every edge. Let τ(H) denote the cardinality of a minimum cover in the hypergraph H , and let us denote by g(n) the maximum of τ(H) taken over all hypergraphs H with n vertices and with no two hyperedges of the same size. We show that g(n) < 1.98 √ n(1 + o(1)). A special case corresponds to an old problem of Erdős asking the ma...