A note on the extension of BV functions in metric measure spaces

In this note, a classical extension result for BV functions due to Yu.D. Burago and V.G. Maz'ja [Yu.D. Burago, V.G. Maz'ja, Potential Theory and Function Theory for Irregular Regions, Seminars in Math., vol. 3, V.A. Steklov Math. Inst., Leningrad, 1969 (translated from Russian)] is generalized to the abstract setting of doubling metric measure spaces endowed with a differentiation structure called D-structure.     

A formula for the Mahler measure of axy+bx+cy+d

We introduce a formula for the Mahler measure of axy+bx+cy+d with complex coefficients a,b,c, and d and give examples which demonstrate a connection with L-functions. We then prove a generalization of Maillot's formula when the coefficients are real. Next, we discuss operations on the coefficients which fix the Mahler measure. Finally, we prove an alternate formulation of the main result in order to calculate the Mahler measure of a two-parameter family of polynomials in three variables.     

The N threshold policy for the GI/M/1 queue

We study a GI/M/1 queue with an N threshold policy. In this system, the server stops attending the queue when the system becomes empty and resumes serving the queue when the number of customers reaches a threshold value N. Using the embeded Markov chain method, we obtain the stationary distributions of queue length and waiting time and prove the stochastic decomposition properties.     

Polynomial sequential continuity on C(K,E) spaces

We show that, for bounded sequences in C(K,E), the polynomial sequential convergence is not equivalent to the pointwise polynomial sequential convergence. We introduce several conditions on E under which different versions of the result are true when K is a scattered compact space. These conditions are related with some others appeared in the literature and they seem to be of independent interest.     

Weak barrelledness for C(X) spaces

Buchwalter and Schmets reconciled C_c(X) and C_p(X) spaces with most of the weak barrelledness conditions of 1973, but could not determine if -barrelled ⇔ ?^∞-barrelled for C_c(X). The areas grew apart. Full reconciliation with the fourteen conditions adopted by Saxon and Sánchez Ruiz needs their 1997 characterization of Ruess' property (L), which allows us to reduce the C_c(X) problem to its 1973 status and solve it by carefully translating the topology of Kunen (1980) and van Mill (1982) to find the example that eluded Buchwalter and Schmets. The more tractable C_p(X) readily partitions the conditions into just two equivalence classes, the same as for metrizable locally convex spaces, instead of the five required for C_c(X) spaces. Our paper elicits others, soon to appear, that analytically characterize when the Tychonov space X is pseudocompact, or Warner bounded, or when C_c(X) is a df-space (Jarchow's 1981 question).     

Algorithmic approximations for the busy period distribution of the M/M/c retrial queue

In this paper we deal with the main multiserver retrial queue of M/M/c type with exponential repeated attempts. This model is known to be analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused by the retrial feature. For this reason several models have been proposed for approximating its stationary distribution, that lead to satisfactory numerical implementations. This paper extends these studies by developing efficient algorithmic procedures for calculating the busy period distribution of the main approximation models of Wilkinson [Wilkinson, R.I., 1956. Theories for toll traffic engineering in the USA, The Bell System Technical Journal 35, 421–514], Falin [Falin, G.I., 1983. Calculations of probability characteristics of a multiline system with repeated calls, Moscow University Computational Mathematics and Cybernetics 1, 43–49] and Neuts and Rao [Neuts, M.F., Rao, B.M., 1990. Numerical investigation of a multiserver retrial model, Queueing Systems 7, 169–190]. Moreover, we develop stable recursive schemes for the computation of the busy period moments. The corresponding distributions for the total number of customers served during a busy period are also studied. Several numerical results illustrate the efficiency of the methods and reveal interesting facts concerning the behavior of the M/M/c retrial queue.     

Composition operators from F(p, q, s) spaces to the nth weighted-type spaces on the unit disc

In this note we characterize the boundedness and compactness of the composition operator from the general function space F(p, q, s) to the nth weighted-type space on the unit disk, where the nth weighted-type space has been recently introduced by Stevo Stevi?.     

On the GI/M/1/N queue with multiple working vacations—analytic analysis and computation

We consider finite buffer single server GI/M/1 queue with exhaustive service discipline and multiple working vacations. Service times during a service period, service times during a vacation period and vacation times are exponentially distributed random variables. System size distributions at pre-arrival and arbitrary epoch with some important performance measures such as, probability of blocking, mean waiting time in the system etc. have been obtained. The model has potential application in the area of communication network, computer systems etc. where a single channel is allotted for more than one source.     

