To stay up to date you can also follow on Mastodon.

🔗 United States 🔗 Comedy 🔗 Journalism

The Order of the Occult Hand is a secret society of American journalists who slip the meaningless and telltale phrase "It was as if an occult hand had…" in print as an inside joke.

🔗 Africa 🔗 Highways 🔗 Highways/Road transport 🔗 Highways/African Highways

The Trans-African Highway network comprises transcontinental road projects in Africa being developed by the United Nations Economic Commission for Africa (UNECA), the African Development Bank (ADB), and the African Union in conjunction with regional international communities. They aim to promote trade and alleviate poverty in Africa through highway infrastructure development and the management of road-based trade corridors. The total length of the nine highways in the network is 56,683 km (35,221 mi).

In some documents the highways are referred to as "Trans-African Corridors" or "Road Corridors" rather than highways. The name Trans-African Highway and its variants are not in wide common usage outside of planning and development circles, and as of 2014 one does not see them signposted as such or labelled on maps, except in Kenya and Uganda where the Mombasa–Nairobi–Kampala–Fort Portal section (or the Kampala–Kigali feeder road) of Trans-African Highway 8 is sometimes referred to as the "Trans-Africa Highway".

🔗 Computing 🔗 Computer science

In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational cost of finding a solution, averaged over all problems in the class, is the same for any solution method. The name alludes to the saying "no such thing as a free lunch", that is, no method offers a "short cut". This is under the assumption that the search space is a probability density function. It does not apply to the case where the search space has underlying structure (e.g., is a differentiable function) that can be exploited more efficiently (e.g., Newton's method in optimization) than random search or even has closed-form solutions (e.g., the extrema of a quadratic polynomial) that can be determined without search at all. For such probabilistic assumptions, the outputs of all procedures solving a particular type of problem are statistically identical. A colourful way of describing such a circumstance, introduced by David Wolpert and William G. Macready in connection with the problems of search and optimization, is to say that there is no free lunch. Wolpert had previously derived no free lunch theorems for machine learning (statistical inference). Before Wolpert's article was published, Cullen Schaffer independently proved a restricted version of one of Wolpert's theorems and used it to critique the current state of machine learning research on the problem of induction.

In the "no free lunch" metaphor, each "restaurant" (problem-solving procedure) has a "menu" associating each "lunch plate" (problem) with a "price" (the performance of the procedure in solving the problem). The menus of restaurants are identical except in one regard – the prices are shuffled from one restaurant to the next. For an omnivore who is as likely to order each plate as any other, the average cost of lunch does not depend on the choice of restaurant. But a vegan who goes to lunch regularly with a carnivore who seeks economy might pay a high average cost for lunch. To methodically reduce the average cost, one must use advance knowledge of a) what one will order and b) what the order will cost at various restaurants. That is, improvement of performance in problem-solving hinges on using prior information to match procedures to problems.

In formal terms, there is no free lunch when the probability distribution on problem instances is such that all problem solvers have identically distributed results. In the case of search, a problem instance in this context is a particular objective function, and a result is a sequence of values obtained in evaluation of candidate solutions in the domain of the function. For typical interpretations of results, search is an optimization process. There is no free lunch in search if and only if the distribution on objective functions is invariant under permutation of the space of candidate solutions. This condition does not hold precisely in practice, but an "(almost) no free lunch" theorem suggests that it holds approximately.

🔗 Computing

Telescript is an Agent-oriented programming language written by General Magic as part of the overall Magic Cap system. Telescript programs used a modified C-like syntax known as High Telescript and were compiled to a stack-based language called Low Telescript for execution. Low Telescript ran within virtual machine interpreters, or "Telescript engines", on host computers.

The basic model of Telescript is similar to Java, and differs primarily in where the applications would run. Java was modelled to make it possible to download Java applications onto any platform and run them locally. Telescript essentially reversed this, allowing end-user equipment with limited capabilities to upload Telescript programs to servers to allow them to take advantage of the server's capabilities. Telescript could even migrate a running program; the language included features to marshal a program's code and serialized state, transfer it to another Telescript engine (on a device or a server) to continue execution, and finally return to the originating client or server device to deliver its output.

General Magic had originally developed as a team within Apple Inc., and were spun off in 1990. When they began to generate some press buzz in 1992, Apple decided to enter the same market with their Newton tablet computer. General Magic were unable to find a niche within the market, and Telescript services were soon deprecated in favor of new products unrelated to mobile computing.

🔗 United States 🔗 California 🔗 India 🔗 Pakistan 🔗 Ethnic groups 🔗 United States/Asian Americans 🔗 California/Southern California 🔗 United States/Mexican-Americans

The Punjabi Mexican American community, the majority of which is localized to Yuba City, California, is a distinctive ethnicity holding its roots in a migration pattern that occurred almost a century ago. The first meeting of these cultures occurred in the Imperial and Central Valleys in 1907, near the largest irrigation system in the Western Hemisphere.

🔗 Biography

John Socha-Leialoha (born 1958) is a software developer best known for creating Norton Commander, the first orthodox file manager. The original Norton Commander was written for DOS. Over the years, Socha's design for file management has been extended and cloned many times.

John grew up in the woods of Wisconsin, earned a BS degree in Electrical Engineering from University of Wisconsin–Madison, and his PhD in Applied Physics from Cornell University. He now lives in Bellevue, Washington with his wife. His son, John Avi, is a graduate of the University of Washington.

Starting in September 2010, John began working at Microsoft officially.

🔗 Judaism 🔗 Writing systems 🔗 Kabbalah

