946 resultados para boolean polynomial
Resumo:
Let M2n+1 be a C(CPn) -singular manifold. We study functions and vector fields with isolated singularities on M2n+1. A C(CPn) -singular manifold is obtained from a smooth manifold M2n+1 with boundary in the form of a disjoint union of complex projective spaces CPn boolean OR CPn boolean OR ... boolean OR CPn with subsequent capture of a cone over each component of the boundary. Let M2n+1 be a compact C(CPn) -singular manifold with k singular points. The Euler characteristic of M2n+1 is equal to chi(M2n+1) = k(1 - n)/2. Let M2n+1 be a C(CPn)-singular manifold with singular points m(1), ..., m(k). Suppose that, on M2n+1, there exists an almost smooth vector field V (x) with finite number of zeros m(1), ..., m(k), x(1), ..., x(1). Then chi(M2n+1) = Sigma(l)(i=1) ind(x(i)) + Sigma(k)(i=1) ind(m(i)).
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Prostate cancer is a serious public health problem accounting for up to 30% of clinical tumors in men. The diagnosis of this disease is made with clinical, laboratorial and radiological exams, which may indicate the need for transrectal biopsy. Prostate biopsies are discerningly evaluated by pathologists in an attempt to determine the most appropriate conduct. This paper presents a set of techniques for identifying and quantifying regions of interest in prostatic images. Analyses were performed using multi-scale lacunarity and distinct classification methods: decision tree, support vector machine and polynomial classifier. The performance evaluation measures were based on area under the receiver operating characteristic curve (AUC). The most appropriate region for distinguishing the different tissues (normal, hyperplastic and neoplasic) was defined: the corresponding lacunarity values and a rule's model were obtained considering combinations commonly explored by specialists in clinical practice. The best discriminative values (AUC) were 0.906, 0.891 and 0.859 between neoplasic versus normal, neoplasic versus hyperplastic and hyperplastic versus normal groups, respectively. The proposed protocol offers the advantage of making the findings comprehensible to pathologists. (C) 2014 Elsevier Ltd. All rights reserved.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)
Resumo:
Let epsilon be a commutative ring with identity and P is an element of epsilon[x] be a polynomial. In the present paper we consider digit representations in the residue class ring epsilon[x]/(P). In particular, we are interested in the question whether each A is an element of epsilon[x]/(P) can be represented modulo P in the form e(0)+ e(1)x + ... + e(h)x(h), where the e(i) is an element of epsilon[x]/(P) are taken from a fixed finite set of digits. This general concept generalizes both canonical number systems and digit systems over finite fields. Due to the fact that we do not assume that 0 is an element of the digit set and that P need not be monic, several new phenomena occur in this context.
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
Beside aging process comes the incidence of dementia and, among them Alzheimer's disease (AD) accounts for approximately 60% of cases. This disease is characterized as a neuropathology with unknown etiology that causes cognitive deficits and behavioral disorders. Caring for patients with AD can cause an overload, both physical and psychological, which can cause high levels of stress on the primary caregiver. It is necessary that the caregiver also receives attention and develop activities that promote health benefits, while providing moments of distraction from the task of caring. Nonpharmacological interventions may be favorable for improving health with consequent decreased on the levels of stress. The objective of this study was to conduct a systematic review of scientific papers that aimed to verify the effect of nonpharmacological interventions on stress levels in caregivers of patients with AD. To contamplate this goal was accomplished a systematic search in the following databases: Biological Abstracts, PsycINFO, PubMed/Medline, Web of Science, LILACS and SciELO. The following keywords and Boolean operators was used: “caregivers” OR “family” and “nonpharmacological interventions” OR “support groups” OR “therapies” AND “Alzheimer's disease” OR “Alzheimer's dementia” OR “Alzheimer” OR “elderly” AND “stress”. There were found 3studies that met inclusion criteria adopted for the present work, and none showed significant results for the variable stress. It is not possible to affirm, according to the studies, that nonpharmacologial interventions programs for caregivers of patients with AD are effective to influence and to control the stress. However, studies show benefits for other variables such as self-efficacy and confidence in relation to care... (Complete abstract click electronic access below)
Resumo:
Pós-graduação em Ciência e Tecnologia Animal - FEIS
Resumo:
Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)
Resumo:
This study establishes that for a given binary BCH code C0 n of length n generated by a polynomial g(x) ∈ F2[x] of degree r there exists a family of binary cyclic codes {Cm 2m−1(n+1)n}m≥1 such that for each m ≥ 1, the binary cyclic code Cm 2m−1(n+1)n has length 2m−1(n + 1)n and is generated by a generalized polynomial g(x 1 2m ) ∈ F2[x, 1 2m Z≥0] of degree 2mr. Furthermore, C0 n is embedded in Cm 2m−1(n+1)n and Cm 2m−1(n+1)n is embedded in Cm+1 2m(n+1)n for each m ≥ 1. By a newly proposed algorithm, codewords of the binary BCH code C0 n can be transmitted with high code rate and decoded by the decoder of any member of the family {Cm 2m−1(n+1)n}m≥1 of binary cyclic codes, having the same code rate.
Resumo:
In this note we show that the roots of a polynomial are C∞ depend of the coefficients. The main tool to show this is the Implicit Function Theorem.
Resumo:
A Goppa code is described in terms of a polynomial, known as Goppa polynomial, and in contrast to cyclic codes, where it is difficult to estimate the minimum Hamming distance d from the generator polynomial. Furthermore, a Goppa code has the property that d ≥ deg(h(X))+1, where h(X) is a Goppa polynomial. In this paper, we present a decoding principle for Goppa codes constructed by generalized polynomials, which is based on modified Berlekamp-Massey algorithm.