Results 11 to 20 of about 26,581 (261)
Discrete choice experiments: An overview on constructing D-optimal and near-optimal choice sets
Heliyon, 2023 Discrete choice experiments (DCEs) are frequently used to estimate and forecast the behavior of an individual's choice. DCEs are based on stated preference; therefore, underlying experimental designs are required for this type of study.
Abdulrahman S. Alamri +2 more
doaj +1 more source
Computational design of orthogonal ribosomes [PDF]
Nucleic Acids Research, 2008 Orthogonal ribosomes (o-ribosomes), also known as specialized ribosomes, are able to selectively translate mRNA not recognized by host ribosomes. As a result, they are powerful tools for investigating translational regulation and probing ribosome structure. To date, efforts directed towards engineering o-ribosomes have involved random mutagenesis-based
Chubiz, Lon M., Rao, Christopher V.
openaire +2 more sources
IEEE Access, 2018 In this paper, we consider a densely deployed phantom cell system providing a low latency network for massive connectivity. Non-orthogonal pilot designs serve as a promising solution to support a large number of users, but fast collision detection at the
Ayon Quayum +2 more
doaj +1 more source
Designs With Mutually Orthogonal Resolutions
European Journal of Combinatorics, 1986 A combinatorial design D with replication number r is said to be resolvable if the blocks of D can be partitioned into classes \(R_ 1,R_ 2,...,R_ r\) such that each element of D is contained in precisely one block of each class. Two resolutions R and R' of D are called orthogonal if \(| R_ i\cap R_ j'| \leq 1\) for all \(R_ i\in R\), \(R_ j'\in R'\). A
Esther R. Lamken, Scott A. Vanstone
openaire +2 more sources
Journal of Mathematics, 2022 Combinatorial designs have many interesting and genuine wide applications in areas including analysis and design of algorithms, cryptography, analysis and design of experiments, storage system design, tournament scheduling, optical communications, and ...
A. El-Mesady +2 more
doaj +1 more source
Orthogonally Resolvable Matching Designs
Discrete Mathematics, 2018 An Orthogonally resolvable Matching Design OMD$(n, k)$ is a partition of the edges the complete graph $K_n$ into matchings of size $k$, called blocks, such that the blocks can be resolved in two different ways. Such a design can be represented as a square array whose cells are either empty or contain a matching of size $k$, where every vertex appears ...
Peter Danziger, S. Park
openaire +2 more sources
Construction of generalized rotations and quasi-orthogonal matrices
Special Matrices, 2019 We propose some methods for the construction of large quasi-orthogonal matrices and generalized rotations that may be used in applications in data communications and image processing.
Verde-Star Luis
doaj +1 more source
A New Class of Second-Order Response Surface Designs
IEEE Access, 2020 Response surface methodology (RSM) refers to experimental designs for optimizing or developing processes, initially in manufacturing. In this paper, a new method is presented and an algorithm is implemented that modifies the axial part in a central ...
Hleil Alrweili +2 more
doaj +1 more source
Graph design for data authentication over insecure communication channel
Alexandria Engineering Journal, 2023 Data authentication is a critical issue in communication systems. Based on data authentication techniques, the receiver can affirm that the data is really sent from an authentic sender and it is not a fabricated message from an opponent.
H. Shabana, R. El-Shanawany, S.R. Halawa
doaj +1 more source
A Statistical Model for the 2-Part Balanced Incomplete Block Design
UMYU Scientifica Journal, 2023 Multi-part Balanced Incomplete Block Designs combine many orthogonal balanced incomplete block designs in the same block. The design has been used to study cancer trials with medical centres as blocks.
Naziru Isah Muhammad +2 more
doaj +1 more source