New Articles (Page 110)

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

πŸ”— Wabi-sabi

πŸ”— Philosophy πŸ”— Philosophy/Aesthetics πŸ”— Japan πŸ”— Japan/Culture

In traditional Japanese aesthetics, wabi-sabi (δΎ˜ε―‚) is a world view centered on the acceptance of transience and imperfection. The aesthetic is sometimes described as one of beauty that is "imperfect, impermanent, and incomplete". It is a concept derived from the Buddhist teaching of the three marks of existence (三法印, sanbōin), specifically impermanence (η„‘εΈΈ, mujō), suffering (苦, ku) and emptiness or absence of self-nature (η©Ί, kΕ«).

Characteristics of the wabi-sabi aesthetic include asymmetry, roughness, simplicity, economy, austerity, modesty, intimacy, and appreciation of the ingenuous integrity of natural objects and processes.

Discussed on

πŸ”— Edgelord

πŸ”— Internet culture πŸ”— Sociology

An edgelord is someone on the Internet who tries to impress or shock by posting edgy opinions such as nihilism or extremist views.

The term is a portmanteau derived from "edgy" and "shitlord" – a person who "basks in the bitterness and misery of others".

Merriam-Webster gave the following example:

We decided to watch It's A Wonderful Life and my dad said, β€œEvery year I wait for Jimmy Stewart to jump off that bridge but he never does it” - merry Xmas from the original edgelord.

Edgelords were characterised by author Rachel Monroe in her account of criminal behaviour, Savage Appetites:

...internet cynics lumped the online Nazis together with the serial killer fetishists and the dumbest goths and dismissed them all as edgelords: kids who tried to be scary online. I thought of most of these edgelords as basement-dwellers, pale faces lit by the glow of their computer screen, puffing themselves up with nihilism. An edgelord was a scrawny guy with a LARP-y vibe, possibly wearing a cloak, dreaming of omnipotence. Or a girl with excessive eyeliner and lots of Tumblr posts about self-harm. The disturbing content posted by edgelords was undermined by its predictability...

It is frequently associated with the forum site 4chan.

Discussed on

πŸ”— Plato: Allegory of the Cave

πŸ”— Philosophy πŸ”— Greece πŸ”— Cognitive science πŸ”— Philosophy/Ancient philosophy πŸ”— Alternative Views πŸ”— Philosophy/Epistemology

The Allegory of the Cave, or Plato's Cave, is an allegory presented by the Greek philosopher Plato in his work Republic (514a–520a) to compare "the effect of education (παιδΡία) and the lack of it on our nature". It is written as a dialogue between Plato's brother Glaucon and his mentor Socrates, narrated by the latter. The allegory is presented after the analogy of the sun (508b–509c) and the analogy of the divided line (509d–511e).

In the allegory "The Cave", Plato describes a group of people who have lived chained to the wall of a cave all their lives, facing a blank wall. The people watch shadows projected on the wall from objects passing in front of a fire behind them and give names to these shadows. The shadows are the prisoners' reality, but are not accurate representations of the real world. The shadows represent the fragment of reality that we can normally perceive through our senses, while the objects under the sun represent the true forms of objects that we can only perceive through reason. Three higher levels exist: the natural sciences; mathematics, geometry, and deductive logic; and the theory of forms.

Socrates explains how the philosopher is like a prisoner who is freed from the cave and comes to understand that the shadows on the wall are actually not the direct source of the images seen. A philosopher aims to understand and perceive the higher levels of reality. However, the other inmates of the cave do not even desire to leave their prison, for they know no better life.

Socrates remarks that this allegory can be paired with previous writings, namely the analogy of the sun and the analogy of the divided line.

πŸ”— Proofs from the Book

πŸ”— Mathematics πŸ”— Books

Proofs from THE BOOK is a book of mathematical proofs by Martin Aigner and GΓΌnter M. Ziegler. The book is dedicated to the mathematician Paul ErdΕ‘s, who often referred to "The Book" in which God keeps the most elegant proof of each mathematical theorem. During a lecture in 1985, ErdΕ‘s said, "You don't have to believe in God, but you should believe in The Book."

Discussed on

πŸ”— Microsoft Comic Chat

πŸ”— Internet πŸ”— Computing πŸ”— Microsoft Windows πŸ”— Microsoft Windows/Computing πŸ”— Computing/Software πŸ”— Microsoft πŸ”— IRC

Microsoft Comic Chat (later Microsoft Chat, but not to be confused with Windows Chat, or WinChat) is a graphical IRC client created by Microsoft, first released with Internet Explorer 3.0 in 1996. Comic Chat was developed by Microsoft Researcher David Kurlander, with Microsoft Research's Virtual Worlds Group and later a group he managed in Microsoft's Internet Division.

Discussed on

πŸ”— Wiio’s laws: Communication usually fails, except by accident

πŸ”— Sociology πŸ”— Finland

Wiio's laws are humoristically formulated observations about how humans communicate.

Wiio's laws are usually summarized with "Human communications usually fail except by accident", which is the main observation made by Professor Osmo Antero Wiio in 1978.

Discussed on

πŸ”— Vacuum airship

πŸ”— Aviation πŸ”— Physics πŸ”— Aviation/aircraft

A vacuum airship, also known as a vacuum balloon, is a hypothetical airship that is evacuated rather than filled with a lighter-than-air gas such as hydrogen or helium. First proposed by Italian Jesuit priest Francesco Lana de Terzi in 1670, the vacuum balloon would be the ultimate expression of lifting power per volume displaced.

Discussed on

πŸ”— MSX-DOS

πŸ”— Computing πŸ”— Computing/Software πŸ”— Microsoft

MSX-DOS is a discontinued disk operating system developed by Microsoft for the 8-bit home computer standard MSX, and is a cross between MS-DOS v1.25 and CP/M-80Β v2.2.

Discussed on

πŸ”— Ant Colony Optimization Algorithms

πŸ”— Computer science πŸ”— Systems πŸ”— Systems/Scientific modeling

In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. Artificial Ants stand for multi-agent methods inspired by the behavior of real ants. The pheromone-based communication of biological ants is often the predominant paradigm used. Combinations of Artificial Ants and local search algorithms have become a method of choice for numerous optimization tasks involving some sort of graph, e.g., vehicle routing and internet routing. The burgeoning activity in this field has led to conferences dedicated solely to Artificial Ants, and to numerous commercial applications by specialized companies such as AntOptima.

As an example, Ant colony optimization is a class of optimization algorithms modeled on the actions of an ant colony. Artificial 'ants' (e.g. simulation agents) locate optimal solutions by moving through a parameter space representing all possible solutions. Real ants lay down pheromones directing each other to resources while exploring their environment. The simulated 'ants' similarly record their positions and the quality of their solutions, so that in later simulation iterations more ants locate better solutions. One variation on this approach is the bees algorithm, which is more analogous to the foraging patterns of the honey bee, another social insect.

This algorithm is a member of the ant colony algorithms family, in swarm intelligence methods, and it constitutes some metaheuristic optimizations. Initially proposed by Marco Dorigo in 1992 in his PhD thesis, the first algorithm was aiming to search for an optimal path in a graph, based on the behavior of ants seeking a path between their colony and a source of food. The original idea has since diversified to solve a wider class of numerical problems, and as a result, several problems have emerged, drawing on various aspects of the behavior of ants. From a broader perspective, ACO performs a model-based search and shares some similarities with estimation of distribution algorithms.

Discussed on