Results 21 to 30 of about 70,607 (282)
QUANTUM COMBINATORIAL DESIGN [PDF]
Proceedings of the Design Society, 2021 AbstractCombinatorial Design such as configuration design, design optioneering, component selection, and generative design, is common across engineering. Generating solutions for a combinatorial design task often involves the application of classical computing solvers that can either map or navigate design spaces.
James Gopsill, Guy Johns, Ben Hicks
openaire +1 more source
BMC Bioinformatics, 2021 Background Systems biology increasingly relies on deep sequencing with combinatorial index tags to associate biological sequences with their sample, cell, or molecule of origin.
Lior Galanti +2 more
doaj +1 more source
On Singularities and Black Holes in Combination-Driven Models of Technological Innovation Networks. [PDF]
PLoS ONE, 2016 It has been suggested that innovations occur mainly by combination: the more inventions accumulate, the higher the probability that new inventions are obtained from previous designs.
Ricard Solé +2 more
doaj +1 more source
PRX Quantum, 2022 While quantum circuits built from two-particle dual-unitary (maximally entangled) operators serve as minimal models of typically nonintegrable many-body systems, the construction and characterization of dual-unitary operators themselves are only ...
Suhail Ahmad Rather +2 more
doaj +1 more source
IEEE Access, 2023 Non-orthogonal multiple-access (NOMA) is designed to transmit massive amounts of user communications. The incidence matrix manages the relationship between users and resources. This study focused on increasing user supportability and complexity reduction
Eli Hwang, Xing Hao, Guillermo E. Atkin
doaj +1 more source
Combinatorial designs for deep learning [PDF]
Journal of Combinatorial Designs, 2020 AbstractDeep learning is a machine learning methodology using a multilayer neural network. Let be mutually disjoint node sets (layers). A multilayer neural network can be regarded as a union of the complete bipartite graphs on consecutive two node sets and for .
Shoko Chisaki +2 more
openaire +3 more sources
A survey and refinement of repairable threshold schemes
Journal of Mathematical Cryptology, 2018 We consider repairable threshold schemes (RTSs), which are threshold schemes that enable a player to securely reconstruct a lost share with help from their peers.
Laing Thalia M., Stinson Douglas R.
doaj +1 more source
Hadamard Matrices with Cocyclic Core
Mathematics, 2021 Since Horadam and de Launey introduced the cocyclic framework on combinatorial designs in the 1990s, it has revealed itself as a powerful technique for looking for (cocyclic) Hadamard matrices.
Víctor Álvarez +5 more
doaj +1 more source
Fractional repetition codes with flexible repair from combinatorial designs [PDF]
, 2016 Fractional repetition (FR) codes are a class of regenerating codes for distributed storage systems with an exact (table-based) repair process that is also uncoded, i.e., upon failure, a node is regenerated by simply downloading packets from the surviving
Olmez, Oktay +2 more
core +3 more sources
Absolutely Maximally Entangled states, combinatorial designs and multi-unitary matrices [PDF]
, 2015 Absolutely Maximally Entangled (AME) states are those multipartite quantum states that carry absolute maximum entanglement in all possible partitions. AME states are known to play a relevant role in multipartite teleportation, in quantum secret sharing ...
Alsina, Daniel +4 more
core +2 more sources