You are looking at all articles with the topic "Computing". We found 481 matches.

Hint: To view all topics, click here. Too see the most popular topics, click here instead.

🔗 Computing

In computing, the Two Generals' Problem is a thought experiment meant to illustrate the pitfalls and design challenges of attempting to coordinate an action by communicating over an unreliable link. In the experiment, two generals are only able to communicate with one another by sending a messenger through enemy territory. The experiment asks how they might reach an agreement on the time to launch an attack, while knowing that any messenger they send could be captured.

It is related to the more general Byzantine Generals Problem and appears often in introductory classes about computer networking (particularly with regard to the Transmission Control Protocol, where it shows that TCP can't guarantee state consistency between endpoints and why this is the case), though it applies to any type of two-party communication where failures of communication are possible. A key concept in epistemic logic, this problem highlights the importance of common knowledge. Some authors also refer to this as the Two Generals' Paradox, the Two Armies Problem, or the Coordinated Attack Problem. The Two Generals' Problem was the first computer communication problem to be proved to be unsolvable. An important consequence of this proof is that generalizations like the Byzantine Generals problem are also unsolvable in the face of arbitrary communication failures, thus providing a base of realistic expectations for any distributed consistency protocols.

🔗 Computing 🔗 Africa 🔗 Ancient Egypt 🔗 Novels 🔗 Novels/Science fiction 🔗 Science Fiction 🔗 Women writers 🔗 Egypt

The Mummy! A Tale of the Twenty-Second Century is an 1827 three-volume novel written by Jane Webb (later Jane C. Loudon). It concerns the Egyptian mummy of Cheops, who is brought back to life in the year 2126. The novel describes a future filled with advanced technology, and was the first English-language story to feature a reanimated mummy.

After her father's death, making her an orphan at the age of 17, Webb found that:

on the winding up of his affairs that it would be necessary to do something for my support. I had written a strange, wild novel, called the Mummy, in which I had laid the scene in the twenty-second century, and attempted to predict the state of improvement to which this country might possibly arrive.

She may have drawn inspiration from the general fashion for anything pharaonic, inspired by the French researches during the Napoleonic invasion of Egypt; the 1821 public unwrappings of Egyptian mummies in a theatre near Piccadilly, which she may have attended as a girl; and, very likely, the 1818 novel by Mary Shelley, Frankenstein; or, The Modern Prometheus. As Shelley had written of Frankenstein's creation, "A mummy again endued with animation could not be so hideous as that wretch," which may have triggered her later concept. In any case, at many points she deals in greater clarity with elements from the earlier book such as the loathing for the much-desired object and the immediate arrest for crime and attempt to lie one's way out of it. However, unlike the Frankenstein monster, the hideous revived Cheops is not shuffling around dealing out horror and death, but giving canny advice on politics and life to those who befriend him. In some ways The Mummy! may be seen as her reaction to themes in Frankenstein: her mummy specifically says he is allowed life only by divine favour, rather than being indisputably vivified only by mortal science, and so on, as Hopkins' 2003 essay covers in detail.

Unlike many early science fiction works (Shelley's The Last Man, and The Reign of King George VI, 1900–1925, written anonymously in 1763), Loudon did not portray the future as her own day with only political changes. She filled her world with foreseeable changes in technology, society, and even fashion. The hero, Edric Montague, lived in a peaceful and Catholic England under the rule of Queen Claudia. Her court ladies wear trousers and hair ornaments of controlled flame. Surgeons and lawyers may be steam-powered automatons. Air travel, by balloon, is commonplace. A kind of Internet is predicted in it. Besides trying to account for the revivification of the mummy in scientific terms—galvanic shock rather than incantations—"she embodied ideas of scientific progress and discovery, that now read like prophecies" to those later in the 19th century. Many of the incidents in the book can be seen as satirical or humorous. Her social attitudes have resulted in this book being ranked among feminist novels.

The Mummy!: Or a Tale of the Twenty-Second Century was published anonymously in 1827 by Henry Colburn in three volumes, as was usual in that day so that each small volume could be easily carried around. It drew many favourable reviews, including one in 1829 in The Gardener's Magazine on the inventions proposed in it. In 1830, the 46-year-old reviewer, John Claudius Loudon, sought out the 22-year-old Webb, and they married the next year.

🔗 Computing 🔗 Computing/Software

This article compares variety of different X window managers. For an introduction to the topic, see X Window System.

🔗 Computing 🔗 Computing/Computer hardware

Rekursiv was a computer processor designed by David M. Harland in the mid-1980s for Linn Smart Computing in Glasgow, Scotland. It was one of the few computer architectures intended to implement object-oriented concepts directly in hardware, a form of high-level language computer architecture. The Rekursiv operated directly on objects rather than bits, nibbles, bytes and words. Virtual memory was used as a persistent object store and unusually, the processor instruction set supported recursion (hence the name).

The project originated in an initiative within the hi-fi manufacturer Linn Products to improve its manufacturing automation systems, which at the time ran on a DEC VAX minicomputer. This resulted in the design of Lingo, an object-oriented programming language derived from Smalltalk and ALGOL. Due to the poor performance of Lingo on the VAX, a subsidiary company, Linn Smart Computing Ltd., was formed to develop a new processor to efficiently run Lingo.

The Rekursiv processor consisted of four gate-array chips named Numerik (32-bit ALU), Logik (instruction sequencer), Objekt (object-oriented memory management unit) and Klock (processor clock and support logic). A small number of prototype VMEbus boards, called Hades, comprising these four chips plus 80 MB of RAM were produced. These were intended for installation in a host system such as a Sun-3 workstation.

Although the Rekursiv was never fully developed and was not a commercial success, several Hades boards were used in academic research projects in the UK. The last known copy of a Rekursiv computer ended up at the bottom of the Forth and Clyde canal in Glasgow.

🔗 Computing 🔗 Computing/Computer hardware

The Pentium FDIV bug is a hardware bug affecting the floating-point unit (FPU) of the early Intel Pentium processors. Because of the bug, the processor would return incorrect binary floating point results when dividing certain pairs of high-precision numbers. The bug was discovered in 1994 by Thomas R. Nicely, a professor of mathematics at Lynchburg College. Missing values in a lookup table used by the FPU's floating-point division algorithm led to calculations acquiring small errors. While these errors would in most use-cases only occur rarely and result in small deviations from the correct output values, in certain circumstances the errors can occur frequently and lead to more significant deviations.

The severity of the FDIV bug is debated. Though rarely encountered by most users (Byte magazine estimated that 1 in 9 billion floating point divides with random parameters would produce inaccurate results), both the flaw and Intel's initial handling of the matter were heavily criticized by the tech community.

In December 1994, Intel recalled the defective processors in what was the first full recall of a computer chip. In its 1994 annual report, Intel said it incurred "a $475 million pre-tax charge ... to recover replacement and write-off of these microprocessors."

🔗 Computing 🔗 Computing/Software 🔗 Computing/Computer science

Flashsort is a distribution sorting algorithm showing linear computational complexity ${\displaystyle O(n)}$ for uniformly distributed data sets and relatively little additional memory requirement. The original work was published in 1998 by Karl-Dietrich Neubert.

🔗 Computing 🔗 Mathematics

A nomogram (from Greek νόμος nomos, "law" and γραμμή grammē, "line"), also called a nomograph, alignment chart, or abaque, is a graphical calculating device, a two-dimensional diagram designed to allow the approximate graphical computation of a mathematical function. The field of nomography was invented in 1884 by the French engineer Philbert Maurice d'Ocagne (1862–1938) and used extensively for many years to provide engineers with fast graphical calculations of complicated formulas to a practical precision. Nomograms use a parallel coordinate system invented by d'Ocagne rather than standard Cartesian coordinates.

A nomogram consists of a set of n scales, one for each variable in an equation. Knowing the values of n-1 variables, the value of the unknown variable can be found, or by fixing the values of some variables, the relationship between the unfixed ones can be studied. The result is obtained by laying a straightedge across the known values on the scales and reading the unknown value from where it crosses the scale for that variable. The virtual or drawn line created by the straightedge is called an index line or isopleth.

Nomograms flourished in many different contexts for roughly 75 years because they allowed quick and accurate computations before the age of pocket calculators. Results from a nomogram are obtained very quickly and reliably by simply drawing one or more lines. The user does not have to know how to solve algebraic equations, look up data in tables, use a slide rule, or substitute numbers into equations to obtain results. The user does not even need to know the underlying equation the nomogram represents. In addition, nomograms naturally incorporate implicit or explicit domain knowledge into their design. For example, to create larger nomograms for greater accuracy the nomographer usually includes only scale ranges that are reasonable and of interest to the problem. Many nomograms include other useful markings such as reference labels and colored regions. All of these provide useful guideposts to the user.

Like a slide rule, a nomogram is a graphical analog computation device, and like the slide rule, its accuracy is limited by the precision with which physical markings can be drawn, reproduced, viewed, and aligned. While the slide rule is intended to be a general-purpose device, a nomogram is designed to perform a specific calculation, with tables of values effectively built into the construction of the scales. Nomograms are typically used in applications where the level of accuracy they offer is sufficient and useful. Alternatively, a nomogram can be used to check an answer obtained from another, more exact but possibly error-prone calculation.

Other types of graphical calculators such as intercept charts, trilinear diagrams and hexagonal charts are sometimes called nomograms. Other such examples include the Smith chart, a graphical calculator used in electronics and systems analysis, thermodynamic diagrams and tephigrams, used to plot the vertical structure of the atmosphere and perform calculations on its stability and humidity content. These do not meet the strict definition of a nomogram as a graphical calculator whose solution is found by the use of one or more linear isopleths.

🔗 Computing 🔗 Computer science

In computer programming, COMEFROM (or COME FROM) is an obscure control flow structure used in some programming languages, originally as a joke. COMEFROM is roughly the opposite of GOTO in that it can take the execution state from any arbitrary point in code to a COMEFROM statement.

The point in code where the state transfer happens is usually given as a parameter to COMEFROM. Whether the transfer happens before or after the instruction at the specified transfer point depends on the language used. Depending on the language used, multiple COMEFROMs referencing the same departure point may be invalid, be non-deterministic, be executed in some sort of defined priority, or even induce parallel or otherwise concurrent execution as seen in Threaded Intercal.

A simple example of a "COMEFROM x" statement is a label x (which does not need to be physically located anywhere near its corresponding COMEFROM) that acts as a "trap door". When code execution reaches the label, control gets passed to the statement following the COMEFROM. This may also be conditional, passing control only if a condition is satisfied, analogous to a GOTO within an IF statement. The primary difference from GOTO is that GOTO only depends on the local structure of the code, while COMEFROM depends on the global structure – a GOTO transfers control when it reaches a line with a GOTO statement, while COMEFROM requires scanning the entire program or scope to see if any COMEFROM statements are in scope for the line, and then verifying if a condition is hit. The effect of this is primarily to make debugging (and understanding the control flow of the program) extremely difficult, since there is no indication near the line or label in question that control will mysteriously jump to another point of the program – one must study the entire program to see if any COMEFROM statements reference that line or label.

Debugger hooks can be used to implement a COMEFROM statement, as in the humorous Python goto module; see below. This also can be implemented with the gcc feature "asm goto" as used by the Linux kernel configuration option CONFIG_JUMP_LABEL. A no-op has its location stored, to be replaced by a jump to an executable fragment that at its end returns to the instruction after the no-op.

🔗 Computing 🔗 Computing/Software 🔗 Computing/Free and open-source software

netcat (often abbreviated to nc) is a computer networking utility for reading from and writing to network connections using TCP or UDP. The command is designed to be a dependable back-end that can be used directly or easily driven by other programs and scripts. At the same time, it is a feature-rich network debugging and investigation tool, since it can produce almost any kind of connection its user could need and has a number of built-in capabilities.

Its list of features includes port scanning, transferring files, and port listening, and it can be used as a backdoor.

🔗 Computing 🔗 Computer graphics

The Stanford bunny is a computer graphics 3D test model developed by Greg Turk and Marc Levoy in 1994 at Stanford University. The model consists of 69,451 triangles, with the data determined by 3D scanning a ceramic figurine of a rabbit. This figurine and others were scanned to test methods of range scanning physical objects.

The data can be used to test various graphics algorithms, including polygonal simplification, compression, and surface smoothing. There are a few complications with this dataset that can occur in any 3D scan data: the model is manifold connected and has holes in the data, some due to scanning limits and some due to the object being hollow. These complications provide a more realistic input for any algorithm that is benchmarked with the Stanford bunny, though by today's standards, in terms of geometric complexity and triangle count, it is considered a simple model.

The model was originally available in .ply (polygons) file format with 4 different resolutions.