Have a deep view into what people are curious about.

🔗 Computing 🔗 Microsoft Windows 🔗 Microsoft Windows/Computing

The AARD code was a segment of code in a beta release of Microsoft Windows 3.1 that would determine whether Windows was running on MS-DOS or PC DOS, rather than a competing workalike such as DR-DOS, and would result in a cryptic error message in the latter case. This XOR-encrypted, self-modifying, and deliberately obfuscated machine code used a variety of undocumented DOS structures and functions to perform its work, and appeared in the installer, WIN.COM, and several other executables in the OS.

The AARD code was originally discovered by Geoff Chappell on 17 April 1992 and then further analyzed and documented in a joint effort with Andrew Schulman. The name was derived from Microsoft programmer Aaron R. Reynolds (1955–2008), who used "AARD" to sign his work; "AARD" was found in the machine code of the installer. Microsoft disabled the AARD code for the final release of Windows 3.1, but did not remove it, so that it could have become reactivated later by the change of a single byte in an installed system, thereby constituting a "smoking gun".

DR-DOS publisher Digital Research released a patch named "business update" in 1992 to enable the AARD tests to pass on its operating system.

The rationale for the AARD code came to light when internal memos were released during the United States v. Microsoft Corp. antitrust case in 1999. Internal memos released by Microsoft revealed that the specific focus of these tests was DR-DOS. At one point, Microsoft CEO Bill Gates sent a memo to a number of employees, reading "You never sent me a response on the question of what things an app would do that would make it run with MS-DOS and not run with DR-DOS. Is there [sic] feature they have that might get in our way?" Microsoft Senior Vice President Brad Silverberg later sent another memo, stating: "What the [user] is supposed to do is feel uncomfortable, and when he has bugs, suspect that the problem is DR-DOS and then go out to buy MS-DOS."

Following the purchase of DR-DOS by Novell and its renaming to "Novell DOS", Microsoft Co-President Jim Allchin stated in a memo, "If you're going to kill someone there isn't much reason to get all worked up about it and angry. Any discussions beforehand are a waste of time. We need to smile at Novell while we pull the trigger."

What had been DR-DOS changed hands again. The new owner, Caldera, Inc., began a lawsuit against Microsoft over the AARD code, Caldera v. Microsoft, which was later settled. It was believed that the settlement ran in the order of $150 million, but was revealed in November 2009 with the release of the Settlement Agreement to be $280 million.

🔗 Constructed languages

Loglan is a constructed language originally designed for linguistic research, particularly for investigating the Sapir–Whorf Hypothesis. The language was developed beginning in 1955 by Dr James Cooke Brown with the goal of making a language so different from natural languages that people learning it would think in a different way if the hypothesis were true. In 1960 Scientific American published an article introducing the language. Loglan is the first among, and the main inspiration for, the languages known as logical languages, which also includes Lojban.

Brown founded The Loglan Institute (TLI) to develop the language and other applications of it. He always considered the language an incomplete research project, and although he released many papers about its design, he continued to claim legal restrictions on its use. Because of this, a group of his followers later formed the Logical Language Group to create the language Lojban along the same principles, but with the intention to make it freely available and encourage its use as a real language.

Supporters of Lojban use the term Loglan as a generic term to refer to both their own language, and Brown's Loglan, referred to as "TLI Loglan" when in need of disambiguation. Although the non-trademarkability of the term Loglan was eventually upheld by the United States Patent and Trademark Office, many supporters and members of The Loglan Institute find this usage offensive, and reserve Loglan for the TLI version of the language.

🔗 Computing

A wetware computer is an organic computer (which can also be known as an artificial organic brain or a neurocomputer) composed of organic material such as living neurons. Wetware computers composed of neurons are different than conventional computers because they are thought to be capable in a way of "thinking for themselves", because of the dynamic nature of neurons. While wetware is still largely conceptual, there has been limited success with construction and prototyping, which has acted as a proof of the concept's realistic application to computing in the future. The most notable prototypes have stemmed from the research completed by biological engineer William Ditto during his time at the Georgia Institute of Technology. His work constructing a simple neurocomputer capable of basic addition from leech neurons in 1999 was a significant discovery for the concept. This research acted as a primary example driving interest in the creation of these artificially constructed, but still organic brains.

🔗 Business

