Have a deep view into what people are curious about.

🔗 Medicine 🔗 Medicine/Neurology 🔗 Epilepsy

Musicogenic seizure, also known as music-induced seizure, is a rare type of seizure, with an estimated prevalence of 1 in 10,000,000 individuals, that arises from disorganized or abnormal brain electrical activity when a person hears or is exposed to a specific type of sound or musical stimuli. There are challenges when diagnosing a music-induced seizure due to the broad scope of triggers, and time delay between a stimulus and seizure. In addition, the causes of musicogenic seizures are not well-established as solely limited cases and research have been discovered and conducted respectively. Nevertheless, the current understanding of the mechanism behind musicogenic seizure is that music triggers the part of the brain that is responsible for evoking an emotion associated with that music. Dysfunction in this system leads to an abnormal release of dopamine, eventually inducing seizure.

Currently, there are diverse intervention strategies that patients can choose from depending on their situations. They can have surgery to remove the region of the brain that generates a seizure. Behavioral therapy is also available; patients are trained to gain emotional control to reduce the frequency of seizure. Medications like carbamazepine and phenytoin (medication for general seizure) also suggest effectiveness to mitigate music-induced seizures.

🔗 Cryptography 🔗 Cryptography/Computer science

Bacon's cipher or the Baconian cipher is a method of steganographic message encoding devised by Francis Bacon in 1605. A message is concealed in the presentation of text, rather than its content. Bacon cipher is categorized as both a substitution cipher (in plain code) and a concealment cipher (using the two typefaces).

🔗 Mathematics 🔗 Physics

Shor's algorithm is a polynomial-time quantum computer algorithm for integer factorization. Informally, it solves the following problem: Given an integer ${\displaystyle N}$, find its prime factors. It was invented in 1994 by the American mathematician Peter Shor.

On a quantum computer, to factor an integer ${\displaystyle N}$, Shor's algorithm runs in polynomial time (the time taken is polynomial in ${\displaystyle \log N}$, the size of the integer given as input). Specifically, it takes quantum gates of order ${\displaystyle O\!\left((\log N)^{2}(\log \log N)(\log \log \log N)\right)}$ using fast multiplication, thus demonstrating that the integer-factorization problem can be efficiently solved on a quantum computer and is consequently in the complexity class BQP. This is almost exponentially faster than the most efficient known classical factoring algorithm, the general number field sieve, which works in sub-exponential time — ${\displaystyle O\!\left(e^{1.9(\log N)^{1/3}(\log \log N)^{2/3}}\right)}$. The efficiency of Shor's algorithm is due to the efficiency of the quantum Fourier transform, and modular exponentiation by repeated squarings.

If a quantum computer with a sufficient number of qubits could operate without succumbing to quantum noise and other quantum-decoherence phenomena, then Shor's algorithm could be used to break public-key cryptography schemes, such as the widely used RSA scheme. RSA is based on the assumption that factoring large integers is computationally intractable. As far as is known, this assumption is valid for classical (non-quantum) computers; no classical algorithm is known that can factor integers in polynomial time. However, Shor's algorithm shows that factoring integers is efficient on an ideal quantum computer, so it may be feasible to defeat RSA by constructing a large quantum computer. It was also a powerful motivator for the design and construction of quantum computers, and for the study of new quantum-computer algorithms. It has also facilitated research on new cryptosystems that are secure from quantum computers, collectively called post-quantum cryptography.

In 2001, Shor's algorithm was demonstrated by a group at IBM, who factored ${\displaystyle 15}$ into ${\displaystyle 3\times 5}$, using an NMR implementation of a quantum computer with ${\displaystyle 7}$ qubits. After IBM's implementation, two independent groups implemented Shor's algorithm using photonic qubits, emphasizing that multi-qubit entanglement was observed when running the Shor's algorithm circuits. In 2012, the factorization of ${\displaystyle 15}$ was performed with solid-state qubits. Also, in 2012, the factorization of ${\displaystyle 21}$ was achieved, setting the record for the largest integer factored with Shor's algorithm.

🔗 Novels 🔗 Children's literature 🔗 Novels/Science fiction 🔗 Novels/Short story

"The Toynbee Convector" is a science fiction short story by American writer Ray Bradbury. First published in Playboy magazine in 1984, the story was subsequently featured in a 1988 short story collection also titled The Toynbee Convector.

🔗 Biography 🔗 Biography/science and academia 🔗 Israel

Abraham Lempel (Hebrew: אברהם למפל, 10 February 1936 – 4 February 2023) was an Israeli computer scientist and one of the fathers of the LZ family of lossless data compression algorithms.

🔗 Computer science

