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

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

Journal: :بینا 0
بهروز مالکی b maleki انجمن اپتومتری فارس عباس ریاضی a riazi baghiatallah university of medical sciences, tehran, iranتهران- دانشگاه علوم پزشکی بقیه اله- گروه چشم پزشکی- درمانگاه کم بینایی

purpose: e is a commonly use letter for illiterates or those who could not read english to measure visual acuity. the e chart is the mainly used charts in iran. however, they do not have the standards. they are in different format, fixed for 6 meter test, with or without lighting, with unequal number of letters in each line and different contrasts. as a result, there is an essential need for a ...

Journal: :Discrete Applied Mathematics 2008
Toshihide Ibaraki Shinji Imahori Koji Nonobe Kensuke Sobue Takeaki Uno Mutsunori Yagiura

We proposed an iterated local search algorithm for the vehicle routing problem with capacity and time window constraints in [1]. We conducted some computational experiments to evaluate the proposed algorithm. The algorithm was coded in C language and run on an IBM-compatible PC (Intel Pentium 4, 2.8 GHz, 1 GB memory). We used the following benchmark instances: (1) Solomon’s benchmark instances ...

Journal: :IEEE Trans. Information Theory 2002
Simon Litsyn Vladimir Shevelev

We derive expressions for the average distance distributions in several ensembles of regular low-density parity-check codes (LDPC). Among these ensembles are the standard one defined by matrices having given column and row sums, ensembles defined by matrices with given column sums or given row sums, and an ensemble defined by bipartite graphs.

2004
Gerd Richter Simon Plass

This paper investigates error and erasure decoding methods for codes with maximum rank distance. These codes can be used for correcting column and row errors and erasures in an ( ) array. Such errors occur e.g. in magnetic tape recording or in memory chip arrays. For maximum rank distance codes (Rank-Codes), there exists a decoding algorithm similar to the Peterson-Gorenstein-Zierler technique ...

2000
Arnold Meijster Jos B. T. M. Roerdink Wim H. Hesselink

A new general algorithm for computing distance transforms of digital images is presented. The algorithm consists of two phases. Both phases consist of two scans, a forward and a backward scan. The first phase scans the image column-wise, while the second phase scans the image row-wise. Since the computation per row (column) is independent of the computation of other rows (columns), the algorith...

Journal: :CoRR 2014
Xianyan Wu Qi Han Dan Le Xiamu Niu

Image width is important for image understanding. We propose a novel method to estimate widths for JPEG images when their widths are not available. The key idea is that the distance between two decoded MCUs (Minimum Coded Unit) adjacent in the vertical direction is usually small, which is measured by the average Euclidean distance between the pixels from the bottom row of the top MCU and the to...

Journal: :چغندرقند 0
جواد بهمنش دانشگاه ارومیه امیر نورجو دانشگاه ارومیه

this study was conducted in split plot design based on a randomized complete block design in naghadeh region, urmia, iran in 2009-10. two sowing patterns including a1) single row planting with 50 cm between-row spacing, and a2) two rows planting on the hill with 40 cm distance and 50 cm between-row spacing (40×50) were allocated to main plots and four furrow compactions including b1) control, b...

2006
Sadao Tomizawa Nobuko Miyamoto Masami Ouchi S. Tomizawa N. Miyamoto

• For square contingency tables with ordered categories, this paper proposes some distance subsymmetry models. The one model indicates that the cumulative probability that an observation will fall in row category i or below and column category i + k (k ≥ 2) or above, is equal to the probability that it falls in column category i or below and row category i+k or above. This paper also gives the ...

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

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