Founder's syndrome (also founderitis) is the difficulty faced by organizations where one or more founders maintain disproportionate power and influence following the effective initial establishment of the project, leading to a wide range of problems for the organization. The passion and charisma of the founder(s), sources of the initial creativity and productivity of the organization, become limiting or destructive factors. The syndrome occurs in both non-profit and for-profit organizations. It may simply limit further growth and success of the project, or it may lead to bitter factionalism and divisions as the scale of demands made on the organization increases, or it may result in outright failure. There are ways in which a founder or organization can respond and grow beyond this situation.

🔗 Languages 🔗 South Africa

Afrikaans is a daughter language of Dutch and—unlike Netherlands Dutch, Belgian Dutch and Surinamese Dutch—a separate standard language rather than a national variety. As an estimated 90 to 95% of Afrikaans vocabulary is ultimately of Dutch origin, there are few lexical differences between the two languages; however, Afrikaans has a considerably more regular morphology, grammar, and spelling.

🔗 Military history 🔗 China 🔗 Urban studies and planning 🔗 Military history/Fortifications 🔗 Military history/Asian military history 🔗 Hong Kong 🔗 Military history/Chinese military history 🔗 Organized crime

Kowloon Walled City was an ungoverned, densely populated settlement in Kowloon City, Hong Kong. Originally a Chinese military fort, the Walled City became an enclave after the New Territories were leased to the UK by China in 1898. Its population increased dramatically following the Japanese occupation of Hong Kong during World War II. By 1990, the walled city contained 50,000 residents within its 2.6-hectare (6.4-acre) borders. From the 1950s to the 1970s, it was controlled by local triads and had high rates of prostitution, gambling, and drug abuse.

In January 1987, the Hong Kong municipal government announced plans to demolish the walled city. After an arduous eviction process, demolition began in March 1993 and was completed in April 1994. Kowloon Walled City Park opened in December 1995 and occupies the area of the former Walled City. Some historical artefacts from the walled city, including its yamen building and remnants of its southern gate, have been preserved there.

🔗 Mathematics 🔗 Books 🔗 Food and drink 🔗 Poland 🔗 Food and drink/Foodservice 🔗 Ukraine

The Scottish Café (Polish: Kawiarnia Szkocka) was a café in Lwów, Poland (now Lviv, Ukraine) where, in the 1930s and 1940s, mathematicians from the Lwów School of Mathematics collaboratively discussed research problems, particularly in functional analysis and topology.

Stanislaw Ulam recounts that the tables of the café had marble tops, so they could write in pencil, directly on the table, during their discussions. To keep the results from being lost, and after becoming annoyed with their writing directly on the table tops, Stefan Banach's wife provided the mathematicians with a large notebook, which was used for writing the problems and answers and eventually became known as the Scottish Book. The book—a collection of solved, unsolved, and even probably unsolvable problems—could be borrowed by any of the guests of the café. Solving any of the problems was rewarded with prizes, with the most difficult and challenging problems having expensive prizes (during the Great Depression and on the eve of World War II), such as a bottle of fine brandy.

For problem 153, which was later recognized as being closely related to Stefan Banach's "basis problem", Stanisław Mazur offered the prize of a live goose. This problem was solved only in 1972 by Per Enflo, who was presented with the live goose in a ceremony that was broadcast throughout Poland.

The café building now houses the Szkocka Restaurant & Bar (named for the original Scottish Café) and the Atlas Deluxe hotel at the street address of 27 Taras Shevchenko Prospekt.

🔗 Economics 🔗 Philosophy 🔗 Politics 🔗 Philosophy/Social and political philosophy 🔗 Sociology 🔗 Social Work 🔗 Mythology 🔗 Conservatism

Myth of meritocracy is a phrase arguing that meritocracy, or achieving upward social mobility through one's own merits regardless of one's social position, is not widely attainable in capitalist societies because of inherent contradictions. Meritocracy is argued to be a myth because, despite being promoted as an open and accessible method of achieving upward class mobility under neoliberal or free market capitalism, wealth disparity and limited class mobility remain widespread, regardless of individual work ethic. Some scholars argue that the wealth disparity has even increased because the "myth" of meritocracy has been so effectively promoted and defended by the political and private elite through the media, education, corporate culture, and elsewhere. Economist Robert Reich argues that many Americans still believe in meritocracy despite "the nation drifting ever-farther away from it."

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

🔗 Computing 🔗 Computer science 🔗 Computing/Software 🔗 Computing/Computer science

Comb sort is a relatively simple sorting algorithm originally designed by Włodzimierz Dobosiewicz and Artur Borowy in 1980, later rediscovered by Stephen Lacey and Richard Box in 1991. Comb sort improves on bubble sort.