The Stream How does targeting water supply during war worsen the scarcity crisis? We explore why water infrastructure is increasingly being targeted in the midst of war and conflict. Water sustains life, but what happens when it is weaponised? In the ongoing US-Israel war on Iran, desalination plants supplying millions in the Gulf have become targets. This reflects a growing pattern: water infrastructure is increasingly vulnerable as global scarcity intensifies.

Elephants, dolphins, parrots, and other animals show that names might not be uniquely human. More information Adding us as a Preferred Source in Google by using this link indicates that you would like to see more of our content in Google News results. Like humans, parrots are social creatures. Breakthroughs, discoveries, and DIY tips sent six days a week. It's common knowledge that parrots can learn to speak like humans, sometimes a little too much.

Matching is one of the most fundamental and broadly applicable problems across many domains. In these diverse real-world applications, there is often a degree of uncertainty in the input which has led to the study of stochastic matching models. Here, each edge in the graph has a known, independent probability of existing derived from some prediction. Algorithms must probe edges to determine existence and match them irrevocably if they exist. Further, each vertex may have a patience constraint denoting how many of its neighboring edges can be probed. We present new ordered contention resolution schemes yielding improved approximation guarantees for some of the foundational problems studied in this area. For stochastic matching with patience constraints in general graphs, we provide a 0.382-approximate algorithm, significantly improving over the previous best 0.31-approximation of Baveja et al. (2018). When the vertices do not have patience constraints, we describe a 0.432-approximate random order probing algorithm with several corollaries such as an improved guarantee for the Prophet Secretary problem under Edge Arrivals. Finally, for the special case of bipartite graphs with unit patience constraints on one of the partitions, we show a 0.632-approximate algorithm that improves on the recent 1/3-guarantee of Hikima et al. (2021).

The Download: DeepSeek's latest AI breakthrough, and the race to build world models Plus: China has blocked Meta's $2 billion acquisition of AI startup Manus. On Friday, Chinese AI firm DeepSeek released a preview of V4, its long-awaited new flagship model. Notably, the model can process much longer prompts than its last generation, thanks to a new design that handles large amounts of text more efficiently. While the model remains open source, its performance matches leading closed-source rivals from Anthropic, OpenAI, and Google. Here are three ways V4 could shake up AI . AI systems have already gained impressive mastery over the digital world, but the physical world remains humanity's domain.

Learning disentangled representations for user intentions from multi-feedback (i.e., positive and negative feedback) can enhance the accuracy and explainability of recommendation algorithms. However, learning such disentangled representations from multi-feedback data is challenging because i) multi-feedback is complex: there exist complex relations among different types of feedback (e.g., click, unclick, and dislike, etc) as well as various user intentions, and ii) multi-feedback is noisy: there exists noisy (useless) information both in features and labels, which may deteriorate the recommendation performance. Existing disentangled recommendation works only focus on positive feedback, failing to handle the complex relations and noise hidden in multi-feedback data. To solve this problem, in this work we propose a Curriculum Disentangled Recommendation (CDR) model that is capable of efficiently learning disentangled representations from complex and noisy multi-feedback for better recommendation.

Maryland is set to become the first state to ban surveillance pricing in grocery stores after Gov. Wes Moore said he will sign the new law taking effect October 2026.