Gematria (; Hebrew: גמטריא or gimatria גימטריה, plural גמטראות or גימטריאות, gimatriot) is the practice of assigning a numerical value to a name, word or phrase by reading it as a number, or sometimes by using an alphanumerical cipher. The letters of the alphabets involved have standard numerical values, but a word can yield several values if a cipher is used.

According to Aristotle (384–322 BCE), isopsephy, based on the Milesian numbering of the Greek alphabet developed in the Greek city of Miletus, was part of the Pythagorean tradition, which originated in the 6th century BCE. The first evidence of use of Hebrew letters as numbers dates to 78 BCE; gematria is still used in Jewish culture. Similar systems have been used in other languages and cultures, derived from or inspired by either Greek isopsephy or Hebrew gematria, and include Arabic abjad numerals and English gematria.

The most common form of Hebrew gematria is used in the Talmud and Midrash, and elaborately by many post-Talmudic commentators. It involves reading words and sentences as numbers, assigning numerical instead of phonetic value to each letter of the Hebrew alphabet. When read as numbers, they can be compared and contrasted with other words or phrases – cf. the Hebrew proverb נכנס יין יצא סוד (nichnas yayin yatza sod, lit. 'wine entered, secret went out', i.e. "in vino veritas"). The gematric value of יין ('wine') is 70 (י=10; י=10; ן=50) and this is also the gematric value of סוד ('secret', ס=60; ו=6; ד=4)‎.

Although a type of gematria system ('Aru') was employed by the ancient Babylonian culture, their writing script was logographic, and the numerical assignments they made were to whole words. Aru was very different from the Milesian systems used by Greek and Hebrew cultures, which used alphabetic writing scripts. The value of words with Aru were assigned in an entirely arbitrary manner and correspondences were made through tables, and so cannot be considered a true form of gematria.

Gematria sums can involve single words, or a string of lengthy calculations. A short example of Hebrew numerology that uses gematria is the word חי (chai, lit. 'alive'), which is composed of two letters that (using the assignments in the mispar gadol table shown below) add up to 18. This has made 18 a "lucky number" among the Jewish people. Donations of money in multiples of 18 are very popular.

In early Jewish sources, the term can also refer to other forms of calculation or letter manipulation, for example atbash.

🔗 Video games 🔗 Anime and manga

The Tamagotchi Connection, known as Tamagotchi Plus in Japan and Tamagotchi Connexion in the UK, is a virtual pet in the Tamagotchi line of digital toys from Bandai. The Tamagotchi Connection is unique from prior models in that it uses infrared technology to connect and interact with other devices and was first released in 2004, 8 years after the first Tamagotchi toy. Using the device's infrared port, the virtual pet (referred to as a Tamagotchi) can make friends with other Tamagotchis, in addition to playing games, giving and receiving presents and having a baby.

Versions 1 to 4 of Tamagotchi Connection have 6 levels of friendship that can be viewed in the Friends List:

• Acquaintance (one smiley-face)
• Buddy (two smiley-faces)
• Friend (three smiley-faces)
• Good friend (four smiley-faces)
• Best friend (two love-hearts, two smiley-faces, during connection they may kiss)
• Partner (four love-hearts, during connection they will kiss and may have babies)

Versions 5 and 6 have different levels.

If the Tamagotchi cannot find a partner from another device to have babies with, a matchmaker will come, allowing the Tamagotchi to have a baby with a computer-controlled Tamagotchi character. This applies to versions 1 to 4 and 6 only. Version 5 introduces a Dating Show game in which the user must play to gain a CPU partner.

🔗 Physics 🔗 Physics/relativity

In physics, there is a speculative hypothesis that, if there were a black hole with the same mass, charge and angular momentum as an electron, it would share other properties of the electron. Most notably, Brandon Carter showed in 1968 that the magnetic moment of such an object would match that of an electron. This is interesting because calculations ignoring special relativity and treating the electron as a small rotating sphere of charge give a magnetic moment roughly half the experimental value (see Gyromagnetic ratio).

However, Carter's calculations also show that a would-be black hole with these parameters would be "super-extremal". Thus, unlike a true black hole, this object would display a naked singularity, meaning a singularity in spacetime not hidden behind an event horizon. It would also give rise to closed timelike curves.

Standard quantum electrodynamics (QED), currently the most comprehensive theory of particles, treats the electron as a point particle. There is no evidence that the electron is a black hole (or naked singularity) or not. Furthermore, since the electron is quantum-mechanical in nature, any description purely in terms of general relativity is paradoxical until a better model based on understanding of quantum nature of blackholes and gravitational behaviour of quantum particles is developed by research. Hence, the idea of a black hole electron remains strictly hypothetical.

🔗 Video games 🔗 Computing

The FM Towns (Japanese: エフエムタウンズ, Hepburn: Efu Emu Taunzu) is a Japanese personal computer built by Fujitsu from February 1989 to the summer of 1997. It started as a proprietary PC variant intended for multimedia applications and PC games, but later became more compatible with IBM PC compatibles. In 1993, the FM Towns Marty was released, a game console compatible with existing FM Towns games.

The "FM" part of the name means "Fujitsu Micro" like their earlier products, while the "Towns" part is derived from the code name the system was assigned while in development, "Townes". This refers to Charles Townes, one of the winners of the 1964 Nobel Prize in Physics, following a custom of Fujitsu at the time to code name PC products after Nobel Prize winners. The e in "Townes" was dropped when the system went into production to make it clearer that the term was to be pronounced like the word "towns" rather than the potential "tow-nes".