نتایج جستجو برای: 1 gravitys rainbow 2 paranoia 3 anti
تعداد نتایج: 4739061 فیلتر نتایج به سال:
BACKGROUND This study reports the development and revision of the Beliefs about Paranoia Scale (BaPS), a self-report measure to assess metacognitive beliefs about paranoia in non-patients. We aimed to confirm the factor structure of a revised 50-item version of the measure and test the specific hypotheses that positive beliefs about paranoia would predict frequency of paranoia, and that negativ...
A path in an edge colored graph is said to be a rainbow path if no two edges on the path have the same color. An edge colored graph is (strongly) rainbow connected if there exists a (geodesic) rainbow path between every pair of vertices. The (strong) rainbow connectivity of a graph G, denoted by (src(G), respectively) rc(G) is the smallest number of colors required to edge color the graph such ...
Assume we have a set of k colors and we assign an arbitrary subset of these colors to each vertex of a graph G. If we require that each vertex to which an empty set is assigned has in its neighborhood all k colors, then this assignment is called a k-rainbow dominating function of G. The corresponding invariant γrk(G), which is the minimum sum of numbers of assigned colors over all vertices of G...
We show that any properly edge-colored Kn contains a rainbow cycle with at least (4/7− o(1))n edges. This improves the lower bound of n/2− 1 proved in [1]. We consider properly edge-colored complete graphs Kn, where two edges with the same color cannot be incident to each other, so each color class is a matching. An important and well investigated special case of proper edge-colorings is a fact...
Emotion regulation (ER) has become a relevant construct to understanding paranoia. While the ER strategy called expressive suppression (e.g., poker face) may foster state paranoia by increasing arousal, another strategy called reappraisal (e.g., changing the perspective on situations) may reduce negative emotions and state paranoia when adaptively used. However, if reappraisal fails, this could...
A few analogues of atevirdine or 1-[(5-methoxyindol-2-yl) carbonyl]-4-[3- (ethylamino)-2-pyridyl] piperazine – an anti-HIV belonging to non-nucleoside reverse transcriptase inhibitors were synthesized and evaluated for anti-HIV activity. Replacement of indolyl moiety with 2-alkylthio-1-benzyl-5-imidazolyl substituent afforded 1-[2-(alkylthio-1-benzyl-5-imidazolyl) carbonyl]-4-[3-(isopropylamino...
1 Dept. of Mathematical Sciences, University of Cincinnati, USA, [email protected] 2 IIS, Academia Sinica, Taiwan, [byyang,owenhsin,mschen]@iis.sinica.edu.tw 3 Dept. of Elec. Eng., Nat'l Taiwan University, Taiwan, [email protected] Abstract. A recently proposed class of multivariate Public-Key Cryptosystems, the Rainbow-Like Digital Signature Schemes, in which successive sets of central va...
background: there are different activating salt solutions for sperm induction of rainbow trout (oncorhynchus mykiss) under artificial spawning condition, although some uncertainties are associated with the performance. objectives: this study was conducted to consider the effects of different concentration of calcium and magnesium ions and change of ph in the billard salt solution on sperm motil...
Let G be a nontrivial connected graph with an edge-coloring c : E(G) → {1, 2, . . . , q}, q ∈ N, where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. For a vertex subset S ⊆ V (G), a tree that connects S in G is called an S-tree. The minimum number of colors that are needed in an edge-coloring of G such that there is a rainbo...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید