BACKGROUND Erectile dysfunction (ED) shares similar modifiable risks factors with coronary artery disease (CAD). Lifestyle modification that targets CAD risk factors may also lead to improvement in ED. We conducted a systematic review and meta-analysis of randomized controlled trials evaluating the effect of lifestyle interventions and pharmacotherapy for cardiovascular (CV) risk factors on the...

avila and molina [1] introduced the notion of generalized weak structures which naturally generalize minimal structures, generalized topologies and weak structures and the structures α(g),π(g),σ(g) and β(g). this work is a further investigation of generalized weak structures due to avila and molina. further we introduce the structures ro(g) and rc(g) and study the properties of the structur...

Abstract. This investigation studies nonemptiness problems of plane square tiling. In the edge coloring (or Wang tiles) of a plane, unit squares with colored edges of p colors are arranged side by side such that adjacent tiles have the same colors. Given a set of Wang tiles B, the nonemptiness problem is to determine whether or not Σ(B) = ∅, where Σ(B) is the set of all global patterns on Z2 th...

Bresar in 1993 proved that each biderivation on a noncommutative prime ring is a multiple of a commutatot. A result of it is a characterization of commuting additive mappings, because each commuting additive map give rise to a biderivation. Then in 1995, he investigated biderivations, generalized biderivations and sigma-biderivations on a prime ring and generalized the results of derivations fo...

A weighted partition of the positive integer n is a multiset of size n whose decomposition into a union of disjoint components (parts) satisfies the following condition: for a given sequence of non-negative numbers {bk}k≥1, a part of size k appears in exactly one of bk possible types. Assuming that a weighted partition of n is selected uniformly at random from the set of all such partitions, we...

Given a graph G, a proper k-coloring of G is a partition c = (Si)i∈[1,k] of V (G) into k stable sets S1, . . . , Sk. Given a weight function w : V (G) → R +, the weight of a color Si is defined as w(i) = maxv∈Si w(v) and the weight of a coloring c as w(c) = ∑k i=1w(i). Guan and Zhu [Inf. Process. Lett., 1997] defined the weighted chromatic number of a pair (G,w), denoted by σ(G,w), as the minim...