نتایج جستجو برای: generating families
تعداد نتایج: 227496 فیلتر نتایج به سال:
A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT). For 35 years the split-radix algorithm held the record by requiring just 4n log2 n−6n+8 arithmetic operations on real numbers for a size-n DFT, and was widely believed to be the best possible. Re...
GenVoca is a methodology and technology for generating product-lines, building variants of the same program. The primitive components from which applications are constructed are refinements or layers, which are modules that implement a feature that many programs of a product-line can share. Unlike conventional components (e.g., COM, CORBA, EJB), a layer encapsulates fragments of multiple classe...
This is an expository paper devoted to the Morse index of Chaperon’s generating families of Hamiltonian diffeomorphisms. After reviewing the construction of such generating families, we present Bott’s iteration theory in this setting: we study how the Morse index of a critical point corresponding to an iterated periodic orbit depends on the order of iteration of the orbit. We also investigate t...
Abstract Under suitable conditions on a family ( I t )) ≥ 0 of Lipschitz mappings complete metric space, we show that, up to subsequence, the strong limit $S(t):=\lim _{n\to \infty }(I(t 2^{-n}))^{2^{n}}$ S(t):=<mml:...
The ability to build accurate protein families is a fundamental operation in bioinformatics that influences comparative analyses, genome annotation, and metabolic modeling. For several years we have been maintaining protein families for all microbial genomes in the PATRIC database (Pathosystems Resource Integration Center, patricbrc.org) in order to drive many of the comparative analysis tools ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید