Random Articles (Page 3)

Have a deep view into what people are curious about.

๐Ÿ”— Oblique Strategies

๐Ÿ”— Literature ๐Ÿ”— Psychology

Oblique Strategies (subtitled Over One Hundred Worthwhile Dilemmas) is a card-based method for promoting creativity jointly created by Brian Eno and Peter Schmidt, first published in 1975. Physically, it takes the form of a deck of 7-by-9-centimetre (2.8ย in ร—ย 3.5ย in) printed cards in a black box. Each card offers a challenging constraint intended to help artists (particularly musicians) break creative blocks by encouraging lateral thinking.

Discussed on

๐Ÿ”— Room 641A

๐Ÿ”— United States/U.S. Government ๐Ÿ”— United States ๐Ÿ”— Mass surveillance ๐Ÿ”— Espionage ๐Ÿ”— California ๐Ÿ”— California/San Francisco Bay Area ๐Ÿ”— Telecommunications

Room 641A is a telecommunication interception facility operated by AT&T for the U.S. National Security Agency, as part of its warrantless surveillance program as authorized by the Patriot Act. The facility commenced operations in 2003 and its purpose was publicly revealed in 2006.

Discussed on

๐Ÿ”— Elfstedentocht

๐Ÿ”— Netherlands ๐Ÿ”— Speed Skating ๐Ÿ”— Frisia

The Elfstedentocht (Dutch pronunciation: [ษ›lf'steหdษ™(n)tษ”xt]; West Frisian: Alvestรชdetocht [ษ”lvษ™หˆstษ›หdษ™tษ”ฯ‡t], English: Eleven cities tour) is a long-distance tour skating event on natural ice, almost 200 kilometres (120ย mi) long, which is held both as a speed skating competition (with 300 contestants) and a leisure tour (with 16,000 skaters). It is held in the province of Friesland in the north of the Netherlands, leading past all eleven historical cities of the province. The tour is held at most once a year, only when the natural ice along the entire course is at least 15 centimetres (6ย in) thick; sometimes on consecutive years, other times with gaps that may exceed 20 years. When the ice is suitable, the tour is announced and starts within 48 hours.

Discussed on

๐Ÿ”— Ichi-Fuji, ni-taka, san-nasubi

๐Ÿ”— Japan

In Japanese culture, a hatsuyume (Japanese: ๅˆๅคข) is the first dream one has in the new year. Traditionally, the contents of such a dream would foretell the luck of the dreamer in the ensuing year. In Japan, the night of December 31 was often passed without sleeping, so the hatsuyume is often experienced during the night of January 1; the day after the night of the "first dream" is also known as the hatsuyume. This day is January 2 in the Gregorian calendar, but was different in the traditional Japanese calendar.

It is considered to be particularly good luck to dream of Mount Fuji, a hawk, and an eggplant. This belief has been in place since the early Edo period but there are various theories regarding the origins as to why this particular combination was considered to be auspicious. One theory suggests that this combination is lucky because Mount Fuji is Japan's highest mountain, the hawk is a clever and strong bird, and the word for eggplant (่Œ„ๅญ, nasu or nasubi) suggests achieving something great (ๆˆใ™ nasu). Another theory suggests that this combination arose because Mount Fuji, falconry, and early eggplants were favorites of the shลgun Tokugawa Ieyasu.

Although this superstition is well known in Japan, often memorized in the form ichi-Fuji, ni-taka, san-nasubi (ไธ€ๅฏŒๅฃซใ€ไบŒ้ทนใ€ไธ‰่Œ„ๅญ; 1. Fuji, 2. Hawk, 3. Eggplant), the continuation of the list is not as well known. The continuation is yon-sen, go-tabako, roku-zatล (ๅ››ๆ‰‡ใ€ไบ”็…™่‰ใ€ๅ…ญๅบง้ ญ; 4. Fan, 5. Tobacco, 6. Blind acupressurer). The origins of this trio are less well known, and it is unclear whether they were added after the original three or whether the list of six originated at the same time.

๐Ÿ”— Sloyd

๐Ÿ”— Education

Sloyd (Slรถjd), also known as Educational sloyd, is a system of handicraft-based education started by Uno Cygnaeus in Finland in 1865. The system was further refined and promoted worldwide, and was taught in the United States until the early 20th Century. It is still taught as a compulsory subject in Finnish, Danish, Swedish and Norwegian schools.

Discussed on

  • "Sloyd" | 2017-10-22 | 131 Upvotes 38 Comments

๐Ÿ”— Bulverism is to โ€œassume that your opponent is wrong, and explain his errorโ€

๐Ÿ”— Philosophy ๐Ÿ”— Philosophy/Logic

Bulverism is a term for a rhetorical fallacy that combines circular reasoning with presumption or condescenscion. The method of Bulverism is to "assume that your opponent is wrong, and explain his error." The Bulverist assumes a speaker's argument is invalid or false and then explains why the speaker came to make that mistake, even if the opponents's claim is actually right, attacking the speaker or the speaker's motive. The term Bulverism was coined by C. S. Lewis to poke fun at a very serious error in thinking that, he alleges, recurs often in a variety of religious, political, and philosophical debates.

Similar to Antony Flew's "subject/motive shift", Bulverism is a fallacy of irrelevance. One accuses an argument of being wrong on the basis of the arguer's identity or motive, but these are strictly speaking irrelevant to the argument's validity or truth.

๐Ÿ”— Send Me to Heaven

๐Ÿ”— Apps

Send Me To Heaven (officially stylized as S.M.T.H.) is an Android application developed by Carrot Pop which measures the vertical distance that a mobile phone is thrown. Players compete against each other by seeking to throw their phones higher than others, often at the risk of damaging their phones. The app was immediately banned from the App Store but remains available from Google Play, where it maintains a cult following.

Discussed on

๐Ÿ”— Crypto-Anarchism

๐Ÿ”— Mass surveillance ๐Ÿ”— Computing ๐Ÿ”— Internet culture ๐Ÿ”— Philosophy ๐Ÿ”— Cryptography ๐Ÿ”— Cryptography/Computer science ๐Ÿ”— Numismatics ๐Ÿ”— Sociology ๐Ÿ”— Numismatics/Cryptocurrency ๐Ÿ”— Computing/Computer Security ๐Ÿ”— Philosophy/Anarchism ๐Ÿ”— Anarchism

Crypto-anarchism (or crypto-anarchy) is a political ideology focusing on protection of privacy, political freedom and economic freedom, the adherents of which use cryptographic software for confidentiality and security while sending and receiving information over computer networks.

By using cryptographic software, the association between the identity of a certain user or organization and the pseudonym they use is made difficult to find, unless the user reveals the association. It is difficult to say which country's laws will be ignored, as even the location of a certain participant is unknown. However, participants may in theory voluntarily create new laws using smart contracts or, if the user is pseudonymous, depend on online reputation.

Discussed on

๐Ÿ”— Anti-Mask League of San Francisco

๐Ÿ”— California ๐Ÿ”— California/San Francisco Bay Area ๐Ÿ”— History ๐Ÿ”— Viruses

The Anti-Mask League of San Francisco was an organization formed to protest an ordinance which required people in San Francisco, California to wear masks during the 1918 influenza pandemic. The ordinance it protested lasted less than one month before being repealed. Due to the short period of the league's existence, its exact membership is difficult to determine; however, an estimated 4,000โ€“5,000 citizens showed up to a meeting to protest the second ordinance in January 1919. Opposition to similar ordinances during the COVID-19 pandemic in the United States led to renewed interest in, and comparisons with, the Anti-Mask League.

Discussed on

๐Ÿ”— Canadian Traveller Problem

๐Ÿ”— 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).

Discussed on