Random Articles (Page 3)

Have a deep view into what people are curious about.

πŸ”— Chicago Tunnel and Reservoir Plan

πŸ”— Environment πŸ”— Urban studies and planning πŸ”— Chicago πŸ”— Illinois

The Tunnel and Reservoir Plan (abbreviated TARP and more commonly known as the Deep Tunnel Project or the Chicago Deep Tunnel) is a large civil engineering project that aims to reduce flooding in the metropolitan Chicago area, and to reduce the harmful effects of flushing raw sewage into Lake Michigan by diverting storm water and sewage into temporary holding reservoirs. The megaproject is one of the largest civil engineering projects ever undertaken in terms of scope, cost and timeframe. Commissioned in the mid-1970s, the project is managed by the Metropolitan Water Reclamation District of Greater Chicago. Completion of the system is not anticipated until 2029, but substantial portions of the system have already opened and are currently operational. Across 30 years of construction, over $3 billion has been spent on the project.

Discussed on

πŸ”— Queueing Theory

πŸ”— Computing πŸ”— Mathematics πŸ”— Statistics πŸ”— Systems πŸ”— Systems/Operations research

Queueing theory is the mathematical study of waiting lines, or queues. A queueing model is constructed so that queue lengths and waiting time can be predicted. Queueing theory is generally considered a branch of operations research because the results are often used when making business decisions about the resources needed to provide a service.

Queueing theory has its origins in research by Agner Krarup Erlang when he created models to describe the system of Copenhagen Telephone Exchange company, a Danish company. The ideas have since seen applications including telecommunication, traffic engineering, computing and, particularly in industrial engineering, in the design of factories, shops, offices and hospitals, as well as in project management.

Discussed on

πŸ”— Project Cybersyn (1971)

πŸ”— Computing πŸ”— Economics πŸ”— Systems πŸ”— Systems/Cybernetics πŸ”— Chile

Project Cybersyn was a Chilean project from 1971–1973 during the presidency of Salvador Allende aimed at constructing a distributed decision support system to aid in the management of the national economy. The project consisted of four modules: an economic simulator, custom software to check factory performance, an operations room, and a national network of telex machines that were linked to one mainframe computer.

Project Cybersyn was based on viable system model theory approach to organizational design, and featured innovative technology for its time: it included a network of telex machines (Cybernet) in state-run enterprises that would transmit and receive information with the government in Santiago. Information from the field would be fed into statistical modeling software (Cyberstride) that would monitor production indicators, such as raw material supplies or high rates of worker absenteeism, in "almost" real time, alerting the workers in the first case and, in abnormal situations, if those parameters fell outside acceptable ranges by a very large degree, also the central government. The information would also be input into economic simulation software (CHECO, for CHilean ECOnomic simulator) that the government could use to forecast the possible outcome of economic decisions. Finally, a sophisticated operations room (Opsroom) would provide a space where managers could see relevant economic data, formulate feasible responses to emergencies, and transmit advice and directives to enterprises and factories in alarm situations by using the telex network.

The principal architect of the system was British operations research scientist Stafford Beer, and the system embodied his notions of organisational cybernetics in industrial management. One of its main objectives was to devolve decision-making power within industrial enterprises to their workforce in order to develop self-regulation of factories.

Discussed on

πŸ”— Miller Columns

πŸ”— Apple Inc./Macintosh πŸ”— Apple Inc.

Miller columns (also known as cascading lists) are a browsing/visualization technique that can be applied to tree structures. The columns allow multiple levels of the hierarchy to be open at once, and provide a visual representation of the current location. It is closely related to techniques used earlier in the Smalltalk browser, but was independently invented by Mark S. Miller in 1980 at Yale University. The technique was then used at Project Xanadu, Datapoint, and NeXT.

While at Datapoint, Miller generalized the technique to browse directed graphs with labeled nodes and arcs. In all cases, the technique is appropriate for structures with high degree (large fanout). For low-degree structures, outline editors or graph viewers are more effective.

Discussed on

πŸ”— Oriental Carpets in Renaissance Painting

πŸ”— Visual arts πŸ”— Textile Arts

Carpets of Middle-Eastern origin, either from Anatolia, Persia, Armenia, Azerbaijan, the Levant, the Mamluk state of Egypt or Northern Africa, were used as decorative features in Western European paintings from the 14th century onwards. More depictions of Oriental carpets in Renaissance painting survive than actual carpets contemporary with these paintings. Few Middle-Eastern carpets produced before the 17th century remain, though the number of these known has increased in recent decades. Therefore, comparative art-historical research has from its onset in the late 19th century relied on carpets represented in datable European paintings.

Discussed on

πŸ”— Pando (tree)

πŸ”— United States πŸ”— Plants πŸ”— United States/Utah

