Have a deep view into what people are curious about.

🔗 Internet 🔗 Computing 🔗 Microsoft Windows 🔗 Microsoft Windows/Computing 🔗 Computing/Software 🔗 Microsoft 🔗 IRC

Microsoft Comic Chat (later Microsoft Chat, but not to be confused with Windows Chat, or WinChat) is a graphical IRC client created by Microsoft, first released with Internet Explorer 3.0 in 1996. Comic Chat was developed by Microsoft Researcher David Kurlander, with Microsoft Research's Virtual Worlds Group and later a group he managed in Microsoft's Internet Division.

🔗 Disambiguation

A rat king is a rare phenomenon where a group of rats' tails become entangled.

Rat King or Ratking may also refer to:

🔗 Human rights 🔗 Mass surveillance 🔗 Espionage 🔗 Technology 🔗 Lists 🔗 Politics

This is a list of government surveillance projects and related databases throughout the world.

🔗 Politics 🔗 Socialism 🔗 Sociology

In Marxist theory, the Lumpenproletariat (German: [ˈlʊmpn̩pʁoletaʁi̯ˌaːt] ; ) is the underclass devoid of class consciousness. Karl Marx and Friedrich Engels coined the word in the 1840s and used it to refer to the unthinking lower strata of society exploited by reactionary and counter-revolutionary forces, particularly in the context of the revolutions of 1848. They dismissed the revolutionary potential of the Lumpenproletariat and contrasted it with the proletariat. Among other groups, criminals, vagabonds, and prostitutes are usually included in this category.

The Social Democratic Party of Germany made wide use of the term by the turn of the 20th century. Vladimir Lenin and Leon Trotsky followed Marx's arguments and dismissed the group's revolutionary potential, while Mao Zedong argued that proper leadership could harness it. The word Lumpenproletariat, popularized in the West by Frantz Fanon's The Wretched of the Earth in the 1960s, has been adopted as a sociological term. However, what some consider to be its vagueness and its history as a term of abuse has led to some criticism. Some revolutionary groups, most notably the Black Panther Party and the Young Lords, have sought to mobilize the Lumpenproletariat.

🔗 Medicine 🔗 Psychology 🔗 Rodents

Rat Park was a series of studies into drug addiction conducted in the late 1970s and published between 1978 and 1981 by Canadian psychologist Bruce K. Alexander and his colleagues at Simon Fraser University in British Columbia, Canada.

Alexander's hypothesis was that drugs do not cause addiction, and that the apparent addiction to opiate drugs commonly observed in laboratory rats exposed to them is attributable to their living conditions, and not to any addictive property of the drug itself.

To test his hypothesis, Alexander built Rat Park, a large housing colony, 200 times the floor area of a standard laboratory cage. There were 16–20 rats of both sexes in residence, food, balls and wheels for play, and enough space for mating. The results of the experiment appeared to support his hypothesis.

The two major science journals, Science and Nature, rejected Alexander, Coambs, and Hadaway's first paper, which appeared instead in Psychopharmacology in 1978. The paper's publication initially attracted no response. Within a few years, Simon Fraser University withdrew Rat Park's funding.

🔗 Philosophy 🔗 Philosophy/Logic 🔗 Business 🔗 Politics 🔗 Psychology 🔗 Marketing & Advertising

Serial-position effect is the tendency of a person to recall the first and last items in a series best, and the middle items worst. The term was coined by Hermann Ebbinghaus through studies he performed on himself, and refers to the finding that recall accuracy varies as a function of an item's position within a study list. When asked to recall a list of items in any order (free recall), people tend to begin recall with the end of the list, recalling those items best (the recency effect). Among earlier list items, the first few items are recalled more frequently than the middle items (the primacy effect).

One suggested reason for the primacy effect is that the initial items presented are most effectively stored in long-term memory because of the greater amount of processing devoted to them. (The first list item can be rehearsed by itself; the second must be rehearsed along with the first, the third along with the first and second, and so on.) The primacy effect is reduced when items are presented quickly and is enhanced when presented slowly (factors that reduce and enhance processing of each item and thus permanent storage). Longer presentation lists have been found to reduce the primacy effect.

One theorised reason for the recency effect is that these items are still present in working memory when recall is solicited. Items that benefit from neither (the middle items) are recalled most poorly. An additional explanation for the recency effect is related to temporal context: if tested immediately after rehearsal, the current temporal context can serve as a retrieval cue, which would predict more recent items to have a higher likelihood of recall than items that were studied in a different temporal context (earlier in the list). The recency effect is reduced when an interfering task is given. Intervening tasks involve working memory, as the distractor activity, if exceeding 15 to 30 seconds in duration, can cancel out the recency effect. Additionally, if recall comes immediately after the test, the recency effect is consistent regardless of the length of the studied list, or presentation rate.

