61,208 Hits in 4.6 sec

On arrays with some combinatorial structure

D.V. Chopra
1995 Discrete Mathematics  
We make some observations on the importance of these conditions to B-arrays, and discuss the applications of these arrays to design of experiments.  ...  We derive some necessary conditions for the existence of such arrays by using some well-known classical inequalities and the number of coincidences a certain column of the B-array has with other columns  ...  Acknowledgements Thanks are due to the referee for making some useful comments and suggestions which resulted in the improvement of the paper.  ... 
doi:10.1016/0012-365x(94)00138-9 fatcat:aq7udjfemfbi7irm7f5ggv6exe

Self-Similarity and Compositional Strategies in the Music of Milton Babbitt

John Cuciurean
1997 Canadian University Music Review  
My paper investigates the structure of pitch arrays and demonstrates how the hexachordally combinatorial properties of a given row can be used as transformational operators on the structural middleground  ...  Some critics might argue that this analytical approach is comparable to tapping a thumb tack into the wall with a sledge hammer, and perhaps in this simple case such an argument has some merit.  ...  This study focuses on three works that cover straightforward serial structures, simple array structures and superarray structures respectively -Babbitt's three main compositional strategies. 25It is beyond  ... 
doi:10.7202/1014783ar fatcat:ofghmiwuc5hr7mcseywl267dfq

Ultrafast Algorithm for Designing Focused Combinational Arrays

Dimitris K. Agrafiotis, Victor S. Lobanov
2000 Journal of chemical information and computer sciences  
A novel greedy algorithm for the design of focused combinatorial arrays is presented.  ...  Typical examples of design objectives that are amendable to this approach include maximum similarity to a known lead (or set of leads), maximum predicted activity according to some structure-activity or  ...  The method can be used to design combinatorial arrays based on maximum similarity to a known lead (or set of leads) or maximum predicted activity according to some QSAR, pharmacophore, or receptor binding  ... 
doi:10.1021/ci000038v pmid:10955534 fatcat:2jqzkeytvvgipjh5byvyoltsbq

Combinatorial testing for software: An adaptation of design of experiments

Raghu N. Kacker, D. Richard Kuhn, Yu Lei, James F. Lawrence
2013 Measurement (London)  
Combinatorial testing began as pairwise testing in which first orthogonal arrays and then covering arrays were used to make sure that all pairs of the test settings were tested.  ...  Combinatorial testing has become practical because efficient and free downloadable tools with support of constraints have become available.  ...  Acknowledgments We thank the NIST management for their support and we thank the Division Reader, the WERB Reader, and those who provided comments on earlier drafts of this paper.  ... 
doi:10.1016/j.measurement.2013.02.021 fatcat:vxz6f3lrwvhujpmwbpqdea45he

On General Perfect Secret Sharing Schemes [chapter]

