Random Articles (Page 406)

Have a deep view into what people are curious about.

๐Ÿ”— KaiOS

๐Ÿ”— Telecommunications ๐Ÿ”— Software ๐Ÿ”— Software/Computing ๐Ÿ”— Hong Kong

KaiOS is a mobile operating system based on Linux, developed by KaiOS Technologies, a US-based company. It is forked from B2G OS (Boot to Gecko OS), an open source community-driven fork of Firefox OS, which was discontinued by Mozilla in 2016.

The primary features of KaiOS bring support for 4G LTE E, VoLTE, GPS and Wi-Fi with HTML5-based apps and longer battery life to non-touch devices with optimized user interface, less memory and energy consumption. It also features over-the-air updates. A dedicated app marketplace (KaiStore) enables users to download applications. Some services are preloaded as HTML5 applications, including Twitter, Facebook and YouTube. The operating system is comparatively lightweight on hardware resource usage, and is able to run on devices with just 256ย MB of memory.

The operating system first appeared in 2017 and is developed by KaiOS Technologies Inc., a San Diego, California-based company headed by CEO Sebastien Codeville with offices in other countries. In June 2018, Google invested US$22 million in the operating system. India-based telecom operator Reliance Jio also invested $7 million in cash to pick up a 16% stake in the company.

In market share study results announced in May 2018, KaiOS beat Apple's iOS for second place in India, while Android dominates with 71%, albeit down by 9%. KaiOS growth is being largely attributed to popularity of the competitively-priced Jio Phone. In Q1 2018, 23 million KaiOS devices were shipped.

KaiOS is also the name of an unrelated Linux project, dating from 2014 and targeted at embedded systems.

Discussed on

  • "KaiOS" | 2024-03-17 | 10 Upvotes 4 Comments
  • "KaiOS" | 2019-09-18 | 98 Upvotes 79 Comments

๐Ÿ”— Shell Grotto, Margate

๐Ÿ”— Architecture ๐Ÿ”— Kent ๐Ÿ”— Architecture/Historic houses ๐Ÿ”— Historic sites

The Shell Grotto, sometimes called the Shell Temple, is an ornate underground shell grotto in the seaside town of Margate, Kent, England. The grotto, which has a passageway and main room, was dug out from chalk, a soft limestone common in the region. Almost all the surface area of the walls and roof is covered in mosaics created entirely of seashells, totalling about 2,000 square feet (190ย m2) of mosaic, with approximately 4.6ย million shells. Its age, creators, and purpose are unknown, which has inspired a wide range of speculation, although several other shell grottos in England were made in the 18th century. This grotto was rediscovered in about 1835 and first opened to the public as a privately-owned tourist attraction in 1837. The grotto is a Grade I-listed building and remains open to the public. Attached to the grotto is a modern museum room, cafe, and gift shop.

Discussed on

๐Ÿ”— Lojban

๐Ÿ”— Constructed languages

Lojban (pronounced [หˆloส’ban] (listen)) is a constructed, syntactically unambiguous human language created by the Logical Language Group and succeeding the Loglan project.

The Logical Language Group (LLG) began developing Lojban in 1987. The LLG sought to realize Loglan's purposes, and further improve the language by making it more usable and freely available (as indicated by its official full English title, "Lojban: A Realization of Loglan"). After a long initial period of debating and testing, the baseline was completed in 1997, and published as The Complete Lojban Language. In an interview in 2010 with The New York Times, Arika Okrent, the author of In the Land of Invented Languages, stated: "The constructed language with the most complete grammar is probably Lojbanโ€”a language created to reflect the principles of logic."

Lojban is proposed as a speakable language for communication between people of different language backgrounds, as a potential means of machine translation and to explore the intersection of human language and software.

Discussed on

๐Ÿ”— History of the Monte Carlo method

๐Ÿ”— Computing ๐Ÿ”— Computer science ๐Ÿ”— Mathematics ๐Ÿ”— Physics ๐Ÿ”— Statistics

