Publications related to Disjoint sets

Computational Design of Steady 3D Dissection Puzzles

Dissection puzzles require assembling a common set of pieces into multiple distinct forms. Existing works focus on creating 2D dissection puzzles that form primitive or naturalistic shapes. Unlike 2D dissection puzzles that could be supported on a tabletop ...

WILEY2019

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Willy Zwaenepoel, Diego Didona

This paper introduces the concept of size-aware sharding to improve tail latencies for in-memory key-value stores, and describes its implementation in the Minos key-value store. Size-aware sharding distributes requests for keys to cores according to the si ...

USENIX ASSOC2019

Computing Crowd Consensus with Partial Agreement (Extended Abstract)

Quoc Viet Hung Nguyen, Thành Tâm Nguyên

Crowdsourcing has been widely established as a means to enable human computation at large-scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...

IEEE2018

Computing Crowd Consensus with Partial Agreement

Quoc Viet Hung Nguyen, Thành Tâm Nguyên

Crowdsourcing has been widely established as a means to enable human computation at large-scale, in particular for tasks that require manual labelling of large sets of data items. Answers obtained from heterogeneous crowd workers are aggregated to obtain a ...

2018

Angle-dependent magnetization dynamics with mirror-symmetric excitations in artificial quasicrystalline nanomagnet lattices

Dirk Grundler, Vinayak Shantaram Bhat

We report angle-dependent spin-wave spectroscopy on aperiodic quasicrystalline magnetic lattices, i.e., Ammann, Penrose P2 and P3 lattices made of large arrays of interconnected Ni80Fe20 nanobars. Spin-wave spectra obtained in the nearly saturated state co ...

2018

Counting Intersecting and Pairs of Cross-Intersecting Families

Andrei Kupavskii

A family of subsets of {1, ... , n} is called intersecting if any two of its sets intersect. A classical result in extremal combinatorics due to Erdos, Ko and Rado determines the maximum size of an intersecting family of k-subsets of {1, ... , n}. In this ...

Cambridge Univ Press2018

Matching fields and lattice points of simplices

Georg Peter Loho

We show that the Chow covectors of a linkage matching field define a bijection of lattice points and we demonstrate how one can recover the linkage matching field from this bijection. This resolves two open questions from Sturmfels & Zelevinsky (1993) on l ...

2018

Almost tiling of the Boolean lattice with copies of a poset

Istvan Tomon

Let P be a partially ordered set. If the Boolean lattice (2[n],⊂) can be partitioned into copies of P for some positive integer n, then P must satisfy the following two trivial conditions: (1) the size of P is a power of 2, (2) P has a unique maximal and m ...

ELECTRONIC JOURNAL OF COMBINATORICS2018

Families with no s pairwise disjoint sets

Andrei Kupavskii

For integers n >= s >= 2 let e (n, s) denote the maximum of vertical bar F vertical bar, where F is a family of subsets of an n- element set and F contains no s pairwise disjoint members. Half a century ago, solving a conjecture of Erd. os, Kleitman determ ...

Wiley2017

Signalling strength determines proapoptotic functions of STING

Freddy Radtke, Andrea Ablasser, Ute Koch, Muhammet Fatih Gülen

Mammalian cells use cytosolic nucleic acid receptors to detect pathogens and other stress signals. In innate immune cells the presence of cytosolic DNA is sensed by the cGAS-STING signalling pathway, which initiates a gene expression programme linked to ce ...

Springer Nature2017

Disjoint sets

Graph Chatbot

Chat with Graph Search

Computational Design of Steady 3D Dissection Puzzles

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Computing Crowd Consensus with Partial Agreement (Extended Abstract)

Computing Crowd Consensus with Partial Agreement

Angle-dependent magnetization dynamics with mirror-symmetric excitations in artificial quasicrystalline nanomagnet lattices

Counting Intersecting and Pairs of Cross-Intersecting Families

Matching fields and lattice points of simplices

Almost tiling of the Boolean lattice with copies of a poset

Families with no s pairwise disjoint sets

Signalling strength determines proapoptotic functions of STING

Size-aware Sharding For Improving Tail Latencies in In-memory Key-value Stores

Computing Crowd Consensus with Partial Agreement (Extended Abstract)

Matching fields and lattice points of simplices

Computing Crowd Consensus with Partial Agreement

Angle-dependent magnetization dynamics with mirror-symmetric excitations in artificial quasicrystalline nanomagnet lattices

Almost tiling of the Boolean lattice with copies of a poset

Signalling strength determines proapoptotic functions of STING

Computational Design of Steady 3D Dissection Puzzles

Counting Intersecting and Pairs of Cross-Intersecting Families

Families with no s pairwise disjoint sets