Loading

Error: Cannot Load Popup Box

Hit List

Title:

*corresponding author

Author:

Description:

Warming of the deep water in the Weddell Sea has important implications for Antarctic Bottom Water (AABW) formation, melting of pack ice, and the regional ocean-atmosphere heat transfer. In order to evaluate warming trends in the Weddell Sea, a historical data set encompassing CTD and bottle data from 1912 to 2000 was analyzed for temporal trend...

Warming of the deep water in the Weddell Sea has important implications for Antarctic Bottom Water (AABW) formation, melting of pack ice, and the regional ocean-atmosphere heat transfer. In order to evaluate warming trends in the Weddell Sea, a historical data set encompassing CTD and bottle data from 1912 to 2000 was analyzed for temporal trends in the deep water masses: Warm Deep Water (WDW) and Weddell Sea Deep Water (WSDW). The coldest WDW temperatures were primarily associated with the Weddell Polynya of the mid-1970’s. Subsequent warming occurred at a rate of ~0.012 ±0.007 oC yr-1 from the 1970’s to 1990’s. This warming was comparable to the global, average surface water warming observed by Levitus et al. [2000], to the warming of the WSBW in the central Weddell Sea observed by Fahrbach et al. [1998a], and to the surface ice temperature warming from 1970 to 1998 in the Weddell Sea observed by Comiso [2000]. The warming was not compensated by an increase in salinity and thus the WDW became less dense. The location of the warmest temperature was displaced towards the surface by ~200 m from the 1970’s to the 1990’s. Although the average Weddell Sea Deep Water (WSDW) potential temperatures between 1500 and 3500 m were Minimize

Contributors:

The Pennsylvania State University CiteSeerX Archives

Year of Publication:

2015-01-12

Source:

http://www.ldeo.columbia.edu/~rroberts/longterm.pdf

http://www.ldeo.columbia.edu/~rroberts/longterm.pdf Minimize

Document Type:

text

Language:

en

Rights:

Metadata may be used without restrictions as long as the oai identifier remains attached to it.

Metadata may be used without restrictions as long as the oai identifier remains attached to it. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Tu sombra. Aprende a conocer tu lado oscuro : aprende a desarrollarte

Publisher:

Paidós

Document Type:

book

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Fibronectin III 13-14 Domains Induce Joint Damage via Toll-Like Receptor 4 Activation and Synergize with Interleukin-1 and Tumour Necrosis Factor

Author:

Description:

Cartilage loss is a feature of chronic arthritis. It results from degradation of the extracellular matrix which is composed predominantly of aggrecan and type II collagen. Extracellular matrix degradation is mediated by aggrecanases and matrix metalloproteinases (MMPs). Recently, a number of endogenous matrix molecules, including fibronectin (FN...

Cartilage loss is a feature of chronic arthritis. It results from degradation of the extracellular matrix which is composed predominantly of aggrecan and type II collagen. Extracellular matrix degradation is mediated by aggrecanases and matrix metalloproteinases (MMPs). Recently, a number of endogenous matrix molecules, including fibronectin (FN), have been implicated in mediating cartilage degradation. We were interested in studying the C-terminal heparin-binding region of FN since it mediates aggrecan and type II collagen breakdown in cartilage, but the specific FN domains responsible for proteolytic enzyme activity and their receptors in cartilage are unknown. In this study, the ability of recombinant FN domains to induce cartilage breakdown was tested. We found that the FN III 13-14 domains in the C-terminal heparin-binding region of FN are potent inducers of aggrecanase activity in articular cartilage. In murine studies, the FN III 13-14-induced aggrecanase activity was inhibited in Toll-like receptor 4 (TLR4) knockout mice but not wild-type mice. FN III 13-14 domains also synergized with the known catabolic cytokines interleukin-1α and tumour necrosis factor and induced secretion of MMP-1, MMP-3, gp38 and serum amyloid-like protein A in chondrocytes. Our studies provide a mechanistic link between the innate immune receptor TLR4 and sterile arthritis induced by the FN III 13-14 domains of the endogenous matrix molecule FN. Minimize

Publisher:

S. Karger AG

Year of Publication:

2011-12

Document Type:

Text

Language:

en

Subjects:

Research Article

Research Article Minimize

DDC:

616 Diseases *(computed)*

Rights:

Copyright © 2011 by S. Karger AG, Basel ; http://creativecommons.org/licenses/by-nc/3.0/ ; This article is distributed under the terms of the Creative Commons Attribution-Noncommercial License (http://creativecommons.org/licenses/by-nc/3.0/). Users may download, print and share this work on the Internet for noncommercial purposes only, provided ...

Copyright © 2011 by S. Karger AG, Basel ; http://creativecommons.org/licenses/by-nc/3.0/ ; This article is distributed under the terms of the Creative Commons Attribution-Noncommercial License (http://creativecommons.org/licenses/by-nc/3.0/). Users may download, print and share this work on the Internet for noncommercial purposes only, provided the original work is properly cited, and a link to the original work on http://www.karger.com and the terms of this license are included in any shared versions. Minimize

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Cyclically five-connected cubic graphs

Author:

Description:

A cubic graph $G$ is cyclically 5-connected if $G$ is simple, 3-connected, has at least 10 vertices and for every set $F$ of edges of size at most four, at most one component of $G\backslash F$ contains circuits. We prove that if $G$ and $H$ are cyclically 5-connected cubic graphs and $H$ topologically contains $G$, then either $G$ and $H$ are i...

A cubic graph $G$ is cyclically 5-connected if $G$ is simple, 3-connected, has at least 10 vertices and for every set $F$ of edges of size at most four, at most one component of $G\backslash F$ contains circuits. We prove that if $G$ and $H$ are cyclically 5-connected cubic graphs and $H$ topologically contains $G$, then either $G$ and $H$ are isomorphic, or (modulo well-described exceptions) there exists a cyclically 5-connected cubic graph $G'$ such that $H$ topologically contains $G'$ and $G'$ is obtained from $G$ in one of the following two ways. Either $G'$ is obtained from $G$ by subdividing two distinct edges of $G$ and joining the two new vertices by an edge, or $G'$ is obtained from $G$ by subdividing each edge of a circuit of length five and joining the new vertices by a matching to a new circuit of length five disjoint from $G$ in such a way that the cyclic orders of the two circuits agree. We prove a companion result, where by slightly increasing the connectivity of $H$ we are able to eliminate the second construction. We also prove versions of both of these results when $G$ is almost cyclically 5-connected in the sense that it satisfies the definition except for 4-edge cuts such that one side is a circuit of length four. In this case $G'$ is required to be almost cyclically 5-connected and to have fewer circuits of length four than $G$. In particular, if $G$ has at most one circuit of length four, then $G'$ is required to be cyclically 5-connected. However, in this more general setting the operations describing the possible graphs $G'$ are more complicated. ; Comment: 47 pages, 5 figures Minimize

Year of Publication:

2015-03-08

Document Type:

text

Subjects:

Mathematics - Combinatorics ; Computer Science - Discrete Mathematics

Mathematics - Combinatorics ; Computer Science - Discrete Mathematics Minimize

DDC:

511 General principles of mathematics *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Permanents, Pfaffian orientations, and even directed circuits

Author:

Description:

Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either have the same sign or are both zero) is nonsing...

Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real square matrix have the property that every real matrix with the same sign pattern (that is, the corresponding entries either have the same sign or are both zero) is nonsingular? When is a hypergraph with n vertices and n hyperedges minimally nonbipartite? When does a bipartite graph have a "Pfaffian orientation"? Given a digraph, does it have no directed circuit of even length? Given a digraph, does it have a subdivision with no even directed circuit? It is known that all of the above problems are equivalent. We prove a structural characterization of the feasible instances, which implies a polynomial-time algorithm to solve all of the above problems. The structural characterization says, roughly speaking, that a bipartite graph has a Pfaffian orientation if and only if it can be obtained by piecing together (in a specified way) planar bipartite graphs and one sporadic nonplanar bipartite graph. ; Comment: 47 pages, published version Minimize

Year of Publication:

1999-10-31

Document Type:

text

Subjects:

Mathematics - Combinatorics

Mathematics - Combinatorics Minimize

DDC:

511 General principles of mathematics *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Linkless embeddings of graphs in $3$-space

Author:

Description:

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have shown: (i) An embedding is flat if and only if the fundamental group of the complement in 3-space of the embedd...

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have shown: (i) An embedding is flat if and only if the fundamental group of the complement in 3-space of the embedding of every subgraph is free. (ii) If two flat embeddings of the same graph are not ambient isotopic, then they differ on a subdivision of $K_5$ or $K_{3,3}$. (iii) Any flat embedding of a graph can be transformed to any other flat embedding of the same graph by ``3-switches'', an analog of 2-switches from the theory of planar embeddings. In particular, any two flat embeddings of a 4-connected graph are either ambient isotopic, or one is ambient isotopic to a mirror image of the other. (iv) A graph has a flat embedding if and only if it has no minor isomorphic to one of seven specified graphs. These are the graphs that can be obtained from $K_6$ by means of $Y\Delta$- and $\Delta Y$-exchanges. ; Comment: 6 pages Minimize

