A simulation algorithm for a single server retrial queuing system with batch arrivals
Many systems of real word are modeled by retrial queuing system with batch arrivals. Analytical formulas for this class of systems are complicated and address only particular cases.
Florea Ion, Nǎnǎu Corina-Ştefania
doaj +1 more source
Some Polynomials for Complex Quadrature [PDF]
Equal-weight Chebyshev quadrature is not generally used because the nodes become complex for large n. However, interest in these schemes remains because of recent work on minimal norm quadrature as well as schemes for doing real integrals of analytic functions by complex methods.
openaire +1 more source
On the complexity of integer polynomial recursive sequences
Background. Linear recursive sequences represent the “classic'” object of combinatorial analysis. To express an arbitrary term of a linear recursive sequence, there are exact formulas of exponential type as in the case of a field of complex numbers ...
S.S. Marchenkov
doaj +1 more source
Research on Linear Complexity of Quaternary Sequences with Period 2pq [PDF]
Linear complexity is an important index for measuring the randomness properties of the sequences.Based on the theory of generalized cyclotomic,a new class of quaternary balanced generalized cyclotomic sequences with period 2pq over finite field F4 is ...
WEI Wanyin,DU Xiaoni,WANG Guohui
doaj +1 more source
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Uncurrying for Innermost Termination and Derivational Complexity [PDF]
First-order applicative term rewriting systems provide a natural framework for modeling higher-order aspects. In earlier work we introduced an uncurrying transformation which is termination preserving and reflecting. In this paper we investigate how this
Aart Middeldorp +2 more
doaj +1 more source
Computing the bound of an Ore polynomial. Applications to factorization
We develop a fast algorithm for computing the bound of an Ore polynomial over a skew field, under mild conditions. As an application, we state a criterion for deciding whether a bounded Ore polynomial is irreducible, and we discuss a factorization ...
Gomez-Torrecillas, Jose +2 more
core +1 more source
A full-Newton step feasible interior-point algorithm for P∗(κ)-LCP based on a new search direction
In this paper, we present a full-Newton step feasible interior-point algorithm for a P∗(κ) linear complementarity problem based on a new search direction.
Behrouz Kheirfam, Masoumeh Haghighi
doaj +1 more source
Fast reconstruction of feedback polynomials for synchronous scramblers in a noisy environment
As one of the key technologies of modern communication, a linear scrambler is a technique to randomize the data to be transmitted at the bit layer to improve the timing recovery and confidentiality of the transmitted data.
Yong Ding, Zhiping Huang, Jing Zhou
doaj +1 more source

