Results 11 to 20 of about 36,439 (252)
CONSTRUCTIONS OF GROUP DIVISIBLE DESIGNS
JOURNAL OF THE JAPAN STATISTICAL SOCIETY, 1995 Summary: Methods of construction of group divisible designs are discussed. Making use of these methods, a new group divisible design and nine new non-isomorphic solutions for group divisible designs are given in the same range of parameters as by \textit{W. H. Clatworthy} [Tables of two-associate-class partially balanced designs. (1973; Zbl 0289.05017)]
Duan, Xiaoping, Kageyama, Sanpei
openaire +3 more sources
Collusion Attack Resilient 3D Mesh Watermarking Based on Anti-Collusion Fingerprint Code
Applied Sciences, 2018 Collusion attack is one of the techniques used for unauthorized removal of embedded marks. However, there are no algorithms that utilize the averaging-resilient fingerprint code into 3D mesh watermarking.
Jong-Uk Hou, In-Jae Yu, Heung-Kyu Lee
doaj +1 more source
Resolvable Group Divisible Designs with Large Groups
The Electronic Journal of Combinatorics, 2016 We prove that the necessary divisibility conditions are sufficient for the existence of resolvable group divisible designs with a fixed number of sufficiently large groups. Our method combines an application of the Rees product construction with a streamlined recursion based on incomplete transversal designs. With similar techniques, we also obtain new
Peter J. Dukes +2 more
openaire +2 more sources
Constructions of Sarvate-Beam Group Divisible Designs
Graphs and Combinatorics, 2022 A balanced incomplete block design is a set system in which all pairs of distinct elements occur with a constant frequency. By contrast, a Sarvate-Beam design induces an interval of distinct frequencies on pairs. In this paper, we settle the existence of a Sarvate-Beam variant of group divisible designs of uniform type with block size three.
Peter J. Dukes, Joanna Niezen
openaire +3 more sources
HFR Code: A Flexible Replication Scheme for Cloud Storage Systems
, 2015 Fractional repetition (FR) codes are a family of repair-efficient storage codes that provide exact and uncoded node repair at the minimum bandwidth regenerating point.
Li, Hui +3 more
core +1 more source
Class-Uniformly Resolvable Group Divisible Structures I: Resolvable Group Divisible Designs [PDF]
The Electronic Journal of Combinatorics, 2004 We consider Class-Uniformly Resolvable Group Divisible Designs (CURGDD), which are resolvable group divisible designs in which each of the resolution classes has the same number of blocks of each size. We derive the fully general necessary conditions including a number of extremal bounds.
Peter Danziger, Brett Stevens
openaire +2 more sources
Group divisible designs with block size five [PDF]
Australas. J Comb., 2022 We report some group divisible designs with block size five, including types $6^{15}$ and $10^{15}$. As a consequence we are able to extend the known spectrum for 5-GDDs of type $g^u$.
openaire +3 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen +23 more
wiley +1 more source
Generalized Log-Normal Chain-Ladder
, 2018 We propose an asymptotic theory for distribution forecasting from the log normal chain-ladder model. The theory overcomes the difficulty of convoluting log normal variables and takes estimation error into account. The results differ from that of the over-
B. Nielsen +6 more
core +1 more source
Semifields, relative difference sets, and bent functions [PDF]
, 2014 Recently, the interest in semifields has increased due to the discovery of several new families and progress in the classification problem. Commutative semifields play an important role since they are equivalent to certain planar functions (in the case ...
Pott, Alexander +2 more
core +2 more sources