Evolution of hairpin vortices in a shear flow

Recent experimental studies suggest that the hairpin vortex plays an important (and perhaps dominant) role in the dynamics of turbulent flows near walls. In this study a numerical procedure is developed to allow the accurate computation of the trajectory of a 3-D vortex having a small core radius. For hairpin vortices which are convected in a shear flow above a wall, the calculated results show that a 2-D vortex containing a small 3-D disturbance distorts into a complex shape with subsidiary hairpin vortices forming outboard of the original hairpin vortex. As the vortex moves above the wall, it induces unsteady motion in the viscous flow near the wall: numerical solutions suggest that the boundary-layer flow near the wall will ultimately erupt in response to the motion of the hairpin vortex and in the process a secondary hairpin vortex will be created. The computer results agree with recent experimental investigations

The Particulate Methane Monooxygenase from Methylococcus capsulatus (Bath) Is a Novel Copper-containing Three-subunit Enzyme: isolation and charactization

The particulate methane monooxygenase (pMMO) is known to be very difficult to study mainly due to its unusual activity instability in vitro. By cultivating Methylococcus capsulatus (Bath) under methane stress conditions and high copper levels in the growth medium, membranes highly enriched in the pMMO with exceptionally stable activity can be isolated from these cells. Purified and active pMMO can be subsequently obtained from these membrane preparations using protocols in which an excess of reductants and anaerobic conditions were maintained during membrane solubilization by dodecyl beta-D-maltoside and purification by chromatography. The pMMO was found to be the major constituent in these membranes, constituting 60-80% of total membrane proteins. The dominant species of the pMMO was found to consist of three subunits, alpha, beta, and gamma, with an apparent molecular mass of 45, 26, and 23 kDa, respectively. A second species of the pMMO, a proteolytically processed version of the enzyme, was found to be composed of three subunits, alpha', beta, and gamma, with an apparent molecular mass of 35, 26, and 23 kDa, respectively. The alpha and alpha' subunits from these two forms of the pMMO contain identical N-terminal sequences. The gamma subunit, however, exhibits variation in its N-terminal sequence. The pMMO is a copper-containing protein only and shows a requirement for Cu(I) ions. Approximately 12-15 Cu ions per 94-kDa monomeric unit were observed. The pMMO is sensitive to dioxygen tension. On the basis of dioxygen sensitivity, three kinetically distinct forms of the enzyme can be distinguished. A slow but air-stable form, which is converted into a "pulsed" state upon direct exposure to atmospheric oxygen pressure, is considered as type I pMMO. This form was the subject of our pMMO isolation effort. Other forms (types II and III) are deactivated to various extents upon exposure to atmospheric dioxygen pressure. Under inactivating conditions, these unstable forms release protons to the buffer (~10 H+/94-kDa monomeric unit) and eventually become completely inactive

The effects of cognitive reappraisal following retrieval-procedures designed to destabilize alcohol memories in high-risk drinkers

RATIONALE: Addiction is a disorder of motivational learning and memory. Maladaptive motivational memories linking drug-associated stimuli to drug seeking are formed over hundreds of reinforcement trials and accompanied by aberrant neuroadaptation in the mesocorticolimbic reward system. Such memories are resistant to extinction. However, the discovery of retrieval-dependent memory plasticity has opened up the possibility of permanent modification of established (long-term) memories during 'reconsolidation'. OBJECTIVES: Here, we investigate whether reappraisal of maladaptive alcohol cognitions performed after procedures designed to destabilize alcohol memory networks affected subsequent alcohol memory, craving, drinking and attentional bias. METHODS: Forty-seven at-risk drinkers attended two sessions. On the first lab session, participants underwent one of two prediction error-generating procedures in which outcome expectancies were violated while retrieving alcohol memories (omission and value prediction error groups). Participants in a control group retrieved non-alcohol memories. Participants then reappraised personally relevant maladaptive alcohol memories and completed measures of reappraisal recall, alcohol verbal fluency and craving. Seven days later, they repeated these measures along with attentional bias assessment. RESULTS: Omission prediction error (being unexpectedly prevented from drinking beer), but not a value prediction error (drinking unexpectedly bitter-tasting beer) or control procedure (drinking unexpectedly bitter orange juice), was associated with significant reductions in verbal fluency for positive alcohol-related words. No other statistically robust outcomes were detected. CONCLUSIONS: This study provides partial preliminary support for the idea that a common psychotherapeutic strategy used in the context of putative memory retrieval-destabilization can alter accessibility of alcohol semantic networks. Further research delineating the necessary and sufficient requirements for producing alterations in alcohol memory performance based on memory destabilization is still required

Succinct Partial Sums and Fenwick Trees

We consider the well-studied partial sums problem in succint space where one is to maintain an array of n k-bit integers subject to updates such that partial sums queries can be efficiently answered. We present two succint versions of the Fenwick Tree - which is known for its simplicity and practicality. Our results hold in the encoding model where one is allowed to reuse the space from the input data. Our main result is the first that only requires nk + o(n) bits of space while still supporting sum/update in O(log_b n) / O(b log_b n) time where 2 <= b <= log^O(1) n. The second result shows how optimal time for sum/update can be achieved while only slightly increasing the space usage to nk + o(nk) bits. Beyond Fenwick Trees, the results are primarily based on bit-packing and sampling - making them very practical - and they also allow for simple optimal parallelization