838 research outputs found
Overshooting of Clean Tropospheric Air in the Tropical Lower Stratosphere as Seen by the CALIPSO Lidar
The evolution of aerosols in the tropical upper troposphere/lower stratosphere between June 2006 and October 2009 is examined using the observations of the space borne CALIOP lidar aboard the CALIPSO satellite. Superimposed on several volcanic plumes and soot from an extreme biomass-burning event in 2009, the measurements reveal the existence of fast cleansing episodes of the lower stratosphere to altitudes as high as 20 km. The cleansing of the full 14-20km layer takes place within 1-4 months. Its coincidence with the maximum of convective activity in the southern tropics, suggests that the cleansing is the result of a large number of overshooting towers, injecting aerosol-poor tropospheric air into the lower stratosphere. The enhancements of aerosols at the tropopause level during the NH summer may be due to the same transport process but associated with intense sources of aerosols at the surface. Since, the tropospheric air flux derived from CALIOP observations during North Hemisphere winter is 5 20 times larger than the slow ascent by radiative heating usually assumed, the observations suggest that convective overshooting is a major contributor to troposphere-to-stratosphere transport with concommitant implications to the Tropical Tropopause Layer top height, chemistry and thermal structure
On two problems in graph Ramsey theory
We study two classical problems in graph Ramsey theory, that of determining
the Ramsey number of bounded-degree graphs and that of estimating the induced
Ramsey number for a graph with a given number of vertices.
The Ramsey number r(H) of a graph H is the least positive integer N such that
every two-coloring of the edges of the complete graph contains a
monochromatic copy of H. A famous result of Chv\'atal, R\"{o}dl, Szemer\'edi
and Trotter states that there exists a constant c(\Delta) such that r(H) \leq
c(\Delta) n for every graph H with n vertices and maximum degree \Delta. The
important open question is to determine the constant c(\Delta). The best
results, both due to Graham, R\"{o}dl and Ruci\'nski, state that there are
constants c and c' such that 2^{c' \Delta} \leq c(\Delta) \leq 2^{c \Delta
\log^2 \Delta}. We improve this upper bound, showing that there is a constant c
for which c(\Delta) \leq 2^{c \Delta \log \Delta}.
The induced Ramsey number r_{ind}(H) of a graph H is the least positive
integer N for which there exists a graph G on N vertices such that every
two-coloring of the edges of G contains an induced monochromatic copy of H.
Erd\H{o}s conjectured the existence of a constant c such that, for any graph H
on n vertices, r_{ind}(H) \leq 2^{c n}. We move a step closer to proving this
conjecture, showing that r_{ind} (H) \leq 2^{c n \log n}. This improves upon an
earlier result of Kohayakawa, Pr\"{o}mel and R\"{o}dl by a factor of \log n in
the exponent.Comment: 18 page
Evaluational adjectives
This paper demarcates a theoretically interesting class of "evaluational adjectives." This class includes predicates expressing various kinds of normative and epistemic evaluation, such as predicates of personal taste, aesthetic adjectives, moral adjectives, and epistemic adjectives, among others. Evaluational adjectives are distinguished, empirically, in exhibiting phenomena such as discourse-oriented use, felicitous embedding under the attitude verb `find', and sorites-susceptibility in the comparative form. A unified degree-based semantics is developed: What distinguishes evaluational adjectives, semantically, is that they denote context-dependent measure functions ("evaluational perspectives")—context-dependent mappings to degrees of taste, beauty, probability, etc., depending on the adjective. This perspective-sensitivity characterizing the class of evaluational adjectives cannot be assimilated to vagueness, sensitivity to an experiencer argument, or multidimensionality; and it cannot be demarcated in terms of pretheoretic notions of subjectivity, common in the literature. I propose that certain diagnostics for "subjective" expressions be analyzed instead in terms of a precisely specified kind of discourse-oriented use of context-sensitive language. I close by applying the account to `find x PRED' ascriptions
SAGE Version 7.0 Algorithm: Application to SAGE II
This paper details the Stratospheric Aerosol and Gas Experiments (SAGE) version 7.0 algorithm and how it is applied to SAGE II. Changes made between the previous (v6.2) and current (v7.0) versions are described and their impacts on the data products explained for both coincident event comparisons and time-series analysis. Users of the data will notice a general improvement in all of the SAGE II data products, which are now in better agreement with more modern data sets (e.g. SAGE III) and more robust for use with trend studies
Changing a semantics: opportunism or courage?
The generalized models for higher-order logics introduced by Leon Henkin, and
their multiple offspring over the years, have become a standard tool in many
areas of logic. Even so, discussion has persisted about their technical status,
and perhaps even their conceptual legitimacy. This paper gives a systematic
view of generalized model techniques, discusses what they mean in mathematical
and philosophical terms, and presents a few technical themes and results about
their role in algebraic representation, calibrating provability, lowering
complexity, understanding fixed-point logics, and achieving set-theoretic
absoluteness. We also show how thinking about Henkin's approach to semantics of
logical systems in this generality can yield new results, dispelling the
impression of adhocness. This paper is dedicated to Leon Henkin, a deep
logician who has changed the way we all work, while also being an always open,
modest, and encouraging colleague and friend.Comment: 27 pages. To appear in: The life and work of Leon Henkin: Essays on
his contributions (Studies in Universal Logic) eds: Manzano, M., Sain, I. and
Alonso, E., 201
- …