New Articles (Page 72)

To stay up to date you can also follow on Mastodon.

๐Ÿ”— Saskatoon Freezing Deaths

๐Ÿ”— Canada ๐Ÿ”— Death ๐Ÿ”— Law Enforcement ๐Ÿ”— Indigenous peoples of North America ๐Ÿ”— Canada/Saskatchewan

The Saskatoon freezing deaths were a series of deaths of Indigenous Canadians in Saskatoon, Saskatchewan, in the early 2000s, which were confirmed to have been caused by members of the Saskatoon Police Service. The police officers would arrest Indigenous people, usually men, for alleged drunkenness and/or disorderly behaviour, sometimes without cause. The officers would then drive them to the outskirts of the city at night in the winter, and abandon them, leaving them stranded in sub-zero temperatures.

The practice was known as taking Indigenous people for "starlight tours" and dates back to 1976. As of 2021, despite convictions for related offences, no Saskatoon police officer has been convicted specifically for having caused freezing deaths.

Discussed on

๐Ÿ”— Swatch Internet Time

๐Ÿ”— Time ๐Ÿ”— Switzerland

Swatch Internet Time (or .beat time) is a decimal time concept introduced in 1998 by the Swatch corporation as part of their marketing campaign for their line of "Beat" watches.

Instead of hours and minutes, the mean solar day is divided into 1000 parts called ".beats". Each .beat is equal to one decimal minute in the French Revolutionary decimal time system and lasts 1 minute and 26.4 seconds (86.4 seconds) in standard time. Times are notated as a 3-digit number out of 1000 after midnight. So, for example @248 would indicate a time 248 .beats after midnight representing โ€‹248โ„1000 of a day, just over 5 hours and 57 minutes.

There are no time zones in Swatch Internet Time; instead, the new time scale of Biel Meantime (BMT) is used, based on Swatch's headquarters in Biel, Switzerland and equivalent to Central European Time, West Africa Time, and UTC+01. Unlike civil time in Switzerland and many other countries, Swatch Internet Time does not observe daylight saving time.

Discussed on

๐Ÿ”— Wikipedia Abuse Filter

Discussed on

๐Ÿ”— Von Neumann's Elephant

๐Ÿ”— Mathematics

Von Neumann's elephant is a problem in recreational mathematics, consisting of constructing a planar curve in the shape of an elephant from only four fixed parameters. It originated from a discussion between physicists John von Neumann and Enrico Fermi.

Discussed on

๐Ÿ”— Germanwings Flight 9525

๐Ÿ”— Aviation ๐Ÿ”— France ๐Ÿ”— Germany ๐Ÿ”— Disaster management ๐Ÿ”— Aviation/Aviation accident ๐Ÿ”— Spain ๐Ÿ”— Crime and Criminal Biography

Germanwings Flight 9525 was a scheduled international passenger flight from Barcelonaโ€“El Prat Airport in Spain to Dรผsseldorf Airport in Germany. The flight was operated by Germanwings, a low-cost carrier owned by the German airline Lufthansa. On 24 March 2015, the aircraft, an Airbus A320-211, crashed 100ย km (62ย mi; 54ย nmi) north-west of Nice in the French Alps. All 144 passengers and six crew members were killed.

The crash was deliberately caused by the co-pilot, Andreas Lubitz, who had previously been treated for suicidal tendencies and declared unfit to work by his doctor. Lubitz kept this information from his employer and instead reported for duty. Shortly after reaching cruise altitude and while the captain was out of the cockpit, Lubitz locked the cockpit door and initiated a controlled descent that continued until the aircraft hit a mountainside.

Aviation authorities swiftly implemented new recommendations from the European Union Aviation Safety Agency that required two authorised personnel in the cockpit at all times but, by 2017, Germanwings and other German airlines had dropped the rule.

