Results 241 to 250 of about 55,578 (283)
Experimental demonstration of dual-polarization multiplexed optical phased array empowered by inverse design. [PDF]
Kim JY +6 more
europepmc +1 more source
Step count as a digital mobility outcome in orthopedics and orthopedic trauma surgery: a scoping review. [PDF]
Braun BJ +10 more
europepmc +1 more source
On Using Electric Circuit Models to Analyze Electric Field Distributions in Insulator-Based Electrokinetically Driven Microfluidic Devices. [PDF]
de Los Santos-Ramirez JM +3 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Thwarts in transversal designs
Designs, Codes, and Cryptography, 1995A subset of points in a transversal design is a thwart if each block in the design has one of a small number of intersection sizes with the subset. While the details are too complicated to state here, the authors study thwarts (subconfigurations) of transversal deisgns via the use of a version of Wilson's theorem.
Charles J. Colbourn +2 more
exaly +3 more sources
Journal of Combinatorial Designs, 2000
Let \(G_1,G_2,\dots, G_r\) (called groups) be a partition \(G\) of a set of points \(V\), and \(B^*\) be a collection of subsets (called blocks) of \(V\). A triple \((V,G,B^*)\) is called a group-divisible design (GDD) if \(|G_i\cap B|\leq 1\) for all \(G_i\in G\) and \(B\in B^*\) and for any two points \(x\), \(y\) from distinct groups there is only ...
Mariusz Meszka, Dalibor Froncek
exaly +3 more sources
Let \(G_1,G_2,\dots, G_r\) (called groups) be a partition \(G\) of a set of points \(V\), and \(B^*\) be a collection of subsets (called blocks) of \(V\). A triple \((V,G,B^*)\) is called a group-divisible design (GDD) if \(|G_i\cap B|\leq 1\) for all \(G_i\in G\) and \(B\in B^*\) and for any two points \(x\), \(y\) from distinct groups there is only ...
Mariusz Meszka, Dalibor Froncek
exaly +3 more sources
Transversal designs associated with frobenius groups
Journal of Geometry, 1981To any Frobenius group G (of degree s, with Frobenius complement of order k) we associate an (s,k) -transversal design Δ(G) which admits G as a point-regular collineation group. Δ(G) is in fact also a dual translation net and furthermore admits a flag-regular collineation group. Also, Δ(G) has two orthogonal resolutions.
Dieter Jungnickel
exaly +3 more sources
On simple and supersimple transversal designs
Journal of Combinatorial Designs, 2000Given a positive integer \(r\), a transversal design \(\text{TD}_\lambda(k,g)\) is \(r\)-simple if and only if any two distinct blocks (of size \(k\)) have less than \(r\) elements in common. For brevity, \(k\)-simple and 3-simple are simple and supersimple, respectively. \textit{H.-D. O. F. Gronau} and \textit{R. C. Mullin} [J. Comb. Math.
exaly +3 more sources
New Construction for Transversal Design
Journal of Computational Biology, 2006The study of gene functions requires the development of a DNA library of high quality through much of testing and screening. Pooling design is a mathematical tool to reduce the number of tests for DNA library screening. The transversal design is a special type of pooling design, which is good in implementation.
Ding-Zhu Du +3 more
openaire +2 more sources