Monte Carlo methods, or Monte Carlo experiments, are a broad class of computational algorithms that rely on repeated random sampling to obtain numerical results. The underlying concept is to use randomness to solve problems that might be deterministic in principle. They are often used in physical and mathematical problems and are most useful when it is difficult or impossible to use other approaches. Monte Carlo methods are mainly used in three problem classes: optimization, numerical integration, and generating draws from a probability distribution.

In physics-related problems, Monte Carlo methods are useful for simulating systems with many coupled degrees of freedom, such as fluids, disordered materials, strongly coupled solids, and cellular structures (see cellular Potts model, interacting particle systems, McKeanโ€“Vlasov processes, kinetic models of gases).

Other examples include modeling phenomena with significant uncertainty in inputs such as the calculation of risk in business and, in mathematics, evaluation of multidimensional definite integrals with complicated boundary conditions. In application to systems engineering problems (space, oil exploration, aircraft design, etc.), Monte Carloโ€“based predictions of failure, cost overruns and schedule overruns are routinely better than human intuition or alternative "soft" methods.

In principle, Monte Carlo methods can be used to solve any problem having a probabilistic interpretation. By the law of large numbers, integrals described by the expected value of some random variable can be approximated by taking the empirical mean (a.k.a. the sample mean) of independent samples of the variable. When the probability distribution of the variable is parameterized, mathematicians often use a Markov chain Monte Carlo (MCMC) sampler. The central idea is to design a judicious Markov chain model with a prescribed stationary probability distribution. That is, in the limit, the samples being generated by the MCMC method will be samples from the desired (target) distribution. By the ergodic theorem, the stationary distribution is approximated by the empirical measures of the random states of the MCMC sampler.

In other problems, the objective is generating draws from a sequence of probability distributions satisfying a nonlinear evolution equation. These flows of probability distributions can always be interpreted as the distributions of the random states of a Markov process whose transition probabilities depend on the distributions of the current random states (see McKeanโ€“Vlasov processes, nonlinear filtering equation). In other instances we are given a flow of probability distributions with an increasing level of sampling complexity (path spaces models with an increasing time horizon, Boltzmannโ€“Gibbs measures associated with decreasing temperature parameters, and many others). These models can also be seen as the evolution of the law of the random states of a nonlinear Markov chain. A natural way to simulate these sophisticated nonlinear Markov processes is to sample multiple copies of the process, replacing in the evolution equation the unknown distributions of the random states by the sampled empirical measures. In contrast with traditional Monte Carlo and MCMC methodologies, these mean-field particle techniques rely on sequential interacting samples. The terminology mean field reflects the fact that each of the samples (a.k.a. particles, individuals, walkers, agents, creatures, or phenotypes) interacts with the empirical measures of the process. When the size of the system tends to infinity, these random empirical measures converge to the deterministic distribution of the random states of the nonlinear Markov chain, so that the statistical interaction between particles vanishes.

Despite its conceptual and algorithmic simplicity, the computational cost associated with a Monte Carlo simulation can be staggeringly high. In general the method requires many samples to get a good approximation, which may incur an arbitrarily large total runtime if the processing time of a single sample is high. Although this is a severe limitation in very complex problems, the embarrassingly parallel nature of the algorithm allows this large cost to be reduced (perhaps to a feasible level) through parallel computing strategies in local processors, clusters, cloud computing, GPU, FPGA, etc.

Discussed on

๐Ÿ”— Berlin Key

๐Ÿ”— Technology

The Berlin key (also known as, German, SchlieรŸzwangschlรผssel, or, in English, forced-locking key) is a key for a type of door lock. It was designed to force people to close and lock their doors, usually a main entrance door or gate leading into a common yard or tenement block. The key was a solution to the problem of access via communal doors of such blocks (Mietskaserne) as early as the 19th century.

Discussed on

๐Ÿ”— Hoover Free Flights Promotion

๐Ÿ”— Aviation ๐Ÿ”— Marketing & Advertising ๐Ÿ”— United Kingdom ๐Ÿ”— Guild of Copy Editors ๐Ÿ”— Retailing ๐Ÿ”— Home Living

