Have a deep view into what people are curious about.

🔗 Philosophy 🔗 Philosophy/Contemporary philosophy 🔗 Philosophy/Ethics

Master–slave morality (German: Herren- und Sklavenmoral) is a central theme of Friedrich Nietzsche's works, particularly in the first essay of his book, On the Genealogy of Morality. Nietzsche argued that there were two fundamental types of morality: "master morality" and "slave morality". Master morality values pride and power, while slave morality values kindness, empathy, and sympathy. Master morality judges actions as good or bad (e.g. the classical virtues of the noble man versus the vices of the rabble), unlike slave morality, which judges by a scale of good or evil intentions (e. g. Christian virtues and vices, Kantian deontology).

For Nietzsche, a morality is inseparable from the culture which values it, meaning that each culture's language, codes, practices, narratives, and institutions are informed by the struggle between these two moral structures.

🔗 United States 🔗 Law 🔗 Taxation

The Tariff Act of 1930 (codified at 19 U.S.C. ch. 4), commonly known as the Smoot–Hawley Tariff or Hawley–Smoot Tariff, was a law that implemented protectionist trade policies in the United States. Sponsored by Senator Reed Smoot, Republican, Utah] and Representative Willis C. Hawley, it was signed by President Herbert Hoover on June 17, 1930. The act raised US tariffs on over 20,000 imported goods.

The tariffs under the act, excluding duty-free imports, were the second highest in United States history, exceeded by only the Tariff of 1828. The Act prompted retaliatory tariffs by many other countries. The Act and tariffs imposed by America's trading partners in retaliation were major factors of the reduction of American exports and imports by 67% during the Great Depression. Economists and economic historians have agreed that the passage of the Smoot–Hawley Tariff worsened the effects of the Great Depression.

🔗 Medicine 🔗 Food and drink 🔗 Medicine/Toxicology 🔗 Pharmacology 🔗 Medicine/Society and Medicine

Some fruit juices and fruits can interact with numerous drugs, in many cases causing adverse effects. The effect was first discovered accidentally, when a test of drug interactions with alcohol used grapefruit juice to hide the taste of the ethanol.

The effect is most studied with grapefruit and grapefruit juice, but similar effects have been observed with certain other citrus fruits. One medical review advises patients to avoid all citrus juices until further research clarifies the risks. Effects have been observed with apple juice, but their clinical significance is not yet known.

One whole grapefruit, or a small glass (200 mL (6.8 US fl oz)) of grapefruit juice, can cause drug overdose toxicity. Fruit consumed three days before the medicine can still have an effect. The relative risks of different types of citrus fruit have not been systematically studied. Affected drugs typically have an auxiliary label saying “Do not take with grapefruit” on the container, and the interaction is elaborated upon in the package insert. People are also advised to ask their physician or pharmacist about drug interactions.

The effects are caused by furanocoumarins (and, to a lesser extent, flavonoids). These chemicals inhibit key drug metabolizing enzymes, such as cytochrome P450 3A4 (CYP3A4). CYP3A4 is a metabolizing enzyme for almost 50% of drugs, and is found in the liver and small intestinal epithelial cells. As a result, many drugs are affected. Inhibition of enzymes can have two different effects, depending on whether the drug is either

1. metabolized by the enzyme to an inactive metabolite, or
2. activated by the enzyme to an active metabolite.

In the first instance, inhibition of drug-metabolizing enzymes results in elevated concentrations of an active drug in the body, which may cause adverse effects. Conversely, if the medication is a prodrug, it needs to be metabolised to be converted to the active drug. Compromising its metabolism lowers concentrations of the active drug, reducing its therapeutic effect, and risking therapeutic failure.

Low drug concentrations can also be caused when the fruit suppresses drug absorption from the intestine.

🔗 Databases

Third normal form (3NF) is a database schema design approach for relational databases which uses normalizing principles to reduce the duplication of data, avoid data anomalies, ensure referential integrity, and simplify data management. It was defined in 1971 by Edgar F. Codd, an English computer scientist who invented the relational model for database management.

A database relation (e.g. a database table) is said to meet third normal form standards if all the attributes (e.g. database columns) are functionally dependent on solely the primary key. Codd defined this as a relation in second normal form where all non-prime attributes depend only on the candidate keys and do not have a transitive dependency on another key.

A hypothetical example of a failure to meet third normal form would be a hospital database having a table of patients which included a column for the telephone number of their doctor. The phone number is dependent on the doctor, rather than the patient, thus would be better stored in a table of doctors. The negative outcome of such a design is that a doctor's number will be duplicated in the database if they have multiple patients, thus increasing both the chance of input error and the cost and risk of updating that number should it change (compared to a third normal form-compliant data model that only stores a doctor's number once on a doctor table).

Codd later realized that 3NF did not eliminate all undesirable data anomalies and developed a stronger version to address this in 1974, known as Boyce–Codd normal form.

🔗 Philosophy 🔗 England 🔗 Philosophy/Ethics

A Hobson's choice is a free choice in which only one thing is actually offered. The term is often used to describe an illusion that multiple choices are available. The most well known Hobson's choice is "I'll give you a choice: take it or leave it", wherein "leaving it" is strongly undesirable.

