Random Articles (Page 2)
Have a deep view into what people are curious about.
π Lace Card
A lace card is a punched card with all holes punched (also called a whoopee card, ventilator card, flyswatter card, or IBM doily). They were mainly used as practical jokes to cause disruption in card readers. Card readers tended to jam when a lace card was inserted, as the resulting card had too little structural strength to avoid buckling inside the mechanism. Card punches could also jam trying to produce cards with all holes punched, owing to power-supply problems. When a lace card was fed through the reader, a card knife or card saw (a flat tool used with punched card readers and card punches) was needed to clear the jam.
Discussed on
- "Lace Card" | 2023-06-23 | 23 Upvotes 5 Comments
π Loess Regression
Local regression or local polynomial regression, also known as moving regression, is a generalization of the moving average and polynomial regression. Its most common methods, initially developed for scatterplot smoothing, are LOESS (locally estimated scatterplot smoothing) and LOWESS (locally weighted scatterplot smoothing), both pronounced . They are two strongly related non-parametric regression methods that combine multiple regression models in a k-nearest-neighbor-based meta-model. In some fields, LOESS is known and commonly referred to as SavitzkyβGolay filter (proposed 15 years before LOESS).
LOESS and LOWESS thus build on "classical" methods, such as linear and nonlinear least squares regression. They address situations in which the classical procedures do not perform well or cannot be effectively applied without undue labor. LOESS combines much of the simplicity of linear least squares regression with the flexibility of nonlinear regression. It does this by fitting simple models to localized subsets of the data to build up a function that describes the deterministic part of the variation in the data, point by point. In fact, one of the chief attractions of this method is that the data analyst is not required to specify a global function of any form to fit a model to the data, only to fit segments of the data.
The trade-off for these features is increased computation. Because it is so computationally intensive, LOESS would have been practically impossible to use in the era when least squares regression was being developed. Most other modern methods for process modeling are similar to LOESS in this respect. These methods have been consciously designed to use our current computational ability to the fullest possible advantage to achieve goals not easily achieved by traditional approaches.
A smooth curve through a set of data points obtained with this statistical technique is called a loess curve, particularly when each smoothed value is given by a weighted quadratic least squares regression over the span of values of the y-axis scattergram criterion variable. When each smoothed value is given by a weighted linear least squares regression over the span, this is known as a lowess curve; however, some authorities treat lowess and loess as synonyms.
Discussed on
- "Loess Regression" | 2023-03-24 | 27 Upvotes 5 Comments
π "Do Not Track" HTTP header supported by IE, Opera, FF, Safari but not Chrome
Do Not Track (DNT) was a proposed HTTP header field, designed to allow internet users to opt-out of tracking by websitesβwhich includes the collection of data regarding a user's activity across multiple distinct contexts, and the retention, use, or sharing of data derived from that activity outside the context in which it occurred.
The Do Not Track header was originally proposed in 2009 by researchers Christopher Soghoian, Sid Stamm, and Dan Kaminsky. Efforts to standardize Do Not Track by the W3C in the Tracking Preference Expression (DNT) Working Group did not make it past the Candidate Recommendation stage and ended in September 2018 due to insufficient deployment and support.Mozilla Firefox became the first browser to implement the feature, while Internet Explorer, Apple's Safari, Opera and Google Chrome all later added support.
DNT is not widely adopted by the industry, with companies citing the lack of legal mandates for its use, as well as unclear standards and guidelines for how websites are to interpret the header. Thus, it is not guaranteed that enabling DNT will actually have any effect at all. The W3C disbanded its DNT working group in January 2019, citing insufficient support and adoption. Apple discontinued support for DNT the following month.
Discussed on
- ""Do Not Track" HTTP header supported by IE, Opera, FF, Safari but not Chrome" | 2012-05-20 | 146 Upvotes 100 Comments
π ChindΕgu
ChindΕgu (ηιε ·) is the practice of inventing ingenious everyday gadgets that seem to be ideal solutions to particular problems, but which may cause more problems than they solve. The term is of Japanese origin.
Discussed on
- "ChindΕgu" | 2023-05-14 | 15 Upvotes 4 Comments
π Effective Accelerationism
Effective accelerationism, often abbreviated as "e/acc", is a 21st-century philosophical movement advocating an explicit pro-technology stance. Its proponents believe that artificial intelligence-driven progress is a great social equalizer which should be pushed forward. They see themselves as a counterweight to the cautious view that AI is highly unpredictable and needs to be regulated, often giving their opponents the derogatory labels of "doomers" or "decels" (short for deceleration).
Central to effective accelerationism is the belief that propelling technological progress at any cost is the only ethically justifiable course of action. The movement carries utopian undertones and argues that humans need to develop and build faster to ensure their survival and propagate consciousness throughout the universe.
Although effective accelerationism has been described as a fringe movement, it has gained mainstream visibility. A number of high-profile Silicon Valley figures, including investors Marc Andreessen and Garry Tan, explicitly endorsed the movement by adding "e/acc" to their public social media profiles. Yann LeCun and Andrew Ng are seen as further supporters, as they have argued for less restrictive AI regulation.
Discussed on
- "Effective Accelerationism" | 2024-01-08 | 21 Upvotes 20 Comments
π Motorola 6800
The 6800 ("sixty-eight hundred") is an 8-bit microprocessor designed and first manufactured by Motorola in 1974. The MC6800 microprocessor was part of the M6800 Microcomputer System that also included serial and parallel interface ICs, RAM, ROM and other support chips. A significant design feature was that the M6800 family of ICs required only a single five-volt power supply at a time when most other microprocessors required three voltages. The M6800 Microcomputer System was announced in March 1974 and was in full production by the end of that year.
The 6800 has a 16-bit address bus that can directly access 64Β KB of memory and an 8-bit bi-directional data bus. It has 72 instructions with seven addressing modes for a total of 197 opcodes. The original MC6800 could have a clock frequency of up to 1Β MHz. Later versions had a maximum clock frequency of 2Β MHz.
In addition to the ICs, Motorola also provided a complete assembly language development system. The customer could use the software on a remote timeshare computer or on an in-house minicomputer system. The Motorola EXORciser was a desktop computer built with the M6800 ICs that could be used for prototyping and debugging new designs. An expansive documentation package included datasheets on all ICs, two assembly language programming manuals, and a 700-page application manual that showed how to design a point-of-sale terminal (a computerized cash register) around the 6800.
The 6800 was popular in computer peripherals, test equipment applications and point-of-sale terminals. It also found use in arcade games and pinball machines. The MC6802, introduced in 1977, included 128 bytes of RAM and an internal clock oscillator on chip. The MC6801 and MC6805 included RAM, ROM and I/O on a single chip and were popular in automotive applications. The Motorola 6809 was an updated compatible design.
Discussed on
- "Motorola 6800" | 2022-06-24 | 115 Upvotes 122 Comments
π Outer Space Treaty
The Outer Space Treaty, formally the Treaty on Principles Governing the Activities of States in the Exploration and Use of Outer Space, including the Moon and Other Celestial Bodies, is a treaty that forms the basis of international space law. The treaty was opened for signature in the United States, the United Kingdom, and the Soviet Union on 27 January 1967, and entered into force on 10 October 1967. As of June 2019, 109 countries are parties to the treaty, while another 23 have signed the treaty but have not completed ratification. In addition, Taiwan, which is currently recognized by 14Β UN member states, ratified the treaty prior to the United Nations General Assembly's vote to transfer China's seat to the People's Republic of China (PRC) in 1971.
Among the Outer Space Treaty's main points are that it prohibits the placing of nuclear weapons in space, it limits the use of the Moon and all other celestial bodies to peaceful purposes only, and establishes that space shall be free for exploration and use by all nations, but that no nation may claim sovereignty of outer space or any celestial body. The Outer Space Treaty does not ban military activities within space, military space forces, or the weaponization of space, with the exception of the placement of weapons of mass destruction in space. It is mostly a non-armament treaty and offers insufficient and ambiguous regulations to newer space activities such as lunar and asteroid mining.
Discussed on
- "Outer Space Treaty" | 2016-03-31 | 33 Upvotes 15 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
π R vs. Adams
R v Adams [1996] EWCA Crim 10 and 222, are rulings in the United Kingdom that banned the expression in court of headline (soundbite), standalone Bayesian statistics from the reasoning admissible before a jury in DNA evidence cases, in favour of the calculated average (and maximal) number of matching incidences among the nation's population. The facts involved strong but inconclusive evidence conflicting with the DNA evidence, leading to a retrial.
Discussed on
- "R vs. Adams" | 2022-08-22 | 13 Upvotes 6 Comments
π Karatsuba Algorithm
The Karatsuba algorithm is a fast multiplication algorithm. It was discovered by Anatoly Karatsuba in 1960 and published in 1962. It reduces the multiplication of two n-digit numbers to at most single-digit multiplications in general (and exactly when n is a power of 2). It is therefore faster than the classical algorithm, which requires single-digit products. For example, the Karatsuba algorithm requires 310 = 59,049 single-digit multiplications to multiply two 1024-digit numbers (n = 1024 = 210), whereas the classical algorithm requires (210)2 = 1,048,576 (a speedup of 17.75 times).
The Karatsuba algorithm was the first multiplication algorithm asymptotically faster than the quadratic "grade school" algorithm. The ToomβCook algorithm (1963) is a faster generalization of Karatsuba's method, and the SchΓΆnhageβStrassen algorithm (1971) is even faster, for sufficiently large n.
Discussed on
- "Karatsuba Algorithm" | 2019-10-03 | 170 Upvotes 27 Comments