Long-chain n-3 PUFA from fish and exercise capacity are associated with CVD risk. Fish, especially large and old predatory fish, may contain Hg, which may attenuate the inverse association of long-chain n-3 PUFA with CVD. However, the associations of long-chain n-3 PUFA or Hg exposure with exercise capacity are not well known. We aimed to evaluate the associations of serum long-chain n-3 PUFA E...

We first consider three well-known chain conditions in the space of marked groups: the minimal condition on centralizers, the maximal condition on subgroups, and the maximal condition on normal subgroups. For each condition, we produce a characterization in terms of well-founded descriptiveset-theoretic trees. Using these characterizations, we demonstrate that the sets given by these conditions...

Fix integers n and k with n ≥ k ≥ 3. Duffus and Sands proved that if P is a finite poset and n ≤ |C| ≤ n+ (n− k)/(k− 2) for every maximal chain in P , then P must contain k pairwise disjoint maximal antichains. They also constructed a family of examples to show that these inequalities are tight. These examples are 2-dimensional which suggests that the dual statement may also hold. In this paper...

B. Bájnok and S. Shahriari proved that in 2, the Boolean lattice of order n, the width (the maximum size of an antichain) of a non-trivial cutset (a collection of subsets that meets every maximal chain and does not contain ∅ or [n]) is at least n− 1. We prove that, for n ≥ 5, in the Boolean lattice of order n, given ⌈n2 ⌉− 1 disjoint long chains, we can enlarge the collection to a cutset of wid...

To investigate the role of circ_0084927 in lung cancer cell sensitivity to cisplatin. Half-maximal inhibitory concentration value cisplatin was detected by counting kit-8. and microRNA-634 expression were determined reverse transcription quantitative polymerase chain reaction. Cell kit-8, scratch healing, colony formation as well Transwell experiments used for analyzing viability, healing rate,...

We introduce and study the Max-Chain-Formation problem, where n robots are ordered along a winding chain must form connected, straight line of maximal length connecting its two endpoints. propose analyze strategies in discrete continuous time model. In case, we give complete analysis if positions all initially collinear, showing that worst-case to reach an ε-approximation is upper bounded by O(...

We analyze on-line chain partitioning problem and its variants as a two-person game. One person (Spoiler) builds an on-line poset presenting one point at time. The other one (Algorithm) assigns new point to a chain. Kierstead gave a strategy for Algorithm showing that width w posets can be on-line chain partitioned into 5 −1 4 chains. Felsner proved that if Spoiler presents an upgrowing poset, ...

Given a chain of viscoelastic spheres with fixed masses of the first and last particles. We raise the question: How to chose the masses of the other particles of the chain to assure maximal energy transfer? The results are compared with a chain of particles for which a constant coefficient of restitution is assumed. Our simple example shows that the assumption of viscoelastic particle propertie...

A 2-rainbow dominating function ( ) of a graph  is a function  from the vertex set  to the set of all subsets of the set  such that for any vertex  with  the condition  is fulfilled, where  is the open neighborhood of . A maximal 2-rainbow dominating function on a graph  is a 2-rainbow dominating function  such that the set is not a dominating set of . The weight of a maximal    is the value . ...

In this paper, first we study the semi maximal filters in linear $BL$-algebras and we prove that any semi maximal filter is a primary filter. Then, we investigate the radical of semi maximal filters in $BL$-algebras. Moreover, we determine the relationship between this filters and other types of filters in $BL$-algebras and G"{o} del algebra. Specially, we prove that in a G"{o}del algebra, any ...