Hypothesis testing for the generalized multivariate modified Bessel model

In this paper, we consider hypothesis testing problems in which the involved samples are drawn from generalized multivariate modified Bessel populations. This is a much more general distribution that includes both the multivariate normal and multivariate-t distributions as special cases. We derive the distribution of the Hotelling's T²-statistic for both the one- and two-sample problems, as well as the distribution of the Scheffe's T²-statistic for the Behrens–Fisher problem. In all cases, the non-null distribution of the corresponding F-statistic follows a new distribution which we introduce as the non-central F-Bessel distribution. Some statistical properties of this distribution are studied. Furthermore, this distribution was utilized to perform some power calculations for tests of means for different models which are special cases of the generalized multivariate modified Bessel distribution, and the results compared with those obtained under the multivariate normal case. Under the null hypothesis, however, the non-central F-Bessel distribution reduces to the central F-distribution obtained under the classical normal model.     

Dependence Properties of Multivariate Mixture Distributions and Their Applications

Consider a multivariate mixture model where the random variables X ₁, ..., X _n given (₁, ..., _n ), are conditionally independent. Conditions are obtained under which different kinds of positive dependence hold among X _i 's. The results obtained are applied to a variety of problems including the concomitants of order statistics and of record values; and to frailty models.     

<Emphasis Type="Italic">K</Emphasis><Subscript><Emphasis Type="Italic">n</Emphasis></Subscript>-nearest neighbor estimators of entropy

For estimating the entropy of an absolutely continuous multivariate distribution, we propose nonparametric estimators based on the Euclidean distances between the n sample points and their k _n -nearest neighbors, where {k _n : n = 1, 2, …} is a sequence of positive integers varying with n. The proposed estimators are shown to be asymptotically unbiased and consistent.      

Some Functions of Points in Projective Spaces

Extending earlier results in the plane, we prove that every n-polygon in sufficiently general position in d-dimensional projective space, n d + 2, gives rise to a derived n-polygon, which preserves a few functions; these functions are the cyclial product of (actually affine) ratios of various points, obtained by proper projections on suitable lines.     

Test for a specified signal when the noise covariance matrix is unknown

In the univariate case it is well known that the one sided t test is uniformly most powerful for the null hypothesis against all one sided alternatives. Such a property does not easily extend to the multivariate case. In this paper, a test derived for the hypothesis that the mean of a vector random variable is zero against specified alternatives, when the covariance matrix is unknown. This test depends on the given alternatives and is more powerful than Hotelling's T². The results are derived both for real and complex vector observations and under normal and spherical distributions. The properties of the proposed tests are investigated in detail when a single alternative is specified.     

On the multi-phase M/G/1 queueing system with random feedback

In this paper we consider an M/G/1 queue with k phases of heterogeneous services and random feedback, where the arrival is Poisson and service times has general distribution. After the completion of the i-th phase, with probability θ _i the (i + 1)-th phase starts, with probability p _i the customer feedback to the tail of the queue and with probability 1 − θ _i − p _i  = q _i departs the system if service be successful, for i = 1, 2 , . . . , k. Finally in kth phase with probability p _k feedback to the tail of the queue and with probability 1 − p _k departs the system. We derive the steady-state equations, and PGF’s of the system is obtained. By using them the mean queue size at departure epoch is obtained.     

The M/G/1 Queue with Finite Workload Capacity

We consider the M/G/1 queueing system in which customers whose admission to the system would increase the workload beyond a prespecified finite capacity limit are not accepted. Various results on the distribution of the workload are derived; in particular, we give explicit formulas for its stationary distribution for M/M/1 and in the general case, under the preemptive LIFO discipline, for the joint stationary distribution of the number of customers in the system and their residual service times. Furthermore, the Laplace transform of the length of a busy period is determined. Finally, for M/D/1 the busy period distribution is derived in closed form.     

A Polynomial Factorization Approach for the Discrete Time GIX/>G/1/K Queue

