English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We prove the equivalence of two-symbol supersaturated designs (SSDs) with $N$(even) rows, $m$ columns, $s_{\rm max} = 4t +i$, where $i\in\{0,2\}$, $t \in\mathbb{Z}^{\geq 0}$ and resolvable incomplete block designs (RIBDs) whose anytwo blocks intersect in at most $(N+4t+i)/4$ points. Using this equivalence, weformulate the search for two-symbol E($s^2$)-optimal and minimax-optimal SSDswith $s_{\max} \in \{2,4,6\}$ as a search for RIBDs whose blocks intersectaccordingly. This allows developing a bit-parallel tabu search (TS) algorithm.The TS algorithm found E($s^2$)-optimal and minimax-optimal SSDs achieving thesharpest known E($s^2$) lower bound with $s_{\max} \in \{2,4,6\}$ of sizes$(N,m)=(16,25), (16,26), (16,27), (18,23),(18,24),(18,25),(18,26),(18,27),(18,28),$ $(18,29),(20,21),(22,22),(22,23),(24,24)$, and $(24,25)$. In each ofthese cases no such SSD could previously be found.

A bit-parallel tabu search algorithm for finding E($s^2$)-optimal and minimax-optimal supersaturated designs