33,604 research outputs found

    USAF solar thermal applications overview

    Get PDF
    Process heat applications were compared to solar thermal technologies. The generic process heat applications were analyzed for solar thermal technology utilization, using SERI's PROSYS/ECONOMAT model in an end use matching analysis and a separate analysis was made for solar ponds. Solar technologies appear attractive in a large number of applications. Low temperature applications at sites with high insolation and high fuel costs were found to be most attractive. No one solar thermal technology emerges as a clearly universal or preferred technology, however,, solar ponds offer a potential high payoff in a few, selected applications. It was shown that troughs and flat plate systems are cost effective in a large number of applications

    Research and technology program perspectives for general aviation and commuter aircraft

    Get PDF
    The uses, benefits, and technology needs of the U.S. general aviation industry were studied in light of growing competition from foreign general aviation manufacturers, especially in the commuter and business jet aircraft markets

    Components required for in vitro cleavage and polyadenylation of eukaryotic mRNA

    Get PDF
    We have studied in vitro cleavage/polyadenylation of precursor RNA containing herpes simplex virus type 2 poly A site sequences and have analysed four RNA/protein complexes which form during in vitro reactions. Two complexes, A and B, form extremely rapidly and are then progressively replaced by a third complex, C which is produced following cleavage and polyadenylation of precursor RNA. Substitution of ATP with cordycepin triphosphate prevents polyadenylation and the formation of complex C however a fourth complex, D, results which contains cleaved RNA. A precursor RNA lacking GU-rich downstream sequences required for efficient cleavage/ polyadenylation fails to form complex B and produces a markedly reduced amount of complex A. As these GU-rich sequences are required for efficient cleavage, this establishes a relationship between complex B formation and cleavage/polyadenylation of precursor RNA in vitro. The components required for in vitro RNA processing have been separated by fractionation of the nuclear extract on Q-Sepharose and Biorex 70 columns. A Q-Sepharose fraction forms complex B but does not process RNA. Addition of a Biorex 70 fraction restores cleavage activity at the poly A site but this fraction does not appear to contribute to complex formation. Moreover, in the absence of polyethylene glycol, precursor RNA is not cleaved and polyadenylated, however, complexes A and B readily form. Thus, while complex B is necessary for in vitro cleavage and polyadenylation, it may not contain all the components required for this processing

    Models of collective cell spreading with variable cell aspect ration: a motivation for degenerate diffusion models

    Get PDF
    Continuum diffusion models are often used to represent the collective motion of cell populations. Most previous studies have simply used linear diffusion to represent collective cell spreading, while others found that degenerate nonlinear diffusion provides a better match to experimental cell density profiles. In the cell modeling literature there is no guidance available with regard to which approach is more appropriate for representing the spreading of cell populations. Furthermore, there is no knowledge of particular experimental measurements that can be made to distinguish between situations where these two models are appropriate. Here we provide a link between individual-based and continuum models using a multiscale approach in which we analyze the collective motion of a population of interacting agents in a generalized lattice-based exclusion process. For round agents that occupy a single lattice site, we find that the relevant continuum description of the system is a linear diffusion equation, whereas for elongated rod-shaped agents that occupy L adjacent lattice sites we find that the relevant continuum description is connected to the porous media equation (PME). The exponent in the nonlinear diffusivity function is related to the aspect ratio of the agents. Our work provides a physical connection between modeling collective cell spreading and the use of either the linear diffusion equation or the PME to represent cell density profiles. Results suggest that when using continuum models to represent cell population spreading, we should take care to account for variations in the cell aspect ratio because different aspect ratios lead to different continuum models

    Constraints on radiative decay of the 17-keV neutrino from COBE Measurements

    Full text link
    It is shown that, for a nontrivial radiative decay channel of the 17-keV neutrino, the photons would distort the microwave background radiation through ionization of the universe. The constraint on the branching ratio of such decays from COBE measurements is found to be more stringent than that from other considerations. The limit on the branching ratio in terms of the Compton yy parameter is Bγ<1.5×107(τν1011sec)0.45(y103)1.11h1B_\gamma < 1.5 \times 10^{-7} ({\tau_\nu \over 10^{11} sec})^{0.45} ({y \over 10^{-3}})^{1.11} h^{-1} for an Ω=1,Ωb=0.1\Omega=1, \Omega_b=0.1 universe.Comment: 7 pages. (figures will be sent on request) (To appear in Phys. Rev. D.

    Managing urban socio-technical change? Comparing energy technology controversies in three European contexts

    Get PDF
    A {\em local graph partitioning algorithm} finds a set of vertices with small conductance (i.e. a sparse cut) by adaptively exploring part of a large graph GG, starting from a specified vertex. For the algorithm to be local, its complexity must be bounded in terms of the size of the set that it outputs, with at most a weak dependence on the number nn of vertices in GG. Previous local partitioning algorithms find sparse cuts using random walks and personalized PageRank. In this paper, we introduce a randomized local partitioning algorithm that finds a sparse cut by simulating the {\em volume-biased evolving set process}, which is a Markov chain on sets of vertices. We prove that for any set of vertices AA that has conductance at most ϕ\phi, for at least half of the starting vertices in AA our algorithm will output (with probability at least half), a set of conductance O(ϕ1/2log1/2n)O(\phi^{1/2} \log^{1/2} n). We prove that for a given run of the algorithm, the expected ratio between its computational complexity and the volume of the set that it outputs is O(ϕ1/2polylog(n))O(\phi^{-1/2} polylog(n)). In comparison, the best previous local partitioning algorithm, due to Andersen, Chung, and Lang, has the same approximation guarantee, but a larger ratio of O(ϕ1polylog(n))O(\phi^{-1} polylog(n)) between the complexity and output volume. Using our local partitioning algorithm as a subroutine, we construct a fast algorithm for finding balanced cuts. Given a fixed value of ϕ\phi, the resulting algorithm has complexity O((m+nϕ1/2)polylog(n))O((m+n\phi^{-1/2}) polylog(n)) and returns a cut with conductance O(ϕ1/2log1/2n)O(\phi^{1/2} \log^{1/2} n) and volume at least vϕ/2v_{\phi}/2, where vϕv_{\phi} is the largest volume of any set with conductance at most ϕ\phi.Comment: 20 pages, no figure
    corecore