Comparison of two randomized policy M/G/1 queues with second optional service, server breakdown and startup

The problem addressed in this paper is to compare the minimum cost of the two randomized control policies in the M/G/1 queueing system with an unreliable server, a second optional service, and general startup times. All arrived customers demand the first required service, and only some of the arrived customers demand a second optional service. The server needs a startup time before providing the first required service until the system becomes empty. After all customers are served in the queue, the server immediately takes a vacation and the system operates the (T, p)-policy or (p, N)-policy. For those two policies, the expected cost functions are established to determine the joint optimal threshold values of (T, p) and (p, N), respectively. In addition, we obtain the explicit closed form of the joint optimal solutions for those two policies. Based on the minimal cost, we show that the optimal (p, N)-policy indeed outperforms the optimal (T, p)-policy. Numerical examples are also presented for illustrative purposes.     

On the complexity of the multicut problem in bounded tree-width graphs and digraphs

Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices whose removal leaves no path from each source to the corresponding sink. This is a classical NP-hard problem, and we show that the edge version becomes tractable in bounded tree-width graphs if the number of source-sink pairs is fixed, but remains NP-hard in directed acyclic graphs and APX-hard in bounded tree-width and bounded degree unweighted digraphs. The vertex version, although tractable in trees, is proved to be NP-hard in unweighted cacti of bounded degree and bounded path-width.     

Asymptotic behavior of solutions to a hyperbolic-elliptic coupled system in multi-dimensional radiating gas

This paper is concerned with the asymptotic behavior of solutions to the Cauchy problem of a hyperbolic-elliptic coupled system in the multi-dimensional radiating gas

     

Covering graphs with matchings of fixed size

Let m be a positive integer and let G be a graph. We consider the question: can the edge set E(G) of G be expressed as the union of a set M of matchings of G each of which has size exactly m? If this happens, we say that G is [m]-coverable and we call M an [m]-covering of G. It is interesting to consider minimum[m]-coverings, i.e. [m]-coverings containing as few matchings as possible. Such [m]-coverings will be called excessive[m]-factorizations. The number of matchings in an excessive [m]-factorization is a graph parameter which will be called the excessive[m]-index and denoted by . In this paper we begin the study of this new parameter as well as of a number of other related graph parameters.     

Optimization and sensitivity analysis of controlling arrivals in the queueing system with single working vacation

This paper analyzes the F-policy M/M/1/K queueing system with working vacation and an exponential startup time. The F-policy deals with the issue of controlling arrivals to a queueing system, and the server requires a startup time before allowing customers to enter the system. For the queueing systems with working vacation, the server can still provide service to customers rather than completely stop the service during a vacation period. The matrix-analytic method is applied to develop the steady-state probabilities, and then obtain several system characteristics. We construct the expected cost function and formulate an optimization problem to find the minimum cost. The direct search method and Quasi-Newton method are implemented to determine the optimal system capacity K, the optimal threshold F and the optimal service rates (μ_B,μ_V) at the minimum cost. A sensitivity analysis is conducted to investigate the effect of changes in the system parameters on the expected cost function. Finally, numerical examples are provided for illustration purpose.     

Binary relations and reduced hypergroups

Different partial hypergroupoids are associated with binary relations defined on a set H. In this paper we find sufficient and necessary conditions for these hypergroupoids in order to be reduced hypergroups. Given two binary relations ρ and σ on H we investigate when the hypergroups associated with the relations ρ∩σ, ρ∪σ and ρσ are reduced. We also determine when the cartesian product of two hypergroupoids associated with a binary relation is a reduced hypergroup.     

Identities for the Widder transform and transforms with Bessel function kernels

In the present paper, we consider the classical Widder transform, the H_ν-transform, the K_ν-transform, and the Y_ν-transform. Some identities involving these transforms and many others are given. By making use of these identities, a number of new Parseval-Goldstein type identities are obtained for these and other well-known integral transforms.     

Some decomposition method for analytic solving of certain nonlinear partial differential equations in physics with applications

