3,482 research outputs found

    Aerodynamic analysis of several high throat Mach number inlets for the quiet clean short-haul experimental engine

    Get PDF
    The results of an analytical study to investigate internal and external surface Mach numbers on several inlet geometries for possible application to the nacelle of the Quiet Clean Short-Haul Experimental Engine (QCSEE) are presented. The effects of external forebody geometry and internal lip geometry were illustrated at both low-speed and cruise conditions. Boundary-layer analyses were performed on several geometries to determine if lip flow separation might exist. The results indicated that inner-surface Mach number level and gradient could be reduced with inlets at a 50 deg incidence angle by blunting the external forebody geometry. The external Mach numbers at cruise conditions indicated that a compromise in the external forebody bluntness might be required to satisfy both low-speed and cruise conditions. For a fixed value of bluntness parameter, no lip flow separation was indicated for the 1.46- and 1.57-area-contraction-ratio inlets at low-speed conditions. However, a lip separation condition was obtained with the 1.37-contraction-ratio inlet. The QCSEE nacelle design takeoff operating condition (incidence angle of 50 deg and free-stream Mach number of 0.12) resulted in higher peak surface Mach numbers than the design crosswind (incidence angle of 90 deg and free-stream Mach number of 0.05) or static condition

    The Electronic Correlation Strength of Pu

    Full text link
    An electronic quantity, the correlation strength, is defined as a necessary step for understanding the properties and trends in strongly correlated electronic materials. As a test case, this is applied to the different phases of elemental Pu. Within the GW approximation we have surprisingly found a "universal" scaling relationship, where the f-electron bandwidth reduction due to correlation effects is shown to depend only on the local density approximation bandwidth and is otherwise independent of crystal structure and lattice constant.Comment: 7 pages, 4 figures, This version of the paper has been revised to add additional background informatio

    Minimizing stall time in single and parallel disk systems

    No full text
    We study integrated prefetching and caching problems following the work of Cao et al. and Kimbrel and Karlin. Cao et al. and Kimbrel and Karlin gave approximation algorithms for minimizing the total elapsed time in single and parallel disk settings. The total elapsed time is the sum of the processor stall times and the length of the request sequence to be served. We show that an optimum prefetching/caching schedule for a single disk problem can be computed in polynomial time, thereby settling an open question by Kimbrel and Karlin. For the parallel disk problem we give an approximation algorithm for minimizing stall time. Stall time is a more realistic and harder to approximate measure for this problem. All of our algorithms are based on a new approach which involves formulating the prefetching/caching problems as integer programs

    Greedy Selfish Network Creation

    Full text link
    We introduce and analyze greedy equilibria (GE) for the well-known model of selfish network creation by Fabrikant et al.[PODC'03]. GE are interesting for two reasons: (1) they model outcomes found by agents which prefer smooth adaptations over radical strategy-changes, (2) GE are outcomes found by agents which do not have enough computational resources to play optimally. In the model of Fabrikant et al. agents correspond to Internet Service Providers which buy network links to improve their quality of network usage. It is known that computing a best response in this model is NP-hard. Hence, poly-time agents are likely not to play optimally. But how good are networks created by such agents? We answer this question for very simple agents. Quite surprisingly, naive greedy play suffices to create remarkably stable networks. Specifically, we show that in the SUM version, where agents attempt to minimize their average distance to all other agents, GE capture Nash equilibria (NE) on trees and that any GE is in 3-approximate NE on general networks. For the latter we also provide a lower bound of 3/2 on the approximation ratio. For the MAX version, where agents attempt to minimize their maximum distance, we show that any GE-star is in 2-approximate NE and any GE-tree having larger diameter is in 6/5-approximate NE. Both bounds are tight. We contrast these positive results by providing a linear lower bound on the approximation ratio for the MAX version on general networks in GE. This result implies a locality gap of Ω(n)\Omega(n) for the metric min-max facility location problem, where n is the number of clients.Comment: 28 pages, 8 figures. An extended abstract of this work was accepted at WINE'1

    On the Structure of Equilibria in Basic Network Formation

    Full text link
    We study network connection games where the nodes of a network perform edge swaps in order to improve their communication costs. For the model proposed by Alon et al. (2010), in which the selfish cost of a node is the sum of all shortest path distances to the other nodes, we use the probabilistic method to provide a new, structural characterization of equilibrium graphs. We show how to use this characterization in order to prove upper bounds on the diameter of equilibrium graphs in terms of the size of the largest kk-vicinity (defined as the the set of vertices within distance kk from a vertex), for any k≥1k \geq 1 and in terms of the number of edges, thus settling positively a conjecture of Alon et al. in the cases of graphs of large kk-vicinity size (including graphs of large maximum degree) and of graphs which are dense enough. Next, we present a new swap-based network creation game, in which selfish costs depend on the immediate neighborhood of each node; in particular, the profit of a node is defined as the sum of the degrees of its neighbors. We prove that, in contrast to the previous model, this network creation game admits an exact potential, and also that any equilibrium graph contains an induced star. The existence of the potential function is exploited in order to show that an equilibrium can be reached in expected polynomial time even in the case where nodes can only acquire limited knowledge concerning non-neighboring nodes.Comment: 11 pages, 4 figure

    Many-body Electronic Structure of Metallic alpha-Uranium

    Full text link
    We present results for the electronic structure of alpha uranium using a recently developed quasiparticle self-consistent GW method (QSGW). This is the first time that the f-orbital electron-electron interactions in an actinide has been treated by a first-principles method beyond the level of the generalized gradient approximation (GGA) to the local density approximation (LDA). We show that the QSGW approximation predicts an f-level shift upwards of about 0.5 eV with respect to the other metallic s-d states and that there is a significant f-band narrowing when compared to LDA band-structure results. Nonetheless, because of the overall low f-electron occupation number in uranium, ground-state properties and the occupied band structure around the Fermi energy is not significantly affected. The correlations predominate in the unoccupied part of the f states. This provides the first formal justification for the success of LDA and GGA calculations in describing the ground-state properties of this material.Comment: 4 pages, 3 fihgure

    Reduced model for female endocrine dynamics: Validation and functional variations

    Full text link
    A normally functioning menstrual cycle requires significant crosstalk between hormones originating in ovarian and brain tissues. Reproductive hormone dysregulation may cause abnormal function and sometimes infertility. The inherent complexity in this endocrine system is a challenge to identifying mechanisms of cycle disruption, particularly given the large number of unknown parameters in existing mathematical models. We develop a new endocrine model to limit model complexity and use simulated distributions of unknown parameters for model analysis. By employing a comprehensive model evaluation, we identify a collection of mechanisms that differentiate normal and abnormal phenotypes. We also discover an intermediate phenotype--displaying relatively normal hormone levels and cycle dynamics--that is grouped statistically with the irregular phenotype. Results provide insight into how clinical symptoms associated with ovulatory disruption may not be detected through hormone measurements alone
    • …
    corecore