Random Articles (Page 342)
Have a deep view into what people are curious about.
π Delphi Method
The Delphi method or Delphi technique ( DEL-fy; also known as Estimate-Talk-Estimate or ETE) is a structured communication technique or method, originally developed as a systematic, interactive forecasting method which relies on a panel of experts. The technique can also be adapted for use in face-to-face meetings, and is then called mini-Delphi or Estimate-Talk-Estimate (ETE). Delphi has been widely used for business forecasting and has certain advantages over another structured forecasting approach, prediction markets.
Delphi is based on the principle that forecasts (or decisions) from a structured group of individuals are more accurate than those from unstructured groups. The experts answer questionnaires in two or more rounds. After each round, a facilitator or change agent provides an anonymised summary of the experts' forecasts from the previous round as well as the reasons they provided for their judgments. Thus, experts are encouraged to revise their earlier answers in light of the replies of other members of their panel. It is believed that during this process the range of the answers will decrease and the group will converge towards the "correct" answer. Finally, the process is stopped after a predefined stop criterion (e.g., number of rounds, achievement of consensus, stability of results), and the mean or median scores of the final rounds determine the results.
Special attention has to be paid to the formulation of the Delphi theses and the definition and selection of the experts in order to avoid methodological weaknesses that severely threaten the validity and reliability of the results.
Discussed on
- "Delphi Method" | 2021-03-06 | 109 Upvotes 47 Comments
π The Darien Scheme
The Darien scheme was an unsuccessful attempt at establishing a Scottish colony on the Isthmus of Panama on the Gulf of DariΓ©n in the late 1690s. The aim was for the colony to have an overland route that connected the Pacific and Atlantic oceans. From its contemporary time to the present day, claims have been made that the undertaking was beset by poor planning and provisioning, divided leadership, a lack of demand for trade goods particularly caused by an English trade blockade, devastating epidemics of disease, collusion between the English East India Company and the English government to frustrate it, and a failure to anticipate the Spanish Empire's military response. It was finally abandoned in March 1700 after a siege by Spanish forces, which also blockaded the harbour.
As the Company of Scotland was backed by approximately 20% of all the money circulating in Scotland, its failure left the entire Lowlands in substantial financial ruin and was an important factor in weakening their resistance to the Act of Union (completed in 1707). The land where the Darien colony was built, in the modern province of Guna Yala, is virtually uninhabited today.
Discussed on
- "The Darien Scheme" | 2019-04-03 | 38 Upvotes 6 Comments
π 52-hertz whale
The 52-hertz whale is an individual whale of unidentified species which calls at the very unusual frequency of 52Β Hz. This pitch is a much higher frequency than that of the other whale species with migration patterns most closely resembling this whale'sΒ β the blue whale (10β39Β Hz) or fin whale (20Β Hz). It has been detected regularly in many locations since the late 1980s and appears to be the only individual emitting a whale call at this frequency. It has been described as the "world's loneliest whale".
Discussed on
- "52-hertz whale" | 2026-06-24 | 127 Upvotes 20 Comments
- "52-Hertz Whale" | 2024-06-17 | 52 Upvotes 10 Comments
- "52-hertz whale" | 2018-07-07 | 232 Upvotes 34 Comments
- "52-hertz whale" | 2016-02-27 | 299 Upvotes 89 Comments
π Foldit
Foldit is an online puzzle video game about protein folding. It is part of an experimental research project developed by the University of Washington, Center for Game Science, in collaboration with the UW Department of Biochemistry. The objective of Foldit is to fold the structures of selected proteins as perfectly as possible, using tools provided in the game. The highest scoring solutions are analyzed by researchers, who determine whether or not there is a native structural configuration (native state) that can be applied to relevant proteins in the real world. Scientists can then use these solutions to target and eradicate diseases and create biological innovations. A 2010 paper in the science journal Nature credited Foldit's 57,000 players with providing useful results that matched or outperformed algorithmically computed solutions.
Discussed on
- "Foldit" | 2024-02-18 | 53 Upvotes 15 Comments
π Mundaneum
The Mundaneum was an institution which aimed to gather together all the world's knowledge and classify it according to a system developed called the Universal Decimal Classification. It was developed at the turn of the 20th century by Belgian lawyers Paul Otlet and Henri La Fontaine. The Mundaneum has been identified as a milestone in the history of data collection and management, and (somewhat more tenuously) as a precursor to the Internet.
In the 21st century, the Mundaneum is a non-profit organisation based in Mons, Belgium that runs an exhibition space, website and archive which celebrate the legacy of the original Mundaneum.
Discussed on
- "Mundaneum" | 2021-12-05 | 51 Upvotes 31 Comments
- "Mundaneum" | 2015-08-23 | 31 Upvotes 2 Comments
- "Mundaneum" | 2015-06-26 | 30 Upvotes 6 Comments
π Wikipedia frequently-encountered sources, color-coded by perceived reliability
This is a non-exhaustive list of sources whose reliability and use on Wikipedia are frequently discussed. This list summarizes prior consensus and consolidates links to the most in-depth and recent discussions from the reliable sources noticeboard and elsewhere on Wikipedia.
- Click here to check the list of sources.
Context matters tremendously, and some sources may or may not be suitable for certain uses depending on the situation. When in doubt, defer to the linked discussions for more detailed information on a particular source and its use. Consensus can change, and if more recent discussions considering new evidence or arguments reach a different consensus, this list should be updated to reflect those changes.
Reliability is an inquiry that takes place pursuant to the verifiability policy and the reliable sources guideline. Note that verifiability is only one of Wikipedia's core content policies, which also include neutral point of view and no original research. These policies work together to determine whether information from reliable sources should be included or excluded.
Discussed on
- "Wikipedia's List of Reliable Sources" | 2022-12-27 | 12 Upvotes 4 Comments
- "Wikipedia: Reliable Sources/Perennial Sources" | 2022-04-29 | 10 Upvotes 1 Comments
- "Wikipedia frequently-encountered sources, color-coded by perceived reliability" | 2021-01-08 | 99 Upvotes 79 Comments
π Soviet version of the Space Shuttle
Buran (Russian: ΠΡΡΠ°ΜΠ½, IPA:Β [bΚΛran], meaning "Snowstorm" or "Blizzard"; GRAU index serial number: "11F35 K1") was the first spaceplane to be produced as part of the Soviet/Russian Buran programme. It is, depending on the source, also known as "OK-1K1", "Orbiter K1", "OK 1.01" or "Shuttle 1.01". Besides describing the first operational Soviet/Russian shuttle orbiter, "Buran" was also the designation for the entire Soviet/Russian spaceplane project and its orbiters, which were known as "Buran-class spaceplanes".
OK-1K1 completed one uncrewed spaceflight in 1988, and was destroyed in 2002 when the hangar it was stored in collapsed. The Buran-class orbiters used the expendable Energia rocket, a class of super heavy-lift launch vehicle.
Discussed on
- "Soviet version of the Space Shuttle" | 2011-01-27 | 33 Upvotes 28 Comments
π Fletcher's Checksum
The Fletcher checksum is an algorithm for computing a position-dependent checksum devised by John G. Fletcher (1934β2012) at Lawrence Livermore Labs in the late 1970s. The objective of the Fletcher checksum was to provide error-detection properties approaching those of a cyclic redundancy check but with the lower computational effort associated with summation techniques.
Discussed on
- "Fletcher's Checksum" | 2018-10-02 | 87 Upvotes 11 Comments