227,600 research outputs found

    Heat-transfer Measurements on a Blunt Spherical-segment Nose to a Mach Number of 15.1 and Flight Performance of the Rocket-propelled Model to a Mach Number of 17.8

    Get PDF
    Heat transfer measurements on blunt spherical segment nose and cylindrical body and flight test of rocket-propelled mode

    Scalar Non-Luminous Matter in Galaxies

    Get PDF
    As a candidate for dark matter in galaxies, we study an SU(3) triplet of complex scalar fields which are non-minimally coupled to gravity. In the spherically symmetric static spacetime where the flat rotational velocity curves of stars in galaxies can be explained, we find simple solutions of scalar fields with SU(3) global symmetry broken to U(1) X U(1), in an exponential scalar potential, which will be useful in a quintessence model of the late-time acceleration of the Universe.Comment: 6 pages, no figure, LaTex. Submitted to IJMP

    Shuttle system ascent aerodynamic and plume heating

    Get PDF
    The shuttle program provided a challenge to the aerothermodynamicist due to the complexity of the flow field around the vehicle during ascent, since the configuration causes multiple shock interactions between the elements. Wind tunnel tests provided data for the prediction of the ascent design heating environment which involves both plume and aerodynamic heating phenomena. The approach for the heating methodology based on ground test firings and the use of the wind tunnel data to formulate the math models is discussed

    Cosmic String Spacetime in Dilaton Gravity and Flat Rotation Curves

    Full text link
    In dilaton gravity theories, we consider a string-like topological defect formed during U(1) gauge symmetry-breaking phase transition in the early Universe, and far from the cosmic string we have vacuum solutions of the generalized Einstein equation. We discuss how they can be related to the flatness of galactic rotation curves.Comment: 9 pages, RevTeX4 fil

    Persistence in systems with algebraic interaction

    Full text link
    Persistence in coarsening 1D spin systems with a power law interaction r−1−σr^{-1-\sigma} is considered. Numerical studies indicate that for sufficiently large values of the interaction exponent σ\sigma (σ≥1/2\sigma\geq 1/2 in our simulations), persistence decays as an algebraic function of the length scale LL, P(L)∼L−θP(L)\sim L^{-\theta}. The Persistence exponent θ\theta is found to be independent on the force exponent σ\sigma and close to its value for the extremal (σ→∞\sigma \to \infty) model, θˉ=0.17507588...\bar\theta=0.17507588.... For smaller values of the force exponent (σ<1/2\sigma< 1/2), finite size effects prevent the system from reaching the asymptotic regime. Scaling arguments suggest that in order to avoid significant boundary effects for small σ\sigma, the system size should grow as [O(1/σ)]1/σ{[{\cal O}(1/\sigma)]}^{1/\sigma}.Comment: 4 pages 4 figure

    First passage time for random walks in heterogeneous networks

    Full text link
    The first passage time (FPT) for random walks is a key indicator of how fast information diffuses in a given system. Despite the role of FPT as a fundamental feature in transport phenomena, its behavior, particularly in heterogeneous networks, is not yet fully understood. Here, we study, both analytically and numerically, the scaling behavior of the FPT distribution to a given target node, averaged over all starting nodes. We find that random walks arrive quickly at a local hub, and therefore, the FPT distribution shows a crossover with respect to time from fast decay behavior (induced from the attractive effect to the hub) to slow decay behavior (caused by the exploring of the entire system). Moreover, the mean FPT is independent of the degree of the target node in the case of compact exploration. These theoretical results justify the necessity of using a random jump protocol (empirically used in search engines) and provide guidelines for designing an effective network to make information quickly accessible.Comment: 5 pages, 3 figure

    Chiron: A Robust Recommendation System with Graph Regularizer

    Full text link
    Recommendation systems have been widely used by commercial service providers for giving suggestions to users. Collaborative filtering (CF) systems, one of the most popular recommendation systems, utilize the history of behaviors of the aggregate user-base to provide individual recommendations and are effective when almost all users faithfully express their opinions. However, they are vulnerable to malicious users biasing their inputs in order to change the overall ratings of a specific group of items. CF systems largely fall into two categories - neighborhood-based and (matrix) factorization-based - and the presence of adversarial input can influence recommendations in both categories, leading to instabilities in estimation and prediction. Although the robustness of different collaborative filtering algorithms has been extensively studied, designing an efficient system that is immune to manipulation remains a significant challenge. In this work we propose a novel "hybrid" recommendation system with an adaptive graph-based user/item similarity-regularization - "Chiron". Chiron ties the performance benefits of dimensionality reduction (through factorization) with the advantage of neighborhood clustering (through regularization). We demonstrate, using extensive comparative experiments, that Chiron is resistant to manipulation by large and lethal attacks
    • …
    corecore