Hint: You are looking at the most popular articles. If you are interested in popular topics instead, click here.

🔗 Professional sound production

A Shepard tone, named after Roger Shepard, is a sound consisting of a superposition of sine waves separated by octaves. When played with the bass pitch of the tone moving upward or downward, it is referred to as the Shepard scale. This creates the auditory illusion of a tone that continually ascends or descends in pitch, yet which ultimately seems to get no higher or lower.

🔗 Computer science

The inner-platform effect is the tendency of software architects to create a system so customizable as to become a replica, and often a poor replica, of the software development platform they are using. This is generally inefficient and such systems are often considered to be examples of an anti-pattern.

I have edited thousands of articles so that they do not contain the phrase "comprised of". Edit summaries for those edits usually refer to this page.

This page explains the purpose of these edits and the project in general.

🔗 Computing 🔗 Food and drink 🔗 Brands 🔗 Food and drink/Beverages

OpenCola is a brand of open-source cola, where the instructions for making it are freely available and modifiable. Anybody can make the drink, and anyone can modify and improve on the recipe. It was launched in 2001 by free software P2P company Opencola, to promote their open-source software concept.

🔗 Mathematics 🔗 Statistics

The secretary problem is a problem that demonstrates a scenario involving optimal stopping theory. The problem has been studied extensively in the fields of applied probability, statistics, and decision theory. It is also known as the marriage problem, the sultan's dowry problem, the fussy suitor problem, the googol game, and the best choice problem.

The basic form of the problem is the following: imagine an administrator who wants to hire the best secretary out of ${\displaystyle n}$ rankable applicants for a position. The applicants are interviewed one by one in random order. A decision about each particular applicant is to be made immediately after the interview. Once rejected, an applicant cannot be recalled. During the interview, the administrator gains information sufficient to rank the applicant among all applicants interviewed so far, but is unaware of the quality of yet unseen applicants. The question is about the optimal strategy (stopping rule) to maximize the probability of selecting the best applicant. If the decision can be deferred to the end, this can be solved by the simple maximum selection algorithm of tracking the running maximum (and who achieved it), and selecting the overall maximum at the end. The difficulty is that the decision must be made immediately.

The shortest rigorous proof known so far is provided by the odds algorithm (Bruss 2000). It implies that the optimal win probability is always at least ${\displaystyle 1/e}$ (where e is the base of the natural logarithm), and that the latter holds even in a much greater generality (2003). The optimal stopping rule prescribes always rejecting the first ${\displaystyle \sim n/e}$ applicants that are interviewed and then stopping at the first applicant who is better than every applicant interviewed so far (or continuing to the last applicant if this never occurs). Sometimes this strategy is called the ${\displaystyle 1/e}$ stopping rule, because the probability of stopping at the best applicant with this strategy is about ${\displaystyle 1/e}$ already for moderate values of ${\displaystyle n}$. One reason why the secretary problem has received so much attention is that the optimal policy for the problem (the stopping rule) is simple and selects the single best candidate about 37% of the time, irrespective of whether there are 100 or 100 million applicants.

🔗 Russia 🔗 Russia/technology and engineering in Russia 🔗 Russia/mass media in Russia 🔗 Military history 🔗 Military history/Military science, technology, and theory 🔗 Military history/Intelligence 🔗 Military history/Russian, Soviet and CIS military history 🔗 Radio Stations

UVB-76, also known as "The Buzzer", is a nickname given by radio listeners to a shortwave radio station that broadcasts on the frequencies 4625 and 4810 kHz. It broadcasts a short, monotonous buzz tone , repeating at a rate of approximately 25 tones per minute, 24 hours per day. Sometimes, the buzzer signal is interrupted and a voice transmission in Russian takes place. The first reports were made of a station on this frequency in 1973.

🔗 Medicine 🔗 Psychology 🔗 Disability 🔗 Neuroscience

Aphantasia is a condition where one does not possess a functioning mind's eye and cannot voluntarily visualize imagery. The phenomenon was first described by Francis Galton in 1880 but has since remained largely unstudied. Interest in the phenomenon renewed after the publication of a study in 2015 conducted by a team led by Professor Adam Zeman of the University of Exeter, which also coined the term aphantasia. Research on the condition is still scarce.

🔗 Computing 🔗 Computer science

A one-instruction set computer (OISC), sometimes called an ultimate reduced instruction set computer (URISC), is an abstract machine that uses only one instruction – obviating the need for a machine language opcode. With a judicious choice for the single instruction and given infinite resources, an OISC is capable of being a universal computer in the same manner as traditional computers that have multiple instructions. OISCs have been recommended as aids in teaching computer architecture and have been used as computational models in structural computing research.

🔗 Computing 🔗 Computer Security 🔗 Computer Security/Computing 🔗 Computing/Software 🔗 Computing/Computer science 🔗 Cryptography 🔗 Cryptography/Computer science 🔗 Computing/Computer Security

Zooko's triangle is a trilemma of three properties that are generally considered desirable for names of participants in a network protocol:

• Human-meaningful: Meaningful and memorable (low-entropy) names are provided to the users.
• Secure: The amount of damage a malicious entity can inflict on the system should be as low as possible.
• Decentralized: Names correctly resolve to their respective entities without the use of a central authority or service.