Results 81 to 90 of about 2,772 (191)

Pancyclic BIBD block-intersection graphs

open access: yesDiscrete Mathematics, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aygul Mamut   +2 more
openaire   +2 more sources

Climate and soil conditions shape farmers’ climate change adaptation preferences

open access: yesAgricultural Economics, Volume 56, Issue 2, Page 165-187, March 2025.
Abstract Climate change poses a significant threat to agriculture and challenges farmers’ adaptive capacity. Understanding how farmers evaluate and prioritize different climate change adaptation measures under consideration of their natural environment is crucial yet widely overlooked.
Christian Stetter, Carla Cronauer
wiley   +1 more source

Detection of Factor XI Deficiency (FXID) and Complex Vertebral Malformation (CVM) in Bali Cattle

open access: yesMedia Peternakan, 2014
Factor XI Deficiency (FXID) is caused by imperfect insertion of poly adenine which is resulted in introduction of premature stop codon in FXI gene. Substitution of guanine into thymine in SLC35A3 gene caused Complex Vertebral Malformation (CVM).
S. W. Siswanti , C. Sumantri , Jakaria
doaj   +1 more source

On regular graphs with four distinct eigenvalues

open access: yes, 2016
Let $\mathcal{G}(4,2)$ be the set of connected regular graphs with four distinct eigenvalues in which exactly two eigenvalues are simple, $\mathcal{G}(4,2,-1)$ (resp. $\mathcal{G}(4,2,0)$) the set of graphs belonging to $\mathcal{G}(4,2)$ with $-1$ (resp.
Huang, Qiongxiang, Huang, Xueyi
core   +1 more source

All directed BIBDs with k = 3 exist

open access: yesJournal of Combinatorial Theory, Series A, 1980
Abstract A directed BIBD with parameters ( υ, b, r, k, λ ∗ ) is a BIBD with parameters ( υ, b, r, k, 2λ ∗ ) in which each ordered pair of varieties occurs together in exactly λ ∗ blocks. It is shown that λ ∗ υ(υ − 1) ≡ 0 (mod 3) is a necessary and sufficient condition for the existence of a directed ( υ, b ...
Jennifer Seberry, David B. Skillicorn
openaire   +2 more sources

Tic‐Tac‐Toe on Designs

open access: yesJournal of Combinatorial Designs, Volume 33, Issue 2, Page 58-71, February 2025.
ABSTRACT We consider playing the game of Tic‐Tac‐Toe on block designs BIBD( v , k , λ ) $(v,k,\lambda )$ and transversal designs TD( k , n ) $(k,n)$. Players take turns choosing points and the first player to complete a block wins the game. We show that triple systems, BIBD( v , 3 , λ ) $(v,3,\lambda )$, are a first‐player win if and only if v ≥ 5 $v ...
Peter Danziger   +3 more
wiley   +1 more source

All or Nothing at All [PDF]

open access: yes, 2015
We continue a study of unconditionally secure all-or-nothing transforms (AONT) begun in \cite{St}. An AONT is a bijective mapping that constructs s outputs from s inputs. We consider the security of t inputs, when s-t outputs are known.
D'Arco, Paolo   +2 more
core   +1 more source

Construction of Repairable Threshold Key Sharing Schemes Based on Resolvable Balanced Incomplete Block Design

open access: yesIET Information Security, Volume 2025, Issue 1, 2025.
In this paper, we construct two repairable threshold schemes (RTSs) using a resolvable balanced incomplete block design (RBIBD). First, a resolvable transversal design is given by mutually orthogonal Latin squares. Further, a RBIBD is obtained through the filling hole method, and two repairable key sharing threshold schemes based on the Ramp threshold ...
Xiuli Wang   +3 more
wiley   +1 more source

Nestings of BIBDs with block size four

open access: yesJournal of Combinatorial Designs, Volume 32, Issue 12, Page 715-743, December 2024.
Abstract In a nesting of a balanced incomplete block design (or BIBD), we wish to add a point (the nested point) to every block of a ( v , k , λ ) $(v,k,\lambda )$‐BIBD in such a way that we end up with a partial ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$‐BIBD. In the case where the partial ( v , k + 1 , λ + 1 ) $(v,k+1,\lambda +1)$‐BIBD is in fact a (
Marco Buratti   +2 more
wiley   +1 more source

一种新的光CDMA系统地址码的构造与分析

open access: yesGuangtongxin yanjiu, 2007
基于对LSOOC码的修正,提出了一种光谱幅度编码光码分多址(SAC-OCDMA)地址码的设计方案。分析了码字特性,与Hardmard、MQC、MFH、BIBD(m=2)码做了比较,设计了可调谐光纤布拉格光栅(FBG)编解码器,阐述了编解码原理。分析结果表明,该码字容量大,编解码方法简单,在光源和信道理想条件下可以消除多址干扰。
丁涛, 陈长缨, 胡国永
doaj  

Home - About - Disclaimer - Privacy