914 resultados para Triangle Number


Relevância:

20.00% 20.00%

Publicador:

Resumo:

Traditionally comparative cytogenetic studies are based mainly on banding patterns. Nevertheless, when dealing with species with highly rearranged genomes, as in Akodon species, or with other highly divergent species, cytogenetic comparisons of banding patterns prove inadequate. Hence, comparative chromosome painting has become the method of choice for genome comparisons at the cytogenetic level since it allows complete chromosome probes of a species to be hybridized in situ onto chromosomes of other species, detecting homologous genomic regions between them. In the present study, we have explored the highly rearranged complements of the Akodon species using reciprocal chromosome painting through species-specific chromosome probes obtained by chromosome sorting. The results revealed complete homology among the complements of Akodon sp. n. (ASP), 2n = 10; Akodon cursor (ACU), 2n = 15; Akodon montensis (AMO), 2n = 24; and Akodon paranaensis (APA), 2n = 44, and extensive chromosome rearrangements have been detected within the species with high precision. Robertsonian and tandem rearrangements, pericentric inversions and/or centromere repositioning, paracentric inversion, translocations, insertions, and breakpoints, where chromosomal rearrangements, seen to be favorable, were observed. Chromosome painting using the APA set of 21 autosomes plus X and Y revealed eight syntenic segments that are shared with A. montensis, A. cursor, and ASP, and one syntenic segment shared by A. montensis and A. cursor plus five exclusive chromosome associations for A. cursor and six for ASP chromosome X, except for the heterochromatin region of ASP X, and even chromosome Y shared complete homology among the species. These data indicate that all those closely related species have experienced a recent extensive process of autosomal rearrangement in which, except for ASP, there is still complete conservation of sex chromosomes homologies.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The numbers of culturable diazotrophic endophytic bacteria (CDEB) from roots stems and leaves of sugarcane submitted to organic inorganic or no fertilization were compared In order to determine the size of the N(2) fixing populations the Most Probable Number technique (MPN) was used The quantification of diazotrophic bacteria by using the acetylene reduction assay (ARA) was more accurate than observing the bacterial growth in the vials to confirm N(2) fixing capability the detection of gene nifH was performed on a sample of 105 Isolated bacteria The production of extracellular enzymes involved in the penetration of the plants by the bacteria was also studied The results showed that organic fertilization enhances the number of CDEB when compared with conventional fertilization used throughout the growing season The maximum number of bacteria was detected in the roots Roots and stems presented the greatest number of CDEB in the middle of the cropping season and in leaves numbers varied according to the treatment Using two pairs of primers and two different methods the nifH gene was found in 104 of the 105 tested isolates Larger amounts of pectinase were released by isolates from sugarcane treated with conventional fertilizers (66%) whereas larger amounts of cellulase were released by strains isolated from sugarcane treated with organic fertilizers (80%) (C) 2010 Elsevier Masson SAS All rights reserved

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we consider some non-homogeneous Poisson models to estimate the probability that an air quality standard is exceeded a given number of times in a time interval of interest. We assume that the number of exceedances occurs according to a non-homogeneous Poisson process (NHPP). This Poisson process has rate function lambda(t), t >= 0, which depends on some parameters that must be estimated. We take into account two cases of rate functions: the Weibull and the Goel-Okumoto. We consider models with and without change-points. When the presence of change-points is assumed, we may have the presence of either one, two or three change-points, depending of the data set. The parameters of the rate functions are estimated using a Gibbs sampling algorithm. Results are applied to ozone data provided by the Mexico City monitoring network. In a first instance, we assume that there are no change-points present. Depending on the adjustment of the model, we assume the presence of either one, two or three change-points. Copyright (C) 2009 John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we consider the problem of estimating the number of times an air quality standard is exceeded in a given period of time. A non-homogeneous Poisson model is proposed to analyse this issue. The rate at which the Poisson events occur is given by a rate function lambda(t), t >= 0. This rate function also depends on some parameters that need to be estimated. Two forms of lambda(t), t >= 0 are considered. One of them is of the Weibull form and the other is of the exponentiated-Weibull form. The parameters estimation is made using a Bayesian formulation based on the Gibbs sampling algorithm. The assignation of the prior distributions for the parameters is made in two stages. In the first stage, non-informative prior distributions are considered. Using the information provided by the first stage, more informative prior distributions are used in the second one. The theoretical development is applied to data provided by the monitoring network of Mexico City. The rate function that best fit the data varies according to the region of the city and/or threshold that is considered. In some cases the best fit is the Weibull form and in other cases the best option is the exponentiated-Weibull. Copyright (C) 2007 John Wiley & Sons, Ltd.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Let (R, m) be a d-dimensional Noetherian local ring. In this work we prove that the mixed Buchsbaum-Rim multiplicity for a finite family of R-submodules of R(p) of finite colength coincides with the Buchsbaum-Rim multiplicity of the module generated by a suitable superficial sequence, that is, we generalize for modules the well-known Risler-Teissier theorem. As a consequence, we give a new proof of a generalization for modules of the fundamental Rees` mixed Multiplicity theorem, which was first proved by Kirby and Rees in (1994, [8]). We use the above result to give an upper bound for the minimal number of generators of a finite colength R-submodule of R(p) in terms of mixed multiplicities for modules, which generalize a similar bound obtained by Cruz and Verma in (2000, [5]) for m-primary ideals. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper describes the development of an implicit finite difference method for solving transient three-dimensional incompressible free surface flows. To reduce the CPU time of explicit low-Reynolds number calculations, we have combined a projection method with an implicit technique for treating the pressure on the free surface. The projection method is employed to uncouple the velocity and the pressure fields, allowing each variable to be solved separately. We employ the normal stress condition on the free surface to derive an implicit technique for calculating the pressure at the free surface. Numerical results demonstrate that this modification is essential for the construction of methods that are more stable than those provided by discretizing the free surface explicitly. In addition, we show that the proposed method can be applied to viscoelastic fluids. Numerical results include the simulation of jet buckling and extrudate swell for Reynolds numbers in the range [0.01, 0.5]. (C) 2008 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A novel mathematical framework inspired on Morse Theory for topological triangle characterization in 2D meshes is introduced that is useful for applications involving the creation of mesh models of objects whose geometry is not known a priori. The framework guarantees a precise control of topological changes introduced as a result of triangle insertion/removal operations and enables the definition of intuitive high-level operators for managing the mesh while keeping its topological integrity. An application is described in the implementation of an innovative approach for the detection of 2D objects from images that integrates the topological control enabled by geometric modeling with traditional image processing techniques. (C) 2008 Published by Elsevier B.V.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this work we investigate the dynamical Casimir effect in a nonideal cavity by deriving an effective Hamiltonian. We first compute a general expression for the average number of particle creation, applicable for any law of motion of the cavity boundary, under the only restriction of small velocities. We also compute a general expression for the linear entropy of an arbitrary state prepared in a selected mode, also applicable for any law of motion of a slow moving boundary. As an application of our results we have analyzed both the average number of particle creation and linear entropy within a particular oscillatory motion of the cavity boundary. On the basis of these expressions we develop a comprehensive analysis of the resonances in the number of particle creation in the nonideal dynamical Casimir effect. We also demonstrate the occurrence of resonances in the loss of purity of the initial state and estimate the decoherence times associated with these resonances. Since our results were obtained in the framework of the perturbation theory, they are restricted, under resonant conditions, to a short-time approximation. (C) 2009 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

A structure-dynamic approach to cortical systems is reported which is based on the number of paths and the accessibility of each node. The latter measurement is obtained by performing self-avoiding random walks in the respective networks, so as to simulate dynamics, and then calculating the entropies of the transition probabilities for walks starting from each node. Cortical networks of three species, namely cat, macaque and humans, are studied considering structural and dynamical aspects. It is verified that the human cortical network presents the highest accessibility and number of paths (in terms of z-scores). The correlation between the number of paths and accessibility is also investigated as a mean to quantify the level of independence between paths connecting pairs of nodes in cortical networks. By comparing the cortical networks of cat, macaque and humans, it is verified that the human cortical network tends to present the largest number of independent paths of length larger than four. These results suggest that the human cortical network is potentially the most resilient to brain injures. (C) 2009 Elsevier B.V. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper we consider the case of a Bose gas in low dimension in order to illustrate the applicability of a method that allows us to construct analytical relations, valid for a broad range of coupling parameters, for a function which asymptotic expansions are known. The method is well suitable to investigate the problem of stability of a collection of Bose particles trapped in one- dimensional configuration for the case where the scattering length presents a negative value. The eigenvalues for this interacting quantum one-dimensional many particle system become negative when the interactions overcome the trapping energy and, in this case, the system becomes unstable. Here we calculate the critical coupling parameter and apply for the case of Lithium atoms obtaining the critical number of particles for the limit of stability.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The Lieb-Oxford bound is a constraint upon approximate exchange-correlation functionals. We explore a nonempirical tightening of that bound in both universal and electron number-dependent form. The test functional is PBE. Regarding both atomization energies (slightly worsened) and bond lengths (slightly improved), we find the PBE functional to be remarkably insensitive to the value of the Lieb-Oxford bound. This both rationalizes the use of the original Lieb-Oxford constant in PBE and suggests that enhancement factors more sensitive to sharpened constraints await discovery.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

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.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the asymptotic properties of the number of open paths of length n in an oriented rho-percolation model. We show that this number is e(n alpha(rho)(1+o(1))) as n ->infinity. The exponent alpha is deterministic, it can be expressed in terms of the free energy of a polymer model, and it can be explicitly computed in some range of the parameters. Moreover, in a restricted range of the parameters, we even show that the number of such paths is n(-1/2)We (n alpha(rho))(1+o(1)) for some nondegenerate random variable W. We build on connections with the model of directed polymers in random environment, and we use techniques and results developed in this context.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The generalized Birnbaum-Saunders distribution pertains to a class of lifetime models including both lighter and heavier tailed distributions. This model adapts well to lifetime data, even when outliers exist, and has other good theoretical properties and application perspectives. However, statistical inference tools may not exist in closed form for this model. Hence, simulation and numerical studies are needed, which require a random number generator. Three different ways to generate observations from this model are considered here. These generators are compared by utilizing a goodness-of-fit procedure as well as their effectiveness in predicting the true parameter values by using Monte Carlo simulations. This goodness-of-fit procedure may also be used as an estimation method. The quality of this estimation method is studied here. Finally, through a real data set, the generalized and classical Birnbaum-Saunders models are compared by using this estimation method.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Denote by R(L, L, L) the minimum integer N such that any 3-coloring of the edges of the complete graph on N vertices contains a monochromatic copy of a graph L. Bondy and Erdos conjectured that when L is the cycle C(n) on n vertices, R(C(n), C(n), C(n)) = 4n - 3 for every odd n > 3. Luczak proved that if n is odd, then R(C(n), C(n), C(n)) = 4n + o(n), as n -> infinity, and Kohayakawa, Simonovits and Skokan confirmed the Bondy-Erdos conjecture for all sufficiently large values of n. Figaj and Luczak determined an asymptotic result for the `complementary` case where the cycles are even: they showed that for even n, we have R(C(n), C(n), C(n)) = 2n + o(n), as n -> infinity. In this paper, we prove that there exists n I such that for every even n >= n(1), R(C(n), C(n), C(n)) = 2n. (C) 2009 Elsevier Inc. All rights reserved.