source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Metacharacter | A metacharacter is a character that has a special meaning to a computer program, such as a shell interpreter or a regular expression (regex) engine.
In POSIX extended regular expressions, there are 14 metacharacters that must be escaped (preceded by a backslash (\)) in order to drop their special meaning and be treated literally inside an expression: opening and closing square brackets ([ and ]); backslash (\); caret (^); dollar sign ($); period/full stop/dot (.); vertical bar/pipe symbol (|); question mark (?); asterisk (*); plus and minus signs (+ and -); opening and closing curly brackets/braces ({ and }); and opening and closing parentheses (( and )).
For example, to match the arithmetic expression (1+1)*3=6 with a regex, the correct regex is \(1\+1\)\*3=6; otherwise, the parentheses, plus sign, and asterisk will have special meanings.
Other examples
Some other characters may have special meaning in some environments.
In some Unix shells the semicolon (";") is a statement separator.
In XML and HTML, the ampersand ("&") introduces an HTML entity. It also has special meaning in MS-DOS/Windows Command Prompt.
In some Unix shells and MS-DOS/Windows Command Prompt, the less-than sign and greater-than sign ("<" and ">") are used for redirection and the backtick/grave accent ("`") is used for command substitution.
In many programming languages, strings are delimited using quotes (" or '). In some cases, escape characters (and other methods) are used to avoid delimiter collision, e.g. "He said, \"Hello\"".
In printf format strings, the percent sign ("%") is used to introduce format specifiers and must be escaped as "%%" to be interpreted literally. In SQL, the percent is used as a wildcard character.
In SQL, the underscore ("_") is used to match any single character.
Escaping
The term "to escape a metacharacter" means to make the metacharacter ineffective (to strip it of its special meaning), causing it to have its literal meaning. For example, in PCRE, a dot (".") stands for any single character. The regular expression "A.C" will match "ABC", "A3C", or even "A C". However, if the "." is escaped, it will lose its meaning as a metacharacter and will be interpreted literally as ".", causing the regular expression "A\.C" to only match the string "A.C".
The usual way to escape a character in a regex and elsewhere is by prefixing it with a backslash ("\"). Other environments may employ different methods, like MS-DOS/Windows Command Prompt, where a caret ("^") is used instead.
See also
Markup language
References
Formal languages
Pattern matching
Programming language topics |
https://en.wikipedia.org/wiki/Preprocessor | In computer science, a preprocessor (or precompiler) is a program that processes its input data to produce output that is used as input in another program. The output is said to be a preprocessed form of the input data, which is often used by some subsequent programs like compilers. The amount and kind of processing done depends on the nature of the preprocessor; some preprocessors are only capable of performing relatively simple textual substitutions and macro expansions, while others have the power of full-fledged programming languages.
A common example from computer programming is the processing performed on source code before the next step of compilation.
In some computer languages (e.g., C and PL/I) there is a phase of translation known as preprocessing. It can also include macro processing, file inclusion and language extensions.
Lexical preprocessors
Lexical preprocessors are the lowest-level of preprocessors as they only require lexical analysis, that is, they operate on the source text, prior to any parsing, by performing simple substitution of tokenized character sequences for other tokenized character sequences, according to user-defined rules. They typically perform macro substitution, textual inclusion of other files, and conditional compilation or inclusion.
C preprocessor
The most common example of this is the C preprocessor, which takes lines beginning with '#' as directives.
The C preprocessor does not expect its input to use the syntax of the C language.
Some languages take a different approach and use built-in language features to achieve similar things. For example:
Instead of macros, some languages use aggressive inlining and templates.
Instead of includes, some languages use compile-time imports that rely on type information in the object code.
Some languages use if-then-else and dead code elimination to achieve conditional compilation.
Other lexical preprocessors
Other lexical preprocessors include the general-purpose m4, most commonly used in cross-platform build systems such as autoconf, and GEMA, an open source macro processor which operates on patterns of context.
Syntactic preprocessors
Syntactic preprocessors were introduced with the Lisp family of languages. Their role is to transform syntax trees according to a number of user-defined rules. For some programming languages, the rules are written in the same language as the program (compile-time reflection). This is the case with Lisp and OCaml. Some other languages rely on a fully external language to define the transformations, such as the XSLT preprocessor for XML, or its statically typed counterpart CDuce.
Syntactic preprocessors are typically used to customize the syntax of a language, extend a language by adding new primitives, or embed a domain-specific programming language (DSL) inside a general purpose language.
Customizing syntax
A good example of syntax customization is the existence of two different syntaxes in the Objective Caml programming lang |
https://en.wikipedia.org/wiki/Gram%E2%80%93Schmidt%20process | In mathematics, particularly linear algebra and numerical analysis, the Gram–Schmidt process or Gram-Schmidt algorithm is a method for orthonormalizing a set of vectors in an inner product space, most commonly the Euclidean space equipped with the standard inner product. The Gram–Schmidt process takes a finite, linearly independent set of vectors for and generates an orthogonal set that spans the same k-dimensional subspace of Rn as S.
The method is named after Jørgen Pedersen Gram and Erhard Schmidt, but Pierre-Simon Laplace had been familiar with it before Gram and Schmidt. In the theory of Lie group decompositions, it is generalized by the Iwasawa decomposition.
The application of the Gram–Schmidt process to the column vectors of a full column rank matrix yields the QR decomposition (it is decomposed into an orthogonal and a triangular matrix).
The Gram–Schmidt process
The vector projection of a vector on a nonzero vector is defined as
where denotes the inner product of the vectors and . This means that is the orthogonal projection of onto the line spanned by . If is the zero vector, then is defined as the zero vector.
Given vectors the Gram–Schmidt process defines the vectors as follows:
The sequence is the required system of orthogonal vectors, and the normalized vectors form an orthonormal set. The calculation of the sequence is known as Gram–Schmidt orthogonalization, and the calculation of the sequence is known as Gram–Schmidt orthonormalization.
To check that these formulas yield an orthogonal sequence, first compute by substituting the above formula for u2: we get zero. Then use this to compute again by substituting the formula for u3: we get zero. The general proof proceeds by mathematical induction.
Geometrically, this method proceeds as follows: to compute ui, it projects vi orthogonally onto the subspace U generated by , which is the same as the subspace generated by . The vector ui is then defined to be the difference between vi and this projection, guaranteed to be orthogonal to all of the vectors in the subspace U.
The Gram–Schmidt process also applies to a linearly independent countably infinite sequence . The result is an orthogonal (or orthonormal) sequence such that for natural number :
the algebraic span of is the same as that of .
If the Gram–Schmidt process is applied to a linearly dependent sequence, it outputs the vector on the ith step, assuming that is a linear combination of . If an orthonormal basis is to be produced, then the algorithm should test for zero vectors in the output and discard them because no multiple of a zero vector can have a length of 1. The number of vectors output by the algorithm will then be the dimension of the space spanned by the original inputs.
A variant of the Gram–Schmidt process using transfinite recursion applied to a (possibly uncountably) infinite sequence of vectors yields a set of orthonormal vectors with such that for any , the completio |
https://en.wikipedia.org/wiki/Structure%20and%20Interpretation%20of%20Computer%20Programs | Structure and Interpretation of Computer Programs (SICP) is a computer science textbook by Massachusetts Institute of Technology professors Harold Abelson and Gerald Jay Sussman with Julie Sussman. It is known as the "Wizard Book" in hacker culture. It teaches fundamental principles of computer programming, including recursion, abstraction, modularity, and programming language design and implementation.
MIT Press published the first edition in 1984, and the second edition in 1996. It was formerly used as the textbook for MIT's introductory course in computer science. SICP focuses on discovering general patterns for solving specific problems, and building software systems that make use of those patterns.
MIT Press published the JavaScript edition in 2022.
Content
The book describes computer science concepts using Scheme, a dialect of Lisp. It also uses a virtual register machine and assembler to implement Lisp interpreters and compilers.
Topics in the books are:
Chapter 1: Building Abstractions with Procedures
The Elements of Programming
Procedures and the Processes They Generate
Formulating Abstractions with Higher-Order Procedures
Chapter 2: Building Abstractions with Data
Introduction to Data Abstraction
Hierarchical Data and the Closure Property
Symbolic Data
Multiple Representations for Abstract Data
Systems with Generic Operations
Chapter 3: Modularity, Objects, and State
Assignment and Local State
The Environment Model of Evaluation
Modeling with Mutable Data
Concurrency: Time Is of the Essence
Streams
Chapter 4: Metalinguistic Abstraction
The Metacircular Evaluator
Variations on a Scheme – Lazy Evaluation
Variations on a Scheme – Nondeterministic Computing
Logic Programming
Chapter 5: Computing with Register Machines
Designing Register Machines
A Register-Machine Simulator
Storage Allocation and Garbage Collection
The Explicit-Control Evaluator
Compilation
Characters
Several fictional characters appear in the book:
Alyssa P. Hacker, a Lisp hacker
Ben Bitdiddle
Cy D. Fect, a "reformed C programmer"
Eva Lu Ator
Lem E. Tweakit
Louis Reasoner, a loose reasoner
License
The book is licensed under a Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0) license.
Coursework
The book was used as the textbook for MIT's former introductory programming course, 6.001, from fall 1984 through its last semester, in fall 2007. Other schools also made use of the book as a course textbook.
Various versions of the JavaScript edition have been used by the National University of Singapore since 2012 in the course CS1101S.
Reception
Byte recommended SICP in 1986 "for professional programmers who are really interested in their profession". The magazine said that the book was not easy to read, but that it would expose experienced programmers to both old and new topics.
Influence
SICP has been influential in computer science education, and several later books have been inspired by it |
https://en.wikipedia.org/wiki/MetaComCo | MetaComCo (MCC) was a computer systems software company started in 1981 and based in Bristol, England by Peter Mackeonis and Derek Budge. A division of Tenchstar, Ltd.
MetaComCo's first product was an MBASIC compatible interpreter for IBM PCs, which was licensed by Peter Mackeonis to Digital Research in 1982, and issued as the Digital Research Personal Basic, running under CP/M. Other computer languages followed, also licensed by Digital Research and MetaComCo established an office in Pacific Grove, California, to service their United States customers.
In 1984 Dr. Tim King joined the company, bringing with him a version of the operating system TRIPOS for the Motorola 68000 processor which he had previously worked on whilst a researcher at the University of Cambridge.
This operating system was used as the basis of AmigaDOS (file-related functions of AmigaOS); MetaComCo won the contract from Commodore because the original planned Amiga disk operating system called Commodore Amiga Operating System (CAOS) was behind schedule; timescales were incredibly tight and TRIPOS provided a head start for a replacement system.
MetaComCo also developed ABasiC for the Amiga, the first BASIC interpreter provided with Amigas. MetaComCo also worked with Atari Corporation to produce the BASIC initially provided with the Atari ST in 1985: ST BASIC.
The company also sold the Lattice C compiler for the Sinclair QL and the Atari ST and range of other languages (e.g. Pascal, BCPL) for m68k-based computers. MetaComCo also represented LISP and REDUCE software from the RAND Corporation.
Several of the team at MetaComCo went on to found Perihelion Software. Mackeonis founded Triangle Publishing, the software publishing company responsible for creating the ST Organizer for the Atari ST and PC Organizer and Counterpoint (a GUI system) for Amstrad Computers and GoldStar computers.
MetaComCo BASIC was available on the Singapore Teleview videotext receiver.
It is unknown when MetaComCo was disestablished, or if it ever was.
References
Finkel, Andy. "In the beginning was CAOS". Amiga Transactor. 1988.
Reimer, Jeremy. "A history of the Amiga", Ars Technica Oct 2007.
Peck, Robert. The ABasiC manual. 1985.
External links
Overview
Programming the 68000 by Metacomco
History (German)
Atari ST
Amiga
Software companies of the United Kingdom
Companies established in 1981 |
https://en.wikipedia.org/wiki/TRIPOS | TRIPOS (TRIvial Portable Operating System) is a computer operating system. Development started in 1976 at the Computer Laboratory of Cambridge University and it was headed by Dr. Martin Richards. The first version appeared in January 1978 and it originally ran on a PDP-11. Later it was ported to the Computer Automation LSI4 and the Data General Nova. Work on a Motorola 68000 version started in 1981 at the University of Bath. MetaComCo acquired the rights to the 68000 version and continued development until TRIPOS was chosen by Commodore in March 1985 to form part of an operating system for their new Amiga computer; it was also used at Cambridge as part of the Cambridge Distributed Computing System.
Students in the Computer Science department at Cambridge affectionately refer to TRIPOS as the Terribly Reliable, Incredibly Portable Operating System. The name TRIPOS also refers to the Tripos system of undergraduate courses and examinations, which is unique to Cambridge University.
Influences on the Amiga computer
In July 1985, the Amiga was introduced, incorporating TRIPOS in the AmigaDOS module of AmigaOS. AmigaDOS included a command-line interface and the Amiga File System. The entire AmigaDOS module was originally written in BCPL (an ancestor of the C programming language), the same language used to write TRIPOS. AmigaDOS would later be rewritten in C from AmigaOS 2.x onwards, retaining backwards compatibility with 1.x up until AmigaOS 4 (completely rewritten in C) when AmigaDOS abandoned its BCPL legacy.
Features
TRIPOS provided features such as pre-emptive multi-tasking (using strict-priority scheduling), a hierarchical file system and multiple command line interpreters.
The most important TRIPOS concepts have been the non-memory-management approach (meaning no checks are performed to stop programs from using unallocated memory) and message passing by means of passing pointers instead of copying message contents. Those two concepts together allowed for sending and receiving over 1250 packets per second on a 10 MHz Motorola 68010 CPU.
Most of TRIPOS was implemented in BCPL. The kernel and device drivers were implemented in assembly language.
One notable feature of TRIPOS/BCPL was its cultural use of shared libraries, untypical at the time, resulting in small and therefore fast loading utilities. For example, many of the standard system utilities were well below 0.5 Kbytes in size, compared to a typical minimum of about 20 Kbytes for functionally equivalent code on a modern Unix or Linux.
TRIPOS was ported to a number of machines, including the Data General Nova 2, the Computer Automation LSI4, Motorola 68000 and Intel 8086- based hardware. It included support for the Cambridge Ring local area network. More recently, Martin Richards produced a port of TRIPOS to run under Linux, using Cintcode BCPL virtual machine.
As of February 2020, TRIPOS is still actively maintained by Open G I Ltd. (formerly Misys Financial Systems) in Worcestersh |
https://en.wikipedia.org/wiki/List%20of%20United%20States%20over-the-air%20television%20networks | In the United States, for most of the history of broadcasting, there were only three or four major commercial national terrestrial networks. From 1946 to 1956, these were ABC, CBS, NBC and DuMont (though the Paramount Television Network had some limited success during these years). From 1956 to 1986, the "Big Three" national commercial networks were ABC, CBS, and NBC (with a few limited attempts to challenge them, such as National Telefilm Associates [and its NTA Film Network] and the Overmyer Network). From 1954 to 1970, National Educational Television was the national clearinghouse for public TV programming; the Public Broadcasting Service (PBS) succeeded it in 1970.
Today, more than fifty national free-to-air networks exist. Other than the non-commercial educational (NCE) PBS, which is composed of member stations, the largest terrestrial television networks are the traditional Big Three television networks (ABC, CBS and NBC). Many other large networks exist, however, notably Fox and The CW which air original programming for two hours each night instead of three like the original "Big Three" do, as well as MyNetworkTV and Ion Television, which feature reruns of recent popular shows with little to no original programming. Fox has just about the same household reach percentage as the Big Three, and is therefore often considered a peer to ABC, CBS, and NBC since it has also achieved equal or better ratings since the late 1990s; as of 2019, it also programs the equivalent amount of sports programming as the Big Three. Most media outlets now include Fox in what they refer to as the "Big Four" TV networks.
The transition to digital broadcasting in 2009 has allowed for television stations to offer additional programming options through digital subchannels, one or more supplementary programming streams to the station's primary channel that are achieved through multiplexing of a station's signal. A number of new commercial networks airing specialty programming such as movies, reruns of classic series and lifestyle programs have been created from companies like Weigel Broadcasting, Sinclair Broadcast Group and even owners of the major networks such as Fox Corporation (through the Fox Entertainment subsidiary), Paramount Global (through the CBS Media Ventures subsidiary), The Walt Disney Company (through the Walt Disney Television subsidiary) and Comcast (through the NBCUniversal subsidiary). Through the use of multicasting, there have also been a number of new Spanish-language and non-commercial public TV networks that have launched.
Free-to-air networks in the U.S. can be divided into five categories:
Commercial networks – which air English-language programming to a general audience (for example, ABC, CBS, NBC, and Fox);
Spanish-language networks – fully programmed networks which air Spanish-language programming to a primarily Latin American audience (for example, Telemundo and Univision);
Educational and other non-commercial broadcast networks – |
https://en.wikipedia.org/wiki/Talon | Talon or talons may refer to:
Science and technology
Talon (anatomy), the claw of a bird of prey
Brodifacoum, a rodenticide, also known as the brand Talon
TALON (database), a database maintained by the US Air Force
Talon, an anti-vehicle-ramming spike strip-like net
Entertainment and media
Talon, the newspaper of Los Altos High School, US
Talon (cards), in some card games, the remainder of a deck of cards
Talon, a novel by Julie Kagawa
Talon (Smallville), a fictional coffee shop in the TV series
Talon (roller coaster), an inverted roller coaster
Fictional characters
Talons, assassins of the Court of Owls in DC Comics
Talon, a character from Marvel Comics
Talon, a character from Static Shock
Talon, a character from Transformers
Talon, a character from The Legend of Zelda
Talon Karrde, a character from Star Wars
Talon Maza, a character from Gargoyles
Talon Labarthe, a character from in Ratatouille
Achille Talon, comic book series and character
Darth Talon, a character from Star Wars
Talon of the Silver Hawk or Talwin Hawkins in Conclave of Shadows
Talon, in the Dark-HunterDark-Hunter series
X-23 or Talon, in Marvel Comics
Talon, in the Prey video game
Talon, in the video game Primal Rage
Talon, a member of the Sackett family in various works by Louis L'Amour
Talon, a dog in the film Snow Buddies
Talon, in the TV series Inspector Gadget
Other fictional entities
Talon light fighter in Wing Commander
F/A-37 Talon, an aircraft in the 2005 film Stealth
A terrorist group in the lore of Overwatch
Music
Talon, a French term for the bow frog of a string instrument
"Talons", a song on the Bloc Party album Intimacy
Talons, a British band
Transportation
Ground
Eagle Talon, an automobile produced by the Eagle division of Chrysler
Foster-Miller TALON, a US military unmanned ground vehicle
Talon MHS-II, a car built for the Can-Am series and used briefly in 1977
Aviation
Lockheed MC-130 Combat Talon, a variant of the C-130 aircraft operated by the U.S. Air Force
Northrop T-38 Talon, a US-built supersonic jet trainer for military pilots
RotorWay A600 Talon, an American helicopter design
Wills Wing Talon, an American hang glider design
Other uses
Talon (actor) (born 1969), in the adult entertainment industry
Talon (surname)
Talon (bearer bond), a document attached to a bearer bond which entitled the holder to a block of further coupons
Talon (rural locality), in Russia
Talon Esports, a professional esports organisation based in Hong Kong
PSG Talon, a professional League of Legends team
Talon, Nièvre, a commune in France
Talon Zipper, US zipper company
San Antonio Talons, San Antonio, Texas's arena football team, formerly the Tulsa Talons
The mascot of the Major League Soccer team D.C. United
Another name for Ogee moulding in woodworking
See also
Operation Talon (disambiguation), the codename of several military or police operations
Tallon (disambiguation)
Talion (disambiguation)
Talen (disambiguation |
https://en.wikipedia.org/wiki/Sort | Sort may refer to:
Sorting, any process of arranging items in sequence or in sets
Sorting algorithm, any algorithm for arranging elements in lists
Sort (Unix), a Unix utility which sorts the lines of a file
Sort (C++), a function in the C++ Standard Template Library
SORT (journal), peer-reviewed open access scientific journal
Sort (mathematical logic), a domain in a many-sorted structure
Sort (typesetting), a piece of metal type
Sort, Lleida, a town in Catalonia
Selective organ targeting, a drug delivery method
Special Operations Response Team, a group trained to respond to disturbances at a correctional facility
Strategic Offensive Reductions Treaty, a treaty between the United States and the Russian Federation
Symantec Operations Readiness Tools, a web-based suite of services from Symantec Corporation
See also
Many-sorted logic
Check weigher, an automatic machine for checking the weight of packaged commodities
qsort, a sorting function in the C standard library |
https://en.wikipedia.org/wiki/Xerox%20Star | The Xerox Star workstation, officially named Xerox 8010 Information System, is the first commercial personal computer to incorporate technologies that have since become standard in personal computers, including a bitmapped display, a window-based graphical user interface, icons, folders, mouse (two-button), Ethernet networking, file servers, print servers, and e-mail.
Introduced by Xerox Corporation on April 27, 1981, the name Star technically refers only to the software sold with the system for the office automation market. The 8010 workstations were also sold with software based on the programming languages Lisp and Smalltalk for the smaller research and software development market.
History
The Xerox Alto
The Xerox Star systems concept owes much to the Xerox Alto, an experimental workstation designed by the Xerox Palo Alto Research Center (PARC). The first Alto became operational in 1972. The Alto had been strongly influenced by what its designers had seen previously with the NLS computer system at the Stanford Research Institute and PLATO at University of Illinois. At first, only a few Altos had been built. Although by 1979 nearly 1,000 Ethernet-linked Altos had been put into operation at Xerox and another 500 at collaborating universities and government offices, it was never intended to be a commercial product. Then in 1977, Xerox started a development project which worked to incorporate the Alto innovations into a commercial product; their concept was an integrated document preparation system, centered around the (then expensive) laser printing technology and oriented towards large corporations and their trading partners. When the resulting Xerox Star system was announced in 1981, the cost was about $75,000 ($ in today's dollars) for a basic system, and $16,000 ($ today) for each added workstation. A base system would have an 8010 Star workstation, and a second 8010 dedicated as a server (with RS232 I/O), and a floor-standing laser printer. The server software included a File Server, a Print Server, and distributed services (Mail Server, Clearinghouse Name Server / Directory, and Authentication Server). Customers could connect Xerox Memorywriter typewriters to this system over Ethernet and send email, using the Memorywriter as a teletype.
The Xerox Star development process
The Star was developed at Xerox's Systems Development Department (SDD) in El Segundo, California, which had been established in 1977 under the direction of Don Massaro. A section of SDD, SDD North, was located in Palo Alto, California, and included some people borrowed from PARC. SDD's mission was to design the "Office of the future", a new system that would incorporate the best features of the Alto, was easy to use, and could automate many office tasks.
The development team was headed by David Liddle, and would eventually grow to more than 200 developers. A good part of the first year was taken up by meetings and planning, the result of which was an extensive and |
https://en.wikipedia.org/wiki/FLOW-MATIC | FLOW-MATIC, originally known as B-0 (Business Language version 0), was the first English-like data processing language. It was developed for the UNIVAC I at Remington Rand under Grace Hopper from 1955 to 1959, and helped shape the development of COBOL.
Development
Hopper had found that business data processing customers were uncomfortable with mathematical notation:
In late 1953, she proposed that data processing problems should be expressed using English keywords, but Rand management considered the idea unfeasible. In early 1955, she and her team wrote a specification for such a programming language and implemented a prototype. The FLOW-MATIC compiler became publicly available in early 1958 and was substantially complete in 1959.
Innovations and influence
The Laning and Zierler system was the first programming language to parse algebraic formulae. When Hopper became aware of that language in 1954, it altered the trajectory of her work. FLOW-MATIC was the first programming language to express operations using English-like statements. It was also the first system to distinctly separate the description of data from the operations on it. Its data definition language, unlike its executable statements, was not English-like; rather, data structures were defined by filling in pre-printed forms.
FLOW-MATIC and its direct descendant AIMACO shaped COBOL, which incorporated several of its elements:
Defining Input & Output Files and printed output in advance, separated into INPUT files, OUTPUT files and (HSP) High Speed Printer outputs. ; ; .
Qualification of data-names ( or clause).
clause on file operations.
Figurative constant (originally , where number of s indicated precision).
Dividing the program into sections, separating different parts of the program. Flow-Matic sections included (Environment Division), (Data Division), and (Procedure Division).
Sample program
A sample FLOW-MATIC program:
() INPUT INVENTORY FILE-A PRICE FILE-B ; OUTPUT PRICED-INV FILE-C UNPRICED-INV
FILE-D ; HSP D .
() COMPARE PRODUCT-NO (A) WITH PRODUCT-NO (B) ; IF GREATER GO TO OPERATION 10 ;
IF EQUAL GO TO OPERATION 5 ; OTHERWISE GO TO OPERATION 2 .
() TRANSFER A TO D .
() WRITE-ITEM D .
() JUMP TO OPERATION 8 .
() TRANSFER A TO C .
() MOVE UNIT-PRICE (B) TO UNIT-PRICE (C) .
() WRITE-ITEM C .
() READ-ITEM A ; IF END OF DATA GO TO OPERATION 14 .
() JUMP TO OPERATION 1 .
() READ-ITEM B ; IF END OF DATA GO TO OPERATION 12 .
() JUMP TO OPERATION 1 .
() SET OPERATION 9 TO GO TO OPERATION 2 .
() JUMP TO OPERATION 2 .
() TEST PRODUCT-NO (B) AGAINST ; IF EQUAL GO TO OPERATION 16 ;
OTHERWISE GO TO OPERATION 15 .
() REWIND B .
() CLOSE-OUT FILES C ; D .
() STOP . (END)
Sample Notes
Note that this sample includes only the executable statements of the program, the section. The record fields and would have been defined in the section, which (as previously noted) did not use English-like syntax.
Fil |
https://en.wikipedia.org/wiki/HBO%20World%20Championship%20Boxing | HBO World Championship Boxing (in later years stylized in its title card as HBO Boxing – World Championship) is an American sports television series on premium television network HBO. It premiered on January 22, 1973 with a fight that saw George Foreman defeat Joe Frazier in Kingston, Jamaica.
HBO's pay-per-view distribution arm, TVKO was formed in 1990, which debuted in 1991 with Evander Holyfield vs. George Foreman and was rebranded HBO PPV in 2001.
On September 27, 2018, HBO announced they would be dropping boxing from the network following its last televised match on October 27, though two airings on November 24 and December 8 were its last editions. Various issues in the boxing business, including the influx of streaming options (such as DAZN and ESPN+) and issues with promoters, along with declining ratings and loss of interest in the sport among HBO's subscribers, made continued carriage of the sport untenable. HBO's long-term move to upscale dramatic programming, an ownership transfer of parent WarnerMedia to AT&T, and re-focus around the upcoming streaming service HBO Max also played a role in the decision, with an HBO executive commenting that "HBO is not a sports network."
Memorable events
Famous matches broadcast on World Championship Boxing include:
the Rumble in the Jungle, in which Muhammad Ali regained the world heavyweight title from George Foreman in Kinshasa, Zaire in 1974;
the Thrilla in Manila, the final encounter between Muhammad Ali and Joe Frazier and HBO's first program when the service uplinked to satellite in 1975;
Sugar Ray Leonard vs. Thomas Hearns I and II
When Wilfred Benítez beat Roberto Durán
Larry Holmes vs. Gerry Cooney, for the World Boxing Council (WBC) heavyweight championship;
the Battle of the Champions, when Aaron Pryor beat Alexis Argüello in their first fight;
Carnival of Champions, in which Wilfredo Gómez beat Lupe Pintor, and Thomas Hearns beat Wilfred Benítez;
Marvin Hagler defeats Roberto Durán and Hector Camacho beat Rafi Solis - both fights shown on the same night, days after they had taken place
Marvin Hagler-Thomas Hearns fight, billed as The War;
Evander Holyfield vs. George Foreman, billed as The Battle of the Ages;
Thunder Meets Lightning, in which Julio César Chávez beat Meldrick Taylor with two seconds remaining in the twelfth round;
Michael Moorer vs. George Foreman, in which Foreman knocked out Michael Moorer to become the oldest heavyweight champion of the world at age 45;
James "Buster" Douglas's stunning upset of Mike Tyson for the undisputed world heavyweight title in Tokyo, Japan;
Evander Holyfield vs. Lennox Lewis and Evander Holyfield vs. Lennox Lewis II;
Arturo Gatti vs. Micky Ward trilogy, in which the first fight, Ward beat Gatti by majority decision, while Gatti beat Ward twice, in second and third fights by unanimous decision;
Manny Pacquiao vs. Juan Manuel Márquez tetralogy, in which the first fight ended in a split draw where Burt Clements incorrectly scor |
https://en.wikipedia.org/wiki/Data%20model | A data model is an abstract model that organizes elements of data and standardizes how they relate to one another and to the properties of real-world entities. For instance, a data model may specify that the data element representing a car be composed of a number of other elements which, in turn, represent the color and size of the car and define its owner.
The corresponding professional activity is called generally data modeling or, more specifically, database design.
Data models are typically specified by a data expert, data specialist, data scientist, data librarian, or a data scholar.
A data modeling language and notation are often represented in graphical form as diagrams.
A data model can sometimes be referred to as a data structure, especially in the context of programming languages. Data models are often complemented by function models, especially in the context of enterprise models.
A data model explicitly determines the structure of data; conversely, structured data is data organized according to an explicit data model or data structure. Structured data is in contrast to unstructured data and semi-structured data.
Overview
The term data model can refer to two distinct but closely related concepts. Sometimes it refers to an abstract formalization of the objects and relationships found in a particular application domain: for example the customers, products, and orders found in a manufacturing organization. At other times it refers to the set of concepts used in defining such formalizations: for example concepts such as entities, attributes, relations, or tables. So the "data model" of a banking application may be defined using the entity–relationship "data model". This article uses the term in both senses.
Managing large quantities of structured and unstructured data is a primary function of information systems. Data models describe the structure, manipulation, and integrity aspects of the data stored in data management systems such as relational databases. They may also describe data with a looser structure, such as word processing documents, email messages, pictures, digital audio, and video: XDM, for example, provides a data model for XML documents.
The role of data models
The main aim of data models is to support the development of information systems by providing the definition and format of data. According to West and Fowler (1999) "if this is done consistently across systems then compatibility of data can be achieved. If the same data structures are used to store and access data then different applications can share data. The results of this are indicated above. However, systems and interfaces often cost more than they should, to build, operate, and maintain. They may also constrain the business rather than support it. A major cause is that the quality of the data models implemented in systems and interfaces is poor".
"Business rules, specific to how things are done in a particular place, are often fixed in the structur |
https://en.wikipedia.org/wiki/Geostationary%20Operational%20Environmental%20Satellite | The Geostationary Operational Environmental Satellite (GOES), operated by the United States' National Oceanic and Atmospheric Administration (NOAA)'s National Environmental Satellite, Data, and Information Service division, supports weather forecasting, severe storm tracking, and meteorology research. Spacecraft and ground-based elements of the system work together to provide a continuous stream of environmental data. The National Weather Service (NWS) and the Meteorological Service of Canada use the GOES system for their North American weather monitoring and forecasting operations, and scientific researchers use the data to better understand land, atmosphere, ocean, and climate dynamics.
The GOES system uses geosynchronous equatorial satellites that, since the launch of SMS-1 in 1974, have been a basic element of U.S. weather monitoring and forecasting.
The procurement, design, and manufacture of GOES satellites is overseen by NASA.
NOAA is the official provider of both GOES terrestrial data and GOES space weather data. Data can also be accessed using the SPEDAS software.
History
The first GOES satellite, GOES-1, was launched in October 1975. Two more followed, launching almost two minutes short of a year apart, on 16 June 1977 and 1978 respectively. Prior to the GOES satellites two Synchronous Meteorological Satellites (SMS) satellites had been launched; SMS-1 in May 1974, and SMS-2 in February 1975. The SMS-derived satellites were spin-stabilized spacecraft, which provided imagery through a Visible and Infrared Spin Scan Radiometer, or VISSR. The first three GOES satellites used a Philco-Ford bus developed for the earlier Synchronous Meteorological Satellites (SMS) generation.
Following the three SMS GOES spacecraft, five satellites were procured from Hughes, which became the first generation GOES satellites. Four of these reached orbit, with GOES-G being lost in a launch failure.
The next five GOES satellites were constructed by Space Systems/Loral, under contract to NASA. The imager and sounder instruments were produced by ITT Aerospace/Communication Division. GOES-8 and -9 were designed to operate for three years, while -10, -11 and -12 have expected lifespans of five years. GOES-11 and -12 were launched carrying enough fuel for ten years of operation, in the event that they survived beyond their expected lifespan.
A contract to develop four third-generation GOES satellites was awarded to Hughes Corporation, with the satellites scheduled for launch on Delta III rockets between 2002 and 2010. After a merger with Hughes, Boeing took over the development contracts, with launches transferred to the Delta IV, following the Delta III's retirement. The contract for the fourth satellite, GOES-Q, was later cancelled, and that satellite will only be completed in the event that another third-generation satellite is lost in a launch failure or fails soon after launch. The first third-generation satellite, GOES-13, was launched in May 2006, orig |
https://en.wikipedia.org/wiki/Disk%20image | A disk image is a snapshot of a storage device's structure and data typically stored in one or more computer files on another storage device. Traditionally, disk images were bit-by-bit copies of every sector on a hard disk often created for digital forensic purposes, but it is now common to only copy allocated data to reduce storage space. Compression and deduplication are commonly used to reduce the size of the image file set. Disk imaging is done for a variety of purposes including digital forensics, cloud computing, system administration, as part of a backup strategy, and legacy emulation as part of a digital preservation strategy. Disk images can be made in a variety of formats depending on the purpose. Virtual disk images (such as VHD and VMDK) are intended to be used for cloud computing, ISO images are intended to emulate optical media and raw disk images are used for forensic purposes. Proprietary formats are typically used by disk imaging software. Despite the benefits of disk imaging the storage costs can be high, management can be difficult and they can be time consuming to create.
Background
Disk images were originally (in the late 1960s) used for backup and disk cloning of mainframe disk media. Early ones were as small as 5 megabytes and as large as 330 megabytes, and the copy medium was magnetic tape, which ran as large as 200 megabytes per reel. Disk images became much more popular when floppy disk media became popular, where replication or storage of an exact structure was necessary and efficient, especially in the case of copy protected floppy disks.
Disk image creation is called disk imaging and is often time consuming, even with a fast computer, because the entire disk must be copied. Typically, disk imaging requires a third party disk imaging program or backup software. The software required varies according to the type of disk image that needs to be created. For example, RawWrite and WinImage create floppy disk image files for MS-DOS and Microsoft Windows. In Unix or similar systems the dd program can be used to create raw disk images. Apple Disk Copy can be used on Classic Mac OS and macOS systems to create and write disk image files.
Authoring software for CDs/DVDs such as Nero Burning ROM can generate and load disk images for optical media. A virtual disk writer or virtual burner is a computer program that emulates an actual disc authoring device such as a CD writer or DVD writer. Instead of writing data to an actual disc, it creates a virtual disk image. A virtual burner, by definition, appears as a disc drive in the system with writing capabilities (as opposed to conventional disc authoring programs that can create virtual disk images), thus allowing software that can burn discs to create virtual discs.
Uses
Digital forensics
Forensic imaging is the process of creating a bit-by-bit copy of the data on the drive, including files, metadata, volume information, filesystems and their structure. Often, these images are a |
https://en.wikipedia.org/wiki/FLOPS | In computing, floating point operations per second (FLOPS, flops or flop/s) is a measure of computer performance, useful in fields of scientific computations that require floating-point calculations. For such cases, it is a more accurate measure than measuring instructions per second.
Floating-point arithmetic
Floating-point arithmetic is needed for very large or very small real numbers, or computations that require a large dynamic range. Floating-point representation is similar to scientific notation, except everything is carried out in base two, rather than base ten. The encoding scheme stores the sign, the exponent (in base two for Cray and VAX, base two or ten for IEEE floating point formats, and base 16 for IBM Floating Point Architecture) and the significand (number after the radix point). While several similar formats are in use, the most common is ANSI/IEEE Std. 754-1985. This standard defines the format for 32-bit numbers called single precision, as well as 64-bit numbers called double precision and longer numbers called extended precision (used for intermediate results). Floating-point representations can support a much wider range of values than fixed-point, with the ability to represent very small numbers and very large numbers.
Dynamic range and precision
The exponentiation inherent in floating-point computation assures a much larger dynamic range – the largest and smallest numbers that can be represented – which is especially important when processing data sets where some of the data may have extremely large range of numerical values or where the range may be unpredictable. As such, floating-point processors are ideally suited for computationally intensive applications.
Computational performance
FLOPS and MIPS are units of measure for the numerical computing performance of a computer. Floating-point operations are typically used in fields such as scientific computational research. The unit MIPS measures integer performance of a computer. Examples of integer operation include data movement (A to B) or value testing (If A = B, then C). MIPS as a performance benchmark is adequate when a computer is used in database queries, word processing, spreadsheets, or to run multiple virtual operating systems. Frank H. McMahon, of the Lawrence Livermore National Laboratory, invented the terms FLOPS and MFLOPS (megaFLOPS) so that he could compare the supercomputers of the day by the number of floating-point calculations they performed per second. This was much better than using the prevalent MIPS to compare computers as this statistic usually had little bearing on the arithmetic capability of the machine.
FLOPS on an HPC-system can be calculated using this equation:
This can be simplified to the most common case: a computer that has exactly 1 CPU:
FLOPS can be recorded in different measures of precision, for example, the TOP500 supercomputer list ranks computers by 64 bit (double-precision floating-point format) operations per second, |
https://en.wikipedia.org/wiki/Rape%2C%20Abuse%20%26%20Incest%20National%20Network | The Rape, Abuse & Incest National Network (RAINN) is an American nonprofit anti-sexual assault organization, the largest in the United States. RAINN operates the National Sexual Assault Hotline, as well as the Department of Defense Safe Helpline, and carries out programs to prevent sexual assault, help survivors, and ensure that perpetrators are brought to justice through victim services, public education, public policy, and consulting services.
RAINN was founded in 1994 by Scott Berkowitz, with initial funding from The Atlantic Group and Warner Music Group. Tori Amos was the organization's first spokesperson. Christina Ricci has been the national spokesperson since April 25, 2007, and she is a member of its National Leadership Council.
History
RAINN was founded in 1994 by Scott Berkowitz. In 2006, its National Sexual Assault Hotline received its one-millionth caller.
In 2014, RAINN attracted controversy for its criticism of the concept of rape culture and its promotion of primarily criminal justice system solutions in its recommendations to the White House Task Force to Protect Students from Sexual Assault. In response, Zerlina Maxwell created the hashtag "#RapeCultureIsWhen." Wagatwe Wanjuki,Amanda Marcotte,Jessica Valenti, and others asserted that rape culture exists and denounced relying on the criminal justice system to prevent sexual violence on college campuses.
After Senate unanimously reauthorized the Debbie Smith Act in May 2019, RAINN gathered 32,000 signatures from online petitions in hopes to push Senate Bill 820 toward House passage. The Debbie Smith Act, which aims to eliminate the backlog of untested DNA and rape kit evidence by allocating $151 million annually to state and local labs, was passed by the House in December 2019.
In February 2022, RAINN supported the EARN IT Act, which removes blanket immunity for violations of laws related to online child sexual abuse material (CSAM). U.S. Senators Richard Blumenthal and Lindsey Graham introduced bipartisan legislation to incentivize tech companies to remove child sexual abuse imagery on their platforms. Also in February, RAINN partnered with Congresswoman Deborah Ross and Congressman Dave Joyce on the Sexual Assault Nurse Examiners (SANEs) Act, which is designed to address the nation-wide shortage of Sexual Assault Nurse Examiners (SANEs) and improve care for survivors of sexual violence. It bill was also endorsed by the American Nurses Association and the National Network to End Domestic Violence.
In April 2022, Insider published an article about RAINN's workplace culture in which 22 current and former staff members alleged racism and sexism. A rape survivor story by a higher-ranked Navy physician was chosen to be published on RAINN's web site, but later wasn't published due to Berkowitz not wanting to jeopardize RAINN's $2million contract with the United States Department of Defense. When The Lily interviewed a woman for International Women's Day, she said she was tired |
https://en.wikipedia.org/wiki/AC3 | AC3 or AC-3 may refer to:
Science and technology
Dolby AC-3, Dolby Digital audio codec
AC-3 algorithm (Arc Consistency Algorithm 3), one of a series of algorithms used for the solution of constraint satisfaction problems
(35414) 1998 AC3, a minor planet
AC-3, an IEC utilization category
AC3 (All Content Creators Currency), a cryptocurrency aimed at content creators
Ambedkar Community Computing Center (AC3)
Transportation
Comte AC-3, a 1920s Swiss bomber/transport aircraft
Southern Pacific class AC-3, a class of steam locomotive
Video games
Ace Combat 3, part of the Ace Combat series of video games
Armored Core 3, part of the Armored Core series of video games
Assassin's Creed III, part of the Assassin's Creed series of video games
Other
Apple Campus 3, Apple's third large Silicon Valley campus |
https://en.wikipedia.org/wiki/Fibber%20McGee%20and%20Molly | Fibber McGee and Molly (1935–1959) was a longtime husband-and-wife team radio comedy program.
The situation comedy was a staple of the NBC Red Network from 1936 on, after originating on NBC Blue in 1935. One of the most popular and enduring radio series of its time, it ran as a stand-alone series from 1935 to 1956, and then continued as a short-form series as part of the weekend Monitor from 1957 to 1959. The title characters were created and portrayed by Jim and Marian Jordan, a husband-and-wife team that had been working in radio since the 1920s.
Fibber McGee and Molly followed up the Jordans' previous radio sitcom Smackout. It featured the misadventures of a working-class couple: habitual storyteller Fibber McGee and his sometimes terse but always loving wife Molly, living among their numerous neighbors and acquaintances in the community of Wistful Vista. As with radio comedies of the era, Fibber McGee and Molly featured an announcer, house band and vocal quartet for interludes. At the peak of the show's success in the 1940s, it was adapted into a string of feature films. A 1959 attempt to adapt the series to television with a different cast and new writers was both a critical and commercial failure, which, coupled with Marian Jordan's death shortly thereafter, brought the series to a finish.
Husband and wife in real life
The stars of the program were husband-and-wife team Jim Jordan (1896–1988) and Marian Driscoll Jordan (1898–1961), who were natives of Peoria, Illinois.
Jordan was the seventh of eight children born to James Edward Jordan, a farmer, and Mary (née Tighe) Jordan, while Driscoll was the twelfth of thirteen children born to Daniel P., a coalminer, and wife Anna (née Carroll) Driscoll.
Jim wanted to be a singer, and Marian wanted to be a music teacher. Both attended the same Catholic church, where they met at choir practice. Marian's parents had attempted to discourage her professional aspirations. When she started seeing Jim Jordan, the Driscolls were far from approving of either him or his ideas. Jim's voice teacher gave him a recommendation for work as a professional in Chicago, and he followed it. He was able to gain steady employment, but soon tired of the life on the road. In less than a year, Jim came back to Peoria and went to work for the Post Office. Marian's parents now found Jim (and his career) to be acceptable, and they stopped objecting to the couple's marriage plans. The pair married in Peoria, August 31, 1918.
Five days after the wedding, Jim received his draft notice. He was sent to France, and became part of a military touring group which entertained the armed forces after World War I. When Jim came home from France, he and Marian decided to try their luck with a vaudeville act. They had 2 children, Kathryn Therese Jordan (1920–2007) and James Carroll Jordan (1923–1998). Marian returned home for the birth of Kathryn, but went back to performing with Jim, leaving her with Jim's parents. After Jim Jr. was bo |
https://en.wikipedia.org/wiki/Cybersex | Cybersex, also called computer sex, Internet sex, netsex and, colloquially, cyber or cybering, is a virtual sex encounter in which two or more people have long distance sex via electronic video communication (webcams, VR headsets, etc) and other electronics (such as teledildonics) connected to a computer network.
Cybersex can also mean sending each other sexually explicit messages without having sex, and simply describing a sexual experience (also known as "sexting"). Cybersex is a sub-type of technology-mediated sexual interactions. In one form, this is accomplished by the participants describing their actions and responding to their chat partners in a mostly written form designed to stimulate their own sexual feelings and fantasies. Cybersex often includes real life masturbation.
Environments in which cybersex takes place are not necessarily exclusively devoted to that subject, and participants in any Internet chat may suddenly receive a message of invitation.
Non-marital, adult, consensual paid cybersex counts as illegal solicitation of prostitution and illegal prostitution in multiple US states. Non-consensual cybersex sometimes occurs in cybersex trafficking crimes. There also has been at least one rape conviction for purely virtual sexual encounters.
Environments
Cybersex is commonly performed in Internet chat rooms (such as IRC, talkers or web chats) and on instant messaging systems. It can also be performed using webcams, voice chat, or online games and/or virtual worlds like Second Life or VRChat.
The exact definition of cybersex—specifically, whether real-life masturbation must be taking place for the online sex act to count as cybersex—is up for debate. It is also fairly frequent in online role-playing games, such as MUDs and MMORPGs, though community attitudes toward this activity vary greatly from game to game. Some online social games like Red Light Center are dedicated to cybersex and other adult behaviors. These online games are often called AMMORPGs.
Cybersex may also be accomplished through the use of avatars in a multiuser software environment. It is often called mudsex or netsex in MUDs. In TinyMUD variants, particularly MUCKs, the term TinySex (TS) is very common.
Though text-based cybersex has been in practice for decades, the increased popularity of webcams has raised the number of online partners using two-way video connections to "expose" themselves to each other online—giving the act of cybersex a more visual aspect. There are a number of popular, commercial webcam sites that allow people to openly masturbate on camera while others watch them. Using similar sites, couples can also perform on camera for the enjoyment of others.
In online worlds like Second Life and via webcam-focused chat services, however, Internet sex workers engage in cybersex in exchange for both virtual and real-life currency.
Advantages
Cybersex provides various advantages:
Cybersex allows real-life partners who are physically separa |
https://en.wikipedia.org/wiki/UIN | UIN may refer to:
Common
User Identification Number, used by many computer security systems and ICQ, see ICQ#UIN, Unique identifier and User (computing)
Universal Identification Number
used for people, see National identification number and Unique Identification Authority of India, see also Permanent account number (PAN)
used for inventory, see also UID
University Identification Number, used by many universities for students, faculty and alumni
Unit Identification Number, used by the military, see Military unit
Unit Identification Number, used by the Department of Education, see Integrated Postsecondary Education Data System
Unique Identification Number, similar to Universal Identification Number used for people and inventory, see above, and often replaced by Universally unique identifier (UUID)
Other uses
User Intelligent Network, a type of network artificial intelligence, see, for example Personal communications network
Airport code for Quincy Regional Airport in Illinois, United States |
https://en.wikipedia.org/wiki/Chad%20%28paper%29 | Chad refers to fragments sometimes created when holes are made in a paper, card or similar synthetic materials, such as computer punched tape or punched cards. The word "chad" has been used both as a mass noun (as in "a pile of chad") and as a countable noun (pluralizing as in "many chads").
Etymology
The origin of the term chad is uncertain. Patent documents from the 1930s and 1940s show the word "chad", often in reference to punched tape used in telegraphy. These patents sometimes include synonyms such as "chaff" and "chips". A patent filing in 1930 included a "receptacle or chad box ... to receive the chips cut from the edge of the tape." A 1938 patent filing included a "chaff or chad chute" to collect the waste fragments. Both patents were assigned to Teletype Corporation.
The plural chads is attested from about 1939, along with chadless, meaning "without [loose] chad". Clear definitions for both terms are offered by Walter Bacon in a patent application filed in 1940 assigned to Bell Telephone Laboratories: "... In making these perforations, the perforator cuts small round pieces of paper, known in the art as chads, out of the tape. These chads are objectionable ... Chadless tape is prepared by feeding blank tape through a device which will not punch a complete circle in the tape but, instead, will only cut approximately three-quarters of the circumference of a circle ... thereby leaving a movable, or hinged, lid of paper in the tape."
In the New Hacker's Dictionary, two unattributed and likely humorous derivations for "chad" are offered, a back-formation from a personal name "Chadless" and an acronym for "Card Hole Aggregate Debris". Other etymologies claim derivation from the Scottish name for river gravel, chad, or the British slang for louse, chat.
Partially punched chad
When a chad is not fully detached, it is described by various terms corresponding to the level of modification from the unpunched state. The distinctions are of importance in counting cards used in voting. The following terms are sometimes used when describing a four-cornered chad:
Hanging chads are attached to the ballot at only one corner.
Swinging chads are attached to the ballot at two corners.
Tri-chads are attached to the ballot at three corners.
Dimpled chads are attached to the ballot at all four corners, but bear an indentation indicating the voter may have intended to mark the ballot. (Sometimes "pregnant" is used to indicate a greater mark than "dimpled".)
2000 United States presidential election controversy
In the 2000 United States presidential election, many Florida votes used Votomatic-style punched card ballots where incompletely punched holes resulted in partially punched chads: either a "hanging chad", where one or more corners were still attached, or a "fat chad" or "pregnant chad", where all corners were still attached, but an indentation appears to have been made. These votes were not counted by the tabulating machines. The aftermath |
https://en.wikipedia.org/wiki/Back%20Orifice | Back Orifice (often shortened to BO) is a computer program designed for remote system administration. It enables a user to control a computer running the Microsoft Windows operating system from a remote location. The name is a play on words on Microsoft BackOffice Server software. It can also control multiple computers at the same time using imaging.
Back Orifice has a client–server architecture. A small and unobtrusive server program is on one machine, which is remotely manipulated by a client program with a graphical user interface on another computer system. The two components communicate with one another using the TCP and/or UDP network protocols. In reference to the Leet phenomenon, this program commonly runs on port 31337.
The program debuted at DEF CON 6 on August 1, 1998 and was the brainchild of Sir Dystic, a member of the U.S. hacker organization Cult of the Dead Cow. According to the group, its purpose was to demonstrate the lack of security in Microsoft's Windows 9x series of operating systems.
Although Back Orifice has legitimate purposes, such as remote administration, other factors make it suitable for illicit uses. The server can hide from cursory looks by users of the system. Since the server can be installed without user interaction, it can be distributed as the payload of a Trojan horse.
For those and other reasons, the antivirus industry immediately categorized the tool as malware and appended Back Orifice to their quarantine lists. Despite this fact, it was widely used by script kiddies because of its simple GUI and ease of installation.
Two sequel applications followed it, Back Orifice 2000, released in 1999, and Deep Back Orifice by French Canadian hacking group QHA.
See also
Back Orifice 2000
Sub7
Trojan horse (computing)
Malware
Backdoor (computing)
Rootkit
MiniPanzer and MegaPanzer
File binder
References
External links
Common trojan horse payloads
Windows remote administration software
Cult of the Dead Cow software |
https://en.wikipedia.org/wiki/Earth%20Simulator | The is a series of supercomputers deployed at Japan Agency for Marine-Earth Science and Technology Yokohama Institute of Earth Sciences.
Earth Simulator (first generation)
The first generation of Earth Simulator, developed by the Japanese government's initiative "Earth Simulator Project", was a highly parallel vector supercomputer system for running global climate models to evaluate the effects of global warming and problems in solid earth geophysics. The system was developed for Japan Aerospace Exploration Agency, Japan Atomic Energy Research Institute, and Japan Marine Science and Technology Center (JAMSTEC) in 1997. Construction started in October 1999, and the site officially opened on 11 March 2002. The project cost 60 billion yen.
Built by NEC, ES was based on their SX-6 architecture. It consisted of 640 nodes with eight vector processors and 16 gigabytes of computer memory at each node, for a total of 5120 processors and 10 terabytes of memory. Two nodes were installed per 1 metre × 1.4 metre × 2 metre cabinet. Each cabinet consumed 20 kW of power. The system had 700 terabytes of disk storage (450 for the system and 250 for the users) and 1.6 petabytes of mass storage in tape drives. It was able to run holistic simulations of global climate in both the atmosphere and the oceans down to a resolution of 10 km. Its performance on the LINPACK benchmark was 35.86 TFLOPS, which was almost five times faster than the previous fastest supercomputer, ASCI White.
ES was the fastest supercomputer in the world from 2002 to 2004. Its capacity was surpassed by IBM's Blue Gene/L prototype on 29 September 2004.
Earth Simulator (second generation)
ES was replaced by the Earth Simulator 2 (ES2) in March 2009. ES2 is an NEC SX-9/E system, and has a quarter as many nodes each of 12.8 times the performance (3.2× clock speed, four times the processing resource per node), for a peak performance of 131 TFLOPS. With a delivered LINPACK performance of 122.4 TFLOPS, ES2 was the most efficient supercomputer in the world at that point. In November 2010, NEC announced that ES2 topped the Global FFT, one of the measures of the HPC Challenge Awards, with the performance number of 11.876 TFLOPS.
Earth Simulator (third generation)
ES2 was replaced by the Earth Simulator 3 (ES3) in March 2015. ES3 is a NEC SX-ACE system with 5120 nodes, and a performance of 1.3 PFLOPS.
ES3, from 2017 to 2018, ran alongside Gyoukou, a supercomputer with immersion cooling that can achieve up to 19 PFLOPS.
Earth Simulator (fourth generation)
The Earth Simulator 4 (ES4) uses AMD EPYC processors, with acceleration by the NEC SX-Aurora TSUBASA Vector Engine and NVIDIA Ampere A100 GPUs.
See also
Supercomputing in Japan
Attribution of recent climate change
NCAR
HadCM3
EdGCM
References
External links
ES for kids
2002 in science
Effects of climate change
NEC supercomputers
Numerical climate and weather models
One-of-a-kind computers
Scientific simulation software
Vect |
https://en.wikipedia.org/wiki/Christopher%20J.%20Date | Chris Date (born 18 January 1941) is an independent author, lecturer, researcher, and consultant, specializing in relational database theory.
Biography
Chris Date attended High Wycombe Royal Grammar School (U.K.) from 1951 to 1958 and received his BA in Mathematics from Cambridge University (U.K.) in 1962. He entered the computer business as a mathematical programmer at Leo Computers Ltd. (London), where he quickly moved into education and training. In 1966, he earned his master's degree at Cambridge, and, in 1967, he joined IBM Hursley (UK) as a computer programming instructor. Between 1969 and 1974, he was a principal instructor in IBM's European education program.
While working at IBM he was involved in technical planning and design for the IBM products SQL/DS and DB2.
He was also involved with Edgar F. Codd’s relational model for database management.
He left IBM in 1983 and has written extensively of the relational model, in association with Hugh Darwen.
As of 2007 his book An Introduction to Database Systems, currently in its 8th edition, has sold well over 700,000 copies not counting translations, and is used by several hundred colleges and universities worldwide.
He is also the author of many other books on data management, most notably Databases, Types, and the Relational Model, subtitled and commonly referred to as The Third Manifesto, currently in its third edition (note that earlier editions were titled differently, but maintained the same subtitle), a proposal for the future direction of DBMSs.
Works
Chris Date is the author of several books, including:
An Introduction to Database Systems, 2004,
A Guide to the SQL standard, 4th ed., Addison Wesley, USA 1997,
Databases, Types, and the Relational Model, The Third Manifesto (with Hugh Darwen), 2007,
Temporal Data & the Relational Model, 2003,
Database in Depth: Relational Theory for Practitioners, 2005,
Several volumes of Relational Database Writings: , , , .
What Not How: The Business Rules Approach to Application Development, 2000,
The Database Relational Model: A Retrospective Review and Analysis, 2001,
SQL and Relational Theory, 2nd Edition: How to Write Accurate SQL Code, 2011, .
In recent years he has published articles with Fabian Pascal at Database Debunkings.
See also
Nikos Lorentzos
David McGoveran
Fabian Pascal
Lex de Haan
References
IBM employees
Database researchers
1941 births
Living people
People from Watford
People educated at the Royal Grammar School, High Wycombe |
https://en.wikipedia.org/wiki/Hugh%20Darwen | Hugh Darwen is a computer scientist who was an employee of IBM United Kingdom from 1967 to 2004, and has been involved in the development of the relational model.
Work
From 1978 to 1982 he was a chief architect on Business System 12, a database management system that faithfully embraced the principles of the relational model. He worked closely with Christopher J. Date and represented IBM at the ISO SQL committees (JTC1 SC32 WG3 Database languages, WG4 SQL/MM) until his retirement from IBM. Darwen is the author of The Askew Wall and co-author of The Third Manifesto, a proposal for serving object-oriented programs with purely relational databases without compromising either side and getting the best of both worlds, arguably even better than with so-called object-oriented databases.
From 2004 to 2013 he lectured on relational databases at the Department of Computer Science, University of Warwick (UK), and from 1989 to 2014 was a tutor and consultant for the Open University (UK) where he was awarded a MUniv honorary degree for academic and scholarly distinction. He was also awarded a DTech (Doctor in Technology) honorary degree by the University of Wolverhampton. He later taught a database language designed by Chris Date and himself called Tutorial D.
Bridge
He has written two books on the card game bridge, both on the subject of , on which he has a website. Alan Truscott has called him "the world's leading authority" on composed bridge problems. He was responsible for the double dummy column in Bridge Magazine and other UK bridge publications from 1965 to 2004.
Publications
His early works were published under the pseudonym of Andrew Warden: both names are anagrams of his surname.
, 213 pp.
, 331 pp.
.
, 231 pp.
, 169 pp.
, 67 pp.
, 496 pp.
, 547 pp.
, 422 pp.
, 572 pp.
, 548 pp.
References
External links
at University of Warwick
Double Dummy Corner – Darwen's website devoted to problems in the play of the cards at bridge
The Third Manifesto (Date & Darwen 1995) – with material related to the book and links to Darwen's seminar and lecture slides
Andrew Warden at LC Authorities with 1 catalogue record (1990 collection)
1943 births
Living people
IBM employees
Academics of the University of Warwick
Contract bridge writers
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/IBM%20Business%20System%2012 | Business System 12, or simply BS12, was one of the first fully relational database management systems, designed and implemented by IBM's Bureau Service subsidiary at the company's international development centre in Uithoorn, Netherlands. Programming started in 1978 and the first version was delivered in 1982. It was never widely used and essentially disappeared soon after the division was shut down in 1985, possibly because IBM and other companies settled on SQL as the standard.
BS12's lasting contribution to history was the use of a new query language based on ISBL, created at IBM's UK Scientific Centre. Developers of the famous System R underway in the US at the same time were also consulted on certain matters concerning the engine, but the BS12 team rejected SQL unequivocally, being convinced that this apparently unsound and difficult-to-use language (which at that time was also relationally incomplete) would never catch on.
BS12 included a number of interesting features that have yet to appear on most SQL-based systems, some a consequence of following the ISBL precedent, others due to deliberate design. For instance, a view could be parameterised and parameters could be of type TABLE. Thus, a view could in effect be a new relational operator defined in terms of the existing operators. Codd's DIVIDE operator was in fact implemented that way.
Another feature that could have easily been included in SQL systems was the support for update operations on the catalog tables (system tables describing the structure of the database, as in SQL). A new table could be created by inserting a row into the TABLES catalog, and then columns added to it by inserting into COLUMNS.
In addition, BS12 was ahead of SQL in supporting user-defined functions and procedures, using a Turing complete sublanguage, triggers, and a simple "call" interface for use by application programs, all in its very first release in 1982.
Example
Sample query for determining which departments are over their salary budgets:
T1 = SUMMARY(EMP, GROUP(DEPTNUM), EMPS=COUNT, SALSUM=SUM(SALARY))
T2 = JOIN(T1, DEPT)
T3 = SELECT(T2, SALSUM > BUDGET)
Note the "natural join" on the common column, DEPTNUM. Although some SQL dialects support natural joins, for familiarity, the example will show only a "traditional" join. Here is the equivalent SQL for comparison:
-- (SQL version)
SELECT d.Deptnum, Count(*) as Emps,
Sum(e.Salary) as Salsum, Budget
FROM Emp as e
JOIN Dept as d ON e.Deptnum = d.Deptnum
GROUP BY d.Deptnum, Budget
HAVING Sum(e.Salary) > Budget
References
External links
Business System 12 (BS12)
TQL/SMEQL - A draft query language influenced by BS12
Business System 12
Proprietary database management systems
1982 software
Query languages |
https://en.wikipedia.org/wiki/Ingres%20%28database%29 | Ingres Database ( ) is a proprietary SQL relational database management system intended to support large commercial and government applications.
Actian Corporation, which announced April 2018 that it is being acquired by HCL Technologies, controls the development of Ingres and makes certified binaries available for download, as well as providing worldwide support. There was an open source release of Ingres but it is no longer available for download from Actian. However, there is a version of the sourcecode still available on GitHub.
In its early years, Ingres was an important milestone in the history of database development. Ingres began as a research project at UC Berkeley, starting in the early 1970s and ending in 1985. During this time Ingres remained largely similar to IBM's seminal System R in concept; it differed in more permissive licensing of source code, in being based largely on DEC machines, both under
UNIX and VAX/VMS, and in providing QUEL as a query language instead of SQL. QUEL was considered at the time to run truer to Edgar F. Codd's relational algebra (especially concerning composability), but SQL was easier to parse and less intimidating for those without a formal background in mathematics.
When ANSI preferred SQL over QUEL as part of the 1986 SQL standard (SQL-86), Ingres became less competitive against rival products such as Oracle until future Ingres versions also provided SQL. Many companies spun off of the original Ingres technology, including Actian itself, originally known as Relational Technology Inc., and the NonStop SQL database originally developed by Tandem Computers but now offered by Hewlett Packard Enterprise.
History
Ingres began as a research project at the University of California, Berkeley, starting in the early 1970s and ending in 1985. The original code, like that from other projects at Berkeley, was available at minimal cost under a version of the BSD license. Ingres spawned a number of commercial database applications, including Sybase, Microsoft SQL Server, NonStop SQL and a number of others.
Postgres (Post Ingres), a project which started in the mid-1980s, later evolved into PostgreSQL. It is ACID compatible and is fully transactional (including all DDL statements) and is part of the Lisog open-source stack initiative.
1970s
In 1973 when the System R project was getting started at IBM, the research team released a series of papers describing the system they were building. Two scientists at Berkeley, Michael Stonebraker and Eugene Wong, became interested in the concept after reading the papers, and started a relational database research project of their own.
They had already raised money for researching a geographic database system for Berkeley's economics group, which they called Ingres, for INteractive Graphics REtrieval System. They decided to use this money to fund their relational project instead, and used this as a seed for a new and much larger project. They decided to re-use the original |
https://en.wikipedia.org/wiki/Xenix | Xenix is a discontinued version of the Unix operating system for various microcomputer platforms, licensed by Microsoft from AT&T Corporation in the late 1970s. The Santa Cruz Operation (SCO) later acquired exclusive rights to the software, and eventually replaced it with SCO UNIX (now known as SCO OpenServer).
In the mid-to-late 1980s, Xenix was the most common Unix variant, measured according to the number of machines on which it was installed.
Microsoft chairman Bill Gates said at Unix Expo in 1996 that, for a long time, Microsoft had the highest-volume AT&T Unix license.
History
Bell Labs, the developer of Unix, was part of the regulated Bell System and could not sell Unix directly to most end users (academic and research institutions excepted); it could, however, license it to software vendors who would then resell it to end users (or their own resellers), combined with their own added features. Microsoft, which expected that Unix would be its operating system of the future when personal computers became powerful enough, purchased a license for Version 7 Unix from AT&T in 1978, and announced on August 25, 1980, that it would make the software available for the 16-bit microcomputer market. Because Microsoft was not able to license the "Unix" name itself, the company gave it an original name.
Microsoft called Xenix "a universal operating environment". It did not sell Xenix directly to end users, but licensed the software to OEMs such as IBM, Intel, Management Systems Development, Tandy, Altos Computer, SCO, and Siemens (SINIX) which then ported it to their own proprietary computer architectures.
In 1981, Microsoft said the first version of Xenix was "very close to the original Unix version 7 source" on the PDP-11, and later versions were to incorporate its own fixes and improvements. The company stated that it intended to port the operating system to the Zilog Z8000 series, Digital LSI-11, Intel 8086 and 80286, Motorola 68000, and possibly "numerous other processors", and provide Microsoft's "full line of system software products", including BASIC and other languages. The first port was for the Z8001 16-bit processor: the first customer ship was January 1981 for Central Data Corporation of Illinois, followed in March 1981 by Paradyne Corporation's Z8001 product.
The first 8086 port was for the Altos Computer Systems' non-PC-compatible 8600-series computers (first customer ship date Q1 1982).
Intel sold complete computers with Xenix under their Intel System 86 brand (with specific models such as 86/330 or 86/380X); they also offered the individual boards that made these computers under their iSBC brand. This included processor boards like iSBC 86/12 and also MMU boards such as the iSBC 309. The first Intel Xenix systems shipped in July 1982. Tandy more than doubled the Xenix installed base when it made TRS-Xenix the default operating system for its TRS-80 Model 16 68000-based computer in early 1983, and was the largest Unix vendor in 1984. |
https://en.wikipedia.org/wiki/Dead%20code | The term dead code has multiple definitions. Some use the term to refer to code (i.e. instructions in memory) which can never be executed at run-time.
In some areas of computer programming, dead code is a section in the source code of a program which is executed but whose result is never used in any other computation. The execution of dead code wastes computation time and memory.
While the result of a dead computation may never be used, it may raise exceptions or affect some global state, thus removal of such code may change the output of the program and introduce unintended bugs. Compiler optimizations are typically conservative in their approach to dead-code removal if there is any ambiguity as to whether removal of the dead code will affect the program output. The programmer may aid the compiler in this matter by making additional use of static and/or inline functions and enabling the use of link-time optimization.
Example
int foo (int iX, int iY)
{
int iZ = iX/iY;
return iX*iY;
}
In the above example, although the division of by is computed and never used, it will throw an exception when a division by zero occurs. Therefore, the removal of the dead code may change the output of the program.
Analysis
Dead-code elimination is a form of compiler optimization in which dead code is removed from a program. Dead code analysis can be performed using live-variable analysis, a form of static-code analysis and data-flow analysis. This is in contrast to unreachable code analysis which is based on control-flow analysis.
The dead-code elimination technique is in the same class of optimizations as unreachable code elimination and redundant code elimination.
In large programming projects, it is sometimes difficult to recognize and eliminate dead code, particularly when entire modules become dead. Test scaffolding can make it appear that the code is still live, and at times, contract language can require delivery of the code even when the code is no longer relevant.
Some IDEs (such as Xcode, Visual Studio 2010 and Eclipse Galileo) have the ability to locate dead code during the compiling stage.
While most optimization techniques seek to remove dead code in an implementation, in extreme forms of optimization for size it may sometimes be desirable to deliberately introduce and carefully shape seemingly dead code, when it allows to fold otherwise unrelated code sections together (and thereby reduce their combined size) so that the extra code will effectively not harm the first path of execution through the code but is used to carry out the actions necessary for the alternative paths of execution, for which other sections of the code may become dead code. On a more functional level, this can be seen as both, artificially introduction of harmless/useful side-effects and reduction of the redundancy of the code, but it can also be used down to opcode level in order to allow the usage of shorter instructions, which would not be possible when folding |
https://en.wikipedia.org/wiki/Corel%20Ventura | Ventura Publisher was the first popular desktop publishing package for IBM PC compatible computers running the GEM extension to the DOS operating system. The software was originally developed by Ventura Software, a small software company founded by John Meyer, Don Heiskell, and Lee Jay Lorenzen, all of whom met while working at Digital Research. It ran under an included run-time copy of Digital Research's GEM.
History
The first version of Ventura Publisher was released in late 1986, with worldwide distribution by Xerox. Xerox would later purchase all rights to the source code from Ventura Software in 1990.
Ventura Publisher had some text editing and line drawing capabilities of its own, but it was designed to interface with a wide variety of word processing and graphics programs rather than to supplant them. To that end, text was stored in, loaded from, and saved back to word processor files in the native formats of a variety of word processors, including WordPerfect, WordStar, and early versions of Microsoft Word, rather than being incorporated into the chapter files. This allowed users to continue using their favorite word processors for major text changes, spelling checks, and so forth. Paragraphs other than default body text were tagged with descriptive tagnames that were entirely user-defined, and characters and attributes that have no native equivalent in a given word processor were represented with standardized sequences of characters. When working with the files outside of Ventura Publisher, these paragraph tags and special character and attribute codes could be freely changed, the same as any other text. These tags looked very much like HTML tags.
Ventura Publisher was the first major typesetting program to incorporate the concept of an implicit "underlying page" frame, and one of the first to incorporate a strong "style sheet" concept. It produced documents with a high degree of internal consistency, unless specifically overridden by the user. Its concepts of free-flowing text, paragraph tagging, and codes for attributes and special characters anticipated similar concepts inherent in HTML and XML. Likewise, its concept of "publication" files that tie together "chapter" files gave it the ability to handle documents hundreds (or even thousands) of pages in length as easily as a four-page newsletter.
The major strengths of the original DOS/GEM edition of Ventura Publisher were:
Its ability to run, with reasonable response times, on a wide range of hardware (including 8086- and 286-based computers)
Its ability to produce, by default, documents with a high degree of internal consistency
Its automatic re-exporting of text to native word processor formats
Its ability to print to a wide variety of devices, including PostScript, PCL, and InterPress laser printers and imagesetters, as well as certain popular dot-matrix and inkjet printers.
The original Ventura Software ceased operations in February 1990, and a new Ventura Software Inc. |
https://en.wikipedia.org/wiki/Cargo%20cult%20programming | Cargo cult programming is a style of computer programming characterized by the ritual inclusion of code or program structures that serve no real purpose. Cargo cult programming is symptomatic of a programmer not understanding either a bug they were attempting to solve or the apparent solution (compare shotgun debugging, deep magic). The term cargo cult programmer may apply when anyone inexperienced with the problem at hand copies some program code from one place to another with little understanding of how it works or whether it is required.
Cargo cult programming can also refer to the practice of applying a design pattern or coding style blindly without understanding the reasons behind that design principle. Some examples are adding unnecessary comments to self-explanatory code, overzealous adherence to the conventions of a programming paradigm, or adding deletion code for objects that garbage collection automatically collects.
Origin
The term cargo cult as an idiom originally referred to aboriginal religions that grew up in the South Pacific after World War II. The practices of these groups centered on building elaborate mock-ups of airplanes and military landing strips in the hope of summoning the god-like beings who arrived in airplanes that had brought marvelous cargo during the war. In recent decades, anthropology has distanced itself from the term "cargo cult," which is now seen as having been reductively applied to a lot of complicated and disparate social and religious movements that arose from the stress and trauma of colonialism, and sought to attain much more varied and amorphous goals—things like self-determination—than material cargo.
Use of the term in computer programming probably derives from Richard Feynman's characterization of certain practices as cargo cult science.
Cargo cult software engineering
A related term to cargo cult programming in software engineering is cargo cult software engineering, coined by Steve McConnell.
McConnell describes software development organizations that attempt to emulate more successful development houses, either by slavishly following a software development process without understanding the reasoning behind it, or by attempting to emulate a commitment-oriented development approach (in which software developers devote large amounts of time and energy toward seeing their projects succeed) by mandating the long hours and unpaid overtime, while in successful companies these might instead be consequences of high motivation instead of causes of success.
In both cases, McConnell contends that competence ultimately determines whether a project succeeds or fails, regardless of the development approach taken; furthermore, he claims that incompetent "imposter organizations" (which merely imitate the form of successful software development organizations) are in fact engaging in what he calls cargo cult software engineering.
See also
Copy and paste programming
Cargo cult science
Magical thinking
Magic |
https://en.wikipedia.org/wiki/Merops | Merops may refer to:
Merops (mythology), the name of several figures from Greek mythology
Merops (genus), a genus of bee-eaters.
MEROPS, an on-line database for peptidases |
https://en.wikipedia.org/wiki/Lotus%20Symphony%20%28MS-DOS%29 | Lotus Symphony was an integrated software package for creating and editing text, spreadsheets, charts and other documents on the MS-DOS operating systems. It was released by Lotus Development as a follow-on to its popular spreadsheet program, Lotus 1-2-3, and was produced from 1984–1992. Lotus Jazz on the Apple Macintosh was a sibling product.
IBM revived the name Lotus Symphony in 2007 for a new office suite based on OpenOffice.org, but the two programs are otherwise unrelated.
History
Lotus 1-2-3 had originally been billed as an integrated product with spreadsheet, database and graphing functions (hence the name "1-2-3"). Other products described as "integrated", such as Ashton-Tate's Framework and AppleWorks, from Apple Computer, normally included word processor functionality. Symphony was Lotus' response.
Overview
Symphony for MS-DOS is a program that loads entirely into memory on startup, and can run as an MS-DOS task on versions of Microsoft Windows (3.x/95/98/ME). Using the Command Prompt, and a .pif file, Symphony can also be used on Windows XP and its successors.
Using ALT+F10 the user can alternate among the five "environments" of the program, each a rendering of the same underlying data. The environments are:
SHEET, a spreadsheet program very similar to 1-2-3
DOC, a word processor
GRAPH, a graphical charting program
FORM, a table-based database management system
COMM, a communications program
Several "add-in applications" can be "attached" and activated, extending Symphony's capabilities, including a powerful macro manager, a document outliner, a spell-checker, statistics, various communications configurations, and a tutorial, which demonstrates Symphony usage by running macros. The program allows the screen to be split into panes and distinct Windows, showing different views of the underlying data simultaneously, each of which can display any of the five environments. The user is then able to see that changes made in one environment are reflected in others simultaneously, perhaps the package's most interesting feature.
All the data that Symphony handles is kept in spreadsheet-like cells. The other environments—word processing, database, communications, graphics—in essence only change the display format and focus of that data (including available menus, special keys, and functionality), which can be saved and retrieved as .WR1 files.
Symphony was designed to work completely in the standard 640k of conventional memory, supplemented by any expanded memory. Similar and competitive packages included SmartWare, Microsoft Works, Context MBA, Framework, Enable and Ability Office.
Symphony's spreadsheet engine was similar to, but not the same as the one used in Lotus 1-2-3, once the most popular of its kind. Additional enhancements included:
The ability to create unique application looking spreadsheets using customizable macro driven menus and display Windows, the result being menu driven applications that, to the user, resembled litt |
https://en.wikipedia.org/wiki/Killer%20application | A killer application (often shortened to killer app) is any software that is so necessary or desirable that it proves the core value of some larger technology, such as its host computer hardware, video game console, software platform, or operating system. Consumers would buy the host platform just to access that application, possibly substantially increasing sales of its host platform.
Examples
Although the term was coined in the late 1980s one of the first retroactively recognized examples of a killer application is the VisiCalc spreadsheet, released in 1979 for the Apple II series computer. Because it was not released for other computers for 12 months, people spent for the software first, then $2,000 to $10,000 (equivalent to $ to $) on the requisite Apple II. BYTE wrote in 1980, "VisiCalc is the first program available on a microcomputer that has been responsible for sales of entire systems", and Creative Computings VisiCalc review is subtitled "reason enough for owning a computer". Others also developed software, such as EasyWriter, for the Apple II first because of its increasing sales.
The co-creator of WordStar, Seymour Rubinstein, argued that the honor of the first killer app should go to that popular word processor, given that it came out a year before VisiCalc and that it gave a reason for people to buy a computer. However, whereas WordStar could be considered an incremental improvement (albeit a large one) over smart typewriters like the IBM Electronic Selectric Composer, VisiCalc, with its ability to instantly recalculate rows and columns, introduced an entirely new paradigm and capability.
Although released four years after VisiCalc, Lotus 1-2-3 also benefited sales of the IBM PC. Noting that computer purchasers did not want PC compatibility as much as compatibility with certain PC software, InfoWorld suggested "let's tell it like it is. Let's not say 'PC compatible', or even 'MS-DOS compatible'. Instead, let's say '1-2-3 compatible'."
The UNIX Operating System became a killer application for the DEC PDP-11 and VAX-11 minicomputers during roughly 1975–1985. Many of the PDP-11 and VAX-11 processors never ran DEC's operating systems (RSTS or VAX/VMS), but instead, they ran UNIX, which was first licensed in 1975. To get a virtual-memory UNIX (BSD 3.0), requires a VAX-11 computer. Many universities wanted a general-purpose timesharing system that would meet the needs of students and researchers. Early versions of UNIX included free compilers for C, Fortran, and Pascal, at a time when offering even one free compiler was unprecedented. From its inception, UNIX drives high-quality typesetting equipment and later PostScript printers using the nroff/troff typesetting language, and this was also unprecedented. UNIX is the first operating system offered in source-license form (a university license cost only $10,000, less than a PDP-11), allowing it to run on an unlimited number of machines, and allowing the machines to interface to any ty |
https://en.wikipedia.org/wiki/Information%20Age | The Information Age (also known as the Computer Age, Digital Age, Silicon Age, New Media Age, or Media Age) is a historical period that began in the mid-20th century. It is characterized by a rapid shift from traditional industries, as established during the Industrial Revolution, to an economy centered on information technology. The onset of the Information Age has been linked to the development of the transistor in 1947, the optical amplifier in 1957, and Unix time, which began on January 1, 1970. These technological advances have had a significant impact on the way information is processed and transmitted.
According to the United Nations Public Administration Network, the Information Age was formed by capitalizing on computer microminiaturization advances, which led to modernized information systems and internet communications as the driving force of social evolution.
Overview of early developments
Library expansion and Moore's law
Library expansion was calculated in 1945 by Fremont Rider to double in capacity every 16 years where sufficient space made available. He advocated replacing bulky, decaying printed works with miniaturized microform analog photographs, which could be duplicated on-demand for library patrons and other institutions.
Rider did not foresee, however, the digital technology that would follow decades later to replace analog microform with digital imaging, storage, and transmission media, whereby vast increases in the rapidity of information growth would be made possible through automated, potentially-lossless digital technologies. Accordingly, Moore's law, formulated around 1965, would calculate that the number of transistors in a dense integrated circuit doubles approximately every two years.
By the early 1980s, along with improvements in computing power, the proliferation of the smaller and less expensive personal computers allowed for immediate access to information and the ability to share and store it. Connectivity between computers within organizations enabled access to greater amounts of information.
Information storage and Kryder's law
The world's technological capacity to store information grew from 2.6 (optimally compressed) exabytes (EB) in 1986 to 15.8 EB in 1993; over 54.5 EB in 2000; and to 295 (optimally compressed) EB in 2007. This is the informational equivalent to less than one 730-megabyte (MB) CD-ROM per person in 1986 (539 MB per person); roughly four CD-ROM per person in 1993; twelve CD-ROM per person in the year 2000; and almost sixty-one CD-ROM per person in 2007. It is estimated that the world's capacity to store information has reached 5 zettabytes in 2014, the informational equivalent of 4,500 stacks of printed books from the earth to the sun.
The amount of digital data stored appears to be growing approximately exponentially, reminiscent of Moore's law. As such, Kryder's law prescribes that the amount of storage space available appears to be growing approximately exponentially.
Informa |
https://en.wikipedia.org/wiki/OK%20Computer | OK Computer is the third studio album by the English rock band Radiohead, released in the UK on 16 June 1997 by EMI. With their producer, Nigel Godrich, Radiohead recorded most of OK Computer in their rehearsal space in Oxfordshire and the historic mansion of St Catherine's Court in Bath in 1996 and early 1997. They distanced themselves from the guitar-centred, lyrically introspective style of their previous album, The Bends. OK Computers abstract lyrics, densely layered sound and eclectic influences laid the groundwork for Radiohead's later, more experimental work.
The album's lyrics depict a world fraught with rampant consumerism, social alienation, emotional isolation and political malaise; in this capacity, OK Computer is said to have prescient insight into the mood of 21st-century life. The band used unconventional production techniques, including natural reverberation, and no audio separation. Strings were recorded at Abbey Road Studios in London. Most of the album was recorded live.
Despite lowered sales estimates by EMI, who deemed the record uncommercial and difficult to market, OK Computer reached number one on the UK Albums Chart and debuted at number 21 on the Billboard 200, Radiohead's highest album entry on the US charts at the time, and was soon certified five times platinum in the UK and double platinum in the US. "Paranoid Android", "Karma Police", "Lucky" and "No Surprises" were released as singles. The album expanded Radiohead's international popularity and has sold at least 7.8 million units worldwide.
OK Computer received acclaim and has been cited as one of the greatest albums of all time. It was nominated for Album of the Year and won Best Alternative Music Album at the 1998 Grammy Awards. It was also nominated for Best British Album at the 1998 Brit Awards. The album initiated a stylistic shift in British rock away from Britpop toward melancholic, atmospheric alternative rock that became more prevalent in the next decade. In 2014, it was included by the United States Library of Congress in the National Recording Registry as "culturally, historically, or aesthetically significant". A remastered version with additional tracks, OKNOTOK 1997 2017, was released in 2017, marking the album's twentieth anniversary. In 2019, in response to an internet leak, Radiohead released MiniDiscs [Hacked], comprising hours of additional material.
Background
In 1995, Radiohead toured in support of their second album, The Bends (1995). Midway through the tour, Brian Eno commissioned them to contribute a song to The Help Album, a charity compilation organised by War Child; the album was to be recorded over the course of a single day, 4 September 1995, and rush-released that week. Radiohead recorded "Lucky" in five hours with Nigel Godrich, who had engineered The Bends and produced several Radiohead B-sides. Godrich said of the session: "Those things are the most inspiring, when you do stuff really fast and there's nothing to lose. We left f |
https://en.wikipedia.org/wiki/Timeline%20of%20computing%201990%E2%80%931999 |
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
References
External links
A Brief History of Computing, by Stephen White. The present article is a modified version of his timeline, used with permission.
1990
C01
Computing |
https://en.wikipedia.org/wiki/Timeline%20of%20computing%201980%E2%80%931989 |
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
References
External links
A Brief History of Computing, by Stephen White. The present article is a modified version of his timeline, used with permission.
1980
01
C01 |
https://en.wikipedia.org/wiki/Timeline%20of%20computing%201950%E2%80%931979 |
1950s
1960s
1970s
See also
Information revolution
Notes
References
External links
A Brief History of Computing, by Stephen White. A computer history site; the present article is a modified version of his timeline, used with permission.
1950
.
.
.
1950s in technology
1960s in technology
1970s in technology |
https://en.wikipedia.org/wiki/Timeline%20of%20computing%20hardware%20before%201950 | This article presents a detailed timeline of events in the history of computing software and hardware: from prehistory until 1949. For narratives explaining the overall developments, see History of computing.
Prehistory–antiquity
Medieval–1640
1641–1850
1851–1930
1931–1940
1941–1949
Computing timeline
Timeline of computing
1950–1979
1980–1989
1990–1999
2000–2009
2010–2019
2020–present
History of computing hardware
Notes
References
External links
A Brief History of Computing, by Stephen White. An excellent computer history site; the present article is a modified version of his timeline, used with permission.
The Evolution of the Modern Computer (1934 to 1950): An Open Source Graphical History, article from Virtual Travelog
Timeline: exponential speedup since first automatic calculator in 1623 by Jürgen Schmidhuber, from "The New AI: General & Sound & Relevant for Physics, In B. Goertzel and C. Pennachin, eds.: Artificial General Intelligence, pp. 175–198, 2006."
Computing History Timeline, a photographic gallery on computing history
Computer History by Computer Hope
Timeline of Computer History by Computer History Museum
1949
History of computing hardware |
https://en.wikipedia.org/wiki/Network%20layer | In the seven-layer OSI model of computer networking, the network layer is layer 3. The network layer is responsible for packet forwarding including routing through intermediate routers.
Functions
The network layer provides the means of transferring variable-length network packets from a source to a destination host via one or more networks. Within the service layering semantics of the OSI (Open Systems Interconnection) network architecture, the network layer responds to service requests from the transport layer and issues service requests to the data link layer.
Functions of the network layer include:
Connectionless communication
For example, Internet Protocol is connectionless, in that a data packet can travel from a sender to a recipient without the recipient having to send an acknowledgement. Connection-oriented protocols exist at other, higher layers of the OSI model.
Host addressing
Every host in the network must have a unique address that determines where it is. This address is normally assigned from a hierarchical system. For example, you can be :
"Fred Murphy" to people in your house,
"Fred Murphy, 1 Main Street" to Dubliners,
"Fred Murphy, 1 Main Street, Dublin" to people in Ireland,
"Fred Murphy, 1 Main Street, Dublin, Ireland" to people anywhere in the world.
On the Internet, addresses are known as IP addresses (Internet Protocol).
Message forwarding
Since many networks are partitioned into subnetworks and connect to other networks for wide-area communications, networks use specialized hosts, called gateways or routers, to forward packets between networks.
Relation to TCP/IP model
The TCP/IP model describes the protocols used by the Internet. The TCP/IP model has a layer called the Internet layer, located above the link layer. In many textbooks and other secondary references, the TCP/IP Internet layer is equated with the OSI network layer. However, this comparison is misleading, as the allowed characteristics of protocols (e.g., whether they are connection-oriented or connection-less) placed into these layers are different in the two models. The TCP/IP Internet layer is in fact only a subset of functionality of the network layer. It describes only one type of network architecture, the Internet.
Fragmentation of Internet Protocol packets
The network layer is responsible for fragmentation and reassembly for IPv4 packets that are larger than the smallest MTU of all the intermediate links on the packet's path to its destination. It is the function of routers to fragment packets if needed, and of hosts to reassemble them if received.
Conversely, IPv6 packets are not fragmented during forwarding, but the MTU supported by a specific path must still be established, to avoid packet loss. For this, Path MTU discovery is used between endpoints, which makes it part of the Transport layer, instead of this layer.
Protocols
The followin |
https://en.wikipedia.org/wiki/Abstract-Type%20and%20Scheme-Definition%20Language | Abstract-Type and Scheme-Definition Language (ASDL) is a computer language developed as part of ESPRIT project GRASPIN, as a basis for generating language-based editors and environments. It combines an object-oriented type system, syntax-directed translation schemes and a target-language interface.
References
ASDL - An Object-Oriented Specification Language for Syntax-Directed Environments", M.L. Christ-Neumann et al., European Software Eng Conf, Strasbourg, Sept 1987, pp. 77–85
Domain-specific programming languages |
https://en.wikipedia.org/wiki/ASDL | ASDL may refer to:
Abstract-Type and Scheme-Definition Language, a computer language
Analytical Sciences Digital Library, one of several digital libraries in the US National Science Digital Library
See also
Asymmetric digital subscriber line (ADSL, a common misspelling) |
https://en.wikipedia.org/wiki/AWT | AWT may stand for:
The Abstract Window Toolkit, part of the Java programming language
Antony Worrall Thompson, the British chef
Aphrodite World Tour, a 2011 concert tour by Australian pop/dance singer Kylie Minogue
Armathwaite railway station, England; National Rail station code AWT
Airborne wind turbine, a concept design wind turbine
Withholding tax, Automatic Withholding Tax (also known as WHT)
Advanced World Transport, Czech cargo railway operator
Alternative Waste Treatment, a subset of waste treatment. List of solid waste treatment technologies |
https://en.wikipedia.org/wiki/Application%20Configuration%20Access%20Protocol | The Application Configuration Access Protocol (ACAP) is a protocol for storing and synchronizing general configuration and preference data. It was originally developed so that IMAP clients can easily access address books, user options, and other data on a central server and be kept in synch across all clients.
Two International ACAP Conferences were held, one in Pittsburgh, PA, USA, in 1997, and the other at Qualcomm Incorporated, San Diego, CA, USA, in February 1998.
ACAP grew to encompass several other areas, including bookmark management for web browsers—it's effectively a roaming protocol for Internet applications. ACAP is in use by at least four clients and three servers to varying degrees, but it has never achieved the popularity of Lightweight Directory Access Protocol or SyncML. It is a deceptively simple protocol, but the combination of three key features, hierarchical data, fine-grained access control, and "contexts" or saved searches with notification, has caused serious problems for server implementors.
Unlike LDAP, ACAP was designed for frequent writes, disconnected mode access (meaning clients can go offline and then resynchronize later), and so on. It also handles data inheritance, sometimes known as stacking, which provides easy creation of defaults.
The IETF ACAP Working Group ceased activity in April 2004, having released two RFCs, ("ACAP — Application Configuration Access Protocol") and ("Anonymous SASL Mechanism").
See also
Kolab
iCalendar
WebDAV
CalDAV
IMSP
References
"Your E-Mail Is Obsolete", Byte, February 1997
External links
CMU smlacapd
Internet mail protocols |
https://en.wikipedia.org/wiki/Berkeley%20sockets | Berkeley sockets is an application programming interface (API) for Internet sockets and Unix domain sockets, used for inter-process communication (IPC). It is commonly implemented as a library of linkable modules. It originated with the 4.2BSD Unix operating system, which was released in 1983.
A socket is an abstract representation (handle) for the local endpoint of a network communication path. The Berkeley sockets API represents it as a file descriptor (file handle) in the Unix philosophy that provides a common interface for input and output to streams of data.
Berkeley sockets evolved with little modification from a de facto standard into a component of the POSIX specification. The term POSIX sockets is essentially synonymous with Berkeley sockets, but they are also known as BSD sockets, acknowledging the first implementation in the Berkeley Software Distribution.
History and implementations
Berkeley sockets originated with the 4.2BSD Unix operating system, released in 1983, as a programming interface. Not until 1989, however, could the University of California, Berkeley release versions of the operating system and networking library free from the licensing constraints of AT&T Corporation's proprietary Unix.
All modern operating systems implement a version of the Berkeley socket interface. It became the standard interface for applications running in the Internet. Even the Winsock implementation for MS Windows, created by unaffiliated developers, closely follows the standard.
The BSD sockets API is written in the C programming language. Most other programming languages provide similar interfaces, typically written as a wrapper library based on the C API.
BSD and POSIX sockets
As the Berkeley socket API evolved and ultimately yielded the POSIX socket API, certain functions were deprecated or removed and replaced by others. The POSIX API is also designed to be reentrant and supports IPv6.
Alternatives
The STREAMS-based Transport Layer Interface (TLI) API offers an alternative to the socket API. Many systems that provide the TLI API also provide the Berkeley socket API.
Non-Unix systems often expose the Berkeley socket API with a translation layer to a native networking API. Plan 9 and Genode use file-system APIs with control files rather than file-descriptors.
Header files
The Berkeley socket interface is defined in several header files. The names and content of these files differ slightly between implementations. In general, they include:
Socket API functions
The Berkeley socket API typically provides the following functions:
socket() creates a new socket of a certain type, identified by an integer number, and allocates system resources to it.
bind() is typically used on the server side, and associates a socket with a socket address structure, i.e. a specified local IP address and a port number.
listen() is used on the server side, and causes a bound TCP socket to enter listening state.
connect() is used on the client side, and a |
https://en.wikipedia.org/wiki/Acceptable%20use%20policy | An acceptable use policy (AUP), acceptable usage policy or fair use policy is a set of rules applied by the owner, creator or administrator of a computer network, website, or service that restricts the ways in which the network, website or system may be used and sets guidelines as to how it should be used. AUP documents are written for corporations, businesses, universities, schools, internet service providers (ISPs), and website owners, often to reduce the potential for legal action that may be taken by a user, and often with little prospect of enforcement.
Acceptable use policies are an integral part of the framework of information security policies; it is often common practice to ask new members of an organization to sign an AUP before they are given access to its information systems. For this reason, an AUP must be concise and clear. While at the same time covering the most important points about what users are, and are not allowed to do with the IT systems of an organization, it should refer users to the more comprehensive security policy where relevant. It should also, and very notably define what sanctions will be applied if a user breaks the AUP. Compliance with this policy should as usual, be measured by regular audits.
In some cases a fair usage policy applied to a service allowing nominally unlimited use for a fixed fee simply sets a cap on what may be used. This is intended to allow normal usage but, prevent what is considered excessive. For example, users of an "unlimited" broadband Internet service may be subject to suspension, termination, or bandwidth limiting for usage which is continually excessive, unfair, affects other users enjoyment of the broadband service. Also, it is not consistent with the usage typically expected on a particular access package. The policy is enforced directly, without legal proceedings.
Terminology
AUP documents are similar to and often serve the same function as the Terms of Service document (e.g., as used by Google Gmail and Yahoo!), although not always. In the case of IBM for instance, the Terms of Use are about the way in which IBM presents the site, how they interact with visitors of the site and little to no instruction as to how to use the site.
In some cases, AUP documents are named Internet and E-mail Policy, Internet AUP, Network AUP, or Acceptable IT Use Policy. These documents, even though named differently, largely provide policy statements as to what behavior is acceptable from users of the local network/Internet connected via the local network.
Common elements of AUP statements
In general, AUP statements/documents often begin with a statement of the philosophy of the sponsoring organization and intended reason as to why Internet use is offered to the users of that organization's network. For example, the sponsoring organization adopts a philosophy of self-regulation and offers the user connection to the local network and also connection to the Internet providing that the user acce |
https://en.wikipedia.org/wiki/Man%20page | A man page (short for manual page) is a form of software documentation usually found on a Unix or Unix-like operating system. Topics covered include computer programs (including library and system calls), formal standards and conventions, and even abstract concepts. A user may invoke a man page by issuing the man command.
By default, man typically uses a terminal pager program such as more or less to display its output.
Man pages are often referred to as an on-line or online form of software documentation, even though the man command does not require internet access, dating back to the times when printed out-of-band manuals were the norm.
History
In the first two years of the history of Unix, no documentation existed. The Unix Programmer's Manual was first published on November 3, 1971. The first actual man pages were written by Dennis Ritchie and Ken Thompson at the insistence of their manager Doug McIlroy in 1971. Aside from the man pages, the Programmer's Manual also accumulated a set of short papers, some of them tutorials (e.g. for general Unix usage, the C programming language, and tools such as Yacc), and others more detailed descriptions of operating system features. The printed version of the manual initially fit into a single binder, but as of PWB/UNIX and the 7th Edition of Research Unix, it was split into two volumes with the printed man pages forming Volume 1.
Later versions of the documentation imitated the first man pages' terseness. Ritchie added a "How to get started" section to the Third Edition introduction, and Lorinda Cherry provided the "Purple Card" pocket reference for the Sixth and Seventh Editions. Versions of the software were named after the revision of the manual; the seventh edition of the Unix Programmer's Manual, for example, came with the 7th Edition or Version 7 of Unix.
For the Fourth Edition the man pages were formatted using the troff typesetting package and its set of -man macros (which were completely revised between the Sixth and Seventh Editions of the Manual, but have since not drastically changed). At the time, the availability of online documentation through the manual page system was regarded as a great advance. To this day, virtually every Unix command line application comes with a man page, and many Unix users perceive a program's lack of man pages as a sign of low quality; indeed, some projects, such as Debian, go out of their way to write man pages for programs lacking one. The modern descendants of 4.4BSD also distribute man pages as one of the primary forms of system documentation (having replaced the old -man macros with the newer -mdoc).
There was a hidden Easter egg in the man-db version of the man command that would cause the command to return "gimme gimme gimme" when run at 00:30 (a reference to the ABBA song Gimme! Gimme! Gimme! (A Man After Midnight). It was introduced in 2011 but first restricted and then removed in 2017 after finally being found.
Formatting
The default format o |
https://en.wikipedia.org/wiki/Augmented%20reality | Augmented reality (AR) is an interactive experience that combines the real world and computer-generated content. The content can span multiple sensory modalities, including visual, auditory, haptic, somatosensory and olfactory. AR can be defined as a system that incorporates three basic features: a combination of real and virtual worlds, real-time interaction, and accurate 3D registration of virtual and real objects. The overlaid sensory information can be constructive (i.e. additive to the natural environment), or destructive (i.e. masking of the natural environment). This experience is seamlessly interwoven with the physical world such that it is perceived as an immersive aspect of the real environment. In this way, augmented reality alters one's ongoing perception of a real-world environment, whereas virtual reality completely replaces the user's real-world environment with a simulated one.
Augmented reality is largely synonymous with mixed reality. There is also overlap in terminology with extended reality and computer-mediated reality.
The primary value of augmented reality is the manner in which components of the digital world blend into a person's perception of the real world, not as a simple display of data, but through the integration of immersive sensations, which are perceived as natural parts of an environment. The earliest functional AR systems that provided immersive mixed reality experiences for users were invented in the early 1990s, starting with the Virtual Fixtures system developed at the U.S. Air Force's Armstrong Laboratory in 1992. Commercial augmented reality experiences were first introduced in entertainment and gaming businesses. Subsequently, augmented reality applications have spanned commercial industries such as education, communications, medicine, and entertainment. In education, content may be accessed by scanning or viewing an image with a mobile device or by using markerless AR techniques.
Augmented reality is used to enhance natural environments or situations and offers perceptually enriched experiences. With the help of advanced AR technologies (e.g. adding computer vision, incorporating AR cameras into smartphone applications, and object recognition) the information about the surrounding real world of the user becomes interactive and digitally manipulated. Information about the environment and its objects is overlaid on the real world. This information can be virtual. Augmented Reality is any experience which is artificial and which adds to the already existing reality. or real, e.g. seeing other real sensed or measured information such as electromagnetic radio waves overlaid in exact alignment with where they actually are in space. Augmented reality also has a lot of potential in the gathering and sharing of tacit knowledge. Augmentation techniques are typically performed in real-time and in semantic contexts with environmental elements. Immersive perceptual information is sometimes combined with supplement |
https://en.wikipedia.org/wiki/PSOS%20%28real-time%20operating%20system%29 | pSOS (Portable Software On Silicon) is a real-time operating system (RTOS), created in about 1982 by Alfred Chao, and developed and marketed for the first part of its life by his company Software Components Group (SCG). In the 1980s, pSOS rapidly became the RTOS of choice for all embedded systems based on the Motorola 68000 series family architecture, because it was written in 68000 assembly language and was highly optimised from the start. It was also modularised, with early support for OS-aware debugging, plug-in device drivers, Internet protocol suite (TCP/IP) stacks, language libraries, and disk subsystems. Later came source code level debugging, multiprocessing support, and further computer networking extensions.
In about 1991, Software Components Group was acquired by Integrated Systems Inc. (ISI) which further developed pSOS, then renamed as pSOS+, for other microprocessor families, by rewriting most of it in the programming language C. Attention was also paid to supporting successively more integrated development environments, culminating in pRISM+.
In July 1994, ISI acquired Digital Research's modular real-time multi-tasking operating system FlexOS from Novell.
In 1995, ISI offered a pSOSystem/NEST package for Novell Embedded Systems Technology (NEST).
In February 2000, ISI was acquired by Wind River Systems, the originators of the rival RTOS VxWorks. Despite initial reports that pSOS support would continue, development was halted. Wind River announced plans for a 'convergence' version of VxWorks which will support pSOS system calls, and that no further releases of pSOS will occur.
NXP Semiconductors acquired pSOS for TriMedia from Wind River and continued to support this OS for the TriMedia very long instruction word (VLIW) core.
Migration away from pSOS
In March 2000, rival company Express Logic released their Evaluation Kit for pSOS+ users, designed to provide a migration path to its ThreadX RTOS.
During August 2000, MapuSoft Technologies Inc. came up with the pSOS OS Changer porting kit which can smoothly move the software to multiple OS such as Linux, VxWorks, and more. It includes an integrated development environment (IDE) and application programming interface (API) optimization along with a profiling tool to measure API timing on target boards (www.mapusoft.com).
In August 2007, RoweBots, a former partner of SCG and ISI, open sourced their pSOS+ compatible version called Reliant. It is available to all that wish to upgrade without application changes.
The Xenomai project supports pSOS+ APIs (and others traditional RTOS APIs) over a Linux-based real-time framework to allow existing industrial applications to migrate easily to a Linux-based environment while keeping stringent real-time guarantees.
Another open sourced alternative is RTEMS, which has support for various APIs, including the "Classic API" (compatible to pSOS) and the POSIX API. Compared to Linux, RTEMS is a closer match to pSOS applications due to its lower |
https://en.wikipedia.org/wiki/Channel%20access%20method | In telecommunications and computer networks, a channel access method or multiple access method allows more than two terminals connected to the same transmission medium to transmit over it and to share its capacity. Examples of shared physical media are wireless networks, bus networks, ring networks and point-to-point links operating in half-duplex mode.
A channel access method is based on multiplexing, that allows several data streams or signals to share the same communication channel or transmission medium. In this context, multiplexing is provided by the physical layer.
A channel access method may also be a part of the multiple access protocol and control mechanism, also known as medium access control (MAC). Medium access control deals with issues such as addressing, assigning multiplex channels to different users and avoiding collisions. Media access control is a sub-layer in the data link layer of the OSI model and a component of the link layer of the TCP/IP model.
Fundamental schemes
Several ways of categorizing multiple-access schemes and protocols have been used in the literature. For example, Daniel Minoli (2009) identifies five principal types of multiple-access schemes: FDMA, TDMA, CDMA, SDMA, and Random access. R. Rom and M. Sidi (1990) categorize the protocols into Conflict-free access protocols, Aloha protocols, and Carrier Sensing protocols.
The Telecommunications Handbook (Terplan and Morreale, 2000) identifies the following MAC categories:
Fixed assigned: TDMA, FDMA+WDMA, CDMA, SDMA
Demand assigned (DA)
Reservation: DA/TDMA, DA/FDMA+DA/WDMA, DA/CDMA, DA/SDMA
Polling: Generalized polling, Distributed polling, Token Passing, Implicit polling, Slotted access
Random access (RA): Pure RA (ALOHA, GRA), Adaptive RA (TRA), CSMA, CSMA/CD, CSMA/CA
Channel access schemes generally fall into the following categories.
Frequency-division multiple access
The frequency-division multiple access (FDMA) channel-access scheme is the most standard analog system, based on the frequency-division multiplexing (FDM) scheme, which provides different frequency bands to different data streams. In the FDMA case, the frequency bands are allocated to different nodes or devices. An example of FDMA systems were the first-generation 1G cell-phone systems, where each phone call was assigned to a specific uplink frequency channel, and another downlink frequency channel. Each message signal (each phone call) is modulated on a specific carrier frequency.
A related technique is wavelength division multiple access (WDMA), based on wavelength-division multiplexing (WDM), where different data streams get different colors in fiber-optical communications. In the WDMA case, different network nodes in a bus or hub network get a different color.
An advanced form of FDMA is the orthogonal frequency-division multiple access (OFDMA) scheme, for example, used in 4G cellular communication systems. In OFDMA, each node may use several sub-carriers, making it possible t |
https://en.wikipedia.org/wiki/XSL%20%28disambiguation%29 | The three-letter abbreviation XSL may have multiple meanings, as described below:
In computing, the Extensible Stylesheet Language: a set of language technologies for defining XML document transformation and presentation
XSL Formatting Objects
The XSL attack (eXtended Sparse Linearisation attack), a method for breaking ciphers
The Xtreme Soccer League, a professional indoor soccer league |
https://en.wikipedia.org/wiki/UTP | UTP may refer to:
Science and technology
Uridine triphosphate, in biochemistry
Untripentium, a hypothetical chemical element
Unifying Theories of Programming
Unshielded twisted pair cable
Micro Transport Protocol, abbreviated µTP or sometimes uTP
Education
Universiti Teknologi Petronas, also known as Petronas University of Technology, located in Seri Iskandar, Perak, Malaysia
Technological University of Panama (Universidad Tecnológica de Panamá)
Universidade Tuiuti do Paraná - see List of universities in Brazil by state
University of Tehran Press
University of Toronto Press
University Transition Program
Music
UTP (group), an American rap group
Under the Pink, the second album from singer/songwriter Tori Amos
utp_ (album), a 2008 collaboration between Alva Noto, Ryuichi Sakamoto, and Ensemble Modern
Unblessing the Purity, a 2008 death metal EP by Bloodbath
Other uses
Uptown Projects, New Orleans Public Housing
United Tanganyika Party, a politician party in Tanganyika (now Tanzania) from 1956 to 1962
United Tasmania Party, a political party, forerunner of the Australian Greens
Unassisted triple play, in baseball
Unlisted Trading Privileges, permission to trade unlisted securities, granted by the Securities Exchange Act of 1934
UTP, IATA airport code for U-Tapao International Airport, Thailand
utp, ISO 639-3 code for the Amba language (Solomon Islands)
Urban Theatre Projects, an Australian theatre company |
https://en.wikipedia.org/wiki/Pike%20%28programming%20language%29 | Pike is an interpreted, general-purpose, high-level, cross-platform, dynamic programming language, with a syntax similar to that of C. Unlike many other dynamic languages, Pike is both statically and dynamically typed, and requires explicit type definitions. It features a flexible type system that allows the rapid development and flexible code of dynamically typed languages, while still providing some of the benefits of a statically typed language.
Pike features garbage collection, advanced data types, and first-class anonymous functions, with support for many programming paradigms, including object-oriented, functional and imperative programming. Pike is free software, released under the GPL, LGPL and MPL licenses.
History
Pike has its roots in LPC, which was a language developed for MUDs. Programmers at Lysator in Linköping, Sweden, most notably Fredrik Hübinette and Per Hedbor, separated the language and virtual machine from the rest of the MUD driver, and used it as a rapid prototyping language for various applications, calling it LPC4.
LPC's license did not allow use for commercial purposes, and so a new GPL implementation was written in 1994, called µLPC (micro LPC).
In 1996, µLPC was renamed to Pike in order to provide a more commercially viable name. Although the name of the company has changed over the years, the company now known as Roxen Internet Software employed many Pike developers, and provided resources for Pike's development. Roxen is also the name of a web server developed by the company in Pike. In 2002, the programming environment laboratory at Linköping University took over maintenance of Pike from Roxen. Several Pike programmers have found their way to the Linköping office of Opera Software, where the language plays a central role in the server/gateway parts of the Opera Mini application.
See also
LPMud family tree
References
External links
Community Page
Class-based programming languages
Scripting languages
Free compilers and interpreters
Cross-platform software
Object-oriented programming languages
Software using the Mozilla license
Software using the GPL license
Software using the LGPL license |
https://en.wikipedia.org/wiki/Tiny%20BASIC | Tiny BASIC is a family of dialects of the BASIC programming language that can fit into 4 or fewer KBs of memory. Tiny BASIC was designed in response to the open letter published by Bill Gates complaining about users pirating Altair BASIC, which sold for $150. Tiny BASIC was intended to be a completely free version of BASIC that would run on the same early microcomputers.
Tiny BASIC was released as a specification, not an implementation, published in the September 1975 issue of the People's Computer Company (PCC) newsletter. The article invited programmers to implement it on their machines and send the resulting assembler language implementation back for inclusion in a series of three planned newsletters. Li-Chen Wang, author of Palo Alto Tiny BASIC, coined the term "copyleft" to describe this concept. The community response was so overwhelming that the newsletter was relaunched as Dr. Dobb's Journal, the first regular periodical to focus on microcomputer software. Dr. Dobb's lasted in print form for 34 years and then online until 2014, when its website became a static archive.
The small size and free source code made these implementations invaluable in the early days of microcomputers in the mid-1970s, when RAM was expensive and typical memory size was only 4 to 8 KB. While the minimal version of Microsoft's Altair BASIC would also run in 4 KB machines, it left only 790 bytes free for BASIC programs. More free space was a significant advantage of Tiny BASIC. To meet these strict size limits, Tiny BASIC dialects generally lacked a variety of features commonly found in other dialects, for instance, most versions lacked string variables, lacked floating-point math, and allowed only single-letter variable names.
Tiny BASIC implementations are still used today, for programming microcontrollers such as the Arduino.
History
Altair BASIC
The earliest microcomputers, like the MITS Altair 8800, generally had no built-in input/output (I/O) beyond front-panel switches and LED lamps. Useful work generally required the addition of an I/O expansion card and the use of some form of terminal. At the time, video-based terminals were very expensive, costing much more than the computer, so many users turned to mechanical devices like the Teletype Model 33. The Model 33, like most teleprinters of the era, included a tape punch system intended to allow operators to pre-record their messages and then play them at "high speed", faster than most individuals could type the message live. For the early microcomputers, this provided a convenient computer data storage format, allowing the users to write programs to paper tape and distribute them to other users.
The Homebrew Computer Club met for the first time in March 1975, and its members soon used the meetings to swap software on punched tape. At the June meeting, a tape containing a pre-release version of Altair BASIC disappeared. The tape was given to Steve Dompier, who passed it on to Dan Sokol, who had access t |
https://en.wikipedia.org/wiki/GE-200%20series | The GE-200 series was a family of small mainframe computers of the 1960s, built by General Electric (GE). GE marketing called the line Compatibles/200 (GE-205/215/225/235). The GE-210 of 1960 was not compatible with the rest of the 200 series.
200 series models
The main machine in the line was the GE-225 (1961). It used a 20-bit word, of which 13 bits could be used for an address. Along with the basic central processing unit (CPU) the system could also have had a floating-point unit (the "Auxiliary Arithmetic Unit"), or a fixed-point decimal option with three six-bit decimal digits per word. It had eleven I/O channel controllers, and GE sold a variety of add-ons including disks, printers, and other devices. The machines were built using discrete transistors, with a typical machine containing about 10,000 transistors and 20,000 diodes. They used magnetic-core memory, and a standard 8 kiloword system held 186,000 magnetic cores. They weighed about .
The GE-215 (1963) was a scaled-down version of the GE-225, including only six I/O channels and only 4 kilowords or 8 kilowords of core.
The GE-205 (1964).
The GE-235 (1964) was a re-implementation of the GE-225 with three times faster memory than the original. The GE-235 consisted of several major components and options:
Central processor
400 card-per-minute (CPM) or 1000 CPM card reader
100 CPM card punch or 300 CPM card punch
Perforated tape subsystem
Magnetic tape subsystem
12-pocket high-speed document handler
On-line high speed printer or off/on-line speed printer
Disc storage unit
Auxiliary Arithmetic Logic Unit (ALU)
DATANET data communications equipment
Background
The series was designed by a team led by Homer R. “Barney” Oldfield, and which included Arnold Spielberg (father of film director Steven Spielberg). GE chairman Ralph J. Cordiner had forbidden GE from entering the general purpose computer business, rejecting several proposals by Oldfield by simply writing "No" across them and sending them back. Oldfield, somewhat deceptively, claimed that the GE-200 series would be industrial control computers. By the time Cordiner found out otherwise, it was too late and the machine was in production; Cordiner fired Oldfield at the product rollout. Even though the machine was selling well, Cordiner ordered that GE leave the computer business within 18 months (it actually took several years).
DTSS
Through the early 1960s GE worked with Dartmouth College on the development of a time-sharing operating system, which would later go on to become the Dartmouth Time Sharing System (DTSS). The system was constructed by attaching a number of teletypewriters to a smaller GE machine called the DATANET-30 (DN-30), which was a small computer that had evolved from an earlier process-control machine.
DTSS actually ran on the DN-30. The DN-30 accepted commands one at a time from the terminals connected to it, and then ran their requested programs on the GE-235. The GE-235 had no idea it was not runni |
https://en.wikipedia.org/wiki/Mark%20Taylor%20%28cricketer%29 | Mark Anthony Taylor (born 27 October 1964) is a former Australian cricketer and current Nine Network commentator.
He was Test opening batsman from 1988 to 1999, as well as captain from 1994 to 1999, succeeding Allan Border. His predominant fielding position was first slip. He was widely regarded as an instrumental component in Australia's rise to Test cricket dominance, and his captaincy was regarded as adventurous and highly effective. However, he was considered less than ideal for One-Day International cricket and was eventually dropped as one-day captain after a 0–3 drubbing at the hands of England in 1997.
He moved to Wagga Wagga in 1972 and played for Lake Albert Cricket Club. His debut was for New South Wales in 1985.
He retired from Test cricket on 2 February 1999. In 104 Test matches, he scored 7,525 runs with a batting average of 43.49, including 19 centuries and 40 fifties. He was also an excellent first slip – his 157 catches, at the time, a Test record (now held by Rahul Dravid). In contrast to his predecessor Allan Border, who acquired the nickname 'Captain Grumpy', Taylor won plaudits for his always cheerful and positive demeanour. His successor, Steve Waugh, further honed the Australian team built by Border and Taylor and went on to set numerous records for victories as captain. Having been named Australian of the Year in 1999, he is now a cricket commentator for the Nine Network, and former Director of Cricket Australia.
Early years
The second of three children born to bank manager Tony Taylor, and his wife Judy, Mark Taylor's early years were spent at Wagga Wagga, where his family relocated when he was eight. His father had a sporting background, playing first grade rugby in Newcastle. The young Taylor also enjoyed Rugby, alongside his main preference, cricket. He learned to bat in the family garage, with his father throwing cork balls to him. Taylor idolised Arthur Morris, the left-handed opening batsman from New South Wales who led the aggregates on the 1948 "Invincibles" tour of England.
Taylor played for his primary school as an opening batsman, and made his first century at the age of thirteen for the Lake Albert club at Bolton Park in Wagga. His family then moved to the north shore of Sydney, where he joined Northern District in Sydney Grade Cricket. Completing his secondary education at Chatswood High School, he later obtained a degree in surveying at the University of New South Wales in 1987. Along with the Waugh twins, Steve and Mark, Taylor played in under-19 youth internationals for Australia against Sri Lanka in 1982–83.
Taylor made his Sheffield Shield debut in 1985–86 when NSW was depleted by the defection of regular openers Steve Smith and John Dyson to a rebel tour of South Africa. Opening with fellow debutant Mark Waugh, he scored 12 and 56 not out against Tasmania. His first season was highlighted by home and away centuries against South Australia in a total of 937 runs at 49.31 average. He had a lean se |
https://en.wikipedia.org/wiki/Malleability%20%28cryptography%29 | Malleability is a property of some cryptographic algorithms. An encryption algorithm is "malleable" if it is possible to transform a ciphertext into another ciphertext which decrypts to a related plaintext. That is, given an encryption of a plaintext , it is possible to generate another ciphertext which decrypts to , for a known function , without necessarily knowing or learning .
Malleability is often an undesirable property in a general-purpose cryptosystem, since it allows an attacker to modify the contents of a message. For example, suppose that a bank uses a stream cipher to hide its financial information, and a user sends an encrypted message containing, say, "." If an attacker can modify the message on the wire, and can guess the format of the unencrypted message, the attacker could change the amount of the transaction, or the recipient of the funds, e.g. "". Malleability does not refer to the attacker's ability to read the encrypted message. Both before and after tampering, the attacker cannot read the encrypted message.
On the other hand, some cryptosystems are malleable by design. In other words, in some circumstances it may be viewed as a feature that anyone can transform an encryption of into a valid encryption of (for some restricted class of functions ) without necessarily learning . Such schemes are known as homomorphic encryption schemes.
A cryptosystem may be semantically secure against chosen plaintext attacks or even non-adaptive chosen ciphertext attacks (CCA1) while still being malleable. However, security against adaptive chosen ciphertext attacks (CCA2) is equivalent to non-malleability.
Example malleable cryptosystems
In a stream cipher, the ciphertext is produced by taking the exclusive or of the plaintext and a pseudorandom stream based on a secret key , as . An adversary can construct an encryption of for any , as .
In the RSA cryptosystem, a plaintext is encrypted as , where is the public key. Given such a ciphertext, an adversary can construct an encryption of for any , as . For this reason, RSA is commonly used together with padding methods such as OAEP or PKCS1.
In the ElGamal cryptosystem, a plaintext is encrypted as , where is the public key. Given such a ciphertext , an adversary can compute , which is a valid encryption of , for any .
In contrast, the Cramer-Shoup system (which is based on ElGamal) is not malleable.
In the Paillier, ElGamal, and RSA cryptosystems, it is also possible to combine several ciphertexts together in a useful way to produce a related ciphertext. In Paillier, given only the public key and an encryption of and , one can compute a valid encryption of their sum . In ElGamal and in RSA, one can combine encryptions of and to obtain a valid encryption of their product .
Block ciphers in the cipher block chaining mode of operation, for example, are partly malleable: flipping a bit in a ciphertext block will completely mangle the plaintext it decrypts to, but will result i |
https://en.wikipedia.org/wiki/IACR | IACR may refer to:
International Association for Cryptologic Research
Institute of Arable Crops Research
Gandhi Institute of Advanced Computer & Research, a college in India |
https://en.wikipedia.org/wiki/CycL | CycL in computer science and artificial intelligence is an ontology language used by Doug Lenat's Cyc artificial intelligence project. Ramanathan V. Guha was instrumental in the design of early versions of the language. There is a close variant of CycL known as MELD.
The original version of CycL was a frame language, but the modern version is not. Rather, it is a declarative language based on classical first-order logic, with extensions for modal operators and higher order quantification.
CycL is used to represent the knowledge stored in the Cyc Knowledge Base, available from Cycorp. The source code written in CycL released with the OpenCyc system is licensed as open source, to increase its usefulness in supporting the semantic web.
Basic ideas
CycL has some basic ideas:
Naming the constants used to refer to information for represented concepts.
Grouping the constants together in a generalization/specialization hierarchy (usually called categorization).
Stating general rules that support inference about the concepts.
The truth or falsity of a CycL sentence is context-relative; these contexts are represented in CycL as Microtheories.
Constants
The concept names in Cyc are known as constants. Constants start with "#$" and are case-sensitive. There are constants for:
Individual items known as individuals, such as #$BillClinton or #$France.
Collections, such as #$Tree-ThePlant (containing all trees) or #$EquivalenceRelation (containing all equivalence relations). A member of a collection is called an instance of that collection.
Truth Functions which can be applied to one or more other concepts and return either true or false. For example, #$siblings is the sibling relationship, true if the two arguments are siblings. By convention, truth function constants start with a lower-case letter. Truth functions may be broken down into logical connectives (such as #$and, #$or, #$not, #$implies), quantifiers (#$forAll, #$thereExists, etc.) and predicates.
Functions, which produce new terms from given ones. For example, #$FruitFn, when provided with an argument describing a type (or collection) of plants, will return the collection of its fruits. By convention, function constants start with an upper-case letter and end with the string "Fn".
Specialization and generalization
The most important predicates are #$isa and #$genls. The first one (#$isa) describes that one item is an instance of some collection (i.e.: specialization), the second one (#$genls) that one collection is a subcollection of another one (i.e.: generalization). Facts about concepts are asserted using certain CycL sentences. Predicates are written before their arguments, in parentheses:
For example:
(#$isa #$BillClinton #$UnitedStatesPresident) \;
"Bill Clinton belongs to the collection of U.S. presidents" and
(#$genls #$Tree-ThePlant #$Plant) \;
"All trees are plants".
(#$capitalCity #$France #$Paris) \;
"Paris is the capital of France."
Rules
Sentences can also c |
https://en.wikipedia.org/wiki/Commodore%20PET | The Commodore PET is a line of personal computers produced starting in 1977 by Commodore International. A single all-in-one case combines a MOS Technology 6502 microprocessor, Commodore BASIC in read-only memory, keyboard, monochrome monitor, and, in early models, a cassette deck.
Development of the system began in 1976, and it was demonstrated and sold as the first personal computer for the masses at the January 1977 Consumer Electronics Show. The name "PET" was suggested by Andre Souson after he saw the Pet Rock in Los Gatos, and stated they were going to make the "pet computer". It was backronymed to Personal Electronic Transactor. Byte referred to the PET, Apple II and Tandy TRS-80 collectively as the "1977 trinity".
Following the initial PET 2001, the design was updated through a series of models with more memory, better keyboard, larger screen, and other modifications. The systems were a top seller in the Canadian and United States education markets, as well as for business use in Europe.
The PET line was discontinued in 1982 after approximately 219,000 machines were sold.
History
Origins
In the 1970s, Commodore was one of many electronics companies selling calculators designed around Texas Instruments (TI) chips. TI faced increasing competition from Japanese vertically integrated companies who were using new CMOS-based processors and had a lower total cost of production. These companies began to undercut TI business, so TI responded by entering the calculator market directly in 1975. As a result, TI was selling complete calculators at lower price points than they sold just the chipset to their former customers, and the industry that had built up around it was frozen out of the market.
Commodore initially responded by beginning their own attempt to form a vertically integrated calculator line as well, purchasing a vendor in California that was working on a competitive CMOS calculator chip and an LED production line.
They also went looking for a company with an existing calculator chip line, something to tide them over in the immediate term, and this led them to MOS Technology. MOS had been building calculator chips for some time, but more recently had begun to branch out into new markets with its 6502 microprocessor design, which they were trying to bring to market. Along with the 6502 came Chuck Peddle's KIM-1 design, a small computer kit based on the 6502. At Commodore, Peddle convinced Jack Tramiel that calculators were a dead-end and that Commodore should explore the burgeoning microcomputer market instead. At first, they considered purchasing an existing design, and in September 1976 Peddle got a demonstration of Steve Jobs and Steve Wozniak's Apple II prototype. Steve Jobs was offering to sell it to Commodore, but Commodore considered Jobs's offer too expensive.
Release
The Commodore PET was officially announced in 1976 and Jack Tramiel gave Chuck Peddle six months to have the computer ready for the January 1977 Consumer Ele |
https://en.wikipedia.org/wiki/Digital%20Research | Digital Research, Inc. (DR or DRI) was a privately held American software company created by Gary Kildall to market and develop his CP/M operating system and related 8-bit, 16-bit and 32-bit systems like MP/M, Concurrent DOS, FlexOS, Multiuser DOS, DOS Plus, DR DOS and GEM. It was the first large software company in the microcomputer world. Digital Research was originally based in Pacific Grove, California, later in Monterey, California.
Overview
In 1972, Gary Kildall, an instructor at the Naval Postgraduate School in Monterey, California, began working at Intel as a consultant under the business name Microcomputer Applications Associates (MAA). By 1974, he had developed Control Program/Monitor, or CP/M, the first disk operating system for microcomputers. In 1974 he incorporated as Intergalactic Digital Research, with his wife handling the business side of the operation. The company soon began operating under its shortened name Digital Research.
The company's operating systems, starting with CP/M for 8080/Z80-based microcomputers, were the de facto standard of their era. Digital Research's product suite included the original 8-bit CP/M and its various offshoots like MP/M (1979), a multi-tasking multi-user version of CP/M.
The first 16-bit system was CP/M-86 (1981, adapted to the IBM PC in early 1982), which was meant as direct competitor to MS-DOS. There followed the multi-tasking MP/M-86 (1981), and Concurrent CP/M (1982), a single-user version featuring virtual consoles from which applications could be launched to run concurrently.
In May 1983 Digital Research announced that it would offer PC DOS versions of all of its languages and utilities. It remained influential, with million in 1983 sales making Digital Research the fourth-largest microcomputer software company. Admitting that it had "lost" the 8088 software market but hoped to succeed with the Intel 80286 and Motorola 68000, by 1984 the company formed a partnership with AT&T Corporation to develop software for Unix System V and sell its own and third-party products in retail stores. Jerry Pournelle warned later that year, however, that "Many people of stature seem to have left or are leaving Digital Research. DR had better get its act together."
Successive revisions of Concurrent CP/M incorporated MS-DOS API emulation (since 1983), which gradually added more support for DOS applications and the FAT file system. These versions were named Concurrent DOS (1984), with Concurrent PC DOS (1984) being the version adapted to run on IBM compatible PCs.
In 1985, soon after the introduction of the 80286-based IBM PC/AT, Digital Research introduced a real-time system, initially called Concurrent DOS 286, which later evolved into the modular FlexOS (1986). This exploited the greater memory addressing capability of the new CPU to provide a more flexible multi-tasking environment. There was a small but powerful set of system APIs, each with a synchronous and an asynchronous variant. Pipes were |
https://en.wikipedia.org/wiki/Atari%20Transputer%20Workstation | The Atari Transputer Workstation (also known as ATW-800, or simply ATW) is a workstation class computer released by Atari Corporation in the late 1980s, based on the INMOS transputer. It was introduced in 1987 as the Abaq, but the name was changed before sales began. Sales were almost non-existent, and the product was canceled after only a few hundred units had been produced.
History
In 1986, Tim King left his job at MetaComCo, along with a few other employees, to start Perihelion Software in England. There they started development of a new parallel-processing operating system known as "HeliOS". At about the same time a colleague, Jack Lang, started Perihelion (later Perihelion Hardware) to create a new transputer based workstation that would run HeliOS.
While at MetaComCo, much of the Perihelion Software team had worked with both Atari Corp. and Commodore International, producing ST BASIC for the former, and AmigaDOS for the latter. The principals still had contacts with both companies. Commodore had expressed some interest in their new system, and showed demos of it on an add-on card running inside an Amiga 2000. It appears they later lost interest in it. Atari Corp. met with Perihelion and work began on what would eventually become the Atari Transputer Workstation.
The machine was first introduced at the November 1987 COMDEX with the name Abaq. Two versions were shown at the time; one was a card that connected to the Mega ST bus expansion slot, the second version was a stand-alone tower system containing a miniaturized Mega ST inside. The external card version was dropped at some point during development. It was later learned that the "Abaq" name was in use in Europe, so the product name was changed to ATW800. Perihelion remained the exclusive distributor in England. A first run of prototypes was released in May 1988, followed by a production run in May 1989. In total, only 350 machines were produced (depending on the source either 50 or 100 of the total were prototypes).
The team in charge of the ATW's video system, "Blossom", would later work on another Atari project, the Atari Jaguar video game console.
Overview
The Atari Transputer Workstation system consists of three main parts:
the main motherboard containing a T800-20 transputer and 4 MB of RAM (expandable to 16 MB)
a complete miniaturized Mega ST acting as an I/O processor with 512 kB of RAM
the Blossom video system with 1 MB of dual-ported RAM
All of these are connected using the Transputer's 20 Mbit/s processor links. The motherboard contains four slots for additional "farm cards" containing four transputers each, meaning that a fully expanded ATW contains 17 transputers. Each runs at 20 MHz (the -20 in the name) which supplied about 10 MIPS each. The bus is available externally, allowing several ATWs to be connected into one large farm. The motherboard includes a separate slot for one of the INMOS crossbar switches to improve inter-chip networking performance.
HeliOS i |
https://en.wikipedia.org/wiki/Web%20%28programming%20system%29 | Web is a computer programming system created by Donald E. Knuth as the first implementation of what he called "literate programming": the idea that one could create software as works of literature, by embedding source code inside descriptive text, rather than the reverse (as is common practice in most programming languages), in an order that is convenient for exposition to human readers, rather than in the order demanded by the compiler.
Web consists of two secondary programs: TANGLE, which produces compilable Pascal code from the source texts, and WEAVE, which produces nicely-formatted, printable documentation using TeX.
CWEB is a version of Web for the C programming language, while noweb is a separate literate programming tool, which is inspired by Web (as reflected in the name) and which is language agnostic.
The most significant programs written in Web are TeX and Metafont. Modern TeX distributions use another program Web2C to convert Web source to C.
Philosophy
Unlike most other documentation generators, which relegate documentation to comments, the WEB approach is to write an article to document the making of the source code. Much like TeX articles, the source is divided into sections according to documentation flow. For example, in CWEB, code sections are seamlessly intermixed in the line of argumentation.
CWEB
CWEB is a computer programming system created by Donald Knuth and Silvio Levy as a follow-up to Knuth's WEB literate programming system, using the C programming language (and to a lesser extent the C++ and Java programming languages) instead of Pascal.
Like WEB, it consists of two primary programs:
CTANGLE, which produces compilable C code from the source texts, and
CWEAVE, which produces nicely-formatted printable documentation using TeX.
Features
Can enter manual TeX code as well as automatic.
Make formatting of C code for pretty printing.
Can define sections, and can contain documentation and codes, which can then be included into other sections.
Write the header code and main C code in one file, and can reuse the same sections, and then it can be tangled into multiple files for compiling.
Use #line pragmas so that any warnings or errors refer to the .w source.
Include files.
Change files, which can be automatically merged into the code when compiling/printing.
Produces index of identifiers and section names in the printout.
References
External links
The TeX Catalogue entry for Web
CWEB homepage
Examples of programs written in Web, By Donald Knuth (1981 and onward)
Free documentation generators
Literate programming
TeX |
https://en.wikipedia.org/wiki/ISCSI | Internet Small Computer Systems Interface or iSCSI ( ) is an Internet Protocol-based storage networking standard for linking data storage facilities. iSCSI provides block-level access to storage devices by carrying SCSI commands over a TCP/IP network. iSCSI facilitates data transfers over intranets and to manage storage over long distances. It can be used to transmit data over local area networks (LANs), wide area networks (WANs), or the Internet and can enable location-independent data storage and retrieval.
The protocol allows clients (called initiators) to send SCSI commands (CDBs) to storage devices (targets) on remote servers. It is a storage area network (SAN) protocol, allowing organizations to consolidate storage into storage arrays while providing clients (such as database and web servers) with the illusion of locally attached SCSI disks. It mainly competes with Fibre Channel, but unlike traditional Fibre Channel which usually requires dedicated cabling, iSCSI can be run over long distances using existing network infrastructure. iSCSI was pioneered by IBM and Cisco in 1998 and submitted as a draft standard in March 2000.
Concepts
In essence, iSCSI allows two hosts to negotiate and then exchange SCSI commands using Internet Protocol (IP) networks. By doing this, iSCSI takes a popular high-performance local storage bus and emulates it over a wide range of networks, creating a storage area network (SAN). Unlike some SAN protocols, iSCSI requires no dedicated cabling; it can be run over existing IP infrastructure. As a result, iSCSI is often seen as a low-cost alternative to Fibre Channel, which requires dedicated infrastructure except in its FCoE (Fibre Channel over Ethernet) form. However, the performance of an iSCSI SAN deployment can be severely degraded if not operated on a dedicated network or subnet (LAN or VLAN), due to competition for a fixed amount of bandwidth.
Although iSCSI can communicate with arbitrary types of SCSI devices, system administrators almost always use it to allow servers (such as database servers) to access disk volumes on storage arrays. iSCSI SANs often have one of two objectives:
Storage consolidation
Organizations move disparate storage resources from servers around their network to central locations, often in data centers; this allows for more efficiency in the allocation of storage, as the storage itself is no longer tied to a particular server. In a SAN environment, a server can be allocated a new disk volume without any changes to hardware or cabling.
Disaster recovery
Organizations mirror storage resources from one data center to a remote data center, which can serve as a hot / standby in the event of a prolonged outage. In particular, iSCSI SANs allow entire disk arrays to be migrated across a WAN with minimal configuration changes, in effect making storage "routable" in the same manner as network traffic.
Initiator
An initiator functions as an iSCSI client. An initiator typically serves t |
https://en.wikipedia.org/wiki/Passions | Passions is an American television soap opera that originally aired on NBC from July 5, 1999, to September 7, 2007, and on DirecTV's The 101 Network from September 17, 2007, to August 7, 2008. Created by screenwriter James E. Reilly and produced by NBC Studios, Passions follows the lives, loves and various romantic and paranormal adventures of the residents of Harmony, a small town in New England with many secrets.
Storylines center on the interactions among members of its multi-racial core families: the African-American Russells, the white Cranes and Bennetts, and half-Mexican half-Irish Lopez-Fitzgeralds. The series also features supernatural elements, which focus mainly on town witch Tabitha Lenox (Juliet Mills) and her doll-come-to-life, Timmy (Josh Ryan Evans).
NBC cancelled Passions on January 16, 2007. The series was subsequently picked up by DirecTV. The series aired its final episode on NBC on September 7, 2007, with new episodes continuing on DirectTV's 101 Network starting on September 17. In December 2007, just months after picking up the series, DirecTV decided not to renew its contract for Passions, and the studio was subsequently unable to sell the series elsewhere. The final episode was broadcast in August 2008. As of 2021, Passions is the last daytime television soap opera created for American network television.
Series history
Passions debuted on NBC broadcast television in July 1999 with major fanfare. Creator Reilly had been credited for a large surge in the ratings for Days of Our Lives years before, thanks to innovative storylines like that of heroine Dr. Marlena Evans being possessed by Satan that drew new viewers, but also tended to alienate stalwart fans. With Passions, Reilly was able to start with a blank slate and no pre-existing fan base to please. The series replaced the Procter & Gamble-produced serial Another World, which ended a 35-year run on June 25, 1999, on NBC's daytime schedule. In the early days of the show, Passions heroine Sheridan Crane is identified as a close friend of Diana, Princess of Wales; soon Sheridan recalls speaking to Diana on the phone immediately before the 1997 car accident in which Diana was killed. Sheridan also has a similar accident in the same Paris tunnel, and speaks to a "guardian Angel Diana" who urges her to fight to survive, which drew considerable controversy. Sheridan later adopts the name Diana after a boating accident that results in amnesia.
The opening days of the show also introduced the Theresa/Ethan/Gwen love triangle that persisted as an ongoing main story line to the very last episode of the series.
For much of the first three to four years of the series, supernatural elements such as witches, warlocks, and closet doors leading to Hell were major plot points, many surrounding the machinations of the centuries-old witch Tabitha Lenox and her doll-brought-to-life sidekick, Timmy—named by Entertainment Weekly as one of their "17 Great Soap Supercouples" in 2008. In |
https://en.wikipedia.org/wiki/Fennesz | Christian Fennesz (born 25 December 1962) is a producer and guitarist active in electronic music since the 1990s, often credited simply by his last name. His work utilizes guitar and laptop computers to blend melody with treated samples and glitch production. He lives and works in Vienna, and currently records on the UK label Touch.
Fennesz first received widespread recognition for his 2001 album Endless Summer, released on the Austrian label Mego. He has collaborated with a number of artists, including Ryuichi Sakamoto, Jim O'Rourke, Ulver, David Sylvian, and King Midas Sound.
Biography
Fennesz was born and raised in Austria and studied music formally in art school. He started playing guitar around the age of 8 or 9. He initially performed as a member of the Austrian experimental rock band Maische before signing to electronic music label Mego as a solo artist. The influence of techno led him to begin composing with a laptop. In 1995 he released his first EP Instrument, which explored electro-acoustic and ambient stylings.
In 1997, Fennesz released his debut full-length album Hotel Paral.lel, which saw him delve more explicitly into laptop production and early glitch aesthetics. He followed with the 1998 single Plays, which contained near-unrecognizable covers of the Rolling Stones' "Paint It Black" and the Beach Boys' "Don't Talk (Put Your Head on My Shoulder)". In the following years, he collaborated with a variety of artists, including Peter "Pita" Rehberg and Jim O'Rourke as part of Fenn O'Berg. In 2001, he released his third studio album Endless Summer to widespread critical praise and recognition. He collaborated with figures such as David Sylvian, Keith Rowe, eRikm, Ryuichi Sakamoto in the following years, and released the albums Venice (2004) and Black Sea (2007) to further critical praise.
In 2009 Fennesz teamed up with Mark Linkous (Sparklehorse) to create In the Fishtank 15. The following year Fennesz released Szampler, a cassette containing his sample collection on the Tapeworm label. This release was later remixed by Stefan Goldmann and released as Goldmann vs. Fennesz: Remiksz. In 2011, he appeared on the live Ulver release The Norwegian National Opera, contributing guitar and effects to "Not Saved." In November 2013, Fennesz played the final holiday camp edition of the All Tomorrow's Parties festival in Camber Sands, England. In 2014, he released the studio album Bécs. In 2015, he collaborated with UK group King Midas Sound on the album Editions 1.
Recording techniques
Since the 1990s, Fennesz has worked with the programming software Max/MSP and the free patch Ppooll, which he runs in conjunction with the workstation Logic 9. In both studio and live settings, he routes his guitar through effects pedals (including a custom distortion box) and into his computer. There, it is processed and combined with Ppooll software plugins and tools such as samplers, synthesizers, effects, and MIDI controllers.
Discography
Studio albums
|
https://en.wikipedia.org/wiki/Daisy%20wheel%20printing | Daisy wheel printing is an impact printing technology invented in 1970 by Andrew Gabor at Diablo Data Systems. It uses interchangeable pre-formed type elements, each with typically 96 glyphs, to generate high-quality output comparable to premium typewriters such as the IBM Selectric, but two to three times faster. Daisy wheel printing was used in electronic typewriters, word processors and computers from 1972. The daisy wheel is so named because of its resemblance to the daisy flower.
By 1980 daisy wheel printers had become the dominant technology for high-quality text printing. Dot-matrix impact, thermal, or line printers were used where higher speed or image printing were required and poor print quality was acceptable. Both technologies were rapidly superseded for most purposes when dot-based printers—in particular laser printers—that could print any characters or graphics, rather than being restricted to a limited character set, became able to produce output of comparable quality. Daisy wheel technology is now found only in some electronic typewriters.
History
In 1889 Arthur Irving Jacobs patented a daisy wheel design (U.S. Patent 409,289) that was used on the Victor index typewriter.
A. H. Reiber of Teletype Corporation received U.S. Patent 2,146,380 in 1939 for a daisy wheel printer.
In 1970 a team at Diablo Systems led by engineer Dr Andrew Gabor developed the first commercially successful daisy wheel printer, a device that was faster and more flexible than IBM's Selectric devices, being capable of 30 cps (characters per second), whereas the Selectric operated at 13.4 cps. Dr Andrew Gabor was issued two patents for the invention U.S. Patents 3,954,163 and 3,663,880.
Xerox acquired Diablo that same year. Xerox's Office Product Division had already been buying Diablo printers for its Redactron text editors. After 7 years trying to make Diablo profitable, the OPD focused on developing and selling the Diablo 630 which was mostly bought by companies such as Digital Equipment Corporation. The Diablo 630 could produce letter quality output as good as that produced by an IBM Selectric or Selectric-based printer, but at lower cost and double the speed. A further advantage was that it supported the entire ASCII printing character set. Its servo-controlled carriage also permitted the use of proportional spaced fonts, where characters occupy a different amount of horizontal space according to their width.
The Diablo 630 was so successful that virtually all later daisy wheel printers, as well as many dot matrix printers and even the original Apple Laserwriter either copied its command set or could emulate it. Daisy wheel printers from Diablo and Qume were the dominant high-end output technology for computer and office automation applications by 1980, though high speed non-impact techniques were already entering the market (e.g. IBM 6640 inkjet, Xerox 2700 and IBM 6670 laser). From 1981 onwards the IBM PC's introduction of "Code page 437" with 25 |
https://en.wikipedia.org/wiki/MP/M | MP/M (Multi-Programming Monitor Control Program) is a discontinued multi-user version of the CP/M operating system, created by Digital Research developer Tom Rolander in 1979. It allowed multiple users to connect to a single computer, each using a separate terminal.
MP/M was a fairly advanced operating system for its era, at least on microcomputers. It included a priority-scheduled multitasking kernel (before such a name was used, the kernel was referred to as the nucleus) with memory protection, concurrent input/output (XIOS) and support for spooling and queueing. It also allowed for each user to run multiple programs, and switch between them.
MP/M platforms
MP/M-80
The 8-bit system required a 8080 (or Z80) CPU and a minimum of 32 KB of RAM to run, but this left little memory for user applications. In order to support reasonable setups, MP/M allowed for memory to be switched in and out of the machine's "real memory" area. So for instance a program might be loaded into a "bank" of RAM that was not addressable by the CPU, and when it was time for the program to run that bank of RAM would be "switched" to appear in low memory (typically the lower 32 or 48 KB) and thus become visible to the OS. This technique, known as bank switching was subsequently added to the single user version of CP/M with version 3.0.
One of the primary uses of MP/M, perhaps to the surprise of DRI, was as a "power user" version of CP/M for a single user. The ability to run several programs at the same time and address large amounts of memory made the system worth the extra price.
MP/M II 2.0 added file sharing capabilities in 1981, MP/M II 2.1 came with extended file locking in January 1982.
Versions:
MP/M 1.0 (1979)
MP/M 1.1 (January 1980)
MP/M II 2.0 (July 1981, added: file sharing)
MP/M II 2.1 (January 1982, added: extended file locking)
MP/M-86
Like CP/M, MP/M was eventually ported to the 16-bit Intel 8086, and appeared as MP/M-86 2.0 in September 1981. Main developers of the system include Francis "Frank" R. Holsworth, later a director of marketing at Digital Research. Known revisions of MP/M-86 2.0 were dated 25 September 1981 and 5 October 1981. There also was an MP/M-86 2.1 dated 20 July 1982.
MP/M-86 2.1 absorbed some of the technology of CP/M-86 1.1 (BDOS 2.2) to become Concurrent CP/M-86 3.0 (BDOS 3.0) in late 1982, which also added support for "virtual screens". Kathryn Strutynski, the project manager for CP/M-86, continued as project manager for Concurrent CP/M-86. In December 1983, a DOS emulator named PC-MODE became available as an optional module for Concurrent CP/M-86 3.1 (BDOS 3.1), shipping on 21 February 1984, and the system was further developed into the MS-DOS compatible Concurrent DOS (BDOS 3.1 and higher). This in turn continued to evolve into FlexOS and Multiuser DOS and as such is still in use in some industrial applications.
MP/M 8-16
MP/M 8-16 (sometimes also referred to as MP/M-8/16) was CompuPro's name for a combination of the mul |
https://en.wikipedia.org/wiki/Transputer | The transputer is a series of pioneering microprocessors from the 1980s, intended for parallel computing. To support this, each transputer had its own integrated memory and serial communication links to exchange data with other transputers. They were designed and produced by Inmos, a semiconductor company based in Bristol, United Kingdom.
For some time in the late 1980s, many considered the transputer to be the next great design for the future of computing. While the transputer did not achieve this expectation, the transputer architecture was highly influential in provoking new ideas in computer architecture, several of which have re-emerged in different forms in modern systems.
Background
In the early 1980s, conventional central processing units (CPUs) appeared to have reached a performance limit. Up to that time, manufacturing difficulties limited the amount of circuitry that could fit on a chip. Continued improvements in the fabrication process had largely removed this restriction. Within a decade, chips could hold more circuitry than the designers knew how to use. Traditional complex instruction set computer (CISC) designs were reaching a performance plateau, and it wasn't clear it could be overcome.
It seemed that the only way forward was to increase the use of parallelism, the use of several CPUs that would work together to solve several tasks at the same time. This depended on such machines being able to run several tasks at once, a process termed multitasking. This had generally been too difficult for prior microprocessor designs to handle, but more recent designs were able to accomplish it effectively. It was clear that in the future, this would be a feature of all operating systems (OSs).
A side effect of most multitasking design is that it often also allows the processes to be run on physically different CPUs, in which case it is termed multiprocessing. A low-cost CPU built for multiprocessing could allow the speed of a machine to be raised by adding more CPUs, potentially far more cheaply than by using one faster CPU design.
The first transputer designs were due to computer scientist David May and telecommunications consultant Robert Milne. In 1990, May received an Honorary DSc from University of Southampton, followed in 1991 by his election as a Fellow of The Royal Society and the award of the Patterson Medal of the Institute of Physics in 1992. Tony Fuge, then a leading engineer at Inmos, was awarded the Prince Philip Designers Prize in 1987 for his work on the T414 transputer.
Design
The transputer was the first general purpose microprocessor designed specifically to be used in parallel computing systems. The goal was to produce a family of chips ranging in power and cost that could be wired together to form a complete parallel computer. The name, from "transistor" and "computer"), was selected to indicate the role the individual transputers would play: numbers of them would be used as basic building blocks in a larger inte |
https://en.wikipedia.org/wiki/Michael%20Jecks | Michael Jecks (born 1960, Surrey) is an English writer of historical mystery novels.
Early life
The son of an actuary, and the fourth of four brothers, Jecks worked in the computer industry before becoming a novelist full-time in 1994 after he was fired from his last position. He, his wife, daughter and son live in northern Dartmoor.
Career
Jecks has written a series of novels featuring Sir Baldwin Furnshill, a former Knight Templar, and his friend Simon Puttock, Bailiff of Lydford Castle. He founded The Medieval Murderers, a speaking and entertainment group of historical writers including Bernard Knight, Ian Morson, Susanna Gregory, Phillip Gooden and CJ Sansom. The group has developed to collaborate on their books written as linked novellas, each book with a consistent theme, under the brand of The Medieval Murderers. More recently he helped create the Historical Writers' Association.
A member of the Society of Authors and Royal Literary Society, Jecks was the Chairman of the Crime Writers' Association in 2004–05. In 2005 he became a member of the Detection Club. From 1998 he organised the CWA Debut Dagger competition for two years, helping unpublished authors to win their first contracts. He was shortlisted for the Theakston's Old Peculiar Best Novel of the Year prize in 2007. He also judged the CWA/Ian Fleming Steel Dagger Award for three years.
Jecks speaks at literary festivals and historical meetings, at which he talks with Ian Mortimer, the historian, as well as Medieval Murderers. He helped create the Conway Stewart Detection Collection with a pen named for him. In 2014 he was the Grand Master of the Krewe of Little Rascals parade, the first parade of the New Orleans Mardi Gras. In the same year he was invited to be the International Guest of Honour at the Toronto Bloody Words Festival.
Jecks has embarked on a trilogy of Hundred Years' War stories with Simon and Schuster UK. The first, Fields of Glory, was published in 2014. The second, Blood on the Sand, was published in June 2015. He also has a modern spy thriller published with Kindle, Act of Vengeance, and two short story collections: No One Can Hear You Scream and For The Love of Old Bones.
Bibliography
Knights Templar Mysteries
The Last Templar (March 1995)
The Merchant's Partner (November 1995)
A Moorland Hanging (May 1996)
The Crediton Killings (June 1997)
The Abbot's Gibbet (April 1998)
The Leper's Return (November 1998)
Squire Throwleigh's Heir (June 1999)
Belladonna at Belstone (December 1999)
The Traitor of St. Giles (May 2000)
The Boy Bishop's Glovemaker (December 2000)
The Tournament of Blood (June 2001)
The Sticklepath Strangler (November 2001)
The Devil's Acolyte (June 2002)
The Mad Monk of Gidleigh (December 2002)
The Templar's Penance (June 2003)
The Outlaws of Ennor (January 2004)
The Tolls of Death (May 2004)
The Chapel of Bones (December 2004)
The Butcher of St Peter's (May 2005)
A Friar's Bloodfeud (June 2006)
The Death Ship of Dartmout |
https://en.wikipedia.org/wiki/Talk%20show | A talk show (sometimes chat show in British English) is a television programming, radio programming or Podcast genre structured around the act of spontaneous conversation. A talk show is distinguished from other television programs by certain common attributes. In a talk show, one person (or group of people or guests) discusses various topics put forth by a talk show host. This discussion can be in the form of an interview or a simple conversation about important social, political or religious issues and events. The personality of the host shapes the tone and style of the show. A common feature or unwritten rule of talk shows is to be based on "fresh talk", which is talk that is spontaneous or has the appearance of spontaneity.
The history of the talk show spans back from the 1950s to the present.
Talk shows can also have several different subgenres, which all have unique material and can air at different times of the day via different avenues.
Attributes
Beyond the inclusion of a host, a guest(s), and a studio or call-in audience, specific attributes of talk shows may be identified:
Talk shows focus on the viewers—including the participants calling in, sitting in a studio or viewing from online or on TV.
Talk shows center around the interaction of guests with opposing opinions and/or differing levels of expertise, which include both experts and non-experts.
Although talk shows include guests of various expertise levels, they cater to the credibility of one's experiences and rationalities as opposed to educational expertise.
Talk shows involve a host responsible for furthering the agenda of the show by mediating, instigating and directing the conversation to ensure the purpose is fulfilled. The purpose of talk shows is to either address or bring awareness to conflicts, to provide information, or to entertain.
Talk shows consist of evolving episodes that focus on differing perspectives in respect to important issues in society, politics, religion or other popular areas.
Talk shows are produced at low cost and are typically not aired during prime time.
Talks shows are either aired live or are recorded live with limited post-production editing.
Subgenres
There are several major formats of talk shows. Generally, each subgenre predominates during a specific programming block during the broadcast day.
Breakfast chat or early morning shows that generally alternate between news summaries, political coverage, feature stories, celebrity interviews, and musical performances.
Late morning chat shows that feature two or more hosts or a celebrity panel and focus on entertainment and lifestyle features.
Daytime tabloid talk shows that generally feature a host, a guest or a panel of guests, and a live audience that interacts extensively with the host and guests. These shows may feature celebrities, political commentators, or "ordinary" people who present unusual or controversial topics.
"Lifestyle" or self-help programs that generally feature a |
https://en.wikipedia.org/wiki/John%20Roth%20%28businessman%29 | John Andrew Roth, a Canadian, was the chief executive officer and chairman of Nortel Networks between 1997 and 2001, While he was called "the most successful businessman in modern Canadian history" by Time magazine and named Canada's CEO of the Year by a Bay Street panel in the fall of 2000, by the ignominious end of his career it became clear that his mismanagement destroyed the company.
Career at Nortel
Roth joined Northern Telecom in 1969 as a design engineer, rising to become CEO after a long career. Nortel, once one of the most highly regarded Canadian companies in history, fell into severe financial difficulties under his tenure and filed for bankruptcy shortly after Mr. Roth was forced out. Although he had in the past received much praise from a credulous business press, it became clear that his mismanagement led to the destruction of a once great company. The Toronto Star, reporting on January 14, 2013 on the trial of Mr. Roth's successor as CEO reported "... the real force behind Nortel’s demise — [was]the reckless conduct of ... former Nortel CEO John Roth...Roth emerged from the wreckage with more than $100 million in stock-option proceeds."
Nortel eventually filed for bankruptcy protection in Canada and the United States. The bankruptcy case was the largest in Canadian history and left pensioners, shareholders and former employees with enormous losses. (Source: Nortel) Total losses to those stakeholders amounted to $54 billion, the tenth largest such loss in the history of capitalism. (Source:
Between 1993 and 1995, Roth served as president of Nortel's North American operations.
He was named Northern Telecom Limited's CEO in 1995 and was elected to the board of directors in 1996. In February 1997, he was named president of the corporation, in addition to continuing to serve as CEO. In October 1997, Roth became president and CEO of the company which became known as Nortel Networks.
Under Roth's control, Nortel became the leading engine of Canada's 1990s high-tech boom. Nortel became the most important stock traded on the Toronto Stock Exchange and became one of Canada's leading employers. Roth used his success and high popularity to lobby the government for tax cuts, but he did not support Clive Allen's statement to threaten to move Nortel to the United States if taxes were not lowered.
Network World, on January 4, 1999, referred to Roth as one of the 25 most powerful people in networking, a "man of boldness and vision, one who would rather strike than be stricken."
Forbes magazine, on December 13, 2000, referred to Roth as having "engineered some 16 acquisitions while putting the pedal to the metal internally to transform Nortel from a simple telecom equipment provider into a global brand name identified with the Internet."
"We were a slow company and we had to work very hard to become a fast one," says Roth, who began his tenure as CEO with a letter to employees in which he told them the time had come for the century-old co |
https://en.wikipedia.org/wiki/Accelerator | Accelerator may refer to:
In science and technology
In computing
Download accelerator, or download manager, software dedicated to downloading
Hardware acceleration, the use of dedicated hardware to perform functions faster than a CPU
Graphics processing unit or graphics accelerator, a dedicated graphics-rendering device
Accelerator (library), a library that allows the coding of programs for a graphics processing unit
Cryptographic accelerator, performs decrypting/encrypting
Web accelerator, a proxy server that speeds web-site access
Accelerator (Internet Explorer), a form of selection-based search
Accelerator table, specifies keyboard shortcuts for commands
Apple II accelerators, hardware devices designed to speed up an Apple II computer
PHP accelerator, speeds up software applications written in the PHP programming language
SAP BI Accelerator, speeds up online analytical processing queries
SSL/TLS accelerator, offloads public-key encryption algorithms to a hardware accelerator
TCP accelerator, or TCP Offload Engine, offloads processing of the TCP/IP stack to a network controller
Keyboard shortcut, a set of key presses that invoke a software or operating system operation
Accelerator or AFU (Accelerator Function Unit): a component of IBM's Coherent Accelerator Processor Interface (CAPI)
In physics and chemistry
Accelerator (chemistry), a substance that increases the rate of a chemical reaction
Araldite accelerator 062, or Dimethylbenzylamine, an organic compound
Cement accelerator, an admixture that speeds the cure time of concrete
Particle accelerator, a device which uses electric and/or magnetic fields to propel charged particles to high speeds
Accelerator-driven system (ADS), a nuclear reactor coupled to a particle accelerator
Accelerator mass spectrometry (AMS), a form of mass spectrometry
Tanning accelerator, chemicals that increase the effect of ultraviolet radiation on human skin
Vulcanizing accelerators, chemical agents to speed the vulcanization of rubber
Firearms
.22 Accelerator or Remington Accelerator, a type of .224 caliber bullet
Electricothermal accelerator, a weapon that uses a plasma discharge to accelerate its projectile
Magnetic accelerator gun, a weapon that converts magnetic energy into kinetic energy for a projectile
Ram accelerator, a device for accelerating projectiles using ramjet or scramjet combustion
Produce accelerators, cannons which use air pressure or combustion to launch large projectiles at low speed
Other technologies
Accelerator, gas pedal or throttle, a foot pedal that controls the engine speed of an automobile
Accelerator Coaster, a roller coaster that uses hydraulic acceleration
In entertainment
The Accelerators, US rock band
Accelerator (Royal Trux album), their seventh studio album, released in 1998
Accelerator (The Future Sound of London album), released in 1992
"Accelerator", a 1993 single by Gumball
"Accelerator", a song by band The O.A.O.T.'s, on their album Typical
"Accelerator", a song by |
https://en.wikipedia.org/wiki/The%20Age%20of%20Spiritual%20Machines | The Age of Spiritual Machines: When Computers Exceed Human Intelligence is a non-fiction book by inventor and futurist Ray Kurzweil about artificial intelligence and the future course of humanity. First published in hardcover on January 1, 1999, by Viking, it has received attention from The New York Times, The New York Review of Books and The Atlantic. In the book Kurzweil outlines his vision for how technology will progress during the 21st century.
Kurzweil believes evolution provides evidence that humans will one day create machines more intelligent than they are. He presents his law of accelerating returns to explain why "key events" happen more frequently as time marches on. It also explains why the computational capacity of computers is increasing exponentially. Kurzweil writes that this increase is one ingredient in the creation of artificial intelligence; the others are automatic knowledge acquisition and algorithms like recursion, neural networks, and genetic algorithms.
Kurzweil predicts machines with human-level intelligence will be available from affordable computing devices within a couple of decades, revolutionizing most aspects of life. He says nanotechnology will augment our bodies and cure cancer even as humans connect to computers via direct neural interfaces or live full-time in virtual reality. Kurzweil predicts the machines "will appear to have their own free will" and even "spiritual experiences". He says humans will essentially live forever as humanity and its machinery become one and the same. He predicts that intelligence will expand outward from earth until it grows powerful enough to influence the fate of the universe.
Reviewers appreciated Kurzweil's track record with predictions, his ability to extrapolate technology trends, and his clear explanations. However, there was disagreement on whether computers will one day be conscious. Philosophers John Searle and Colin McGinn insist that computation alone cannot possibly create a conscious machine. Searle deploys a variant of his well-known Chinese room argument, this time tailored to computers playing chess, a topic Kurzweil covers. Searle writes that computers can only manipulate symbols which are meaningless to them, an assertion which if true subverts much of the vision of the book.
Background
Ray Kurzweil is an inventor and serial entrepreneur. When The Age of Spiritual Machines was published he had already started four companies: Kurzweil Computer Products, Inc. which created optical character recognition and image scanning technology to assist the blind, Kurzweil Music Systems, which developed music synthesizers with high quality emulation of real instruments, Kurzweil Applied Intelligence, which created speech recognition technology, and Kurzweil Educational Systems, which made print-to-speech reading technology. Critics say predictions from his previous book The Age of Intelligent Machines "have largely come true" and "anticipated with uncanny accuracy mos |
https://en.wikipedia.org/wiki/Eisa | Eisa or EISA may refer to:
Computing
Extended Industry Standard Architecture, a bus standard for computer add-on cards
EISA partition, an OEM disk partition type
Enterprise information security architecture
Organisations
Electoral Institute of Southern Africa, former name of the Electoral Institute for Sustainable Democracy in Africa
Expert Imaging and Sound Association (EISA Awards)
European Initiative for Sustainable Development in Agriculture, an association of national and European agricultural associations and organisations
Other uses
Eisa, a daughter of the jötunn Logi in Norse mythology
Hossam Eisa, Egyptian politician and academic
Eisa (dance), a form of folk dance in Okinawa
Energy Independence and Security Act of 2007 (EISA 2007) |
https://en.wikipedia.org/wiki/Syllable%20Desktop | Syllable Desktop is a discontinued free and open-source operating system for Pentium and compatible processors. Its purpose is to create an easy-to-use desktop operating system for the home and small office user. It was forked from the stagnant AtheOS in July 2002.
It has a native web browser (Webster, which is WebKit-based), email client (Whisper), media player, IDE, and many more applications.
Another version of Syllable OS is the Syllable Server, which is based on Linux core.
Features
Features according to the official website include:
Native 64-bit journaled file system, the AtheOS File System (usually abbreviated to AFS in this context; not to be confused with the Andrew File System which shares the same abbreviation)
C++ oriented API
Object-oriented graphical desktop environment on a native GUI architecture
Mostly POSIX compliant
Software ports, including Vim, Perl, Python, Apache, others.
GNU toolchain (GCC, Glibc, Binutils, Make)
Preemptive multitasking with multithreading
Symmetric multiprocessing (multiple processor) support
Device drivers for most common hardware (video, sound, network chips)
File system drivers for FAT (read/write), NTFS (read) and ext2 (read)
Rebol as system scripting language
See also
Haiku (operating system)
References
Further reading
Michael Saunders (2 August 2004) Syllable - The Little OS with a Big Future, OSNews
Jeff Park (23 August 2006) Syllable: A different open source OS, Linux.com
Rohan Pearce (30 August 2011) Developer Q&A: Syllable OS, Techworld
Linux Format 78 (April 2006)
Linux Format 105 (May 2008)
External links
Free software operating systems
Hobbyist operating systems
Unix variants
X86 operating systems
Software using the GPL license |
https://en.wikipedia.org/wiki/Andy%20M%C3%BCller-Maguhn | Andy Müller-Maguhn (born 3 October 1971) is a member of the German hacker association Chaos Computer Club (CCC). Having been a member since 1986, he was appointed as a spokesman for the club in 1990, and later served on its board until 2012. He runs a company that develops cryptophones.
In an election in Autumn 2000, he was voted in as an at-large director of ICANN, which made him jointly responsible with 18 other directors for the worldwide development of guidelines and the decision of structural questions for the Internet structure.
In 1995, Müller-Maguhn founded the "Datenreisebüro" ('Data Travel Agency'), based in a Berlin office since 2002.
In 2005 and 2006, Müller-Maguhn was involved on the side of the parents of the deceased hacker Boris Floricic, better known as Tron, in the case where they sought to prevent German Wikipedia from disclosing his true name, although the name had appeared in many press accounts by that point in time.
As of 2018, Müller-Maguhn runs a data center, does advocacy, and security consulting for companies and governments. His work has taken him around the world, including Moscow, where he attended a security conference organized by the Russian Ministry of Defence in 2016 and 2017, London and Brazil.
Relationship with Julian Assange and WikiLeaks
In 2011, Müller-Maguhn was criticized for his role in the CCC board's controversial decision to expel former WikiLeaks spokesman Daniel Domscheit-Berg, which was often attributed to Müller-Maguhn's close relation to Wikileaks founder Julian Assange and an ongoing conflict between Assange and Domscheit-Berg. At a general meeting in February 2012, this decision was reverted, while Müller-Maguhn was not reelected to the board.
In 2011, Müller-Maguhn's company Bugged Planet worked with WikiLeaks on the Spy Files release.
The Mueller Report inferred that Müller-Maguhn may have assisted with transferring the DNC emails or the Podesta emails to WikiLeaks. In 2016, he delivered a USB to Assange, which he said contained personal messages for Assange, who had stopped using email. In July 2016, on the same day "Guccifer 2.0" sent Wikileaks encrypted files, Müller-Maguhn and Wau Holland board member Bernd Fix met with Assange for over four hours. According to The Washington Post, a former WikiLeaks associate said that, in 2016, Müller-Maguhn and a colleague oversaw submissions to WikiLeaks server. Müller-Maguhn said he did not oversee submissions.
Müller-Maguhn was an alleged target of UC Global's surveillance of Julian Assange in the Embassy.
Müller-Maguhn is Vice President for the Wau Holland Foundation and a member of the Advisory Board for the Courage Foundation.
He appeared with Julian Assange on Episode 8 and 9 of The World Tomorrow, "Cypherpunks: 1/2".
He is a contributor to Julian Assange's 2012 book Cypherpunks: Freedom and the Future of the Internet along with Jacob Appelbaum and Jérémie Zimmermann.
References
External links
Müller-Maguhn's homepage
1971 birth |
https://en.wikipedia.org/wiki/Thameslink | Thameslink is a 24-hour main-line route in the British railway system, running from , , , , , and via central London to , , , Rainham, , , and . The network opened as a through service in 1988, with severe overcrowding by 1998, carrying more than 28,000 passengers in the morning peak. All the services are currently operated by Govia Thameslink Railway.
The Thameslink Programme was a major £5.5billion scheme to increase capacity on the central London section by accommodating more frequent and longer trains, and providing additional routes and destinations. The new services began operating in 2018. In 2016, new Class 700 trains started operating on the route and replaced the Class 319, Class 377 and Class 387 trains which were withdrawn and transferred elsewhere.
Route
Much of the original route is over the Brighton Main Line (via London Bridge) and the southern part of the Midland Main Line, plus a suburban true loop (circuit) serving Sutton. A branch via the Catford Loop Line to Sevenoaks was added in 2012. Sections to Peterborough on the East Coast Main Line, Cambridge via the Cambridge Line, Horsham on the Arun Valley line and Rainham via Greenwich were added in 2018. East Grinstead is also served during peak hours.
The route through central London (today known as Thameslink core) is via St Pancras International for connections to Eurostar and the East Midlands; Farringdon, for London Underground Circle, Metropolitan and Hammersmith & City lines, and the Elizabeth line; City Thameslink, which replaced the demolished Holborn Viaduct station and has a southern entrance serving Ludgate Circus; Blackfriars, for main-line rail services and the Underground District and Circle lines; and London Bridge for main-line links into Kent and Sussex and the Underground Northern and Jubilee lines. King's Cross Thameslink on Pentonville Road closed on 8 December 2007.
Trains operating the "main line" service (Bedford and Cambridge to Brighton, Peterborough to Horsham) include first-class accommodation; those operating from Luton, St Albans and Kentish Town to Sutton, Sevenoaks and Orpington are usually standard class only. When Govia operated the original Thameslink franchise these services were designated "Thameslink CityFlier" and "Thameslink CityMetro" respectively, but First Capital Connect dropped this branding. Govia Thameslink Railway now refers to these services as Route TL1 (formerly Route 6) and Route TL2/TL3 (formerly Route 7/8) respectively.
Services
Off-peak
The Monday–Friday off-peak service pattern, with frequencies in trains per hour (tph), includes:
Peak hours
During peak hours, the two trains per hour London Blackfriars to Sevenoaks service (from the table above) is extended through the 'core tunnel' to/from Welwyn Garden City (though a few services originate at Finsbury Park), with extra calls at City Thameslink, Farringdon, St Pancras International, Finsbury Park, New Southgate, Oakleigh Park, New Barnet, Potters Bar and Hatfie |
https://en.wikipedia.org/wiki/Adele%20Goldberg | Adele Goldberg is the name of:
Adele Goldberg (computer scientist) (born 1945), computer scientist who wrote or co-wrote books on the programming language Smalltalk-80
Adele Goldberg (linguist) (born 1963), researcher in the field of linguistics |
https://en.wikipedia.org/wiki/Lattice%20C | The Lattice C Compiler was released in June 1982 by Lifeboat Associates and was the first C compiler for the IBM Personal Computer. The compiler sold for $500 and would run on PC DOS or MS-DOS (which at the time were the same product with different brandings). The first hardware requirements were given as 96KB of RAM and one (later two) floppy drives. It was ported to many other platforms, such as mainframes (MVS), minicomputers (VMS), workstations (UNIX), OS/2, the Commodore Amiga, Atari ST and the Sinclair QL.
The compiler was subsequently repackaged by Microsoft under a distribution agreement as Microsoft C version 2.0. Microsoft developed their own C compiler that was released in April 1985 as Microsoft C Compiler 3.0. Lattice was purchased by SAS Institute in 1987 and rebranded as SAS/C. After this, support for other platforms dwindled until compiler development ceased for all platforms except IBM mainframes. The product is still available in versions that run on other platforms, but these are cross compilers that only produce mainframe code.
Some of the early 1982 commercial software for the IBM PC was ported from CP/M (where it was written for the BDS C subset of the C language) to MS-DOS using Lattice C including Perfect Writer, PerfectCalc, PerfectSpeller and PerfectFiler. This suite was bundled with the Seequa Chameleon and Columbia Data Products.
LMK, make tool
LSE, screen editor
TMN, text management utilities
Reception
In a 1983 review of five C compilers for the IBM PC, BYTE chose Lattice C as the best in the "superior quality, but expensive and unsuited to the beginner" category. It cited the software's "quick compile and execution times, small incremental code, best documentation and consistent reliability". PC Magazine that year similarly praised Lattice C's documentation and compile-time and runtime performance, and stated that it was slightly superior to the CI-C86 and c-systems C compilers.
References
External links
Note: As of 2023, the domain lattice.com is used by a new company
C (programming language) compilers
Amiga development software
Atari ST software
DOS software
IBM mainframe software |
https://en.wikipedia.org/wiki/Brewster%20Kahle | Brewster Lurton Kahle ( ; born October 21, 1960) is an American digital librarian, a computer engineer, Internet entrepreneur, and advocate of universal access to all knowledge. In 1996, Kahle founded the Internet Archive and co-founded Alexa Internet. In 2012, he was inducted into the Internet Hall of Fame.
Life and career
Kahle was born in New York City and raised in Scarsdale, New York, the son of Margaret Mary (Lurton) and Robert Vinton Kahle, a mechanical engineer. He went to Scarsdale High School. He graduated from the Massachusetts Institute of Technology in 1982 with a Bachelor of Science in computer science and engineering, where he was a member of the Chi Phi Fraternity. The emphasis of his studies was artificial intelligence; he studied under Marvin Minsky and W. Daniel Hillis.
After graduation, he joined Thinking Machines team, where he was the lead engineer on the company's main product, the Connection Machine, for six years (1983–1989). There, he and others developed the WAIS system, the first Internet distributed search and document retrieval system, a precursor to the World Wide Web. In 1992, he co-founded, with Bruce Gilliat, WAIS, Inc. (sold to AOL in 1995 for $15 million), and, in 1996, Alexa Internet (sold to Amazon.com in 1999). At the same time as he started Alexa, he founded the Internet Archive, which he continues to direct. In 2001, he implemented the Wayback Machine, which allows public access to the World Wide Web archive that the Internet Archive has been gathering since 1996. Kahle was inspired to create the Wayback Machine after visiting the offices of Alta Vista, where he was struck by the immensity of the task being undertaken and achieved: to store and index everything that was on the Web. Kahle states: "I was standing there, looking at this machine that was the size of five or six Coke machines, and there was an 'aha moment' that said, 'You can do everything.'
Kahle was elected a member of the National Academy of Engineering (2010) for archiving, and making available, all forms of digital information. He is also a member of the Internet Hall of Fame, a Fellow of the American Academy of Arts and Sciences, and serves on the boards of the Electronic Frontier Foundation, Public Knowledge, the European Archive (now Internet memory) and the Television Archive. He is a member of the advisory board of the National Digital Information Infrastructure and Preservation Program of the Library of Congress, and is a member of the National Science Foundation Advisory Committee for Cyberinfrastructure. In 2010 he was given an honorary doctorate in computer science from Simmons College, where he studied library science in the 1980s.
Kahle and his wife, Mary Austin, run the Kahle/Austin Foundation. The Foundation supports the Free Software Foundation for its GNU Project, among other projects, with a total giving of about $4.5 million in 2011.
In 2012, Kahle and banking veteran Jordan Modell established Internet Archive Federa |
https://en.wikipedia.org/wiki/Mimer | Mimer may refer to:
The Swedish and Danish name of the Norse god Mímir
An iron ore mine in Norberg Municipality, Sweden
Mimer SQL, a database management system named after the Norse god
RoIP, a radio dispatch system
Maharashtra Institute of Medical Education and Research
Mizoram Institute of Medical Education & Research |
https://en.wikipedia.org/wiki/IBook | iBook is a line of laptop computers designed, manufactured, and sold by Apple Computer from 1999 to 2006. The line targeted entry-level, consumer and education markets, with lower specifications and prices than the PowerBook, Apple's higher-end line of laptop computers. It was the first mass consumer product to offer Wi-Fi network connectivity, which was then branded by Apple as AirPort.
The iBook had three different designs during its lifetime. The first, known as the "Clamshell", was inspired by the design of Apple's popular iMac line at the time. It was a significant departure from previous portable computer designs due to its shape, bright colors, incorporation of a handle into the casing, lack of a display closing latch, lack of a hinged cover over the external ports and built-in wireless networking. Two years later, the second generation abandoned the original form factor in favor of a more conventional, rectangular design. In October 2003, the third generation was introduced, adding a PowerPC G4 chip, USB 2.0 and a slot-loading drive.
They were very popular in education, with Henrico County Public Schools being the first of many school systems in the United States to distribute one to every student.
Apple replaced the iBook line with the MacBook in May 2006 during the Mac transition to Intel processors.
iBook G3 ("Clamshell")
In the late 1990s, Apple was trimming its product line from the bewildering variety of intersecting Performa, Quadra, LC, Power Macintosh and PowerBook models to a simplified "four box" strategy: desktop and portable computers, each in both consumer and professional models. Three boxes of this strategy were already in place: The newly introduced iMac was the consumer desktop, the Blue and White G3 filled the professional desktop box, and the PowerBook line served as the professional portable line. This left only the consumer portable space empty, leading to much rumor on the Internet of potential designs and features. Putting an end to this speculation, on July 21, 1999, Steve Jobs unveiled the iBook G3 during the keynote presentation of Macworld Conference & Expo, New York City.
Like the iMac, the iBook G3 had a PowerPC G3 CPU, and no legacy Apple interfaces. USB, Ethernet, modem ports and an optical drive were standard. The ports were left uncovered along the left side, as a cover was thought to be fragile and unnecessary with the iBook's new interfaces, which lacked the exposed pins of earlier connectors. Featuring a clamshell design, when the lid was closed, the hinge kept it firmly shut, so there was no need for a latch on the screen. The hinge included an integrated carrying handle. Additional power connectors on the bottom surface allowed multiple iBook G3s to be charged on a custom-made rack. The iBook G3 was the first Mac to use Apple's new "Unified Logic Board Architecture", which condensed all of the machine's core features into two chips, and added AGP and Ultra DMA support.
The iBook was the first |
https://en.wikipedia.org/wiki/Steve%20Mann%20%28inventor%29 | William Stephen George Mann (born 8 June 1962) is a Canadian engineer, professor, and inventor who works in augmented reality, computational photography, particularly wearable computing, and high-dynamic-range imaging. Mann is sometimes labeled the "Father of Wearable Computing" for early inventions and continuing contributions to the field. He cofounded InteraXon, makers of the Muse brain-sensing headband, and is also a founding member of the IEEE Council on Extended Intelligence (CXI). Mann is currently CTO and cofounder at Blueberry X Technologies and Chairman of MannLab.
Mann was born in Canada, and currently lives in Toronto, Canada, with his wife and two children. In 2023, Mann unsuccessfully ran for mayor of Toronto.
Early life and education
Mann holds a PhD in Media Arts and Sciences (1997) from the Massachusetts Institute of Technology and a B.Sc., B.Eng. and M.Eng. from McMaster University in 1987, 1989 and 1992, respectively. He was also inducted into the McMaster University Alumni Hall of Fame, Alumni Gallery 2004, in recognition of his career as an inventor and teacher. While at MIT, in then Director Nicholas Negroponte's words, "Steve Mann … brought the seed" that founded the Wearable Computing group in the Media Lab and "Steve Mann is the perfect example of someone … who persisted in his vision and ended up founding a new discipline." In 2004 he was named the recipient of the 2004 Leonardo Award for Excellence for his article "Existential Technology," published in Leonardo 36:1.
He is also General Chair of the IEEE International Symposium on Technology and Society, Associate Editor of IEEE Technology and Society, is a licensed Professional Engineer, and Senior Member of the IEEE, as well as a member of the IEEE Council on Extended Intelligence (CXI).
Career
Mann is a tenured full professor at the Department of Electrical and Computer Engineering, with cross-appointments to the Faculty of Arts and Sciences and Faculty of Forestry at the University of Toronto, and is a Professional Engineer licensed through Professional Engineers Ontario.
Ideas and inventions
Many of Mann's inventions pertain to the field of computational photography.
Chirplet transform, 1991: Mann was the first to propose and reduce to practice a signal representation based on a family of chirp signals, each associated with a coefficient, in a generalization of the wavelet transform that is now referred to as the chirplet transform.
"Digital Eye Glass," "Eye Glass," "Glass Eye," or "Glass", 1978: a device that, when worn, causes the human eye itself to effectively become both an electronic camera and a television display.
Comparametric equations, 1993: Mann was the first to propose and implement an algorithm to estimate a camera's response function from a plurality of differently exposed images of the same subject matter. He was also the first to propose and implement an algorithm to automatically extend dynamic range in an image by combining multiple differ |
https://en.wikipedia.org/wiki/AmigaDOS | AmigaDOS is the disk operating system of the AmigaOS, which includes file systems, file and directory manipulation, the command-line interface, and file redirection.
In AmigaOS 1.x, AmigaDOS is based on a TRIPOS port by MetaComCo, written in BCPL. BCPL does not use native pointers, so the more advanced functionality of the operating system was difficult to use and error-prone. The third-party AmigaDOS Resource Project (ARP, formerly the AmigaDOS Replacement Project), a project begun by Amiga developer Charlie Heath, replaced many of the BCPL utilities with smaller, more sophisticated equivalents written in C and assembler, and provided a wrapper library, arp.library. This eliminated the interfacing problems in applications by automatically performing conversions from native pointers (such as those used by C or assembler) to BCPL equivalents and vice versa for all AmigaDOS functions.
From AmigaOS 2.x onwards, AmigaDOS was rewritten in C, retaining 1.x compatibility where possible. Starting with AmigaOS 4, AmigaDOS abandoned its legacy with BCPL. Starting from AmigaOS 4.1, AmigaDOS has been extended with 64-bit file-access support.
Console
The Amiga console is a standard Amiga virtual device, normally assigned to CON: and driven by console.handler. It was developed from a primitive interface in AmigaOS 1.1, and became stable with versions 1.2 and 1.3, when it started to be known as AmigaShell and its original handler was replaced by newconsole.handler (NEWCON:).
The console has various features that were considered up to date when it was created in 1985, like command template help, redirection to null ("NIL:"), and ANSI color terminal. The new console handler – which was implemented in release 1.2 – allows many more features, such as command history, pipelines, and automatic creation of files when output is redirected. When TCP/IP stacks like AmiTCP were released in the early 1990s, the console could also receive redirection from Internet-enabled Amiga device handlers (e.g., TCP:, ).
Unlike other systems originally launched in the mid-1980s, AmigaDOS does not implement a proprietary character set; the developers chose to use the ANSI–ISO standard ISO-8859-1 (Latin 1), which includes the ASCII character set. As in Unix systems, the Amiga console accepts only linefeed ("LF") as an end-of-line ("EOL") character. The Amiga console has support for accented characters as well as for characters created by combinations of 'dead keys' on the keyboard.
Syntax of AmigaDOS commands
This is an example of typical AmigaDOS command syntax:
{|style="background:transparent"
| style="vertical-align:top;"| 1> Dir DF0:
|-
|
Without entering the directory tree, this shows the content of a directory of a floppy disk and lists subdirectories as well.
|-
| style="vertical-align:top;"| 1> Dir SYS: ALL
|-
|
The argument "ALL" causes the command to show the entire content of a volume or device, entering and expanding all directory trees. "SYS:" is a default name that |
https://en.wikipedia.org/wiki/Palm%20%28PDA%29 | Palm is a line of personal digital assistants (PDAs) and mobile phones developed by California-based Palm, Inc., originally called Palm Computing, Inc. Palm devices are often remembered as "the first wildly popular handheld computers," responsible for ushering in the smartphone era.
The first Palm device, the PalmPilot 1000, was released in 1996 and proved to be popular. It led a growing market for portable computing devices where previous attempts such as Apple's Newton failed or others like Hewlett-Packard's 200LX only serving a niche target market.
Most of Palm's PDAs and mobile phones ran the in-house Palm OS software which was later also licensed to other OEMs. A few devices ran on Microsoft's Windows Mobile. In 2009 Palm OS's successor webOS was released, first shipping with the Palm Pre. In 2011 Hewlett-Packard discontinued the Palm brand and started releasing new devices under the HP brand, but discontinued its hardware later that same year.
In 2018, a San Francisco start-up named Palm and backed by TCL Corporation (owner of the Palm brand) released a new device simply called Palm, although in essence it bears no relation to the original Palm devices.
History
Initial development
Pilot was the name of the first generation of personal digital assistants manufactured by Palm Computing in 1996 (by then a division of U.S. Robotics).
The inventors of the Pilot were Jeff Hawkins, Donna Dubinsky, and Ed Colligan, who founded Palm Computing in 1992. The original purpose of this company was to create handwriting recognition software, named PalmPrint, and personal information management (PIM) software, named PalmOrganizer for the PEN/GEOS based Zoomer devices. Their research convinced them, however, they could create better hardware as well. Before starting development of the Pilot, Hawkins said he carried a block of wood, the size of the potential Pilot, in his pocket for a week. Palm was widely perceived to have benefited from the notable, if ill-fated, earlier attempts to create a popular handheld computing platform by Go Corporation, Tandy, and Apple Computer (Newton).
PalmPilot1000 and 5000 (1996)
The prototype for the first Palm Connected Organizer was called "Palm Taxi". In 1996 Palm released its first generation PDA, the PalmPilot 1000 and 5000. After the out-of-court settlement in 1998 of a trademark infringement lawsuit brought by the Pilot Pen Corporation, the company no longer used that name, instead referring to its handheld devices as Palm Connected Organizers or more commonly as "Palms".
The first Palms, the Pilot 1000 and Pilot 5000, had no infrared port, backlight, or flash memory, but did have a serial communications port. Their RAM size was 128 kB and 512 kB respectively, and they used version 1 of Palm OS. Later, it became possible to upgrade the Pilot 1000 or 5000's internals to up to 1 MB of internal RAM. This was done with the purchase of an upgrade module sold by Palm, and the replacement of some internal hardware |
https://en.wikipedia.org/wiki/Greedy%20algorithm | A greedy algorithm is any algorithm that follows the problem-solving heuristic of making the locally optimal choice at each stage. In many problems, a greedy strategy does not produce an optimal solution, but a greedy heuristic can yield locally optimal solutions that approximate a globally optimal solution in a reasonable amount of time.
For example, a greedy strategy for the travelling salesman problem (which is of high computational complexity) is the following heuristic: "At each step of the journey, visit the nearest unvisited city." This heuristic does not intend to find the best solution, but it terminates in a reasonable number of steps; finding an optimal solution to such a complex problem typically requires unreasonably many steps. In mathematical optimization, greedy algorithms optimally solve combinatorial problems having the properties of matroids and give constant-factor approximations to optimization problems with the submodular structure.
Specifics
Greedy algorithms produce good solutions on some mathematical problems, but not on others. Most problems for which they work will have two properties:
Greedy choice property We can make whatever choice seems best at the moment and then solve the subproblems that arise later. The choice made by a greedy algorithm may depend on choices made so far, but not on future choices or all the solutions to the subproblem. It iteratively makes one greedy choice after another, reducing each given problem into a smaller one. In other words, a greedy algorithm never reconsiders its choices. This is the main difference from dynamic programming, which is exhaustive and is guaranteed to find the solution. After every stage, dynamic programming makes decisions based on all the decisions made in the previous stage and may reconsider the previous stage's algorithmic path to the solution.
Optimal substructure "A problem exhibits optimal substructure if an optimal solution to the problem contains optimal solutions to the sub-problems."
Cases of failure
Greedy algorithms fail to produce the optimal solution for many other problems and may even produce the unique worst possible solution. One example is the travelling salesman problem mentioned above: for each number of cities, there is an assignment of distances between the cities for which the nearest-neighbour heuristic produces the unique worst possible tour.
For other possible examples, see horizon effect.
Types
Greedy algorithms can be characterized as being 'short sighted', and also as 'non-recoverable'. They are ideal only for problems that have an 'optimal substructure'. Despite this, for many simple problems, the best-suited algorithms are greedy. It is important, however, to note that the greedy algorithm can be used as a selection algorithm to prioritize options within a search, or branch-and-bound algorithm. There are a few variations to the greedy algorithm:
Pure greedy algorithms
Orthogonal greedy algorithms
Relaxed greedy algorith |
https://en.wikipedia.org/wiki/Gravis%20PC%20GamePad | The Gravis PC GamePad is a game port game controller produced by Advanced Gravis Computer Technology first released in 1991. It was the first gamepad for the IBM PC compatible in a market then dominated by joysticks. Included with the gamepad was a shareware Commander Keen game, episode 1, Marooned on Mars, which was later replaced with the shareware episode 4, Secret of the Oracle which supported all 4 buttons. The gamepad is no longer manufactured, as Gravis was acquired in 1997 by Kensington Computer Products Group.
Features
The gamepad's design is similar to that of the stock SNES controller (more so the Japanese and European version with colored buttons), although it lacks the Start, Select and shoulder buttons, and the shape of the controller's chassis differs slightly, with an inverted curve on the left side. As originally found in some versions of the Master System controller, the center of the Gravis GamePad's d-pad allows a small joystick to be inserted. The resulting lever action provides increased directional sensitivity, desirable in fighting games for example.
Both at the top and bottom of the gamepad are switches. One of them removes the normal functionality from 2 of the buttons, and turns them into autofire variants of the first 2. This gave all four buttons functionality even in PC games that only supported two buttons on joysticks or for scenarios when two gamepads are connected with a Y-splitter. The other allows for left-handed operation by turning the workings of the D-pad and buttons upside down.
Variations
For PC, two followup variations were made, called the GamePad Pro, and GamePad Pro USB, which resemble the original PlayStation Controller, with the addition of four shoulder buttons, as well as Select and Start buttons. The GamePad Pro utilized the 'button' signal lines on an analog PC joystick port to send digital signals (referred to as "GrIP") to allow for both the use of ten buttons and the simultaneous use of up to four controllers connected by the controller's built-in piggyback plug. A switch on the pack of the non-USB pad could be used to allow the pad to function as a standard analog four-button pad; otherwise, games could not detect the gamepad unless they were coded with the device in mind (DOS) or a specific driver was installed (Windows). The latter uses the USB port and the USB Human Interface Device class standards, and is not intended for DOS use. Gravis also launched other series of gamepads for the Mac, the Amiga, and Atari ST.
The Philips CD-i interactive multimedia CD player features a wired controller that is basically the original Gravis PC GamePad in a monochrome, grey color scheme. The Gravis logo is replaced with the Philips logo. There are only two button functions, and the switch at the bottom controls the cursor speed in menus.
Reception
According to Next Generation, "The Gravis Game Pad, one of the first and probably the best PC game pad, has enjoyed steady sales for several years."
Me |
https://en.wikipedia.org/wiki/ICab | iCab is a web browser for Mac OS by Alexander Clauss, derived from Crystal Atari Browser (CAB) for Atari TOS compatible computers. It was one of the few browsers still updated for the classic Mac OS prior to that version being discontinued after version 3.0.5 in 2008; Classilla was the last browser that was maintained for that OS but it was discontinued in 2021.
The downloadable product is fully functional, but is nagware—periodically displaying a dialog box asking the user to register the product, and upgrade to the "Pro" version.
Versions
iCab 2.9.9 supports both 68k and PowerPC Macintosh systems running System 7.5 through Mac OS 9.2.2. While no longer maintained, iCab 2.9.9 is still available for download and registration.
iCab 2.9.8 runs natively on early versions of Mac OS X, but Mac OS X compatible versions of iCab 2.x are no longer officially available for download.
iCab 3.x can run on PowerPC systems running Mac OS 8.5 through Mac OS 9.2.2, or PowerPC or Intel systems running Mac OS X 10.1 or later. iCab 3 was last updated in January 2008.
iCab 4 was rewritten to use the Cocoa API and the WebKit rendering engine. It can run on PowerPC or Intel systems running Mac OS 10.3.9 or later.
iCab 5 was released on June 12, 2012. It runs on Mac OS 10.5 or later.
iCab 6 was rewritten using the new technologies in macOS Big Sur and released on October 31, 2020. It runs on macOS 10.13 or later.
History
The first versions of iCab were criticized for not supporting CSS and DOM. iCab 3 introduced improved rendering capabilities, including support for CSS2 and Unicode (via the ATSUI toolkit). iCab 4 switched to WebKit for its rendering engine, giving it the same rendering abilities as Apple's Safari browser.
On 7 June 2009, iCab 4.6, using the WebKit rendering engine, became the first desktop browser released to display a score of 100/100 and pass the Acid3 test. Apple's Safari 4 browser was released one day later and has been officially credited as being the first official release browser to pass the Acid3 test with a score of 100/100.
Features
iCab features a filter manager which allows users to avoid downloading advertisements and other content. Currently iCab comes with two filters (advertisements and video). Other kinds of filters add features, such as the YouTube video filter which adds a download link on all YouTube page views.
iCab has features for website developers, including an HTML validity checker, an automatic page refresh option, a Web Inspector, DOM Inspector, JavaScript debugger, and a Console. iCab's "Automatic Update" option, for any page it is rendering directly from the local hard disk, will automatically reload the page when changes are saved to disk. The HTML syntax validity checker displays a smiley face in the Status Bar and also, optionally, in the Toolbar. Clicking on the smiley will bring up a list of any errors on the page, as will "Error Report" from the Tools menu. Double clicking on an error will dis |
https://en.wikipedia.org/wiki/The%20Broads | The Broads (known for marketing purposes as The Broads National Park) is a network of mostly navigable rivers and lakes in the English counties of Norfolk and Suffolk. Although the terms "Norfolk Broads" and "Suffolk Broads" are correctly used to identify specific areas within the two counties respectively, the whole area is frequently referred to as the Norfolk Broads.
The lakes, known as broads, were formed by the flooding of peat workings. The Broads, and some surrounding land, were constituted as a special area with a level of protection similar to a national park by the Norfolk and Suffolk Broads Act 1988. The Broads Authority, a special statutory authority responsible for managing the area, became operational in 1989.
The area is , most of which is in Norfolk, with over of navigable waterways. There are seven rivers and 63 broads, mostly less than deep. Thirteen broads are generally open to navigation, with a further three having navigable channels. Some broads have navigation restrictions imposed on them in autumn and winter, although the legality of the restrictions is questionable.
The Broads has similar status to the national parks in England and Wales; the Broads Authority has powers and duties akin to the National Parks but is also the third-largest inland navigation authority. Because of its navigation role the Broads Authority was established under its own legislation on 1 April 1989. The Broads Authority Act 2009, which was promoted through Parliament by the authority, is intended to improve public safety on the water.
"Broads National Park" name
In January 2015 the Broads Authority approved a change in name of the area to the "Broads National Park", to recognise that the status of the area is equivalent to the English National Parks, that the Broads Authority shares the same two first purposes (relating to conservation and promoting enjoyment) as the English National Park Authorities, and receives a National Park grant.
This followed a three-month consultation which resulted in support from 79% of consultees, including unanimous support from the 14 UK national parks and the Campaign for National Parks. Defra, the Government department responsible for the parks, also expressed it was content that the Authority would make its own decision on the matter.
This is the subject of ongoing controversy among some Broads users who note that the Broads is not named in law as a National Park and claim the branding detracts from the Broads Authority's third purpose which is to protect the interests of navigation. In response to this, the Broads Authority has stated that its three purposes will remain in equal balance and that the branding is simply for marketing the National Park qualities of the Broads.
Management
The Broads Authority is the agency which has statutory responsibility for the Broads. The Nature Conservancy Council (now Natural England), pressed for a special authority to manage the Broads which had been neglected for |
https://en.wikipedia.org/wiki/Antikythera%20mechanism | The Antikythera mechanism ( ) is an Ancient Greek hand-powered orrery (model of the Solar System), described as the oldest known example of an analogue computer used to predict astronomical positions and eclipses decades in advance. It could also be used to track the four-year cycle of athletic games which was similar to an Olympiad, the cycle of the ancient Olympic Games.
This artefact was among wreckage retrieved from a shipwreck off the coast of the Greek island Antikythera in 1901. In 1902, it was identified by archaeologist Valerios Stais as containing a gear. The device, housed in the remains of a wooden-framed case of (uncertain) overall size , was found as one lump, later separated into three main fragments which are now divided into 82 separate fragments after conservation efforts. Four of these fragments contain gears, while inscriptions are found on many others. The largest gear is about in diameter and originally had 223 teeth.
In 2008, a team from Cardiff University used computer x-ray tomography and high resolution scanning to image inside fragments of the crust-encased mechanism and read the faintest inscriptions that once covered the outer casing. This suggests it had 37 meshing bronze gears enabling it to follow the movements of the Moon and the Sun through the zodiac, to predict eclipses and to model the irregular orbit of the Moon, where the Moon's velocity is higher in its perigee than in its apogee. This motion was studied in the 2nd century BC by astronomer Hipparchus of Rhodes, and he may have been consulted in the machine's construction. There is speculation that a portion of the mechanism is missing and it calculated the positions of the five classical planets. The inscriptions were further deciphered in 2016, revealing numbers connected with the synodic cycles of Venus and Saturn.
The instrument is believed to have been designed and constructed by Hellenistic scientists and been dated to about 87 BC, between 150 and 100 BC, or 205 BC. It must have been constructed before the shipwreck, which has been dated by multiple lines of evidence to approximately 70–60 BC. In 2022 researchers proposed its initial calibration date, not construction date, could have been 23 December 178 BC. Other experts propose 204 BC as a more likely calibration date. Machines with similar complexity did not appear again until the astronomical clocks of Richard of Wallingford in the 14th century. All known fragments of the mechanism are kept at the National Archaeological Museum, Athens, along with reconstructions and replicas, to demonstrate how it may have looked and worked.
History
Discovery
Captain Dimitrios Kontos () and a crew of sponge divers from Symi island discovered the Antikythera wreck in early 1900, and recovered artefacts during the first expedition with the Hellenic Royal Navy, in 1900–01. This wreck of a Roman cargo ship was found at a depth of off Point Glyphadia on the Greek island of Antikythera. The team retrieved numer |
https://en.wikipedia.org/wiki/Screensaver | A screensaver (or screen saver) is a computer program that blanks the display screen or fills it with moving images or patterns when the computer has been idle for a designated time. The original purpose of screensavers was to prevent phosphor burn-in on CRT or plasma computer monitors (hence the name). Though most modern monitors are not susceptible to this issue (with the notable exception of OLED technology, which has individual pixels vulnerable to burnout), screensaver programs are still used for other purposes. Screensavers are often set up to offer a basic layer of security by requiring a password to re-access the device. Some screensaver programs also use otherwise-idle computer resources to do useful work, such as processing for volunteer computing projects.
As well as computers, modern television operating systems, media players, and other digital entertainment systems may include optional screensavers.
Purpose
Screen protection
Before the advent of LCD screens, most computer screens were based on cathode ray tubes (CRTs). When the same image is displayed on a CRT screen for long periods, the properties of the exposed areas of the phosphor coating on the inside of the screen gradually and permanently change, eventually leading to a darkened shadow or "ghost" image on the screen, called a screen burn-in. Cathode ray televisions, oscilloscopes and other devices that use CRTs are all susceptible to phosphor burn-in, as are plasma displays to some extent.
Screen-saver programs were designed to help avoid these effects by automatically changing the images on the screen during periods of user inactivity.
For CRTs used in public, such as ATMs and railway ticketing machines, the risk of burn-in is especially high because a stand-by display is shown whenever the machine is not in use. Older machines designed without burn-in problems taken into consideration often display evidence of screen damage, with images or text such as "Please insert your card" (in the case of ATMs) visible even when the display changes while the machine is in use. Blanking the screen is out of the question as the machine would appear to be out of service. In these applications, burn-in can be prevented by shifting the position of the display contents every few seconds, or by having a number of different images that are changed regularly.
Later CRTs were much less susceptible to burn-in than older models due to improvements in phosphor coatings, and because modern computer images are generally lower contrast than the stark green- or white-on-black text and graphics of earlier machines. LCD computer monitors, including the display panels used in laptop computers, are not susceptible to burn-in because the image is not directly produced by phosphors (although they can suffer from a less extreme and usually non-permanent form of image persistence).
Modern usage
While modern screens are not susceptible to the issues discussed above, screensavers are still used. Prima |
https://en.wikipedia.org/wiki/Karl%20Koch%20%28hacker%29 | Karl Werner Lothar Koch (July 22, 1965 – c. May 23, 1989) was a German hacker in the 1980s, who called himself "hagbard", after Hagbard Celine. He was involved in a Cold War computer espionage incident.
Biography
Koch was born in Hanover. His mother died of cancer in 1976, his father had alcohol problems.
Koch was interested in astronomy as a teenager and was involved in the state student's council. In 1979 Karl's father gave him the 1975 book, Illuminatus! – The Golden Apple by Robert Anton Wilson and Robert Shea, which had a very strong influence to him. From his income as a member of the state students' council, he bought his first computer in 1982 and named it "FUCKUP" ("First Universal Cybernetic-Kinetic Ultra-Micro Programmer") after The Illuminatus! Trilogy. In August 1984 his father also died of cancer. In 1985 Koch and some other hackers founded the Computer-Stammtisch in a pub of the Hanover-Oststadt, which developed later into the Chaos Computer Club Hanover. During this time Koch came into contact with hard drugs more. In February 1987 Koch broke off a vacation in Spain, because of this – and had himself admitted to a Psychiatric clinic in Aachen for rehab treatments. He left the clinic in May 1987.
Hacking
He worked with the hackers known as DOB (Dirk-Otto Brezinski), Pengo (Hans Heinrich Hübner), and Urmel (Markus Hess), and was involved in selling hacked information from United States military computers to the KGB. Clifford Stoll's book The Cuckoo's Egg gives a first-person account of the hunt and eventual identification of Hess. Pengo and Koch subsequently came forward and confessed to the authorities under the espionage amnesty, which protected them from being prosecuted.
Death
Koch was found burned to death with gasoline in a forest near Celle, Germany. The death was officially claimed to be a suicide.
Koch left his workplace in his car to go for lunch; he had not returned by late afternoon, so his employer reported him as a missing person.
German police were alerted of an abandoned car in a forest near Celle on June 1, 1989; upon investigation, it appeared as though it had not moved for years, as it was covered in dust. The remains of Koch—at this point just bones—were discovered close by, a patch of scorched and burnt ground surrounding them, shoes missing. The scorched earth itself was controlled in a small circle around the corpse; it had not rained in some time, and the grass was perfectly dry. No suicide note was found with the body.
Despite his death being officially ruled a suicide, the unusual circumstances in which Koch's remains were found led to at least some speculation that Koch's death had not been self-inflicted; the patch of scorched ground surrounding the body was a small and seemingly controlled area, ostensibly too much so for death by self-immolation, with no suicide note having ever been found.
Karl Koch in media
Books
Movies
A German movie about his life, entitled 23, was released in 1998. Whil |
https://en.wikipedia.org/wiki/Taligent | Taligent Inc. (a portmanteau of "talent" and "intelligent") was an American software company. Based on the Pink object-oriented operating system conceived by Apple in 1988, Taligent Inc. was incorporated as an Apple/IBM partnership in 1992, and was dissolved into IBM in 1998.
In 1988, after launching System 6 and MultiFinder, Apple initiated the exploratory project named Pink to design the next generation of the classic Mac OS. Though diverging into a sprawling new dream system unrelated to Mac OS, Pink was wildly successful within Apple and a subject of industry hype without. In 1992, the new AIM alliance spawned an Apple/IBM partnership corporation named Taligent Inc., with the purpose of bringing Pink to market. In 1994, Hewlett-Packard joined the partnership with a 15% stake. After a two-year series of goal-shifting delays, Taligent OS was eventually canceled, but the CommonPoint application framework was launched in 1995 for AIX with a later beta for OS/2. CommonPoint had technological acclaim but an extremely complex learning curve, so sales were very low.
Taligent OS and CommonPoint mirrored the sprawling scope of IBM's complementary Workplace OS, in redundantly overlapping attempts to become the ultimate universal system to unify all of the world's computers and operating systems with a single microkernel. From 1993 to 1996, Taligent was seen as competing with Microsoft Cairo and NeXTSTEP, even though Taligent didn't ship a product until 1995 and Cairo never shipped at all. From 1994 to 1996, Apple floated the Copland operating system project intended to succeed System 7, but never had a modern OS sophisticated enough to run Taligent technology.
In 1995, Apple and HP withdrew from the Taligent partnership, licensed its technology, and left it as a wholly owned subsidiary of IBM. In January 1998, Taligent Inc. was finally dissolved into IBM. Taligent's legacy became the unbundling of CommonPoint's best compiler and application components and converting them into VisualAge C++ and the globally adopted Java Development Kit 1.1 (especially internationalization).
In 1996, Apple instead bought NeXT and began synthesizing the classic Mac OS with the NeXTSTEP operating system. Mac OS X was launched on March 24, 2001, as the future of the Macintosh and eventually the iPhone. In the late 2010s, some of Apple's personnel and design concepts from Pink and from Purple (the first iPhone's codename) would resurface and blend into Google's Fuchsia operating system.
Along with Workplace OS, Copland, and Cairo, Taligent is cited as a death march project of the 1990s, suffering from development hell as a result of feature creep and the second-system effect.
History
Development
The entire history of Pink and Taligent from 1988 to 1998 is that of a widely admired, anticipated, and theoretically competitive staff and its system, but is also overall defined by development hell, second-system effect, empire building, secrecy, and vaporware.
Pink team
|
https://en.wikipedia.org/wiki/Flocking | Flocking is the behavior exhibited when a group of birds, called a flock, are foraging or in flight. Sheep and goats also exhibit flocking behavior.
Computer simulations and mathematical models that have been developed to emulate the flocking behaviours of birds can also generally be applied to the "flocking" behaviour of other species. As a result, the term "flocking" is sometimes applied, in computer science, to species other than birds, to mean collective motion by a group of self-propelled entities, a collective animal behaviour exhibited by many living beings such as fish, bacteria, and insects.
Flocking is considered an emergent behaviour arising from simple rules that are followed by individuals and does not involve any central coordination.
In nature
There are parallels with the shoaling behaviour of fish, the swarming behaviour of insects, and herd behaviour of land animals. During the winter months, starlings are known for aggregating into huge flocks of hundreds to thousands of individuals, murmurations, which when they take flight altogether, render large displays of intriguing swirling patterns in the skies above observers.
Flocking behaviour was simulated on a computer in 1987 by Craig Reynolds with his simulation program, Boids. This program simulates simple agents (boids) that are allowed to move according to a set of basic rules. The result is akin to a flock of birds, a school of fish, or a swarm of insects.
Measurement
Measurements of bird flocking have been made using high-speed cameras, and a computer analysis has been made to test the simple rules of flocking mentioned below. It is found that they generally hold true in the case of bird flocking, but the long range attraction rule (cohesion) applies to the nearest 5–10 neighbors of the flocking bird and is independent of the distance of these neighbors from the bird. In addition, there is an anisotropy with regard to this cohesive tendency, with more cohesion being exhibited towards neighbors to the sides of the bird, rather than in front or behind. This is likely due to the field of vision of the flying bird being directed to the sides rather than directly forward or backward.
Another recent study is based on an analysis of high speed camera footage of flocks above Rome, and uses a computer model assuming minimal behavioural rules.
Algorithm
Rules
Basic models of flocking behaviour are controlled by three simple rules:
Separation
Avoid crowding neighbours (short range repulsion)
Alignment
Steer towards average heading of neighbours
Cohesion
Steer towards average position of neighbours (long range attraction)
With these three simple rules, the flock moves in an extremely realistic way, creating complex motion and interaction that would be extremely hard to create otherwise.
Rule variants
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 e |
https://en.wikipedia.org/wiki/Don%20Francisco%20%28television%20host%29 | Mario Luis Kreutzberger Blumenfeld (; born 28 December 1940), better known by his stage name as Don Francisco (), is a Chilean television host, and a popular personality on the Univision network reaching Spanish-speaking viewers in the United States. He is best known for hosting the former variety shows Sábado Gigante, Don Francisco Presenta and Don Francisco Te Invita.
Biography
Mario Luis Kreutzberger Blumenfeld was born in Talca, Chile on 28 December 1940, to Anna Blumenfeld Neufeld and Erick Kreutzberger, of German Jewish ancestry who fled to Chile to escape from World War II. He is of Jewish faith.
Career
Kreutzberger started a TV show in 1962, and he named it Show Dominical ("Sunday's Show") on Canal 13; the program's broadcasts were subsequently moved to Saturdays, and henceforth, was renamed Sábado Gigante. In it, he adapted many of the formulas he had seen in American television to the Chilean public. The show became an instant hit that lasted over 53 years. In 1986, the show began to be produced by SIN in Miami, Florida, with the same formula used in Chile, with the slightly different name of Sábado Gigante to KMEX-DT channel 34 Los Angeles.
For the next six years, Kreutzberger developed a three-hour-long variety show, which included contests, comedy, interviews and a traveling camera section. The traveling camera, or Cámara Viajera (originally La Película Extranjera, The Foreign Movie), has taken "Don Francisco" to over 185 countries worldwide, many of them more than once. Kreutzberger in his show has interviewed many celebrities, including Roberto Durán, Cristina Saralegui, Sussan Taunton, Charytín, Bill Clinton, George W. Bush, Barack Obama, Bill Gates and many others. Through a talent partnership with Memo Flores of Jugaremos en Familia, Sábado Gigante has helped launch the careers of many famous entertainers, such as Lili Estefan, Sissi Fleitas, and numerous others. Kreutzberger appeared as himself in the movie The 33, about the 2010 Copiapó mining accident.
Immediately after the 1973 Chilean coup d'état the military sought after Kreutzberger. They took him to the vandalized house of Salvador Allende, where corpses of guards were still on the floor. The soldiers asked him to report on the events. Kreutzberger declined the offer, encouraging the captain who had approached him to take the role of reporter himself.
Television career
Kreutzberger has also hosted Chilean versions of ¿Quién merece ser millonario? (which is based on the original British format of the international Who Wants to Be a Millionaire? franchise), Deal or No Deal, and Atrapa los Millones (which is based on the American format of the international Money Drop franchise). He hosted the first three seasons of Atrapa los Millones before retiring from the program in 2014; Diana Bolocco became the host for the program's fourth season in 2015, and would eventually remain with the show until its cancellation.
He voiced Governor Bernardo de Galvez in a 2003 episode, |
https://en.wikipedia.org/wiki/Amazon%20%28company%29 | Amazon.com, Inc. ( , ) is an American multinational technology company focusing on e-commerce, cloud computing, online advertising, digital streaming, and artificial intelligence. It has been often referred to as "one of the most influential economic and cultural forces in the world", and is often regarded as one of the world's most valuable brands. It is considered to be one of the Big Five American technology companies, alongside Alphabet (parent company of Google), Apple, Meta and Microsoft.
Amazon was founded by Jeff Bezos from his garage in Bellevue, Washington, on July 5, 1994. Initially an online marketplace for books, it has expanded into a multitude of product categories, a strategy that has earned it the moniker The Everything Store. It has multiple subsidiaries including Amazon Web Services (cloud computing), Zoox (autonomous vehicles), Kuiper Systems (satellite Internet), and Amazon Lab126 (computer hardware R&D). Its other subsidiaries include Ring, Twitch, IMDb, and Whole Foods Market. Its acquisition of Whole Foods in August 2017 for 13.4 billion substantially increased its footprint as a physical retailer.
Amazon has earned a reputation as a disruptor of well-established industries through technological innovation and "aggressive" reinvestment of profits into capital expenditures. , it is the world's largest online retailer and marketplace, smart speaker provider, cloud computing service through AWS, live-streaming service through Twitch, and Internet company as measured by revenue and market share. In 2021, it surpassed Walmart as the world's largest retailer outside of China, driven in large part by its paid subscription plan, Amazon Prime, which has over 200 million subscribers worldwide. It is the second-largest private employer in the United States.
Amazon also distributes a variety of downloadable and streaming content through its Amazon Prime Video, MGM+, Amazon Music, Twitch, and Audible units. It publishes books through its publishing arm, Amazon Publishing, film and television content through Amazon MGM Studios, including the Metro-Goldwyn-Mayer studio which acquired in March 2022. It also produces consumer electronics—most notably, Kindle e-readers, Echo devices, Fire tablets, and Fire TVs.
Amazon has been criticized for customer data collection practices, a toxic work culture, tax avoidance, and anti-competitive behavior.
History
1994–2009: early years
Amazon was founded on July 5, 1994, by Jeff Bezos, who chose the Seattle area for its abundance of technical talent, as Microsoft was in the area.
Amazon went public in May 1997. It began selling music and videos in 1998, and began international operations by acquiring online sellers of books in the United Kingdom and Germany. The following year, it began selling music, video games, consumer electronics, home improvement items, software, games, and toys.
In 2002, it launched Amazon Web Services (AWS), which initially focused on providing APIs for web developers |
https://en.wikipedia.org/wiki/Boosting%20%28machine%20learning%29 | In machine learning, boosting is an ensemble meta-algorithm for primarily reducing bias, and also variance in supervised learning, and a family of machine learning algorithms that convert weak learners to strong ones. Boosting is based on the question posed by Kearns and Valiant (1988, 1989): "Can a set of weak learners create a single strong learner?" A weak learner is defined to be a classifier that is only slightly correlated with the true classification (it can label examples better than random guessing). In contrast, a strong learner is a classifier that is arbitrarily well-correlated with the true classification.
Robert Schapire's affirmative answer in a 1990 paper to the question of Kearns and Valiant has had significant ramifications in machine learning and statistics, most notably leading to the development of boosting.
When first introduced, the hypothesis boosting problem simply referred to the process of turning a weak learner into a strong learner. "Informally, [the hypothesis boosting] problem asks whether an efficient learning algorithm […] that outputs a hypothesis whose performance is only slightly better than random guessing [i.e. a weak learner] implies the existence of an efficient algorithm that outputs a hypothesis of arbitrary accuracy [i.e. a strong learner]." Algorithms that achieve hypothesis boosting quickly became simply known as "boosting". Freund and Schapire's arcing (Adapt[at]ive Resampling and Combining), as a general technique, is more or less synonymous with boosting.
Boosting algorithms
While boosting is not algorithmically constrained, most boosting algorithms consist of iteratively learning weak classifiers with respect to a distribution and adding them to a final strong classifier. When they are added, they are weighted in a way that is related to the weak learners' accuracy. After a weak learner is added, the data weights are readjusted, known as "re-weighting". Misclassified input data gain a higher weight and examples that are classified correctly lose weight. Thus, future weak learners focus more on the examples that previous weak learners misclassified.
There are many boosting algorithms. The original ones, proposed by Robert Schapire (a recursive majority gate formulation) and Yoav Freund (boost by majority), were not adaptive and could not take full advantage of the weak learners. Schapire and Freund then developed AdaBoost, an adaptive boosting algorithm that won the prestigious Gödel Prize.
Only algorithms that are provable boosting algorithms in the probably approximately correct learning formulation can accurately be called boosting algorithms. Other algorithms that are similar in spirit to boosting algorithms are sometimes called "leveraging algorithms", although they are also sometimes incorrectly called boosting algorithms.
The main variation between many boosting algorithms is their method of weighting training data points and hypotheses. AdaBoost is very popular and the most signifi |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.