A conformal mapping based fractional order approach for sub-optimal tuning of PID controllers with guaranteed dominant pole placement

A novel conformal mapping based fractional order (FO) methodology is developed in this paper for tuning existing classical (Integer Order) Proportional Integral Derivative (PID) controllers especially for sluggish and oscillatory second order systems. The conventional pole placement tuning via Linear Quadratic Regulator (LQR) method is extended for open loop oscillatory systems as well. The locations of the open loop zeros of a fractional order PID (FOPID or PI^λD^μ) controller have been approximated in this paper vis-à-vis a LQR tuned conventional integer order PID controller, to achieve equivalent integer order PID control system. This approach eases the implementation of analog/digital realization of a FOPID controller with its integer order counterpart along with the advantages of fractional order controller preserved. It is shown here in the paper that decrease in the integro-differential operators of the FOPID/PI^λD^μ controller pushes the open loop zeros of the equivalent PID controller towards greater damping regions which gives a trajectory of the controller zeros and dominant closed loop poles. This trajectory is termed as “M-curve”. This phenomena is used to design a two-stage tuning algorithm which reduces the existing PID controller’s effort in a significant manner compared to that with a single stage LQR based pole placement method at a desired closed loop damping and frequency.     

The L resolvents of elliptic operators with uniformly continuous coefficients

We consider the strongly elliptic operator A of order 2m in the divergence form with bounded measurable coefficients and assume that the coefficients of top order are uniformly continuous. For 1<p<∞, A is a bounded linear operator from the L^p Sobolev space H^m,p into H^−m,p. We will prove that (A−λ)⁻¹ exists in H^−m,p for some λ and estimate its operator norm.     

Quadratic optimal synchronization of uncertain chaotic systems

This paper investigates the quadratic optimal synchronization of uncertain chaotic systems with parameter mismatch, parametric perturbations and external disturbances on both master and slave systems. A robust control scheme based on Lyapunov stability theory and quadratic optimal control approach is derived to realize chaotic synchronization. The sufficient criterion for stability condition is formulated in a linear matrix inequality (LMI) form. The effect of uncertain parameters and external disturbance is suppressed to an H_∞ norm constraint. An adaptive algorithm is proposed to adjust the uncertain bound in the robust controller avoiding the chattering phenomena. The simulation results for synchronization of the Chua’s circuit system and the Lorenz system demonstrate the effectiveness of the proposed scheme.     

Multiple positive solutions of nonhomogeneous elliptic systems with strongly indefinite structure and critical Sobolev exponents

In this paper, we study the existence of multiple positive solutions to some Hamiltonian elliptic systems −Δv=λu+u^p+εf(x), −Δu=μv+v^q+δg(x) in Ω;u,v>0 in Ω; u=v=0 on ∂Ω, where Ω is a bounded domain in R^N (N?3); 0?f, g∈L∞(Ω); 1/(p+1)+1/(q+1)=(N−2)/N, p,q>1; λ,μ>0. Using sub- and supersolution method and based on an adaptation of the dual variational approach, we prove the existence of at least two nontrivial positive solutions for all λ,μ∈(0,λ₁) and ε,δ∈(0,δ₀), where λ₁ is the first eigenvalue of the Laplace operator −Δ with zero Dirichlet boundary conditions and δ₀ is a positive number.     

Applications of inversion formulas to the joint t-universality of Lerch zeta functions

In this paper, we define λ-joint, a^′-joint, (λ,λ)-joint, (λ,a^′)-joint and (a^′,a^′)-joint t-universality of Lerch zeta functions and consider the relations among those. Next we show the existence of (λ,λ)-joint t-universality. Finally, we also show the existence of λ-joint, a^′-joint, (λ,a^′)-joint and (a^′,a^′)-joint t-universality by using inversion formulas.     

Modelling gateway placement in wireless networks: Geometric k-centres of unit disc graphs

