Characterizations of the Solution Sets of Generalized Convex Minimization Problems

2000 Mathematics Subject Classification: 90C26, 90C20, 49J52, 47H05, 47J20.

Estimate for the Number of Zeros of Abelian Integrals on Elliptic Curves

2000 Mathematics Subject Classification: Primary 34C07, secondary 34C08.

An Invitation to Additive Prime Number Theory

2000 Mathematics Subject Classification: 11D75, 11D85, 11L20, 11N05, 11N35, 11N36, 11P05, 11P32, 11P55.

The Wide-Field Plate Database: Development and Access via Internet

ACM Computing Classification System (1998): J.2.

Approximate Model Checking of Real-Time Systems for Linear Duration Invariants

Real-time systems are usually modelled with timed automata and real-time requirements relating to the state durations of the system are often specifiable using Linear Duration Invariants, which is a decidable subclass of Duration Calculus formulas. Various algorithms have been developed to check timed automata or real-time automata for linear duration invariants, but each needs complicated preprocessing and exponential calculation. To the best of our knowledge, these algorithms have not been implemented. In this paper, we present an approximate model checking technique based on a genetic algorithm to check real-time automata for linear durration invariants in reasonable times. Genetic algorithm is a good optimization method when a problem needs massive computation and it works particularly well in our case because the fitness function which is derived from the linear duration invariant is linear. ACM Computing Classification System (1998): D.2.4, C.3.

Manageable Workflows for Processing Parallel Sequencing Data

ACM Computing Classification System (1998): D.2.11, D.1.3, D.3.1, J.3, C.2.4.

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

Domaine Numérique du produit AB avec A normal

2000 Mathematics Subject Classification: 18B30, 47A12.

Groups of Order 32 as Galois Groups

2000 Mathematics Subject Classification: 12F12.

Pseudodifferential Operators and Weighted Normed Symbol Spaces

2000 Mathematics Subject Classification: 35S05.

Uniform G-Convexity for Vector-Valued Lp Spaces

2000 Mathematics Subject Classification: 46B20.

On Some of Professor Peter Rusev's Contributions

MSC 2010: 33-00, 33C45, 33C52, 30C15, 30D20, 32A17, 32H02, 44A05

Subclasses of Starlike Functions of Complex Order Involving Generalized Hypergeometric Functions

MSC2010: 30C45, 33C45

Some Fixed Point Theorems for Kannan Mappings

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

On Differential Inclusions with Unbounded Right-Hand Side

2000 Mathematics Subject Classification: 58C06, 47H10, 34A60.