Sturm Sequences and Modified Subresultant Polynomial Remainder Sequences

ACM Computing Classification System (1998): F.2.1, G.1.5, I.1.2.

Three New Methods for Computing Subresultant Polynomial Remainder Sequences (PRS’S)

Given the polynomials f, g ∈ Z[x] of degrees n, m, respectively, with n > m, three new, and easy to understand methods — along with the more efficient variants of the last two of them — are presented for the computation of their subresultant polynomial remainder sequence (prs). All three methods evaluate a single determinant (subresultant) of an appropriate sub-matrix of sylvester1, Sylvester’s widely known and used matrix of 1840 of dimension (m + n) × (m + n), in order to compute the correct sign of each polynomial in the sequence and — except for the second method — to force its coefficients to become subresultants. Of interest is the fact that only the first method uses pseudo remainders. The second method uses regular remainders and performs operations in Q[x], whereas the third one triangularizes sylvester2, Sylvester’s little known and hardly ever used matrix of 1853 of dimension 2n × 2n. All methods mentioned in this paper (along with their supporting functions) have been implemented in Sympy and can be downloaded from the link http://inf-server.inf.uth.gr/~akritas/publications/subresultants.py

Some Fixed Point Theorems for Kannan Mappings

2000 Mathematics Subject Classification: Primary: 47H10; Secondary: 54H25.

Polynomial automorphisms over finite fields: Mimicking tame maps by the Derksen group

2010 Mathematics Subject Classification: 14L99, 14R10, 20B27.

Space time coding for polynomial phase modulated signals

Polynomial phase modulated (PPM) signals have been shown to provide improved error rate performance with respect to conventional modulation formats under additive white Gaussian noise and fading channels in single-input single-output (SISO) communication systems. In this dissertation, systems with two and four transmit antennas using PPM signals were presented. In both cases we employed full-rate space-time block codes in order to take advantage of the multipath channel. For two transmit antennas, we used the orthogonal space-time block code (OSTBC) proposed by Alamouti and performed symbol-wise decoding by estimating the phase coefficients of the PPM signal using three different methods: maximum-likelihood (ML), sub-optimal ML (S-ML) and the high-order ambiguity function (HAF). In the case of four transmit antennas, we used the full-rate quasi-OSTBC (QOSTBC) proposed by Jafarkhani. However, in order to ensure the best error rate performance, PPM signals were selected such as to maximize the QOSTBC’s minimum coding gain distance (CGD). Since this method does not always provide a unique solution, an additional criterion known as maximum channel interference coefficient (CIC) was proposed. Through Monte Carlo simulations it was shown that by using QOSTBCs along with the properly selected PPM constellations based on the CGD and CIC criteria, full diversity in flat fading channels and thus, low BER at high signal-to-noise ratios (SNR) can be ensured. Lastly, the performance of symbol-wise decoding for QOSTBCs was evaluated. In this case a quasi zero-forcing method was used to decouple the received signal and it was shown that although this technique reduces the decoding complexity of the system, there is a penalty to be paid in terms of error rate performance at high SNRs.

Quasi-Orthogonal Space-Time Block Coding Using Polynomial Phase Modulation

Recently, polynomial phase modulation (PPM) was shown to be a power- and bandwidth-efficient modulation format. These two characteristics are in high demand nowadays specially in mobile applications, where devices with size, weight, and power (SWaP) constraints are common. In this paper, we propose implementing a full-diversity quasiorthogonal space-time block code (QOSTBC) using polynomial phase signals as modulation format. QOSTBCs along with PPM are used in order to improve the power efficiency of communication systems with four transmit antennas. We obtain the optimal PPM constellations that ensure full diversity and maximize the QOSTBC's minimum coding gain distance. Simulation results show that by using QOSTBCs along with a properly selected PPM constellation, full diversity in flat fading channels and thus low BER at high signal-to-noise ratios (SNR) can be ensured. More importantly, it is also shown that QOSTBCs using PPM achieve a better error performance than those using conventional modulation formats.

Uncertain natural frequency analysis of composite plates including effect of noise – A polynomial neural network approach

Acknowledgement SN and SS gratefully acknowledge the financial support from Lloyd’s Register Foundation Centre during this work.

Detection and Classification of Whale Acoustic Signals

This dissertation focuses on two vital challenges in relation to whale acoustic signals: detection and classification.

In detection, we evaluated the influence of the uncertain ocean environment on the spectrogram-based detector, and derived the likelihood ratio of the proposed Short Time Fourier Transform detector. Experimental results showed that the proposed detector outperforms detectors based on the spectrogram. The proposed detector is more sensitive to environmental changes because it includes phase information.

