Random Articles (Page 254)

Have a deep view into what people are curious about.

πŸ”— 319 Leona

πŸ”— Astronomy πŸ”— Astronomy/Astronomical objects πŸ”— Astronomy/Solar System

319 Leona (provisional designation A920 HE), is a dark asteroid and tumbling slow rotator from the outermost regions of the asteroid belt, approximately 70 kilometers in diameter. It was discovered on 8 October 1891, by French astronomer Auguste Charlois at Nice Observatory in southwestern France. Any reference of its name to a person is unknown. On 12 December 2023 Leona will occult Betelgeuse as seen from southern Europe.

Discussed on

πŸ”— Cistercian Numerals

πŸ”— Mathematics

The medieval Cistercian numerals, or "ciphers" in nineteenth-century parlance, were developed by the Cistercian monastic order in the early thirteenth century at about the time that Arabic numerals were introduced to northwestern Europe. They are more compact than Arabic or Roman numerals, with a single character able to indicate any integer from 1 to 9,999.

Digits are based on a horizontal or vertical stave, with the position of the digit on the stave indicating its place value (units, tens, hundreds or thousands). These digits are compounded on a single stave to indicate more complex numbers. The Cistercians eventually abandoned the system in favor of the Arabic numerals, but marginal use outside the order continued until the early twentieth century.

Discussed on

πŸ”— Happy Men's Day! :)

πŸ”— Holidays πŸ”— Men's Issues

International Men's Day (IMD) is a global awareness day for many issues that men face, including parental alienation, abuse, homelessness, suicide, and violence, celebrated annually on November 19. The objectives of celebrating an International Men's Day are set out in 'All the Six Pillars of International Men's Day'. It is also an occasion to celebrate boys' and men's lives, achievements and contributions, in particular for their contributions to nation, union, society, community, family, marriage, and childcare.

Discussed on

πŸ”— Millennium Challenge 2002 - military simulation

πŸ”— Military history πŸ”— Military history/North American military history πŸ”— Military history/United States military history

Millennium Challenge 2002 (MC02) was a major war game exercise conducted by the United States Armed Forces in mid-2002. The exercise, which ran from 24 July to 15 August and cost US$250 million (equivalent to about $355M in 2019), involved both live exercises and computer simulations. MC02 was meant to be a test of future military "transformation"β€”a transition toward new technologies that enable network-centric warfare and provide more effective command and control of current and future weaponry and tactics. The simulated combatants were the United States, referred to as "Blue", and a fictitious state in the Persian Gulf, "Red", often characterized as Iran or Iraq.

Discussed on

πŸ”— Narcissistic Number

πŸ”— Numbers

In number theory, a narcissistic number (also known as a pluperfect digital invariant (PPDI), an Armstrong number (after Michael F. Armstrong) or a plus perfect number) in a given number base b {\displaystyle b} is a number that is the sum of its own digits each raised to the power of the number of digits.

Discussed on

πŸ”— The Baumol Effect

πŸ”— Economics

In economics, the Baumol effect, also known as Baumol's cost disease, is the rise of wages in jobs that have experienced little or no increase in labor productivity, in response to rising salaries in other jobs that have experienced higher productivity growth. The phenomenon was described by William J. Baumol and William G. Bowen in the 1960s and is an example of cross elasticity of demand.

The rise of wages in jobs without productivity gains derives from the requirement to compete for workers with jobs that have experienced productivity gains and so can naturally pay higher salaries, just as classical economics predicts. For instance, if the retail sector pays its managers low wages, they may decide to quit and get jobs in the automobile sector, where wages are higher because of higher labor productivity. Thus, retail managers' salaries increase not due to labor productivity increases in the retail sector, but due to productivity and corresponding wage increases in other industries.

Discussed on

πŸ”— 2013 Shahbag Protest

πŸ”— Bangladesh

On 5 February 2013, protests began in Shahbag, Bangladesh following demands for capital punishment for Abdul Quader Mollah, who had been sentenced to life imprisonment, and for others convicted of war crimes by the International Crimes Tribunal of Bangladesh. On that day, the International Crimes Tribunal had sentenced Mollah to life in prison after he was convicted on five of six counts of war crimes. Later demands included banning the Bangladesh Jamaat-e-Islami party from politics including election and a boycott of institutions supporting (or affiliated with) the party.

Protesters considered Mollah's sentence too lenient, given his crimes. Bloggers and online activists called for additional protests at Shahbag. Tens of thousands of people joined the demonstration, which gave rise to protests across the country.

A counter-protest, questioning the validity of the tribunal and the protest movement and demanding release of those accused and convicted, was launched by Jamaat-e-Islami as its leaders were the majority of those first identified for trial. The Bangladesh Nationalist Party (BNP) initially expressed its support for Jamaat-e-Islami, a political ally. But, the BNP cautiously welcomed the Shahbag protest, while warning the government not to make political mileage from a movement demanding capital punishment for war criminals.

During the protests, Ahmed Rajib Haider was killed outside his house. On 1 March, five students of North South University were arrested who 'confessed' involvement in Rajib's killing. On 27 February 2013, the tribunal convicted Delwar Hossain Sayeedi of war crimes and sentenced him to death. Jamaat followers protested and there were violent clashes with police. About 60 people were killed in the confrontations; most were Jamaat-Shibir activists, and others were police and civilians.

Discussed on

πŸ”— Worker-Priest

πŸ”— Europe/ESA

Discussed on

πŸ”— Secretary Problem

πŸ”— 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 n {\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 1 / e {\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 ∼ n / e {\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 1 / e {\displaystyle 1/e} stopping rule, because the probability of stopping at the best applicant with this strategy is about 1 / e {\displaystyle 1/e} already for moderate values of n {\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.

Discussed on