The Hoover free flights promotion was a marketing promotion run by the British division of the Hoover Company in late 1992. The promotion, aiming to boost sales during the global recession of the early 1990s, offered two complimentary round-trip plane tickets to the United States, worth about ยฃ600, to any customer purchasing at least ยฃ100 in Hoover products. Hoover had been experiencing dwindling sales as a result of the economic downturn and a sharp increase in competing brands. Hoover was counting on most customers spending more than ยฃ100, as well as being deterred from completing the difficult application process, and not meeting its exact terms.

Consumer response was much higher than the company anticipated, with many customers buying the minimum ยฃ100 of Hoover products to qualify. It was perceived as two US flights for just ยฃ100 with a free vacuum cleaner included. The resulting demand was disastrous for the 84-year-old company. Hoover cancelled the ticket promotion after consumers had already bought the products and filled in forms applying for millions of pounds' worth of tickets. Reneging on the offer resulted in protests and legal action from customers who failed to receive the tickets they had been promised. The campaign was a financial disaster for the company and led to the loss of Hoover's Royal Warrant after the airing of a 2004 BBC documentary. The European branch of the company was eventually sold to one of its competitors, Candy, having never recovered from the losses, the promotion and the subsequent scandal.

Discussed on

๐Ÿ”— Battle for Castle Itter

๐Ÿ”— Military history ๐Ÿ”— Military history/North American military history ๐Ÿ”— Military history/United States military history ๐Ÿ”— Military history/World War II ๐Ÿ”— Austria ๐Ÿ”— Military history/German military history ๐Ÿ”— Military history/French military history ๐Ÿ”— Military history/European military history

The Battle for Castle Itter was fought in the Austrian North Tyrol village of Itter on 5 May 1945, in the last days of the European Theater of World War II.

Troops of the 23rd Tank Battalion of the 12th Armored Division of the US XXI Corps led by Captain John C. "Jack" Lee, Jr., a number of Wehrmacht soldiers led by Major Josef "Sepp" Gangl, SS-Hauptsturmfรผhrer Kurt-Siegfried Schrader, and recently freed French prisoners of war defended Castle Itter against an attacking force from the 17th SS Panzergrenadier Division until relief from the American 142nd Infantry Regiment of the 36th Division of XXI Corps arrived.

The French prisoners included former prime ministers, generals and a tennis star. It is the only known time during the war in which Americans and Germans fought side-by-side. Popular accounts of the battle have called it the strangest battle of World War II.

Discussed on

๐Ÿ”— Getting to โ€œPhilosophyโ€

Clicking on the first link in the main text of a Wikipedia article, and then repeating the process for subsequent articles, would usually lead to the Philosophy article. As of February 2016, 97% of all articles in Wikipedia eventually led to the article Philosophy. The remaining articles lead to an article without any outgoing wikilinks, to pages that do not exist, or get stuck in loops. This has gone up from 94.52% in 2011.

There have been some theories on this phenomenon, with the most prevalent being the tendency for Wikipedia pages to move up a "classification chain." According to this theory, the Wikipedia Manual of Style guidelines on how to write the lead section of an article recommend that the article should start by defining the topic of the article, so that the first link of each page will naturally take the reader into a broader subject, eventually ending in wide-reaching pages such as Mathematics, Science, Language, and of course, Philosophy, nicknamed "the mother of all sciences".

Discussed on

๐Ÿ”— Crown shyness

๐Ÿ”— Agriculture ๐Ÿ”— Plants ๐Ÿ”— Forestry

Crown shyness (also canopy disengagement, canopy shyness, or intercrown spacing) is a phenomenon observed in some tree species, in which the crowns of fully stocked trees do not touch each other, forming a canopy with channel-like gaps. The phenomenon is most prevalent among trees of the same species, but also occurs between trees of different species. There exist many hypotheses as to why crown shyness is an adaptive behavior, and research suggests that it might inhibit spread of leaf-eating insect larvae.

Discussed on