The Lubitz family held a press conference in March 2017 during which Lubitz's father said that they did not accept the official investigative findings that his son deliberately caused the crash. By 2017, Lufthansa had paid โ‚ฌ75,000 to the family of every victim, as well as โ‚ฌ10,000 in pain and suffering compensation to every close relative of a victim.

Discussed on

๐Ÿ”— Program Synthesis

๐Ÿ”— Computing ๐Ÿ”— Computer science

In computer science, program synthesis is the task to construct a program that provably satisfies a given high-level formal specification. In contrast to program verification, the program is to be constructed rather than given; however, both fields make use of formal proof techniques, and both comprise approaches of different degrees of automation. In contrast to automatic programming techniques, specifications in program synthesis are usually non-algorithmic statements in an appropriate logical calculus.

The primary application of program synthesis is to relieve the programmer of the burden of writing correct, efficient code that satisfies a specification. However, program synthesis also has applications to superoptimization and inference of loop invariants.

Discussed on

๐Ÿ”— Hรผgelkultur

๐Ÿ”— Environment ๐Ÿ”— Agriculture ๐Ÿ”— Soil ๐Ÿ”— Horticulture and Gardening

Hรผgelkultur (German pronunciation: [หˆhyหษกlฬฉkสŠlหŒtuหษฬฏ]), literally mound bed or mound culture, is a horticultural technique where a mound constructed from decaying wood debris and other compostable biomass plant materials is later (or immediately) planted as a raised bed. Considered a permaculture practice, advocates claim that the technique helps to improve soil fertility, water retention, and soil warming, thus benefitting plants grown on or near such mounds.

Discussed on

๐Ÿ”— Countersteering

๐Ÿ”— Cycling ๐Ÿ”— Motorcycling

Countersteering is used by single-track vehicle operators, such as cyclists and motorcyclists, to initiate a turn toward a given direction by momentarily steering counter to the desired direction ("steer left to turn right"). To negotiate a turn successfully, the combined center of mass of the rider and the single-track vehicle must first be leaned in the direction of the turn, and steering briefly in the opposite direction causes that lean. The rider's action of countersteering is sometimes referred to as "giving a steering command".:โ€Š15โ€Š

The scientific literature does not provide a clear and comprehensive definition of countersteering. In fact, "a proper distinction between steer torque and steer angle ... is not always made."

Discussed on

๐Ÿ”— Secretary Problem

๐Ÿ”— Mathematics ๐Ÿ”— Statistics

The secretary problem is a problem that demonstrates a scenario involving optimal stopping theory. The problem has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.

The basic form of the problem is the following: imagine an administrator who wants to hire the best secretary out of n {\displaystyle n} rankable applicants for a position. The applicants are interviewed one by one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator gains information sufficient to rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately.

The shortest rigorous proof known so far is provided by the odds algorithm (Bruss 2000). It implies that the optimal win probability is always at least 1 / e {\displaystyle 1/e} (where e is the base of the natural logarithm), and that the latter holds even in a much greater generality (2003). The optimal stopping rule prescribes always rejecting the first โˆผ n / e {\displaystyle \sim n/e} applicants that are interviewed and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs). Sometimes this strategy is called the 1 / e {\displaystyle 1/e} stopping rule, because the probability of stopping at the best applicant with this strategy is about 1 / e {\displaystyle 1/e} already for moderate values of n {\displaystyle n} . One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) is simple and selects the single best candidate about 37% of the time, irrespective of whether there are 100 or 100 million applicants.

Discussed on

๐Ÿ”— V-2 No. 13

๐Ÿ”— Spaceflight ๐Ÿ”— Rocketry ๐Ÿ”— Science ๐Ÿ”— Photography

The V-2 No. 13 was a modified V-2 rocket that became the first object to take a photograph of the Earth from outer space. Launched on 24 October 1946, at the White Sands Missile Range in White Sands, New Mexico, the rocket reached a maximum altitude of 65ย mi (105ย km).

Discussed on