This paper proposes a polynomial factorization approach for queue length distribution of discrete time GI ^X /G/1 and GI _X /G/1/K queues. They are analyzed by using a two-component state model at the arrival and departure instants of customers. The equilibrium state-transition equations of state probabilities are solved by a polynomial factorization method. Finally, the queue length distributions are then obtained as linear combinations of geometric series, whose parameters are evaluated from roots of a characteristic polynomial.     

Approximations for the <Emphasis Type="Italic">M</Emphasis>/<Emphasis Type="Italic">GI</Emphasis>/<Emphasis Type="Italic">N</Emphasis>+<Emphasis Type="Italic">GI</Emphasis> type call center

In this paper, we propose approximations to compute the steady-state performance measures of the M/GI/N+GI queue receiving Poisson arrivals with N identical servers, and general service and abandonment-time distributions. The approximations are based on scaling a single server M/GI/1+GI queue. For problems involving deterministic and exponential abandon times distributions, we suggest a practical way to compute the waiting time distributions and their moments using the Laplace transform of the workload density function. Our first contribution is numerically computing the workload density function in the M/GI/1+GI queue when the abandon times follow general distributions different from the deterministic and exponential distributions. Then we compute the waiting time distributions and their moments. Next, we scale-up the M/GI/1+GI queue giving rise to our approximations to capture the behavior of the multi-server system. We conduct extensive numerical experiments to test the speed and performance of the approximations, which prove the accuracy of their predictions.      

Some distribution theory relating to confidence regions in multivariate calibration

Summary In the problem of multivariate calibration, Williams (1959,Regression Analysis, Wiley) and Wood (1982, to appear inProc. 11th Internat. Bio. Conf.) have proposed a decomposition of the usual Hotelling'sT ² statistic into the sum of two statistics for use in constructing confidence regions. This paper presents general results for the moment terms basic to Fujikoshi and Nishii's (1984,Hiroshima J. Math.,14, 215–225) approach to the distributions of these statistics, and presents simple alternative approximations to their percentiles.     

An everywhere convergent series representation of the distribution of Hotelling's generalized T0

A new series representation of the exact distribution of Hotelling's generalized T₀² statistic is obtained. Unlike earlier work, the series representation given here is everywhere convergent. Explicit formulae are given for both the null and the non-central distributions. Earlier results by [1], 215–225), which are convergent on the interval [0, 1), are also derived quite simply from our formulae. The paper therefore provides a solution to the long standing problem of the exact distribution of the T₀² statistic in the general case.     

Asymptotic Results and a Markovian Approximation for the M(n)/M(n)/s+GI System

In this paper for the M(n)/M(n)/s+GI system, i.e. for a s-server queueing system where the calls in the queue may leave the system due to impatience, we present new asymptotic results for the intensities of calls leaving the system due to impatience and a Markovian system approximation where these results are applied. Furthermore, we present a new proof for the formulae of the conditional density of the virtual waiting time distributions, recently given by Movaghar for the less general M(n)/M/s+GI system. Also we obtain new explicit expressions for refined virtual waiting time characteristics as a byproduct.     

A-Monotonicity and Its Role in Nonlinear Variational Inclusions

The notion of A-monotonicity in the context of solving a new class of nonlinear variational inclusion problems is presented. Since A-monotonicity generalizes not only the well-explored maximal monotone mapping, but also a recently introduced and studied notion of H-monotone mapping, the results thus obtained are general in nature.Communicated by G. Leitmann     

Controlling the space with preassigned responses

It is shown that large classes of control systems, which include certain systems of the typex+A(t)x=B(t)u, can be handled in such a way that the control functionsu(t) are actually associated with responsesx(t) that belong to known families of functions. In particular, it is possible, for a variety of perturbationsB(t)u and operatorsA(t) with convex domains, to have responses that are line segments joining the origin to the reachable states.The present approach establishes the fact that a vast number of results from functional analysis concerning ranges of operators can be effectively applied to the general theory of control. It is also rather significant that the present theory does not necessarily require the solvability of the associated Cauchy problem.The operatorsB(t)u do not have to be invertible inu. However, it is shown that continuous controlsu(t) can be obtained for a variety of problems whenB ^–1(t)u exists and is continuous int.     

