Have a deep view into what people are curious about.

🔗 United States 🔗 Film 🔗 Film/American cinema 🔗 United States/Film - American cinema 🔗 Science Fiction 🔗 Comedy 🔗 20th Century Studios

Idiocracy is a 2006 American science fiction comedy film co-produced and directed by Mike Judge from a screenplay written by Judge and Etan Cohen based on a story written by Judge. The plot follows United States Army librarian Joe Bauers and prostitute Rita, who undergo a government hibernation experiment. Joe and Rita awake five hundred years later in a dystopian anti-intellectual society. The cast includes Luke Wilson, Maya Rudolph, Dax Shepard, Terry Crews, David Herman, Justin Long, Andrew Wilson, and Brad Jordan.

The concept of Idiocracy dates back to a concept Judge envisioned in 1996. Judge finished a script with the working title 3001 in 2001, rewriting the film a year later. Filming took place throughout 2004 at Austin Studios and other cities in Texas. Idiocracy serves as a social satire that touches on issues including anti-intellectualism, commercialism, consumerism, dysgenics, voluntary childlessness, and overpopulation. 20th Century Fox was hesitant to promote the film, refusing to grant it a wide release, and did not screen the film for critics. The decision not to market Idiocracy was seen as unexpected, following the success of Office Space (1999), and led to speculation. According to Crews, the film's satirical depiction of corporations made the film financially unviable, while Judge attributed 20th Century Fox's decision to negative test screenings; Judge stated that 20th Century Fox believed that the film would develop a cult following through its DVD release, similar to Office Space.

The film was released in the United States on September 1, 2006. Despite its lack of a major theatrical release, which resulted in a $495,000 gross at the box office, the film received positive reviews from critics and has since become a cult film.

🔗 United States 🔗 Biography 🔗 Biography/science and academia 🔗 United States/Ohio 🔗 University of California

Elwyn Ralph Berlekamp (September 6, 1940 – April 9, 2019) was an American mathematician known for his work in computer science, coding theory and combinatorial game theory. He was a professor emeritus of mathematics and EECS at the University of California, Berkeley.

Berlekamp was the inventor of an algorithm to factor polynomials, and was one of the inventors of the Berlekamp–Welch algorithm and the Berlekamp–Massey algorithms, which are used to implement Reed–Solomon error correction.

Berlekamp had also been active in money management. In 1986, he began information-theoretic studies of commodity and financial futures.

🔗 Philosophy 🔗 Philosophy/Epistemology

In philosophy and psychology, an alief is an automatic or habitual belief-like attitude, particularly one that is in tension with a person's explicit beliefs.

For example, a person standing on a transparent balcony may believe that they are safe, but alieve that they are in danger. A person watching a sad movie may believe that the characters are completely fictional, but their aliefs may lead them to cry nonetheless. A person who is hesitant to eat fudge that has been formed into the shape of feces, or who exhibits reluctance in drinking from a sterilized bedpan may believe that the substances are safe to eat and drink, but may alieve that they are not.

The term alief was introduced by Tamar Gendler, a professor of philosophy and cognitive science at Yale University, in a pair of influential articles published in 2008. Since the publication of these original articles, the notion of alief has been utilized by Gendler and others — including Paul Bloom and Daniel Dennett — to explain a range of psychological phenomena in addition to those listed above, including the pleasure of stories, the persistence of positive illusions, certain religious beliefs, and certain psychiatric disturbances, such as phobias and obsessive–compulsive disorder.

🔗 United States 🔗 International relations 🔗 Disaster management 🔗 Medicine 🔗 Viruses 🔗 Canada 🔗 Death 🔗 Agriculture 🔗 Mexico

The 2009 flu pandemic or swine flu was an influenza pandemic that lasted from January 2009 to August 2010, and the second of the two pandemics involving H1N1 influenza virus (the first being the 1918–1920 Spanish flu pandemic), albeit a new strain. First described in April 2009, the virus appeared to be a new strain of H1N1, which resulted from a previous triple reassortment of bird, swine, and human flu viruses further combined with a Eurasian pig flu virus, leading to the term "swine flu". According to WHO, the laboratory confirmed death toll is more than 18,036. Meanwhile, some studies estimated that 11 to 21 percent of the global population at the time – or around 700 million to 1.4 billion people (out of a total of 6.8 billion) – contracted the illness. This was more than the number of people infected by the Spanish flu pandemic, but only resulted in about 150,000 to 575,000 fatalities for the 2009 pandemic. A follow-up study done in September 2010 showed that the risk of serious illness resulting from the 2009 H1N1 flu was no higher than that of the yearly seasonal flu. For comparison, the WHO estimates that 250,000 to 500,000 people die of seasonal flu annually.

Unlike most strains of influenza, the Pandemic H1N1/09 virus does not disproportionately infect adults older than 60 years; this was an unusual and characteristic feature of the H1N1 pandemic. Even in the case of previously very healthy people, a small percentage develop pneumonia or acute respiratory distress syndrome (ARDS). This manifests itself as increased breathing difficulty and typically occurs three to six days after initial onset of flu symptoms. The pneumonia caused by flu can be either direct viral pneumonia or a secondary bacterial pneumonia. A November 2009 New England Journal of Medicine article recommended that flu patients whose chest X-ray indicates pneumonia receive both antivirals and antibiotics. In particular, it is a warning sign if a child (and presumably an adult) seems to be getting better and then relapses with high fever, as this relapse may be bacterial pneumonia.

🔗 Computing 🔗 Computer science

