The Compound Decision Problem with $m \times n$ Finite Loss Matrix

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

determinant of the hankel matrix with binomial entries

abstract in this thesis at first we comput the determinant of hankel matrix with enteries a_k (x)=?_(m=0)^k??((2k+2-m)¦(k-m)) x^m ? by using a new operator, ? and by writing and solving differential equation of order two at points x=2 and x=-2 . also we show that this determinant under k-binomial transformation is invariant.

15 صفحه اول

Matrix representation of a sixth order Sturm-Liouville problem and related inverse problem with finite spectrum

‎In this paper‎, ‎we find matrix representation of a class of sixth order Sturm-Liouville problem (SLP) with separated‎, ‎self-adjoint boundary conditions and we show that such SLP have finite spectrum‎. ‎Also for a given matrix eigenvalue problem $HX=lambda VX$‎, ‎where $H$ is a block tridiagonal matrix and $V$ is a block diagonal matrix‎, ‎we find a sixth order boundary value problem of Atkin...

متن کامل

The M × N Flowshop Problem with Separable, Sequence-independent Setup Times

This paper presents an MILP model for the permutation flowshop wherein the setup times are both separable from the job processing times and independent of a job’s position in the processing sequence. Two experiments were conducted to estimate the computer times necessary to solve problems with up to 9 machines and 15 jobs, and to then compare these solution time requirements to those required ...

متن کامل

The Poisson Compound Decision Problem Revisited

Abstract: The compound decision problem for a vector of independent Poisson random variables with possibly different means has half a century old solution. However, it appears that the classical solution needs smoothing adjustment even when there are many observations and relatively small means such that the empirical distribution is close to its mean. We discuss three such adjustments. We also...

متن کامل

On the rank of $n\times n$ matrix multiplication

For every p 6 n positive integer we obtain the lower bound (3 − 1 p+1 )n −

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Annals of Mathematical Statistics

سال: 1966

ISSN: 0003-4851

DOI: 10.1214/aoms/1177699523