Spacelike maximal surfaces in 3D Lorentz-Minkowski space

We investigate spacelike maximal surfaces in 3-dimensional Lorentz-Minkowski space, give an Enneper-Weierstrass representation of such surfaces and classify those with a Lorentzian or Euclidian rotation symmetry.

On the maximal connected component of hypercube with faulty vertices

In evaluating an interconnection network, it is indispensable to estimate the size of the maximal connected components of the underlying graph when the network begins to lose processors. Hypercube is one of the most popular interconnection networks. This article addresses the maximal connected components of an n -dimensional cube with faulty processors. We first prove that an n -cube with a set F of at most 2n - 3 failing processors has a component of size greater than or equal to2(n) - \F\ - 1. We then prove that an n -cube with a set F of at most 3n - 6 missing processors has a component of size greater than or equal to2(n) - \F\ - 2.

On the maximal connected component of hypercube with faulty vertices (II)

evaluating the fault tolerance of an interconnection network, it is essential to estimate the size of a maximal connected component of the network at the presence of faulty processors. Hypercube is one of the most popular interconnection networks. In this paper, we prove that for ngreater than or equal to6, an n-dimensional cube with a set F of at most (4n-10) failing processors has a component of size greater than or equal to2"-\F-3. This result demonstrates the superiority of hypercube in terms of the fault tolerance.

On the maximal connected component of a hypercube with faulty vertices III

Hypercube is one of the most popular topologies for connecting processors in multicomputer systems. In this paper we address the maximum order of a connected component in a faulty cube. The results established include several known conclusions as special cases. We conclude that the hypercube structure is resilient as it includes a large connected component in the presence of large number of faulty vertices.

Exposure to parabens at the concentration of maximal proliferative response increases migratory and invasive activity of human breast cancer cells in vitro

Alkyl esters of p–hydroxybenzoic acid (parabens) are widely used as preservatives in personal care products, foods and pharmaceuticals. Their oestrogenic activity, their measurement in human breast tissue and their ability to drive proliferation of oestrogen-responsive human breast cancer cells has opened a debate on their potential to influence breast cancer development. Since proliferation is not the only hallmark of cancer cells, we have investigated the effects of exposure to parabens at concentrations of maximal proliferative response on migratory and invasive properties using three oestrogen-responsive human breast cancer cell lines (MCF-7, T-47-D, ZR-75-1). Cells were maintained short-term (1 week) or long-term (20±2 weeks) in phenol-red-free medium containing 5% charcoal-stripped serum with no addition, 10-8M 17-oestradiol, 1-5x10-4M methylparaben, 10-5M n-propylparaben or 10-5M n-butylparaben. Long-term exposure (20±2 weeks) of MCF-7 cells to methylparaben, n-propylparaben or n-butylparaben increased migration as measured using a scratch assay, time-lapse microscopy and xCELLigence technology: invasive properties were found to increase in matrix degradation assays and migration through matrigel on xCELLigence. Western immunoblotting showed an associated downregulation of E-cadherin and -catenin in the long-term paraben-exposed cells which could be consistent with a mechanism involving epithelial to mesenchymal transition. Increased migratory activity was demonstrated also in long-term paraben-exposed T-47-D and ZR-75-1 cells using a scratch assay and time-lapse microscopy. This is the first report that in vitro, parabens can influence not only proliferation but also migratory and invasive properties of human breast cancer cells.

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.

Approximation algorithms and hardness results for the clique packing problem

For a fixed family F of graphs, an F-packing in a graph G is a set of pairwise vertex-disjoint subgraphs of G, each isomorphic to an element of F. Finding an F-packing that maximizes the number of covered edges is a natural generalization of the maximum matching problem, which is just F = {K(2)}. In this paper we provide new approximation algorithms and hardness results for the K(r)-packing problem where K(r) = {K(2), K(3,) . . . , K(r)}. We show that already for r = 3 the K(r)-packing problem is APX-complete, and, in fact, we show that it remains so even for graphs with maximum degree 4. On the positive side, we give an approximation algorithm with approximation ratio at most 2 for every fixed r. For r = 3, 4, 5 we obtain better approximations. For r = 3 we obtain a simple 3/2-approximation, achieving a known ratio that follows from a more involved algorithm of Halldorsson. For r = 4, we obtain a (3/2 + epsilon)-approximation, and for r = 5 we obtain a (25/14 + epsilon)-approximation. (C) 2008 Elsevier B.V. All rights reserved.

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.