نتایج جستجو برای: covering array

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

2017
I. M. Soganci T. Tanemura K. A. Williams N. Calabretta T. de Vries E. Smalbrugge M. K. Smit H. J. S. Dorren Y. Nakano

Integrated InP/InGaAsP phased-array 1x16 optical switch is fabricated and characterized for broadband WDM optical packet switching. Wavelength-insensitive operation covering the C-band and penalty-free transmission of 40-Gbps signal are demonstrated.

Journal: :Genome research 2006
Heike Fiegler Richard Redon Dan Andrews Carol Scott Robert Andrews Carol Carder Richard Clark Oliver Dovey Peter Ellis Lars Feuk Lisa French Paul Hunt Dimitrios Kalaitzopoulos James Larkin Lyndal Montgomery George H Perry Bob W Plumb Keith Porter Rachel E Rigby Diane Rigler Armand Valsesia Cordelia Langford Sean J Humphray Stephen W Scherer Charles Lee Matthew E Hurles Nigel P Carter

This study describes a new tool for accurate and reliable high-throughput detection of copy number variation in the human genome. We have constructed a large-insert clone DNA microarray covering the entire human genome in tiling path resolution that we have used to identify copy number variation in human populations. Crucial to this study has been the development of a robust array platform and ...

2010
Charles J. Colbourn

Let N , k, t, and v be positive integers. Let C be an N × k array with entries from an alphabet Σ of size v; we typically take Σ = {0, . . . , v − 1}. When (ν1, . . . , νt) is a t-tuple with νi ∈ Σ for 1 ≤ i ≤ t, (c1, . . . , ct) is a tuple of t column indices (ci ∈ {1, . . . , k}), and ci 6= cj whenever νi 6= νj , the t-tuple {(ci, νi) : 1 ≤ i ≤ t} is a t-way interaction. The array covers the ...

In this article, we introduce the concept of co-covering which is the dual of covering concept. Then, we prove several theorems being similar to the theorems that have been de-veloped for the covering concept. For example, we provide the lifting criterion for co-coverings of a topological space X, which helps us to classify them by subgroups of the group of all homeomorphisms of X.

Covering arrays of strength two have been widely studied as combinatorial models of software interaction test suites for pairwise testing. While numerous algorithmic techniques have been developed for the generation of covering arrays with few columns (factors), the construction of covering arrays with many factors and few tests by these techniques is problematic. Random generation techniques c...

2012
Martin Fagereng Johansen Øystein Haugen Franck Fleurey Erik Carlson Jan Endresen Tormod Wien

Product line developers must ensure that existing and new features work in all products. Adding to or changing a product line might break some of its features. In this paper, we present a technique for automatic and agile interaction testing for product lines. The technique enables developers to know if features work together with other features in a product line, and it blends well into a proc...

2009
N. Kanekar W. M. Lane E. Momjian F. H. Briggs J. N. Chengalur

We have used the Very Long Baseline Array to image 18 quasars with foreground damped Lyman-α systems (DLAs) at 327, 610 or 1420 MHz, to measure the covering factor f of each DLA at or near its redshifted HI 21cm line frequency. Including six systems from the literature, we find that none of 24 DLAs at 0.09 < z < 3.45 has an exceptionally low covering factor, with f ∼ 0.45−1 for the 14 DLAs at z...

Journal: :Electr. J. Comb. 2011
Jim Lawrence Raghu Kacker Yu Lei D. Richard Kuhn Michael A. Forbes

Binary covering arrays of strength t are 0–1 matrices having the property that for each t columns and each of the possible 2 sequences of t 0’s and 1’s, there exists a row having that sequence in that set of t columns. Covering arrays are an important tool in certain applications, for example, in software testing. In these applications, the number of columns of the matrix is dictated by the app...

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

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