Have a deep view into what people are curious about.

🔗 Books 🔗 Maps

An Atlas of Fantasy, compiled by Jeremiah Benjamin Post, was originally published in 1973 by Mirage Press and revised for a 1979 edition by Ballantine Books. The 1979 edition dropped twelve maps from the first edition and added fourteen new ones. It also included an introduction by Lester del Rey.

To remain of manageable size, the Atlas excludes advertising maps, cartograms, most disproportionate maps, and alternate history ("might have been") maps, focusing instead on imaginary lands derived from literary sources. It purposefully omits "one-to-one" maps such as Thomas Hardy's Wessex (which merely renames places in southwest England), but includes Barsetshire and Yoknapatawpha County, which are evidently considered to be sufficiently fictionalized. The emphasis is on science fiction and fantasy, though Post suggests there exist enough mystery fiction maps to someday create The Detectives' Handy Pocket Atlas. Other maps were omitted due to permission costs or reproduction quality.

The maps are reproduced from many sources, and an Index of Artists is included.

🔗 Soviet Union 🔗 Russia 🔗 Russia/mass media in Russia 🔗 Television 🔗 Russia/history of Russia

Lenin was a mushroom (Russian: Ленин — гриб) was a highly influential televised hoax by Soviet musician Sergey Kuryokhin and reporter Sergey Sholokhov. It was first broadcast on 17 May 1991 on Leningrad Television.

The hoax took the form of an interview on the television program Pyatoe Koleso (The Fifth Wheel). In the interview, Kuryokhin, impersonating a historian, narrated his findings that Vladimir Lenin consumed large quantities of psychedelic mushrooms and eventually became a mushroom himself. Kuryokhin arrived at his conclusion through a long series of logical fallacies and appeals to the authority of various "sources" (such as Carlos Castaneda, the Massachusetts Institute of Technology, and Konstantin Tsiolkovsky), creating the illusion of a reasoned and plausible logical chain.

The timing of the hoax played a large role in its success, coming as it did during the Glasnost period when the ebbing of censorship in the Soviet Union led to many revelations about the country's history, often presented in sensational form. Furthermore, Soviet television had, up to that point, been regarded by its audience as conservative in style and content. As a result, a large number of Soviet citizens (one estimate puts the number at 11,250,000 audience members) took the deadpan "interview" at face value, in spite of the absurd claims presented.

Sholokhov has said that perhaps the most notable result of the show was an appeal by a group of party members to the Leningrad Regional Committee of the CPSU to clarify the veracity of Kuryokhin's claim. According to Sholokhov, in response to the request one of the top regional functionaries stated that "Lenin could not have been a mushroom" because "a mammal cannot be a plant." Modern taxonomy classifies mushrooms as fungi, a separate kingdom from plants.

The incident has served as a watershed moment in Soviet (and Russian) culture and has often been used as proof of the gullibility of the masses.

🔗 Computing 🔗 Lists 🔗 Java

This article provides non-exhaustive lists of Java SE Java virtual machines (JVMs). It does not include a large number of Java ME vendors. Note that Java EE runs on the standard Java SE JVM but that some vendors specialize in providing a modified JVM optimized for Java EE applications. A large amount of Java development work takes place on Windows, Solaris, Linux and FreeBSD, primarily with the Oracle JVMs. Note the further complication of different 32-bit/64-bit varieties.

The primary reference Java VM implementation is HotSpot, produced by Oracle Corporation.

🔗 Computing 🔗 Electronics 🔗 Electrical engineering

Charlieplexing (also known as tristate multiplexing, reduced pin-count LED multiplexing, complementary LED drive and crossplexing) is a technique for accessing a large number of LEDs, switches, micro-capacitors or other I/O entities, using very few tri-state logic wires from a microcontroller, these entities being wired as discrete components, x/y arrays, or woven in a diagonally intersecting pattern to form diagonal arrays.

The method uses the tri-state logic capabilities of microcontrollers in order to gain efficiency over traditional multiplexing, each I/O pin being capable, when required, of rapidly changing between the three states, logical 1, logical 0, and high impedance.

