Changing attitudes, beliefs and feelings towards food in bulimic patients

Eating attitudes are defined as beliefs. thoughts, feelings and behaviors towards food. Bulimia nervosa (BN) is ail eating disorder, in which the eating, attitudes are Seriously disturbed. Studies that evaluated nutritional aspects of BN focus mainly oil food intake, dietary restriction and binge eating. while the follow-up Studies evaluate mainly clinical symptoms. The objective of this study was to evaluate eating attitudes of patients with BN. during and after cognitive-behavioral intervention. Thirty nine (39) BN female patients received cognitive behavioral treatment with a Multidisciplinary team and had eating attitudes assessed by a questionnaire developed for this research. Frequencies of the attitudes assessed were compared at baseline. after 12 weeks and 24 weeks of treatment. After treatment, patients had less distorted beliefs about food, less guilty after eating ""forbidden"" foods and they felt more tranquil while caring outside home. Other negative behaviors, as dietary restriction, the desire of not cat, being angry when feeling hungry and using the food to relive stress. persisted. Eating attitudes of patients with BN are hard to be changed in a short-term. More attention to this disease`s component and new approaches to treatment are needed in order to have a better recovery.

Thermoluminescence dating of Brazilian indigenous ceramics

Two indigenous ceramics fragments, one from Lagoa Queimada (LQ) and another from Barra dos Negros (BN), both sites located on Bahia state (Brazil), were dated by termoluminescence (TL) method. Each fragment was physically prepared and divided into two fractions, one was used for TL measurement and the other for annual dose determination. The TL fraction was chemically treated, divided in sub samples and irradiated with several doses. The plot extrapolation from TL intensities as function of radiation dose enabled the determination of the accumulated dose (D(ac)), 3.99 Gy and 1.88 Gy for LQ and BN, respectively. The annual dose was obtained through the uranium, thorium and potassium determination by ICP-MS. The annual doses (D(an)) obtained were 2.86 and 2.26 mGy/year. The estimated ages were similar to 1375 and 709 y for BN and LQ ceramics, respectively. The ages agreed with the archaeologists` estimation for the Aratu and Tupi tradition periods, respectively.

Sparse partition universal graphs for graphs of bounded degree

In 1983, Chvatal, Trotter and the two senior authors proved that for any Delta there exists a constant B such that, for any n, any 2-colouring of the edges of the complete graph K(N) with N >= Bn vertices yields a monochromatic copy of any graph H that has n vertices and maximum degree Delta. We prove that the complete graph may be replaced by a sparser graph G that has N vertices and O(N(2-1/Delta)log(1/Delta)N) edges, with N = [B`n] for some constant B` that depends only on Delta. Consequently, the so-called size-Ramsey number of any H with n vertices and maximum degree Delta is O(n(2-1/Delta)log(1/Delta)n) Our approach is based on random graphs; in fact, we show that the classical Erdos-Renyi random graph with the numerical parameters above satisfies a stronger partition property with high probability, namely, that any 2-colouring of its edges contains a monochromatic universal graph for the class of graphs on n vertices and maximum degree Delta. The main tool in our proof is the regularity method, adapted to a suitable sparse setting. The novel ingredient developed here is an embedding strategy that allows one to embed bounded degree graphs of linear order in certain pseudorandom graphs. Crucial to our proof is the fact that regularity is typically inherited at a scale that is much finer than the scale at which it is assumed. (C) 2011 Elsevier Inc. All rights reserved.

Asymmetric Ramsey Properties of Random Graphs Involving Cliques

Consider the following problem: Forgiven graphs G and F(1),..., F(k), find a coloring of the edges of G with k colors such that G does not contain F; in color i. Rodl and Rucinski studied this problem for the random graph G,,, in the symmetric case when k is fixed and F(1) = ... = F(k) = F. They proved that such a coloring exists asymptotically almost surely (a.a.s.) provided that p <= bn(-beta) for some constants b = b(F,k) and beta = beta(F). This result is essentially best possible because for p >= Bn(-beta), where B = B(F, k) is a large constant, such an edge-coloring does not exist. Kohayakawa and Kreuter conjectured a threshold function n(-beta(F1,..., Fk)) for arbitrary F(1), ..., F(k). In this article we address the case when F(1),..., F(k) are cliques of different sizes and propose an algorithm that a.a.s. finds a valid k-edge-coloring of G(n,p) with p <= bn(-beta) for some constant b = b(F(1),..., F(k)), where beta = beta(F(1),..., F(k)) as conjectured. With a few exceptions, this algorithm also works in the general symmetric case. We also show that there exists a constant B = B(F,,..., Fk) such that for p >= Bn(-beta) the random graph G(n,p) a.a.s. does not have a valid k-edge-coloring provided the so-called KLR-conjecture holds. (C) 2008 Wiley Periodicals, Inc. Random Struct. Alg., 34, 419-453, 2009