System G|Gκ|1 with Batch Service of Calls

For the queuing system G|G |1 with batch service of calls, we determine the distributions of the following characteristics: the length of a busy period, the queue length in transient and stationary modes of the queuing system, the total idle time of the queuing system, the output stream of served calls, etc.     

On the Distribution of the Number of Calls in the Queuing System Dη|Dξkappa|1

For the queuing system D |D ^kappa|1, we determine the distribution of the number of calls in transient and stationary modes.     

Estimation of the Intensity of the Flow of Nonmonotone Refusals in the Queuing System (≤ λ)/G/m

We consider a queuing system ()/G/m, where the symbol () means that, independently of prehistory, the probability of arrival of a call during the time interval dtdoes not exceed dt. The case where the queue length first attains the level r m+ 1 during a busy period is called the refusal of the system. We determine a bound for the intensity ₁(t) of the flow of homogeneous events associated with the monotone refusals of the system, namely, ₁(t) = O( ^{r+ 1}₁ ^{m– 1} _{r– m+ 1}), where _k is the kth moment of the service-time distribution.     

Asymptotics of the Number of Threshold Functions and the Singularity Probability of Random {±1}-Matrices

Doklady Mathematics - Two results concerning the number $$P(2,n)$$ of threshold functions and the singularity probability $${{\mathbb{P}}_{n}}$$ of random ( $$n \times n$$ ) $${\text{\{ }} \pm...     

Exact Formulas for Eθ/G/1/N-Type Queuing Systems

We investigate E /G/1/N-type queuing systems with limited queue. The investigation is based on the potential method proposed by Korolyuk     

Approximating Characteristics of the Classes of Periodic Multivariate Functions in the Space B∞,1

Ukrainian Mathematical Journal - We obtain the exact-order estimates of the Kolmogorov widths and entropy numbers for the classes $$ {mathbbm{W}}_{p,alpha}^r $$ and $$ {mathbbm{B}}_{p,theta}^r...     

Probability distribution functions of the Grincevi?jus series

Given a sequence (ξn,ηn) of independent identically distributed vectors of random variables we consider the Grincevi?jus series

     

The Smoothness of Weak Solutions to the System of Second Order Differential Equations with Non—negative Characteristics

In this paper,we will discuss smoothness of weak solutions for the system of second orderdifferential equations eith non-negative characteristies.First of all,we establish boundary,and interiorestimates and then we prove that solutions of regularization problem satisfy Lipschitz condition.     

Moments of the Mean of Dubins–Freedman Random Probability Distributions

Explicit formulas are given to recursively generate the moments of the mean M for Dubins–Freedman random distribution functions with arbitrary base measure . Using a standard inversion formula for moments of a distribution on the unit interval, the distribution of M is approximated for several natural choices of . The support of the mean is also considered. It is shown that the support of M is connected whenever is concentrated on the vertical bisector of the unit square S, but may have arbitrarily many gaps otherwise.     

Cohomology of osp(2|2) acting on spaces of linear differential operators on the superspace ℝ1|2

We compute the first differential cohomology of the orthosymplectic Lie superalgebra osp(2|2) with coefficients in the superspace of linear differential operators acting on the space of weighted densities on the (1, 2)-dimensional real superspace. We also compute the same, but osp(1|2)-relative, cohomology. We explicitly give 1-cocycles spanning these cohomologies. This work is the simplest generalization of a result from [1].     

Probability masses fitting in the analysis of manufacturing flow lines

The analysis of manufacturing systems with finite capacity and with general service time distributions is made of two steps: the distributions have first to be transformed into tractable phase-type distributions, and then the modified system can be analytically modelled. In this paper, we propose a new alternative in order to build tractable phase-type distributions, and study its effects on the global modelling process. Called “probability masses fitting” (PMF), the approach is quite simple: the probability masses on regular intervals are computed and aggregated on a single value in the corresponding interval, leading to a discrete distribution. PMF shows some interesting properties: it is bounding, monotonic, refinable, it approximates distributions with finite support and it conserves the shape of the distribution. With the resulting discrete distributions, the evolution of the system is then exactly modelled by a Markov chain. Here, we focus on flow lines and show that the method allows us to compute upper and lower bounds on the throughput as well as good approximations of the cycle time distributions. Finally, the global modelling method is shown, by numerical experiments, to compute accurate estimations of the throughput and of various performance measures, reaching accuracy levels of a few tenths of a percent.     

On the Center of the Generalized Liénard System

In this paper, we discuss the conditions for a center for the generalized Liénard system (E)₁

Convergence of the Vlasov-Poisson-Boltzmann System to the Incompressible Euler Equations

In this paper we establish the convergence of the Vlasov-Poisson-Boltzmann system to the incompressible Euler equations in the so-called quasi-neutral regime. The convergence is rigorously proved for time intervals on which the smooth solution of the Euler equations of the incompressible fluid exists. The proof relies on the relative-entropy method.     

Large Deviations for Products of Empirical Probability Measures in the τ-Topology

We prove a large deviation principle (LDP) for products of empirical measures, where the state space S of the underlying sequence of i.i.d. random variables is Polish and the set of probability measures on S respectively S×S is endowed with the -topology. An improved form of a LDP for U-statistics and some conclusions from that are obtained as a particular application.     

On the Expected Probability of Constraint Violation in Sampled Convex Programs

In this note, we derive an exact expression for the expected probability V of constraint violation in a sampled convex program (see Calafiore and Campi in Math. Program. 102(1):25–46, 2005; IEEE Trans. Autom. Control 51(5):742–753, 2006 for definitions and an introduction to this topic):

On the neutrix composition of the distributions x −s ln m |x| and x r

Let F be a distribution and let f be a locally summable function. The distribution F(f) is defined as the neutrix limit of the sequence {F _n (f)}, where F _n (x) = F(x) * δ _n (x) and {δ _n (x)} is a certain sequence of infinitely differentiable functions converging to the Dirac delta-function δ(x). The composition of the distributions x ^?s ln ^m |x| and x ^r is proved to exist and be equal to r ^m x ^?rs ln ^m |x| for r, s, m = 2, 3….