36,148 research outputs found

    Polynomial Cointegration among Stationary Processes with Long Memory

    Get PDF
    n this paper we consider polynomial cointegrating relationships among stationary processes with long range dependence. We express the regression functions in terms of Hermite polynomials and we consider a form of spectral regression around frequency zero. For these estimates, we establish consistency by means of a more general result on continuously averaged estimates of the spectral density matrix at frequency zeroComment: 25 pages, 7 figures. Submitted in August 200

    Space Shuttle interactive meteorological data system study

    Get PDF
    Although focused toward the operational meteorological support review and definition of an operational meteorological interactive data display systems (MIDDS) requirements for the Space Meteorology Support Group at NASA/Johnson Space Center, the total operational meteorological support requirements and a systems concept for the MIDDS network integration of NASA and Air Force elements to support the National Space Transportation System are also addressed

    The effects of isometric work on heart rate, blood pressure, and net oxygen cost

    Get PDF
    Isometric exercise effects on heart rate, blood pressure, and net oxygen cos

    Geologic and tectonic setting of the MARK area

    Get PDF

    On a problem of Erd\H{o}s and Rothschild on edges in triangles

    Get PDF
    Erd\H{o}s and Rothschild asked to estimate the maximum number, denoted by H(N,C), such that every N-vertex graph with at least CN^2 edges, each of which is contained in at least one triangle, must contain an edge that is in at least H(N,C) triangles. In particular, Erd\H{o}s asked in 1987 to determine whether for every C>0 there is \epsilon >0 such that H(N,C) > N^\epsilon, for all sufficiently large N. We prove that H(N,C) = N^{O(1/log log N)} for every fixed C < 1/4. This gives a negative answer to the question of Erd\H{o}s, and is best possible in terms of the range for C, as it is known that every N-vertex graph with more than (N^2)/4 edges contains an edge that is in at least N/6 triangles.Comment: 8 page
    corecore