Results 31 to 40 of about 171,148 (274)
On the Classification of Splitting (v, u×c, λ) BIBDs
Cybernetics and Information Technologies, 2018 The (v, u×c, λ)-splitting balanced incomplete block designs correspond to c-splitting authentication codes. We classify splitting balanced incomplete block designs with definite parameters.
Zhelezova Stela
doaj +1 more source
Regular A-optimal Spring Balance Weighing Designs
Revstat Statistical Journal, 2012 The problem of indicating an A-optimal spring balance weighing design providing that the measurement errors have different variances and are uncorrelated is considered.
Małgorzata Graczyk
doaj +1 more source
On balanced incomplete block designs with specified weak chromatic number
, 2013 A weak $c$-colouring of a balanced incomplete block design (BIBD) is a colouring of the points of the design with $c$ colours in such a way that no block of the design has all of its vertices receive the same colour.
Horsley, Daniel, Pike, David A.
core +1 more source
Remarks on balanced incomplete block designs [PDF]
Proceedings of the American Mathematical Society, 1963 PROOF. Assume the hypothesis and the falsity of either conclusion. Construct matrix A of 2x+2 rows and 4x+4 columns, with entries + 1 and - 1. The first column contains exclusively + 1, and the second column - 1. Set up one-to-one correspondences between rows of A and elements of D; between columns other than the first two of A and blocks of D. Enter +
openaire +1 more source
Highly D‑efficient Weighing Design and Its Construction
Acta Universitatis Lodziensis. Folia Oeconomica, 2017 In this paper, some aspects of design optimality on the basis of spring balance weighing designs are considered. The properties of D‑optimal and D‑efficiency designs are studied.
Bronisław Ceranka, Małgorzata Graczyk
doaj +1 more source
Spectrum of Sizes for Perfect Deletion-Correcting Codes [PDF]
, 2010 One peculiarity with deletion-correcting codes is that perfect $t$-deletion-correcting codes of the same length over the same alphabet can have different numbers of codewords, because the balls of radius $t$ with respect to the Levenshte\u{\i}n distance ...
Alan C. H. Ling +15 more
core +1 more source
Deterministic Construction of Measurement Matrices Based on Bose Balanced Incomplete Block Designs
IEEE Access, 2018 Compressed sensing is a novel information collection theory. Compared with the Nyquist sampling theorem, compressed sensing can obtain all the information of a signal with very few samples.
Liu Haiqiang +4 more
doaj +1 more source
Prime-number-assisted block-based neighbor discovery protocol in wireless sensor networks
International Journal of Distributed Sensor Networks, 2019 During the initial deployment time, wireless sensors continually search their neighbors. The neighbor discovery is not an one-time event because the network topology can be changed anytime due to node mobility and failure. The neighbor discovery protocol
Woosik Lee +2 more
doaj +1 more source
Augmented BIB Design-An Alternative Statistical Design in Germplasm Evaluation Trials
Journal of Horticultural Sciences, 2008 Randomized Block Design (RBD) is commonly employed to evaluate a set of germplasm accessions (test treatments) along with local checks. In such a trial, if the test treatments under evaluation are more in number and the availability of the seeds is ...
R Venugopalan +2 more
doaj +1 more source
Potential therapeutic targeting of BKCa channels in glioblastoma treatment
Molecular Oncology, EarlyView.This review summarizes current insights into the role of BKCa and mitoBKCa channels in glioblastoma biology, their potential classification as oncochannels, and the emerging pharmacological strategies targeting these channels, emphasizing the translational challenges in developing BKCa‐directed therapies for glioblastoma treatment.
Kamila Maliszewska‐Olejniczak +4 more
wiley +1 more source