نتایج جستجو برای: kramer

تعداد نتایج: 1927  

Journal: :British Dental Journal 2017

Journal: :Statistical Science 1997

2001
ANTONIO G. GARCÍA MIGUEL A. HERNÁNDEZ-MEDINA MARÍA J. MUÑOZ-BOUZO

The classical Kramer sampling theorem is, in the subject of self-adjoint boundary value problems, one of the richest sources to obtain sampling expansions. It has become very fruitful in connection with discrete Sturm-Liouville problems. In this paper, a discrete version of the analytic Kramer sampling theorem is proved. Orthogonal polynomials arising from indeterminate Hamburger moment problem...

Journal: :bulletin of the iranian mathematical society 2014
mojgan emami ozra naserian

we investigate the existence of some‎ ‎large sets of size nine‎. ‎the large set $ls[9](2,5,29)$ is constructed and‎ ‎existence of the family $ls[9](2,5,27l+j)$ for $lgeq 1, ‎2leq‎ ‎j

2008
Greg Kramer

Representing a single data variable changing in time via sonification, or using that data to control a sound in some way appears to be a simple problem but actually involves a significant degree of subjectivity. This paper is a response to my own focus on specific sonification tasks (Kramer 1990, 1993) (Fitch & Kramer, 1994), on broad theoretical concerns in auditory display (Kramer 1994a, 1994...

Journal: :Discrete Mathematics 2010
Yoomi Rho

In 1977, Ganter and Teirlinck proved that any 2t× 2t matrix with 2t nonzero elements can be partitioned into four submatrices of order t of which at most two contain nonzero elements. In 1978, Kramer and Mesner conjectured that any mt× nt matrix with kt nonzero elements can be partitioned into mn submatrices of order t of which at most k contain nonzero elements. In 1995, Brualdi et al. showed ...

Journal: :transactions on combinatorics 2014
mojgan emami ozra naserian

we denote by $ls[n](t,k,v)$ a large set of $t$-$(v,k,lambda)$ designs of size $n$, which is a partition of all  $k$-subsets ofa $v$-set into $n$ disjoint  $t$-$(v,k,lambda)$ designs and$n={v-t choose k-t}/lambda$.   we use the notation$n(t,v,k,lambda)$ as the maximum possible number of mutuallydisjoint cyclic $t$-$(v,k,lambda)$designs. in this paper we givesome new bounds for $n(2,29,4,3)$ and ...

Journal: :The British journal of mathematical and statistical psychology 2012
Scott J Richter Melinda H McCann

Using Tukey-Kramer versus the ANOVA F-test as the omnibus test of the Hayter-Fisher procedure for comparing all pairs of normally distributed means, when sample sizes are unequal, is investigated. Simulation results suggest that using Tukey-Kramer leads to as much or more any-pairs power compared to using the F-test for certain patterns of mean differences, and equivalent per-pair and all-pairs...

Journal: :Australian Journal of Physics 1997

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید