6 resultados para Gegenbauer’s Polynomial

em Universidad de Alicante


Relevância:

10.00% 10.00%

Publicador:

Resumo:

El presente estudio describe la comunidad de macroalgas epizóicas de Pinctada mazatlanica y la compara con la del substrato rocoso. Colectamos un total de 36 muestras de la comunidad de macroalgas, 18 muestras sobre ostras y otras tantas sobre substrato rocoso en la Península San Juan Nepomuceno, bahía de La Paz, México. Las algas fueron colectadas mediante buceo SCUBA raspando las distintas superficies (25 cm2 de substrato rocoso). El tamaño de muestra fue ajustado por curva de acumulación de especies y expresado con un modelo polinomial. Comparamos las comunidades de algas con análisis multivariantes de similitud basados en el índice de Bray-Curtis, entre substratos, diferentes alturas de ostras perleras y profundidades. Encontramos 27 especies de algas epizóicas (15.4% Clorophyta, 3.8% Phaeophyta y 80.8% Rhodophyta) con una disimilitud de 71.16% con respecto al substrato rocoso. El dendrograma mostró tres agrupaciones de macroalgas en P. mazatlanica. El primero caracterizado por Chondria, Jania, Herposiphonia tenella y Gracilaria. El segundo compuesto por Jania, Polysiphonia acuminata, P. decusata y Spyridia filamentosa. El tercero constituido por Polysiphonia sp., Jania, Herposiphonia tenella, Ceramium canouii y Amphiroa sp. Estas agrupaciones y los talos filamentosos de las algas epizóicas corresponden a estados iniciales de sucesión.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

We propose a public key cryptosystem based on block upper triangular matrices. This system is a variant of the Discrete Logarithm Problem with elements in a finite group, capable of increasing the difficulty of the problem while maintaining the key size. We also propose a key exchange protocol that guarantees that both parties share a secret element of this group and a digital signature scheme that provides data authenticity and integrity.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

This paper presents a method to interpolate a periodic band-limited signal from its samples lying at nonuniform positions in a regular grid, which is based on the FFT and has the same complexity order as this last algorithm. This kind of interpolation is usually termed “the missing samples problem” in the literature, and there exists a wide variety of iterative and direct methods for its solution. The one presented in this paper is a direct method that exploits the properties of the so-called erasure polynomial and provides a significant improvement on the most efficient method in the literature, which seems to be the burst error recovery (BER) technique of Marvasti’s The paper includes numerical assessments of the method’s stability and complexity.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper, it is showed that, given an integer number n ≥ 2, each zero of an exponential polynomial of the form w1az1+w2az2+⋯+wnazn, with non-null complex numbers w 1,w 2,…,w n and a 1,a 2,…,a n , produces analytic solutions of the functional equation w 1 f(a 1 z) + w 2 f(a 2 z) + ... + w n f(a n z) = 0 on certain domains of C, which represents an extension of some existing results in the literature on this functional equation for the case of positive coefficients a j and w j.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

A new classification of microtidal sand and gravel beaches with very different morphologies is presented below. In 557 studied transects, 14 variables were used. Among the variables to be emphasized is the depth of the Posidonia oceanica. The classification was performed for 9 types of beaches: Type 1: Sand and gravel beaches, Type 2: Sand and gravel separated beaches, Type 3: Gravel and sand beaches, Type 4: Gravel and sand separated beaches, Type 5: Pure gravel beaches, Type 6: Open sand beaches, Type 7: Supported sand beaches, Type 8: Bisupported sand beaches and Type 9: Enclosed beaches. For the classification, several tools were used: discriminant analysis, neural networks and Support Vector Machines (SVM), the results were then compared. As there is no theory for deciding which is the most convenient neural network architecture to deal with a particular data set, an experimental study was performed with different numbers of neuron in the hidden layer. Finally, an architecture with 30 neurons was chosen. Different kernels were employed for SVM (Linear, Polynomial, Radial basis function and Sigmoid). The results obtained for the discriminant analysis were not as good as those obtained for the other two methods (ANN and SVM) which showed similar success.

Relevância:

10.00% 10.00%

Publicador:

Resumo:

In this paper we provide the proof of a practical point-wise characterization of the set RP defined by the closure set of the real projections of the zeros of an exponential polynomial P(z) = Σn j=1 cjewjz with real frequencies wj linearly independent over the rationals. As a consequence, we give a complete description of the set RP and prove its invariance with respect to the moduli of the c′ js, which allows us to determine exactly the gaps of RP and the extremes of the critical interval of P(z) by solving inequations with positive real numbers. Finally, we analyse the converse of this result of invariance.