Amnesiacs with poor ability to form permanent long-term memories do not show a primacy effect, but do show a recency effect if recall comes immediately after study. People with Alzheimer's disease exhibit a reduced primacy effect but do not produce a recency effect in recall.

🔗 Computer science

The Schönhage–Strassen algorithm is an asymptotically fast multiplication algorithm for large integers. It was developed by Arnold Schönhage and Volker Strassen in 1971. The run-time bit complexity is, in Big O notation, ${\displaystyle O(n\cdot \log n\cdot \log \log n)}$ for two n-digit numbers. The algorithm uses recursive fast Fourier transforms in rings with 2ⁿ+1 elements, a specific type of number theoretic transform.

The Schönhage–Strassen algorithm was the asymptotically fastest multiplication method known from 1971 until 2007, when a new method, Fürer's algorithm, was announced with lower asymptotic complexity; however, Fürer's algorithm currently only achieves an advantage for astronomically large values and is used only in Basic Polynomial Algebra Subprograms (BPAS) (see Galactic algorithms).

In practice the Schönhage–Strassen algorithm starts to outperform older methods such as Karatsuba and Toom–Cook multiplication for numbers beyond 2²¹⁵ to 2²¹⁷ (10,000 to 40,000 decimal digits). The GNU Multi-Precision Library uses it for values of at least 1728 to 7808 64-bit words (33,000 to 150,000 decimal digits), depending on architecture. There is a Java implementation of Schönhage–Strassen which uses it above 74,000 decimal digits.

Applications of the Schönhage–Strassen algorithm include mathematical empiricism, such as the Great Internet Mersenne Prime Search and computing approximations of π, as well as practical applications such as Kronecker substitution, in which multiplication of polynomials with integer coefficients can be efficiently reduced to large integer multiplication; this is used in practice by GMP-ECM for Lenstra elliptic curve factorization.

🔗 Physics 🔗 Astronomy

Rømer's determination of the speed of light was the demonstration in 1676 that light has a finite speed and so does not travel instantaneously. The discovery is usually attributed to Danish astronomer Ole Rømer, who was working at the Royal Observatory in Paris at the time.

By timing the eclipses of the Jovian moon Io, Rømer estimated that light would take about 22 minutes to travel a distance equal to the diameter of Earth's orbit around the Sun. This would give light a velocity of about 220,000 kilometres per second, about 26% lower than the true value of 299,792 km/s.

Rømer's theory was controversial at the time that he announced it and he never convinced the director of the Paris Observatory, Giovanni Domenico Cassini, to fully accept it. However, it quickly gained support among other natural philosophers of the period such as Christiaan Huygens and Isaac Newton. It was finally confirmed nearly two decades after Rømer's death, with the explanation in 1729 of stellar aberration by the English astronomer James Bradley.

🔗 Cognitive science

Soar is a cognitive architecture, originally created by John Laird, Allen Newell, and Paul Rosenbloom at Carnegie Mellon University. (Rosenbloom continued to serve as co-principal investigator after moving to Stanford University, then to the University of Southern California's Information Sciences Institute.) It is now maintained and developed by John Laird's research group at the University of Michigan.

The goal of the Soar project is to develop the fixed computational building blocks necessary for general intelligent agents – agents that can perform a wide range of tasks and encode, use, and learn all types of knowledge to realize the full range of cognitive capabilities found in humans, such as decision making, problem solving, planning, and natural language understanding. It is both a theory of what cognition is and a computational implementation of that theory. Since its beginnings in 1983 as John Laird’s thesis, it has been widely used by AI researchers to create intelligent agents and cognitive models of different aspects of human behavior. The most current and comprehensive description of Soar is the 2012 book, The Soar Cognitive Architecture.

🔗 Biography 🔗 Literature 🔗 Women writers 🔗 Biography/arts and entertainment

Barbara Newhall Follett (March 4, 1914 – disappeared December 7, 1939) was an American child prodigy novelist. Her first novel, The House Without Windows, was published in January 1927, when she was twelve years old. Her next novel, The Voyage of the Norman D.w, received critical acclaim when she was fourteen.

In December 1939, aged 25, Follett reportedly became depressed with her marriage and walked out of her apartment, never to be seen again.