96 resultados para minimal spanning tree
Resumo:
Recent experiments using Terawatt lasers to accelerate protons deposited on thin wire targets are modeled with a new type of gridless plasma simulation code. In contrast to conventional mesh-based methods, this technique offers a unique capability in emulating the complex geometry and open-ended boundary conditions characteristic of contemporary experimental conditions. Comparisons of ion acceleration are made between the tree code and standard particle-in-cell simulations for a typical collisionless
Resumo:
Erythrocytosis arises from a variety of pathogenic mechanisms. We sequenced a 256-bp region 3' to the erythropoietin (Epo) gene which included a 24- to 50-bp minimal hypoxia-responsive element spanning HIF-1- and HNF-4-binding sites in 12 patients with erythrocytosis and 4 normal subjects. Four polymorphisms were found, none of which affected the HIF-1-binding site, although one polymorphism was present in the HNF-4 consensus region. The data indicate that none of these polymorphisms cause erythrocytosis.
Resumo:
Adaptive Multiple-Input Multiple-Output (MIMO) systems achieve a much higher information rate than conventional fixed schemes due to their ability to adapt their configurations according to the wireless communications environment. However, current adaptive MIMO detection schemes exhibit either low performance (and hence low spectral efficiency) or huge computational
complexity. In particular, whilst deterministic Sphere Decoder (SD) detection schemes are well established for static MIMO systems, exhibiting deterministic parallel structure, low computational complexity and quasi-ML detection performance, there are no corresponding adaptive schemes. This paper solves
this problem, describing a hybrid tree based adaptive modulation detection scheme. Fixed Complexity Sphere Decoding (FSD) and Real-Values FSD (RFSD) are modified and combined into a hybrid scheme exploited at low and medium SNR to provide the highest possible information rate with quasi-ML Bit Error
Rate (BER) performance, while Reduced Complexity RFSD, BChase and Decision Feedback (DFE) schemes are exploited in the high SNR regions. This algorithm provides the facility to balance the detection complexity with BER performance with compatible information rate in dynamic, adaptive MIMO communications
environments.
Resumo:
We study the question on whether the famous Golod–Shafarevich estimate, which gives a lower bound for the Hilbert series of a (noncommutative) algebra, is attained. This question was considered by Anick in his 1983 paper ‘Generic algebras and CW-complexes’, Princeton Univ. Press, where he proved that the estimate is attained for the number of quadratic relations $d\leq n^2/4$
and $d\geq n^2/2$, and conjectured that it is the case for any number of quadratic relations. The particular point where the number of relations is equal to $n(n-1)/2$ was addressed by Vershik. He conjectured that a generic algebra with this number of relations is finite dimensional. We announce here the result that over any infinite field, the Anick conjecture holds for $d \geq 4(n2+n)/9$ and an arbitrary number of generators. We also discuss the result that confirms the Vershik conjecture over any field of characteristic 0, and a series of related
asymptotic results.
Resumo:
A quadratic semigroup algebra is an algebra over a field given by the generators x_1, . . . , x_n and a finite set of quadratic relations each of which either has the shape x_j x_k = 0 or the shape x_j x_k = x_l x_m . We prove that a quadratic semigroup algebra given by n generators and d=(n^2+n)/4 relations is always infinite dimensional. This strengthens the Golod–Shafarevich estimate for the above class of algebras. Our main result however is that for every n, there is a finite dimensional quadratic semigroup algebra with n generators and d_n relations, where d_n is the first integer greater than (n^2+n)/4 . That is, the above Golod–Shafarevich-type estimate for semigroup algebras is sharp.
Resumo:
The prediction and management of ecosystem responses to global environmental change would profit from a clearer understanding of the mechanisms determining the structure and dynamics of ecological communities. The analytic theory presented here develops a causally closed picture for the mechanisms controlling community and population size structure, in particular community size spectra, and their dynamic responses to perturbations, with emphasis on marine ecosystems. Important implications are summarised in non-technical form. These include the identification of three different responses of community size spectra to size-specific pressures (of which one is the classical trophic cascade), an explanation for the observed slow recovery of fish communities from exploitation, and clarification of the mechanism controlling predation mortality rates. The theory builds on a community model that describes trophic interactions among size-structured populations and explicitly represents the full life cycles of species. An approximate time-dependent analytic solution of the model is obtained by coarse graining over maturation body sizes to obtain a simple description of the model steady state, linearising near the steady state, and then eliminating intraspecific size structure by means of the quasi-neutral approximation. The result is a convolution equation for trophic interactions among species of different maturation body sizes, which is solved analytically using a novel technique based on a multiscale expansion.