In computer science, higher-order abstract syntax (abbreviated HOAS) is a technique for the representation of abstract syntax trees for languages with variable binders.

🔗 Philosophy 🔗 Philosophy/Logic 🔗 Philosophy/Contemporary philosophy 🔗 Philosophy/Philosophy of mind 🔗 Philosophy/Analytic philosophy

The Chinese room argument holds that a digital computer executing a program cannot be shown to have a "mind", "understanding" or "consciousness", regardless of how intelligently or human-like the program may make the computer behave. The argument was first presented by philosopher John Searle in his paper, "Minds, Brains, and Programs", published in Behavioral and Brain Sciences in 1980. It has been widely discussed in the years since. The centerpiece of the argument is a thought experiment known as the Chinese room.

The argument is directed against the philosophical positions of functionalism and computationalism, which hold that the mind may be viewed as an information-processing system operating on formal symbols. Specifically, the argument is intended to refute a position Searle calls strong AI: "The appropriately programmed computer with the right inputs and outputs would thereby have a mind in exactly the same sense human beings have minds."

Although it was originally presented in reaction to the statements of artificial intelligence (AI) researchers, it is not an argument against the behavioural goals of AI research, because it does not limit the amount of intelligence a machine can display. The argument applies only to digital computers running programs and does not apply to machines in general.

🔗 Ancient Near East 🔗 Ancient Egypt 🔗 Assyria 🔗 Iraq 🔗 Writing systems 🔗 Archaeology 🔗 Phoenicia

The Amarna letters (; sometimes referred to as the Amarna correspondence or Amarna tablets, and cited with the abbreviation EA, for "El Amarna") are an archive, written on clay tablets, primarily consisting of diplomatic correspondence between the Egyptian administration and its representatives in Canaan and Amurru, or neighboring kingdom leaders, during the New Kingdom, spanning a period of no more than thirty years between c. 1360–1332 BC (see here for dates). The letters were found in Upper Egypt at el-Amarna, the modern name for the ancient Egyptian capital of Akhetaten, founded by pharaoh Akhenaten (1350s–1330s BC) during the Eighteenth Dynasty of Egypt. The Amarna letters are unusual in Egyptological research, because they are written not in the language of ancient Egypt, but in cuneiform, the writing system of ancient Mesopotamia. Most are in a variety of Akkadian sometimes characterised as a mixed language, Canaanite-Akkadian; one especially long letter—abbreviated EA 24—was written in a late dialect of Hurrian, and is the longest contiguous text known to survive in that language.

The known tablets total 382, of which 358 have been published by the Norwegian Assyriologist Jørgen Alexander Knudtzon in his work, Die El-Amarna-Tafeln, which came out in two volumes (1907 and 1915) and remains the standard edition to this day. The texts of the remaining 24 complete or fragmentary tablets excavated since Knudtzon have also been made available.

The Amarna letters are of great significance for biblical studies as well as Semitic linguistics because they shed light on the culture and language of the Canaanite peoples in this time period. Though most are written in Akkadian, the Akkadian of the letters is heavily colored by the mother tongue of their writers, who probably spoke an early form of Proto-Canaanite, the language(s) which would later evolve into the daughter languages of Hebrew and Phoenician. These "Canaanisms" provide valuable insights into the proto-stage of those languages several centuries prior to their first actual manifestation.

🔗 Statistics

In mathematics, Buffon's needle problem is a question first posed in the 18th century by Georges-Louis Leclerc, Comte de Buffon:

Suppose we have a floor made of parallel strips of wood, each the same width, and we drop a needle onto the floor. What is the probability that the needle will lie across a line between two strips?

Buffon's needle was the earliest problem in geometric probability to be solved; it can be solved using integral geometry. The solution for the sought probability p, in the case where the needle length l is not greater than the width t of the strips, is

${\displaystyle p={\frac {2}{\pi }}{\frac {l}{t}}.}$

This can be used to design a Monte Carlo method for approximating the number π, although that was not the original motivation for de Buffon's question.

🔗 Computing 🔗 Software 🔗 Software/Computing

Mainline DHT is the name given to the Kademlia-based Distributed Hash Table (DHT) used by BitTorrent clients to find peers via the BitTorrent protocol. The idea of utilizing a DHT for distributed tracking was first implemented in Azureus 2.3.0.0 (now known as Vuze) in May 2005, from which it gained significant popularity. Unrelated but similarly timed BitTorrent, Inc. released their own similar DHT into their client, called Mainline DHT and thus popularized the use of distributed tracking in the BitTorrent Protocol. Measurement shows by 2013 users of Mainline DHT is from 10 million to 25 million, with a daily churn of at least 10 million.