Pando (Latin for "I spread out"), also known as the trembling giant, is a clonal colony of an individual male quaking aspen (Populus tremuloides) determined to be a single living organism by identical genetic markers and assumed to have one massive underground root system. The plant is located in the Fremont River Ranger District of the Fishlake National Forest at the western edge of the Colorado Plateau in south-central Utah, United States, around 1 mile (1.6Β km) southwest of Fish Lake. Pando occupies 43 hectares (106 acres) and is estimated to weigh collectively 6,000,000 kilograms (6,600 short tons), making it the heaviest known organism. The root system of Pando, at an estimated 80,000 years old, is among the oldest known living organisms.

Pando is currently thought to be dying. Though the exact reasons are not known, it is thought to be a combination of factors including drought, grazing, human development, and fire suppression. The Western Aspen Alliance, a research group at Utah State University’s S.J. & Jessie E. Quinney College of Natural Resources, has been studying the tree in an effort to save it, and the United States Forest Service is currently experimenting with several 5-acre (2Β ha) sections of it in an effort to find a means to save it. Grazing animals have threatened Pando's ability to produce young offsprings to replace trees that are dying. Human development in the area is another threat, these two threats have caused pando trees to shrink in size and decrease over the past 50 years.

A study published in October 2018 concludes that Pando has not been growing for the past 30–40 years. Human interference was named as the primary cause, with the study specifically citing people allowing cattle and deer populations to thrive, their grazing resulting in fewer saplings and dying individual trees.

Discussed on

πŸ”— Jove (Jonathan's Own Version of Emacs)

πŸ”— Computing πŸ”— Project-independent assessment

JOVE (Jonathan's Own Version of Emacs) is an open-source, Emacs-like text editor, primarily intended for Unix-like operating systems. It also supports MS-DOS and Microsoft Windows. JOVE was inspired by Gosling Emacs but is much smaller and simpler, lacking Mocklisp. It was originally created in 1983 by Jonathan Payne while at Lincoln-Sudbury Regional High School in Massachusetts, United States on a PDP-11 minicomputer. JOVE was distributed with several releases of BSD Unix, including 2.9BSD, 4.3BSD-Reno and 4.4BSD-Lite2.

As of 2022, the latest development release of JOVE is version 4.17.4.4; the stable version is 4.16. Unlike GNU Emacs, JOVE does not support UTF-8.

Discussed on

πŸ”— Ulam Spiral

πŸ”— Mathematics

The Ulam spiral or prime spiral is a graphical depiction of the set of prime numbers, devised by mathematician StanisΕ‚aw Ulam in 1963 and popularized in Martin Gardner's Mathematical Games column in Scientific American a short time later. It is constructed by writing the positive integers in a square spiral and specially marking the prime numbers.

Ulam and Gardner emphasized the striking appearance in the spiral of prominent diagonal, horizontal, and vertical lines containing large numbers of primes. Both Ulam and Gardner noted that the existence of such prominent lines is not unexpected, as lines in the spiral correspond to quadratic polynomials, and certain such polynomials, such as Euler's prime-generating polynomial x2β€‰βˆ’β€‰x + 41, are believed to produce a high density of prime numbers. Nevertheless, the Ulam spiral is connected with major unsolved problems in number theory such as Landau's problems. In particular, no quadratic polynomial has ever been proved to generate infinitely many primes, much less to have a high asymptotic density of them, although there is a well-supported conjecture as to what that asymptotic density should be.

In 1932, more than thirty years prior to Ulam's discovery, the herpetologist Laurence Klauber constructed a triangular, non-spiral array containing vertical and diagonal lines exhibiting a similar concentration of prime numbers. Like Ulam, Klauber noted the connection with prime-generating polynomials, such as Euler's.

Discussed on

πŸ”— Non-transitive dice

πŸ”— Statistics

A set of dice is nontransitive if it contains three dice, A, B, and C, with the property that A rolls higher than B more than half the time, and B rolls higher than C more than half the time, but it is not true that A rolls higher than C more than half the time. In other words, a set of dice is nontransitive if the binary relation – X rolls a higher number than Y more than half the time – on its elements is not transitive.

It is possible to find sets of dice with the even stronger property that, for each die in the set, there is another die that rolls a higher number than it more than half the time. Using such a set of dice, one can invent games which are biased in ways that people unused to nontransitive dice might not expect (see Example).

Discussed on

πŸ”— Pravetz Computers

πŸ”— Computing πŸ”— Bulgaria

Pravetz (ΠŸΡ€Π°Π²Π΅Ρ† in the original Cyrillic, series 8 and series 16) were Bulgarian computers, manufactured mainly in the town of Pravetz. Some components and software were produced in Stara Zagora, Plovdiv, and other Bulgarian cities.

Discussed on