## U.S. Supreme Court Puts Limits on Police Power to Seize Private Property

2019-02-20 18:44:39 @ Hacker News 200

Article URL: https://www.nytimes.com/2019/02/20/us/politics/civil-asset-forfeiture-supreme-court.html Comments URL: https://news.ycombinator.com/item?id=19209957 Points: 329 # Comments: 80 Tweet

## Netherlands, Finland, Luxembourg, Poland and Italy Oppose EU Copyright Directive

2019-02-20 17:36:37 @ Hacker News 200

Article URL: https://www.permanentrepresentations.nl/permanent-representations/pr-eu-brussels/documents/policy-notes/2019/02/20/joint-statement-regarding-the-copyright-directive Comments URL: https://news.ycombinator.com/item?id=19209262 Points: 214 # Com Tweet

## Upcoming Two-Factor Authentication Requirement for Account Holders

2019-02-20 17:00:00 @ Apple Developer News and Updates

In an effort to keep accounts more secure, developers with the Account Holder role in a developer program will need to enable two-factor authentication to sign in to their Apple Developer account and Certificates, Identifiers & Profiles starting February 2 Tweet

## Pee, Not Chlorine, Causes Red Eyes from Swimming Pools: CDC (2015)

2019-02-20 16:41:54 @ Hacker News 200

Article URL: https://www.cbc.ca/news/trending/pee-chlorine-red-eyes-swimming-pools-cdc-1.3127865 Comments URL: https://news.ycombinator.com/item?id=19208700 Points: 300 # Comments: 184 Tweet

## This Cat Does Not Exist

2019-02-20 16:22:18 @ Hacker News 200

Article URL: https://thiscatdoesnotexist.com/ Comments URL: https://news.ycombinator.com/item?id=19208484 Points: 302 # Comments: 129 Tweet

## Möbius Strips Defy a Link With Infinity

2019-02-20 16:17:45 @ Quanta Magazine

A new proof shows why an uncountably infinite number of Möbius strips will never fit into a three-dimensional space. Tweet

## Microsoft replacing SHA-1

2019-02-20 14:55:44 @ The Endeavour

According to this article, Microsoft is patching Windows 7 and Windows Server 2008 to look for SHA-2 hash functions of updates. These older versions of Windows have been using SHA-1, while newer version are already using SHA-2. This is a good move, but unn Tweet

## RECaf 1.6

2019-02-20 14:46:24 @ joecieplinski's blog

RECaf 1.6 For a while now, I’ve noticed RECaf users had a very different approach than I intended of logging an item from earlier in the day, or from the day before. The frequents list on the front panel of RECaf is great for one-tap access to your Tweet

## Por qué las uvas producen un plasma en un horno microondas

2019-02-20 11:20:06 @ La Ciencia de la Mula Francis

Hay un experimento casero muy popular para producir un plasma. Se parte una uva por la mitad y se ponen las dos mitades juntas en un horno microondas. Conviene colocarlas […] La entrada Por qué las uvas producen un plasma en un horno microondas fue e Tweet

## Y Combinator Resources for Developers

2019-02-20 09:01:13 @ Hacker News 200

Article URL: https://yc.dev Comments URL: https://news.ycombinator.com/item?id=19206396 Points: 276 # Comments: 92 Tweet

## NASA finds Tropical Cyclone Wutip organizing

2019-02-20 06:00:00 @ Eurekalert

(NASA/Goddard Space Flight Center) Tropical Depression 02W has organized and strengthened into a tropical storm. Tweet

## NASA-NOAA satellite looks at large-eyed Tropical Cyclone Oma

2019-02-20 06:00:00 @ Eurekalert

(NASA/Goddard Space Flight Center) Tropical Cyclone Oma is a large hurricane with a big eye. The storm appeared well-organized on satellite imagery as it moved through the Southern Pacific Ocean. Tweet

## Ingredients for water could be made on surface of moon, a chemical factory

2019-02-20 06:00:00 @ Eurekalert

(NASA/Goddard Space Flight Center) When a stream of charged particles known as the solar wind careens onto the moon's surface at 450 kilometers per second (or nearly 1 million miles per hour), they enrich the moon's surface in ingredients that could make w Tweet

## European Geosciences Union meeting: Program online, press conferences

2019-02-20 06:00:00 @ Eurekalert

(European Geosciences Union) The program for the 2019 General Assembly of the European Geosciences Union (EGU) is now online. Among over 1,000 sessions, it features a Union symposium on climate tipping points and a session on science, politics and European Tweet

## Google says Nest’s built-in mic not listed in specs was not meant to be secret

2019-02-20 05:11:31 @ Hacker News 200

