Have a deep view into what people are curious about.

The Chandra–Toueg consensus algorithm, published by Tushar Deepak Chandra and Sam Toueg in 1996, is an algorithm for solving consensus in a network of unreliable processes equipped with an eventually strong failure detector. The failure detector is an abstract version of timeouts; it signals to each process when other processes may have crashed. An eventually strong failure detector is one that never identifies some specific non-faulty process as having failed after some initial period of confusion, and, at the same time, eventually identifies all faulty processes as failed (where a faulty process is a process which eventually fails or crashes and a non-faulty process never fails). The Chandra–Toueg consensus algorithm assumes that the number of faulty processes, denoted by f, is less than n/2 (i.e. the minority), i.e. it assumes f < n/2, where n is the total number of processes.

🔗 Cetaceans 🔗 New Zealand

Pelorus Jack (fl. 1888 – April 1912) was a Risso's dolphin that was famous for meeting and escorting ships through a stretch of water in Cook Strait, New Zealand, between 1888 and 1912. Pelorus Jack was usually spotted in Admiralty Bay between Cape Francis and Collinet Point, near French Pass, a notoriously dangerous channel used by ships travelling between Wellington and Nelson.

Pelorus Jack was shot at from a passing ship, and was later protected by a 1904 New Zealand law.

🔗 United States 🔗 Law

In re Bilski, 545 F.3d 943, 88 U.S.P.Q.2d 1385 (Fed. Cir. 2008), was an en banc decision of the United States Court of Appeals for the Federal Circuit (CAFC) on the patenting of method claims, particularly business methods. The Federal Circuit court affirmed the rejection of the patent claims involving a method of hedging risks in commodities trading. The court also reiterated the machine-or-transformation test as the (meaning sole) applicable test for patent-eligible subject matter, and stated that the test in State Street Bank v. Signature Financial Group should no longer be relied upon.

The Supreme Court of the United States issued an opinion on appeal (as Bilski v. Kappos) that affirmed the judgment of the CAFC, but revised many aspects of the CAFC's decision. In its decision, handed down on June 28, 2010, the Supreme Court rejected the machine-or-transformation test as the sole test of process patent eligibility based on an interpretation of the language of § 101. The majority, however, had high praise for the Federal Circuit opinions, advising that "[s]tudents of patent law would be well advised to study these scholarly opinions."

🔗 Biography 🔗 Russia 🔗 Mathematics 🔗 Biography/science and academia 🔗 Russia/science and education in Russia

Grigori Yakovlevich Perelman (Russian: Григорий Яковлевич Перельман, IPA: [ɡrʲɪˈɡorʲɪj ˈjakəvlʲɪvʲɪtɕ pʲɪrʲɪlʲˈman] (listen); born 13 June 1966) is a Russian mathematician who is known for his contributions to the fields of geometric analysis, Riemannian geometry, and geometric topology.

In the 1990s, partly in collaboration with Yuri Burago, Mikhael Gromov, and Anton Petrunin, he made influential contributions to the study of Alexandrov spaces. In 1994, he proved the soul conjecture in Riemannian geometry, which had been an open problem for the previous 20 years. In 2002 and 2003, he developed new techniques in the analysis of Ricci flow, thereby providing a detailed sketch of a proof of the Poincaré conjecture and Thurston's geometrization conjecture, the former of which had been a famous open problem in mathematics for the past century. The full details of Perelman's work were filled in and explained by various authors over the following several years.

In August 2006, Perelman was offered the Fields Medal for "his contributions to geometry and his revolutionary insights into the analytical and geometric structure of the Ricci flow", but he declined the award, stating: "I'm not interested in money or fame; I don't want to be on display like an animal in a zoo." On 22 December 2006, the scientific journal Science recognized Perelman's proof of the Poincaré conjecture as the scientific "Breakthrough of the Year", the first such recognition in the area of mathematics.

On 18 March 2010, it was announced that he had met the criteria to receive the first Clay Millennium Prize for resolution of the Poincaré conjecture. On 1 July 2010, he rejected the prize of one million dollars, saying that he considered the decision of the board of the Clay Institute to be unfair, in that his contribution to solving the Poincaré conjecture was no greater than that of Richard S. Hamilton, the mathematician who pioneered the Ricci flow partly with the aim of attacking the conjecture. He had previously rejected the prestigious prize of the European Mathematical Society, in 1996.

🔗 Companies 🔗 Lists 🔗 Disney

The following is a list of assets owned and operated by The Walt Disney Company, unless otherwise indicated.

🔗 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.

Anti-intellectualism in American Life is a book by Richard Hofstadter published in 1963 that won the 1964 Pulitzer Prize for General Non-Fiction. In this book, Hofstadter set out to trace the social movements that altered the role of intellect in American society. In so doing, he explored questions regarding the purpose of education and whether the democratization of education altered that purpose and reshaped its form. In considering the historic tension between access to education and excellence in education, Hofstadter argued that both anti-intellectualism and utilitarianism were consequences, in part, of the democratization of knowledge. Moreover, he saw these themes as historically embedded in America's national fabric, an outcome of its colonial European and evangelical Protestant heritage. He contended that American Protestantism's anti-intellectual tradition valued the spirit over intellectual rigour. He also noted that Catholicism could have been expected to add a distinctive leaven to the intellectual dialogue, but American Catholicism lacked intellectual culture, due to its failure to develop an intellectual tradition or produce its own strong class of intellectuals.

🔗 Cryptography 🔗 Cryptography/Computer science 🔗 Citizendium Porting

Kerckhoffs's principle (also called Kerckhoffs's desideratum, assumption, axiom, doctrine or law) of cryptography was stated by Netherlands born cryptographer Auguste Kerckhoffs in the 19th century: A cryptosystem should be secure even if everything about the system, except the key, is public knowledge.

Kerckhoffs's principle was reformulated (or possibly independently formulated) by American mathematician Claude Shannon as "the enemy knows the system", i.e., "one ought to design systems under the assumption that the enemy will immediately gain full familiarity with them". In that form, it is called Shannon's maxim. This concept is widely embraced by cryptographers, in contrast to "security through obscurity", which is not.

🔗 Mathematics

Zero to the power of zero, denoted by 0⁰, is a mathematical expression with no agreed-upon value. The most common possibilities are 1 or leaving the expression undefined, with justifications existing for each, depending on context. In algebra and combinatorics, the generally agreed upon value is 0⁰ = 1, whereas in mathematical analysis, the expression is sometimes left undefined. Computer programs also have differing ways of handling this expression.