Certain nonlinear partial differential equations (NPDEs) can be decomposed into several more simple equations, which can possess enough general analytic solutions. This approach and some interesting kinds of solutions (obtained by using this method) of some NPDEs in physics will be presented. The presented approach is somewhat similar to the homogeneous balance method, however they are different.     

On a generalization of the Evans Conjecture

The Evans Conjecture states that a partial Latin square of order n with at most n-1 entries can be completed. In this paper we generalize the Evans Conjecture by showing that a partial r-multi Latin square of order n with at most n-1 entries can be completed. Using this generalization, we confirm a case of a conjecture of Häggkvist.     

Ordinal subdivision and special pasting in quasicategories

Quasicategories are simplicial sets with properties generalising those of the nerve of a category. They model weak (ω,1)-categories. Using a combinatorially defined ordinal subdivision, we examine composition rules for certain special pasting diagrams in quasicategories. The subdivision is of combinatorial interest in its own right and is linked with various combinatorial constructions.     

Resilience and reliability analysis of P2P network systems

This paper conducts resilience and reliability analysis of P2P network by studying the isolation probability and the durable time of a single user. The network with user’s lifetime having stronger NWUE property is proved to be more resilient. Further, both graphical and nonparametric methods are developed to test the NWUE order between two data sets.     

Global bifurcation for a class of degenerate elliptic equations with variable exponents

We are concerned with the following nonlinear problem

     

Boundedness of singular integral operators with variable kernels

Let K be a generalized Calderón-Zygmund kernel defined on Rn×(Rn?{0}). The singular integral operator with variable kernel given by

     

Riesz means associated with certain product type convex domain

In this paper we study the maximal operators and the convolution operators Tδ associated with multipliers of the form

     

Conservation laws for some compacton equations using the multiplier approach

This paper is an application of the variational derivative method to the derivation of the conservation laws for partial differential equations. The conservation laws for (1+1) dimensional compacton k(2,2) and compacton k(3,3) equations are studied via multiplier approach. Also the conservation laws for (2+1) dimensional compacton Zk(2,2) equation are established by first computing the multipliers.     

Parseval frames for ICC groups

We analyze Parseval frames generated by the action of an ICC group on a Hilbert space. We parametrize the set of all such Parseval frames by operators in the commutant of the corresponding representation. We characterize when two such frames are strongly disjoint. We prove an undersampling result showing that if the representation has a Parseval frame of equal norm vectors of norm , the Hilbert space is spanned by an orthonormal basis generated by a subgroup. As applications we obtain some sufficient conditions under which a unitary representation admits a Parseval frame which is spanned by a Riesz sequences generated by a subgroup. In particular, every subrepresentation of the left-regular representation of a free group has this property.     

Fixed point theorems in fuzzy metric spaces

In the present work, we establish several fixed point theorems for a new class of self-maps in M-complete fuzzy metric spaces and compact fuzzy metric spaces, respectively.     

Estimates of the dilatation function of Beurling-Ahlfors extension

In this paper we estimate the dilatation function of the Beurling-Ahlfors extension in the most general case. By introducing ?h,m-function, we obtain an inequality which is sharp up to a constant.     

On symmetric graphs of valency five

A graph X, with a subgroup G of the automorphism group of X, is said to be (G,s)-transitive, for some s≥1, if G is transitive on s-arcs but not on (s+1)-arcs, and s-transitive if it is -transitive. Let X be a connected (G,s)-transitive graph, and G_v the stabilizer of a vertex v∈V(X) in G. If X has valency 5 and G_v is solvable, Weiss [R.M. Weiss, An application of p-factorization methods to symmetric graphs, Math. Proc. Camb. Phil. Soc. 85 (1979) 43-48] proved that s≤3, and in this paper we prove that G_v is isomorphic to the cyclic group Z₅, the dihedral group D₁₀ or the dihedral group D₂₀ for s=1, the Frobenius group F₂₀ or F₂₀×Z₂ for s=2, or F₂₀×Z₄ for s=3. Furthermore, it is shown that for a connected 1-transitive Cayley graph of valency 5 on a non-abelian simple group G, the automorphism group of is the semidirect product , where R(G) is the right regular representation of G and .