Random Articles (Page 314)
Have a deep view into what people are curious about.
π Nasal Cycle
The nasal cycle is the unconscious alternating partial congestion and decongestion of the nasal cavities in humans and other animals. This results in greater airflow through one nostril with periodic alternation between the nostrils. It is a physiological congestion of the nasal conchae, also called the nasal turbinates (curled bony projections within the nasal cavities), due to selective activation of one half of the autonomic nervous system by the hypothalamus. It should not be confused with pathological nasal congestion.
Discussed on
- "Nasal Cycle" | 2022-11-12 | 25 Upvotes 8 Comments
π Secure Remote Password protocol
The Secure Remote Password protocol (SRP) is an augmented password-authenticated key agreement (PAKE) protocol, specifically designed to work around existing patents.
Like all PAKE protocols, an eavesdropper or man in the middle cannot obtain enough information to be able to brute force guess a password without further interactions with the parties for each guess. Furthermore, being an augmented PAKE protocol, the server does not store password-equivalent data. This means that an attacker who steals the server data cannot masquerade as the client unless they first perform a brute force search for the password.
In layman's terms, during SRP (or any other PAKE protocol) authentication, one party (the "client" or "user") demonstrates to another party (the "server") that they know the password, without sending the password itself nor any other information from which the password can be derived. The password never leaves the client and is unknown to the server.
Furthermore, the server also needs to know about the password (but not the password itself) in order to instigate the secure connection. This means that the server also authenticates itself to the client, without reliance on the user parsing complex URLs. This prevents Phishing.
Discussed on
- "Secure Remote Password protocol" | 2017-04-11 | 17 Upvotes 19 Comments
π Hit Man: A Technical Manual for Independent Contractors
Hit Man: A Technical Manual for Independent Contractors is a book written under the pseudonym Rex Feral (real name Nancy Crampton-Brophy) and published by Paladin Press in 1983. Paladin Press owner Peder Lund claimed, in an interview with 60 Minutes, that the book started life as a detailed crime novel written by a Florida housewife, and that the format was later changed to appeal to Paladin's reader base accustomed to the publisher's non-fiction books on military, survivalist, weapons and similar topics. The book portrays itself as a how-to manual on starting a career as a hit man, fulfilling contracts. However, after a number of lawsuits claiming that the book was used as a handbook in several murders, the publication of the book was stopped. It marked "the first time in American publishing history that a publisher has been held liable for a crime committed by a reader."
Discussed on
- "Hit Man: A Technical Manual for Independent Contractors" | 2023-04-10 | 155 Upvotes 65 Comments
π Chicken Hypnotism
A chicken can be hypnotized, or put into a trance, by holding its head down against the ground, and drawing a line along the ground with a stick or a finger, starting at the beak and extending straight outward in front of the chicken. If the chicken is hypnotized in this manner, it will continue to stare at the line, remaining immobile for as long as 30 minutes. Other methods of inducing this state are also known. Ethologists refer to this state as 'tonic immobility' i.e. a natural state of semi-paralysis that some animals enter when presented with a threat, which is probably a defensive mechanism intended to feign death, albeit rather poorly.
The first known written reference for this method came in 1646, in Mirabele Experimentum de Imaginatione Gallinae by Athanasius Kircher in Rome.
Discussed on
- "Chicken Hypnotism" | 2023-11-30 | 54 Upvotes 35 Comments
- "Chicken Hypnotism" | 2020-12-21 | 11 Upvotes 1 Comments
- "Chicken Hypnotism" | 2019-08-25 | 153 Upvotes 47 Comments
π Circle Packing
In geometry, circle packing is the study of the arrangement of circles (of equal or varying sizes) on a given surface such that no overlapping occurs and so that no circle can be enlarged without creating an overlap. The associated packing density, Ξ·, of an arrangement is the proportion of the surface covered by the circles. Generalisations can be made to higher dimensions β this is called sphere packing, which usually deals only with identical spheres.
While the circle has a relatively low maximum packing density of 0.9069 on the Euclidean plane, it does not have the lowest possible. The "worst" shape to pack onto a plane is not known, but the smoothed octagon has a packing density of about 0.902414, which is the lowest maximum packing density known of any centrally-symmetric convex shape. Packing densities of concave shapes such as star polygons can be arbitrarily small.
The branch of mathematics generally known as "circle packing" is concerned with the geometry and combinatorics of packings of arbitrarily-sized circles: these give rise to discrete analogs of conformal mapping, Riemann surfaces and the like.
Discussed on
- "Circle Packing" | 2020-05-30 | 98 Upvotes 30 Comments
π Russian Cross
The Russian Cross is the name of a demographic trend that occurred in Russia and many other countries of the former Warsaw Pact. In Russia, starting in 1988, birth rates among native Russians (as well as most other ethnic groups of the European part of the former Soviet Union) were declining, while from 1991 the death rates started climbing.
In 1992, the number of deaths exceeded the number of births, and continued to do so to a greater or lesser degree until 2013. When this trend is plotted on a line graph starting from the mid-1980s, the lines cross at 1992, hence the name.
Discussed on
- "Russian Cross" | 2021-08-02 | 11 Upvotes 1 Comments
π Bitmessage: a decentralized, encrypted, trustless communications protocol
Bitmessage is a decentralized, encrypted, peer-to-peer, trustless communications protocol that can be used by one person to send encrypted messages to another person, or to multiple subscribers.
In June 2013, the software experienced a surge of new adoptions after news reports of email surveillance by the US National Security Agency.
Bitmessage was conceived by software developer Jonathan Warren, who based its design on the decentralized digital currency, bitcoin. The software was released in November 2012 under the MIT license.
Bitmessage gained a reputation for being out of reach of warrantless wiretapping conducted by the National Security Agency (NSA), due to the decentralized nature of the protocol, and its encryption being difficult to crack. As a result, downloads of the Bitmessage program increased fivefold during June 2013, after news broke of classified email surveillance activities conducted by the NSA.
Bitmessage has also been mentioned as an experimental alternative to email by Popular Science and CNET.
Some ransomware programs instruct affected users to use Bitmessage to communicate with the attackers.
Discussed on
- "Bitmessage: a decentralized, encrypted, trustless communications protocol" | 2016-10-15 | 70 Upvotes 26 Comments
π Boids
Boids is an artificial life program, developed by Craig Reynolds in 1986, which simulates the flocking behaviour of birds. His paper on this topic was published in 1987 in the proceedings of the ACM SIGGRAPH conference. The name "boid" corresponds to a shortened version of "bird-oid object", which refers to a bird-like object. Incidentally, "boid" is also a New York Metropolitan dialect pronunciation for "bird".
As with most artificial life simulations, Boids is an example of emergent behavior; that is, the complexity of Boids arises from the interaction of individual agents (the boids, in this case) adhering to a set of simple rules. The rules applied in the simplest Boids world are as follows:
- separation: steer to avoid crowding local flockmates
- alignment: steer towards the average heading of local flockmates
- cohesion: steer to move towards the average position (center of mass) of local flockmates
More complex rules can be added, such as obstacle avoidance and goal seeking.
The basic model has been extended in several different ways since Reynolds proposed it. For instance, Delgado-Mata etΒ al. extended the basic model to incorporate the effects of fear. Olfaction was used to transmit emotion between animals, through pheromones modelled as particles in a free expansion gas. Hartman and Benes introduced a complementary force to the alignment that they call the change of leadership. This steer defines the chance of the boid to become a leader and try to escape.
The movement of Boids can be characterized as either chaotic (splitting groups and wild behaviour) or orderly. Unexpected behaviours, such as splitting flocks and reuniting after avoiding obstacles, can be considered emergent.
The boids framework is often used in computer graphics, providing realistic-looking representations of flocks of birds and other creatures, such as schools of fish or herds of animals. It was for instance used in the 1998 video game Half-Life for the flying bird-like creatures seen at the end of the game on Xen, named "boid" in the game files.
The Boids model can be used for direct control and stabilization of teams of simple Unmanned Ground Vehicles (UGV) or Micro Aerial Vehicles (MAV) in swarm robotics. For stabilization of heterogeneous UAV-UGV teams, the model was adapted for using onboard relative localization by Saska etΒ al.
At the time of proposal, Reynolds' approach represented a giant step forward compared to the traditional techniques used in computer animation for motion pictures. The first animation created with the model was Stanley and Stella in: Breaking the Ice (1987), followed by a feature film debut in Tim Burton's film Batman Returns (1992) with computer generated bat swarms and armies of penguins marching through the streets of Gotham City.
The boids model has been used for other interesting applications. It has been applied to automatically program Internet multi-channel radio stations. It has also been used for visualizing information and for optimization tasks.
π Cox-Zucker_machine
The CoxβZucker machine is an algorithm created by David A. Cox and Steven Zucker. This algorithm determines if a given set of sections provides a basis (up to torsion) for the MordellβWeil group of an elliptic surface E β S where S is isomorphic to the projective line.
The algorithm was first published in the 1979 paper "Intersection numbers of sections of elliptic surfaces" by Cox and Zucker, and it was later named the "CoxβZucker machine" by Charles Schwartz in 1984. The name is a homophone for an obscenity, and this was a deliberate move by Cox and Zucker, who conceived of the idea of coauthoring a paper as graduate students at Princeton for the express purpose of enabling this joke, a joke they followed through on while professors at Rutgers five years later. As Cox explained in a memorial tribute to Zucker in Notices of the American Mathematical Society in 2021: "A few weeks after we met, we realized that we had to write a joint paper because the combination of our last names, in the usual alphabetical order, is remarkably obscene."
Discussed on
- "CoxβZucker Machine" | 2021-08-22 | 15 Upvotes 1 Comments
- "Cox-Zucker_machine" | 2021-08-20 | 17 Upvotes 2 Comments
π Merkle Tree
In cryptography and computer science, a hash tree or Merkle tree is a tree in which every leaf node is labelled with the cryptographic hash of a data block, and every non-leaf node is labelled with the cryptographic hash of the labels of its child nodes. Hash trees allow efficient and secure verification of the contents of large data structures. Hash trees are a generalization of hash lists and hash chains.
Demonstrating that a leaf node is a part of a given binary hash tree requires computing a number of hashes proportional to the logarithm of the number of leaf nodes of the tree; this contrasts with hash lists, where the number is proportional to the number of leaf nodes itself.
The concept of hash trees is named after Ralph Merkle, who patented it in 1979.
Discussed on
- "Merkle Tree" | 2021-06-06 | 53 Upvotes 10 Comments