Hypnosis as an adjunct to cognitive-behavioral psychotherapy: A meta-analysis.

A meta-analysis was performed on 18 studies in which a cognitive–behavioral therapy was compared with the same therapy supplemented by hypnosis. The results indicated that the addition of hypnosis substantially enhanced treatment outcome, so that the average client receiving cognitive–behavioral hypnotherapy showed greater improvement than at least 70% of clients receiving nonhypnotic treatment. Effects seemed particularly pronounced for treatments of obesity, especially at long-term follow-up, indicating that unlike those in nonhypnotic treatment, clients to whom hypnotic inductions had been administered continued to lose weight after treatment ended. These results were particularly striking because of the few procedural differences between the hypnotic and nonhypnotic treatments. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Detection and quantitation of aflatoxin B1 in orange juice by SOS-Chromotest

A new method for the detection and quantitation of aflatoxin B1 in liquids is described. The method is based on the SOS Chromotest, in which damage caused by aflatoxin B1 to the DNA of suitably engineered E. coli induces beta-galactosidase. Aflatoxin B1 developing in orange juice inoculated with spores of Aspergillus parasiticus is detectable equally well by TLC as by the SOS-Chromotest.     

Hormonal changes during a 20-week confinement

BACKGROUND: When the European Space Agency planned the EUROMIR'95 long-duration flight with a European astronaut on board the Russian orbital MIR station, it organized simultaneously a ground simulation, called the Human Behaviour Study, of this manned space mission. The ground simulation was a confinement experiment, and this paper describes the changes in volume-regulating hormones that occurred during and after 20 weeks of confinement. METHODS: In a normobaric diving chamber, 3 subjects were confined for 135 d. Arterial pressure, plasma concentrations of blood volume-regulating hormones (active renin and arginine-vasopressin), and urinary variables (aldosterone, arginine-vasopressin, and metabolites of catecholamines) were measured before, during, and after confinement. RESULTS: Arterial pressure was increased from week 1 until week 15 of confinement, while heart rate was elevated from week 6 until the end of the simulation. Plasma active renin was elevated throughout the confinement (after week 6). Urine volume increased transitively on the first 2 d of confinement. CONCLUSIONS: The results obtained during this long-term confinement experiment have major importance regarding concerns about spaceflight and bed rest data, because we observed hormonal changes during the experiment that normally are assigned to the fluid shift that occurs in weightlessness or in the head-down tilt position (i.e., an increase of renin, an increase of urinary volume during the first two days, and a decreased urinary cyclic guanosine monophosphate.     

Base-compositional biases and the bat problem. II. DNA-hybridization trees based on AT- and GC-enriched tracers

We conducted a series of parallel DNA-hybridization experiments on a small group of bats (species of Pteropus, Rhinolophus, Noctilio and Pteronotus) and outgroups (Lemur, Cynocephalus, Didelphis), using whole-genome labels and tracers made from extracts enriched with AT and two levels of GC content. FITCH (additive phylogenetic trees) topologies were constructed from the four sets of comparisons, indexed as both delta Tmode and delta NPHs (normalized percentage of hybridization). Based on our previous work showing that the shared AT bias of pteropodids and some microchiropterans may affect the rank-ordering of taxa based on either AT- or GC-rich labels, our expectation was that the resulting trees would show differing topologies when generated from tracers made with the variously enriched DNA extracts. Whereas there was some variation among the trees, most of them grouped the bats together, and almost all paired the representative megachiropteran and rhinolophoid microchiropteran as sister-taxa in contrast to the other microchiropterans. As the pteropodid-rhinolophoid relationship is an unexpected and unlikely one, we attribute this association to an AT bias that was not obviated even by our most GC-rich labels, and suggest that such a bias may compromise the truth of some molecular trees. Accordingly, we believe the broader issue of bat monophyly remains unresolved by DNA-hybridization and probably also by gene-sequencing studies.     

Computability of Countable Subshifts in One Dimension

We investigate the computability of countable subshifts in one dimension, and their members. Subshifts of Cantor?CBendixson rank two contain only eventually periodic elements. Any rank two subshift in 2^? is decidable. Subshifts of rank three may contain members of arbitrary Turing degree. In contrast, effectively closed ( $\Pi^{0}_{1}$ ) subshifts of rank three contain only computable elements, but $\Pi^{0}_{1}$ subshifts of rank four may contain members of arbitrary $\Delta^{0}_{2}$ degree. There is no subshift of rank ??+1.     

Preparation of grids for simulations of groundwater flow in fractured porous media

This work presents an extension of grid generation techniques for finite-volume discretizations of density-driven flow in fractured porous media, in which fractures are considered as low-dimensional manifolds and are resolved by sides of grid elements. The proposed technique introduces additional degrees of freedom for the unknowns assigned to the fractures and thus allows to reconstruct jumps of the solution over a fracture. Through the concept of degenerated elements, the proposed technique can be used for arbitrary junctions of fractures but is sufficiently simple regarding the implementation and allows for the application of conventional numerical solvers. Numerical experiments presented at the end of the paper demonstrate the applicability of this technique in two and three dimensions for complicated fracture networks.     

X-ray Fluorescence Uptake Measurement of Functionalized Gold Nanoparticles in Tumor Cell Microsamples

Quantitative cellular in vitro nanoparticle uptake measurements are possible with a large number of different techniques, however, all have their respective restrictions. Here, we demonstrate the application of synchrotron-based X-ray fluorescence imaging (XFI) on prostate tumor cells, which have internalized differently functionalized gold nanoparticles. Total nanoparticle uptake on the order of a few hundred picograms could be conveniently observed with microsamples consisting of only a few hundreds of cells. A comparison with mass spectroscopy quantification is provided, experimental results are both supported and sensitivity limits of this XFI approach extrapolated by Monte-Carlo simulations, yielding a minimum detectable nanoparticle mass of just 5 pg. This study demonstrates the high sensitivity level of XFI, allowing non-destructive uptake measurements with very small microsamples within just seconds of irradiation time.     

Polynomial-Time Algorithms for Energy Games with Special Weight Structures

Energy games belong to a class of turn-based two-player infinite-duration games played on a weighted directed graph. It is one of the rare and intriguing combinatorial problems that lie in NP∩co-NP, but are not known to be in P. The existence of polynomial-time algorithms has been a major open problem for decades and apart from pseudopolynomial algorithms there is no algorithm that solves any non-trivial subclass in polynomial time. In this paper, we give several results based on the weight structures of the graph. First, we identify a notion of penalty and present a polynomial-time algorithm when the penalty is large. Our algorithm is the first polynomial-time algorithm on a large class of weighted graphs. It includes several worst-case instances on which previous algorithms, such as value iteration and random facet algorithms, require at least sub-exponential time. Our main technique is developing the first non-trivial approximation algorithm and showing how to convert it to an exact algorithm. Moreover, we show that in a practical case in verification where weights are clustered around a constant number of values, the energy game problem can be solved in polynomial time. We also show that the problem is still as hard as in general when the clique-width is bounded or the graph is strongly ergodic, suggesting that restricting the graph structure does not necessarily help.