Cyclic vectors and cellular indecomposable operators on Qp spaces

We identify the functions whose polynomial multiples are weak* dense in Q p spaces and prove that if | f (z) | ≥ | g(z) | and g is cyclic in Q p , then f is cyclic in Q p . We also show that the multiplication operator M z on Q p spaces is cellular indecomposable.     

On properties of discrete (r, q) and (s, T) inventory systems

We consider single-item (r, q) and (s, T) inventory systems with integer-valued demand processes. While most of the inventory literature studies continuous approximations of these models and establishes joint convexity properties of the policy parameters in the continuous space, we show that these properties no longer hold in the discrete space, in the sense of linear interpolation extension and L^?-convexity. This nonconvexity can lead to failure of optimization techniques based on local optimality to obtain the optimal inventory policies. It can also make certain comparative properties established previously using continuous variables invalid. We revise these properties in the discrete space.     

Analysis of an M/G/∞ queue with batch arrivals and batch-dedicated servers

We analyze an M/G/∞ queue with batch arrivals, where jobs belonging to a batch have to be processed by the same server. The number of jobs in the system is characterized as a compound Poisson random variable through a scaling of the original arrival and batch size processes.     

Examples of proper k-ball contractive retractions in F-normed spaces

Assume X is an infinite dimensional F-normed space and let r be a positive number such that the closed ball Br(X) of radius r is properly contained in X. The main aim of this paper is to give examples of regular F-normed ideal spaces in which there is a 1-ball or a (1+ε)-ball contractive retraction of Br(X) onto its boundary with positive lower Hausdorff measure of noncompactness. The examples are based on the abstract results of the paper, obtained under suitable hypotheses on X.     

Algorithmic analysis of the Geo/Geo/c retrial queue

In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with exponential retrials, is analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused from the retrial feature. In discrete-time, the occurrence of multiple events at each slot increases the complexity of the model and raises further computational difficulties. We propose several algorithmic procedures for the efficient computation of the main performance measures of this system. More specifically, we investigate the stationary distribution of the system state, the busy period and the waiting time. Several numerical examples illustrate the analysis.     

A class of B-(p,r)-invex functions and mathematical programming

Invexity of a function is generalized. The new class of nonconvex functions, called B-(p,r)-invex functions with respect to η and b, being introduced, includes many well-known classes of generalized invex functions as its subclasses. Some properties of the introduced class of B-(p,r)-invex functions with respect to η and b are studied. Further, mathematical programming problems involving B-(p,r)-invex functions with respect to η and b are considered. The equivalence between saddle points and optima, and different type duality theorems are established for this type of optimization problems.     

Existence of positive solutions for the p-Laplacian with p-gradient term

In this paper, we study the existence of positive solutions for the p-Laplacian involving a p-gradient term. Due to the non-variational structure and the fact that the nonlinearity may be critical or supercritical, the variational method is no longer valid. Taking advantage of global C1,α estimates and the Liouville type theorems, we employ the blow-up argument to obtain the a priori estimates on solutions, and finally obtain the existence result based on the Krasnoselskii fixed point theorem.     

Eigenvalues of p(x)-Laplacian Dirichlet problem

This paper studies the eigenvalues of the p(x)-Laplacian Dirichlet problem

     

Algorithm of robust stability region for interval plant with time delay using fractional order PID controller

By using PI^λD^μ controller, we investigate the problem of computing the robust stability region for interval plant with time delay. The fractional order interval quasi-polynomial is decomposed into several vertex characteristic quasi-polynomials by the lower and upper bounds, in which the value set of the characteristic quasi-polynomial for vertex quasi-polynomials in the complex plane is a polygon. The D-decomposition technique is used to characterize the stability boundaries of each vertex characteristic quasi-polynomial in the space of controller parameters. We investigate how the fractional integrator order λ and the derivative order μ in the range (0, 2) affect the stabilizability of each vertex characteristic quasi-polynomial. The stability region of interval characteristic quasi-polynomial is determined by intersecting the stability region of each quasi-polynomial. The parameters of PI^λD^μ controller are obtained by selecting the control parameters from the stability region. Using the value set together with zero exclusion principle, the robust stability is tested and the algorithm of robust stability region is also proposed. The algorithm proposed here is useful in analyzing and designing the robust PI^λD^μ controller for interval plant. An example is given to show how the presented algorithm can be used to compute all the parameters of a PI^λD^μ controller which stabilize a interval plant family.