Motivated by the gateway placement problem in wireless networks, we consider the geometric k-centre problem on unit disc graphs: given a set of points P in the plane, find a set F of k points in the plane that minimizes the maximum graph distance from any vertex in P to the nearest vertex in F in the unit disc graph induced by P∪F. We show that the vertex 1-centre provides a 7-approximation of the geometric 1-centre and that a vertex k-centre provides a 13-approximation of the geometric k-centre, resulting in an O(kn)-time 26-approximation algorithm. We describe O(n²m)-time and O(n³)-time algorithms, respectively, for finding exact and approximate geometric 1-centres, and an O(mn2k)-time algorithm for finding a geometric k-centre for any fixed k. We show that the problem is NP-hard when k is an arbitrary input parameter. Finally, we describe an O(n)-time algorithm for finding a geometric k-centre in one dimension.     

Numerical simulation of indoor suspension particles based on v-f model

This paper presents a new algorithm for the prediction of indoor suspension particle dispersion based on a v²-f model. In order to handle the near-wall turbulence anisotropy properly, which is significant in the dispersion of fine particles, the particle eddy diffusivity is calculated using different formulae among regions of the turbulent core and in the vicinity of walls. The new algorithm is validated by several cases performed in two ventilated rooms with various air distribution patterns. The simulation results reveal that v²-f nonlinear turbulence model combined with a particle convective equation gives satisfactory agreement with the experimental data. It is generally found that the dynamic equation combined with the v²-f model can properly handle low Reynolds number (LRN) flows which are usually encountered in indoor air flows and fine particle dispersion.     

On the Cauchy problem for the evolution p-Laplacian equations with gradient term and source

In this paper, the authors study the equation ut=div(|Du|^p−2Du)+|u|^q−1u−λl|Du| in RN with p>2. We first prove that for 1?l?p−1, the solution exists at least for a short time; then for , the existence and nonexistence of global (in time) solutions are studied in various situations.     

Weighted integral inequalities for conjugate A-harmonic tensors

We first prove a local weighted integral inequality for conjugate A-harmonic tensors. Then, as an application of our local result, we prove a global weighted integral inequality for conjugate A-harmonic tensors in L^s(μ)-averaging domains, which can be considered as a generalization of the classical result. Finally, we give applications of the above results to quasiregular mappings.     

Isomorphisms between C-ternary algebras

In this paper, we prove the Hyers-Ulam-Rassias stability of homomorphisms in C^∗-ternary algebras and of derivations on C^∗-ternary algebras for the following Cauchy-Jensen additive mappings:

(0.1)     

The L resolvents of second-order elliptic operators of divergence form under the Dirichlet condition

Let A be the 2mth-order elliptic operator of divergence form with bounded measurable coefficients defined in a domain Ω of . For 1<p<∞ we regard A as a bounded linear operator from the L^p Sobolev space to H−m,p(Ω). It is known that when , we can construct the resolvent (A−λ)⁻¹ and estimate its operator norm for some λ if the leading coefficients are uniformly continuous. In this paper, we try to extend this result to a general domain. It is successful when m=1 if Ω is the half-space or a domain with C² bounded boundary. For m>1 it is shown that the problem is reduced to the case where Ω is the half-space and A is a homogeneous operator with constant coefficients. We also give a perturbation theorem.     

Robust H∞ control for a class of switched nonlinear cascade systems via multiple Lyapunov functions approach

This paper addresses the problem of robust H_∞ control for a class of switched nonlinear cascade systems with parameter uncertainty using the multiple Lyapunov functions (MLFs) approach. Each subsystem under consideration is composed of two cascade-connected parts. The uncertain parameters are assumed to be in a known compact set and are allowed to enter the system nonlinearly. Based on the explicit construction of Lyapunov functions, which avoids solving the Hamilton-Jacobi equations, sufficient conditions for the solvability of the robust H_∞ control problem are presented. As an application, the hybrid robust H_∞ control problem for a class of uncertain non-switched nonlinear cascade systems is solved when no single continuous controller is effective. Finally, a numerical example is provided to demonstrate the feasibility of the proposed method.     

