More Like this

1. Games with filters I

   https://doi.org/10.1142/S021906132450003X  

   Foreman, Matthew; Magidor, Menachem; Zeman, Martin (August 2023, Journal of Mathematical Logic)

   Chong, Chita; Feng, Qi; Slaman, Theodore_A; Woodin, W_Hugh (Ed.)

   This paper has two parts. The first is concerned with a variant of a family of games introduced by Holy and Schlicht, that we call Welch games. Player II having a winning strategy in the Welch game of length [Formula: see text] on [Formula: see text] is equivalent to weak compactness. Winning the game of length [Formula: see text] is equivalent to [Formula: see text] being measurable. We show that for games of intermediate length [Formula: see text], II winning implies the existence of precipitous ideals with [Formula: see text]-closed, [Formula: see text]-dense trees. The second part shows the first is not vacuous. For each [Formula: see text] between [Formula: see text] and [Formula: see text], it gives a model where II wins the games of length [Formula: see text], but not [Formula: see text]. The technique also gives models where for all [Formula: see text] there are [Formula: see text]-complete, normal, [Formula: see text]-distributive ideals having dense sets that are [Formula: see text]-closed, but not [Formula: see text]-closed. 

   more » « less
2. Moringa oleifera f -sand Filters for Sustainable Water Purification

   https://doi.org/10.1021/acs.estlett.7b00490  

   Xiong, Boya; Piechowicz, Bethany; Wang, Ziyuhan; Marinaro, Rose; Clement, Emma; Carlin, Taylor; Uliana, Adam; Kumar, Manish; Velegol, Stephanie Butler (January 2018, Environmental Science & Technology Letters)
3. X -Band Quasi-Elliptic Non-Reciprocal Bandpass Filters (NBPFs)

   https://doi.org/10.1109/TMTT.2021.3081021  

   Ashley, Andrea; Psychogiou, Dimitra (July 2021, IEEE Transactions on Microwave Theory and Techniques)
4. Non-Galvin filters

   https://doi.org/10.1142/S021906132450017X  

   Benhamou, Tom; Garti, Shimon; Gitik, Moti; Poveda, Alejandro (March 2024, Journal of Mathematical Logic)

   We address the question of consistency strength of certain filters and ultrafilters which fail to satisfy the Galvin property. We answer questions [Benhamou and Gitik, Ann. Pure Appl. Logic 173 (2022) 103107; Questions 7.8, 7.9], [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Question 5] and improve theorem [Benhamou et al., J. Lond. Math. Soc. 108(1) (2023) 190–237; Theorem 2.3]. 

   more » « less
5. Adaptive Quotient Filters

   https://doi.org/10.1145/3677128  

   Wen, Richard; McCoy, Hunter; Tench, David; Tagliavini, Guido; Bender, Michael A; Conway, Alex; Farach-Colton, Martin; Johnson, Rob; Pandey, Prashant (October 2024, Proceedings of the ACM on Management of Data)

   Filters trade off accuracy for space and occasionally return false positive matches with a bounded error. Numerous systems use filters in fast memory to avoid performing expensive I/Os to slow storage. A fundamental limitation in traditional filters is that they do not change their representation upon seeing a false positive match. Therefore, the maximum false positive rate is only guaranteed for a single query, not for an arbitrary set of queries. We can improve the filter's performance on a stream of queries, especially on a skewed distribution, if we can adapt after encountering false positives. Adaptive filters, such as telescoping quotient filters and adaptive cuckoo filters, update their representation upon detecting a false positive to avoid repeating the same error in the future. Adaptive filters require an auxiliary structure, typically much larger than the main filter and often residing on slow storage, to facilitate adaptation. However, existing adaptive filters are not practical and have not been adopted in real-world systems for two main reasons. First, they offer weak adaptivity guarantees, meaning that fixing a new false positive can cause a previously fixed false positive to come back. Secondly, the sub-optimal design of the auxiliary structure results in adaptivity overheads so substantial that they can actually diminish overall system performance compared to a traditional filter. In this paper, we design and implement the \sysname, the first practical adaptive filter with minimal adaptivity overhead and strong adaptivity guarantees, which means that the performance and false-positive guarantees continue to hold even for adversarial workloads. The \sysname is based on the state-of-the-art quotient filter design and preserves all the critical features of the quotient filter such as cache efficiency and mergeability. Furthermore, we employ a new auxiliary structure design which results in considerably low adaptivity overhead and makes the \sysname practical in real systems. We evaluate the \sysname by using it to filter queries to an on-disk B-tree database and find no negative impact on insert or query performance compared to traditional filters. Against adversarial workloads, the \sysname preserves system performance, whereas traditional filters incur 2× slowdown from adversaries representing as low as 1% of the workload. Finally, we show that on skewed query workloads, the \sysname can reduce the false-positive rate 100× using negligible (1/1000th of a bit per item) space overhead. 

   more » « less