8,438 research outputs found

    Three-dimensional structure of a low-Reynolds-number turbulent boundary layer

    Get PDF
    A low-Reynolds-number zero-pressure-gradient incompressible turbulent boundary layer was investigated using a volumetric imaging technique. The Reynolds number based on momentum thickness was 700. The flow was tagged with a passive scalar from two spanwise dye slots to distinguish between fluid motions originating in the inner and outer portions of the boundary layer. The resulting volumetric scalar field was interrogated using a laser sheet scanner developed for this study. Two- and three-dimensional time-dependent visualizations of a 50 volume time series are presented (equivalent to 17δ in length). In the outer portion of the boundary layer, scalar structures were observed to lie along lines in the (x, z)-plane, inclined to the streamwise (x-)direction in the range ±50°. The ejection of brightly dyed fluid packets from the near-wall region was observed to be spatially organized, and related to the passage of the large-scale scalar structures.Carl J Delo, Richard M Kelson and Alexander J Smit

    jsPhyloSVG: A Javascript Library for Visualizing Interactive and Vector-Based Phylogenetic Trees on the Web

    Get PDF
    BackgroundMany software packages have been developed to address the need for generating phylogenetic trees intended for print. With an increased use of the web to disseminate scientific literature, there is a need for phylogenetic trees to be viewable across many types of devices and feature some of the interactive elements that are integral to the browsing experience. We propose a novel approach for publishing interactive phylogenetic trees. Methods/Principal Findings We present a javascript library, jsPhyloSVG, which facilitates constructing interactive phylogenetic trees from raw Newick or phyloXML formats directly within the browser in Scalable Vector Graphics (SVG) format. It is designed to work across all major browsers and renders an alternative format for those browsers that do not support SVG. The library provides tools for building rectangular and circular phylograms with integrated charting. Interactive features may be integrated and made to respond to events such as clicks on any element of the tree, including labels. Conclusions/Significance jsPhyloSVG is an open-source solution for rendering dynamic phylogenetic trees. It is capable of generating complex and interactive phylogenetic trees across all major browsers without the need for plugins. It is novel in supporting the ability to interpret the tree inference formats directly, exposing the underlying markup to data-mining services. The library source code, extensive documentation and live examples are freely accessible at www.jsphylosvg.com

    Friction factors for smooth pipe flow

    Get PDF
    Friction factor data from two recent pipe flow experiments are combined to provide a comprehensive picture of the friction factor variation for Reynolds numbers from 10 to 36,000,000

    A bioinformatics approach to the development of immunoassays for specified risk material in canned meat products

    Get PDF
    A bioinformatics approach to developing antibodies to specific proteins has been evaluated for the production of antibodies to heat-processed specified risk tissues from ruminants (brain and eye tissue). The approach involved the identification of proteins specific to ruminant tissues by interrogation of the annotation fields within the Swissprot database. These protein sequences were then interrogated for peptide sequences that were unique to the protein. Peptides were selected that met these criteria as close as possible and that were also theoretically resistant to either pepsin or trypsin. The selected peptides were synthesised and used as immunogens to raise monoclonal antibodies. Antibodies specific for the synthetic peptides were raised to half of the selected peptides. These antibodies have each been incorporated into a competitive enzyme-linked immunosorbent assay (ELISA) and shown to be able to detect the heat-processed parent protein after digestion with either pepsin or trypsin. One antibody, specific for alpha crystallin peptide (from bovine eye tissue), was able to detect the peptide in canned meat products spiked with 10% eye tissue. These results, although preliminary in nature, show that bioinformatics in conjunction with enzyme digestion can be used to develop ELISA for proteins in high-temperature processed foods and demonstrate that the approach is worth further stud

    Two- versus three-dimensional connectivity testing of first-order queries to semi-algebraic sets

    Full text link
    This paper addresses the question whether one can determine the connectivity of a semi-algebraic set in three dimensions by testing the connectivity of a finite number of two-dimensional ``samples'' of the set, where these samples are defined by first-order queries. The question is answered negatively for two classes of first-order queries: cartesian-product-free, and positive one-pass.Comment: corrected minor confusion in Proof of Theorem

    The optimal schedule for pulsar timing array observations

    Full text link
    In order to maximize the sensitivity of pulsar timing arrays to a stochastic gravitational wave background, we present computational techniques to optimize observing schedules. The techniques are applicable to both single and multi-telescope experiments. The observing schedule is optimized for each telescope by adjusting the observing time allocated to each pulsar while keeping the total amount of observing time constant. The optimized schedule depends on the timing noise characteristics of each individual pulsar as well as the performance of instrumentation. Several examples are given to illustrate the effects of different types of noise. A method to select the most suitable pulsars to be included in a pulsar timing array project is also presented.Comment: 16 pages, 6 figures, accepted by MNRA

    The PDE4 inhibitor rolipram reverses object memory impairment induced by acute tryptophan depletion in the rat

    Get PDF
    The selective type IV phosphodiesterase inhibitor, rolipram, has been shown to improve long-term memory and can reverse the cholinergic deficit caused by scopolamine. However, the underlying mechanisms of action of rolipram remain obscure. The present study investigates the effect of rolipram in a serotonergic-deficit model of acute tryptophan depletion (ATD). In addition, the levels of plasma tryptophan (TRP) were compared to object recognition performance. The experiments were conducted using male Wistar rats. The time-dependent effect of ATD treatment (a gelatin-based protein mixture) on plasma TRP levels (0, 1, 3, and 6 h after injection) and object recognition task (ORT) performance (0.5, 1, 3, and 6 h after ATD treatment) was examined. The effect of rolipram (0, 0.01, 0.03, and 0.1 mg/kg, i.p.) was tested in the condition in which ATD induced a clear memory deficit. ATD significantly lowered the plasma TRP ratio (TRP/Sigma large neutral amino acid) with a maximum of 48%, approximately 1 h after administration. Furthermore, ATD impairs ORT performance when administered 3 h before testing. Rolipram (0.1 mg/kg) reversed the memory deficit induced by ATD in a dose-dependent manner. On the basis of previous studies and the ability to reverse a serotonergic deficit, we suggest that rolipram may act through elevation of cyclic adenosine monophosphate levels and subsequent increase in neurotransmitter release

    Generalized Multivariate Extreme Value Models for Explicit Route Choice Sets

    Get PDF
    This paper analyses a class of route choice models with closed-form probability expressions, namely, Generalized Multivariate Extreme Value (GMEV) models. A large group of these models emerge from different utility formulas that combine systematic utility and random error terms. Twelve models are captured in a single discrete choice framework. The additive utility formula leads to the known logit family, being multinomial, path-size, paired combinatorial and link-nested. For the multiplicative formulation only the multinomial and path-size weibit models have been identified; this study also identifies the paired combinatorial and link-nested variations, and generalizes the path-size variant. Furthermore, a new traveller's decision rule based on the multiplicative utility formula with a reference route is presented. Here the traveller chooses exclusively based on the differences between routes. This leads to four new GMEV models. We assess the models qualitatively based on a generic structure of route utility with random foreseen travel times, for which we empirically identify that the variance of utility should be different from thus far assumed for multinomial probit and logit-kernel models. The expected travellers' behaviour and model-behaviour under simple network changes are analysed. Furthermore, all models are estimated and validated on an illustrative network example with long distance and short distance origin-destination pairs. The new multiplicative models based on differences outperform the additive models in both tests

    Pulsar science with the Five hundred metre Aperture Spherical Telescope

    Get PDF
    With a collecting area of 70 000 m^2, the Five hundred metre Aperture Spherical Telescope (FAST) will allow for great advances in pulsar astronomy. We have performed simulations to estimate the number of previously unknown pulsars FAST will find with its 19-beam or possibly 100-beam receivers for different survey strategies. With the 19-beam receiver, a total of 5200 previously unknown pulsars could be discovered in the Galactic plane, including about 460 millisecond pulsars (MSPs). Such a survey would take just over 200 days with eight hours survey time per day. We also estimate that, with about 80 six-hour days, a survey of M31 and M33 could yield 50--100 extra-Galactic pulsars. A 19-beam receiver would produce just under 500 MB of data per second and requires about 9 tera-ops to perform the major part of a real time analysis. We also simulate the logistics of high-precision timing of MSPs with FAST. Timing of the 50 brightest MSPs to a signal-to-noise of 500 would take about 24 hours per epoch.Comment: 9 pages, 10 figures; accepted for publication in A&
    corecore