source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Th%C3%A9venin%27s%20theorem | As originally stated in terms of direct-current resistive circuits only, Thévenin's theorem states that "Any linear electrical network containing only voltage sources, current sources and resistances can be replaced at terminals by an equivalent combination of a voltage source in a series connection with a resistance ."
The equivalent voltage is the voltage obtained at terminals of the network with terminals open circuited.
The equivalent resistance is the resistance that the circuit between terminals and would have if all ideal voltage sources in the circuit were replaced by a short circuit and all ideal current sources were replaced by an open circuit.
If terminals and are connected to one another, the current flowing from and will be This means that could alternatively be calculated as divided by the short-circuit current between and when they are connected together.
In circuit theory terms, the theorem allows any one-port network to be reduced to a single voltage source and a single impedance.
The theorem also applies to frequency domain AC circuits consisting of reactive (inductive and capacitive) and resistive impedances. It means the theorem applies for AC in an exactly same way to DC except that resistances are generalized to impedances.
The theorem was independently derived in 1853 by the German scientist Hermann von Helmholtz and in 1883 by Léon Charles Thévenin (1857–1926), an electrical engineer with France's national Postes et Télégraphes telecommunications organization.
Thévenin's theorem and its dual, Norton's theorem, are widely used to make circuit analysis simpler and to study a circuit's initial-condition and steady-state response. Thévenin's theorem can be used to convert any circuit's sources and impedances to a Thévenin equivalent; use of the theorem may in some cases be more convenient than use of Kirchhoff's circuit laws.
Calculating the Thévenin equivalent
The equivalent circuit is a voltage source with voltage in series with a resistance .
The Thévenin-equivalent voltage is the open-circuit voltage at the output terminals of the original circuit. When calculating a Thévenin-equivalent voltage, the voltage divider principle is often useful, by declaring one terminal to be and the other terminal to be at the ground point.
The Thévenin-equivalent resistance is the resistance measured across points and "looking back" into the circuit. The resistance is measured after replacing all voltage- and current-sources with their internal resistances. That means an ideal voltage source is replaced with a short circuit, and an ideal current source is replaced with an open circuit. Resistance can then be calculated across the terminals using the formulae for series and parallel circuits. This method is valid only for circuits with independent sources. If there are dependent sources in the circuit, another method must be used such as connecting a test source across and and calculating the voltage acr |
https://en.wikipedia.org/wiki/London%20Weekend%20Television | London Weekend Television (LWT) (now part of the non-franchised ITV London region) was the ITV network franchise holder for Greater London and the Home Counties at weekends, broadcasting from Fridays at 5.15 pm (7:00 pm from 1968 until 1982) to Monday mornings at 6:00. From 1968 until 1992, when LWT's weekday counterpart was Thames Television, there was an on-screen handover to LWT on Friday nights (there was no handover back to Thames on Mondays, as from 1968 to 1982 there was no programming in the very early morning, and from 1983, when a national breakfast franchise was created, LWT would hand over to TV-am at 6:00am, which would then hand over to Thames at 9:25am). From 1993 to 2002, when LWT's weekday counterpart was Carlton Television, the transfer usually occurred invisibly during a commercial break, for Carlton and LWT shared studio and transmission facilities (although occasionally a Thames-to-LWT-style handover would appear).
Like most ITV regional franchises, including Carlton's, the London weekend franchise is now operated by ITV plc. The "London Weekend" franchise was renewed by Ofcom in 2015 for ten years and is still separately licensed, but is no longer distinguished on air. LWT is now managed with Carlton Television as a single entity (ITV London), although the name for the London Weekend licence on the Ofcom site is still "LWT". London Weekend Television Ltd is now (along with most other former regional companies owned by ITV plc) listed at Companies House as a "dormant company".
History
Early years
Creation
The London Television Consortium (LTC) was created and led by television presenter David Frost, who, at the time, was working for the London weekday ITV station Rediffusion. The consortium also included three ex-BBC members of staff: Michael Peacock (controller of BBC1), Frank Muir (assistant head of BBC comedy) and Doreen Stephens (head of children's output). Rediffusion's Controller of Programmes, Cyril Bennett, also joined the consortium, along with Clive Irving, theatre director Peter Hall and, for financial backing, Arnold Weinstock, managing director of GEC.
Frost had originally considered applying for the new Yorkshire region franchise, but the expected high number of applicants led to a change of plans. The second choice was to take on Rediffusion for their contract but, although it held the largest and most profitable licence, it was felt that the company was too powerful to challenge; equally, as an employee of the station, he felt it would be seen as an act of betrayal. Changes elsewhere in the system (notably the decision to make the Midlands licence a seven-day operation) led Frost to believe that the existing Midlands weekday broadcaster ATV had a significant risk of losing its London weekend contract.
The consortium's application promised a variety of highbrow arts and drama productions. It accordingly caught the attention of the regulator, the Independent Television Authority (ITA), and it seemed to a |
https://en.wikipedia.org/wiki/Pentagon%20%28computer%29 | The Pentagon (ru: Пентагон) home computer was a clone of the British-made Sinclair ZX Spectrum 128.
It was manufactured by amateurs in the former Soviet Union, following freely distributable documentation. Its PCB was copied all over the ex-USSR in 1991-1996, which made it a widespread ZX Spectrum clone.
The name "Pentagon" derives from the shape of the original PCB (Pentagon 48), with a diagonal cut in one of the corners.
Many simple devices (upgrades) were invented to connect to the Pentagon with some soldering.
Versions
Pentagon 48K (1989 by Vladimir Drozdov)
Pentagon 128K (1991)
Pentagon 128K 2+ (1991 by ATM)
Pentagon 128K 3+ (1993 by Solon)
Pentagon 1024SL v1.x (2005 by Alex Zhabin)
Pentagon-1024SL v2.x (2006 by Alex Zhabin)
Pentagon ver.2.666 (2009 by Alex Zhabin)
The Pentagon 1024SL v2.3 included most of the upgrades of the standard Spectrum architecture, including 1024 KB RAM, Beta 128 Disk Interface and ZX-BUS slots (especially for IDE and General Sound cards). This model also featured a "turbo" mode (7 MHz instead of the original's 3.50 MHz).
Upgrades from the original ZX Spectrum
Extra RAM ranging from 256 KB to 4 MB
Several sound card possibilities such as Covox (usually named as SounDrive) or DMA UltraSound
Additional video modes: 512x192 monochrome, 384x304, 256x192x15 (with no Attribute clash)
CMOS with persistent real-time clock
IDE Controller for hard drives
"Turbo Mode" that clocks the CPU up to 7 MHz
References
External links
Russian most popular Spectrum models
Pentagon 1024 official site
Schematic diagram of the Pentagon 48K and drive controller (DjVu)
128K Schematic diagram of the Pentagon (the DjVu)
Schematic and wiring diagrams Pentagon 128K 1991, revised and enlarged version (PNG)
Wiring diagram 128K the Pentagon (the PNG)
NEW English FaceBook Group
ZX Spectrum clones
Computer-related introductions in 1989
1989 establishments in the Soviet Union
Soviet computer systems |
https://en.wikipedia.org/wiki/Computer%20Go | Computer Go is the field of artificial intelligence (AI) dedicated to creating a computer program that plays the traditional board game Go. The field is sharply divided into two eras. Before 2015, the programs of the era were weak. The best efforts of the 1980s and 1990s produced only AIs that could be defeated by beginners, and AIs of the early 2000s were intermediate level at best. Professionals could defeat these programs even given handicaps of 10+ stones in favor of the AI. Many of the algorithms such as alpha-beta minimax that performed well as AIs for checkers and chess fell apart on Go's 19x19 board, as there were too many branching possibilities to consider. Creation of a human professional quality program with the techniques and hardware of the time was out of reach. Some AI researchers speculated that the problem was unsolvable without creation of human-like AI.
The application of Monte Carlo tree search to Go algorithms provided a notable improvement in the late 2000s decade, with programs finally able to achieve a low-dan level: that of an advanced amateur. High-dan amateurs and professionals could still exploit these programs' weaknesses and win consistently, but computer performance had advanced past the intermediate (single-digit kyu) level. The tantalizing unmet goal of defeating the best human players without a handicap, long thought unreachable, brought a burst of renewed interest. The key insight proved to be an application of machine learning and deep learning. DeepMind, a Google acquisition dedicated to AI research, produced AlphaGo in 2015 and announced it to the world in 2016. AlphaGo defeated Lee Sedol, a 9 dan professional, in a no-handicap match in 2016, then defeated Ke Jie in 2017, who at the time continuously held the world No. 1 ranking for two years. Just as checkers had fallen to machines in 1995 and chess in 1997, computer programs finally conquered humanity's greatest Go champions in 2016–2017. DeepMind did not release AlphaGo for public use, but various programs have been built since based on the journal articles DeepMind released describing AlphaGo and its variants.
Overview and history
Professional Go players see the game as requiring intuition, creative and strategic thinking. It has long been considered a difficult challenge in the field of artificial intelligence (AI) and is considerably more difficult to solve than chess. Many in the field considered Go to require more elements that mimic human thought than chess. Mathematician I. J. Good wrote in 1965:
Prior to 2015, the best Go programs only managed to reach amateur dan level. On the small 9×9 board, the computer fared better, and some programs managed to win a fraction of their 9×9 games against professional players. Prior to AlphaGo, some researchers had claimed that computers would never defeat top humans at Go.
Early decades
The first Go program was written by Albert Lindsey Zobrist in 1968 as part of his thesis on pattern recog |
https://en.wikipedia.org/wiki/Scale-free%20network | A scale-free network is a network whose degree distribution follows a power law, at least asymptotically. That is, the fraction P(k) of nodes in the network having k connections to other nodes goes for large values of k as
where is a parameter whose value is typically in the range (wherein the second moment (scale parameter) of is infinite but the first moment is finite), although occasionally it may lie outside these bounds. The name "scale-free" could be explained by the fact that some moments of the degree distribution are not defined, so that the network does not have a characteristic scale or "size".
Many networks have been reported to be scale-free, although statistical analysis has refuted many of these claims and seriously questioned others. Additionally, some have argued that simply knowing that a degree-distribution is fat-tailed is more important than knowing whether a network is scale-free according to statistically rigorous definitions.
Preferential attachment and the fitness model have been proposed as mechanisms to explain conjectured power law degree distributions in real networks. Alternative models such as super-linear preferential attachment and second-neighbour preferential attachment may appear to generate transient scale-free networks, but the degree distribution deviates from a power law as networks become very large.
History
In studies of the networks of citations between scientific papers, Derek de Solla Price showed in 1965 that the number of links to papers—i.e., the number of citations they receive—had a heavy-tailed distribution following a Pareto distribution or power law, and thus that the citation network is scale-free. He did not however use the term "scale-free network", which was not coined until some decades later. In a later paper in 1976, Price also proposed a mechanism to explain the occurrence of power laws in citation networks, which he called "cumulative advantage" but which is today more commonly known under the name preferential attachment.
Recent interest in scale-free networks started in 1999 with work by Albert-László Barabási and Réka Albert at the University of Notre Dame who mapped the topology of a portion of the World Wide Web, finding that some nodes, which they called "hubs", had many more connections than others and that the network as a whole had a power-law distribution of the number of links connecting to a node. After finding that a few other networks, including some social and biological networks, also had heavy-tailed degree distributions, Barabási and Réka Albert coined the term "scale-free network" to describe the class of networks that exhibit a power-law degree distribution. However, studying seven examples of networks in social, economic, technological, biological, and physical systems, Amaral et al. were not able to find a scale-free network among these seven examples. Only one of these examples, the movie-actor network, had degree distribution P(k) following a power law re |
https://en.wikipedia.org/wiki/Col%20Needham | Colin Needham (born 26 January 1967) is a British computer engineer who is known as the founder and CEO of IMDb. He has been general manager of IMDb since its acquisition by Amazon in 1998.
Early life
Needham was born in Denton, Lancashire, and grew up on Stockport Road. He attended Audenshaw School and Clarendon Sixth Form College in Hyde. He graduated from the University of Leeds with a BSc (Hons) in Computer Science in 1988.
Career
IMDb was started in 1990 while Needham was working as an engineer in Bristol at Hewlett-Packard (HP). The site evolved from what was initially his personal movie database, which became an internet bulletin board made from simple records, kept on a succession of early computers and contributed to by several persons, all of whom Needham outlasted.
By the summer of 1996, thanks to IMDb's first film-related advertising campaign (for Independence Day), Needham had quit HP to work on IMDb full-time as a paid employee. In 1999, he collected two Webby Awards for IMDb. In February 2017, Needham decided to remove the message boards from IMDb, stating that the message boards "are no longer providing a positive, useful experience for the vast majority of our more than 250 million monthly users worldwide".
Personal life
Needham married Karen Gaskin in 1989. They have twin daughters and live in Filton, Gloucestershire. He is a fan of early 20th-century classical Russian composers, particularly Dmitri Shostakovich.
References
External links
Col Needham interview – The Open Mind, 21 February 2015
British Internet celebrities
Businesspeople from Manchester
Amazon (company) people
1967 births
Living people
People from Denton, Greater Manchester
People from South Gloucestershire District
Alumni of the University of Leeds |
https://en.wikipedia.org/wiki/Distro | Distro may refer to:
Linux distribution, a specific vendor's operating system-package composed of the Linux kernel, GNU tools and libraries, additional software based on a package management system.
Software distro, a set of software components (i.e. open source components) assembled into a working whole and distributed to a user community.
A zine distribution service |
https://en.wikipedia.org/wiki/Amiga%20Unix | Amiga Unix (informally known as Amix) is a discontinued full port of AT&T Unix System V Release 4 operating system developed by Commodore-Amiga, Inc. in 1990 for the Amiga computer family as an alternative to AmigaOS, which shipped by default.
Overview
Bundled with the Amiga 2500UX and Amiga 3000UX, Commodore's Unix was one of the first ports of SVR4 to the 68k architecture. The Amiga A3000UX model even got the attention of Sun Microsystems, though ultimately nothing came of it.
Unlike Apple's A/UX compatibility layer for System 7 applications, Amiga Unix contains no compatibility layer for AmigaOS applications. With few native applications available to take advantage of the Amiga's significant multimedia capabilities, it failed to find a niche in the competitive Unix workstation market of the early 1990s. The A3000UX's price of was also not very attractive compared to other Unix workstations at the time, such as the NeXTstation ($5,000 for a base system, with a full API and many times the number of applications available), the SGI Indigo (starting at $8,000), or the Personal DECstation 5000 Model 25 (starting at $5,000). Sun, HP, and IBM had similarly priced systems. The A3000UX's 68030 was noticeably underpowered compared to most of its RISC-based competitors.
Unlike typical commercial Unix distributions of the time, Amiga Unix included the source code to the vendor-specific enhancements and platform-dependent device drivers (essentially any part that wasn't owned by AT&T), allowing interested users to study or enhance those parts of the system. However this source code was subject to the same license terms as the binary part of the system it was not free software. Amiga Unix also incorporated and depended upon many open source components, such as the GNU C Compiler and X Window System, and included their source code.
Like many other proprietary Unix variants with small market shares, Amiga Unix vanished into the mists of computer history when its vendor, Commodore, went out of business. Today, Unix-like operating systems such as Minix, NetBSD, and Linux are available for the Amiga platform.
See also
Atari TT030, Unix workstation from Atari
References
External links
Manual: Commodore, Amiga Unix, System V Release 4, Learning Amiga Unix (11/1990)
The Very Unofficial Commodore Amiga Unix (AMIX) Wiki
Video of AMIX running under FS-UAE
Amiga
Discontinued operating systems
UNIX System V |
https://en.wikipedia.org/wiki/Employee%20research | In organizational development (OD), employee research involves the use of surveys, focus groups and other data-gathering methods to find out the attitudes, opinions and feelings of members of an organization.
See also
Employee survey
Interviewing
Focus group
Customer satisfaction
References
Peter Goudge. Employee Research: How to Increase Employee Involvement Through Consultation. Kogan Page. 2006. .
Organizational theory |
https://en.wikipedia.org/wiki/T%C5%8Dkaid%C5%8D%20Main%20Line | The is a major Japanese railway line of the Japan Railways Group (JR Group) network, connecting and stations. It is long, not counting its many freight feeder lines around the major cities. The high-speed Tōkaidō Shinkansen largely parallels the line.
The term "Tōkaidō Main Line" is largely a holdover from pre-Shinkansen days; now various portions of the line have different names which are officially used by JR East, JR Central, and JR West. Today, the only daily passenger train that travels the entire length of the line is the combined overnight-train Sunrise Izumo - Sunrise Seto. During the day longer intercity trips using the line require several transfers along the way.
The Tokaido Main Line is owned and operated by three JR companies:
East Japan Railway Company (JR East) ( - ) Tōkaidō Line
Central Japan Railway Company (JR Central) ( - ) Tōkaidō Line
West Japan Railway Company (JR West) ( - ) Biwako Line, JR Kyoto Line, JR Kobe Line
Basic data
Total distance: (including branch lines; Tokyo – Kōbe is )
East Japan Railway Company (JR East) (Services and tracks)
Tokyo – Atami:
Shinagawa – Shin-Kawasaki – Tsurumi:
Hamamatsuchō – Tokyo Freight Terminal – Kawasaki Freight Terminal – Hama-Kawasaki: (Tōkaidō Freight Line)
Tsurumi – Hatchō-Nawate: (Tōkaidō Freight Line)
Tsurumi – Higashi-Takashima – Sakuragichō: (Takashima Line)
Tsurumi – Yokohama-Hazawa – Higashi-Totsuka: (Tōkaidō Freight Line)
Central Japan Railway Company (JR Central) (Services and tracks)
Atami – Maibara: ( between Kanayama – Nagoya overlaps with Chuo Main Line)
Ōgaki – Mino-Akasaka: (Mino-Akasaka branch line)
Ōgaki – (Shin-Tarui) – Sekigahara: (Shin-Tarui Line)
West Japan Railway Company (JR West) (Services and tracks)
Maibara – Kōbe:
Kyōto Freight Terminal – Tambaguchi: (not in use by passenger trains)
Suita – (Miyahara Rail Yard) – Amagasaki: (Hoppō Freight Line)
Suita – Umeda – Fukushima: (Umeda Freight Line, used by Haruka and Kuroshio limited expresses)
Japan Freight Railway Company (JR Freight) (Tracks and services)
Sannō Signal – Nagoya-Minato: (Nagoya-Minato Line)
Suita Signal – Osaka Freight Terminal: (Osaka Terminal Line)
Japan Freight Railway Company (JR Freight) (Services only)
Shinagawa – Atami:
Shinagawa – Shin-Tsurumi Signal:
Tokyo Freight Terminal – Hama-Kawasaki:
Tsurumi – Yokohama-Hazawa – Higashi-Totsuka:
Tsurumi – Hatchō-Nawate:
Tsurumi – Shinkō – Sakuragichō:
Atami – Maibara:
Minami-Arao Signal – Sekigahara:
Minami-Arao Signal – Mino-Akasaka:
Maibara – Kōbe: (via Hoppō Freight Line)
Kyōto Freight Terminal – Tambaguchi:
Suita – Umeda – Fukushima:
Gauge: Narrow gauge railway
Stations:
Passenger: 166 (does not include Shinagawa – Shin-Kawasaki – Tsurumi section or branches other than Mino-Akasaka branch line)
JR East: 34
JR Central: 82
JR West: 50
Freight only: 14
Tracks:
Four or more
Tokyo – Odawara:
Nagoya – Inazawa:
Kusatsu – Kōbe:
Two
Odawara – Nagoya
Inazawa – Kusatsu
Shinagawa – Shin-Kawasaki – T |
https://en.wikipedia.org/wiki/Neoism | Neoism is a parodistic -ism. It refers both to a specific subcultural network of artistic performance and media experimentalists, and, more generally, to a practical underground philosophy. It operates with collectively shared pseudonyms and identities, pranks, paradoxes, plagiarism and fakes, and has created multiple contradicting definitions of itself in order to defy categorization and historization.
Background
Definitions of Neoism were always disputed. The
main source of this is the undefinable concept of Neoism which created
vastly different, tactically distorted accounts of Neoism and its
history. Undisputed, however, are the origin of the movement in the late 1970s Canada. It was initiated by Hungarian-born Canadian performance and media-artist Istvan Kantor (aka Monty Cantsin) in 1979, in Montreal. At around the same time the open-pop-star identity of Monty Cantsin was spread through the Mail Artist David Zack
(born New Orleans, June 12, 1938, died presumably in Texas ca. 1995) with the collaboration of artists Maris Kudzins and performance artist Istvan Kantor.
Schisms followed in the mid-1980s. Questions and concerns arose about whether the "open pop star" Monty Cantsin moniker was being overly associated with certain individuals. Later, writer Stewart Home sought to separate himself from the rest of the Neoist network, manifesting itself in Home's books on Neoism as opposed to the various Neoist resources in the Internet. In non-Neoist terms, Neoism could be called an international subculture which in the beginning put itself into simultaneous continuity and discontinuity with, among others, experimental arts (such as Dada, Surrealism, Fluxus and Concept Art), punk, industrial music and electropop, political and religious free-spirit movements, science fiction literature, 'pataphysics and speculative science. Neoism also gathered players with backgrounds in graffiti and street performance, language writing (later known as language poetry), experimental film and video, Mail Art, the early Church of the Subgenius and gay and lesbian culture. Neoism then gradually transformed from an active subculture into a self-written urban legend. As a side effect, many other subcultures, artistic and political groups since the late 1980s have—often vaguely—referred to or even opposed Neoism and thereby perpetuated its myth.
Since the gradual disappearance of Neoism in the 1990s, brief offshoots have appeared including The Seven By Nine Squares, Stewart Home's frequent use of Karen Eliot (as well as Sandy Larson, Luther Blissett (nom de plume) and others) to replace Monty Cantsin as the embodiment of the open pop star concept. "This project... confuses the restrictions that both define and delimit individual identity.... Changing details, such as biographical particulars... are usually considered indispensable in securing the signature of an individual."
History
Neoism, as a name for a different context, was coined in 1914 by the American sat |
https://en.wikipedia.org/wiki/Allocation | Allocation may refer to:
Computing
Block allocation map
C++ allocators
Delayed allocation
File allocation table
IP address allocation
Memory allocation
No-write allocation (cache)
Register allocation
Economics
Asset allocation
Economic system
Market allocation scheme
Resource allocation
Tax allocation district
Telecommunication
Call-sign allocation plan
Frequency allocation
Type allocation code
Other
Allocution (law), or allocutus, is a formal statement made to the court
Allocation (oil and gas) in hydrocarbon accounting to assign the proper portions of aggregated petroleum and gas flows back to contributing sources
Allocation voting in voting
Location-allocation, used in geographic information systems (GIS)
The allocation of scarce resources in operations research
See also
Location (disambiguation) |
https://en.wikipedia.org/wiki/Inform | Inform is a programming language and design system for interactive fiction originally created in 1993 by Graham Nelson. Inform can generate programs designed for the Z-code or Glulx virtual machines. Versions 1 through 5 were released between 1993 and 1996. Around 1996, Nelson rewrote Inform from first principles to create version 6 (or Inform 6). Over the following decade, version 6 became reasonably stable and a popular language for writing interactive fiction. In 2006, Nelson released Inform 7 (briefly known as Natural Inform), a completely new language based on principles of natural language and a new set of tools based around a book-publishing metaphor.
Z-Machine and Glulx
The Inform compilers translate Inform code to story files for Glulx or Z-code, two virtual machines designed specifically for interactive fiction. Glulx, which can support larger games, is the default.
The Z-machine was originally developed by Infocom in 1979 for their interactive fiction titles. Because there is at least one such interpreter for nearly every major and minor platform, this means that the same Z-code file can be run on a multitude of platforms with no alterations. Originally Inform targeted the Z-machine only.
Andrew Plotkin created an unofficial version of Inform 6 that was also capable of generating files for Glulx, a virtual machine he had designed to overcome many of the limitations of the several-decades-old Z-machine. Starting with Inform 6.3, released February 29, 2004, Inform 6 has included official support for both virtual machines, based on Andrew Plotkin's work. Early release of Inform 7 did not support Glulx, but in August 2006 Glulx support was released.
Inform 6
Inform was originally created by Graham Nelson in 1993. In 1996 Nelson rewrote Inform from first principles to create version 6 (or Inform 6). Over the following decade, version 6 became reasonably stable and a popular language for writing interactive fiction.
The Inform 6 system consists of two major components: the Inform compiler, which generates story files from Inform source code, and the Inform library, a suite of software which handles most of the difficult work of parsing the player's text input and keeping track of the world model. The name Inform also refers to the Inform programming language that the compiler understands.
Although Inform 6 and the Z-Machine were originally designed with interactive fiction in mind, many other programs have been developed, including a BASIC interpreter, a LISP tutorial (complete with interpreter), a Tetris game, and a version of the game Snake.
The Inform 6 compiler
The Inform compiler generates files for the Z-machine or Glulx (also called story files) from Inform 6 source code.
The Inform 6 programming language
The Inform programming language is object-oriented and procedural. A key element of the language is objects. Objects are maintained in an object tree which lists the parent–child relationships between objects. Sinc |
https://en.wikipedia.org/wiki/TADS | Text Adventure Development System (TADS) is a prototype-based domain-specific programming language and set of standard libraries for creating interactive fiction (IF) games.
History
The original TADS 1 was released by High Energy Software as shareware in 1988, and was followed by TADS 2 not long after. From the late 1980s to early 1990s, free development tools such as TADS and Inform enabled amateur communities to create interactive fiction. In the mid-1990s, TADS was a top development tool for interactive fiction. At the time, it was a more improved tool for parsing and world building than existing systems like AGT (Adventure Game Toolkit).
TADS 2 syntax is based on C, with bits of Pascal. TADS 2 has been maintained and updated at regular intervals by its creator, Michael J. Roberts, even after it became freeware in July 1996. Graham Nelson, creator of Inform, describes Inform and TADS as the "only two systems... widely used" in the last half of the 1990s, and TADS has been called "The second most commonly used IF programming language today". Multimedia TADS, introduced in 1998, allows games to display graphics, animation and play sounds, if the platform supports it.
In 2006, TADS received a major overhaul with the release of TADS 3, which is a complete rewrite of the TADS engine, only retaining the platform-dependent code to ease porting. TADS 3 uses a language with a syntax that resembles C++ and Java. It has many new features, such as efficient dynamic objects (with automatic garbage collection), structured exceptions, native UTF-8 strings, and many useful function classes.
The TADS 3 compiler and interpreter have been ported to the DOS, Macintosh and Unix platforms. Several TADS 3 games have been released.
TADS games
Games written in TADS are compiled to a platform-independent format that can be played on any computer for which a suitable virtual machine (VM) exists. Such virtual machines exist for several platforms, and in this respect, TADS closely follows the example of the original Infocom Z-machine, as well as modern languages such as Java and C#.
Whereas the TADS 1 and 2 VMs had to parse the commands entered by the player, before sending the results on to the game, TADS 3 employs a more general-purpose virtual machine, where the command-parsing is done by the game code itself, akin to Inform. The rationale for this is that it is easier to customize the parser.
Notable games developed in TADS 2
Uncle Zebulon's Will, by Magnus Olsson (1995). It won the TADS category at the inaugural 1995 Interactive Fiction Competition and was included on Activision's 1996 commercial release of Classic Text Adventure Masterpieces of Infocom.
The Frenetic Five vs. Sturm und Drang, the first game in the "Frenetic Five" series by Neil deMause (1997). The game won a XYZZY Award for Best NPCs that year.
Worlds Apart by Suzanne Britton (1999). Winner of XYZZY Award for Best Story and finalist in seven other XYZZY Award categories in 1999, the game |
https://en.wikipedia.org/wiki/Viterbi%20algorithm | The Viterbi algorithm is a dynamic programming algorithm for obtaining the maximum a posteriori probability estimate of the most likely sequence of hidden states—called the Viterbi path—that results in a sequence of observed events, especially in the context of Markov information sources and hidden Markov models (HMM).
The algorithm has found universal application in decoding the convolutional codes used in both CDMA and GSM digital cellular, dial-up modems, satellite, deep-space communications, and 802.11 wireless LANs. It is now also commonly used in speech recognition, speech synthesis, diarization, keyword spotting, computational linguistics, and bioinformatics. For example, in speech-to-text (speech recognition), the acoustic signal is treated as the observed sequence of events, and a string of text is considered to be the "hidden cause" of the acoustic signal. The Viterbi algorithm finds the most likely string of text given the acoustic signal.
History
The Viterbi algorithm is named after Andrew Viterbi, who proposed it in 1967 as a decoding algorithm for convolutional codes over noisy digital communication links. It has, however, a history of multiple invention, with at least seven independent discoveries, including those by Viterbi, Needleman and Wunsch, and Wagner and Fischer. It was introduced to Natural Language Processing as a method of part-of-speech tagging as early as 1987.
Viterbi path and Viterbi algorithm have become standard terms for the application of dynamic programming algorithms to maximization problems involving probabilities.
For example, in statistical parsing a dynamic programming algorithm can be used to discover the single most likely context-free derivation (parse) of a string, which is commonly called the "Viterbi parse". Another application is in target tracking, where the track is computed that assigns a maximum likelihood to a sequence of observations.
Extensions
A generalization of the Viterbi algorithm, termed the max-sum algorithm (or max-product algorithm) can be used to find the most likely assignment of all or some subset of latent variables in a large number of graphical models, e.g. Bayesian networks, Markov random fields and conditional random fields. The latent variables need, in general, to be connected in a way somewhat similar to a hidden Markov model (HMM), with a limited number of connections between variables and some type of linear structure among the variables. The general algorithm involves message passing and is substantially similar to the belief propagation algorithm (which is the generalization of the forward-backward algorithm).
With the algorithm called iterative Viterbi decoding one can find the subsequence of an observation that matches best (on average) to a given hidden Markov model. This algorithm is proposed by Qi Wang et al. to deal with turbo code. Iterative Viterbi decoding works by iteratively invoking a modified Viterbi algorithm, reestimating the score for a filler u |
https://en.wikipedia.org/wiki/Heroes%20of%20Might%20and%20Magic | Heroes of Might and Magic, known as Might & Magic Heroes since 2011, is a series of video games originally created and developed by Jon Van Caneghem through New World Computing.
As part of the Might and Magic franchise, the series changed ownership when NWC was acquired by 3DO and again when 3DO closed down and sold the rights to Ubisoft. The games feature turn-based, fantasy-themed conflicts in which players control armies of mythical creatures. The series began in 1995 with the release of the first title. A seventh installment, Might & Magic Heroes VII, was released on September 29, 2015.
New World Computing closed after the production of Heroes of Might and Magic IV, and since then the rights to the franchise have been owned by Ubisoft. Nival Interactive developed the first game in the series since the changeover, Heroes of Might and Magic V. Black Hole Entertainment developed its sequel Might & Magic Heroes VI, but Limbic Entertainment developed later patches and the DLC, as well as Might & Magic Heroes VII. Virtuos developed the Shades of Darkness standalone expansion for Heroes VI.
The series is directed primarily at the DOS and Windows platforms, with sporadic support for macOS over the years. In addition to Windows and Mac platforms, Heroes II was ported to RISC OS and Heroes III was ported to Linux. GameTap carried the first four games in the series beginning in 2006. Remakes have also appeared on the Game Boy Color.
Games
King's Bounty (1990), an earlier game from New World Computing, largely anticipated the design of Heroes and is included in some Heroes anthologies. It was later remade and branded as a Heroes title for the PlayStation 2 game, Quest for the Dragon Bone Staff. A sequel to King's Bounty was released in 2008 as King's Bounty: The Legend.
Main series
Heroes of Might and Magic: A Strategic Quest (1995)
Heroes of Might and Magic II (1996)
The Price of Loyalty (1997)
Heroes of Might and Magic III (The Restoration of Erathia) (1999)
Armageddon's Blade (1999)
The Shadow of Death (2000)
Heroes of Might and Magic IV (2002)
The Gathering Storm (2002)
Winds of War (2003)
Heroes of Might and Magic V (2006)
Hammers of Fate (2006)
Tribes of the East (2007)
Might & Magic Heroes VI (2011)
Pirates of the Savage Sea Adventure (2012)
Danse Macabre (2012)
Shades of Darkness (2013)
Might & Magic Heroes VII (2015)Lost Tales of Axeoth: Unity (2016)Lost Tales of Axeoth: Every Dog Has His Day (2016)Trial by Fire (2016)
Spin-offsHeroes of Might and Magic (Game Boy Color, 2000)Heroes of Might and Magic II (Game Boy Color, 2000)Heroes Chronicles (2000)Heroes of Might and Magic: Quest for the Dragon Bone Staff (PlayStation 2, 2001)Heroes of Might and Magic Online (2008)Might and Magic: Heroes Kingdoms (MMO, 2009)Might & Magic Heroes: Era of Chaos (2017)
Related titlesKing's Bounty (1990), considered the forerunner of the seriesDark Messiah of Might and Magic (2006), continues the story of Heroes VMight & Magic: Clash of Heroes (2009), a pre |
https://en.wikipedia.org/wiki/Scamp | Scamp may refer to:
Computers and engineering
National Semiconductor SC/MP (pronounced Scamp), an early 8 bit microprocessor
Single-Channel Antijam Man-Portable Terminal, part of the Advanced Extremely High Frequency system
Single-Chip A-series Mainframe Processor, a single-chip implementation of the Burroughs large systems computer architecture
Special Computer APL Machine Portable, a prototype name for a single-user, portable computer concept made by IBM Research in 1973
Standardised Compatible Audio Modular Package, an audio processor range from Audio & Design (Recording) Ltd
Military
SS Sea Scamp, a 1943 Type C3 ship S-A2 troop transport in World War II
SS-14 Scamp, the NATO reporting name for the RT-15 theatre ballistic missile of the Soviet Union
USS Scamp, several ships
USS Scamp (SS-277), a Gato class submarine (1942–1945)
USS Scamp (SSN-588), a Skipjack class submarine (1961–1988)
Transportation
Aerosport Scamp, a small biplane designed for home building
Clark Scamp, a simple, bicycle-based moped
Honda Scamp, a.k.a. Honda N360, car made 1967–1970
Mini Scamp, a kit car based on the Mini
Plymouth Scamp (disambiguation), either of two small vehicles from Plymouth
SCAMP (boat) or Small Craft Advisor Magazine Project, a wooden or fiberglass hulled sailing dinghy
Scottish Aviation Scamp, prototype electric microcar produced by Scottish Aviation
Southern Aeronautical Scamp, an American aircraft designed for home construction and Formula V Air Racing
Supersonic Cruise and Maneuvering Program, the initial name for the General Dynamics F-16XL prototype aircraft
Other uses
The Scamp, a 1957 British drama film
Scamp (comics), a Disney cartoon puppy from Lady and the Tramp
Scamp grouper (Mycteroperca phenax), a grouper fish
Colt SCAMP or small caliber machine pistol, conceived in 1969 as a replacement to the aging Colt M1911A1 pistol
Supercritical Air Mobility Pack, breathing set in diving
"Scamps", a television episode
People with the surname
William Scamp (1801–1872), English architect and engineer |
https://en.wikipedia.org/wiki/Clock%20rate | In computing, the clock rate or clock speed typically refers to the frequency at which the clock generator of a processor can generate pulses, which are used to synchronize the operations of its components, and is used as an indicator of the processor's speed. It is measured in the SI unit of frequency hertz (Hz).
The clock rate of the first generation of computers was measured in hertz or kilohertz (kHz), the first personal computers (PCs) to arrive throughout the 1970s and 1980s had clock rates measured in megahertz (MHz), and in the 21st century the speed of modern CPUs is commonly advertised in gigahertz (GHz). This metric is most useful when comparing processors within the same family, holding constant other features that may affect performance.
Determining factors
Binning
Manufacturers of modern processors typically charge higher prices for processors that operate at higher clock rates, a practice called binning. For a given CPU, the clock rates are determined at the end of the manufacturing process through actual testing of each processor. Chip manufacturers publish a "maximum clock rate" specification, and they test chips before selling them to make sure they meet that specification, even when executing the most complicated instructions with the data patterns that take the longest to settle (testing at the temperature and voltage that gives the lowest performance). Processors successfully tested for compliance with a given set of standards may be labeled with a higher clock rate, e.g., 3.50 GHz, while those that fail the standards of the higher clock rate yet pass the standards of a lower clock rate may be labeled with the lower clock rate, e.g., 3.3 GHz, and sold at a lower price.
Engineering
The clock rate of a CPU is normally determined by the frequency of an oscillator crystal. Typically a crystal oscillator produces a fixed sine wave—the frequency reference signal. Electronic circuitry translates that into a square wave at the same frequency for digital electronics applications (or, in using a CPU multiplier, some fixed multiple of the crystal reference frequency). The clock distribution network inside the CPU carries that clock signal to all the parts that need it. An A/D Converter has a "clock" pin driven by a similar system to set the sampling rate. With any particular CPU, replacing the crystal with another crystal that oscillates at half the frequency ("underclocking") will generally make the CPU run at half the performance and reduce waste heat produced by the CPU. Conversely, some people try to increase performance of a CPU by replacing the oscillator crystal with a higher frequency crystal ("overclocking"). However, the amount of overclocking is limited by the time for the CPU to settle after each pulse, and by the extra heat created.
After each clock pulse, the signal lines inside the CPU need time to settle to their new state. That is, every signal line must finish transitioning from 0 to 1, or from 1 to 0. If the nex |
https://en.wikipedia.org/wiki/SQL-Ledger | SQL-Ledger is an ERP and double entry accounting system. Accounting data is stored in an SQL database server and a standard web browser can be used as its user interface. The system uses the Perl language with a database interface module for processing and PostgreSQL for data storage which is the preferred platform. The download version also includes schemas for IBM's DB2 database server as well as Oracle.
Capabilities
SQL-Ledger offers all of the standard features of SMB accounting software. Specific customization is available as part of an enterprise support contract.
Not only is the user interface multi-lingual, but it also offers the ability to print out statements, invoices, and the like in the language of the customer, even if the user does not know the language in which the content is being printed.
Supported languages
Business model
DWS generates their revenue from selling a manual and customizations. For free, DWS provides the source code of the current and all the previous versions, installation instructions, an FAQ collection and a user forum.
Version 3.0 of this program was released under the GNU GPL 2.0 license.
Version 3.2.6 released in December 2017.
Licensing issues
At its inception, SQL-Ledger used the GNU GPL 2.0 license. In 2005, Debian legal questioned whether or not the program belonged in Free or Non-Free, due to wording in the Terms and Conditions notice in the tarball.
In late 2006, LedgerSMB was created as a secure fork of SQL-Ledger. In early 2007, SQL-Ledger 2.8 was released under the 'SQL-Ledger Open Source License, a license which retroactively revokes all previous licenses under which the covered code had been released. That version also contained an "anti-forking" clause.
However, within a month, SQL-Ledger 2.8.1 was released, under the GNU GPL 2.0.
See also
LedgerSMB, another fork of version 2.
Comparison of accounting software
List of free and open source software packages
References
External links
Free accounting software
Perl software
Free software programmed in Perl
Cross-platform software |
https://en.wikipedia.org/wiki/Eudora%20%28email%20client%29 | Eudora is an email client that was used on the classic Mac OS, Mac OS X, and Microsoft Windows operating systems. It also supported several palmtop computing platforms, including Newton and the Palm OS. Eudora was succeeded by Eudora OSE. In 2018, after being years out of print, the software was open-sourced by the Computer History Museum.
History
Eudora was developed in 1988 by Steve Dorner, who worked at the Computer Services Organization of the University of Illinois at Urbana–Champaign. The software was named after American author Eudora Welty, because of her short story "Why I Live at the P.O."; Dorner rearranged the title to form the slogan "Bringing the P.O. to Where You Live" for his software. Although he regretted naming it after the still-living author because he thought doing so was "presumptuous", Welty was reportedly "pleased and amused" by Dorner's tribute.
Eudora was acquired by Qualcomm in 1991. Originally distributed free of charge, Eudora was commercialized and offered as a Light (freeware) and Pro (commercial) product. Between 2003 and 2006 the full-featured Pro version was also available as a "Sponsored mode" (adware) distribution.
In 2006 Qualcomm stopped development of the commercial version and sponsored the creation of a new open-source version based on Mozilla Thunderbird, code-named Penelope, later renamed to Eudora OSE. Development of the open-source version stopped in 2010 and was officially deprecated in 2013, with users advised to switch to the current version of Thunderbird.
Source code release
On May 22, 2018, after five years of discussion with Qualcomm, the Computer History Museum acquired full ownership of the source code, the Eudora trademarks, copyrights, and domain names. The transfer agreement from Qualcomm also allowed the Computer History Museum to publish the source code under the BSD open source license. The Eudora source code distributed by the Computer History Museum is the same except for the addition of the new license, sanitization of "bad words" found mostly in comment sections of the code and the removal of third-party software that neither the museum nor Qualcomm had the right to distribute.
In 2018, a "small team" started working on repairing Eudora to update it for modern use, using crowd funding to facilitate their effort, branded as Hermes Mail.
Initial focus was "a 'software bridge' to mediate between QUALCOMM Eudora 7 for Windows and modern OpenSSL" in response to the Heartbleed vulnerability and resulted in the release of updated cryptographic DLL files.
Features
Eudora (6.0.1) added support for Bayesian filtering of spam with a feature called SpamWatch. Eudora (6.2) added a scam watch feature that flags suspicious links within emails in an attempt to thwart phishing. Eudora (7.0) added ultra-fast search, which finds any emails using single or multiple criteria in seconds.
Eudora has support for "stationery", a standard message or reply prepared ahead of time to a common quest |
https://en.wikipedia.org/wiki/Instruction | Instruction or instructions or Inconstructions may refer to:
Computing
Instruction, one operation of a processor within a computer architecture instruction set
Computer program, a collection of instructions
Music
Instruction (band), a 2002 rock band from New York City, US
"Instruction" (song), a 2017 song by English DJ Jax Jones
Instructions (album), a 2001 album by Jermaine Dupri
Other uses
Instruction, teaching or education performed by a teacher
Sebayt, a work of the ancient Egyptian didactic literature aiming to teach ethical behaviour
Instruction, the pre-trial phase of an investigation led by a judge in an inquisitorial system of justice
Instruction manual, an instructional book or booklet
Instruction manual (gaming), a booklet that instructs the player on how to play the game
See also
Instructor (disambiguation)
Command (disambiguation) |
https://en.wikipedia.org/wiki/Quantification | Quantification may refer to:
Quantification (science), the act of counting and measuring
Quantification (machine learning), the task of estimating class prevalence values in unlabelled data
Quantifier (linguistics), an indicator of quantity
Quantifier (logic) |
https://en.wikipedia.org/wiki/Lifehouse | Lifehouse may refer to:
Churches
Lifehouse International Church, a network of churches in Asia
Lifehouse, a CRC International church in Murray Bridge, South Australia
Music
Lifehouse (band), an American rock band
Lifehouse (album) (2005), the band's self-titled album
Lifehouse (rock opera), a rock opera by the British rock band The Who
Other uses
Lifehouse (novel) (1982), a science-fiction novel by Spider Robinson
See also |
https://en.wikipedia.org/wiki/Extracellular%20matrix | In biology, the extracellular matrix (ECM), is a network consisting of extracellular macromolecules and minerals, such as collagen, enzymes, glycoproteins and hydroxyapatite that provide structural and biochemical support to surrounding cells. Because multicellularity evolved independently in different multicellular lineages, the composition of ECM varies between multicellular structures; however, cell adhesion, cell-to-cell communication and differentiation are common functions of the ECM.
The animal extracellular matrix includes the interstitial matrix and the basement membrane. Interstitial matrix is present between various animal cells (i.e., in the intercellular spaces). Gels of polysaccharides and fibrous proteins fill the interstitial space and act as a compression buffer against the stress placed on the ECM. Basement membranes are sheet-like depositions of ECM on which various epithelial cells rest. Each type of connective tissue in animals has a type of ECM: collagen fibers and bone mineral comprise the ECM of bone tissue; reticular fibers and ground substance comprise the ECM of loose connective tissue; and blood plasma is the ECM of blood.
The plant ECM includes cell wall components, like cellulose, in addition to more complex signaling molecules. Some single-celled organisms adopt multicellular biofilms in which the cells are embedded in an ECM composed primarily of extracellular polymeric substances (EPS).
Structure
Components of the ECM are produced intracellularly by resident cells and secreted into the ECM via exocytosis. Once secreted, they then aggregate with the existing matrix. The ECM is composed of an interlocking mesh of fibrous proteins and glycosaminoglycans (GAGs).
Proteoglycans
Glycosaminoglycans (GAGs) are carbohydrate polymers and mostly attached to extracellular matrix proteins to form proteoglycans (hyaluronic acid is a notable exception; see below). Proteoglycans have a net negative charge that attracts positively charged sodium ions (Na+), which attracts water molecules via osmosis, keeping the ECM and resident cells hydrated. Proteoglycans may also help to trap and store growth factors within the ECM.
Described below are the different types of proteoglycan found within the extracellular matrix.
Heparan sulfate
Heparan sulfate (HS) is a linear polysaccharide found in all animal tissues. It occurs as a proteoglycan (PG) in which two or three HS chains are attached in close proximity to cell surface or ECM proteins. It is in this form that HS binds to a variety of protein ligands and regulates a wide variety of biological activities, including developmental processes, angiogenesis, blood coagulation, and tumour metastasis.
In the extracellular matrix, especially basement membranes, the multi-domain proteins perlecan, agrin, and collagen XVIII are the main proteins to which heparan sulfate is attached.
Chondroitin sulfate
Chondroitin sulfates contribute to the tensile strength of cartilage, tendons, lig |
https://en.wikipedia.org/wiki/Truncation | In mathematics and computer science, truncation is limiting the number of digits right of the decimal point.
Truncation and floor function
Truncation of positive real numbers can be done using the floor function. Given a number to be truncated and , the number of elements to be kept behind the decimal point, the truncated value of x is
However, for negative numbers truncation does not round in the same direction as the floor function: truncation always rounds toward zero, the floor function rounds towards negative infinity. For a given number , the function ceil is used instead
.
In some cases is written as . See Notation of floor and ceiling functions.
Causes of truncation
With computers, truncation can occur when a decimal number is typecast as an integer; it is truncated to zero decimal digits because integers cannot store non-integer real numbers.
In algebra
An analogue of truncation can be applied to polynomials. In this case, the truncation of a polynomial P to degree n can be defined as the sum of all terms of P of degree n or less. Polynomial truncations arise in the study of Taylor polynomials, for example.
See also
Arithmetic precision
Quantization (signal processing)
Precision (computer science)
Truncation (statistics)
References
External links
Wall paper applet that visualizes errors due to finite precision
Numerical analysis
ja:端数処理 |
https://en.wikipedia.org/wiki/Hobbyist%20operating%20system | The development of a hobbyist operating system is one of the more involved and technical options for a computer hobbyist.
The definition of a hobby operating system can sometimes be vague. It can be from the developer's view, where the developers do it just for fun or learning; it can also be seen from the user's view, where the users are only using it as a toy; or it can be defined as an operating system which doesn't have a very big user base.
Development can begin from existing resources like a kernel, an operating system, or a bootloader, or it can also be made completely from scratch. The development platform could be a bare hardware machine, which is the nature of an operating system, but it could also be developed and tested on a virtual machine.
Since the hobbyist must claim more ownership for adapting a complex system to the ever-changing needs of the technical terrain, much enthusiasm is common amongst the many different groups attracted to operating system development.
Development
Elements of operating system development include:
Kernel:
Bootstrapping
Memory management
Process management and scheduling
Device driver management
Program API
External programs
User interface
The C programming language is frequently used for hobby operating system programming, as well as assembly language, though other languages can be used as well.
The use of assembly language is common with small systems, especially those based on eight bit microprocessors such as the MOS Technology 6502 family or the Zilog Z80, or in systems with a lack of available resources because of its small output size and low-level efficiency.
User interface
Most hobby operating systems use a command-line interface or a simple text user interface due to ease of development. More advanced hobby operating systems may have a graphical user interface. For example, AtheOS was a hobby operating system with a graphical interface written entirely by one programmer.
Examples
Use of BIOS
This section is predominantly x86 oriented.
The term BIOS (Basic Input/Output System) refers to firmware that initialises computer hardware and has provisions to load an operating system. The BIOS also sets up a standard interface for several low-level device drivers at boot time. BIOS resources are often used by hobbyist operating systems, especially those written on 16-bit x86 machines, as many hobby operating systems developers lack the time to write complex low level drivers themselves or they simply want to get into writing software for the system as soon as possible.
The most commonly used BIOS functions are VideoBIOS and Disk services. These are used because video cards and disk drives vary significantly on different machines and specialised drivers are often difficult to write.
The use of the BIOS is uncommon in operating systems that operate in Protected mode or Long mode, because the system must switch back to real mode which BIOS drivers run in.
See also
List of hobbyist oper |
https://en.wikipedia.org/wiki/OSF | OSF may refer to:
Computing
Open Science Framework, a cloud-based management for open access science
Open Semantic Framework, an integrated software stack using semantic technologies for knowledge management
OSF/1, a Unix-like operating system developed by the Open Software Foundation
Opera Show Format, an XHTML-based slideshow format
Organisations
Ógra Shinn Féin, the youth wing of the Sinn Féin political party
Open Software Foundation, a not-for-profit organization that merged with X/Open and then became The Open Group
Open Society Foundations, a grantmaking body established by George Soros
OpenStack Foundation, a non-profit corporate entity to promote OpenStack software and its community
Operational Support Facility, of the Federal Aviation Administration
Oregon Shakespeare Festival, a repertory theatre in Ashland, Oregon, US
Oxford Scientific Films, a British producer of natural history and documentary programmes
The Old Spaghetti Factory, a restaurant chain
Independent Senate Fraction (Onafhankelijke Senaatsfractie), a political group of the Netherlands
Order of Saint Francis, a 21st-century American Franciscan religious order
Oklahoma Office of State Finance, an agency of the Government of Oklahoma, US
OSF Global Services, a cloud technology company
OSF Healthcare, a non-profit healthcare organization in Illinois and Michigan, US |
https://en.wikipedia.org/wiki/Window%20class | In computer programming, a window class is fundamental to the Microsoft Windows (Win16, Win32, and Win64) operating systems and its Application Programming Interface (API).
The structure provides a template from which windows may be created by specifying a window's icons, menu, background color and a few other features. It also holds a pointer to a procedure that controls how the window behaves in response to user interaction. It finally tells the operating system how much additional storage space is needed for the class and each window created from it.
There have been two versions of window classes; the only non-technical addition brought by the second one is that of a small additional icon for the window. The first version was present in the Windows 3.x series; the second version appeared in Windows 95 and Windows NT 3.1.
References
External links
A manual page for window class on Microsoft's website
About Window Classes
Microsoft application programming interfaces |
https://en.wikipedia.org/wiki/Reference%20%28computer%20science%29 | In computer programming, a reference is a value that enables a program to indirectly access a particular data, such as a variable's value or a record, in the computer's memory or in some other storage device. The reference is said to refer to the datum, and accessing the datum is called dereferencing the reference. A reference is distinct from the datum itself.
A reference is an abstract data type and may be implemented in many ways. Typically, a reference refers to data stored in memory on a given system, and its internal value is the memory address of the data, i.e. a reference is implemented as a pointer. For this reason a reference is often said to "point to" the data. Other implementations include an offset (difference) between the datum's address and some fixed "base" address, an index, or identifier used in a lookup operation into an array or table, an operating system handle, a physical address on a storage device, or a network address such as a URL.
Formal representation
A reference R is a value that admits one operation, dereference(R), which yields a value. Usually the reference is typed so that it returns values of a specific type, e.g.:
interface Reference<T> {
T value();
}
Often the reference also admits an assignment operation store(R, x), meaning it is an abstract variable.
Use
References are widely used in programming, especially to efficiently pass large or mutable data as arguments to procedures, or to share such data among various uses. In particular, a reference may point to a variable or record that contains references to other data. This idea is the basis of indirect addressing and of many linked data structures, such as linked lists. References increase flexibility in where objects can be stored, how they are allocated, and how they are passed between areas of code. As long as one can access a reference to the data, one can access the data through it, and the data itself need not be moved. They also make sharing of data between different code areas easier; each keeps a reference to it.
References can cause significant complexity in a program, partially due to the possibility of dangling and wild references and partially because the topology of data with references is a directed graph, whose analysis can be quite complicated. Nonetheless, references are still simpler to analyze than pointers due to the absence of pointer arithmetic.
The mechanism of references, if varying in implementation, is a fundamental programming language feature common to nearly all modern programming languages. Even some languages that support no direct use of references have some internal or implicit use. For example, the call by reference calling convention can be implemented with either explicit or implicit use of references.
Examples
Pointers are the most primitive type of reference. Due to their intimate relationship with the underlying hardware, they are one of the most powerful and efficient types of references. However, also due |
https://en.wikipedia.org/wiki/Cyberman | The Cybermen are a fictional race of cyborgs principally portrayed in the British science fiction television programme Doctor Who. The Cybermen are a species of space-faring cyborgs who often forcefully and painfully convert human beings (or other similar species) into more Cybermen in order to populate their ranks while also removing their emotions and personalities. They were conceived by writer Kit Pedler (who was also the unofficial scientific advisor to the series) and story editor Gerry Davis, and first appeared in the 1966 Doctor Who serial The Tenth Planet.
The Cybermen have seen many redesigns and costume changes over Doctor Whos long run, as well as a number of varying origin stories. In their first appearance, The Tenth Planet (1966), they are humans from Earth's nearly identical "twin planet" of Mondas who upgraded themselves into cyborgs in a bid for self-preservation. Forty years later, the two-part story, "Rise of the Cybermen" and "The Age of Steel" (2006), depicted Cybermen invented again in a parallel universe London as a business corporation's attempt at upgrading humanity. Doctor Who audio dramas, novels, and comic books have also elaborated on existing origin stories or presented alternatives. The 2017 episode, "The Doctor Falls", explains the different origins as parallel evolution, due to the inevitability of humans and human-like species attempting to upgrade themselves through technology; this perspective resolves continuity differences in the Cybermen's history.
A mainstay of Doctor Who since the 1960s, the Cybermen have also appeared in related programs and spin-off media, including novels, audiobooks, comic books, and video games. Cybermen stories were produced in officially licensed Doctor Who products between 1989 and 2005, when the TV show was off the air, with writers either filling historical gaps or depicting new encounters between them and the Doctor. The species also appeared in the Doctor Who TV spin-off, Torchwood, appearing in the fourth episode, "Cyberwoman" (2006).
Creation
The name "Cyberman" comes from cybernetics, a term used in Norbert Wiener's book Cybernetics or Control and Communication in the Animal and the Machine (MIT Press, 1948). Wiener used the term in reference to the control of complex systems, particularly self-regulating control systems, in the animal world and in mechanical networks. By 1960, doctors were researching surgical or mechanical augmentation of humans and animals to operate machinery in space, leading to the portmanteau "cyborg", for "cybernetic organism".
In the 1960s, "spare-part" surgery began with the development of gigantic heart-lung machines. Public discussion included the possibility of wiring amputees' nerve endings directly into machines. In 1963, Kit Pedler discussed with his wife (who was also a doctor) what would happen if a person had so many prostheses that they could no longer distinguish themselves between man and machine. He got the opportunity to develo |
https://en.wikipedia.org/wiki/SIMM | A SIMM (single in-line memory module) is a type of memory module containing random-access memory used in computers from the early 1980s to the early 2000s. It differs from a dual in-line memory module (DIMM), the most predominant form of memory module since the late 1990s, in that the contacts on a SIMM are redundant on both sides of the module. SIMMs were standardised under the JEDEC JESD-21C standard.
Most early PC motherboards (8088-based PCs, XTs, and early ATs) used socketed DIP chips for DRAM. As computer memory capacities grew, memory modules were used to save motherboard space and ease memory expansion. Instead of plugging in eight or nine single DIP chips, only one additional memory module was needed to increase the memory of the computer.
History
SIMMs were invented in 1982 by James J. Parker at Zenith Microcircuits and the first Zenith Microcircuits customer was Wang Laboratories. Wang Laboratories tried to patent it and were granted a patent in April 1987. That patent was later voided when Wang Laboratories sued multiple companies for infringement and it was then publicized that they were the prior invention of Parker at Zenith Microcircuits (the Elk Grove Village, Illinois subsidiary of Zenith Electronics Corporation). The lawsuit was then dropped and the patent was vacated. The original memory modules were built upon ceramic substrates with 64K Hitachi "flip chip" parts and had pins, i.e. single in-line package (SIP) packaging. There was an 8-bit part and a 9-bit part both at 64K. The pins were the costliest part of the assembly process and Zenith Microcircuits, in conjunction with Wang and Amp, soon developed an easy insertion, pinless connector. Later the modules were built on ceramic substrates with Fujitsu plastic J-lead chips and still later, they were made on standard PCB material. SIMMs using pins are usually called SIP or SIPP memory modules to distinguish them from the more common modules using edge connectors.
The first variant of SIMMs has 30 pins and provides 8 bits of data (plus a 9th error-detection bit in parity SIMMs). They were used in AT-compatible (286-based, e.g., Wang APC), 386-based, 486-based, Macintosh Plus, Macintosh II, Quadra, Atari STE microcomputers, Wang VS minicomputers and Roland electronic samplers.
The second variant of SIMMs has 72 pins and provides 32 bits of data (36 bits in parity and ECC versions). These appeared first in the early 1990s in later models of the IBM PS/2, and later in systems based on the 486, Pentium, Pentium Pro, early Pentium II, and contemporary/competing chips of other brands. By the mid-90s, 72-pin SIMMs had replaced 30-pin SIMMs in new-build computers, and were starting to themselves be replaced by DIMMs.
Non-IBM PC computers such as UNIX workstations may use proprietary non-standard SIMMs. The Macintosh IIfx uses proprietary non-standard SIMMs with 64 pins.
DRAM technologies used in SIMMs include FPM (Fast Page Mode memory, used in all 30-pin and early 72-pin mod |
https://en.wikipedia.org/wiki/Background%20process | A background process is a computer process that runs behind the scenes (i.e., in the background) and without user intervention. Typical tasks for these processes include logging, system monitoring, scheduling, and user notification.
On a Windows system, a background process is either a computer program that does not create a user interface, or a Windows service. The former are started just as any other program is started, e.g., via Start menu. Windows services, on the other hand, are started by Service Control Manager. In Windows Vista and later, they are run in a separate session.
On a Unix or Unix-like system, a background process or job can be further identified as one whose process group ID differs from its terminal group ID (TGID). (The TGID of a process is the process ID of the process group leader that opened the terminal, which is typically the login shell. The TGID identifies the control terminal of the process group.) This type of process is unable to receive keyboard signals from its parent terminal, and typically will not send output to that terminal. This more technical definition does not distinguish between whether or not the process can receive user intervention. Although background processes are typically used for purposes needing few resources, any process can be run in the background, and such a process will behave like any other process, with the exceptions given above.
Windows services
In Windows NT family of operating systems, a Windows service is a dedicated background process. A Windows service must conform to the interface rules and protocols of the Service Control Manager, the component responsible for managing Windows services.
Windows services can be configured to start when the operating system starts, and to run in the background as long as Windows runs. Alternatively, they can be started manually or by an event. Windows NT operating systems include numerous services which run in context of three user accounts: System, Network Service and Local Service. These Windows components are often associated with Host Process for Windows Services: svchost.exe. Since Windows services operate in the context of their own dedicated user accounts, they can operate when a user is not logged on.
Before Windows Vista, services installed as "interactive services" could interact with Windows desktop and show a graphical user interface. With Windows Vista, however, interactive services became deprecated and ceased operating properly, as a result of Windows Service Hardening.
The three principal means of managing Windows services are:
Services snap-in for Microsoft Management Console
sc.exe
Windows PowerShell
Daemon
A daemon is a type of background process designed to run continually in the background, waiting for event(s) to occur or condition(s) to be met. When launched with the daemon function, daemons are disassociated from their parent terminal.
Background jobs in Unix
From a Unix command line, a background process can |
https://en.wikipedia.org/wiki/Monge%20array | In mathematics applied to computer science, Monge arrays, or Monge matrices, are mathematical objects named for their discoverer, the French mathematician Gaspard Monge.
An m-by-n matrix is said to be a Monge array if, for all such that
one obtains
So for any two rows and two columns of a Monge array (a 2 × 2 sub-matrix) the four elements at the intersection points have the property that the sum of the upper-left and lower right elements (across the main diagonal) is less than or equal to the sum of the lower-left and upper-right elements (across the antidiagonal).
This matrix is a Monge array:
For example, take the intersection of rows 2 and 4 with columns 1 and 5.
The four elements are:
17 + 7 = 24
23 + 11 = 34
The sum of the upper-left and lower right elements is less than or equal to the sum of the lower-left and upper-right elements.
Properties
The above definition is equivalent to the statement
A matrix is a Monge array if and only if for all and .
Any subarray produced by selecting certain rows and columns from an original Monge array will itself be a Monge array.
Any linear combination with non-negative coefficients of Monge arrays is itself a Monge array.
One interesting property of Monge arrays is that if you mark with a circle the leftmost minimum of each row, you will discover that your circles march downward to the right; that is to say, if , then for all . Symmetrically, if you mark the uppermost minimum of each column, your circles will march rightwards and downwards. The row and column maxima march in the opposite direction: upwards to the right and downwards to the left.
The notion of weak Monge arrays has been proposed; a weak Monge array is a square n-by-n matrix which satisfies the Monge property only for all .
Every Monge array is totally monotone, meaning that its row minima occur in a nondecreasing sequence of columns, and that the same property is true for every subarray. This property allows the row minima to be found quickly by using the SMAWK algorithm.
Monge matrix is just another name for submodular function of two discrete variables. Precisely, A is a Monge matrix if and only if A[i,j] is a submodular function of variables i,j.
Applications
A square Monge matrix which is also symmetric about its main diagonal is called a Supnick matrix (after Fred Supnick); this kind of matrix has applications to the traveling salesman problem (namely, that the problem admits of easy solutions when the distance matrix can be written as a Supnick matrix). Any linear combination of Supnick matrices is itself a Supnick matrix.
References
Theoretical computer science |
https://en.wikipedia.org/wiki/Rail%20transport%20in%20Switzerland | The Swiss rail network is noteworthy for its density, its coordination between services, its integration with other modes of transport, timeliness and a thriving domestic and trans-alp freight system. This is made necessary by strong regulations on truck transport, and is enabled by properly coordinated intermodal logistics.
With network length, Switzerland has a dense railway network, and is the clear European leader in kilometres traveled: 2,505 km per inhabitant and year (2019). Worldwide only the Japanese travel more by train.
Virtually 100% of its network is electrified, except for the few tracks on which steam locomotives operate for tourism purposes only. There are 74 railway companies in Switzerland. The share of commuters who travel to work using public transport (as main mode of transport) is 30%. The share of rail in goods transport performance by road and rail (modal split) is 39%.
Switzerland was ranked first among national European rail systems in the 2017 European Railway Performance Index for its intensity of use, quality of service and strong safety rating. Switzerland had excellent intensity of use, notably driven by passenger traffic, and a good rating for quality of service and a very good rating for safety. Switzerland captured high value in return for public investment with cost to performance ratios that outperform the average ratio for all European countries.
Switzerland is a member of the International Union of Railways (UIC). The UIC Country Code for Switzerland is 85.
Standard-gauge railways
Three quarters of the Swiss rail network is at standard gauge, comprising , administered mostly by three companies. Important railway stations are the Zürich HB (367,000 passengers per day on a working day in 2022), Bern (276,000 ppd), Geneva (156,000 ppd), Luzern (132,000 ppd), Basel SBB (124,000 ppd), Winterthur (121,000 ppd), Lausanne (117,000 ppd), and Zürich Oerlikon (104,000 ppd)
Swiss Federal Railways
Swiss Federal Railways (SBB CFF FFS) is the largest railway company in Switzerland and handles the majority of national and international traffic. It operates the main east–west track in the Swiss Plateau area serving all larger Swiss cities and many smaller ones, and the north–south routes through the Alps via the Gotthard Line through the Gotthard Base Tunnel (Milano-Chiasso-Lugano-Luzern/Zurich-Basel line) and the Simplon Tunnel (Domodossola to Brig-Lausanne-Geneva line).
Total route length: .
BLS
BLS (Bern-Lötschberg-Simplon) operates 10% of the standard-gauge network. It manages the second major Alpine route Bern-Brig via both Lötschberg Tunnels (base and summit) and connection at Brig with SBB's Simplon Tunnel to Italy.
Total route length: .
SOB
The original line of Schweizerische Südostbahn AG (SOB) runs on (of which are their own) between Romanshorn and Lucerne. The hourly exrpess train running on this route is called Voralpen Express referring to the pre-alpine landscape it runs through from Northeast |
https://en.wikipedia.org/wiki/Nine%20Princes%20in%20Amber | Nine Princes in Amber is a fantasy novel by American writer Roger Zelazny, the first in the Chronicles of Amber series. It was first published in 1970, and later spawned a computer game of the same name. The first (Doubleday hardcover) edition of the novel is unusually rare; the publisher pulped a significant part of the original print run in error when the order went out to destroy remaining copies of Zelazny's older book Creatures of Light and Darkness.
In the story, Carl Corey wakes up in a secluded New York hospital with amnesia. He escapes and investigates, discovering the truth, piece by piece: he is really Prince Corwin, of Amber, the one true world of which the Earth is just a shadow. He is one of nine men who might rule Amber, if he can fight his way past the armies of his older brother Eric.
Plot
Carl Corey wakes in a medical clinic with little knowledge of who he is or how he got there. He suspects he is being overmedicated, so he escapes his room. He learns that he was recovering from a car accident in a private clinic, paid for by his sister, Evelyn Flaumel.
He flees and heads to her house. She addresses him as Corwin and calls herself Flora. Hiding his lack of memory, he convinces her to let him stay. In Flora's library he locates a set of customized Tarot cards—the Trumps—whose Major Arcana are replaced with images which he recognizes as his family. As he looks over the cards he remembers all his brothers: sneaky Random, Julian the hunter, well-built Gérard, arrogant Eric, himself, Benedict the master tactician and swordsman, sinister Caine, scheming Bleys, and the mysterious Brand. He also views his four sisters: Flora who offered him sanctuary, Deirdre who was dear to him, reserved Llewella, and Fiona, whom Corwin hated.
His brother Random contacts him via telephone and Corwin promises to give him protection. Random arrives, pursued by spined, bloodshot-eyed humanoid creatures, and during the ensuing battle Corwin learns that he has superhuman strength. Corwin, Random, and Flora's dogs ultimately defeat the attacking creatures. Later, in a guarded conversation in which Corwin continues to mask his memory loss, Random asks Corwin whether he wishes to "try", to which Corwin agrees, only learning later that he has agreed to attempt to seize the throne of Amber. They set off in a car and the world begins to change around them as they drive, which Random is somehow causing. They end up in the Forest of Arden, the territory of their brother Julian, who is allied with Corwin's enemy, Eric. Julian appears on his steed Morgenstern to hunt them down, but Corwin unhorses Julian and takes him prisoner. Julian's men let Corwin and Random proceed through the forest. After setting Julian free and proceeding on foot to Amber, they encounter their sister Deirdre, who reveals she has fled from Eric's court. Corwin finally reveals that he has very little memory of his identity or their destination, so Deirdre convinces him to walk the Pattern |
https://en.wikipedia.org/wiki/Object-oriented%20operating%20system | An object-oriented operating system is an operating system that is designed, structured, and operated using object-oriented programming principles.
An object-oriented operating system is in contrast to an object-oriented user interface or programming framework, which can be run on a non-object-oriented operating system like DOS or Unix.
There are already object-based language concepts involved in the design of a more typical operating system such as Unix. While a more traditional language like C does not support object-orientation as fluidly as more recent languages, the notion of, for example, a file, stream, or device driver (in Unix, each represented as a file descriptor) can be considered a good example of objects. They are, after all, abstract data types, with various methods in the form of system calls which behavior varies based on the type of object and which implementation details are hidden from the caller.
Object-orientation has been defined as objects + inheritance, and inheritance is only one approach to the more general problem of delegation that occurs in every operating system. Object-orientation has been more widely used in the user interfaces of operating systems than in their kernels.
Background
An object is an instance of a class, which provides a certain set of functionalities. Two objects can be differentiated based on the functionalities (or methods) they support. In an operating system context, objects are associated with a resource. Historically, the object-oriented design principles were used in operating systems to provide several protection mechanisms.
Protection mechanisms in an operating system help in providing a clear separation between different user programs. It also protects the operating system from any malicious user program behavior. For example, consider the case of user profiles in an operating system. The user should not have access to resources of another user. The object model deals with these protection issues with each resource acting as an object. Every object can perform only a set of operations. In the context of user profiles, the set of operations is limited by privilege level of a user.
Present-day operating systems use object-oriented design principles for many components of the system, which includes protection.
Examples
Athene
Athene is an object-based operating system first released in 2000 by Rocklyte Systems. The user environment was constructed entirely from objects that are linked together at runtime. Applications for Athene could also be created using this methodology and were commonly scripted using the object scripting language Dynamic Markup Language (DML). Objects could have been shared between processes by creating them in shared memory and locking them as needed for access. Athene's object framework was multi-platform, allowing it to be used in Windows and Linux environments for developing object-oriented programs. The company went defunct and the project abandoned someti |
https://en.wikipedia.org/wiki/XDCC | XDCC (Xabi DCC or eXtended DCC) is a computer file sharing method which uses the Internet Relay Chat (IRC) network as a host service.
History
Limitations in the original DCC protocol prevented the transfers of very large files, or groups of files. XDCC was developed to allow batching of files together, and requesting/sending those files to others.
XDCC was initially a script written in 1994 for ircII by Xabi. This script extends the ircII DCC command. Now XDCC refers to IRC bots running file sharing programs in general. XDCC bots serve one or more usually large files for download using the DCC protocol. Though XDCC is commonly employed in distributing illegal content, such as warez releases of software, music, and movies, it can also be used in legal ways.
Features
Unlike peer-to-peer transfers, XDCC servers are often hosted on connections with very high upstream bandwidth, sometimes in excess of 100 Mbit. Often FTP servers are also running on the XDCC servers to facilitate uploading of materials to them. Many XDCC servers run on security compromised computers.
Usage
Since browser-based IRC scripts are not compatible with the DCC protocol, users need to install a program such as mIRC or HexChat on their computer. In order to receive files, the software has to be properly configured, otherwise downloads will be rejected by the software.
To use XDCC, one can send a private message (query) or send a CTCP command to a bot, using an IRC client. The user can ask a bot what files it has by private messaging "xdcc list" to the bot. However, this feature is often disabled as to not attract too much attention. When a user wants to download a packet or file from a bot, the user would type something such as "xdcc send #<pack number>" to the bot. The bot will either start sending the user the packet or the bot will place the user in a queue, and force the user to wait their turn. Some channels have special rules, for example requiring the user to join a second channel within a certain amount of time after starting the download to avoid interruptions.
Addons exist, such as XDCCKlipper (for mIRC) which listen to adverts listed in a channel by the bots and save them to a separate window to facilitate easier browsing and allow users to view the status of a bot (speed, queues, slots etc.).
Search
A number of search engines exist, indexing the files on the IRC / XDCC network. Currently active indexers include:
Ixirc.com
SunXDCC.com
Xdcc.eu
Xdcc.rocks
In addition, most XDCC channels have a chat channel which often has a search bot. Other methods include the installation of scripts such as XDCCKlipper.
References
External links
xdcc script 3.3.0 beta - The original XDCC script
Internet Relay Chat
File sharing
Warez
Internet terminology
Protocols related to Internet Relay Chat |
https://en.wikipedia.org/wiki/Robert%20Morris%20%28cryptographer%29 | Robert H. Morris Sr. (July 25, 1932 – June 26, 2011) was an American cryptographer and computer scientist.
Family and education
Morris was born in Boston, Massachusetts. His parents were Walter W. Morris, a salesman, and Helen Kelly Morris, a homemaker. He received a bachelor's degree in mathematics from Harvard University in 1957 and a master's degree in applied mathematics from Harvard in 1958.
He married Anne Farlow, and they had three children together: Robert Tappan Morris (author of the 1988 Morris worm), Meredith Morris, and Benjamin Morris.
Bell Labs
From 1960 until 1986, Morris was a researcher at Bell Labs and worked on Multics and later Unix.
Together with Douglas McIlroy, he created M6 macro processor in FORTRAN IV, which was later ported to Unix.
Using the TMG compiler-compiler, Morris, together with McIlroy, developed the early implementation of PL/I compiler called EPL for Multics project. The pair also contributed a version of runoff text-formatting program for Multics.
Morris's contributions to early versions of Unix include the math library, the dc programming language, the program crypt, and the password encryption scheme used for user authentication. The encryption scheme (invented by Roger Needham), was based on using a trapdoor function (now called a key derivation function) to compute hashes of user passwords which were stored in the file /etc/passwd; analogous techniques, relying on different functions, are still in use today.
National Security Agency
In 1986, Morris began work at the National Security Agency (NSA). He served as chief scientist of the NSA's National Computer Security Center, where he was involved in the production of the Rainbow Series of computer security standards, and retired from the NSA in 1994. He once told a reporter that, while at the NSA, he helped the FBI decode encrypted evidence.
There is a description of Morris in Clifford Stoll's book The Cuckoo's Egg.
Many readers of Stoll's book remember Morris for giving Stoll a challenging mathematical puzzle (originally due to John H. Conway) in the course of their discussions on computer security: What is the next number in the sequence 1 11 21 1211 111221? (known as the look-and-say sequence). Stoll chose not to include the answer to this puzzle in The Cuckoo's Egg, to the frustration of many readers.
Robert Morris died in Lebanon, New Hampshire.
Quotes
Rule 1 of cryptanalysis: check for plaintext.
Never underestimate the attention, risk, money, and time that an opponent will put into reading traffic.
It is easy to run a secure computer system. You merely have to disconnect all dial-up connections and permit only direct-wired terminals, put the machine and its terminals in a shielded room, and post a guard at the door.
Selected publications
(with Fred T. Grampp) UNIX Operating System Security, AT&T Bell Laboratories Technical Journal, 63, part 2, #8 (October 1984), pp. 1649–1672.
References
External links
Dennis Ritchie: "Dabblin |
https://en.wikipedia.org/wiki/Robert%20Tappan%20Morris | Robert Tappan Morris (born November 8, 1965) is an American computer scientist and entrepreneur. He is best known for creating the Morris worm in 1988, considered the first computer worm on the Internet.
Morris was prosecuted for releasing the worm, and became the first person convicted under the then-new Computer Fraud and Abuse Act (CFAA).
He went on to cofound the online store Viaweb, one of the first web applications, and later the venture capital funding firm Y Combinator, both with Paul Graham.
He later joined the faculty in the department of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology (MIT), where he received tenure in 2006. He was elected to the National Academy of Engineering in 2019.
Early life
Morris was born in 1965 to parents Robert Morris and Anne Farlow Morris. The senior Robert Morris was a computer scientist at Bell Labs, who helped design Multics and Unix; and later became the chief scientist at the National Computer Security Center, a division of the National Security Agency (NSA).
Morris grew up in the Millington section of Long Hill Township, New Jersey, attended The Peck School, and graduated from Delbarton School in 1983.
Morris attended Harvard University, and later went on to graduate school at Cornell University. During his first year there, he designed a computer worm (see below) that disrupted many computers on what was then a fledgling internet. This led to him being indicted a year later.
After serving his conviction term, he returned to Harvard to complete his Doctor of Philosophy (Ph.D.) under the supervision of H. T. Kung. He finished in 1999.
Morris worm
Morris' computer worm was developed in 1988, while he was a graduate student at Cornell University. He released the worm from MIT, rather than from Cornell. The worm exploited several vulnerabilities to gain entry to targeted systems, including:
A hole in the debug mode of the Unix sendmail program
A buffer overflow or overrun hole in the fingerd network service
The transitive trust enabled by people setting up network logins with no password requirements via remote execution (rexec) with Remote Shell (rsh), termed rexec/rsh
The worm was programmed to check each computer it found to determine if the infection was already present. However, Morris believed that some system administrators might try to defeat the worm by instructing the computer to report a false positive. To compensate for this possibility, Morris programmed the worm to copy itself anyway, 14% of the time, no matter what the response was to the infection-status interrogation.
This level of persistence was a design flaw: it created system loads that brought it to the attention of administrators, and disrupted the target computers. During the ensuing trial, it was estimated that the cost in "potential loss in productivity" caused by the worm and efforts to remove it from different systems ranged from $200 to $53,000.
Criminal prosecution
In |
https://en.wikipedia.org/wiki/Embedded%20operating%20system | An embedded operating system is an operating system for embedded computer systems. Embedded operating systems are computer systems designed to increase functionality and reliability for achieving a specific task. Depending on the method used for Computer multitasking, this type of operating system might be considered a real-time operating system (RTOS).
All embedded systems contain a processor and software. There must be a place for embedded software to store the executable and temporary storage for run-time data processing. The main memory on an embedded system can be ROM and RAM. All embedded systems must also contain some form of input interface and output interface to function. The embedded hardware is usually unique and varies from application to application. Because the hardware running the embedded operating system can be very limited in resources, the embedded design of these operating systems may have a narrow in scope tailored to a specific application, so as to achieve the desired operation under the given hardware constraints. The embedded operating system that organizes and controls the hardware usually determines which other embedded hardware is needed.
To take better advantage of the processing power of the Central processing unit (CPU), software developers may write critical code directly in assembly language. This machine efficient language can potentially result in gains in speed on deterministic systems at the cost of portability and maintainability. Often, embedded operating systems are written entirely in portable languages, such as C.
Operating systems on typical embedded systems
Embedded operating systems have been developed for consumer electronics, including cameras and mobile phones. Embedded operating systems also run on automotive electronics, helping the driver with cruise control as well as navigation. Furthermore factory automation infrastructure requires embedded operating systems. In everyday life, embedded operating systems can be experienced in office automation, including image scanners, photocopiers, and your wireless access point. Similarly home automation relies on embedded operating systems, including the security system.
History
Early embedded operating systems
In the late 1970s, the concept of a real-time multitasking kernel was proposed. In the 1980s, while the embedded systems applications became more complex, the embedded operating system with a real-time multitasking kernel could not meet the requirement of embedded development. It began to develop into a complete real-time multitasking Operating System (RTOS) that included a network, file, development and debugging environment.
Nowadays, RTOS has formed an industry in the world. The world's first commercial embedded real-time kernel (VRTX32) was developed by Ready System in 1981. Then in 1993, Ready System and the famous Silicon Valley embedded software company Microtec Research Merger developed two new RTOS kernels VRTX32 and VRTXsa, based on |
https://en.wikipedia.org/wiki/Windows%20Embedded%20Compact | Windows Embedded Compact, formerly Windows Embedded CE, Windows Powered and Windows CE, was an operating system family developed by Microsoft as part of its Windows Embedded family of products.
Unlike Windows Embedded Standard, which is based on Windows NT, Windows Embedded Compact uses a different hybrid kernel. Microsoft licenses it to original equipment manufacturers (OEMs), who can modify and create their own user interfaces and experiences, with Windows Embedded Compact providing the technical foundation to do so. The current version of Windows Embedded Compact supports x86 and ARM processors with board support package (BSP) directly. The MIPS and SHx architectures had support prior to version 7.0 and version 7.0 still works on MIPS II architecture.
Originally, Windows CE was designed for minimalistic and small computers. However CE had its own kernel whereas those such as Windows XP Embedded are based on NT. Windows CE was a modular/componentized operating system that served as the foundation of several classes of devices such as Handheld PC, Pocket PC, Auto PC, Windows Mobile, Windows Phone 7 and more.
Windows Embedded Compact 2013 is the final version of Windows CE. It had mainstream support until October 9, 2018, and extended support ended on October 10, 2023.
Features
Windows CE is optimized for devices that have minimal memory; a Windows CE kernel may run with one megabyte of memory. Devices are often configured without disk storage, and may be configured as a "closed" system that does not allow for end-user extension (for instance, it can be burned into ROM). Windows CE conforms to the definition of a real-time operating system, with a deterministic interrupt latency. From Version 3 and onward, the system supports 256 priority levels and uses priority inheritance for dealing with priority inversion. The fundamental unit of execution is the thread. This helps to simplify the interface and improve execution time.
The first version known during development under the code name "Pegasus" featured a Windows-like GUI and a number of Microsoft's popular apps, all trimmed down for smaller storage, memory, and speed of the palmtops of the day. Since then, Windows CE has evolved into a component-based, embedded, real-time operating system. It is no longer targeted solely at hand-held computers. Many platforms have been based on the core Windows CE operating system, including Microsoft's AutoPC, Pocket PC 2000, Pocket PC 2002, Windows Mobile 2003, Windows Mobile 2003 SE, Windows Mobile 5, Windows Mobile 6, Smartphone 2002, Smartphone 2003, Portable Media Center, Zune, Windows Phone 7 and many industrial devices and embedded systems. Windows CE even powered select games for the Sega Dreamcast and was the operating system of the Gizmondo handheld.
A distinctive feature of Windows CE compared to other Microsoft operating systems is that large parts of it are offered in source code form. First, source code was offered to several vendors, so t |
https://en.wikipedia.org/wiki/Floyd%E2%80%93Warshall%20algorithm | In computer science, the Floyd–Warshall algorithm (also known as Floyd's algorithm, the Roy–Warshall algorithm, the Roy–Floyd algorithm, or the WFI algorithm) is an algorithm for finding shortest paths in a directed weighted graph with positive or negative edge weights (but with no negative cycles). A single execution of the algorithm will find the lengths (summed weights) of shortest paths between all pairs of vertices. Although it does not return details of the paths themselves, it is possible to reconstruct the paths with simple modifications to the algorithm. Versions of the algorithm can also be used for finding the transitive closure of a relation , or (in connection with the Schulze voting system) widest paths between all pairs of vertices in a weighted graph.
History and naming
The Floyd–Warshall algorithm is an example of dynamic programming, and was published in its currently recognized form by Robert Floyd in 1962. However, it is essentially the same as algorithms previously published by Bernard Roy in 1959 and also by Stephen Warshall in 1962 for finding the transitive closure of a graph, and is closely related to Kleene's algorithm (published in 1956) for converting a deterministic finite automaton into a regular expression. The modern formulation of the algorithm as three nested for-loops was first described by Peter Ingerman, also in 1962.
Algorithm
The Floyd–Warshall algorithm compares many possible paths through the graph between each pair of vertices. It is guaranteed to find all shortest paths and is able to do this with comparisons in a graph, even though there may be edges in the graph. It does so by incrementally improving an estimate on the shortest path between two vertices, until the estimate is optimal.
Consider a graph with vertices numbered 1 through . Further consider a function that returns the length of the shortest possible path (if one exists) from to using vertices only from the set as intermediate points along the way. Now, given this function, our goal is to find the length of the shortest path from each to each using any vertex in . By definition, this is the value , which we will find recursively.
Observe that must be less than or equal to : we have more flexibility if we are allowed to use the vertex . If is in fact less than , then there must be a path from to using the vertices that is shorter than any such path that does not use the vertex . This path can be decomposed as:
(1) a path from to that uses the vertices , followed by
(2) a path from to that uses the vertices .
And of course, these must be the shortest such paths, otherwise we could further decrease the length. In other words, we have arrived at the recursive formula:
.
Meanwhile, the base case is given by
where denotes the weight of the edge from to if one exists and ∞ (infinity) otherwise.
These formulas are the heart of the Floyd–Warshall algorithm. The algorithm works by first computing for all pairs |
https://en.wikipedia.org/wiki/Object%20copying | In object-oriented programming, object copying is creating a copy of an existing object, a unit of data in object-oriented programming. The resulting object is called an object copy or simply copy of the original object. Copying is basic but has subtleties and can have significant overhead. There are several ways to copy an object, most commonly by a copy constructor or cloning. Copying is done mostly so the copy can be modified or moved, or the current value preserved. If either of these is unneeded, a reference to the original data is sufficient and more efficient, as no copying occurs.
Objects in general store composite data. While in simple cases copying can be done by allocating a new, uninitialized object and copying all fields (attributes) from the original object, in more complex cases this does not result in desired behavior.
Methods of copying
The design goal of most objects is to give the resemblance of being made out of one monolithic block even though most are not. As objects are made up of several different parts, copying becomes nontrivial. Several strategies exist to treat this problem.
Consider an object A, which contains fields xi (more concretely, consider if A is a string and xi is an array of its characters). There are different strategies for making a copy of A, referred to as shallow copy and deep copy. Many languages allow generic copying by one or either strategy, defining either one copy operation or separate shallow copy and deep copy operations. Note that even shallower is to use a reference to the existing object A, in which case there is no new object, only a new reference.
The terminology of shallow copy and deep copy dates to Smalltalk-80. The same distinction holds for comparing objects for equality: most basically there is a difference between identity (same object) and equality (same value), corresponding to shallow equality and (1 level) deep equality of two object references, but then further whether equality means comparing only the fields of the object in question or dereferencing some or all fields and comparing their values in turn (e.g., are two linked lists equal if they have the same nodes, or if they have same values?).
Shallow copy
One method of copying an object is the shallow copy. In that case a new object B is created, and the fields values of A are copied over to B. This is also known as a field-by-field copy, field-for-field copy, or field copy. If the field value is a reference to an object (e.g., a memory address) it copies the reference, hence referring to the same object as A does, and if the field value is a primitive type, it copies the value of the primitive type. In languages without primitive types (where everything is an object), all fields of the copy B are references to the same objects as the fields of original A. The referenced objects are thus shared, so if one of these objects is modified (from A or B), the change is visible in the other. Shallow copies are simple and typ |
https://en.wikipedia.org/wiki/The%20Garden%20of%20Cyrus | The Garden of Cyrus, or The Quincuncial Lozenge, or Network Plantations of the Ancients, naturally, artificially, mystically considered, is a discourse by Thomas Browne concerned with the quincunx—a pattern of five points arranged in an X, as on a die—in art and nature. First published in 1658, along with its companion Urn-Burial, in modern times it has been recognised as Browne's major literary contribution to Hermetic wisdom.
The book begins with the biblical creation, allusion to Plato's discourse the Timaeus and speculation upon the location of the Garden of Eden. It continues on orchards planting patterns of the Ancient Persians, who used the quincunx pattern to ensure "a regular angularity, and through prospect, was left on every side". Browne explores the number five and the quincunx pattern as seen in art and human design (chapters 1 and 2) as a pattern in nature,in particular through his extensive study of botany (central chapter 3) and mystically (chapters 4 and 5)
Written during a time when restrictions on publishing became more relaxed during Oliver Cromwell's Protectorate, The Garden of Cyrus is Browne's contribution to a "boom period" decade of interest in esoterica in England. Browne's discourse is a neoplatonic and neopythagorean vision of the interconnection of art and nature via the inter-related symbols of the number five and the quincunx pattern, along with the figure X and the lattice design. Its fundamental quest was of primary concern to Hermetic philosophy: proof of the wisdom of God, and demonstrable evidence of intelligent design. The discourse includes early recorded usage of the words "prototype" and "archetype" in English.
The 19th and 20th century critic Edmund Gosse complained of the book that "gathering his forces it is Quincunx, Quincunx, all the way until the very sky itself is darkened with revolving Chess-boards", while conceding that "this radically bad book contains some of the most lovely paragraphs which passed from an English pen during the seventeenth Century".
Hugh Aldersey-Williams
in his 2015 book In Search of Sir Thomas Browne links the quincunx pattern to his research on the history of Buckminsterfullerene and molecular structures.
References
External links
Complete text of The Garden of Cyrus
Essay on Browne and Hermeticism
1658 books
Mysticism texts
Hermeticism
Esotericism
Works by Thomas Browne
Gardening books |
https://en.wikipedia.org/wiki/Opcode | In computing, an opcode (abbreviated from operation code, also known as instruction machine code, instruction code, instruction syllable, instruction parcel or opstring) is the portion of a machine language instruction that specifies the operation to be performed. Beside the opcode itself, most instructions also specify the data they will process, in the form of operands. In addition to opcodes used in the instruction set architectures of various CPUs, which are hardware devices, they can also be used in abstract computing machines as part of their byte code specifications.
Overview
Specifications and format of the opcodes are laid out in the instruction set architecture (ISA) of the processor in question, which may be a general CPU or a more specialized processing unit. Opcodes for a given instruction set can be described through the use of an opcode table detailing all possible opcodes. Apart from the opcode itself, an instruction normally also has one or more specifiers for operands (i.e. data) on which the operation should act, although some operations may have implicit operands, or none at all. There are instruction sets with nearly uniform fields for opcode and operand specifiers, as well as others (the x86 architecture for instance) with a more complicated, variable-length structure. Instruction sets can be extended through the use of opcode prefixes which add a subset of new instructions made up of existing opcodes following reserved byte sequences.
Operands
Depending on architecture, the operands may be register values, values in the stack, other memory values, I/O ports (which may also be memory mapped), etc., specified and accessed using more or less complex addressing modes. The types of operations include arithmetic, data copying, logical operations, and program control, as well as special instructions (such as CPUID and others).
Assembly language, or just assembly, is a low-level programming language, which uses mnemonic instructions and operands to represent machine code. This enhances the readability while still giving precise control over the machine instructions. Most programming is currently done using high-level programming languages, which are typically easier for humans to understand and write. These languages need to be compiled (translated into assembly language) by a system-specific compiler, or run through other compiled programs.
Software instruction sets
Opcodes can also be found in so-called byte codes and other representations intended for a software interpreter rather than a hardware device. These software-based instruction sets often employ slightly higher-level data types and operations than most hardware counterparts, but are nevertheless constructed along similar lines. Examples include the byte code found in Java class files which are then interpreted by the Java Virtual Machine (JVM), the byte code used in GNU Emacs for compiled Lisp code, .NET Common Intermediate Language (CIL), and many others.
See also |
https://en.wikipedia.org/wiki/Class%20of%20%2774 | Class of '74 (and subsequently Class of '75) was a secondary school-based, daily soap opera screened on the Seven Network in Australia and produced by Reg Grundy Organisation in black-and-white starting March 1974
Marist Singers of Eastwood provided back-up singing for the school choir.
Program synopsis
The main characters were a mix of teachers and other school personnel, and students. The series was aimed at a teenage audience. Each episode was 30 minutes; five episodes each week were broadcast, stripped across week nights in an early evening timeslot. The series was renamed Class of '75 for its second and final year. Although originally produced in black and white, it switched to colour broadcasting during its second year of production.
Main cast
Teachers, staff and adults
Students
Miscellaneous
Cast members Teale, Hamblin and Glenwright continued the program's entire run.
See also
List of Australian television series
References
External links
Aussie Soap Archive: Class of '74 — Overview and review; Archived 19 April 2020
Class of 74 at the National Film and Sound Archive
1974 Australian television series debuts
1975 Australian television series endings
1970s high school television series
1970s teen drama television series
1970s television soap operas
Australian television soap operas
Australian high school television series
Seven Network original programming
Television series produced by The Reg Grundy Organisation
Television shows set in New South Wales
Black-and-white Australian television shows
English-language television shows
Television series about educators
Television series about teenagers |
https://en.wikipedia.org/wiki/Bellbird%20%28TV%20series%29 | Bellbird is an Australian soap opera serial broadcast by the ABC set in the small fictional Victorian rural township of the show's title. The series was produced at the networks Ripponlea TV studios in Elsternwick, Melbourne. The opening title sequence was filmed at Daylesford, Victoria.
Having run for 10 years, from 1967 until 1977, it was the longest-running soap opera/serial ever produced by the ABC. It ended the same year as commercial broadcast series Number 96 and The Box, which had run for six and four years respectively.
Production and broadcasting
The series was screened from 28 August 1967 to 23 December 1977. Although Bellbird was not Australia's first television serial (the first was Network Seven's Autumn Affair), it was the first successful soap opera and even spawned a feature film and tie-in novel. The show's ratings were modest but it had a devoted following, especially in rural Australia. During most of its 10-year production run, 15-minute episodes of Bellbird screened from Monday to Thursday nights, leading in to the 7:00 pm evening news bulletin. In 1976, the series was screened as a single one-hour episode each week, before switching to three half-hour instalments per week during its final season.
Storylines
While the series plots concentrated mainly on small-scale interpersonal, domestic and local relationships, issues and conflicts, there were occasional moments of high drama. One of the most celebrated was the death of the character of the local stock and station agent, Charlie Cousens, played by founding cast member Robin Ramsay. When Ramsay decided to leave the series in 1968, his character was written out in dramatic fashion, with Cousens plunging to his death from the top of a wheat silo. The death scene has figured prominently in retrospectives of great moments in Australian television, and its celebrity meant that it became one of the few segments from the early years of the series that has survived. Other notable 'deaths' across the course of the series included those of local farm girl Hagar Grossark (Barbara Ramsay), who drowned during a local flood, and the tragic 1974 'death' of major character Rhoda Lang (played by founding cast member Lynette Curran) who was killed when her car was struck by a train at a level crossing.
The show's storylines followed the lives of the residents of the small fictional country town that gave the show its title.
Cast
Bellbird featured a regular cast of 46 actors over its 10 year run (see links, for actor information).
Main cast
Guest cast
The National Archives of Australia holds a collection of 43 black and white prints from 1977, identifying over 30 actors involved at that time,
Later shows featuring members of the cast
Prisoner
The cast of Bellbird became household names to the viewing audiences and a number went on to appear in the Network 10 cult series Prisoner. In 1979, two years after Bellbird ended its run, Elspeth Ballantyne, Patsy King and Sheila Florance |
https://en.wikipedia.org/wiki/Number%2096%20%28TV%20series%29 | Number 96 is an Australian primetime soap opera that aired on 0-10 Network (the forerunner of what is now Network Ten) from 13 March 1972 to 11 August 1977, broadcast in the primetime slot of 8:30 pm every weeknight.
Originally it aired from its inception in monochrome until 1975, with the switch over to colour television broadcasting in Australia
The series was notable for breaking new ground introducing controversial subject matter. The premiere of the series was promoted heavily in media with newspaper advertisements that described it as "Tonight, Australian television loses its virginity" and it followed the lives of residents living in a four-storey city apartment block at the fictional 96 Lindsay Street, Paddington.
The show was conceived by novelist David Sale (who also was a screenwriter, who worked on the series) and developed by production firm Cash Harmon Productionsthe series was originally commissioned by the then flagging network to make a soap opera with similar elements to the British series "Coronation Street, but a little racier".
The show was a daring last-bid attempt from a network on the verge of bankruptcy, and its immediate success (and advertising revenue) helped it be more competitive and buy successful new international shows such as The Waltons and M*A*S*H. By 1974, on the back of the series, the network was number one in the ratings for the first time.
Number 96 became one of the most popular Australian drama television series of its era, although because of its subject matter, was not picked up by many international markets. It was the world's first soap opera to screen in prime time five nights a week, and was the first Australian TV series to inspire a US remake.
History and synopsis
Number 96 was known for its humour as well as its groundbreaking depictions of taboo subjects of the time, exploring issues such as homosexuality, abortion, rape, interracial romance, drug usage, breast cancer Pregnancy in later life and transgenderism, but also its array of comedy characters with their own catchphrases, in a nod to vaudeville.
Although the show is often stated as the first television program to feature an LGTB, the first TV character was actually introduced the previous year in the US series sitcom All in the Family when a friend of Archie Bunker's, (portrayed by Carroll O'Connor known as "Steve" played by Phillip Carey stated to Archie, he was gay, despite being the first LGBT character on TV the character of "Steve" however only appeared in the series briefly for a single episode title "Judging Books by Covers".
According to the publication The Great Clowns of American Television, comedian Ernie Kovacs was the first person to portray a gay character on a long-term basis, as character Percy Dovetonsils, in his self-titled The Ernie Kovacs Show, although the term was not officially established at that time).
The first regular gay character in the United States debuted also in 1972 with actor Vincent Schiavelli |
https://en.wikipedia.org/wiki/Elbrus%20%28computer%29 | The Elbrus () is a line of Soviet and Russian computer systems developed by the Lebedev Institute of Precision Mechanics and Computer Engineering. These computers are used in the space program, nuclear weapons research, and defense systems, as well as for theoretical and researching purposes, such as an experimental Refal and CLU translators.
History
Historically, computers under the Elbrus brand comprised several different instruction set architectures (ISAs).
The first of them was the line of the large fourth-generation computers, developed by Vsevolod Burtsev. These were heavily influenced by the Burroughs large systems and similarly to them implemented tagged architecture and a variant of ALGOL-68 as system programming language.
After that Burtsev retired, and new Lebedev's chief developer, Boris Babayan, introduced the completely new system architecture. Differing completely from the architecture of both Elbrus 1 and Elbrus 2, it employed a very long instruction word (VLIW) approach.
In 1992, a spin-off company Moscow Center of SPARC Technologies (MCST) was created and continued development, using the "Elbrus" moniker as a brand for all computer systems developed by the company.
In the late 1990s, a series of SPARC-based central processing units (CPUs) were developed at MCST as a way to raise funds for in-house semiconductor intellectual property core development and to fill the niche of domestically-developed CPUs for the backdoor-wary military.
Models
Elbrus 1 (1979) was the first in the line.
A side development was an update of the 1965 BESM-6 as Elbrus-1K2.
a 10-processor computer, with superscalar, out-of-order execution and reduced instruction set computer (RISC) processors.
Elbrus 2 (1984)
Re-implementation of the Elbrus 1 architecture with faster emitter-coupled logic (ECL) chips.
Elbrus 3 (1990) was a 16-processor computer developed by the Babayan's team, and one of the first VLIW computers in the world.
Elbrus 2000 (2001) was a microprocessor development of the Elbrus 3 architecture. Also known as Elbrus-S.
Elbrus-3M1 (2005) is a two-processor computer based on Elbrus 2000 microprocessor working at 300MHz.
Elbrus МВ3S1/C (2009) is a ccNUMA four-processor computer based on Elbrus-S microprocessor working at 500MHz.
Elbrus-2S+ (2011) working at 500MHz, with capacity to calculate 16GFlops.
Elbrus-2SM (2014) working at 300MHz, with capacity to calculate 9.6GFlops.
Elbrus-4S (2014) working at 800MHz, with capacity to calculate 50GFlops.
Elbrus-1S+ (2016) system on a chip (SoC) with graphics processing unit (GPU), working at 600–1000MHz, with capacity to calculate 24GFlops.
Elbrus-8S (2014–2015) working at 1300MHz, with capacity to calculate 250GFlops.
Elbrus-8SV (2018) working at 1500MHz, with capacity to calculate 576GFlops.
Elbrus-16S (2019) working at 2000MHz, with capacity to calculate 1.5TFlops.
SPARC
Elbrus-90micro (1998–2010) is a computer line based on SPARC instruction set architecture (ISA) microproce |
https://en.wikipedia.org/wiki/WYSIWYM | In computing, What You See Is What You Mean (WYSIWYM, ) is a paradigm for editing a structured document. It is an adjunct to the better-known WYSIWYG (What You See Is What You Get) paradigm, which displays the result of a formatted document as it will appear on screen or in print—without showing the descriptive code underneath.
In a WYSIWYM editor, the user writes the contents in a structured way, marking the content according to its meaning, its significance in the document, and leaves its final appearance up to one or more separate style sheets. In essence, it aims to accurately display the contents being conveyed, rather than the actual formatting associated with it.
For example, in a WYSIWYM document, one would manually mark text as the title of the document, the name of a section, the caption associated with a figure, or the name of an author; this would in turn allow one element, such as section headings, to be rendered as large bold text in one style sheet, or as red center justified text in another, without further manual intervention. More often than not, this requires the semantic structure of the document to be decided in advance before writing it. The editor also needs a system for exporting structured content to generate the document's final format, following the indicated structure.
The main advantage of this system is the total separation of content and presentation: users can structure and write the document once, rather than repeatedly alternating between the two modes of presentation—an approach which comes with its own switch cost. And since the rendering of formatting is left to the export system, this also makes it easier to achieve consistency in design as well.
Document processors
Unlike an unstructured, fixed-presentation document, a document processor rather than a word processor must be used for WYSIWYM. The first document processor which articulated itself through the WYSIWYM term was LyX document processor, although similar concepts can be traced back to earlier publishing systems such as LaTeX, TPS (modeled on pioneering experiments at Xerox PARC) and FrameMaker.
For example, in FrameMaker, a document may be authored (i.e., viewed and edited) using two possible page views, the styling tags (called "formats") and contents of a document reside in "body pages", while structure and presentation are defined by "master pages". Multiple such documents can be linked together and programmed conditionally for a variety of applications. These elements can then be exported to corresponding tags which preserve some or all of their functionality in a markup language such as XML/HTML/CSS and PDF, or directly rendered down for final presentation in anything from PostScript to raw text.
A different approach to the WYSIWYM philosophy is taken by GNU TeXmacs, which combines the on-screen representation of the document structure with an almost-faithful WYSIWYG rendering.
In web environments
Major software vendors have integrated |
https://en.wikipedia.org/wiki/Java%20Native%20Interface | In software design, the Java Native Interface (JNI) is a foreign function interface programming framework that enables Java code running in a Java virtual machine (JVM) to call and be called by native applications (programs specific to a hardware and operating system platform) and libraries written in other languages such as C, C++ and assembly.
Objectives
JNI enables programmers to write native methods to handle situations when an application cannot be written entirely in the Java programming language, e.g. when the standard Java class library does not support the platform-specific features or program library. It is also used to modify an existing application (written in another programming language) to be accessible to Java applications. Many of the standard library classes depend on JNI to provide functionality to the developer and the user, e.g. file I/O and sound capabilities. Including performance- and platform-sensitive API implementations in the standard library allows all Java applications to access this functionality in a safe and platform-independent manner.
The JNI framework lets a native method use Java objects in the same way that Java code uses these objects. A native method can create Java objects and then inspect and use these objects to perform its tasks. A native method can also inspect and use objects created by Java application code.
Only applications and signed applets can invoke JNI.
An application that relies on JNI loses the platform portability Java offers (a partial workaround is to write a separate implementation of JNI code for each platform and have Java detect the operating system and load the correct one at runtime).
Not only can native code interface with Java, it can also draw on a Java , which is possible with the Java AWT Native Interface. The process is almost the same, with just a few changes. The Java AWT Native Interface is only available since J2SE 1.3.
JNI also allows direct access to assembly code, without even going through a C bridge. Accessing Java applications from assembly is possible in the same way.
Design
In the JNI framework, native functions are implemented in separate .c or .cpp files. (C++ provides a slightly simpler interface with JNI.) When the JVM invokes the function, it passes a JNIEnv pointer, a jobject pointer, and any Java arguments declared by the Java method. For example, the following converts a Java string to a native string:
extern "C"
JNIEXPORT void JNICALL Java_ClassName_MethodName
(JNIEnv *env, jobject obj, jstring javaString)
{
const char *nativeString = env->GetStringUTFChars(javaString, 0);
//Do something with the nativeString
env->ReleaseStringUTFChars(javaString, nativeString);
}
The env pointer is a structure that contains the interface to the JVM. It includes all of the functions necessary to interact with the JVM and to work with Java objects. Example JNI functions are converting native arrays to/from Java arrays, converting native strings to |
https://en.wikipedia.org/wiki/CAPTCHA | A CAPTCHA ( ) is a type of challenge–response test used in computing to determine whether the user is human in order to deter bot attacks and spam.
The term was coined in 2003 by Luis von Ahn, Manuel Blum, Nicholas J. Hopper, and John Langford. It is a contrived acronym for "Completely Automated Public Turing test to tell Computers and Humans Apart." A historically common type of CAPTCHA (displayed as Version 1.0) was first invented in 1997 by two groups working in parallel. This form of CAPTCHA requires entering a sequence of letters or numbers in a distorted image. Because the test is administered by a computer, in contrast to the standard Turing test that is administered by a human, CAPTCHAs are sometimes described as reverse Turing tests.
Two widely used CAPTCHA services are hCaptcha, an independent company, and reCAPTCHA, offered by Google. It takes the average person approximately 10 seconds to solve a typical CAPTCHA.
Purpose
CAPTCHAs' purpose is to prevent spam on websites, such as promotion spam, registration spam, and data scraping, and bots are less likely to abuse websites with spamming if those websites use CAPTCHA. Many websites use CAPTCHA effectively to prevent bot raiding. CAPTCHAs are designed so that humans can complete them, while most robots cannot. Newer CAPTCHAs look at the user's behaviour on the internet, to prove that they are a human. A normal CAPTCHA test only appears if the user acts like a bot, such as when they request webpages, or click links too fast.
History
Since the 1980s–1990s, users have wanted to make text illegible to computers. The first such people were hackers, posting about sensitive topics to Internet forums they thought were being automatically monitored on keywords. To circumvent such filters, they replaced a word with look-alike characters. HELLO could become or , and others, such that a filter could not detect all of them. This later became known as leetspeak.
One of the earliest commercial uses of CAPTCHAs was in the Gausebeck–Levchin test. In 2000, idrive.com began to protect its signup page with a CAPTCHA and prepared to file a patent. In 2001, PayPal used such tests as part of a fraud prevention strategy in which they asked humans to "retype distorted text that programs have difficulty recognizing." PayPal co founder and CTO Max Levchin helped commercialize this use.
A popular deployment of CAPTCHA technology, reCAPTCHA, was acquired by Google in 2009. In addition to preventing bot fraud for its users, Google used reCAPTCHA and CAPTCHA technology to digitize the archives of The New York Times and books from Google Books in 2011.
Invention
Eran Reshef, Gili Raanan and Eilon Solan who worked at Sanctum on Application Security Firewall first patented CAPTCHA in 1997. Their patent application details that "The invention is based on applying human advantage in applying sensory and cognitive skills to solving simple problems that prove to be extremely hard for computer software. Such skill |
https://en.wikipedia.org/wiki/Weak%20reference | In computer programming, a weak reference is a reference that does not protect the referenced object from collection by a garbage collector, unlike a strong reference. An object referenced only by weak references – meaning "every chain of references that reaches the object includes at least one weak reference as a link" – is considered weakly reachable, and can be treated as unreachable and so may be collected at any time. Some garbage-collected languages feature or support various levels of weak references, such as C#, Java, Lisp, OCaml, Perl, Python and PHP since the version 7.4.
Uses
Weak references have a number of common uses. When using reference counting garbage collection, weak references can break reference cycles, by using a weak reference for a link in the cycle. When one has an associative array (mapping, hash map) whose keys are (references to) objects, for example to hold auxiliary data about objects, using weak references for the keys avoids keeping the objects alive just because of their use as keys. When one has an object where other objects are registered, such as in the observer pattern (particularly in event handling), if a strong reference is kept, objects must be explicitly unregistered, otherwise a memory leak occurs (the lapsed listener problem), while a weak reference removes the need to unregister. When holding cached data that can be recreated if necessary, weak references allow the cache to be reclaimed, effectively producing discardable memory. This last case (a cache) is distinct from others, as it is preferable that the objects only be garbage collected if necessary, and there is thus a need for finer distinctions within weak references, here a stronger form of a weak reference. In many cases weak references do not need to be directly used, instead simply using a weak array or other container whose keys or values are weak references.
Garbage collection
Garbage collection is used to clean up unused objects and so reduce the potential for memory leaks and data corruption. There are two main types of garbage collection: tracing and reference counting. Reference counting schemes record the number of references to a given object and collect the object when the reference count becomes zero. Reference-counting cannot collect cyclic (or circular) references because only one object may be collected at a time. Groups of mutually referencing objects which are not directly referenced by other objects and are unreachable can thus become permanently resident; if an application continually generates such unreachable groups of unreachable objects this will have the effect of a memory leak. Weak references (references which are not counted in reference counting) may be used to solve the problem of circular references if the reference cycles are avoided by using weak references for some of the references within the group.
A very common case of such strong vs. weak reference distinctions is in tree structures, such as the Document |
https://en.wikipedia.org/wiki/Akra%E2%80%93Bazzi%20method | In computer science, the Akra–Bazzi method, or Akra–Bazzi theorem, is used to analyze the asymptotic behavior of the mathematical recurrences that appear in the analysis of divide and conquer algorithms where the sub-problems have substantially different sizes. It is a generalization of the master theorem for divide-and-conquer recurrences, which assumes that the sub-problems have equal size. It is named after mathematicians Mohamad Akra and Louay Bazzi.
Formulation
The Akra–Bazzi method applies to recurrence formulas of the form:
The conditions for usage are:
sufficient base cases are provided
and are constants for all
for all
for all
, where c is a constant and O notates Big O notation
for all
is a constant
The asymptotic behavior of is found by determining the value of for which and plugging that value into the equation:
(see Θ). Intuitively, represents a small perturbation in the index of . By noting that and that the absolute value of is always between 0 and 1, can be used to ignore the floor function in the index. Similarly, one can also ignore the ceiling function. For example, and will, as per the Akra–Bazzi theorem, have the same asymptotic behavior.
Example
Suppose is defined as 1 for integers and for integers . In applying the Akra–Bazzi method, the first step is to find the value of for which . In this example, . Then, using the formula, the asymptotic behavior can be determined as follows:
Significance
The Akra–Bazzi method is more useful than most other techniques for determining asymptotic behavior because it covers such a wide variety of cases. Its primary application is the approximation of the running time of many divide-and-conquer algorithms. For example, in the merge sort, the number of comparisons required in the worst case, which is roughly proportional to its runtime, is given recursively as and
for integers , and can thus be computed using the Akra–Bazzi method to be .
See also
Master theorem (analysis of algorithms)
Asymptotic complexity
References
External links
O Método de Akra-Bazzi na Resolução de Equações de Recorrência
Asymptotic analysis
Theorems in discrete mathematics
Recurrence relations
Bazzi family |
https://en.wikipedia.org/wiki/Air-ground%20radiotelephone%20service | Air-ground radiotelephone service is a system which allows voice calls and other communication services to be made from an aircraft to either a satellite or land based network. The service operates via a transceiver mounted in the aircraft on designated frequencies. In the US these frequencies have been allocated by the Federal Communications Commission.
The system is used in both commercial and general aviation services. Licensees may offer a wide range of telecommunications services to passengers and others on aircraft.
Design
A U.S. air-ground radiotelephone transmits a radio signal in the 849 to 851 megahertz range; this signal is sent to either a receiving ground station or a communications satellite depending on the design of the particular system. "Commercial aviation air-ground radiotelephone service licensees operate in the 800 MHz band and can provide communication services to all aviation markets, including commercial, governmental, and private aircraft." If it is a call from a commercial airline passenger radiotelephone, the call is then forwarded to a verification center to process credit card or calling card information. The verification center will then route the call to the public switched telephone network, which completes the call. For the return signal, ground stations and satellites use a radio signal in the 894 to 896 megahertz range.
Frequencies
Two separate frequency bands have been allocated by the FCC for air-ground telephone service. One at 454/459 MHz, was originally reserved for "general" aviation use (non-airliners) and the 800 MHz range, primarily used for airliner telephone service, which has shown limited acceptance by passengers. AT&T Corporation abandoned its 800 MHz air-ground offering in 2005, and Verizon AIRFONE (formerly GTE Airfone) is scheduled for decommissioning in late 2008, although the FCC has re-auctioned Verizon's spectrum (see below). Skytel, (now defunct) which had the third nationwide 800 MHz license, elected not to build it, but continued to operate in the 450 MHz AGRAS system. Its AGRAS license and operating network was sold to Bell Industries in April, 2007.
The 450 MHz General Aviation network is administered by Mid-America Computer Corporation in Blair, Nebraska, which has called the service AGRAS, and requires the use of instruments manufactured by Terra and Chelton Aviation/Wulfsberg Electronics, and marketed as the Flitephone VI Series. "General aviation air-ground radiotelephone service licensees operate in the 450 MHz band and can provide a variety of telecommunications services to private aircraft such as small single engine planes and corporate jets."
In the 800 MHz band, the FCC defined 10 blocks of paired uplink/downlink narrowband ranges (6 kHz) and six control ranges (3.2 kHz). Six carriers were licensed to offer in-flight telephony, each being granted non-exclusive use of the 10 blocks and exclusive use of a control block. Of the six, only three commenced operations, and on |
https://en.wikipedia.org/wiki/We%20TV | We TV (stylized as WE tv) is an American pay television channel. Owned by AMC Networks since its September 1997 launch, it is oriented mainly towards lifestyle and entertainment programming.
As of February 2015, approximately 85.2 million American households (73.2% of households with television) received We TV. In March 2015, AMC announced it would soon begin making its channels available to cord cutters, including AMC, BBC America, IFC, Sundance TV, and We TV itself.
History
Romance Classics (1997–2001)
We TV was originally known as Romance Classics when it launched on September 1, 1997 under the ownership of what was then the Cablevision Systems Corporation-controlled Rainbow Media. It was originally a movie channel focusing mostly on romantic dramas and comedies, and television miniseries; similar to the original format of AMC (as American Movie Classics), the channel initially broadcast its films commercial-free. At launch, the Rainbow-owned MuchMusic USA dropped movies as a stunt as a movie channel.
Format change as We TV (2001–2014)
This format was abandoned on January 1, 2001, when the channel was relaunched as WE: Women's Entertainment, taking on an ad-supported general entertainment format. In 2006, the channel was renamed WE tv. The channel aired the first three seasons of the popular Logie Award-winning Australian television series McLeod's Daughters, but dropped the show in April 2006. The channel's format then shifted towards reality shows, with several having topics related to weddings (such as Bridezillas, Big Easy Brides and My Fair Wedding with David Tutera). Other popular shows on the included Secret Lives of Women, The Locator and Amazing Cakes. In 2009, Rainbow launched Wedding Central, a sister channel to WE tv. The channel closed on July 1, 2011.
In January 2011, We TV confirmed that it had signed Toni Braxton for a reality series, entitled Braxton Family Values, which is marketed as one of the flagship shows. To prepare for a new show lineup, We TV also gave the AMC a new logo and marketing tagline: "Life As WE Know It". In March 2012, We TV confirmed that the AMC had ordered 14 episodes of Kendra on Top, a reality show following the lives of Kendra Wilkinson and Hank Baskett, who previously appeared in the E! reality series Kendra. Kendra said the show focuses on "motherhood, parenthood, and wife hood". Kendra On Top premiered on June 5, 2012.
Rebranding (2014–present)
In June 2014, AMC unveiled a new logo, dropping the "Women's Entertainment" tagline. AMC president Marc Juris explained that while the AMC was to remain "a leading destination for women on television and online", the goal of the new branding was to broaden the focus on the word "we" as representing shared experiences, describing it as "a powerful and universal theme which drives connection, conversation, collaboration and community". As part of the rebranding, AMC also announced its first original scripted series, The Divide, which was originally pit |
https://en.wikipedia.org/wiki/Channel%20capacity | Channel capacity, in electrical engineering, computer science, and information theory, is the tight upper bound on the rate at which information can be reliably transmitted over a communication channel.
Following the terms of the noisy-channel coding theorem, the channel capacity of a given channel is the highest information rate (in units of information per unit time) that can be achieved with arbitrarily small error probability.
Information theory, developed by Claude E. Shannon in 1948, defines the notion of channel capacity and provides a mathematical model by which it may be computed. The key result states that the capacity of the channel, as defined above, is given by the maximum of the mutual information between the input and output of the channel, where the maximization is with respect to the input distribution.
The notion of channel capacity has been central to the development of modern wireline and wireless communication systems, with the advent of novel error correction coding mechanisms that have resulted in achieving performance very close to the limits promised by channel capacity.
Formal definition
The basic mathematical model for a communication system is the following:
where:
is the message to be transmitted;
is the channel input symbol ( is a sequence of symbols) taken in an alphabet ;
is the channel output symbol ( is a sequence of symbols) taken in an alphabet ;
is the estimate of the transmitted message;
is the encoding function for a block of length ;
is the noisy channel, which is modeled by a conditional probability distribution; and,
is the decoding function for a block of length .
Let and be modeled as random variables. Furthermore, let be the conditional probability distribution function of given , which is an inherent fixed property of the communication channel. Then the choice of the marginal distribution completely determines the joint distribution due to the identity
which, in turn, induces a mutual information . The channel capacity is defined as
where the supremum is taken over all possible choices of .
Additivity of channel capacity
Channel capacity is additive over independent channels. It means that using two independent channels in a combined manner provides the same theoretical capacity as using them independently.
More formally, let and be two independent channels modelled as above; having an input alphabet and an output alphabet . Idem for .
We define the product channel as
This theorem states:
Shannon capacity of a graph
If G is an undirected graph, it can be used to define a communications channel in which the symbols are the graph vertices, and two codewords may be confused with each other if their symbols in each position are equal or adjacent. The computational complexity of finding the Shannon capacity of such a channel remains open, but it can be upper bounded by another important graph invariant, the Lovász number.
Noisy-channel coding theorem
The nois |
https://en.wikipedia.org/wiki/Neo%20%28The%20Matrix%29 | Neo (born as Thomas A. Anderson, also known as The One, an anagram for Neo) is a fictional character and the protagonist of The Matrix franchise, created by the Wachowskis. He was portrayed as a cybercriminal and computer programmer by Keanu Reeves in the films, as well as having a cameo in The Animatrix short film Kid's Story. Andrew Bowen provided Neo's voice in The Matrix: Path of Neo. In 2021, Reeves reprised his role in The Matrix Resurrections with what Vulture calls "his signature John Wick look".
In 2008, Neo was selected by Empire as the 68th Greatest Movie Character of All Time... Neo is also an anagram of "one", a reference to his destiny of being The One who would bring peace. There are claims that a nightclub in Chicago inspired the name of the character. Neo is considered to be a superhero.
Fictional character biography
Thomas A. Anderson was born in Lower Downtown, Capital City, USA on March 11, 1962, according to his criminal record, or September 13, 1971 according to his passport (both seen in the film). His mother was Michelle McGahey (the name of the first film's art director) and his father was John Anderson. He attended Central West Junior High and Owen Patterson High (named after the film's production designer). In high school, he excelled at science, math and computer courses, and displayed an aptitude for literature and history. Although he had disciplinary troubles when he was thirteen to fourteen years old, Anderson went on to become a respected member of the school community through his involvement in football and hockey.
At the start of the series, Neo is one of billions of humans neurally connected to the Matrix, unaware that the world he lives in is a simulated reality.
The Matrix
In his normal life, he is a quiet programmer for the "respectable software company" Meta Cortex, while in private, he is a computer hacker who penetrates computer systems illicitly and steals information under his hacker alias "Neo". He also sells illegal untraceable computer systems and hacking programs along with controlling computer viruses stashed on CDs and diskettes. During his time as a hacker, Anderson has learned about something known only as "The Matrix".
During the years prior to the events of The Matrix, Neo has spent his time trying to find the one man who he thought could tell him what the Matrix was, a supposed terrorist known only as Morpheus. After an encounter with another hacker, Trinity, Anderson is suddenly contacted by Morpheus via a cell phone mailed to his office, but is almost immediately captured by the virtual reality's Agents, led by Agent Smith. After refusing to cooperate with the agents, Neo has an electronic bug implanted within his Matrix-simulated body so that his actions can be tracked, and those seeking to make contact from the free world can be traced and destroyed. He is then contacted by Trinity, freed from the bug, and taken to meet Morpheus.
Neo is offered a choice to remain in his everyday l |
https://en.wikipedia.org/wiki/CAN%20bus | A Controller Area Network (CAN bus) is a vehicle bus standard designed to allow microcontrollers and devices to communicate with each other's applications without a host computer. It is a message-based protocol, designed originally for multiplex electrical wiring within automobiles to save on copper, but it can also be used in many other contexts. For each device, the data in a frame is transmitted serially but in such a way that if more than one device transmits at the same time, the highest priority device can continue while the others back off. Frames are received by all devices, including by the transmitting device.
History
Development of the CAN bus started in 1983 at Robert Bosch GmbH. The protocol was officially released in 1986 at the Society of Automotive Engineers (SAE) conference in Detroit, Michigan. The first CAN controller chips were introduced by Intel in 1987, and shortly thereafter by Philips. Released in 1991, the Mercedes-Benz W140 was the first production vehicle to feature a CAN-based multiplex wiring system.
Bosch published several versions of the CAN specification. The latest is CAN 2.0, published in 1991. This specification has two parts. Part A is for the standard format with an 11-bit identifier, and part B is for the extended format with a 29-bit identifier. A CAN device that uses 11-bit identifiers is commonly called CAN 2.0A, and a CAN device that uses 29-bit identifiers is commonly called CAN 2.0B. These standards are freely available from Bosch along with other specifications and white papers.
In 1993, the International Organization for Standardization (ISO) released CAN standard ISO 11898, which was later restructured into two parts: ISO 11898-1 which covers the data link layer, and ISO 11898-2 which covers the CAN physical layer for high-speed CAN. ISO 11898-3 was released later and covers the CAN physical layer for low-speed, fault-tolerant CAN. The physical layer standards ISO 11898-2 and ISO 11898-3 are not part of the Bosch CAN 2.0 specification.
In 2012, Bosch released CAN FD 1.0, or CAN with Flexible Data-Rate. This specification uses a different frame format that allows a different data length as well as optionally switching to a faster bit rate after the arbitration is decided. CAN FD is compatible with existing CAN 2.0 networks so new CAN FD devices can coexist on the same network with existing CAN devices. , Bosch was active in extending CAN standards.
The CAN bus is one of five protocols used in the on-board diagnostics (OBD)-II vehicle diagnostics standard. The OBD-II standard has been mandatory for all cars and light trucks sold in the United States since 1996. The EOBD standard has been mandatory for all petrol vehicles sold in the European Union since 2001 and all diesel vehicles since 2004.
Applications
Passenger vehicles, trucks, buses (combustion vehicles and electric vehicles)
Agricultural equipment
Electronic equipment for aviation and navigation
Industrial automation and mechanica |
https://en.wikipedia.org/wiki/CAN | CAN may refer to:
Organizations
Andean Community of Nations, a South American trade bloc with Bolivia, Colombia, Ecuador and Peru
Campus Antiwar Network, an American network of students opposing the occupation of Iraq
Caja Navarra, a former savings banks in Navarre, Spain
Chechnya Advocacy Network, an American non-government organization for Chechnya advocacy
Christian Association of Nigeria, an umbrella organization containing numerous Christian denominations in Nigeria
Climate Action Network, an international non-governmental network to limit human-induced climate change
Corporate Angel Network, an American non-profit organization that arranges free air travel for cancer patients
Cricket Association of Nepal, governing body of Nepali cricket
Cult Awareness Network, an American organization operated by the Church of Scientology
Cure Autism Now, a former American organization for autism advocacy
Cycling Action Network, a New Zealand cycling advocacy group
Science and medicine
CAN (gene), a human gene
Calcium ammonium nitrate, a fertilizer
Ceric ammonium nitrate, an inorganic compound
Chronic allograft nephropathy, the leading cause of kidney transplant failure
Computing
Campus area network or corporate area network, a computer network in a limited geographical area
Cancel character, a precision control character in the C0 control code set
CAN bus, controller area network bus, a type of microcontroller bus designed for vehicles
Computer-assisted notetaking, or electronic notetaking
Content addressable network, a distributed hash table for P2P
Copper access node, a network device to provide xDSL signals on telephone lines, a.k.a. DSLAM
Other uses
Canada (ISO country code, IOC code), a country in North America
Coupe d'Afrique des Nations (CAN) or Africa Cup of Nations, an association football competition in Africa
Guangzhou Baiyun International Airport (IATA airport code), the main airport in Guangzhou, Guangdong, China
Can (band), a German experimental rock band
See also
Can (disambiguation)
CANS (disambiguation) |
https://en.wikipedia.org/wiki/Operator%20logo | An operator logo is a logo which appears on the status screen of a mobile phone. Originally intended as a way for phone companies to brand phones attached to their networks, the operator logo has since become a method by which owners may customise their phones to reflect their own interests. It helped kick off mobile phone content advertising which became particularly prominent with ring tone adverts.
History
The older mobile phones of 90's (Black & white LCD Screen) had options to show telecom operator logo instead of the showing the name in plain text. Later various companies provided custom logo and designs to set as Operator logo. These logos can be shared by SMS with other people.
Later on when color mobiles came to market, Colorful logo option came to mobile devices. An industry has sprung up around the use of these Custom logo designs, and around ring tones, tailored towards phones, such as those made by Nokia, which can receive new logos in a text message.
Several mobile phone companies provide services on their websites where users can design their own logos, and there is also software available which can be used to create them.
See also
OTA bitmap
Smart Messaging
References
Logos
Brand management
Mobile telecommunications |
https://en.wikipedia.org/wiki/Brachial%20plexus | The brachial plexus is a network of nerves (nerve plexus) formed by the anterior rami of the lower four cervical nerves and first thoracic nerve (C5, C6, C7, C8, and T1). This plexus extends from the spinal cord, through the cervicoaxillary canal in the neck, over the first rib, and into the armpit, it supplies afferent and efferent nerve fibers to the chest, shoulder, arm, forearm, and hand.
Structure
The brachial plexus is divided into five roots, three trunks, six divisions (three anterior and three posterior), three cords, and five branches. There are five "terminal" branches and numerous other "pre-terminal" or "collateral" branches, such as the subscapular nerve, the thoracodorsal nerve, and the long thoracic nerve, that leave the plexus at various points along its length. A common structure used to identify part of the brachial plexus in cadaver dissections is the M or W shape made by the musculocutaneous nerve, lateral cord, median nerve, medial cord, and ulnar nerve.
Roots
The five roots are the five anterior primary rami of the spinal nerves, after they have given off their segmental supply to the muscles of the neck.
The brachial plexus emerges at five different levels: C5, C6, C7, C8, and T1. C5 and C6 merge to establish the upper trunk, C7 continuously forms the middle trunk, and C8 and T1 merge to establish the lower trunk.
Prefixed or postfixed formations in some cases involve C4 or T2, respectively.
The dorsal scapular nerve comes from the superior trunk and innervates the rhomboid muscles which retract and downwardly rotate the scapula. The subclavian nerve originates in both C5 and C6 and innervates the subclavius, a muscle that involves lifting the first ribs during respiration. The long thoracic nerve arises from C5, C6, and C7. This nerve innervates the serratus anterior, which draws the scapula laterally and is the prime mover in all forward-reaching and pushing actions.
Trunks
These roots merge to form the trunks:
"superior" or "upper" (C5-C6)
"middle" (C7)
"inferior" or "lower" (C8, T1)
Divisions
Each trunk then splits in two, to form six divisions:
anterior divisions of the upper, middle, and lower trunks
posterior divisions of the upper, middle, and lower trunks
when observing the body in the anatomical position, the anterior divisions are superficial to the posterior divisions
Cords
These six divisions regroup to become the three cords or large fiber bundles. The cords are named by their position with respect to the axillary artery.
The posterior cord is formed from the three posterior divisions of the trunks (C5-C8, T1)
The lateral cord is formed from the anterior divisions of the upper and middle trunks (C5-C7)
The medial cord is simply a continuation of the anterior division of the lower trunk (C8, T1)
Diagram
Branches
The branches are listed below. Most branches arise from the cords, but few branches arise (indicated in italics) directly from earlier structures. The five on the left are considered |
https://en.wikipedia.org/wiki/NASA%20Deep%20Space%20Network | The NASA Deep Space Network (DSN) is a worldwide network of American spacecraft communication ground segment facilities, located in the United States (California), Spain (Madrid), and Australia (Canberra), that supports NASA's interplanetary spacecraft missions. It also performs radio and radar astronomy observations for the exploration of the Solar System and the universe, and supports selected Earth-orbiting missions. DSN is part of the NASA Jet Propulsion Laboratory (JPL).
General information
DSN currently consists of three deep-space communications facilities located such that a distant spacecraft is always in view of at least one station. They are:
the Goldstone Deep Space Communications Complex () outside Barstow, California. For details of Goldstone's contribution to the early days of space probe tracking, see Project Space Track;
the Madrid Deep Space Communications Complex (), west of Madrid, Spain; and
the Canberra Deep Space Communication Complex (CDSCC) in the Australian Capital Territory (), southwest of Canberra, Australia near the Tidbinbilla Nature Reserve.
Each facility is situated in semi-mountainous, bowl-shaped terrain to help shield against radio frequency interference. The strategic placement of the stations permits constant observation of spacecraft as the Earth rotates, which helps to make the DSN the largest and most sensitive scientific telecommunications system in the world.
The DSN supports NASA's contribution to the scientific investigation of the Solar System: It provides a two-way communications link that guides and controls various NASA uncrewed interplanetary space probes, and brings back the images and new scientific information these probes collect. All DSN antennas are steerable, high-gain, parabolic reflector antennas.
The antennas and data delivery systems make it possible to:
acquire telemetry data from spacecraft.
transmit commands to spacecraft.
upload software modifications to spacecraft.
track spacecraft position and velocity.
perform Very Long Baseline Interferometry observations.
measure variations in radio waves for radio science experiments.
gather science data.
monitor and control the performance of the network.
Other countries and organizations also run deep space networks. The DSN operates according to the standards of the Consultative Committee for Space Data Systems, as do most other deep space networks, and hence the DSN is able to inter-operate with the networks of other space agencies. These include the Soviet Deep Space Network, the Chinese Deep Space Network, the Indian Deep Space Network, the Japanese Deep Space Network, and the ESTRACK of the European Space Agency. These agencies often cooperate for better mission coverage. In particular, DSN has a cross-support agreement with ESA that allows mutual use of both networks for more effectiveness and reduced risk. In addition, radio astronomy facilities, such as Parkes Observatory or the Green Bank Telescope, are sometime |
https://en.wikipedia.org/wiki/Mavis%20Beacon%20%28character%29 | Mavis Beacon is a fictional character created for the Mavis Beacon Teaches Typing line of computer software.
History
Developed to be a personification of a The Software Toolworks instructional typing program, Mavis Beacon debuted as simply a photo of a model on the software's packaging in 1987. The model chosen to be the face of Mavis was Haitian-born Renée L'Espérance, who was discovered working behind the perfume counter at Saks Fifth Avenue Beverly Hills by former talk-show host and partner at The Software Toolworks Les Crane in 1985. Mavis's name comes from a combination of Mavis Staples (one of the software developer's favorite singers) and the word beacon (an allusion to her role as a guide to typing).
There have been several models chosen to represent the confident efficiency of Mavis Beacon; her image changes to represent a "modern professional typing instructor."
According to an opinion article in the New York Times, author J.D. Biersdorf opined, "Due to Mavis Beacon being portrayed by a black woman, some retailers were initially reluctant to display the product. However, once the popularity of the program became evident, many distributors reversed their decision and began to display the line of software bearing Mavis Beacon's image."
Since its introduction, Mavis Beacon Teaches Typing has been the best-selling instructional typing software.
Fame
Mavis Beacon has been seen as groundbreaking for being one of the first computer instruction characters and for being a female African-American embodiment of computer software. Throughout the 1990s, Mavis Beacon served as the virtual typing instructor at numerous U.S. schools. As of 1998, she had instructed 6,000,000 school children. Mavis has been compared to U.S. cultural icon Betty Crocker and has been called "the Betty Crocker of cyberspace".
Confusion
Mavis Beacon is often thought to be a living or historical figure by the public. This confusion has led many to contact the software developers seeking to speak to, interview, or book Mavis for an event. Furthermore, as a result of Mavis Beacon's continuous use in computer typing software, and her image on millions of software boxes, many consumers have reported confabulations (i.e. false memories) of Mavis Beacon winning typing contests or appearing on talk shows.
See also
Typequick
References
Female characters in advertising
Fictional African-American people
Mascots introduced in 1987 |
https://en.wikipedia.org/wiki/TNC | TNC may refer to:
Computers
Triangular network coding, a packet coding scheme
Trusted Network Connect, an open architecture for computer network access control
Education
Trevecca Nazarene College, now called Trevecca Nazarene University, Nashville, Tennessee, U.S.
Turkmen National Conservatory, a music conservatory in Ashgabat, Turkmenistan
Science and medicine
Tenascin C or TN-C, a protein encoded by the TNC gene
Thymic nurse cells
Arts, entertainment, and media
Teatre Nacional de Catalunya, a public theatre in Barcelona, Catalonia, Spain
Television Nishinippon Corporation, a TV station in Fukuoka, Japan
Telenovela Channel, a telenovela-based cable channel in the Philippines
The New Criterion, a monthly literary magazine based in New York City, New York, U.S.
Theater for the New City, New York City, New York, U.S.
Other uses
Terminal node controller, a device used by amateur radio operators
The Nature Conservancy, an environmental organization headquartered in Arlington, Virginia, U.S.
TNC connector, a type of coaxial cable connector
Toronto Neighbourhood Centres
Transnational corporation, corporations that do not identify with any one country
Transportation network company, a legal term for a ridesharing company in certain jurisdictions
tnc, ISO 639-3 code for Tanimuca-Retuarã language
Team and Concepts (TnC), a Hong Kong-based company that produced the online spreadsheet EditGrid
Tripartite Naval Commission, a 1945 naval commission formed to allocate seized German ships and submarines
A contractual term, otherwise known as "terms and conditions" |
https://en.wikipedia.org/wiki/The%20Box%20%28Australian%20TV%20series%29 | The Box is an Australian soap opera that ran on ATV-0 from 11 February 1974 until 11 October 1977 and on 0–10 Network affiliates around Australia.
The Box was produced by Crawford Productions who at the time was having great success producing police drama series in Australia. The Box was Crawford's first soap opera, and was launched as a reaction to the enormous success of the rival adult soap opera Number 96.
Synopsis
The Box was a drama set in a fictional Melbourne television station, called UCV Channel 12, and explores the day-to-day working's of the company and the professional and personal lives of the staff who work there. It featured elements that satirised the Australian television industry.
Characters in the series were said to be modelled on Australian television figures and personalities of the day with central character Sir. Henry Usher modelled on both media mogul Sir Frank Packer and aviator Sir Reginald Ansett, and indeed the tea lady Mrs Hopkins, played by Lois Ramsay was based on the company's own tea lady, many self-referential elements featured. Like Number 96 the series was famous for its adult storylines, frequent nude glimpses, and sexual content. Also like Number 96, it was spun off into a feature film adaptation, The Box.
Storylines
Along with constructing characters modelled on real-life Australian television figures of the day, The Box presented various fictional programs produced by UCV-12 that commented-on real-life Australian programs. Police procedural Manhunt, which was lumbered with a dim and accident-prone lead actor Tony Wild (Ken James), was much like the police series produced by Crawfords at that time. Variety program Big Night Out was an In Melbourne Tonight style production. Later the medical drama Mercy Flight seemed connected to early British series The Flying Doctor (1959). Other programs produced by the station included children's show "Holliday Farm", chat program "Girl Talk", and period drama "Gully Rider".
The initial episodes of The Box emphasised sex, scandal, the political machinations of station personnel, and featured several nude scenes. The first episode showed a sexy young woman named Felicity (played by 20-year-old Helen Hemingway) seduce Big Night Out host Gary Burke (Peter Regan). Felicity then announced she was a 15-year-old schoolgirl, causing the station to try to cover-up the scandal. Scheming bisexual television magazine journalist Vicki Stafford (Judy Nunn) exploited the situation and had Felicity pose for a nude centerfold with Tony Wild. Vicki also kissed Felicity, in Australian TV's first ever lesbian kiss. Felicity was soon revealed to be over 18, and schemed her way into the station to appear on Big Night Out. Vicki later switched to working for the station, producing and presenting chat and news style programs.
The Box also featured an openly gay television producer, the flamboyant Lee Whiteman (Paul Karo), and gossipy tea lady Mrs. Hopkins (Lois Ramsey). Mrs. Hopkins' son |
https://en.wikipedia.org/wiki/C%20preprocessor | The C preprocessor is the macro preprocessor for several computer programming languages, such as C, Objective-C, C++, and a variety of Fortran languages. The preprocessor provides inclusion of header files, macro expansions, conditional compilation, and line control.
The language of preprocessor directives is only weakly related to the grammar of C, and so is sometimes used to process other kinds of text files.
History
The preprocessor was introduced to C around 1973 at the urging of Alan Snyder and also in recognition of the usefulness of the file inclusion mechanisms available in BCPL and PL/I. Its original version offered only file inclusion and simple string replacement using #include and #define for parameterless macros, respectively. It was extended shortly after, firstly by Mike Lesk and then by John Reiser, to incorporate macros with arguments and conditional compilation.
The C preprocessor was part of a long macro-language tradition at Bell Labs, which was started by Douglas Eastwood and Douglas McIlroy in 1959.
Phases
Preprocessing is defined by the first four (of eight) phases of translation specified in the C Standard.
Trigraph replacement: The preprocessor replaces trigraph sequences with the characters they represent. This phase will be removed in C23 following the steps of C++17.
Line splicing: Physical source lines that are continued with escaped newline sequences are spliced to form logical lines.
Tokenization: The preprocessor breaks the result into preprocessing tokens and whitespace. It replaces comments with whitespace.
Macro expansion and directive handling: Preprocessing directive lines, including file inclusion and conditional compilation, are executed. The preprocessor simultaneously expands macros and, since the 1999 version of the C standard, handles _Pragma operators.
Including files
One of the most common uses of the preprocessor is to include another source file:
#include <stdio.h>
int main(void)
{
printf("Hello, World!\n");
return 0;
}
The preprocessor replaces the line #include <stdio.h> with the textual content of the file 'stdio.h', which declares the printf() function among other things.
This can also be written using double quotes, e.g. #include "stdio.h". If the filename is enclosed within angle brackets, the file is searched for in the standard compiler include paths. If the filename is enclosed within double quotes, the search path is expanded to include the current source file directory. C compilers and programming environments all have a facility that allows the programmer to define where include files can be found. This can be introduced through a command-line flag, which can be parameterized using a makefile, so that a different set of include files can be swapped in for different operating systems, for instance.
By convention, include files are named with either a .h or .hpp extension. However, there is no requirement that this is observed. Files with a .def extension may deno |
https://en.wikipedia.org/wiki/Scheduling%20%28computing%29 | In computing, scheduling is the action of assigning resources to perform tasks. The resources may be processors, network links or expansion cards. The tasks may be threads, processes or data flows.
The scheduling activity is carried out by a process called scheduler. Schedulers are often designed so as to keep all computer resources busy (as in load balancing), allow multiple users to share system resources effectively, or to achieve a target quality-of-service.
Scheduling is fundamental to computation itself, and an intrinsic part of the execution model of a computer system; the concept of scheduling makes it possible to have computer multitasking with a single central processing unit (CPU).
Goals
A scheduler may aim at one or more goals, for example:
maximizing throughput (the total amount of work completed per time unit);
minimizing wait time (time from work becoming ready until the first point it begins execution);
minimizing latency or response time (time from work becoming ready until it is finished in case of batch activity, or until the system responds and hands the first output to the user in case of interactive activity);
maximizing fairness (equal CPU time to each process, or more generally appropriate times according to the priority and workload of each process).
In practice, these goals often conflict (e.g. throughput versus latency), thus a scheduler will implement a suitable compromise. Preference is measured by any one of the concerns mentioned above, depending upon the user's needs and objectives.
In real-time environments, such as embedded systems for automatic control in industry (for example robotics), the scheduler also must ensure that processes can meet deadlines; this is crucial for keeping the system stable. Scheduled tasks can also be distributed to remote devices across a network and managed through an administrative back end.
Types of operating system schedulers
The scheduler is an operating system module that selects the next jobs to be admitted into the system and the next process to run. Operating systems may feature up to three distinct scheduler types: a long-term scheduler (also known as an admission scheduler or high-level scheduler), a mid-term or medium-term scheduler, and a short-term scheduler. The names suggest the relative frequency with which their functions are performed.
Process scheduler
The process scheduler is a part of the operating system that decides which process runs at a certain point in time. It usually has the ability to pause a running process, move it to the back of the running queue and start a new process; such a scheduler is known as a preemptive scheduler, otherwise it is a cooperative scheduler.
We distinguish between long-term scheduling, medium-term scheduling, and short-term scheduling based on how often decisions must be made.
Long-term scheduling
The long-term scheduler, or admission scheduler, decides which jobs or processes are to be admitted to the ready queu |
https://en.wikipedia.org/wiki/PMC | PMC may refer to:
Computing
Pacific Microelectronics Centre, acquired by Sierra Semiconductor in 1994 to form PMC-Sierra
Parallel model combination, a hidden Markov model-based method for speech recognition
PCI Mezzanine Card, a printed circuit board
Polymorphic containers, a feature of the Parrot virtual machine
Portable Media Center, a hard drive-based portable media player
Programmable metallization cell, new memory technology that uses copper nanowires
Education
Pine Manor College, Massachusetts, United States
Plymouth College, United Kingdom
Poonch Medical College, Azad Kashmir, Pakistan
Punjab Medical College, now Faisalabad Medical University, Pakistan
Hospitals
Palomar Medical Center, California, United States
Parrish Medical Center, Florida, United States
Military
Philippine Marine Corps
Popular Mobilization Forces (Iraq)
Private military companies (PMCs)
Private military contractors – personnel of the company
President of the Mess Committee
Portuguese Marine Corps
Municipal corporations
Patna Municipal Corporation
Pune Municipal Corporation
Potato Marketing Corporation of Western Australia
Organizations
Paleozoological Museum of China
Places
El Tepual Airport (IATA: PMC, ICAO: SCTE), Chile
Palais de la musique et des congrès, a music and convention venue in France
Pine Mountain Club, California, United States
Publishing and entertainment
Panjabi MC (born 1971), British hip hop DJ
Penske Media Corporation, a publishing company, abbreviated PMC
Persian Music Channel, a TV network
PMC Ltd. (Professional Monitor Company), a manufacturer of loudspeakers
PMC: The Bunker, native title of the South Korean film Take Point
Science and medicine
Paramyotonia congenita, a genetic disorder
PhysMath Central, a defunct journal imprint
Polar mesospheric clouds, also known as noctilucent clouds, a weather phenomenon
Pontine micturition center, part of the brainstem
Posteromedial cortex, the rear (posterior) portion of the centerline (medial) face of the cerebral cortex
Premotor cortex, part of the cerebral cortex
Pseudomembranous colitis, a disease of the colon
PubMed Central, a collection of journal articles
Other uses
Pakistan Medical Commission, a statutory regulatory authority for medical and dental practitioners
Pan-Massachusetts Challenge, a charity bike-a-thon
Philippine Marine Corps, part of the Philippine Navy
Politico-media complex, a name given to the network of relationships between a state's political classes and its media industry
Polymer matrix composite, a composite material
Population Media Center, an organization headquartered in Vermont, United States
Precious Metal Clay, a brand of metal clay
Presidential Memorial Certificate, United States
Pressed Metal Corporation, an Australian automotive manufacturer
Professional-managerial class, a social class within capitalism
Project management committee
Punjab & Maharashtra Co-operative Bank
Pyeonghwa Motors Corp., a car manufacture |
https://en.wikipedia.org/wiki/ExpressBus | ExpressBus is a Finnish express coach network covering most of Finland. It is a joint marketing brand of 3 coach operators and it was launched in 1991. The fleet has around 100 coaches with a white base colour and a red-blue arrow. The current ExpressBus operators are Länsilinjat, Paunu and Pekolan liikenne. Many of the departures also carry Matkahuolto bus cargo in addition to passengers.
References
External links
ExpressBus
Bus companies of Finland
Bus transport brands |
https://en.wikipedia.org/wiki/Atomic%20value | An atomic value may refer to:
Atomic number, the number of protons in the nucleus of an atom
A piece of data in a database table that cannot be broken down any further (see first normal form) |
https://en.wikipedia.org/wiki/Index%20of%20object-oriented%20programming%20articles | This is a list of terms found in object-oriented programming.
A
Abstract class
Accessibility
Abstract method
Abstraction (computer science)
Access control
Access modifiers
Accessor method
Adapter pattern
Aspect-oriented
B
Bridge pattern
Builder pattern
Base class
C
Cast
Chain-of-responsibility pattern
Class
Class hierarchy
Class method
Class object
Class variable
Cohesion
Collection class
Composition
Constructor
Container (abstract data type)
Contravariance
Copy constructor
Coupling
Covariance
D
Data-driven design
Data hiding
Default constructor
Deep copy
Delegation
Dependency injection
Destructor
Dispatch table
Dynamic binding
Dynamic dispatch
Dynamically typed language
E
Early binding
Eigenclass
Encapsulation (computer programming)
European Conference on Object-Oriented Programming
Exception handling
Extension
F
Facade - pattern
Factory method pattern
Factory object
Factory pattern
Field
Finalizer
First-class function
Fragile base class
Function composition
G
Generic programming
God object
H
Heap-based memory allocation
Helper class
Hybrid language
I
Immutable object (also called immutable value)
Information hiding
Inheritance
Initialize
Inline function
Inner class
Instance (computer science)
Instance method
Instance variable (also called data member)
Interaction diagram
Interface
Inversion of control (IoC)
Iterator
L
Late binding
Liskov substitution principle
M
Member accessibility
Members, any contents of a class: Attributes, Methods, and Inner classes
Message passing
Metaclass
Metaprogramming
Method (computer programming)
Mixin
Mock object
Model–view–controller (MVC)
Modular programming
Multiple dispatch
Multiple inheritance
Multitier architecture
Mutable variable
Mutator method
N
Name mangling
Namespace
Native method
Nested class
O
Object (computer science)
Object type
OOPSLA – annual conference on Object-Oriented Programming, Systems, Languages, and Applications
Open/closed principle
Orthogonality
Overload
P
Package
Parametric overloading
Parameterized classes
Parnas's principles
Partial class
Patterns
Policy-based design
Polymorphic
Primitive data type
, a way of encapsulation in object-oriented programming
Programming paradigm
, a way of encapsulation in object-oriented programming
Protocol
Prototype pattern
Prototype-based programming
, a way of encapsulation in object-oriented programming
Pure polymorphism
Pure virtual function (also called pure virtual method)
R
Rapid application development (sometimes Rapid prototyping)
Recursion
Refinement
Reflection
Responsibility-driven design
Reverse polymorphism
Run-time type information
S
Scope
Shallow copy, as opposed to deep copy
Single responsibility principle
Singleton pattern
Singly rooted hierarchy
Slicing
Specification class, a class implementing abstract class
Stack-based memory allocation
Static method
Statically typed language, as opposed to Dynamically typed language
Strongly-typed programming language
Subclass (also called child class or derived class)
Subclass coupl |
https://en.wikipedia.org/wiki/Banrisul | Banrisul is a Brazilian bank. It is the largest bank of Southern Brazil and operates primarily in the state of Rio Grande do Sul (RS), with a network that serves more than 365 cities. The services, however, are extended to other localities of Brazil. It has more than 1,312 service points, over 500 agencies and 593 ATMs in Rio Grande do Sul, in the Federal District and in the states of Paraná, Rio de Janeiro, Santa Catarina and São Paulo; besides, it keeps agencies in Miami and Grand Cayman.
History
In 1927, with the accomplishment of 1º Congress of Creators, appeared the proposal of the creation of a farm loan bank. The event, carried through with all the pomp and circumstance in the "Sao Pedro Theater", in Porto Alegre, aimed at to analyze the problems of the state economy, with direct focus on the crisis faced for "charqueadas" and all the production related to the cattle one.
The arguments were strong excessively to pass unobserved for the federal government, and president Washington Luís lowered decree, authorizing the state to create a credit bank. To 10h of day 12 of September 1928, in solemnity that counted on the presence of then the president of the State, Getúlio Vargas, was created the Bank of the Rio Grande do Sul.
With an initial capital of 50 a thousand réis, the main objective of the new institution was to take care of the necessities of credit of the cattle gaucho. As official bank, the state taxation started to soon collect of beginning all, until then received for the "Banco Pelotense" (Pelotense Bank, in English), that later was incorporated by the Banrisul.
In 1969 and 1970, the institution incorporated, respectively, Banco Real de Pernambuco s.a. and the "Banco Sul do Brasil s.a." (South Bank of Brazil s.a., in English), extending its net until Pernambuco and Ceará, besides extending the number of existing agencies already in Santa Catarina, São Paulo and Rio de Janeiro. The opening of an agency in New York, in 1982, inserted the Banrisul in the group of international operators.
The decade of 1980s marked the beginning of the automation in the services of the bank. The massive investments effected since March 1991 had placed the institution in the vanguard of the banking automation in the State.
In March 1990, the Banrisul got authorization of the Brazilian Central Bank to operate as Commercial bank, with accounts receivables, of mortgage loans and credit, financing and investment.
In 1998, the Banrisul incorporated the agencies of the old "Caixa Econômica" (State Public, in English) saving bank, consolidating its position of bigger net of distribution of the south of the country, besides becoming a retail bank. The actions directed in credit facilities of long stated period had passed to be operated, in 2002, for "Caixa Estadual S.A." - Agency of Promotion.
Advertising
Grêmio and Internacional, the two most important soccer teams of Rio Grande do Sul, have been sponsored by Banrisul since 2001. Banrisul also s |
https://en.wikipedia.org/wiki/DCO | DCO may refer to: Diploma in Community Ophthalmology
Astronomy
Dark compact object, a dark compact star
Technology
Device configuration overlay, of a computer hard disk drive
Digitally controlled oscillator, in electronics
Siemens DCO, a telephone switch
Drift City Online, a game
Domain controller, on Microsoft Servers
Developer Certificate of Origin, used in open source software projects to verify individual contributions
Other
Deep Carbon Observatory
Development Consent Order, the means of obtaining permission for nationally significant projects in England and Wales
Dimension Century Orguss, anime series
Direct commission officer, a military rank
Disney Channel Original (disambiguation)
District coordination officer, a civil service position in Pakistan
The British Columbia Regiment (Duke of Connaught's Own), a regiment of the Canadian Forces
Duke of Cambridge's Own, aka Middlesex Regiment
Dynamic Creative Optimization, a term used in programmatic marketing
D.Co., an abbreviation used for the United States District Court for the District of Colorado
Docket Control Order, a legal document used to confirm court deadlines.
Document Control Officer controls access to documents that are restricted to certain people |
https://en.wikipedia.org/wiki/Reification%20%28computer%20science%29 | Reification is the process by which an abstract idea about a computer program is turned into an explicit data model or other object created in a programming language. A computable/addressable object—a resource—is created in a system as a proxy for a non computable/addressable object. By means of reification, something that was previously implicit, unexpressed, and possibly inexpressible is explicitly formulated and made available to conceptual (logical or computational) manipulation. Informally, reification is often referred to as "making something a first-class citizen" within the scope of a particular system. Some aspect of a system can be reified at language design time, which is related to reflection in programming languages. It can be applied as a stepwise refinement at system design time. Reification is one of the most frequently used techniques of conceptual analysis and knowledge representation.
Reflective programming languages
In the context of programming languages, reification is the process by which a user program or any aspect of a programming language that was implicit in the translated program and the run-time system, are expressed in the language itself. This process makes it available to the program, which can inspect all these aspects as ordinary data. In reflective languages, reification data is causally connected to the related reified aspect such that a modification to one of them affects the other. Therefore, the reification data is always a faithful representation of the related reified aspect . Reification data is often said to be made a first class object. Reification, at least partially, has been experienced in many languages to date: in early Lisp dialects and in current Prolog dialects, programs have been treated as data, although the causal connection has often been left to the responsibility of the programmer. In Smalltalk-80, the compiler from the source text to bytecode has been part of the run-time system since the very first implementations of the language.
The C programming language reifies the low-level detail of memory addresses.Many programming language designs encapsulate the details of memory allocation in the compiler and the run-time system. In the design of the C programming language, the memory address is reified and is available for direct manipulation by other language constructs. For example, the following code may be used when implementing a memory-mapped device driver. The buffer pointer is a proxy for the memory address 0xB8000000. char* buffer = (char*) 0xB8000000;
buffer[0] = 10;
Functional programming languages based on lambda-calculus reify the concept of a procedure abstraction and procedure application in the form of the Lambda expression.
The Scheme programming language reifies continuations (approximately, the call stack).
In C#, reification is used to make parametric polymorphism implemented in the form of generics as a first-class feature of the language.
In the Java programm |
https://en.wikipedia.org/wiki/Container%20%28disambiguation%29 | A container is any receptacle or enclosure for holding a product used in storage, packaging, and shipping.
Container may also refer to:
Computing
Container (abstract data type), a class or data structure that is a collection of other objects
Container (type theory), abstractions that represent collection types in a uniform way
Container (virtualization), a server virtualization method
Container format (computing), for storing related data together, such as audio and video data
Other uses
Container (board game), a 2007 economic-simulation game
Container (film), a 2006 Swedish film by Lukas Moodysson
Container (flowers), plants grown exclusively in containers
"Container" (song), by Fiona Apple
Container radar, a Russian over-the-horizon radar system
Shipping container, for shipping
Intermodal container, a large standardized shipping container
See also
Container Bob, nickname for the man found in a shipping container in 2001
Enclosure (disambiguation)
Receptacle (disambiguation) |
https://en.wikipedia.org/wiki/ODP | ODP may refer to:
Computing
Observer Design Pattern, a software design pattern
On Device Portal, a mobile application as service portal or content portal
Open Directory Project, a Web directory; later renamed to DMOZ
OpenDocument Presentation, a standard mobile electronic office documents file format with file extension
OpenDataPlane, a set of application programming interfaces for the networking data plane
Political parties
Ökologisch-Demokratische Partei (Ecological Democratic Party), a German political party
Özgürlük ve Dayanışma Partisi (Freedom and Solidarity Party), a Turkish political party
Oromo Democratic Party, a political party in Ethiopia
Companies
Office Depot, retail chain of office-supply stores in the United States; stock symbol (ODP)
Opening Day Partners, company that owns and operates various professional baseball teams in the United States
Other
Obstacle departure procedures, IFR standard instrument departure procedures in aviation for obstacle clearance
Ocean Drilling Program, an international research project
Omega Delta Phi, multicultural fraternity founded in the United States in 1987
Operating department practitioner, a person who plans and coordinates perioperative care in a department of a hospital in the United Kingdom
Orderly Departure Program, a program to resettle Vietnamese refugees in the United States
Ozone depletion potential in chemistry and pollution
Olfactory detection port, any part analytical device that uses olfaction as a part of its analysis.
See also
ÖDP (disambiguation)
RM-ODP, reference model of open distributed processing |
https://en.wikipedia.org/wiki/South%20Park%3A%20Bigger%2C%20Longer%20%26%20Uncut | South Park: Bigger, Longer & Uncut is a 1999 American adult computer-animated musical comedy film based on the animated sitcom South Park. The film was directed by series creator Trey Parker from a screenplay co-written with series co-creator Matt Stone and Pam Brady; and stars Parker, Stone, Mary Kay Bergman, and Isaac Hayes, all of whom reprise their roles from the series, with George Clooney, Eric Idle, and Mike Judge in supporting roles. The plot follows Stan, Kyle, Cartman, and Kenny as they sneak into an R-rated film starring the Canadian comedy duo Terrance and Phillip, after which they begin swearing. When the consequent moral panic culminates in the United States declaring war on Canada, Stan, Kyle and Cartman take it upon themselves to save Terrance and Phillip from execution, while Kenny tries to prevent a prophecy involving Satan and Saddam Hussein's intent to conquer the world.
Primarily centered on themes of censorship and scapegoating, the film also parodies and satirizes the animated films of the Disney Renaissance, musicals such as Les Misérables, and controversies surrounding the series itself. The film also heavily satirizes the Motion Picture Association of America; during production, Parker and Stone disputed with the MPAA, which returned the film multiple times with an NC-17 rating due to its use of profanity. The film's songs were written by Parker and Marc Shaiman, the latter of whom composed the score.
South Park: Bigger, Longer & Uncut premiered at Grauman's Chinese Theater on June 23, 1999, and was released theatrically in the US and Canada the following week by Paramount Pictures, with Warner Bros. handling international distribution. The film received generally positive reviews from critics, who praised its story, soundtrack, humor and themes. Produced on a $21 million budget, it grossed $83.1 million worldwide, making it the highest-grossing R-rated animated film until 2016. At the 72nd Academy Awards, the song "Blame Canada" was nominated for Best Original Song, but lost to Phil Collins' "You'll Be in My Heart" from Tarzan.
Plot
One morning in South Park, Colorado, Stan Marsh, Kyle Broflovski and his adopted brother Ike, Eric Cartman, and Kenny McCormick visit the movie theater to see Terrance and Phillip's R-rated film, Asses of Fire. After initially being denied tickets, the boys pay a homeless man to accompany them. After watching the film, the boys begin swearing constantly. Their friends are impressed and also see the film, except for Wendy Testaburger, who becomes acquainted with transfer student Gregory, to Stan's jealousy.
When the children's parents find out, they are forbidden from seeing the film again, but do so multiple times. As a bet with Cartman, Kenny sets his fart on fire, imitating a scene from the film; he accidentally immolates himself and is rushed to the hospital, where he dies from a botched heart transplant. Barred from Heaven, Kenny descends into Hell, wherein he encounters Satan and hi |
https://en.wikipedia.org/wiki/Method%20%28computer%20programming%29 | A method in object-oriented programming (OOP) is a procedure associated with an object, and generally also a message. An object consists of state data and behavior; these compose an interface, which specifies how the object may be used. A method is a behavior of an object parametrized by a user.
Data is represented as properties of the object, and behaviors are represented as methods. For example, a Window object could have methods such as open and close, while its state (whether it is open or closed at any given point in time) would be a property.
In class-based programming, methods are defined within a class, and objects are instances of a given class. One of the most important capabilities that a method provides is method overriding - the same name (e.g., area) can be used for multiple different kinds of classes. This allows the sending objects to invoke behaviors and to delegate the implementation of those behaviors to the receiving object. A method in Java programming sets the behavior of a class object. For example, an object can send an area message to another object and the appropriate formula is invoked whether the receiving object is a rectangle, circle, triangle, etc.
Methods also provide the interface that other classes use to access and modify the properties of an object; this is known as encapsulation. Encapsulation and overriding are the two primary distinguishing features between methods and procedure calls.
Overriding and overloading
Method overriding and overloading are two of the most significant ways that a method differs from a conventional procedure or function call. Overriding refers to a subclass redefining the implementation of a method of its superclass. For example, findArea may be a method defined on a shape class, triangle, etc. would each define the appropriate formula to calculate their area. The idea is to look at objects as "black boxes" so that changes to the internals of the object can be made with minimal impact on the other objects that use it. This is known as encapsulation and is meant to make code easier to maintain and re-use.
Method overloading, on the other hand, refers to differentiating the code used to handle a message based on the parameters of the method. If one views the receiving object as the first parameter in any method then overriding is just a special case of overloading where the selection is based only on the first argument. The following simple Java example illustrates the difference:
Accessor, mutator and manager methods
Accessor methods are used to read the data values of an object. Mutator methods are used to modify the data of an object. Manager methods are used to initialize and destroy objects of a class, e.g. constructors and destructors.
These methods provide an abstraction layer that facilitates encapsulation and modularity. For example, if a bank-account class provides a getBalance() accessor method to retrieve the current balance (rather than directly accessing the balanc |
https://en.wikipedia.org/wiki/Optimistic%20concurrency%20control | Optimistic concurrency control (OCC), also known as optimistic locking, is a concurrency control method applied to transactional systems such as relational database management systems and software transactional memory. OCC assumes that multiple transactions can frequently complete without interfering with each other. While running, transactions use data resources without acquiring locks on those resources. Before committing, each transaction verifies that no other transaction has modified the data it has read. If the check reveals conflicting modifications, the committing transaction rolls back and can be restarted. Optimistic concurrency control was first proposed in 1979 by H. T. Kung and John T. Robinson.
OCC is generally used in environments with low data contention. When conflicts are rare, transactions can complete without the expense of managing locks and without having transactions wait for other transactions' locks to clear, leading to higher throughput than other concurrency control methods. However, if contention for data resources is frequent, the cost of repeatedly restarting transactions hurts performance significantly, in which case other concurrency control methods may be better suited. However, locking-based ("pessimistic") methods also can deliver poor performance because locking can drastically limit effective concurrency even when deadlocks are avoided.
Phases of optimistic concurrency control
Optimistic concurrency control transactions involve these phases:
Begin: Record a timestamp marking the transaction's beginning.
Modify: Read database values, and tentatively write changes.
Validate: Check whether other transactions have modified data that this transaction has used (read or written). This includes transactions that completed after this transaction's start time, and optionally, transactions that are still active at validation time.
Commit/Rollback: If there is no conflict, make all changes take effect. If there is a conflict, resolve it, typically by aborting the transaction, although other resolution schemes are possible. Care must be taken to avoid a time-of-check to time-of-use bug, particularly if this phase and the previous one are not performed as a single atomic operation.
Web usage
The stateless nature of HTTP makes locking infeasible for web user interfaces. It is common for a user to start editing a record, then leave without following a "cancel" or "logout" link. If locking is used, other users who attempt to edit the same record must wait until the first user's lock times out.
HTTP does provide a form of built-in OCC. The response to an initial GET request can include an ETag for subsequent PUT requests to use in the If-Match header. Any PUT requests with an out-of-date ETag in the If-Match header can then be rejected.
Some database management systems offer OCC natively, without requiring special application code. For others, the application can implement an OCC layer outside of the database, and avoid |
https://en.wikipedia.org/wiki/Zip | Zip, Zips or ZIP may refer to:
Common uses
ZIP Code, USPS postal code
Zipper or zip, clothing fastener
Science and technology
Computing
ZIP (file format), a compressed archive file format
zip, a command-line program from Info-ZIP
Zipping (computer science), or zip, reorganizing lists of lists
Zip drive, a removable disk storage system
Zone Information Protocol, AppleTalk protocol
Zip Chip, Apple II accelerators by Zip Technologies
.zip, an Internet top-level domain operated by Google
Other science and technology
Zip tone, in telephony
Zig-zag in-line package, electronic packaging
Zip fuel, a type of jet fuel
Zip tie, a cable fastener
Zrt- and Irt-like proteins, or Zips, zinc transporters
Arts, entertainment and media
Zip (game), a children's game
Zip (roller coaster), at Oaks Amusement Park, Oregon, US
Zip, a band formed by Pete Shelley
Zip Comics, 1940-1944
ZIP FM, a radio station, Vilnius, Lithuania
ZIP Magazine, UK
Zip, a character in the Tomb Raider video games
Zip, a vertical line in Barnett Newman's paintings
Film and television
Zip (TUGS), a character in the British children's television series TUGS
title character of Zip, the Dodger, a 1914 film starring Fatty Arbuckle
ZIP, a fictional amnestic drug in the Blindspot TV series
Brands, enterprises and products
Zip (airline), a former Canadian airline
Mr. ZIP, a promotional character
Piaggio Zip, a scooter
Zip Co, an Australian fintech company
Zip Industries, an Australian manufacturer of hot water dispensers
Zip's Drive-in, an American restaurant chain
Zip.ca, a Canadian DVD rental service
Zip card, for travel in London, UK
Zip Fires, firelighters
Places
Žíp, a village in Slovakia
Spiš or Zips, Slovakia
Zip City, Alabama, US
People
Zip Collins (1892–1983), American baseball player
John Connolly (FBI) (born 1940), nicknamed "Zip"
Zip Hanna (1916–2001), American football player
Zip Zabel (1891–1970), American baseball player
Bohdan Zip (1929–2017), Canadian politician
Zip the Pinhead, American freak show performer William Henry Johnson (c. 1857–1926)
a ring name of Tom Prichard (born 1959), American retired professional wrestler
Other uses
Zip, slang for zero
Zips, a derogatory term used by Italian-American mobsters for newer immigrant Sicilian and Italian mafiosi
Akron Zips, the University of Akron athletic teams
Zip Feed Tower, a former grain elevator in Sioux Falls, South Dakota, US
See also
Zip gun (disambiguation)
"Zip, Zip, Zip", an episode of the TV series How I Met Your Mother
Zipp (disambiguation)
Zipper (disambiguation)
Zippy (disambiguation)
Nicknames |
https://en.wikipedia.org/wiki/Rate-monotonic%20scheduling | In computer science, rate-monotonic scheduling (RMS) is a priority assignment algorithm used in real-time operating systems (RTOS) with a static-priority scheduling class. The static priorities are assigned according to the cycle duration of the job, so a shorter cycle duration results in a higher job priority.
These operating systems are generally preemptive and have deterministic guarantees with regard to response times. Rate monotonic analysis is used in conjunction with those systems to provide scheduling guarantees for a particular application.
Introduction
A simple version of rate-monotonic analysis assumes that threads have the following properties:
No resource sharing (processes do not share resources, e.g. a hardware resource, a queue, or any kind of semaphore blocking or non-blocking (busy-waits))
Deterministic deadlines are exactly equal to periods
Static priorities (the task with the highest static priority that is runnable immediately preempts all other tasks)
Static priorities assigned according to the rate monotonic conventions (tasks with shorter periods/deadlines are given higher priorities)
Context switch times and other thread operations are free and have no impact on the model
It is a mathematical model that contains a calculated simulation of periods in a closed system, where round-robin and time-sharing schedulers fail to meet the scheduling needs otherwise. Rate monotonic scheduling looks at a run modeling of all threads in the system and determines how much time is needed to meet the guarantees for the set of threads in question.
Optimality
The rate-monotonic priority assignment is optimal under the given assumptions, meaning that if any static-priority scheduling algorithm can meet all the deadlines, then the rate-monotonic algorithm can too. The deadline-monotonic scheduling algorithm is also optimal with equal periods and deadlines, in fact in this case the algorithms are identical; in addition, deadline monotonic scheduling is optimal when deadlines are less than periods. For the task model in which deadlines can be greater than periods, Audsley's algorithm endowed with an exact schedulability test for this model finds an optimal priority assignment.
Upper bounds on utilization
Least upper bound
proved that for a set of periodic tasks with unique periods, a feasible schedule that will always meet deadlines exists if the CPU utilization is below a specific bound (depending on the number of tasks). The schedulability test for RMS is:
where is the utilization factor, is the computation time for process , is the release period (with deadline one period later) for process , and is the number of processes to be scheduled. For example, for two processes. When the number of processes tends towards infinity, this expression will tend towards:
Therefore, a rough estimate when is that RMS can meet all of the deadlines if total CPU utilization, , is less than 70%. The other 30% of the CPU can be dedicated to low |
https://en.wikipedia.org/wiki/Round-robin%20scheduling | Round-robin (RR) is one of the algorithms employed by process and network schedulers in computing.
As the term is generally used, time slices (also known as time quanta) are assigned to each process in equal portions and in circular order, handling all processes without priority (also known as cyclic executive). Round-robin scheduling is simple, easy to implement, and starvation-free. Round-robin scheduling can be applied to other scheduling problems, such as data packet scheduling in computer networks. It is an operating system concept.
The name of the algorithm comes from the round-robin principle known from other fields, where each person takes an equal share of something in turn.
Process scheduling
To schedule processes fairly, a round-robin scheduler generally employs time-sharing, giving each job a time slot or quantum (its allowance of CPU time), and interrupting the job if it is not completed by then. The job is resumed next time a time slot is assigned to that process. If the process terminates or changes its state to waiting during its attributed time quantum, the scheduler selects the first process in the ready queue to execute. In the absence of time-sharing, or if the quanta were large relative to the sizes of the jobs, a process that produced large jobs would be favored over other processes.
Round-robin algorithm is a pre-emptive algorithm as the scheduler forces the process out of the CPU once the time quota expires.
For example, if the time slot is 100 milliseconds, and job1 takes a total time of 250 ms to complete, the round-robin scheduler will suspend the job after 100 ms and give other jobs their time on the CPU. Once the other jobs have had their equal share (100 ms each), job1 will get another allocation of CPU time and the cycle will repeat. This process continues until the job finishes and needs no more time on the CPU.
Job1 = Total time to complete 250 ms (quantum 100 ms).
First allocation = 100 ms.
Second allocation = 100 ms.
Third allocation = 100 ms but job1 self-terminates after 50 ms.
Total CPU time of job1 = 250 ms
Consider the following table with the arrival time and execute time of the process with the quantum time of 100 ms to understand the round-robin scheduling:
Another approach is to divide all processes into an equal number of timing quanta such that the quantum size is proportional to the size of the process. Hence, all processes end at the same time.
Network packet scheduling
In best-effort packet switching and other statistical multiplexing, round-robin scheduling can be used as an alternative to first-come first-served queuing.
A multiplexer, switch, or router that provides round-robin scheduling has a separate queue for every data flow, where a data flow may be identified by its source and destination address. The algorithm allows every active data flow that has data packets in the queue to take turns in transferring packets on a shared channel in a periodically repeated order. The sc |
https://en.wikipedia.org/wiki/SableCC | SableCC is an open-source compiler generator (or interpreter generator) in Java. Stable version is licensed under the GNU Lesser General Public License (LGPL). Rewritten version 4 is licensed under Apache License 2.0.
SableCC includes the following features:
Deterministic finite automaton (DFA)-based lexers with full Unicode support and lexical states.
Extended Backus–Naur form grammar syntax. (Supports the *, ? and + operators).
LALR(1) based parsers.
Automatic generation of strictly-typed abstract syntax trees.
Automatic generation of tree-walker classes.
See also
ANTLR
JavaCC
Coco/R
References
External links
SableCC website
Parser generators
Java development tools |
https://en.wikipedia.org/wiki/Episode%20I | Episode I, Episode 1 or Episode One may refer to:
Star Wars: Episode I – The Phantom Menace, a 1999 film
Half-Life 2: Episode One, a 2006 computer game sequel
"Episode 1" (Ashes to Ashes), (2008), the first episode of the TV series Ashes to Ashes
"Episode 1" (The Casual Vacancy), (2015), the first episode of the TV miniseries The Casual Vacancy
"Episode 1" (Humans series 1), the first episode of the TV series Humans
Episode 1 (company), a UK investment company
Episode 1 (EP), an extended play by Broiler
"Episode One" (Dark Matter), the first episode of Dark Matter
"Episode 1.1" (Secret Diary of a Call Girl), the premiere episode of Secret Diary of a Call Girl
See also
List of television episodes named "Pilot", often the title of the first episode of a given television series. |
https://en.wikipedia.org/wiki/Borwein%27s%20algorithm | In mathematics, Borwein's algorithm is an algorithm devised by Jonathan and Peter Borwein to calculate the value of . They devised several other algorithms. They published the book Pi and the AGM – A Study in Analytic Number Theory and Computational Complexity.
Ramanujan–Sato series
These two are examples of a Ramanujan–Sato series. The related Chudnovsky algorithm uses a discriminant with class number 1.
Class number 2 (1989)
Start by setting
Then
Each additional term of the partial sum yields approximately 25 digits.
Class number 4 (1993)
Start by setting
Then
Each additional term of the series yields approximately 50 digits.
Iterative algorithms
Quadratic convergence (1984)
Start by setting
Then iterate
Then pk converges quadratically to ; that is, each iteration approximately doubles the number of correct digits. The algorithm is not self-correcting; each iteration must be performed with the desired number of correct digits for 's final result.
Cubic convergence (1991)
Start by setting
Then iterate
Then ak converges cubically to ; that is, each iteration approximately triples the number of correct digits.
Quartic convergence (1985)
Start by setting
Then iterate
Then ak converges quartically against ; that is, each iteration approximately quadruples the number of correct digits. The algorithm is not self-correcting; each iteration must be performed with the desired number of correct digits for 's final result.
One iteration of this algorithm is equivalent to two iterations of the Gauss–Legendre algorithm.
A proof of these algorithms can be found here:
Quintic convergence
Start by setting
where is the golden ratio. Then iterate
Then ak converges quintically to (that is, each iteration approximately quintuples the number of correct digits), and the following condition holds:
Nonic convergence
Start by setting
Then iterate
Then ak converges nonically to ; that is, each iteration approximately multiplies the number of correct digits by nine.
See also
Bailey–Borwein–Plouffe formula
Chudnovsky algorithm
Gauss–Legendre algorithm
Ramanujan–Sato series
References
External links
Pi Formulas from Wolfram MathWorld
Pi algorithms |
https://en.wikipedia.org/wiki/ISWIM | ISWIM (acronym for If you See What I Mean) is an abstract computer programming language (or a family of languages) devised by Peter Landin and first described in his article "The Next 700 Programming Languages", published in the Communications of the ACM in 1966.
Although not implemented, it has proved very influential in the development of programming languages, especially functional programming languages such as SASL, Miranda, ML, Haskell and their successors, and dataflow programming languages like Lucid.
Design
ISWIM is an imperative programming language with a functional core, consisting of a syntactic sugaring of lambda calculus to which are added mutable variables and assignment and a powerful control mechanism: the program point operator. Being based on lambda calculus, ISWIM has higher-order functions and lexically scoped variables.
The operational semantics of ISWIM are defined using Landin's SECD machine and use call-by-value, that is eager evaluation. A goal of ISWIM was to look more like mathematical notation, so Landin abandoned ALGOL's semicolons between statements and begin ... end blocks and replaced them with the off-side rule and scoping based on indentation.
A notationally distinctive feature of ISWIM is its use of where clauses. An ISWIM program is a single expression qualified by where clauses (auxiliary definitions including equations among variables), conditional expressions and function definitions. Along with CPL, ISWIM was one of the first programming languages to use where clauses.
A notable semantic feature was the ability to define new data types, as a (possibly recursive) sum of products. This was done using a somewhat verbose natural language style description, but apart from notation amounts exactly to the algebraic data types found in modern functional languages. ISWIM variables did not have explicit type declarations and it seems likely (although not explicitly stated in the 1966 paper) that Landin intended the language to be dynamically typed, like LISP and unlike ALGOL; but it is also possible that he intended to develop some form of type inference.
Implementations and derivatives
No direct implementation of ISWIM was attempted but Art Evan's language PAL, and John C. Reynolds' language Gedanken, captured most of Landin's concepts, including powerful transfer-of-control operations. Both of these were typed dynamically. Robin Milner's ML may be considered equivalent to ISWIM without the J operator and with type inference.
Another line of descent from ISWIM is to strip out the imperative features (assignment and the J operator) leaving a purely functional language. It then becomes possible to switch to lazy evaluation. This path led to programming languages SASL, Kent Recursive Calculator (KRC), Hope, Miranda, Haskell, and Clean.
References
Programming languages created in 1966
Academic programming languages
Experimental programming languages
Functional languages
History of computing in the United Ki |
https://en.wikipedia.org/wiki/Machine%20learning | Machine learning (ML) is a field of study in artificial intelligence concerned with the development and study of statistical algorithms that can effectively generalize and thus perform tasks without explicit instructions. Recently, generative artificial neural networks have been able to surpass many previous approaches in performance. Machine learning approaches have been applied to large language models, computer vision, speech recognition, email filtering, agriculture and medicine, where it is too costly to develop algorithms to perform the needed tasks.
The mathematical foundations of ML are provided by mathematical optimization (mathematical programming) methods. Data mining is a related (parallel) field of study, focusing on exploratory data analysis through unsupervised learning.
ML is known in its application across business problems under the name predictive analytics. Although not all machine learning is statistically based, computational statistics is an important source of the field's methods.
History and relationships to other fields
The term machine learning was coined in 1959 by Arthur Samuel, an IBM employee and pioneer in the field of computer gaming and artificial intelligence. The synonym self-teaching computers was also used in this time period.
By the early 1960s an experimental "learning machine" with punched tape memory, called Cybertron, had been developed by Raytheon Company to analyze sonar signals, electrocardiograms, and speech patterns using rudimentary reinforcement learning. It was repetitively "trained" by a human operator/teacher to recognize patterns and equipped with a "goof" button to cause it to re-evaluate incorrect decisions. A representative book on research into machine learning during the 1960s was Nilsson's book on Learning Machines, dealing mostly with machine learning for pattern classification. Interest related to pattern recognition continued into the 1970s, as described by Duda and Hart in 1973. In 1981 a report was given on using teaching strategies so that a neural network learns to recognize 40 characters (26 letters, 10 digits, and 4 special symbols) from a computer terminal.
Tom M. Mitchell provided a widely quoted, more formal definition of the algorithms studied in the machine learning field: "A computer program is said to learn from experience E with respect to some class of tasks T and performance measure P if its performance at tasks in T, as measured by P, improves with experience E." This definition of the tasks in which machine learning is concerned offers a fundamentally operational definition rather than defining the field in cognitive terms. This follows Alan Turing's proposal in his paper "Computing Machinery and Intelligence", in which the question "Can machines think?" is replaced with the question "Can machines do what we (as thinking entities) can do?".
Modern-day machine learning has two objectives, one is to classify data based on models which have been developed, the |
https://en.wikipedia.org/wiki/Unsupervised%20learning | Unsupervised learning is a paradigm in machine learning where, in contrast to supervised learning and semi-supervised learning, algorithms learn patterns exclusively from unlabeled data.
Neural networks
Tasks vs. methods
Neural network tasks are often categorized as discriminative (recognition) or generative (imagination). Often but not always, discriminative tasks use supervised methods and generative tasks use unsupervised (see Venn diagram); however, the separation is very hazy. For example, object recognition favors supervised learning but unsupervised learning can also cluster objects into groups. Furthermore, as progress marches onward some tasks employ both methods, and some tasks swing from one to another. For example, image recognition started off as heavily supervised, but became hybrid by employing unsupervised pre-training, and then moved towards supervision again with the advent of dropout, ReLU, and adaptive learning rates.
Training
During the learning phase, an unsupervised network tries to mimic the data it's given and uses the error in its mimicked output to correct itself (i.e. correct its weights and biases). Sometimes the error is expressed as a low probability that the erroneous output occurs, or it might be expressed as an unstable high energy state in the network.
In contrast to supervised methods' dominant use of backpropagation, unsupervised learning also employs other methods including: Hopfield learning rule, Boltzmann learning rule, Contrastive Divergence, Wake Sleep, Variational Inference, Maximum Likelihood, Maximum A Posteriori, Gibbs Sampling, and backpropagating reconstruction errors or hidden state reparameterizations. See the table below for more details.
Energy
An energy function is a macroscopic measure of a network's activation state. In Boltzmann machines, it plays the role of the Cost function. This analogy with physics is inspired by Ludwig Boltzmann's analysis of a gas' macroscopic energy from the microscopic probabilities of particle motion , where k is the Boltzmann constant and T is temperature. In the RBM network the relation is , where and vary over every possible activation pattern and . To be more precise, , where is an activation pattern of all neurons (visible and hidden). Hence, early neural networks bear the name Boltzmann Machine. Paul Smolensky calls the Harmony. A network seeks low energy which is high Harmony.
Networks
This table shows connection diagrams of various unsupervised networks, the details of which will be given in the section Comparison of Networks. Circles are neurons and edges between them are connection weights. As network design changes, features are added on to enable new capabilities or removed to make learning faster. For instance, neurons change between deterministic (Hopfield) and stochastic (Boltzmann) to allow robust output, weights are removed within a layer (RBM) to hasten learning, or connections are allowed to become asymmetric (Helmholt |
https://en.wikipedia.org/wiki/Data%20codes%20for%20Switzerland | These are data codes for Switzerland.
Country
These are codes for the country itself. See country code for a fuller explanation.
CH ISO country code (ISO 3166-1 alpha-2, two letter)
Internet Country code top-level domain (ccTLD) (see .ch)
Distinguishing sign of vehicles in international traffic
International Union of Railways alphabetical UIC Country Code
WIPO ST.3
CHE ISO country code (ISO 3166-1 alpha-3, three letter code)
EO39 Nomenclature of Territorial Units for Statistics (NUTS)
HB ICAO aircraft registration prefix (since 1935, before: CH)
HBA-HBZ,HEA-HEZ ITU callsign prefix
LS ICAO airport code or nationality letters for location indicator (see also: List of airport codes: LS)
SUI IOC country code
FIFA country code
ITU letter codes for member-countries
SW WMO message header country code
SZ FIPS country code
Library of Congress machine-readable cataloguing country code
41 Country calling code
85 International Union of Railways numeric UIC Country Code
228 E.212 Mobile country code
269 ITU maritime identification digits
756 ISO country code (ISO 3166-1 numeric, numeric code)
760-769 GS1 prefix of GTIN (barcodes) by GS1 Switzerland
ШВА Cyrillic three-letter country codes per GOST 7.67 or ISO 3166-88 standard
NUTS-2 regions
As a member of the EFTA, Switzerland is included in the Nomenclature of Territorial Units for Statistics (NUTS). The three NUTS levels are:
NUTS-1: Switzerland (CH0)
NUTS-2: 7 Regions
NUTS-3: 26 Cantons
The seven NUTS-2 regions are the following:
Below the NUTS levels, there are two LAU levels (LAU-1: districts; LAU-2: municipalities).
Cantons
The two-letter abbreviations are widely used, e.g. on car license plates and as disambiguator for localities on postal addresses if two localities in different cantons have the same name. They are also used with the prefix "CH-" as ISO 3166-2 codes of Switzerland, e.g. CH-SZ for the canton of Schwyz.
SFSO also uses a numerical code ordering the cantons by their constitutional order (1 to 26).
The FIPS 10-4 region codes of Switzerland were used by the United States government. This standard was withdrawn in 2008.
The NUTS-3 codes are used by the European Union.
Districts
Districts are assigned three-digit numerical codes by SFSO.
Districts are used as LAU-1 level.
Municipalities
See Community Identification Number#Switzerland
Municipalities are used as LAU-2 level.
Localities
See Postal codes in Switzerland and Liechtenstein
Airports
See
List of airports by ICAO code: L#LS – Switzerland and Liechtenstein
List of airports in Switzerland
See also
Switzerland-related lists |
https://en.wikipedia.org/wiki/Power%20Macintosh%20G3 | The Power Macintosh G3 (also sold with additional software as the Macintosh Server G3) is a series of personal computers designed, manufactured, and sold by Apple Computer from November 1997 to August 1999. It represented Apple's first step towards eliminating redundancy and complexity in the product line by replacing eight Power Macintosh models (and the Twentieth Anniversary Macintosh) with three: Desktop and Mini Tower models for professional and home use, and an All-In-One model for education. The introduction of the Desktop and Mini Tower models coincided with Apple starting to sell build-to-order Macs directly from its web site in an online store, which was unusual for the time as Dell was the only major computer manufacturer doing this. Apple's move to build-to-order sales of the Power Macintosh G3 also coincided with the acquisition of Power Computing Corporation, which had been providing telephone sales of Macintosh clones for more than two years.
The Power Macintosh G3 is named for its third-generation PowerPC chip, and introduced a super fast and large Level 2 backside CPU cache, running at half processor speed. As a result, these machines benchmarked significantly faster than Intel PCs of similar CPU clock speed at launch, which prompted Apple to create the "Snail" and "Toasted Bunnies" television commercials. Magazine benchmarks showed the G3/266 CPU outperforming the 350 MHz PowerPC 604ev chip in the Power Macintosh 9600 as well.
Two generations of the Power Macintosh G3 were released. The first generation, known colloquially as "Beige" was introduced at a special event on November 10, 1997. The second generation, known officially as "Blue and White", was introduced at MacWorld San Francisco on January 5, 1999. Its replacement, the Power Mac G4, was introduced in August of the same year.
Models
Beige
Apple sold three beige Power Macintosh G3 models: a horizontally-oriented desktop, a mini tower enclosure, and a version with a built-in screen called All-In-One ("AIO"). The All-In-One model was shaped like a human tooth, and thus earned the moniker Molar Mac. Equipped with a 233, 266, 300, or 333 MHz PowerPC 750 (G3) CPU from Motorola, these machines use a 66.83 MHz system bus and PC66 SDRAM, and standard ATA hard disk drives instead of the SCSI drives used in most previous Apple systems. A Fast SCSI internal bus is still included with 10 MB/s speed, along with the proprietary out-of-spec DB-25 external SCSI bus which had a top speed of 5 MB/s. Each bus could support a maximum of 7 devices.
Apple also developed a prototype G3-based six-slot full tower to be designated the Power Macintosh 9700. Despite demand from high-end users for more PCI slots in a G3-powered computer, Apple decided not to develop the prototype (dubbed "Power Express") into a shipping product, leaving the 9600 as the last six-slot Mac Apple would make for over two decades, until the 2019 Mac Pro which has eight.
Initial units were shipped with Mac OS 8. The |
https://en.wikipedia.org/wiki/Numerical%20stability | In the mathematical subfield of numerical analysis, numerical stability is a generally desirable property of numerical algorithms. The precise definition of stability depends on the context. One is numerical linear algebra and the other is algorithms for solving ordinary and partial differential equations by discrete approximation.
In numerical linear algebra, the principal concern is instabilities caused by proximity to singularities of various kinds, such as very small or nearly colliding eigenvalues. On the other hand, in numerical algorithms for differential equations the concern is the growth of round-off errors and/or small fluctuations in initial data which might cause a large deviation of final answer from the exact solution.
Some numerical algorithms may damp out the small fluctuations (errors) in the input data; others might magnify such errors. Calculations that can be proven not to magnify approximation errors are called numerically stable. One of the common tasks of numerical analysis is to try to select algorithms which are robust – that is to say, do not produce a wildly different result for very small change in the input data.
An opposite phenomenon is instability. Typically, an algorithm involves an approximative method, and in some cases one could prove that the algorithm would approach the right solution in some limit (when using actual real numbers, not floating point numbers). Even in this case, there is no guarantee that it would converge to the correct solution, because the floating-point round-off or truncation errors can be magnified, instead of damped, causing the deviation from the exact solution to grow exponentially.
Stability in numerical linear algebra
There are different ways to formalize the concept of stability. The following definitions of forward, backward, and mixed stability are often used in numerical linear algebra.
Consider the problem to be solved by the numerical algorithm as a function mapping the data to the solution . The result of the algorithm, say *, will usually deviate from the "true" solution . The main causes of error are round-off error and truncation error. The forward error of the algorithm is the difference between the result and the solution; in this case, . The backward error is the smallest such that ; in other words, the backward error tells us what problem the algorithm actually solved. The forward and backward error are related by the condition number: the forward error is at most as big in magnitude as the condition number multiplied by the magnitude of the backward error.
In many cases, it is more natural to consider the relative error instead of the absolute error .
The algorithm is said to be backward stable if the backward error is small for all inputs . Of course, "small" is a relative term and its definition will depend on the context. Often, we want the error to be of the same order as, or perhaps only a few orders of magnitude bigger than, the unit round-off.
T |
https://en.wikipedia.org/wiki/Affective%20computing | Affective computing is the study and development of systems and devices that can recognize, interpret, process, and simulate human affects. It is an interdisciplinary field spanning computer science, psychology, and cognitive science. While some core ideas in the field may be traced as far back as to early philosophical inquiries into emotion, the more modern branch of computer science originated with Rosalind Picard's 1995 paper on affective computing and her book Affective Computing published by MIT Press. One of the motivations for the research is the ability to give machines emotional intelligence, including to simulate empathy. The machine should interpret the emotional state of humans and adapt its behavior to them, giving an appropriate response to those emotions.
Areas
Detecting and recognizing emotional information
Detecting emotional information usually begins with passive sensors that capture data about the user's physical state or behavior without interpreting the input. The data gathered is analogous to the cues humans use to perceive emotions in others. For example, a video camera might capture facial expressions, body posture, and gestures, while a microphone might capture speech. Other sensors detect emotional cues by directly measuring physiological data, such as skin temperature and galvanic resistance.
Recognizing emotional information requires the extraction of meaningful patterns from the gathered data. This is done using machine learning techniques that process different modalities, such as speech recognition, natural language processing, or facial expression detection. The goal of most of these techniques is to produce labels that would match the labels a human perceiver would give in the same situation: For example, if a person makes a facial expression furrowing their brow, then the computer vision system might be taught to label their face as appearing "confused" or as "concentrating" or "slightly negative" (as opposed to positive, which it might say if they were smiling in a happy-appearing way). These labels may or may not correspond to what the person is actually feeling.
Emotion in machines
Another area within affective computing is the design of computational devices proposed to exhibit either innate emotional capabilities or that are capable of convincingly simulating emotions. A more practical approach, based on current technological capabilities, is the simulation of emotions in conversational agents in order to enrich and facilitate interactivity between human and machine.
Marvin Minsky, one of the pioneering computer scientists in artificial intelligence, relates emotions to the broader issues of machine intelligence stating in The Emotion Machine that emotion is "not especially different from the processes that we call 'thinking.'"
Technologies
In psychology, cognitive science, and in neuroscience, there have been two main approaches for describing how humans perceive and classify emotion: continuous |
https://en.wikipedia.org/wiki/Database%20transaction | A database transaction symbolizes a unit of work, performed within a database management system (or similar system) against a database, that is treated in a coherent and reliable way independent of other transactions. A transaction generally represents any change in a database. Transactions in a database environment have two main purposes:
To provide reliable units of work that allow correct recovery from failures and keep a database consistent even in cases of system failure. For example: when execution prematurely and unexpectedly stops (completely or partially) in which case many operations upon a database remain uncompleted, with unclear status.
To provide isolation between programs accessing a database concurrently. If this isolation is not provided, the programs' outcomes are possibly erroneous.
In a database management system, a transaction is a single unit of logic or work, sometimes made up of multiple operations. Any logical calculation done in a consistent mode in a database is known as a transaction. One example is a transfer from one bank account to another: the complete transaction requires subtracting the amount to be transferred from one account and adding that same amount to the other.
A database transaction, by definition, must be atomic (it must either be complete in its entirety or have no effect whatsoever), consistent (it must conform to existing constraints in the database), isolated (it must not affect other transactions) and durable (it must get written to persistent storage). Database practitioners often refer to these properties of database transactions using the acronym ACID.
Purpose
Databases and other data stores which treat the integrity of data as paramount often include the ability to handle transactions to maintain the integrity of data. A single transaction consists of one or more independent units of work, each reading and/or writing information to a database or other data store. When this happens it is often important to ensure that all such processing leaves the database or data store in a consistent state.
Examples from double-entry accounting systems often illustrate the concept of transactions. In double-entry accounting every debit requires the recording of an associated credit. If one writes a check for $100 to buy groceries, a transactional double-entry accounting system must record the following two entries to cover the single transaction:
Debit $100 to Groceries Expense Account
Credit $100 to Checking Account
A transactional system would make both entries pass or both entries would fail. By treating the recording of multiple entries as an atomic transactional unit of work the system maintains the integrity of the data recorded. In other words, nobody ends up with a situation in which a debit is recorded but no associated credit is recorded, or vice versa.
Transactional databases
A transactional database is a DBMS that provides the ACID properties for a bracketed set of database operations |
https://en.wikipedia.org/wiki/Object%20lifetime | In object-oriented programming (OOP), the object lifetime (or life cycle) of an object is the time between an object's creation and its destruction. Rules for object lifetime vary significantly between languages, in some cases between implementations of a given language, and lifetime of a particular object may vary from one run of the program to another.
In some cases, object lifetime coincides with variable lifetime of a variable with that object as value (both for static variables and automatic variables), but in general, object lifetime is not tied to the lifetime of any one variable. In many cases – and by default in many object-oriented languages, particularly those that use garbage collection (GC) – objects are allocated on the heap, and object lifetime is not determined by the lifetime of a given variable: the value of a variable holding an object actually corresponds to a reference to the object, not the object itself, and destruction of the variable just destroys the reference, not the underlying object.
Overview
While the basic idea of object lifetime is simple – an object is created, used, then destroyed – details vary substantially between languages, and within implementations of a given language, and is intimately tied to how memory management is implemented. Further, many fine distinctions are drawn between the steps, and between language-level concepts and implementation-level concepts. Terminology is relatively standard, but which steps correspond to a given term varies significantly between languages.
Terms generally come in antonym pairs, one for a creation concept, one for the corresponding destruction concept, like initialize/finalize or constructor/destructor. The creation/destruction pair is also known as initiation/termination, among other terms. The terms allocation and deallocation or freeing are also used, by analogy with memory management, though object creation and destruction can involve significantly more than simply memory allocation and deallocation, and allocation/deallocation are more properly considered steps in creation and destruction, respectively.
Determinism
A major distinction is whether an object's lifetime is deterministic or non-deterministic. This varies by language, and within language varies with the memory allocation of an object; object lifetime may be distinct from variable lifetime.
Objects with static memory allocation, notably objects stored in static variables, and classes modules (if classes or modules are themselves objects, and statically allocated), have a subtle non-determinism in many languages: while their lifetime appears to coincide with the run time of the program, the order of creation and destruction – which static object is created first, which second, etc. – is generally nondeterministic.
For objects with automatic memory allocation or dynamic memory allocation, object creation generally happens deterministically, either explicitly when an object is explicitly created (such |
https://en.wikipedia.org/wiki/Anti-pattern | An anti-pattern in software engineering, project management, and business processes is a common response to a recurring problem that is usually ineffective and risks being highly counterproductive. The term, coined in 1995 by computer programmer Andrew Koenig, was inspired by the book Design Patterns (which highlights a number of design patterns in software development that its authors considered to be highly reliable and effective) and first published in his article in the Journal of Object-Oriented Programming.
A further paper in 1996 presented by Michael Ackroyd at the Object World West Conference also documented anti-patterns.
It was, however, the 1998 book AntiPatterns that both popularized the idea and extended its scope beyond the field of software design to include software architecture and project management.
Other authors have extended it further since to encompass environmental/organizational/cultural anti-patterns.
Definition
According to the authors of Design Patterns, there are two key elements to an anti-pattern that distinguish it from a bad habit, bad practice, or bad idea:
The anti-pattern is a commonly-used process, structure or pattern of action that, despite initially appearing to be an appropriate and effective response to a problem, has more bad consequences than good ones.
Another solution exists to the problem the anti-pattern is attempting to address. This solution is documented, repeatable, and proven to be effective where the anti-pattern is not.
A guide to what is commonly used is a "rule-of-three" similar to that for patterns: to be an anti-pattern it must have been witnessed occurring at least three times.
Uses
Documenting anti-patterns can be an effective way to analyze a problem space and to capture expert knowledge.
While some anti-pattern descriptions merely document the adverse consequences of the pattern, good anti-pattern documentation also provides an alternative, or a means to ameliorate the anti-pattern.
Software engineering anti-patterns
In software engineering, anti-patterns include the big ball of mud (lack of) design, the God Class (where a single class handles all control in a program rather than control being distributed across multiple classes), magic numbers (where a unique value with an unexplained meaning or multiple occurrences which could be replaced with a named constant), and Poltergeists (ephemeral controller classes that only exist to invoke other methods on classes).
Big ball of mud
This indicates a software system that lacks a perceivable architecture. Although undesirable from a software engineering point of view, such systems are common in practice due to business pressures, developer turnover and code entropy.
The term was popularized in Brian Foote and Joseph Yoder's 1997 paper of the same name, which defines the term:
Foote and Yoder have credited Brian Marick as the originator of the 'big ball of mud' term for this sort of architecture.
Project management anti-patte |
https://en.wikipedia.org/wiki/John%20Grinder | John Thomas Grinder Jr. ( ; born January 10, 1940) is an American linguist, author, management consultant, trainer and speaker. Grinder is credited with co-creating neuro-linguistic programming (NLP) with Richard Bandler. He is co-director of Quantum Leap Inc., a management consulting firm founded by his partner Carmen Bostic St. Clair in 1987 (Grinder joined in 1989). Grinder and Bostic St. Clair also run workshops and seminars on NLP internationally.
Life and career
Grinder graduated from the University of San Francisco with a B.A. degree in psychology in the early 1960s. Grinder then entered the United States Army and served as a captain in the US Special Forces in Europe during the Cold War; following this he went on to work for a US intelligence agency. In the late 1960s, he returned to college to study linguistics and received his Ph.D. degree from the University of California, San Diego in 1971. His dissertation, titled On Deletion Phenomena in English, was published by Mouton in 1976.
In the early 1970s, Grinder worked in George A. Miller's laboratory at Rockefeller University. After receiving his doctorate, Grinder took a full-time position as an assistant professor in the linguistics faculty at the University of California, Santa Cruz (UCSC). He engaged in undergraduate teaching, graduate teaching, and research. His research focused on Noam Chomsky's theories of transformational grammar specializing in syntax and deletion phenomena. He published several research papers with Paul Postal on the syntactical structures relating to "missing antecedents" or missing parasitic gaps for the pronoun. They argued that the syntactic structure of a deleted verb phrase (VP) is complete.
Edward Klima, doctoral adviser to both Postal and Grinder at UCSC, became involved in the early development of generative semantics.
Grinder co-authored, with Suzette Elgin, a linguistics text book titled A Guide to Transformational Grammar: History, Theory, Practice. In 2005, Grinder published Steps to an Ecology of Emergence with Tom Malloy and Carmen Bostic St Clair in the journal Cybernetics and Human Knowing.
Development of neuro-linguistic programming
In 1972 (during Grinder's stint at UCSC) Richard Bandler, an undergraduate student of psychology, approached him for assistance in specific aspects of modeling Gestalt therapy. Bandler, along with good friend Frank Pucelik, had spent much time recording and editing recordings of Fritz Perls (founder of Gestalt therapy) and had learned Gestalt therapy implicitly during intense group sessions. After some time, Grinder was invited to participate in group discussions. Although at first Grinder sat quietly, he eventually approached Bandler and Pucelik with some observations and questions. Grinder left a lasting impression on Pucelik and was later dubbed 'the real genius'. Bandler and Pucelik invited Grinder to team up, eventually creating a very close group. Although Bandler, Grinder and Pucelik were the main drivi |
https://en.wikipedia.org/wiki/Richard%20Bandler | Richard Wayne Bandler (born 1950) is an American consultant in the field of self-help. With John Grinder, he founded the neuro-linguistic programming (NLP) approach to psychotherapy in the 1970s.
Education and background
Bandler was born in Teaneck, New Jersey and attended high school in Sunnyvale, California. He has stated that he was beaten as a child so badly that every bone in his body was broken. After his parents separated, he moved with his mother and stayed mostly in and around San Francisco. Bandler obtained a BA degree in philosophy and psychology from the University of California, Santa Cruz (UCSC) in 1973, and an MA degree in psychology from Lone Mountain College in San Francisco in 1975.
Neuro-linguistic programming
Bandler helped publisher Robert S. Spitzer (of Science and Behavior Books, Inc.) edit The Gestalt Approach (1973) based on a manuscript by gestalt therapist Fritz Perls (who had died in 1970). He also assisted with checking transcripts for Eye Witness to Therapy (1973). According to Spitzer, "[Bandler] came out of it talking and acting like Fritz Perls."
While a student at UCSC, Bandler also led a Gestalt therapy group. John Grinder, a professor at the University, said to Bandler that he could explain almost all the questions and comments Bandler made using transformational grammar. Grinder's specialty was in linguistics. Together, they created what they called a therapist training group. This was the basis for their first book, The Structure of Magic (1975). Bandler and Grinder claim to have later codified some of the foundational models for Neuro-linguistic programming in part by studying the methods of Milton Erickson and Virginia Satir.
Murder trial and acquittal
In 1986, Corine Ann Christensen (December 8, 1954 – November 3, 1986), a former girlfriend of Bandler's friend and cocaine dealer, James Marino, was shot dead in her Santa Cruz townhouse with a .357 magnum owned by Bandler. Authorities charged Bandler with her murder. Bandler testified that he had been at Christensen's house, but that Marino had shot Christensen. After a short deliberation, a jury found Bandler not guilty.
Publications
Using Your Brain for a Change, 1985 ()
An Insider's Guide To Sub-Modalities, 1988 () Richard Bandler, Will MacDonald
Magic in Action, 1992 ()
Time for a Change, 1993 ()
Richard Bandler and Kate Benson (2016) Teaching Excellence. Bandler Benson publications. 391pp. .
Richard Bandler, Dr. Glenda Bradstock and Owen Fitzpatrick (2019) Thinking on Purpose, a 15 Day Plan to a Smarter Life. New Thinking Publications. 272pp. .
References
External links
Guardian feature by Jon Ronson
Richard Bandler NLP
German Discussion-Board about Richard Bandler
NLP Events London
NHR Events
NLPLife Youtube channel
1950 births
Jewish American writers
American hypnotists
Living people
Neuro-linguistic programming writers
People acquitted of murder
University of California, Santa Cruz alumni
Writers from |
https://en.wikipedia.org/wiki/Threading | Threading may refer to:
Thread (computing), a programming technique
Threading (epilation), a hair removal method
Threading (manufacturing), the process of making a screw thread
Threading (protein sequence), a method for computational protein structure prediction
Threaded code, another programming technique
Threaded discussion (conversation threading), a conceptual model, and its instantiations, in digital communication, including IMs, DMs, email, Usenet, commenting utilities, web forums, and so on |
https://en.wikipedia.org/wiki/Aggregate%20pattern | An Aggregate pattern can refer to concepts in either statistics or computer programming. Both uses deal with considering a large case as composed of smaller, simpler, pieces.
Statistics
An aggregate pattern is an important statistical concept in many fields that rely on statistics to predict the behavior of large groups, based on the tendencies of subgroups to consistently behave in a certain way. It is particularly useful in sociology, economics, psychology, and criminology.
Computer programming
In Design Patterns, an aggregate is not a design pattern but rather refers to an object such as a list, vector, or generator which provides an interface for creating iterators. The following example code is in Python.
def fibonacci(n: int):
a, b = 0, 1
count = 0
while count < n:
count += 1
a, b = b, a + b
yield a
for x in fibonacci(10):
print(x)
def fibsum(n: int) -> int:
total = 0
for x in fibonacci(n):
total += x
return total
def fibsum_alt(n: int) -> int:
"""
Alternate implementation. demonstration that Python's built-in function sum()
works with arbitrary iterators.
"""
return sum(fibonacci(n))
myNumbers = [1, 7, 4, 3, 22]
def average(g) -> float:
return float(sum(g)) / len(g) # In Python 3 the cast to float is no longer be necessary
Python hides essentially all of the details using the iterator protocol. Confusingly, Design Patterns uses "aggregate" to refer to the blank in the code for x in ___: which is unrelated to the term "aggregation". Neither of these terms refer to the statistical aggregation of data such as the act of adding up the Fibonacci sequence or taking the average of a list of numbers.
See also
Visitor pattern
Template class
Facade pattern
Type safety
Functional programming
References
Software design patterns
Articles with example Python (programming language) code |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.