G. R. Blakley, G. A. Kabatianski
1995 Lecture Notes in Computer Science  
the more restrictive combinatorial definition of ideal scheme.  ...  The purpose of this paper is to provide a general informationtheoretic framework extensible to arbitrary access structures and to establish the correspondence between ideal SSS and matroids without invoking  ...  Roughly speaking, combinatorial treatments of SSS deal with an array V whose rows are uniformly distributed, i.e. only with a uniform distribution of sharing rules (or, if one allows repetitions of row  ... 
doi:10.1007/3-540-44750-4_29 fatcat:d6cf6x5c45eflp4ib7nlmbvioy

Page 1515 of Mathematical Reviews Vol. 41, Issue 6 [page]

1971 Mathematical Reviews  
Dénes, J. 8255 Some combinatorial properties of transformations and their connections with the theory of graphs. J. Combinatorial Theory 9 (1970), 108-116.  ...  Wallis, Jennifer 8256 A résumé of some recent results on Hadamard matrices, (v, k, A)-graphs and block designs. - Combinatorial Structures and their Applications (Proc. Calgary Internat.  ... 

MEMS tools for combinatorial materials processing and high-throughput characterization

A Ludwig, J Cao, J Brugger, I Takeuchi
2004 Measurement science and technology  
Using the combinatorial material synthesis approach, materials libraries can be produced in one experiment that contain up to several thousand samples on a single substrate.  ...  Microstructured wafers, which incorporate sensor or actuator structures such as electrode or cantilever arrays, can be used to identify materials properties in an efficient way.  ...  Therefore, this paper illustrates the utility of MEMS tools for combinatorial materials research and highlights some recent results in these areas.  ... 
doi:10.1088/0957-0233/16/1/015 fatcat:knhnomg2ifbwngd7kuf5oz6rzq

Attack pattern-based combinatorial testing

Josip Bozic, Dimitris E. Simos, Franz Wotawa
2014 Proceedings of the 9th International Workshop on Automation of Software Test - AST 2014  
We extend previous work in combining the attack pattern models with combinatorial testing in order to provide concrete test input, which is submitted to the system under test.  ...  With combinatorial testing we capture different combinations of inputs and thus increasing the likelihood to find weaknesses in the implementation under test that can be exploited.  ...  Combinatorial Grammar for XSS Attack Vectors In this section, we consider a general structure for XSS attack vectors (test inputs) where each one of them is comprised of 12 discrete parameters where 6  ... 
doi:10.1145/2593501.2593502 dblp:conf/icse/BozicSW14 fatcat:6o3z2izy6bevpajow774r5gbca

Page 6186 of Mathematical Reviews Vol. , Issue 94k [page]

1994 Mathematical Reviews  
The author introduces the notion of a Barker structure, a property that is enjoyed by all s x ¢ Barker arrays with st > 2.  ...  (English summary) Optimal combinatorial structures on discrete mathematical models (Japanese) (Kyoto, 1992). Sarikaisekikenkyusho Kokyuroku No. 820 (1993), 119-124.  ... 

Page 7169 of Mathematical Reviews Vol. , Issue 95m [page]

1995 Mathematical Reviews  
V. (1-WCHS; Wichita, KS) On arrays with some combinatorial structure. (English summary) 14th British Combinatorial Conference (Keele, 1993). Discrete Math. 138 (1995), no. 1-3, 193-198.  ...  We derive some necessary conditions for the existence of such arrays by using some well-known classical inequalities and the number of coincidences a certain column of the B-array has with other columns  ... 

Combinatorial chemistry: starting the second decade

D S Thorpe
2001 The Pharmacogenomics Journal  
In some ways, however, combinatorial chemistry has been disap-pointing for pharmaceutical scientists.  ...  In this Perspective, I will briefly introduce the basic concepts of combinatorial chemistry, describe its strengths and weaknesses with an eye to efficiencies, and highlight some ongoing changes to enhance  ... 
doi:10.1038/sj.tpj.6500045 pmid:11908762 fatcat:ambjchnus5eonlkvzkyvfmiff4

Page 1769 of Mathematical Reviews Vol. 51, Issue 6 [page]

1976 Mathematical Reviews  
The author considers arrays with a combinatorial structure slightly weaker than these of O-arrays and B-arrays.  ...  Radhakrishna 12574 Some combinatorial problems of arrays and applications to design of experiments. A survey of combinatorial theory (dedicated to R. C.  ... 

Page 4065 of Mathematical Reviews Vol. 58, Issue 6 [page]

1979 Mathematical Reviews  
Some results on equidistant permutations. Proceedings of the Sixth Manitoba Conference on Numerical Mathematics (Univ. Manitoba, Winnipeg, Man., 1976), pp. 389-410. Congress. Numer., XVIII.  ...  A is then called the index of the array. We construct arrays of index one and two, using both algebraic and recursive techniques. We briefly discuss the coding aspects of such permutations.”  ... 

Compact combinatorial maps: A volume mesh data structure

Xin Feng, Yuanzhen Wang, Yanlin Weng, Yiying Tong
2013 Graphical Models  
Its time complexity for commonly-used incidence and adjacency queries such as vertex and dart one-rings is analyzed.  ...  We propose a compact data structure for volumetric meshes of arbitrary topology and bounded valence that offers cell-face, face-edge, and edge-vertex incidence queries in constant time.  ...  While our data structure is based on the compact, array-based mesh data structure [1] , we provide a simple but generic method for defining volume cell types, complete the data structure with a list of  ... 
doi:10.1016/j.gmod.2012.10.001 fatcat:xekh26h5yfbhpgupb5jwolstom

Properties of Realistic Feature Models Make Combinatorial Testing of Product Lines Feasible [chapter]

Martin Fagereng Johansen, Øystein Haugen, Franck Fleurey
2011 Lecture Notes in Computer Science  
Based on this, we investigate covering array generation time and results for realistic feature models and find where the algorithms can be improved.  ...  Thus, we show that combinatorial interaction testing of product lines is feasible in practice.  ...  The reason is that covering array sizes are not really dependent on the number of features but on the structure of the feature model.  ... 
doi:10.1007/978-3-642-24485-8_47 fatcat:jyrhtuonnjcije6uy3azsk4m2u
« Previous Showing results 1 — 15 out of 61,208 results