In classification, our focus is on finding a robust and sparse representation of whale vocalizations. Because whale vocalizations can be modeled as polynomial phase signals, we can represent the whale calls by their polynomial phase coefficients. In this dissertation, we used the Weyl transform to capture chirp rate information, and used a two dimensional feature set to represent whale vocalizations globally. Experimental results showed that our Weyl feature set outperforms chirplet coefficients and MFCC (Mel Frequency Cepstral Coefficients) when applied to our collected data.

Since whale vocalizations can be represented by polynomial phase coefficients, it is plausible that the signals lie on a manifold parameterized by these coefficients. We also studied the intrinsic structure of high dimensional whale data by exploiting its geometry. Experimental results showed that nonlinear mappings such as Laplacian Eigenmap and ISOMAP outperform linear mappings such as PCA and MDS, suggesting that the whale acoustic data is nonlinear.

We also explored deep learning algorithms on whale acoustic data. We built each layer as convolutions with either a PCA filter bank (PCANet) or a DCT filter bank (DCTNet). With the DCT filter bank, each layer has different a time-frequency scale representation, and from this, one can extract different physical information. Experimental results showed that our PCANet and DCTNet achieve high classification rate on the whale vocalization data set. The word error rate of the DCTNet feature is similar to the MFSC in speech recognition tasks, suggesting that the convolutional network is able to reveal acoustic content of speech signals.

A polynomial algorithm for the three-machine open shop with a bottleneck machine

Abstract not available

On the existence of right adjoints for surjective mappings between fuzzy structures0

En este trabajo los autores continúan su estudio de la caracterización de la existencia de adjunciones (conexiones de Galois isótonas) cuyo codominio no está dotado de estructura en principio. En este artículo se considera el caso difuso en el que se tiene un orden difuso R definido en un conjunto A y una aplicación sobreyectiva f:A-> B compatible respecto de dos relaciones de similaridad definidas en el dominio A y en el condominio B, respectivamente. Concretamente, el problema es encontrar un orden difuso S en B y una aplicación g:B-> A compatible también con las correspondientes similaridades definidas en A y en B, de tal forma que el par (f,g) constituya un adjunción.

Equivalent norms in polynomial spaces and applications.

In this paper, equivalence constants between various polynomial norms are calculated. As an application, we also obtain sharp values of the Hardy Littlewood constants for 2-homogeneous polynomials on l(p)(2) spaces, 2 < p <= infinity. We also provide lower estimates for the Hardy-Littlewood constants for polynomials of higher degrees.

E-polynomial of SL(2,C)-character varieties of complex curves of genus 3.

We compute the E-polynomials of the moduli spaces of representations of the fundamental group of a complex curve of genus g = 3 into SL(2, C), and also of the moduli space of twisted representations. The case of genus g = 1, 2 has already been done in [12]. We follow the geometric technique introduced in [12], based on stratifying the space of representations, and on the analysis of the behaviour of the E-polynomial under fibrations.

Weather variability, tides, and Barmah Forest Virus Disease in the Gladstone region, Australia

In this study we examined the impact of weather variability and tides on the transmission of Barmah Forest virus (BFV) disease and developed a weather-based forecasting model for BFV disease in the Gladstone region, Australia. We used seasonal autoregressive integrated moving-average (SARIMA) models to determine the contribution of weather variables to BFV transmission after the time-series data of response and explanatory variables were made stationary through seasonal differencing. We obtained data on the monthly counts of BFV cases, weather variables (e.g., mean minimum and maximum temperature, total rainfall, and mean relative humidity), high and low tides, and the population size in the Gladstone region between January 1992 and December 2001 from the Queensland Department of Health, Australian Bureau of Meteorology, Queensland Department of Transport, and Australian Bureau of Statistics, respectively. The SARIMA model shows that the 5-month moving average of minimum temperature (β = 0.15, p-value < 0.001) was statistically significantly and positively associated with BFV disease, whereas high tide in the current month (β = −1.03, p-value = 0.04) was statistically significantly and inversely associated with it. However, no significant association was found for other variables. These results may be applied to forecast the occurrence of BFV disease and to use public health resources in BFV control and prevention.

On the zeros of the Abelian integrals for a class of Liénard systems

A planar polynomial differential system has a finite number of limit cycles. However, finding the upper bound of the number of limit cycles is an open problem for the general nonlinear dynamical systems. In this paper, we investigated a class of Liénard systems of the form x'=y, y'=f(x)+y g(x) with deg f=5 and deg g=4. We proved that the related elliptic integrals of the Liénard systems have at most three zeros including multiple zeros, which implies that the number of limit cycles bifurcated from the periodic orbits of the unperturbed system is less than or equal to 3.