Have a deep view into what people are curious about.

🔗 Computing

In computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the time to launch an attack, while knowing that any messenger they send could be captured.

It is related to the more general Byzantine Generals Problem and appears often in introductory classes about computer networking (particularly with regard to the Transmission Control Protocol, where it shows that TCP can't guarantee state consistency between endpoints and why this is the case), though it applies to any type of two-party communication where failures of communication are possible. A key concept in epistemic logic, this problem highlights the importance of common knowledge. Some authors also refer to this as the Two Generals' Paradox, the Two Armies Problem, or the Coordinated Attack Problem. The Two Generals' Problem was the first computer communication problem to be proved to be unsolvable. An important consequence of this proof is that generalizations like the Byzantine Generals problem are also unsolvable in the face of arbitrary communication failures, thus providing a base of realistic expectations for any distributed consistency protocols.

🔗 Physics

In quantum field theory, a false vacuum is a hypothetical vacuum that is relatively stable, but not in the most stable state possible. In this condition it is called metastable. It may last for a very long time in this state, but could eventually decay to the more stable one, an event known as false vacuum decay. The most common suggestion of how such a decay might happen in our universe is called bubble nucleation – if a small region of the universe by chance reached a more stable vacuum, this "bubble" (also called "bounce") would spread.

A false vacuum exists at a local minimum of energy and is therefore not completely stable, in contrast to a true vacuum, which exists at a global minimum and is stable.

🔗 Cuba

Organopónicos or organoponics is a system of urban agriculture using organic gardens. It originated in Cuba and is still mostly focused there. It often consists of low-level concrete walls filled with organic matter and soil, with lines of drip irrigation laid on the surface of the growing media. Organopónicos is a labour-intensive form of local agriculture.

Organopónico farmers employ a wide variety of agroecological techniques including integrated pest management, polyculture, and crop rotation. Most organic materials are also produced within the gardens through composting. This allows production to take place with few petroleum-based inputs.

Organopónicos first arose as a community response to lack of food security during the Special Period after the collapse of the Soviet Union. It is publicly functioning in terms of ownership, access, and management, but heavily subsidized and supported by the Cuban government.

🔗 India 🔗 Board and table games

Ganjifa, Ganjapa or Gânjaphâ, is a card game and type of playing cards that are most associated with Persia and India. After Ganjifa cards fell out of use in Iran before the twentieth century, India became the last country to produce them. The form prevalent in Odisha is Ganjapa.

🔗 Mathematics

In mathematics, the Bernoulli numbers B_n are a sequence of rational numbers which occur frequently in number theory. The Bernoulli numbers appear in (and can be defined by) the Taylor series expansions of the tangent and hyperbolic tangent functions, in Faulhaber's formula for the sum of m-th powers of the first n positive integers, in the Euler–Maclaurin formula, and in expressions for certain values of the Riemann zeta function.

The values of the first 20 Bernoulli numbers are given in the adjacent table. Two conventions are used in the literature, denoted here by ${\displaystyle B_{n}^{-{}}}$ and ${\displaystyle B_{n}^{+{}}}$; they differ only for n = 1, where ${\displaystyle B_{1}^{-{}}=-1/2}$ and ${\displaystyle B_{1}^{+{}}=+1/2}$. For every odd n > 1, B_n = 0. For every even n > 0, B_n is negative if n is divisible by 4 and positive otherwise. The Bernoulli numbers are special values of the Bernoulli polynomials ${\displaystyle B_{n}(x)}$, with ${\displaystyle B_{n}^{-{}}=B_{n}(0)}$ and ${\displaystyle B_{n}^{+}=B_{n}(1)}$ (Weisstein 2016).

The Bernoulli numbers were discovered around the same time by the Swiss mathematician Jacob Bernoulli, after whom they are named, and independently by Japanese mathematician Seki Kōwa. Seki's discovery was posthumously published in 1712 (Selin 1997, p. 891; Smith & Mikami 1914, p. 108) in his work Katsuyo Sampo; Bernoulli's, also posthumously, in his Ars Conjectandi of 1713. Ada Lovelace's note G on the Analytical Engine from 1842 describes an algorithm for generating Bernoulli numbers with Babbage's machine (Menabrea 1842, Note G). As a result, the Bernoulli numbers have the distinction of being the subject of the first published complex computer program.

🔗 Spaceflight 🔗 Physics 🔗 Rocketry

Direct Fusion Drive (DFD) is a conceptual low radioactivity, nuclear-fusion rocket engine designed to produce both thrust and electric power for interplanetary spacecraft. The concept is based on the Princeton field-reversed configuration reactor invented in 2002 by Samuel A. Cohen, and is being modeled and experimentally tested at Princeton Plasma Physics Laboratory, a US Department of Energy facility, and modeled and evaluated by Princeton Satellite Systems. As of 2018, the concept has moved on to Phase II to further advance the design.

🔗 Computer science 🔗 Mathematics

In computer science and graph theory, the Canadian traveller problem (CTP) is a generalization of the shortest path problem to graphs that are partially observable. In other words, the graph is revealed while it is being explored, and explorative edges are charged even if they do not contribute to the final path.

This optimization problem was introduced by Christos Papadimitriou and Mihalis Yannakakis in 1989 and a number of variants of the problem have been studied since. The name supposedly originates from conversations of the authors who learned of a difficulty Canadian drivers had: traveling a network of cities with snowfall randomly blocking roads. The stochastic version, where each edge is associated with a probability of independently being in the graph, has been given considerable attention in operations research under the name "the Stochastic Shortest Path Problem with Recourse" (SSPPR).

🔗 Computing

In computer science, the ostrich algorithm is a strategy of ignoring potential problems on the basis that they may be exceedingly rare. It is named for the ostrich effect which is defined as "to stick one's head in the sand and pretend there is no problem". It is used when it is more cost-effective to allow the problem to occur than to attempt its prevention.

🔗 Military history 🔗 Military history/Military science, technology, and theory 🔗 Military history/Weaponry 🔗 India 🔗 Rocketry 🔗 Military history/Asian military history 🔗 Military history/South Asian military history 🔗 India/Karnataka

Mysorean rockets were an Indian military weapon, the first iron-cased rockets successfully deployed for military use. The Mysorean army, under Hyder Ali and his son Tipu Sultan, used the rockets effectively against the British East India Company during the 1780s and 1790s. Their conflicts with the company exposed the British to this technology, which was then used to advance European rocketry with the development of the Congreve rocket in 1805.

🔗 Soviet Union 🔗 Spaceflight 🔗 Dogs 🔗 Animal rights

During the 1950s and 1960s the Soviet space program used dogs for sub-orbital and orbital space flights to determine whether human spaceflight was feasible. In this period, the Soviet Union launched missions with passenger slots for at least 57 dogs. The number of dogs in space is smaller, as some dogs flew more than once. Most survived; the few that died were lost mostly through technical failures, according to the parameters of the test.

A notable exception is Laika, the first dog to be sent into orbit, whose death during the 3 November, 1957 Sputnik 2 mission was expected from its outset.