995 resultados para Generalized Fibonacci sequence
Resumo:
We calculate the Green functions of the two versions of the generalized Schwinger model, the anomalous and the nonanomalous one, in their higher order Lagrangian density form. Furthermore, it is shown through a sequence of transformations that the bosonized Lagrangian density is equivalent to the former, at least for the bosonic correlation functions. The introduction of the sources from the beginning, leading to a gauge-invariant source term, is also considered. It is verified that the two models have the same correlation functions only if the gauge-invariant sector is taken into account. Finally, there is presented a generalization of the Wess-Zumino term, and its physical consequences are studied, in particular the appearance of gauge-dependent massive excitations.
Resumo:
in this paper, we derive an explicit expression for the parameter sequences of a chain sequence in terms of the corresponding orthogonal polynomials and their associated polynomials. We use this to study the orthogonal polynomials K-n((lambda.,M,k)) associated with the probability measure dphi(lambda,M,k;x), which is the Gegenbauer measure of parameter lambda + 1 with two additional mass points at +/-k. When k = 1 we obtain information on the polynomials K-n((lambda.,M)) which are the symmetric Koornwinder polynomials. Monotonicity properties of the zeros of K-n((lambda,M,k)) in relation to M and k are also given. (C) 2002 Elsevier B.V. B.V. All rights reserved.
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:
Studies using quantitative neuroimaging have shown subtle abnormalities in patients with idiopathic generalized epilepsy (IGE). These findings have several locations, but the midline parasagittal structures are most commonly implicated. The cingulate cortex is related and may be involved. The objective of the current investigation was to perform a comprehensive analysis of the cingulate cortex using multiple quantitative structural neuroimaging techniques. Thirty-two patients (18 women, 30 ± 10 years) and 36 controls (18 women, 32 ± 11 years) were imaged by 3 Tesla magnetic resonance imaging (MRI). A volumetric three-dimensional (3D) sequence was acquired and used for this investigation. Regions-of-interest were selected and voxel-based morphometry (VBM) analyses compared the cingulate cortex of the two groups using Statistical Parametric Mapping (SPM8) and VBM8 software. Cortical analyses of the cingulate gyrus was performed using Freesurfer. Images were submitted to automatic processing using built-in routines and recommendations. Structural parameters were extracted for individual analyses, and comparisons between groups were restricted to the cingulate gyrus. Finally, shape analyses was performed on the anterior rostral, anterior caudal, posterior, and isthmus cingulate using spherical harmonic description (SPHARM). VBM analyses of cingulate gyrus showed areas of gray matter atrophy, mainly in the anterior cingulate gyrus (972 mm(3) ) and the isthmus (168 mm(3) ). Individual analyses of the cingulate cortex were similar between patients with IGE and controls. Surface-based comparisons revealed abnormalities located mainly in the posterior cingulate cortex (718.12 mm(2) ). Shape analyses demonstrated a predominance of anterior and posterior cingulate abnormalities. This study suggests that patients with IGE have structural abnormalities in the cingulate gyrus mainly localized at the anterior and posterior portions. This finding is subtle and variable among patients.
Resumo:
The multiple-instance learning (MIL) model has been successful in areas such as drug discovery and content-based image-retrieval. Recently, this model was generalized and a corresponding kernel was introduced to learn generalized MIL concepts with a support vector machine. While this kernel enjoyed empirical success, it has limitations in its representation. We extend this kernel by enriching its representation and empirically evaluate our new kernel on data from content-based image retrieval, biological sequence analysis, and drug discovery. We found that our new kernel generalized noticeably better than the old one in content-based image retrieval and biological sequence analysis and was slightly better or even with the old kernel in the other applications, showing that an SVM using this kernel does not overfit despite its richer representation.
Resumo:
Abstract Background One of the least common types of alternative splicing is the complete retention of an intron in a mature transcript. Intron retention (IR) is believed to be the result of intron, rather than exon, definition associated with failure of the recognition of weak splice sites flanking short introns. Although studies on individual retained introns have been published, few systematic surveys of large amounts of data have been conducted on the mechanisms that lead to IR. Results TTo understand how sequence features are associated with or control IR, and to produce a generalized model that could reveal previously unknown signals that regulate this type of alternative splicing, we partitioned intron retention events observed in human cDNAs into two groups based on the relative abundance of both isoforms and compared relevant features. We found that a higher frequency of IR in human is associated with individual introns that have weaker splice sites, genes with shorter intron lengths, higher expression levels and lower density of both a set of exon splicing silencers (ESSs) and the intronic splicing enhancer GGG. Both groups of retained introns presented events conserved in mouse, in which the retained introns were also short and presented weaker splice sites. Conclusion Although our results confirmed that weaker splice sites are associated with IR, they showed that this feature alone cannot explain a non-negligible fraction of events. Our analysis suggests that cis-regulatory elements are likely to play a crucial role in regulating IR and also reveals previously unknown features that seem to influence its occurrence. These results highlight the importance of considering the interplay among these features in the regulation of the relative frequency of IR.
Resumo:
A recent development of the Markov chain Monte Carlo (MCMC) technique is the emergence of MCMC samplers that allow transitions between different models. Such samplers make possible a range of computational tasks involving models, including model selection, model evaluation, model averaging and hypothesis testing. An example of this type of sampler is the reversible jump MCMC sampler, which is a generalization of the Metropolis-Hastings algorithm. Here, we present a new MCMC sampler of this type. The new sampler is a generalization of the Gibbs sampler, but somewhat surprisingly, it also turns out to encompass as particular cases all of the well-known MCMC samplers, including those of Metropolis, Barker, and Hastings. Moreover, the new sampler generalizes the reversible jump MCMC. It therefore appears to be a very general framework for MCMC sampling. This paper describes the new sampler and illustrates its use in three applications in Computational Biology, specifically determination of consensus sequences, phylogenetic inference and delineation of isochores via multiple change-point analysis.
Resumo:
Eukaryotic genomes display segmental patterns of variation in various properties, including GC content and degree of evolutionary conservation. DNA segmentation algorithms are aimed at identifying statistically significant boundaries between such segments. Such algorithms may provide a means of discovering new classes of functional elements in eukaryotic genomes. This paper presents a model and an algorithm for Bayesian DNA segmentation and considers the feasibility of using it to segment whole eukaryotic genomes. The algorithm is tested on a range of simulated and real DNA sequences, and the following conclusions are drawn. Firstly, the algorithm correctly identifies non-segmented sequence, and can thus be used to reject the null hypothesis of uniformity in the property of interest. Secondly, estimates of the number and locations of change-points produced by the algorithm are robust to variations in algorithm parameters and initial starting conditions and correspond to real features in the data. Thirdly, the algorithm is successfully used to segment human chromosome 1 according to GC content, thus demonstrating the feasibility of Bayesian segmentation of eukaryotic genomes. The software described in this paper is available from the author's website (www.uq.edu.au/similar to uqjkeith/) or upon request to the author.
Resumo:
Асен Божилов, Недялко Ненов - Нека G е n-върхов граф и редицата от степените на върховете му е d1, d2, . . . , dn, а V(G) е множеството от върховете на G. Степента на върха v бележим с d(v). Най-малкото естествено число r, за което V(G) има r-разлагане V(G) = V1 ∪ V2 ∪ · · · ∪ Vr, Vi ∩ Vj = ∅, , i 6 = j такова, че d(v) ≤ n − |Vi|, ∀v ∈ Vi, i = 1, 2, . . . , r е означено с ϕ(G). В тази работа доказваме неравенството ...
Resumo:
2010 Mathematics Subject Classification: 62F12, 62M05, 62M09, 62M10, 60G42.
Resumo:
MSC 2010: 11B83, 05A19, 33C45