This enables these I/O entities (LEDs, switches etc.) to be connected between any two microcontroller I/Os - e.g. with 4 I/Os, each I/O can pair with 3 other I/Os, resulting in 6 unique pairings (1/2, 1/3, 1/4, 2/3, 2/4, 3/4). Only 4 pairings are possible with standard x/y multiplexing (1/3, 1/4, 2/3, 2/4). Also, due to the microcontroller's ability to reverse the polarity of the 6 I/O pairs, the number of LEDS (or diodes) that are uniquely addressable, can be doubled to 12 - adding LEDS 2/1, 3/1, 4/1, 3/2, 4/2 and 4/3.

Although it is more efficient in its use of I/O, a small amount of address manipulation is required when trying to fit Charlieplexing into a standard x/y array.

Other issues that affect standard multiplexing but are exacerbated by Charlieplexing are:

• consideration of current requirements and the forward voltages of the LEDs.
• a requirement to cycle through the in-use LEDs rapidly so that the persistence of the human eye perceives the display to be lit as a whole. Multiplexing can generally be seen by a strobing effect and skewing if the eye's focal point is moved past the display rapidly.

🔗 Mathematics

In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated packing density, η, of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions – this is called sphere packing, which usually deals only with identical spheres.

While the circle has a relatively low maximum packing density of 0.9069 on the Euclidean plane, it does not have the lowest possible. The "worst" shape to pack onto a plane is not known, but the smoothed octagon has a packing density of about 0.902414, which is the lowest maximum packing density known of any centrally-symmetric convex shape. Packing densities of concave shapes such as star polygons can be arbitrarily small.

The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like.

🔗 Sanitation

A shit flow diagram (also called excreta flow diagram or SFD) is a high level technical drawing used to display how excreta moves through a location, and functions as a tool to identify where improvements are needed. The diagram has a particular focus on treatment of the waste, and its final disposal or use. SFDs are most often used in developing countries.

🔗 Yugoslavia 🔗 Economics

Despite common origins, the economy of the Socialist Federal Republic of Yugoslavia (SFRY) was significantly different from the economies of the Soviet Union and other Eastern European socialist states, especially after the Yugoslav-Soviet break-up in 1948. The occupation and liberation struggle in World War II left Yugoslavia's infrastructure devastated. Even the most developed parts of the country were largely rural and the little industry of the country was largely damaged or destroyed.

🔗 Statistics

In statistics, Halton sequences are sequences used to generate points in space for numerical methods such as Monte Carlo simulations. Although these sequences are deterministic, they are of low discrepancy, that is, appear to be random for many purposes. They were first introduced in 1960 and are an example of a quasi-random number sequence. They generalize the one-dimensional van der Corput sequences.

🔗 Computer science 🔗 Mathematics 🔗 Systems 🔗 Cryptography 🔗 Cryptography/Computer science 🔗 Systems/Operations research

The knapsack problem is a problem in combinatorial optimization: Given a set of items, each with a weight and a value, determine the number of each item to include in a collection so that the total weight is less than or equal to a given limit and the total value is as large as possible. It derives its name from the problem faced by someone who is constrained by a fixed-size knapsack and must fill it with the most valuable items. The problem often arises in resource allocation where the decision makers have to choose from a set of non-divisible projects or tasks under a fixed budget or time constraint, respectively.

The knapsack problem has been studied for more than a century, with early works dating as far back as 1897. The name "knapsack problem" dates back to the early works of mathematician Tobias Dantzig (1884–1956), and refers to the commonplace problem of packing the most valuable or useful items without overloading the luggage.

🔗 Mathematics 🔗 Physics 🔗 Lists 🔗 Anthroponymy

Carl Friedrich Gauss (1777–1855) is the eponym of all of the topics listed below. There are over 100 topics all named after this German mathematician and scientist, all in the fields of mathematics, physics, and astronomy. The English eponymous adjective Gaussian is pronounced GOWSS-ee-ən.