Novel bilayer graphene structures produced by arc-discharge

A new form of carbon is described, which consists of hollow, three-dimensional shells bounded by bilayer graphene. The new carbon is produced very simply, by passing a current through graphite rods in a commercial arc-evaporation unit. Characterisation of the carbon using high resolution transmission electron microscopy is described, and the possible formation mechanism discussed.

Statistical characterisation of the growth and spatial scales of the substorm onset arc

We present the first multi-event study of the spatial and temporal structuring of the aurora to provide statistical evidence of the near-Earth plasma instability which causes the substorm onset arc. Using data from ground-based auroral imagers, we study repeatable signatures of along-arc auroral beads, which are thought to represent the ionospheric projection of magnetospheric instability in the near-Earth plasma sheet. We show that the growth and spatial scales of these wave-like fluctuations are similar across multiple events, indicating that each sudden auroral brightening has a common explanation. We find statistically that growth rates for auroral beads peak at low wavenumber with the most unstable spatial scales mapping to an azimuthal wavelength λ≈1700 − 2500 km in the equatorial magnetosphere at around 9-12 RE. We compare growth rates and spatial scales with a range of theoretical predictions of magnetotail instabilities, including the cross-field current instability and the shear-flow ballooning instability. We conclude that, although the cross-field current instability can generate similar magnitude of growth rates, the range of unstable wavenumbers indicates that the shear-flow ballooning instability is the most likely explanation for our observations.

Reduced maximal oxygen consumption and overproduction of proinflammatory cytokines in athletes

Objective: It was the aim of this study to evaluate whether chronic pain in athletes is related to performance, measured by the maximum oxygen consumption and production of hormones and cytokines. Methods: Fifty-five athletes with a mean age of 31.9 +/- 4.2 years engaged in regular competition and showing no symptoms of acute inflammation, particularly fever, were studied. They were divided into 2 subgroups according to the occurrence of pain. Plasma concentrations of adrenaline, noradrenaline, cortisol, prolactin, growth hormone and dopamine were measured by radioimmunoassay, and the production of the cytokines interleukin (IL)-1, IL-2, IL-4, IL-6, tumor necrosis factor-alpha, interferon-alpha and prostaglandin E-2 by whole-blood culture. Maximal oxygen consumption was determined during an incremental treadmill test. Results: There was no change in the concentration of stress hormones, but the athletes with chronic pain showed a reduction in maximum oxygen consumption (22%) and total consumption at the anaerobic threshold (25%), as well as increased cytokine production. Increases of 2.7-, 8.1-, 1.7- and 3.7-fold were observed for IL-1, IL-2, tumor necrosis factor-alpha and interferon-alpha, respectively. Conclusions: Our data show that athletes with chronic pain have enhanced production of proinflammatory cytokines and lipid mediators and reduced performance in the ergospirometric test. Copyright (c) 2008 S. Karger AG, Basel.

Maximal inflammatory response benefits syngeneic skin graft acceptance

Objective: We investigated the influence of acute inflammation in skin isograft acceptance. Methods: Two mouse lines selected for maximal (AIR(MAX)) or minimal inflammatory response (AIR(MIN)) were transplanted with syngeneic skin. Cellular infiltrates and cytokine production were measured 1, 3, 7 or 14 days post-transplantation. The percentage of CD4(+) CD25(+) Foxp3(+) cells in the lymph nodes was also evaluated. Results: Grafts were totally accepted in 100% of AIR(MAX) and in 26% of AIR(MIN) mice. In the latter, partial acceptance was observed in 74% of the animals. Emigrated cells were basically PMN and were enhanced in AIR(MAX) transplants. IL-10 production by graft infiltrating cells showed no interline differences. IFN-gamma was increased in AIR(MIN) grafts at day 14 and lower percentages of CD4(+)CD25(+)Foxp3(+) cells in the lymph nodes were observed in these mice. Conclusions: Our data suggest that differences in graft acceptance might be due to a lack of appropriate regulation of the inflammatory response in AIR(MIN) mice compromising the self/non-self recognition.

Cyclic Maximal Ideals of Rings of Differential Operators over Power Series Rings

In [3], Bratti and Takagi conjectured that a first order differential operator S=11 +...+ nn+ with 1,..., n, {x1,..., xn} does not generate a cyclic maximal left (or right) ideal of the ring of differential operators. This is contrary to the case of the Weyl algebra, i.e., the ring of differential operators over the polynomial ring [x1,..., xn]. In this case, we know that such cyclic maximal ideals do exist. In this article, we prove several special cases of the conjecture of Bratti and Takagi.

PARALLEL ALGORITHMS FOR MAXIMAL CLIQUES IN CIRCLE GRAPHS AND UNRESTRICTED DEPTH SEARCH

We present parallel algorithms on the BSP/CGM model, with p processors, to count and generate all the maximal cliques of a circle graph with n vertices and m edges. To count the number of all the maximal cliques, without actually generating them, our algorithm requires O(log p) communication rounds with O(nm/p) local computation time. We also present an algorithm to generate the first maximal clique in O(log p) communication rounds with O(nm/p) local computation, and to generate each one of the subsequent maximal cliques this algorithm requires O(log p) communication rounds with O(m/p) local computation. The maximal cliques generation algorithm is based on generating all maximal paths in a directed acyclic graph, and we present an algorithm for this problem that uses O(log p) communication rounds with O(m/p) local computation for each maximal path. We also show that the presented algorithms can be extended to the CREW PRAM model.

The C(K, X) spaces for compact metric spaces K and X with a uniformly convex maximal factor

In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.

Towards a maximal extension of Pelczynski`s decomposition method in Banach spaces

l Suppose that X, Y. A and B are Banach spaces such that X is isomorphic to Y E) A and Y is isomorphic to X circle plus B. Are X and Y necessarily isomorphic? In this generality. the answer is no, as proved by W.T. Cowers in 1996. In the present paper, we provide a very simple necessary and sufficient condition on the 10-tuples (k, l, m, n. p, q, r, s, u, v) in N with p+q+u >= 3, r+s+v >= 3, uv >= 1, (p,q)$(0,0), (r,s)not equal(0,0) and u=1 or v=1 or (p. q) = (1, 0) or (r, s) = (0, 1), which guarantees that X is isomorphic to Y whenever these Banach spaces satisfy X(u) similar to X(p)circle plus Y(q), Y(u) similar to X(r)circle plus Y(s), and A(k) circle plus B(l) similar to A(m) circle plus B(n). Namely, delta = +/- 1 or lozenge not equal 0, gcd(lozenge, delta (p + q - u)) divides p + q - u and gcd(lozenge, delta(r + s - v)) divides r + s - v, where 3 = k - I - in + n is the characteristic number of the 4-tuple (k, l, m, n) and lozenge = (p - u)(s - v) - rq is the discriminant of the 6-tuple (p, q, r, s, U, v). We conjecture that this result is in some sense a maximal extension of the classical Pelczynski`s decomposition method in Banach spaces: the case (1, 0. 1, 0, 2. 0, 0, 2. 1. 1). (C) 2009 Elsevier Inc. All rights reserved.

On Groups Whose Maximal Cyclic Subgroups Are Maximal

We consider the problem of classifying those groups whose maximal cyclic subgroups are maximal. We give a complete classification of those groups with this property and which are either soluble or residually finite.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.