Have a deep view into what people are curious about.

🔗 Biography 🔗 Comedy 🔗 Biography/arts and entertainment 🔗 Japan 🔗 Japan/Biography 🔗 Japan/Owarai 🔗 Japan/Gaijin tarento

Jason David Danielson (born April 9, 1986), known professionally as Atsugiri Jason (厚切りジェイソン, Atsugiri Jeison, lit. "Thick-sliced Jason"), is an American comedian based in Japan and associated with Watanabe Entertainment. Danielson's comedic narrative is based on his confusion with kanji, ending with the punchline, "Why Japanese people?!"

🔗 Music theory

The Parsons code, formally named the Parsons code for melodic contours, is a simple notation used to identify a piece of music through melodic motion — movements of the pitch up and down. Denys Parsons developed this system for his 1975 book The Directory of Tunes and Musical Themes. Representing a melody in this manner makes it easier to index or search for pieces, particularly when the notes values are unknown.

The book was also published in Germany in 2002 and reprinted by Piatkus as The Directory of Classical Themes in 2008.

🔗 Science Fiction

"Computers Don't Argue" is a 1965 science fiction short story by American writer Gordon R. Dickson, about the dangers of relying too strongly upon computers. It was nominated for a Nebula Award in 1966.

🔗 Lists 🔗 Songs

This is a list of musical compositions or pieces of music that have unusual time signatures. "Unusual" is here defined to be any time signature other than simple time signatures with top numerals of 2, 3, or 4 and bottom numerals of 2, 4, or 8, and compound time signatures with top numerals of 6, 9, or 12 and bottom numerals 4, 8, or 16.

The conventions of musical notation typically allow for more than one written representation of a particular piece. The chosen time signature largely depends upon musical context, personal taste of the composer or transcriber, and the graphic layout on the written page. Frequently, published editions were written in a specific time signature to visually signify the tempo for slow movements in symphonies, sonatas, and concerti.

A perfectly consistent unusual metrical pattern may be notated in a more familiar time signature that does not correspond to it. For example, the Passacaglia from Britten's opera Peter Grimes consists of variations over a recurring bass line eleven beats in length but is notated in ordinary ⁴
₄ time, with each variation lasting 2+3⁄4 bars, and therefore commencing each time one crotchet earlier in the bar than the preceding one.

🔗 Computer science

Bead sort, also called gravity sort, is a natural sorting algorithm, developed by Joshua J. Arulanandham, Cristian S. Calude and Michael J. Dinneen in 2002, and published in The Bulletin of the European Association for Theoretical Computer Science. Both digital and analog hardware implementations of bead sort can achieve a sorting time of O(n); however, the implementation of this algorithm tends to be significantly slower in software and can only be used to sort lists of positive integers. Also, it would seem that even in the best case, the algorithm requires O(n²) space.

🔗 Computing

Koomey's law describes a trend in the history of computing hardware: for about a half-century, the number of computations per joule of energy dissipated doubled about every 1.57 years. Professor Jonathan Koomey described the trend in a 2010 paper in which he wrote that "at a fixed computing load, the amount of battery you need will fall by a factor of two every year and a half."

This trend had been remarkably stable since the 1950s (R² of over 98%). But in 2011, Koomey re-examined this data and found that after 2000, the doubling slowed to about once every 2.6 years. This is related to the slowing of Moore's Law, the ability to build smaller transistors; and the end around 2005 of Dennard scaling, the ability to build smaller transistors with constant power density.

"The difference between these two growth rates is substantial. A doubling every year and a half results in a 100-fold increase in efficiency every decade. A doubling every two and a half years yields just a 16-fold increase", Koomey wrote.

🔗 Home Living

An antimacassar is a small cloth placed over the backs or arms of chairs, or the head or cushions of a sofa, to prevent soiling of the permanent fabric underneath. The name also refers to the cloth flap 'collar' on a sailor's shirt or top, used to keep macassar oil off the uniform.

Macassar oil was an unguent for the hair commonly used by men in the early 19th century, and reputed to have been manufactured from ingredients purchased in the port of Makassar in the Dutch East Indies. The poet Byron called it "thine incomparable oil, Macassar". The fashion for oiled hair became so widespread in the Victorian and the Edwardian period that housewives began to cover the arms and backs of their chairs with washable cloths to prevent the fabric coverings from being soiled. Around 1850, these started to be known as antimacassars. They were also installed in theatres, from 1865.

They came to have elaborate patterns, often in matching sets for the various items of parlour furniture; they were either made at home using a variety of techniques such as crochet or tatting, or purchased. The original antimacassars were usually made of stiff white crochet-work, but in the third quarter of the 19th century they became simpler and softer, usually fabric embroidered with a simple pattern in wool or silk.

By the beginning of the 20th century, antimacassars had become so associated in people's minds with the Victorian period that the word briefly became a figurative term for it. For example, antimacassars are suggestive of old-fashioned, Victorian-era women in Rebecca West's novel The Return of the Soldier.

Antimacassars are also used on the seat headrests of commercial passenger transport vehicles, such as trains, buses and, especially, aircraft, to prevent the transmission of hair dressings and conditions between passengers, simplify maintenance, and extend the life of fabrics.

🔗 United States 🔗 Food and drink

The National Raisin Reserve was a raisin reserve of the United States. It was created after World War II by the government in order to control raisin prices. The reserve was run by the Raisin Administrative Committee. It was enforced by means of a "marketing order". In 2015, the United States Supreme Court ruled the reserve unconstitutional and ended it.

🔗 Statistics

Extreme learning machines are feedforward neural networks for classification, regression, clustering, sparse approximation, compression and feature learning with a single layer or multiple layers of hidden nodes, where the parameters of hidden nodes (not just the weights connecting inputs to hidden nodes) need not be tuned. These hidden nodes can be randomly assigned and never updated (i.e. they are random projection but with nonlinear transforms), or can be inherited from their ancestors without being changed. In most cases, the output weights of hidden nodes are usually learned in a single step, which essentially amounts to learning a linear model. The name "extreme learning machine" (ELM) was given to such models by its main inventor Guang-Bin Huang.

According to their creators, these models are able to produce good generalization performance and learn thousands of times faster than networks trained using backpropagation. In literature, it also shows that these models can outperform support vector machines (SVM) and SVM provides suboptimal solutions in both classification and regression applications.

🔗 Cryptography 🔗 Cryptography/Computer science

The MD6 Message-Digest Algorithm is a cryptographic hash function. It uses a Merkle tree-like structure to allow for immense parallel computation of hashes for very long inputs. Authors claim a performance of 28 cycles per byte for MD6-256 on an Intel Core 2 Duo and provable resistance against differential cryptanalysis. The source code of the reference implementation was released under MIT license.

Speeds in excess of 1 GB/s have been reported to be possible for long messages on 16-core CPU architecture.

In December 2008, Douglas Held of Fortify Software discovered a buffer overflow in the original MD6 hash algorithm's reference implementation. This error was later made public by Ron Rivest on 19 February 2009, with a release of a corrected reference implementation in advance of the Fortify Report.

MD6 was submitted to the NIST SHA-3 competition. However, on July 1, 2009, Rivest posted a comment at NIST that MD6 is not yet ready to be a candidate for SHA-3 because of speed issues, a "gap in the proof that the submitted version of MD6 is resistant to differential attacks", and an inability to supply such a proof for a faster reduced-round version, although Rivest also stated at the MD6 website that it is not withdrawn formally. MD6 did not advance to the second round of the SHA-3 competition. In September 2011, a paper presenting an improved proof that MD6 and faster reduced-round versions are resistant to differential attacks was posted to the MD6 website.