41,022 research outputs found

    The wall effect in cavity flow

    Get PDF
    A non-linear theory for the calculation of the flow field of an oblique flat plate under blockage condition is given using the techniques of integral equations. Numerical results are obtained with the aid of a high speed digital computer for the plate situated mid-channel at values of the angle of attack from 50 to 90° and the channel width-chord ratio from 3 to 20. Also obtained are results for the plate situated at two different off-center positions for a channel width-chord ratio 5 and angles of attack less than 30°

    Karhunen-Lo\`eve expansion for a generalization of Wiener bridge

    Get PDF
    We derive a Karhunen-Lo\`eve expansion of the Gauss process Btg(t)01g(u)dBuB_t - g(t)\int_0^1 g'(u)\,d B_u, t[0,1]t\in[0,1], where (Bt)t[0,1](B_t)_{t\in[0,1]} is a standard Wiener process and g:[0,1]Rg:[0,1]\to R is a twice continuously differentiable function with g(0)=0g(0) = 0 and 01(g(u))2du=1\int_0^1 (g'(u))^2\,d u =1. This process is an important limit process in the theory of goodness-of-fit tests. We formulate two special cases with the function g(t)=2πsin(πt)g(t)=\frac{\sqrt{2}}{\pi}\sin(\pi t), t[0,1]t\in[0,1], and g(t)=tg(t)=t, t[0,1]t\in[0,1], respectively. The latter one corresponds to the Wiener bridge over [0,1][0,1] from 00 to 00.Comment: 25 pages, 1 figure. The appendix is extende

    Automatic generation of simplified weakest preconditions for integrity constraint verification

    Get PDF
    Given a constraint cc assumed to hold on a database BB and an update uu to be performed on BB, we address the following question: will cc still hold after uu is performed? When BB is a relational database, we define a confluent terminating rewriting system which, starting from cc and uu, automatically derives a simplified weakest precondition wp(c,u)wp(c,u) such that, whenever BB satisfies wp(c,u)wp(c,u), then the updated database u(B)u(B) will satisfy cc, and moreover wp(c,u)wp(c,u) is simplified in the sense that its computation depends only upon the instances of cc that may be modified by the update. We then extend the definition of a simplified wp(c,u)wp(c,u) to the case of deductive databases; we prove it using fixpoint induction

    Extended X-ray Emission From a Quasar-Driven Superbubble

    Full text link
    We present observations of extended, 20-kpc scale soft X-ray gas around a luminous obscured quasar hosted by an ultra-luminous infrared galaxy caught in the midst of a major merger. The extended X-ray emission is well fit as a thermal gas with a temperature of kT ~ 280 eV and a luminosity of L_X ~ 10^42 erg/s and is spatially coincident with a known ionized gas outflow. Based on the X-ray luminosity, a factor of ~10 fainter than the [OIII] emission, we conclude that the X-ray emission is either dominated by photoionization, or by shocked emission from cloud surfaces in a hot quasar-driven wind.Comment: Accepted for publication in ApJ, 6 pages, 2 figure

    Constructing solutions to the Bj\"orling problem for isothermic surfaces by structure preserving discretization

    Get PDF
    In this article, we study an analog of the Bj\"orling problem for isothermic surfaces (that are more general than minimal surfaces): given a real analytic curve γ\gamma in R3{\mathbb R}^3, and two analytic non-vanishing orthogonal vector fields vv and ww along γ\gamma, find an isothermic surface that is tangent to γ\gamma and that has vv and ww as principal directions of curvature. We prove that solutions to that problem can be obtained by constructing a family of discrete isothermic surfaces (in the sense of Bobenko and Pinkall) from data that is sampled along γ\gamma, and passing to the limit of vanishing mesh size. The proof relies on a rephrasing of the Gauss-Codazzi-system as analytic Cauchy problem and an in-depth-analysis of its discretization which is induced from the geometry of discrete isothermic surfaces. The discrete-to-continuous limit is carried out for the Christoffel and the Darboux transformations as well.Comment: 29 pages, some figure

    A comparative study of optical/ultraviolet variability of narrow-line Seyfert 1 and broad-line Seyfert 1 active galactic nuclei

    Full text link
    The ensemble optical/ultraviolet variability of narrow-line Seyfert 1 (NLS1) type active galactic nuclei (AGNs) is investigated, based on a sample selected from the Sloan Digital Sky Survey (SDSS) Stripe-82 region with multi-epoch photometric scanning data. As a comparison a control sample of broad-line Seyfert 1 (BLS1) type AGNs is also incorporated. To quantify properly the intrinsic variation amplitudes and their uncertainties, a novel method of parametric maximum-likelihood is introduced, that has, as we argued, certain virtues over previously used methods. The majority of NLS1-type AGNs exhibit significant variability on timescales from about ten days to a few years with, however, on average smaller amplitudes compared to BLS1-type AGNs. About 20 NLS1- type AGNs showing relatively large variations are presented, that may deserve future monitoring observations, for instance, reverberation mapping. The averaged structure functions of variability, constructed using the same maximumlikelihood method, show remarkable similarity in shape for the two types of AGNs on timescales longer than about 10 days, which can be approximated by a power-law or an exponential function. This, along with other similar properties, such as the wavelength-dependent variability, are indicative of a common dominant mechanism responsible for the long-term optical/UV variability of both NLS1- and BLS1-type AGNs. Towards the short timescales, however, there is tentative evidence that the structure function of NLS1-type AGNs continues declining, whereas that of BLS1-type AGNs flattens with some residual variability on timescales of days. If this can be confirmed, it may suggest that an alternative mechanism, such as X-ray reprocessing, starts to become dominating in BLS1-type AGNs, but not in NLS1-, on such timescales.Comment: 53 pages, 13 figures, 3 tables, accepted for pulication in A

    Exploiting symmetries in SDP-relaxations for polynomial optimization

    Full text link
    In this paper we study various approaches for exploiting symmetries in polynomial optimization problems within the framework of semi definite programming relaxations. Our special focus is on constrained problems especially when the symmetric group is acting on the variables. In particular, we investigate the concept of block decomposition within the framework of constrained polynomial optimization problems, show how the degree principle for the symmetric group can be computationally exploited and also propose some methods to efficiently compute in the geometric quotient.Comment: (v3) Minor revision. To appear in Math. of Operations Researc
    corecore