In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. The name alludes to the saying "no such thing as a free lunch", that is, no method offers a "short cut". This is under the assumption that the search space is a probability density function. It does not apply to the case where the search space has underlying structure (e.g., is a differentiable function) that can be exploited more efficiently (e.g., Newton's method in optimization) than random search or even has closed-form solutions (e.g., the extrema of a quadratic polynomial) that can be determined without search at all. For such probabilistic assumptions, the outputs of all procedures solving a particular type of problem are statistically identical. A colourful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer independently proved a restricted version of one of Wolpert's theorems and used it to critique the current state of machine learning research on the problem of induction.

In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy might pay a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.

In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance in this context is a particular objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.

🔗 Internet 🔗 Computing

This is a list of Hypertext Transfer Protocol (HTTP) response status codes. Status codes are issued by a server in response to a client's request made to the server. It includes codes from IETF Request for Comments (RFCs), other specifications, and some additional codes used in some common applications of the HTTP. The first digit of the status code specifies one of five standard classes of responses. The message phrases shown are typical, but any human-readable alternative may be provided. Unless otherwise stated, the status code is part of the HTTP/1.1 standard (RFC 7231).

The Internet Assigned Numbers Authority (IANA) maintains the official registry of HTTP status codes.

All HTTP response status codes are separated into five classes or categories. The first digit of the status code defines the class of response, while the last two digits do not have any classifying or categorization role. There are five classes defined by the standard:

• 1xx informational response – the request was received, continuing process
• 2xx successful – the request was successfully received, understood, and accepted
• 3xx redirection – further action needs to be taken in order to complete the request
• 4xx client error – the request contains bad syntax or cannot be fulfilled
• 5xx server error – the server failed to fulfil an apparently valid request

🔗 Biography 🔗 Politics 🔗 Tennessee 🔗 Biography/arts and entertainment 🔗 Biography/politics and government 🔗 Journalism 🔗 Georgia (U.S. state) 🔗 Conservatism

Herman Cain (born December 13, 1945) is an American politician, business executive, syndicated columnist, and Tea Party activist.

Cain grew up in Georgia and graduated from Morehouse College with a bachelor's degree in mathematics. He then graduated with a master's degree in computer science at Purdue University, while also working full-time for the U.S. Department of the Navy. In 1977, he joined the Pillsbury Company where he later became vice president. During the 1980s, Cain's success as a business executive at Burger King prompted Pillsbury to appoint him as chairman and CEO of Godfather's Pizza, in which capacity he served from 1986 to 1996.

Cain was chairman of the Federal Reserve Bank of Kansas City Omaha Branch from 1989 to 1991. He was deputy chairman, from 1992 to 1994, and then chairman until 1996, of the Federal Reserve Bank of Kansas City. In 1995, he was appointed to the Kemp Commission, and in 1996, he served as a senior economic adviser to Bob Dole's presidential campaign. From 1996 to 1999, Cain served as president and CEO of the National Restaurant Association.

In May 2011, Cain announced his presidential candidacy. By the fall, his proposed 9–9–9 tax plan and debating performances had made him a serious contender for the Republican nomination. In November, however, his campaign faced allegations of sexual misconduct—all denied by Cain—and he announced its suspension on December 3.

🔗 Cognitive science

Cognitive grammar is a cognitive approach to language developed by Ronald Langacker, which hypothesizes that grammar, semantics, and lexicon exist on a continuum instead of as separate processes altogether. This approach to language was one of the first projects of cognitive linguistics. In this system, grammar is not a formal system operating independently of meaning. Rather, grammar is itself meaningful and inextricable from semantics.

Construction grammar is a similar focus of cognitive approaches to grammar. While cognitive grammar emphasizes the study of the cognitive principles that give rise to linguistic organization, construction grammar aims to provide a more descriptively and formally detailed account of the linguistic units that comprise a particular language.

Langacker first explicates the system of cognitive grammar in his seminal, two-volume work Foundations of Cognitive Grammar. Volume one is titled "Theoretical Prerequisites", and it explores Langacker's hypothesis that grammar may be deconstructed into patterns that come together in order to represent concepts. This volume concentrates on the broad scope of language especially in terms of the relationship between grammar and semantics. Volume two is titled "Descriptive Application", as it moves beyond the first volume to elaborate on the ways in which Langacker's previously described theories may be applied. Langacker invites his reader to utilize the tools presented in Foundations' first volume in a wide range of, mainly English, grammatical situations.

🔗 Computing 🔗 Computing/Early computers

Lehmer sieves are mechanical devices that implement sieves in number theory. Lehmer sieves are named for Derrick Norman Lehmer and his son Derrick Henry Lehmer. The father was a professor of mathematics at the University of California, Berkeley at the time, and his son followed in his footsteps as a number theorist and professor at Berkeley.

A sieve in general is intended to find the numbers which are remainders when a set of numbers are divided by a second set. Generally, they are used in finding solutions of Diophantine equations or to factor numbers. A Lehmer sieve will signal that such solutions are found in a variety of ways depending on the particular construction.

🔗 Physics 🔗 Weather 🔗 Weather/Weather

A light pillar is an atmospheric optical phenomenon in which a vertical beam of light appears to extend above and/or below a light source. The effect is created by the reflection of light from tiny ice crystals that are suspended in the atmosphere or that comprise high-altitude clouds (e.g. cirrostratus or cirrus clouds). If the light comes from the Sun (usually when it is near or even below the horizon), the phenomenon is called a sun pillar or solar pillar. Light pillars can also be caused by the Moon or terrestrial sources, such as streetlights and erupting volcanoes.