Existence of Dλ-cycles and Dλ-paths

A cycle of C of a graph G is called a D_λ-cycle if every component of G ? V(C) has order less than λ. A D_λ-path is defined analogously. In particular, a D₁-cycle is a hamiltonian cycle and a D₁-path is a hamiltonian path. Necessary conditions and sufficient conditions are derived for graphs to have a D_λ-cycle or D_λ-path. The results are generalizations of theorems in hamiltonian graph theory. Extensions of notions such as vertex degree and adjacency of vertices to subgraphs of order greater than 1 arise in a natural way.     

A bijective enumeration of labeled trees with given indegree sequence

For a labeled tree on the vertex set {1,2,…,n}, the local direction of each edge (ij) is from i to j if i<j. For a rooted tree, there is also a natural global direction of edges towards the root. The number of edges pointing to a vertex is called its indegree. Thus the local (resp. global) indegree sequence λ=e₁¹e₂²… of a tree on the vertex set {1,2,…,n} is a partition of n−1. We construct a bijection from (unrooted) trees to rooted trees such that the local indegree sequence of a (unrooted) tree equals the global indegree sequence of the corresponding rooted tree. Combining with a Prüfer-like code for rooted labeled trees, we obtain a bijective proof of a recent conjecture by Cotterill and also solve two open problems proposed by Du and Yin. We also prove a q-multisum binomial coefficient identity which confirms another conjecture of Cotterill in a very special case.     

η-series and a Boolean Bercovici-Pata bijection for bounded k-tuples

Let Dc(k) be the space of (non-commutative) distributions of k-tuples of selfadjoint elements in a C^∗-probability space. On Dc(k) one has an operation ? of free additive convolution, and one can consider the subspace of distributions which are infinitely divisible with respect to this operation. The linearizing transform for ? is the R-transform (one has Rμ?ν=Rμ+Rν, ∀μ,ν∈Dc(k)). We prove that the set of R-transforms can also be described as {ημ|μ∈Dc(k)}, where for μ∈Dc(k) we denote ημ=Mμ/(1+Mμ), with Mμ the moment series of μ. (The series ημ is the counterpart of Rμ in the theory of Boolean convolution.) As a consequence, one can define a bijection via the formula

(I)     

A bifurcation theorem for the p-logistic equation

We consider a p-logistic equation with an equidiffusive reaction. Using variational methods and truncation techniques, we show that there is a critical parameter value λ^∗ > 0 such that for λ > λ^∗ the problem has a unique positive smooth solution, and for λ ∈ (0, λ^∗] the problem has no positive solution.     

Explicit characterizations of orthogonality in lS(C)

In a previous paper, the author used a notion of orthogonality introduced in another article to establish characterizations for orthogonality in the spaces l_S^p(C), 1?p<∞, thus obtaining generalizations of the usual characterization of orthogonality in the Hilbert spaces l_S²(C), via inner products. In this paper we make explicit these characterizations for some of the spaces l_S^p(C). We finish by presenting some remarks and open problems.     

Analysis of the M X /G/1 Queue Under D-Policy

Abstract

We study the queue length of the M ^X /G/1 queue under D-policy. We derive the queue length PGF at an arbitrary point of time. Then, we derive the mean queue length. As special cases, M/G/1, M ^X /M/1, and M/M/1 queue under D-policy are investigated. Finally, the effects of employing D-policy are discussed.     

e-filters of MS-algebras

The notion of e-filters is introduced in an MS-algebra and characterized. The concept of D-filters is introduced and a set of equivalent conditions under which every D-filter is an e-filter are given. The properties of the space of all prime e-filters of an MS-algebra are observed. The concept of D-prime filters is introduced and then a set of equivalent conditions are derived for a prime e-filter to become a D-prime filter in topological terms.