Article URL: https://www.businessinsider.com/nest-microphone-was-never-supposed-to-be-a-secret-2019-2 Comments URL: https://news.ycombinator.com/item?id=19205457 Points: 442 # Comments: 243 Tweet

## How much does randomness help with locally checkable problems?. (arXiv:1902.06803v1 [cs.DC])

2019-02-20 02:30:00 @ cs.CC updates on arXiv.org

Locally checkable labeling problems (LCLs) are distributed graph problems in which a solution is globally feasible if it is locally feasible in all constant-radius neighborhoods. Vertex colorings, maximal independent sets, and maximal matchings are example Tweet

## Error reduction of quantum algorithms. (arXiv:1902.06852v1 [cs.CC])

2019-02-20 02:30:00 @ cs.CC updates on arXiv.org

We give a technique to reduce the error probability of quantum algorithms that determine whether its input has a specified property of interest. The standard process of reducing this error is statistical processing of the results of multiple independent ex Tweet

## Universality of Computational Lower Bounds for Submatrix Detection. (arXiv:1902.06916v1 [math.ST])

2019-02-20 02:30:00 @ cs.CC updates on arXiv.org

In the general submatrix detection problem, the task is to detect the presence of a small $k \times k$ submatrix with entries sampled from a distribution $\mathcal{P}$ in an $n \times n$ matrix of samples from $\mathcal{Q}$. This formulation includes a num Tweet

## Hardness of exact distance queries in sparse graphs through hub labeling. (arXiv:1902.07055v1 [cs.DS])

2019-02-20 02:30:00 @ cs.CC updates on arXiv.org

A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. An important class of distance labeling schemes is tha Tweet

## Towards Optimal Depth Reductions for Syntactically Multilinear Circuits. (arXiv:1902.07063v1 [cs.CC])

2019-02-20 02:30:00 @ cs.CC updates on arXiv.org

## Approximating Continuous Functions on Persistence Diagrams Using Template Functions. (arXiv:1902.07190v1 [cs.CG])

2019-02-20 02:30:00 @ cs.CG updates on arXiv.org

The persistence diagram is an increasingly useful tool arising from the field of Topological Data Analysis. However, using these diagrams in conjunction with machine learning techniques requires some mathematical finesse. The most success to date has come Tweet

## Coresets for $(k,l)$-Clustering under the Fr\'echet Distance. (arXiv:1901.01870v2 [cs.CG] UPDATED)

2019-02-20 02:30:00 @ cs.CG updates on arXiv.org

Clustering is the task of partitioning a given set of geometric objects. This is thoroughly studied when the objects are points in the euclidean space. There are also several approaches for points in general metric spaces. In this thesis we consider cluste Tweet

## Constructive Heuristics for Min-Power Bounded-Hops Symmetric Connectivity Problem. (arXiv:1902.06796v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We consider a Min-Power Bounded-Hops Symmetric Connectivity problem that consists in the construction of communication spanning tree on a given graph, where the total energy consumption spent for the data transmission is minimized and the maximum number of Tweet

## Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem. (arXiv:1902.06808v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We consider the integrality gap of the subtour LP relaxation of the Traveling Salesman Problem restricted to circulant instances. De Klerk and Dobre conjectured that the value of the optimal solution to the subtour LP on these instances is equal to an enti Tweet

## The Complexity of Max-Min $k$-Partitioning. (arXiv:1902.06812v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

In this paper we study a max-min $k$-partition problem on a weighted graph, that could model a robust $k$-coalition formation. We settle the computational complexity of this problem as complete for class $\Sigma_2^P$. This hardness holds even for $k=2$ and Tweet

## A sub-quadratic algorithm for the longest common increasing subsequence problem. (arXiv:1902.06864v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

The Longest Common Increasing Subsequence problem (LCIS) is a natural variant of the celebrated Longest Common Subsequence (LCS) problem. For LCIS, as well as for LCS, there is an $O(n^2)$ algorithm and a SETH-based quadratic lower bound. For LCS, there is Tweet

## Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals. (arXiv:1902.06957v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

Perturbed graphic matroids are binary matroids that can be obtained from a graphic matroid by adding a noise of small rank. More precisely, r-rank perturbed graphic matroid M is a binary matroid that can be represented in the form I +P, where I is the inci Tweet

## On the dualization in distributive lattices and related problems. (arXiv:1902.07004v1 [cs.DM])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

In this paper, we study the dualization in distributive lattices, a generalization of the well known hypergraph dualization problem. We give a characterization of the complexity of the problem under various combined restrictions on graph classes and posets Tweet

