نتایج جستجو برای: row distance

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

خدائیان , ناهید , زاهدی, مرتضی ,

To evaluate the effects of row spacing and plant density on yield and yield components of sweet corn, variety KSC403, an experiment was conducted in Research Farm of Isfahan University of Technology, Isfahan, Iran, in 2007, as randomized complete block design with a split-plot layout and three replications. The main plots were allocated to two row spacing (60 and 75 cm) and the sub-plots accomm...

2004
Axel HUEBNER Gerd RICHTER

A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row pe...

Journal: :CoRR 2016
Clarice Poon

This paper considers the use of the anisotropic total variation seminorm to recover a two dimensional vector x ∈ CN×N from its partial Fourier coefficients, sampled along Cartesian lines. We prove that if (xk,j − xk−1,j)k,j has at most s1 nonzero coefficients in each column and (xk,j − xk,j−1)k,j has at most s2 nonzero coefficients in each row, then, up to multiplication by log factors, one can...

1999
Christine Fragouli Richard D. Wesel

This paper presents a method for efficient coding at high spectral efficiency using parallel concatenated trellis coded modulation (PCTCM) with symhol interleaving. The constituent encoders are optimized for symholwise free distance, and each has an infinite symbol-wise impulse response. In many eases of practical interest, the optimal structure for these constituent encoders connects the memor...

Journal: :IEICE Transactions 2012
Jung Youl Park Hong-Yeop Song

and a positive integer m. The resulted array has ( |PA(p, k)| · p(m−1)(p−k) )m rows. Compared to the other constructions, the new construction gives a permutation array of far bigger size with a large minimum distance, for example, when k ≥ 2p/3. Moreover the proposed construction provides an algorithm to find the i-th row of PA ( pm, pm−1k ) for a given index i very simply. key words: permutat...

2011
Vaishali Kulkarni

In this paper, we propose Speaker Identification using two transforms, namely Haar Transform and Kekre’s Transform. The speech signal spoken by a particular speaker is converted into a spectrogram by using 25% and 50% overlap between consecutive sample vectors. The two transforms are applied on the spectrogram. The row mean of the transformed matrix forms the feature vector, which is used in th...

2007
NIU Zhisheng LI Lei

Cochannel interference introduced by frequency reuse under space division multiple access can be reduced by controlling the frequency sharing according to the users’ spatial separability. The system avoids placing highly correlated users in space into the same spatial multiplexing group. This paper describes a user spatial compatibility evaluation criterion based on channel matrix structure ana...

2010
Martha T. Hamblin Timothy J. Close Prasanna R. Bhat Shiaoman Chao Jennifer G. Kling K. Joseph Abraham Tom Blake Patrick M. Hayes David J. Hole Richard D. Horsley Donald E. Obert Kevin P. Smith Steven E. Ullrich Gary J. Muehlbauer Jean-Luc Jannink

Previous studies have shown that there is considerable population structure in cultivated barley (Hordeum vulgare L.), with the strongest structure corresponding to differences in row number and growth habit. U.S. barley breeding programs include six-row and two-row types and winter and spring types in all combinations. To facilitate mapping of complex traits in breeding germplasm, 1816 barley ...

2017
Charlotte Laclau Ievgen Redko Basarab Matei Younès Bennani Vincent Brault

In this paper, we present a novel method for co-clustering, an unsupervised learning approach that aims at discovering homogeneous groups of data instances and features by grouping them simultaneously. The proposed method uses the entropy regularized optimal transport between empirical measures defined on data instances and features in order to obtain an estimated joint probability density func...

2018
Yantao Liu Yasser Morgan

With this paper, we propose a network coding based cloud storage scheme. The storage system is in the form of an m * n data array. The n columns stand for n storage nodes, which are comprised of a part of systematic nodes storing source symbols and a part of nonsystematic nodes storing parity symbols. Every row of the data array is a (n, k) systematic Maximum Distance Separable (MDS) code. A so...

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

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