Existenz und Eindeutigkeit für Lösungen des Neumann—Tricomi-Problems im ℝ2

In a bounded simply-connected domainG \( \subseteq \) ?² a boundary value problem for a linear partial differential equation of second orderLu=f is studied. The operatorL is elliptic inG?{y>0}, parabolic forG?{y=0} and hyperbolic inG?{y<0}. The boundary value problem consists in findingu satisfyingLu=f inG, d _n u=φ on the elliptic part of the boundary ofG, u=ψ on the noncharacteristic part (which is not empty) of the hyperbolic part of the boundary ofG.d _n u denotes the conormal (with respect toL) derivative ofu. It is proved that the problem has a generalized solution in anL ²-weight space. Uniqueness is otained in the class of quasiregular solutions. In order to get the results apriori estimates are proved; theorems from functional analysis are used.     

Operating characteristic analysis on the M/G/1 system with a variant vacation policy and balking

This paper studies the operating characteristics of an M^[x]/G/1 queueing system under a variant vacation policy, where the server leaves for a vacation as soon as the system is empty. The server takes at most J vacations repeatedly until at least one customer is found waiting in the queue when the server returns from a vacation. If the server is busy or on vacation, an arriving batch balks (refuses to join) the system with probability 1 − b. We derive the system size distribution at different points in time, as well as the waiting time distribution in the queue. Finally, important system characteristics are derived along with some numerical illustration.     

Nonlinear boundary value problems and operators TT1

We consider nonlinear boundary value problems of the type $\text{L? + N? = 0}$ for the existence of solutions. It is assumed that L is a 2nth-order linear differential operator in the real Hilbert space S = L²[a, b] which admits a decomposition of the form $\text{L =}{}^{\mathrm{TT1}}$ where T is an nth-order linear differential operator and N is a nonlinear operator defined on a subspace of S. The decomposition of L induces a natural decomposition of the generalized inverse of L. Using the method of “alternative problems,” we split the boundary value problem into an equivalent system of two equations. The theory of monotone operators and the theory of nonlinear Hammerstein equations are then utilized to consider the solvability of the equivalent system.     

A note on the C2/G/1 queue and the C2/G/1 loss system

In this note, we consider the steady-state probability of delay (PW) in the C₂/G/1 queue and the steady-state probability of loss (p_loss) in the C₂/G/1 loss system, in both of which the interarrival time has a two-phase Coxian distribution. We show that, for c_X ²<1, where c_X is the coefficient of variation of the interarrival time, both p_loss and PW are increasing in β(s), the Laplace–Stieltjes transform of the general service-time distribution. This generalises earlier results for the GE₂/G/1 queue and the GE₂/G/1 loss system. The practical significance of this is that, for c_X ²<1, p_loss in the C₂/G/1 loss system and PW in the C₂/G/1 queue are both increasing in the variability of the service time. This revised version was published online in June 2006 with corrections to the Cover Date.     

C-GV triviality of function germs and Newton polyhedra

We provide estimates on the degree of C l GV determinacy ( G is one of Mather’s groups R or K ) of function germs which are defined on analytic variety V and satisfies a non-degeneracy condition with respect to some Newton polyhedron. The result gives an explicit order such that the C l geometrical structure of a function germ is preserved after higher order perturbations, which generalizes the result on C l G triviality of function germs given by M.A.S.Ruas.     

Diffusion-equation model of slightly loaded M/M/1 queue

Another derivation of the diffusion approximation of the M/M/1 queue is presented, which results in a new boundary condition. The model proposed approximates the time-dependent behavior of the M/M/1 system for all values of channel utilization.     

On translation planes of orderq 2 that admit a group of orderq 2 (q−1); bartolone's theorem

This article is concerned with translation planesP of orderq ² and kernelK isomorphic toG F(q). IfP admits a collineation groupG in the linear translation. complement and the order ofG K/K isq ²(q?1) then it is shown thatP is either a semifield plane or is a Lüneburg-Tits, Walker or Betten plane. This generalizes earlier work of Bartolone.     

Isoperimetric inequalities for p-conductance

An n-dimensional domain K is considered with boundary ?K = k₀ tu K₁ ∪ K₂ such that the closure ¯K is the image of a cylinder B=Sx[0, 1] (S is a closed (n?1)-dimensional cell) under a one-one Lipschitz map. For the p-conductance of the domain K, defined by the equation $$c_p (K) = \mathop {\inf }\limits_{U(K)} \int K |\nabla f|^p dx (p > 1),$$ , where∪ (K) = f (x):f ∈ W _p ¹ (K)∩C (¯K),f = 1 on k₁,f = 0 on K₀, the isoperimetric inequality c_p(K) ≤ V/r^P is established. Here V is the n-dimensional volume of the domain K, r is the shortest distance between k₀ and K₁, measured in K. Equality is achieved on the right cylinder.     

On the service system MX/G/∞

In the present paper we consider the service system M^X/G/∞ characterized by an infinite number of servers anda general service time distribution. The customers arrive at the system in groups of size X, which is a random variable, the time between group arrivals being exponentially distributed. Using simple probability arguments, we obtain probability generating functions (p.g.f.'s) of the number of busy servers at time t and the number that depart by time t. Several other properties of these random variables are also discussed.     

The performance measures and randomized optimization for an unreliable server M/G/1 vacation system

This paper examines an M^[x]/G/1 queueing system with a randomized vacation policy and at most J vacations. Whenever the system is empty, the server immediately takes a vacation. If there is at least one customer found waiting in the queue upon returning from a vacation, the server will be immediately activated for service. Otherwise, if no customers are waiting for service at the end of a vacation, the server either remains idle with probability p or leaves for another vacation with probability 1 − p. This pattern continues until the number of vacations taken reaches J. If the system is empty by the end of the Jth vacation, the server becomes idle in the system. Whenever one or more customers arrive at server idle state, the server immediately starts providing service for the arrivals. Assume that the server may meet an unpredictable breakdown according to a Poisson process and the repair time has a general distribution. For such a system, we derive the distributions of important system characteristics, such as system size distribution at a random epoch and at a departure epoch, system size distribution at busy period initiation epoch, the distributions of idle period, busy period, etc. Finally, a cost model is developed to determine the joint suitable parameters (p^∗, J^∗) at a minimum cost, and some numerical examples are presented for illustrative purpose.     

Dense subgroups ofC(K)-Stone-Weierstrass-type theorems for groups

LetB be a subgroup ofC(K) which separates points and contains the constants. An elementh∈C(R) operates onB iff∈B implies thath°f∈B. An elementh∈C(R) is condensing if its operation onB implies the density ofB inC(K). Similar notation applies to subgroupsB ofC(K, G) whereG is a metrizable group. We study the setD(G) of condensing functions inC(G, G) whenG is the additive group of a real Banach space and in particular whenG=R ⁿ.     

Lattice points in lattice polytopes

IfK is the underlying point-set of a simplicial complex of dimension at mostd whose vertices are lattice points, and ifG(K) is the number of lattice points inK, then the lattice point enumeratorG(K,t)=1+ _n1 G(nK)t ⁿ takes the formC(K, t)/(1–t) ^d+1, for some polynomialC(K, t). Here,C(K, t) is expressed as a sum of local terms, one for each face ofK. WhenK is a polytope or its boundary, there result inequalities between the numbersG _r (K), whereG(n K)= _r=0 ^d n ^r G _r (K).     

Densely ball remotal subspaces of C(K)

We call a subspace Y of a Banach space X a DBR subspace if its unit ball By admits farthest points from a dense set of points of X. In this paper, we study DBR subspaces of C(K). In the process, we study boundaries, in particular, the Choquet boundary of any general subspace of C(K). An infinite compact Hausdorff space K has no isolated point if and only if any finite co-dimensional subspace, in particular, any hyperplane is DBR in C(K). As a consequence, we show that a Banach space X is reflexive if and only if X is a DBR subspace of any superspace. As applications, we prove that any M-ideal or any closed *-subalgebra of C(K) is a DBR subspace of C(K). It follows that C(K) is ball remotal in C(K)^**.     

Asymptotic enumeration by degree sequence of graphs with degreeso(n 1/2)

We determine the asymptotic number of labelled graphs with a given degree sequence for the case where the maximum degree iso(|E(G)|^1/3). The previously best enumeration, by the first author, required maximum degreeo(|E(G)|^1/4). In particular, ifk=o(n ^1/2), the number of regular graphs of degreek and ordern is asymptotically $$\frac{{(nk)!}}{{(nk/2)!2^{nk/2} (k!)^n }}\exp \left( { - \frac{{k^2 - 1}}{4} - \frac{{k^3 }}{{12n}} + 0\left( {k^2 /n} \right)} \right).$$ Under slightly stronger conditions, we also determine the asymptotic number of unlabelled graphs with a given degree sequence. The method used is a switching argument recently used by us to uniformly generate random graphs with given degree sequences.     

A MAP/G/1 Queue with Negative Customers

In this paper, we consider a MAP/G/1 queue with MAP arrivals of negative customers, where there are two types of service times and two classes of removal rules: the RCA and RCH, as introduced in section 2. We provide an approach for analyzing the system. This approach is based on the classical supplementary variable method, combined with the matrix-analytic method and the censoring technique. By using this approach, we are able to relate the boundary conditions of the system of differential equations to a Markov chain of GI/G/1 type or a Markov renewal process of GI/G/1 type. This leads to a solution of the boundary equations, which is crucial for solving the system of differential equations. We also provide expressions for the distributions of stationary queue length and virtual sojourn time, and the Laplace transform of the busy period. Moreover, we provide an analysis for the asymptotics of the stationary queue length of the MAP/G/1 queues with and without negative customers.     

The mixed initial-boundary value problem for diagonalizable quasilinear hyperbolic systems in the first quadrant

In this paper, we investigate the mixed initial-boundary value problem for diagonalizable quasilinear hyperbolic systems with nonlinear boundary conditions on a half-unbounded domain . Under the assumptions that system is strictly hyperbolic and linearly degenerate, we obtain the global existence and uniqueness of C¹ solutions with the bounded L¹∩L^∞ norm of the initial data as well as their derivatives and appropriate boundary condition. Based on the existence results of global classical solutions, we also prove that when t tends to infinity, the solutions approach a combination of C¹ travelling wave solutions. Under the appropriate assumptions of initial and boundary data, the results can be applied to the equation of time-like extremal surface in Minkowski space R^1+(1+n).