The phrase is said to have originated with Thomas Hobson (1544–1631), a livery stable owner in Cambridge, England, who offered customers the choice of either taking the horse in his stall nearest to the door or taking none at all.

🔗 Military history 🔗 Military history/African military history 🔗 British Empire 🔗 Military history/Maritime warfare 🔗 African diaspora 🔗 Military history/European military history 🔗 Military history/British military history

The British Royal Navy established the West Africa Squadron at substantial expense in 1808 after Parliament passed the Slave Trade Act of 1807, an Act for the Abolition of the Slave Trade. The squadron's task was to suppress the Atlantic slave trade by patrolling the coast of West Africa. With a home base at Portsmouth, England, it began with two small ships, the 32-gun fifth-rate frigate HMS Solebay and the Cruizer-class brig-sloop HMS Derwent. At the height of its operations, the squadron employed a sixth of the Royal Navy fleet and marines. In 1819 the Royal Navy established a West Coast of Africa Station and the West Africa Squadron became known as the Preventative Squadron. It remained an independent command until 1856 and then again 1866 to 1867. Between 1830 and 1865, more than 1,500 British sailors died on their mission of freeing slaves with the West Africa Squadron.

Between 1808 and 1860 the West Africa Squadron captured 1,600 slave ships and freed 150,000 Africans. It is considered the most costly international moral action in modern history.

The Squadron has been described as being poorly resourced and plagued by corruption; it only managed to capture around 6% of the transatlantic slave ships, but patrolling 3,000 miles of African coast from 1808 to 1860 it liberated 150,000 Africans.

🔗 Taxation

This article lists countries alphabetically, with total tax revenue as a percentage of gross domestic product (GDP) for the listed countries. The tax percentage for each country listed in the source has been added to the chart.

🔗 Video games 🔗 Computing

Nuclear Gandhi is an Internet meme and an urban legend about the video game Civilization. According to the legend, there was a bug in Civilization that eventually forced the pacifist leader Mahatma Gandhi to be extremely aggressive and to use nuclear weapons heavily.

The bug was first mentioned in 2012, two years after the release of Civilization V, and eventually became one of the most recognizable video game glitches; it has been used as an example of integer overflow in computer science and was included in other Civilization games as an easter egg.

In 2020, Sid Meier contradicted the urban legend, stating there had never been a bug of this sort in the original 1991 game. Nuclear Gandhi was first implemented in Civilization V (2010) as a joke.

🔗 Computer science

In computer programming, the Schwartzian transform is a technique used to improve the efficiency of sorting a list of items. This idiom is appropriate for comparison-based sorting when the ordering is actually based on the ordering of a certain property (the key) of the elements, where computing that property is an intensive operation that should be performed a minimal number of times. The Schwartzian transform is notable in that it does not use named temporary arrays.

The Schwartzian transform is a version of a Lisp idiom known as decorate-sort-undecorate, which avoids recomputing the sort keys by temporarily associating them with the input items. This approach is similar to memoization, which avoids repeating the calculation of the key corresponding to a specific input value. By comparison, this idiom assures that each input item's key is calculated exactly once, which may still result in repeating some calculations if the input data contains duplicate items.

The idiom is named after Randal L. Schwartz, who first demonstrated it in Perl shortly after the release of Perl 5 in 1994. The term "Schwartzian transform" applied solely to Perl programming for a number of years, but it has later been adopted by some users of other languages, such as Python, to refer to similar idioms in those languages. However, the algorithm was already in use in other languages (under no specific name) before it was popularized among the Perl community in the form of that particular idiom by Schwartz. The term "Schwartzian transform" indicates a specific idiom, and not the algorithm in general.

For example, to sort the word list ("aaaa","a","aa") according to word length: first build the list (["aaaa",4],["a",1],["aa",2]), then sort it according to the numeric values getting (["a",1],["aa",2],["aaaa",4]), then strip off the numbers and you get ("a","aa","aaaa"). That was the algorithm in general, so it does not count as a transform. To make it a true Schwartzian transform, it would be done in Perl like this:

🔗 Computer science

In computer science, a succinct data structure is a data structure which uses an amount of space that is "close" to the information-theoretic lower bound, but (unlike other compressed representations) still allows for efficient query operations. The concept was originally introduced by Jacobson to encode bit vectors, (unlabeled) trees, and planar graphs. Unlike general lossless data compression algorithms, succinct data structures retain the ability to use them in-place, without decompressing them first. A related notion is that of a compressed data structure, in which the size of the data structure depends upon the particular data being represented.

Suppose that ${\displaystyle Z}$ is the information-theoretical optimal number of bits needed to store some data. A representation of this data is called:

• implicit if it takes ${\displaystyle Z+O(1)}$ bits of space,
• succinct if it takes ${\displaystyle Z+o(Z)}$ bits of space, and
• compact if it takes ${\displaystyle O(Z)}$ bits of space.

For example, a data structure that uses ${\displaystyle 2Z}$ bits of storage is compact, ${\displaystyle Z+{\sqrt {Z}}}$ bits is succinct, ${\displaystyle Z+\lg Z}$ bits is also succinct, and ${\displaystyle Z+3}$ bits is implicit.

Implicit structures are thus usually reduced to storing information using some permutation of the input data; the most well-known example of this is the heap.