It is well known that the eating patterns that restrain chronic dieters (restrained eaters) can be disinhibited by anxiety, which in turn has been associated with relative right frontal brain activity in independent electroencephalographic (EEG) studies. Combining these two lines of evidence, the authors tested the hypothesis that chronic restrained eating is associated with relative right fron...

The purpose of the current study was to examine the eating behavior, self-esteem, and social anxiety of restrained and non-restrained eaters exposed to an interpersonal stressor. Sixty female undergraduate students completed questionnaires and took part in a stressor and taste test. Results indicated that self-esteem was not predictive of eating behavior during the taste test, but was predictiv...

This study investigated the effects of food deprivation on the body image in female restrained and unrestrained eaters. Twenty female restrained eaters and 20 female unrestrained eaters were asked to identify their current and their ideal body shape by choosing them from a sample of nine female silhouettes. This test was conducted under three deprivational conditions: hungry, thirsty and non-de...

Restrained eaters have been shown to disinhibit their eating when under stressful situations. However, the majority of laboratory studies that have demonstrated this effect utilized a single test food, typically ice cream. There is a lack of research investigating if this interaction is still evident when multiple foods are offered, and if so, the food choices that restrained and non-restrained...

A graph with no isolated vertices is edge critical with respect to total restrained domination if for any non-edge e of G, the total restrained domination number of G+ e is less than the total restrained domination number of G. We call these graphs γtr-edge critical. In this paper, we characterize all γtr-edge critical unicyclic graphs.

Interaction potentials used in particle simulations are typically written as a sum of terms which depend on just a few relative particle positions. Traditional simulation methods move all particles at each time step, and may thus spend a lot of time updating interparticle forces. In this Letter we introduce adaptively restrained particle simulations (ARPS) to speed up particle simulations by ad...

Let G = (V,E) be a graph. A set S ⊆ V is a restrained dominating set if every vertex not in S is adjacent to a vertex in S and to a vertex in V − S. The restrained domination number of G, denoted by γr(G), is the smallest cardinality of a restrained dominating set of G. We define the restrained bondage number br(G) of a nonempty graph G to be the minimum cardinality among all sets of edges E′ ⊆...

Given positive integers n, k, and m, the (n, k)-th mrestrained Stirling number of the first kind is the number of permutations of an n-set with k disjoint cycles of length ≤ m. Inverting the matrix consisting of the (n, k)-th m-restrained Stirling number of the first kind as the (n+1, k +1)-th entry, the (n, k)-th m-restrained Stirling number of the second kind is defined. In this paper, the mu...