Year of Publication:

1992-12-31

Document Type:

text

Subjects:

Mathematics - Combinatorics ; Mathematics - Geometric Topology

Mathematics - Combinatorics ; Mathematics - Geometric Topology Minimize

DDC:

511 General principles of mathematics *(computed)*

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Girth six cubic graphs have Petersen minors

Author:

Description:

We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. ; Comment: 12 pages, 2 figures

We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph. ; Comment: 12 pages, 2 figures Minimize

Year of Publication:

2014-05-02

Document Type:

text

Subjects:

Mathematics - Combinatorics ; Computer Science - Discrete Mathematics

Mathematics - Combinatorics ; Computer Science - Discrete Mathematics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Excluded minors in cubic graphs

Author:

Description:

Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if there is no homeomorphic embedding of the Petersen graph in G, and G is not one particular 20-vertex graph, then either G\v is planar for some vertex v, or G can be dr...

Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if there is no homeomorphic embedding of the Petersen graph in G, and G is not one particular 20-vertex graph, then either G\v is planar for some vertex v, or G can be drawn with crossings in the plane, but with only two crossings, both on the infinite region. We also prove several other theorems of the same kind. ; Comment: 62 pages, 17 figures Minimize

Year of Publication:

2014-03-09

Document Type:

text

Subjects:

Mathematics - Combinatorics

Mathematics - Combinatorics Minimize

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Interview with Robin Robertson, Random House, London, 10 January 2011

Description:

Robin Robertson has published five collections of poetry: A Painted Field, Slow Air, Swithering, The Wrecking Light and Hill of Doors, as well as Sailing the Forest: Selected Poems. Robertson (born 1955) was brought up on the north-east coast of Scotland. His poetry has received numerous awards, including the E. M. Forster Award from the America...

Robin Robertson has published five collections of poetry: A Painted Field, Slow Air, Swithering, The Wrecking Light and Hill of Doors, as well as Sailing the Forest: Selected Poems. Robertson (born 1955) was brought up on the north-east coast of Scotland. His poetry has received numerous awards, including the E. M. Forster Award from the American Academy of Arts and Letters and he is the first poet to have won all three categories of the Forward Prize. He lives in London. Katrina Naomi interviewed Robertson in the early stages of her PhD research at Goldsmiths (University of London). The title of her thesis is ‘Beyond Gentility: Violence in the Poetry of Sharon Olds, Pascale Petit, Peter Redgrove and Robin Robertson’. Minimize

Year of Publication:

2015-01-16

Document Type:

Article

Language:

en

Subjects:

Scottish poets ; Robin Robertson ; Violence in poetry

Content Provider:

My Lists:

My Tags:

Notes:

Title:

Predicting the likelihood of voiced complaints in the self-service technology context

Description:

There is considerable evidence to suggest that consumer dissatisfaction with self-service technologies is widespread. However, there has been little conceptual or empirical scrutiny of the likelihood that consumers will complain to an organization (likelihood of voice) in this context. This study contributes to the service domain by testing empi...

There is considerable evidence to suggest that consumer dissatisfaction with self-service technologies is widespread. However, there has been little conceptual or empirical scrutiny of the likelihood that consumers will complain to an organization (likelihood of voice) in this context. This study contributes to the service domain by testing empirically a model of the antecedents of consumers' likelihood of voice in unsatisfactory encounters with self-service technologies. A model is tested that combines established antecedents of voice, such as likelihood of voice success, and those that have not yet been considered, including self-service technology powerlessness and need to vent. The results support the proposed model in general. Theoretical and managerial implications of the findings are discussed. Minimize

Publisher:

Sage Publications

Year of Publication:

2009-08-01

Document Type:

Journal Article

Language:

eng

Subjects:

Consumer voice ; self-service technologies ; complaint management ; consumer dissatisfaction

Consumer voice ; self-service technologies ; complaint management ; consumer dissatisfaction Minimize

Rights:

2009, The Author(s)

2009, The Author(s) Minimize

Relations:

http://dro.deakin.edu.au/eserv/DU:30020748/robertson-predictingthelikelihood-2009.pdf

URL:

Content Provider:

My Lists:

My Tags:

Notes:

Currently in BASE: 71,429,514 Documents of 3,428 Content Sources

http://www.base-search.net