944 resultados para maximal ontological completeness
Resumo:
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.
Resumo:
Knowledge recommendation has become a promising method in supporting the clinicians decisions and improving the quality of medical services in the constantly changing clinical environment. However, current medical knowledge management systems cannot understand users requirements accurately and realize personalized recommendation. Therefore this paper proposes an ontological approach based on semiotic principles to personalized medical knowledge recommendations. In particular, healthcare domain knowledge is conceptualized and an ontology-based user profile is built. Furthermore, the personalized recommendation mechanism is illustrated.
Resumo:
Knowledge management has become a promising method in supporting the clinicians′ decisions and improving the quality of medical services in the constantly changing clinical environment. However, current medical knowledge management systems cannot understand users′ requirements accurately and realize personalized matching. Therefore this paper proposes an ontological approach based on semiotic principles to personalized medical knowledge matching. In particular, healthcare domain knowledge is conceptualized and an ontology-based user profile is built. Furthmore, the personalized matching mechanism and algorithm are illustrated.
Resumo:
This paper introduces an ontology-based knowledge model for knowledge management. This model can facilitate knowledge discovery that provides users with insight for decision making. The users requiring the insight normally play different roles with different requirements in an organisation. To meet the requirements, insights are created by purposely aggregated transnational data. This involves a semantic data integration process. In this paper, we present a knowledge management system which is capable of representing knowledge requirements in a domain context and enabling the semantic data integration through ontology modeling. The knowledge domain context of United Bible Societies is used to illustrate the features of the knowledge management capabilities.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
In testing from a Finite State Machine (FSM), the generation of test suites which guarantee full fault detection, known as complete test suites, has been a long-standing research topic. In this paper, we present conditions that are sufficient for a test suite to be complete. We demonstrate that the existing conditions are special cases of the proposed ones. An algorithm that checks whether a given test suite is complete is given. The experimental results show that the algorithm can be used for relatively large FSMs and test suites.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.
Resumo:
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.