Rank 4 vector bundles on the quintic threefold

By the results of the author and Chiantini in [3], on a general quintic threefold X⊂P ⁴ the minimum integer p for which there exists a positive dimensional family of irreducible rank p vector bundles on X without intermediate cohomology is at least three. In this paper we show that p≤4, by constructing series of positive dimensional families of rank 4 vector bundles on X without intermediate cohomology. The general member of such family is an indecomposable bundle from the extension class Ext ¹ (E, F), for a suitable choice of the rank 2 ACM bundles E and F on X. The existence of such bundles of rank p=3 remains under question.     

-Operator frames for a Banach space

In this paper, (p,Y)-Bessel operator sequences, operator frames and (p,Y)-Riesz bases for a Banach space X are introduced and discussed as generalizations of the usual concepts for a Hilbert space and of the g-frames. It is proved that the set of all (p,Y)-Bessel operator sequences for a Banach space X is a Banach space and isometrically isomorphic to the operator space B(X,ℓ^p(Y)). Some necessary and sufficient conditions for a sequence of operators to be a (p,Y)-Bessel operator sequence are given. Also, a characterization of an independent (p,Y)-operator frame for X is obtained. Lastly, it is shown that an independent (p,Y)-operator frame for X is just a (p,Y)-Riesz basis for X and has a unique dual (q,Y^*)-operator frame for X^*.     

On the Asymptotics of Trimmed Best k-Nets

Trimmed best k-nets were introduced in J. A. Cuesta-Albertos, A. Gordaliza and C. Matrán (1998, Statist. Probab. Lett.36, 401–413) as a robustified L_∞-based quantization procedure. This paper focuses on the asymptotics of this procedure. Also, some possible applications are briefly sketched to motivate the interest of this technique. Consistency and weak limit law are obtained in the multivariate setting. Consistency holds for absolutely continuous distributions without the (artificial) requirement of a trimming level varying with the sample size as in J. A. Cuesta-Albertos, A. Gordaliza and C. Matrán (1998, Statist. Probab. Lett.36, 401–413). The weak convergence will be stated toward a non-normal limit law at a O_P(n^−1/3) rate of convergence. An algorithm for computing trimmed best k-nets is proposed. Also a procedure is given in order to choose an appropriate number of centers, k, for a given data set.     

Representation of finite groups and the first Betti number of branched coverings of a universal Borromean orbifold

The paper studies the first homology of finite regular branched coverings of a universal Borromean orbifold called B _4,4,4ℍ³. We investigate the irreducible components of the first homology as a representation space of the finite covering transformation group G. This gives information on the first betti number of finite coverings of general 3-manifolds by the universality of B _4,4,4. The main result of the paper is a criterion in terms of the irreducible character whether a given irreducible representation of G is an irreducible component of the first homology when G admits certain symmetries. As a special case of the motivating argument the criterion is applied to principal congruence subgroups of B _4,4,4. The group theoretic computation shows that most of the, possibly nonprincipal, congruence subgroups are of positive first Betti number. This work is partially supported by the Sonderforschungsbereich 288.     

Some complete metrics on spaces of fuzzy subsets

The classes of the L_p,∞- and L_p-metrics play an important role to develop a probability theory in fuzzy sample spaces. All of these metrics are known to be separable, but not complete. The classes are closely related as for each L_p,∞-metric there exists some L_p-metric which induces the same topology. This paper deals with the completion of the L_p,∞- and L_p-metrics. We can also show that the relationship between the classes of L_p,∞- and L_p-metrics still holds for the obtained respective classes of their completions.     

Feature selection for high-dimensional data

This paper focuses on feature selection for problems dealing with high-dimensional data. We discuss the benefits of adopting a regularized approach with L ₁ or L ₁–L ₂ penalties in two different applications—microarray data analysis in computational biology and object detection in computer vision. We describe general algorithmic aspects as well as architecture issues specific to the two domains. The very promising results obtained show how the proposed approach can be useful in quite different fields of application.