Browsing by Keywords "Polynomials"
Now showing items 1-20 of 27
-
Comparison of surface-modeling techniques
(IEEE, 1997-07)Solution techniques based on surface integral equations are widely used in computational electromagnetics. The accurate surface models increase the accuracy solutions by using exact and flat-triangulation models for a ... -
Composite regions of feasibility for certain classes of distance constrained network location problems
(INFORMS, 1996)Distance constrained network location involves locating m new facilities on a transport network G so as to satisfy upper bounds on distances between pairs of new facilities and pairs of new and existing facilities. The ... -
Compound poisson disorder problems with nonlinear detection delay penalty cost functions
(2010)The quickest detection of the unknown and unobservable disorder time, when the arrival rate and mark distribution of a compound Poisson process suddenly changes, is formulated in a Bayesian setting, where the detection ... -
Constructing convex directions for stable polynomials
(IEEE, 2000)The constructions of convex directions based on phase-derivative interpretations were obtained for Hurwitz-stable polynomials. The phase-derivative conditions were based on the sensitivity of root-locus associated with the ... -
Customer order scheduling on a single machine with family setup times: complexity and algorithms
(Elsevier, 2007)We consider a situation where C customers each order various quantities (possibly zero in some cases) of products from P different families, which can be produced on a continuously available machine in any sequence (requiring ... -
Efficient evaluation of spatial-domain MoM matrix entries in the analysis of planar stratified geometries
(IEEE, 2000)An efficient hybrid method for evaluation of spatial-domain method-of-moments (MoM) matrix entries is presented in this paper. It has already been demonstrated that the introduction of the closed-form Green's functions ... -
Exact expression and tight bound on pairwise error probability for performance analysis of turbo codes over Nakagami-m fading channels
(IEEE, 2007)This letter presents derivation for an exact and efficient expression on pairwise error probability over fully interleaved Nakagami-m fading channels under ideal channel state information at the decoder. As an outcome, ... -
Fibre products of superelliptic curves and codes therefrom
(IEEE, 1997)A method of constructing long geometric Goppa codes coming from fiber products of superelliptic curves is presented. A family of smooth projective curves with a lot of Fq-rational points are needed to produce a family of ... -
A general theory on spectral properties of state-homogeneous finite-state quasi-birth-death processes
(Elsevier, 2001)In this paper a spectral theory pertaining to Quasi-Birth–Death Processes (QBDs) is presented. The QBD, which is a generalization of the birth–death process, is a powerful tool that can be utilized in modeling many stochastic ... -
A gPC-based approach to uncertain transonic aerodynamics
(2010)The present paper focus on the stochastic response of a two-dimensional transonic airfoil to parametric uncertainties. Both the freestream Mach number and the angle of attack are considered as random parameters and the ... -
Interframe differential vector coding of line spectrum frequencies
(IEEE, 1993-04)Line Spectrum Frequencies (LSF's) uniquely represent the Linear Predictive Coding (LPC) filter of a speech frame. In many vocoders LSF's are used to encode the LPC parameters. In this paper, an interframe differential ... -
A joint production and transportation planning problem with heterogeneous vehicles
(2014)We consider a manufacturer's planning problem to schedule order production and transportation to respective destinations. The manufacturer in this setting can use two vehicle types for outbound shipments. The first type ... -
Local convex directions for Hurwitz stable polynomials
(IEEE, 2002)A new condition for a polynomial p(s) to be a local convex direction for a Hurwitz stable polynomial q(s) is derived. The condition is in terms of polynomials associated with the even and odd parts of p(s) and q(s), and ... -
Matrix-geometric solutions of M/G/1-type Markov chains: A unifying generalized state-space approach
(1998)In this paper, we present an algorithmic approach to find the stationary probability distribution of M/G/1-type Markov chains which arise frequently in performance analysis of computer and communication networ ks. The ... -
A model-based scheme for anticontrol of some chaotic systems
(World Scientific Publishing, 2003)We consider a model-based approach for the anticontrol of some continuous time systems. We assume the existence of a chaotic model in an appropriate form. By using a suitable input, we match the dynamics of the controlled ... -
Network-aware virtual machine placement in cloud data centers with multiple traffic-intensive components
(Elsevier BV, 2015)Following a shift from computing as a purchasable product to computing as a deliverable service to consumers over the Internet, cloud computing has emerged as a novel paradigm with an unprecedented success in turning utility ... -
Non-local, non-commutative picture in quantum mechanics and distinguished continuous canonical maps
(IOP Science, 2002)It is shown that continuous classical nonlinear canonical (Poisson) maps have a distinguished role in quantum mechanics. They act unitarily on the quantum phase space and generate h-independent quantum nonlinear canonical ... -
On algebraic properties of general proper decentralized systems
(Elsevier, 1993)The new concepts of the decentralized output feedback variable polynomial, the decentralized output feedback cycle index of general proper systems, and the geometric multiplicities of decentralized fixed modes are introduced. ... -
On the analyticity of functions approximated by their q-Bernstein polynomials when q > 1
(2010)Since in the case q > 1 the q-Bernstein polynomials Bn,q are not positive linear operators on C[0, 1], the investigation of their convergence properties for q > 1 turns out to be much harder than the one for 0 < ... -
On the Lagrange interpolation in multilevel fast multipole algorithm
(IEEE, 2006)We consider the Lagrange interpolation employed in the multilevel fast multipole algorithm (MLFMA) as part of our efforts to obtain faster and more efficient solutions for large problems of computational electromagnetics. ...
