Results 31 to 40 of about 70,607 (282)
Coded Caching based on Combinatorial Designs
We consider the standard broadcast setup with a single server broadcasting information to a number of clients, each of which contains local storage (called \textit{cache}) of some size, which can store some parts of the available files at the server. The
Agrawal, Shailja +2 more
core +1 more source
Nontrivial t-Designs over Finite Fields Exist for All t
A $t$-$(n,k,\lambda)$ design over $\F_q$ is a collection of $k$-dimensional subspaces of $\F_q^n$, called blocks, such that each $t$-dimensional subspace of $\F_q^n$ is contained in exactly $\lambda$ blocks.
Fazeli, Arman +2 more
core +1 more source
Combinatorial assembly and design of enzymes
The design of structurally diverse enzymes is constrained by long-range interactions that are necessary for accurate folding. We introduce an atomistic and machine learning strategy for the combinatorial assembly and design of enzymes (CADENZ) to design fragments that combine with one another to generate diverse, low-energy structures with stable ...
Lipsh-Sokolik, R. +7 more
openaire +3 more sources
A Census Of Highly Symmetric Combinatorial Designs
As a consequence of the classification of the finite simple groups, it has been possible in recent years to characterize Steiner t-designs, that is t-(v,k,1) designs, mainly for t = 2, admitting groups of automorphisms with sufficiently strong symmetry ...
A. Delandtsheer +39 more
core +1 more source
Small examples of mosaics of combinatorial designs
We give the first example of a mosaic of three combinatorial designs with distinct parameters 2-(13,3,1), 2-(13,4,2), and 2-(13,6,5). Furthermore, we give examples of mosaics of 2-(9,3,2) designs that are not resolvable, thereby answering a question ...
Vedran Krčadinac
doaj +1 more source
This paper proposes a novel combinatorial approach for the optimization design of the asymmetric-paths winding, to solve the design contradiction between the asymmetric degree and the tidiness of end connections.
Yanping Liang +5 more
doaj +1 more source
Entanglement and quantum combinatorial designs
We introduce several classes of quantum combinatorial designs, namely quantum Latin squares, cubes, hypercubes and a notion of orthogonality between them. A further introduced notion, quantum orthogonal arrays, generalizes all previous classes of designs.
Di Martino, Sara +3 more
core +1 more source
On quasi-orthogonal cocycles [PDF]
We introduce the notion of quasi-orthogonal cocycle. This is motivated in part by the maximal determinant problem for square {±1}-matrices of size congruent to 2 modulo 4. Quasi-orthogonal cocycles are analogous to the orthogonal cocycles of algebraic
Armario Sampalo, José Andrés +1 more
core +1 more source
DeviceEditor visual biological CAD canvas
Background Biological Computer Aided Design (bioCAD) assists the de novo design and selection of existing genetic components to achieve a desired biological activity, as part of an integrated design-build-test cycle.
Chen Joanna +4 more
doaj +1 more source
Methodology for Automated Design of Quantum-Dot Cellular Automata Circuits
Quantum-dot Cellular Automata (QCA) provide very high scale integration potential, very high switching frequency, and have extremely low power demands, which make the QCA technology quite attractive for the design and implementation of large-scale, high ...
Orestis Liolis +4 more
doaj +1 more source

