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...

Let Ω be a set with n elements. A transformation monoid on Ω is a set of maps from Ω to itself which is closed under composition and contains the identity. A transformation monoid M is synchronizing if it contains a map with rank 1 (that is, whose image has only one element). The notion comes from automata theory. A (finite deterministic) automaton consists of a set Ω of states and a set S of t...

Replication is a key technique in the design of efficient and reliable distributed systems. As information grows, it becomes difficult or even impossible to store all information at every replica. A common approach to deal with this problem is to rely on partial replication, where each replica maintains only a part of the total system information. As a consequence, a remote replica might need t...

We consider the problem of NON-UNIFORM GRAPH PARTITIONING, where the input is an edge-weighted undirected graph G = (V,E) and k capacities n1, . . . , nk, and the goal is to find a partition {S1, S2, . . . , Sk} of V satisfying |Sj | ≤ nj for all 1 ≤ j ≤ k, that minimizes the total weight of edges crossing between different parts. This natural graph partitioning problem arises in practical scen...

Dynamic instruction scheduling logic is one of the most critical and cycle-limiting structures in modern superscalar processors, and it is not easily pipelined without significant losses in performance. However, these performance losses are incurred only due to a small fraction of instructions, which are intolerant to the non-atomic scheduling. We first perform an empirical analysis of the inst...

As devices become more susceptible to transient faults that can affect program correctness, processor designers will increasingly compensate by adding hardware or software redundancy. Proposed redundancy techniques and those currently in use are generally applied uniformly to a structure despite non-uniformity in the way errors within the structure manifest themselves in programs. This uniform ...