## Travelling on Graphs with Small Highway Dimension. (arXiv:1902.07040v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter was introduced by Abraham et al. [SODA 2010] as a model for transportation networks, on which TSP and STP naturally occur Tweet

## Hardness of exact distance queries in sparse graphs through hub labeling. (arXiv:1902.07055v1 [cs.DS])

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

A distance labeling scheme is an assignment of bit-labels to the vertices of an undirected, unweighted graph such that the distance between any pair of vertices can be decoded solely from their labels. An important class of distance labeling schemes is tha Tweet

## Nearly Optimal Time Bounds for kPath in Hypergraphs. (arXiv:1803.04940v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We give almost tight conditional lower bounds on the running time of the kHyperPath problem. Given an $r$-uniform hypergraph for some integer $r$, kHyperPath seeks a tight path of length $k$. That is, a sequence of $k$ nodes such that every consecutive $r$ Tweet

## Beyond the Low-Degree Algorithm: Mixtures of Subcubes and Their Applications. (arXiv:1803.06521v2 [cs.LG] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We introduce the problem of learning mixtures of $k$ subcubes over $\{0,1\}^n$, which contains many classic learning theory problems as a special case (and is itself a special case of others). We give a surprising $n^{O(\log k)}$-time learning algorithm ba Tweet

## Testing Identity of Multidimensional Histograms. (arXiv:1804.03636v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

We investigate the problem of identity testing for multidimensional histogram distributions. A distribution $p: D \rightarrow \mathbb{R}_+$, where $D \subseteq \mathbb{R}^d$, is called a $k$-histogram if there exists a partition of the domain into $k$ axis Tweet

## Tracking the $\ell_2$ Norm with Constant Update Time. (arXiv:1807.06479v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

The \emph{$\ell_2$ tracking problem} is the task of obtaining a streaming algorithm that, given access to a stream of items $a_1,a_2,a_3,\ldots$ from a universe $[n]$, outputs at each time $t$ an estimate to the $\ell_2$ norm of the \textit{frequency vecto Tweet

## Block Edit Errors with Transpositions: Deterministic Document Exchange Protocols and Almost Optimal Binary Codes. (arXiv:1809.00725v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

Document exchange and error correcting codes are two fundamental problems regarding communications. In the first problem, Alice and Bob each holds a string, and the goal is for Alice to send a short sketch to Bob, so that Bob can recover Alice's string. In Tweet

## Path matrix and path energy of graphs. (arXiv:1810.04870v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

Given a graph $G$, we associate a path matrix $P$ whose $(i, j)$ entry represents the maximum number of vertex disjoint paths between the vertices $i$ and $j$, with zeros on the main diagonal. In this note, we resolve four conjectures from [M. M. Shikare, Tweet

## Towards Optimal Running Times for Optimal Transport. (arXiv:1810.07717v2 [cs.DS] UPDATED)

2019-02-20 02:30:00 @ cs.DS updates on arXiv.org

## Dieter Bohn on Amazon’s Acquisition of Eero

2019-02-14 02:05:53 @ Daring Fireball

Dieter Bohn, writing at The Verge: We all feel trapped — or maybe captured — by the various ecosystems we live in. We all use excellent products every day made by behemoth companies, but increasingly only made by those companies. iPhone or And Tweet

## Calling all GlobalXplorers: Get ready to go to India

2019-02-14 01:58:17 @ TED Blog

Today, GlobalXplorer, the citizen science platform created by satellite archaeologist Sarah Parcak with the 2016 TED Prize — which allows users live out their Indiana Jones fantasies and search for archaeological sites from home — announced the location of Tweet

## Exploring New Technologies

2019-02-14 00:36:06 @ John Carlos Baez

## Missing information anxiety

2019-02-13 22:00:47 @ The Endeavour

A recurring theme in math is that you may not need to do what it looks like you need to do. There may be a shortcut to where you want to go. A special case of this is that you may not need all the information that you think you need. For example, if you [& Tweet

## New – Infrequent Access Storage Class for Amazon Elastic File System (EFS)

2019-02-13 21:44:10 @ AWS Blog

lets you create petabyte-scale file systems that can be accessed in massively parallel fashion from hundreds or thousands of EC2 instances and on-premises servers, while scaling on demand without disrupting applications. Since the mid-2016 launch of EFS, w Tweet

## The IBM Q Network: Organizations Collaborate on Quantum Goals

2019-02-13 20:23:03 @ IBM Research blog

Since launching its Q Network initiative in 2017, IBM Research has been working with Fortune 500 companies, academic institutions, research labs and startups worldwide to advance quantum computing technology for commercial use. The post The IBM Q Network: Tweet