source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/Byte%20addressing | Byte addressing in hardware architectures supports accessing individual bytes. Computers with byte addressing are sometimes called byte machines, in contrast to word-addressable architectures, word machines, that access data by word.
Background
The basic unit of digital storage is a bit, storing a single 0 or 1. Many common instruction set architectures can address more than 8 bits of data at a time. For example, 32-bit x86 processors have 32-bit general-purpose registers and can handle 32-bit (4-byte) data in single instructions. However, data in memory may be of various lengths. Instruction sets that support byte addressing supports accessing data in units that are narrower than the word length. An eight-bit processor like the Intel 8008 addresses eight bits, but as this is the full width of the accumulator and other registers, this is could be considered either byte-addressable or word-addressable. 32-bit x86 processors, which address memory in 8-bit units but have 32-bit general-purpose registers and can operate on 32-bit items with a single instruction, are byte-addressable.
The advantage of word addressing is that more memory can be addressed in the same number of bits. The IBM 7094 has 15-bit addresses, so could address 32,768 words of 36 bits. The machines were often built with a full complement of addressable memory. Addressing 32,768 bytes of 6 bits would have been much less useful for scientific and engineering users. Or consider 32-bit x86 processors. Their 32-bit linear addresses can address 4 billion different items. Using word addressing, a 32-bit processor could address 4 Gigawords; or 16 Gigabytes using the modern 8-bit byte. If the 386 and its successors had used word addressing, scientists, engineers, and gamers could all have run programs that were 4x larger on 32-bit machines. However, word processing, rendering HTML, and all other text applications would have run more slowly.
When computers were so costly that they were only or mainly used for science and engineering, word addressing was the obvious mode. As it became cost-effective to use computers for handling text, hardware designers moved to byte addressing.
To illustrate why byte addressing is useful, consider the IBM 7094, which is word-addressable and has no concept of a byte. It has 36-bit words and stores its six-bit character codes six to a word. To change the 16th character in a string, the program has to determine that this is the fourth character of the third word in the string, fetch the third word, mask out the old value of the fourth character from the value held in the register, bitwise or in the new one, and then store back the amended word. At least six machine instructions. Usually, these are relegated to a subroutine, so every store or fetch of a single character involves the overhead of calling a subroutine and returning. With byte addressing, that can be achieved in one instruction: store this character code at that byte address. Text programs ar |
https://en.wikipedia.org/wiki/Boolean%20data%20type | In computer science, the Boolean (sometimes shortened to Bool) is a data type that has one of two possible values (usually denoted true and false) which is intended to represent the two truth values of logic and Boolean algebra. It is named after George Boole, who first defined an algebraic system of logic in the mid 19th century. The Boolean data type is primarily associated with conditional statements, which allow different actions by changing control flow depending on whether a programmer-specified Boolean condition evaluates to true or false. It is a special case of a more general logical data type—logic does not always need to be Boolean (see probabilistic logic).
Generalities
In programming languages with a built-in Boolean data type, such as Pascal and Java, the comparison operators such as > and ≠ are usually defined to return a Boolean value. Conditional and iterative commands may be defined to test Boolean-valued expressions.
Languages with no explicit Boolean data type, like C90 and Lisp, may still represent truth values by some other data type. Common Lisp uses an empty list for false, and any other value for true. The C programming language uses an integer type, where relational expressions like i > j and logical expressions connected by && and || are defined to have value 1 if true and 0 if false, whereas the test parts of if, while, for, etc., treat any non-zero value as true. Indeed, a Boolean variable may be regarded (and implemented) as a numerical variable with one binary digit (bit), or as a bit string of length one, which can store only two values. The implementation of Booleans in computers are most likely represented as a full word, rather than a bit; this is usually due to the ways computers transfer blocks of information.
Most programming languages, even those with no explicit Boolean type, have support for Boolean algebraic operations such as conjunction (AND, &, *), disjunction (OR, |, +), equivalence (EQV, =, ==), exclusive or/non-equivalence (XOR, NEQV, ^, !=, ¬), and negation (NOT, ~, !, ¬).
In some languages, like Ruby, Smalltalk, and Alice the true and false values belong to separate classes, e.g., True and False, respectively, so there is no one Boolean type.
In SQL, which uses a three-valued logic for explicit comparisons because of its special treatment of Nulls, the Boolean data type (introduced in SQL:1999) is also defined to include more than two truth values, so that SQL Booleans can store all logical values resulting from the evaluation of predicates in SQL. A column of Boolean type can be restricted to just TRUE and FALSE though.
Language-specific implementations
ALGOL and the built-in BOOLEAN type
One of the earliest programming languages to provide an explicit BOOLEAN data type is ALGOL 60 (1960) with values true and false and logical operators denoted by symbols '' (and), '' (or), '' (implies), '' (equivalence), and '' (not). Due to input device and character set limits on many computers of t |
https://en.wikipedia.org/wiki/Long%20Reach%20Ethernet | Long Reach Ethernet (LRE) was a proprietary networking protocol marketed by Cisco Systems, intended to support multi-megabit (5 to 15 Mbit/s) performance over telephone-grade unshielded twisted pair wiring over distances up to 5,000 feet (1.5 km).
Supporting such distance ranges, LRE is technically classified a Metropolitan area network (MAN) technology.
Technically the protocol was similar to very-high-bitrate digital subscriber line (VDSL), practically Ethernet over VDSL (EoVDSL).
The technology was sometimes considered an example of Ethernet in the first mile (EFM).
Several networking vendors offered compatible networking hardware, but the technology became obsolete.
Description
Like standard VDSL, LRE allowed existing telephone wiring that connects an organization's offices to be used to network those offices together using standard Ethernet protocol without incurring the huge cost of deploying fiber optic cable or limiting organizations to the bandwidth provided by modems or other digital subscriber line services.
Other sample applications included Internet access to hotel rooms or college dormitories over existing installed telephone wiring.
LRE was compatible with VDSL ETSI Band Plan 998.
Cisco sold Cisco Catalyst model 2900 switches using Infineon Technologies PEF22822/PEB22811 VDSL QAM chipset like many other VDSL concentrators.
The customer-premises equipment included the Cisco 575 desktop bridge.
Products were announced in February 2001 to be available in April 2001.
Infineon used the name 10BaseS for the technology,
Cisco included LRE in its Mobile Office marketing effort.
A few compatible devices were produced.
Cisco announced end-of-sale for the LRE products in October 2006, and its explanation page was removed from their web site in 2007.
HomePNA promotes similar technologies for use within a home rather than to a central office or business, with its 2.0, 3.0, and 3.1 releases. Different frequency bands are used so that VDSL and HomePNA can share the same wires.
References
External links
Metanoia communications Inc. Taiwan produced products called EVA Award and EVA Aero
Ethernet
Cisco protocols
Digital subscriber line |
https://en.wikipedia.org/wiki/Narendra%20Karmarkar | Narendra Krishna Karmarkar (born circa 1956) is an Indian mathematician. Karmarkar developed Karmarkar's algorithm. He is listed as an ISI highly cited researcher.
He invented one of the first provably polynomial time algorithms for linear programming, which is generally referred to as an interior point method. The algorithm is a cornerstone in the field of linear programming. He published his famous result in 1984 while he was working for Bell Laboratories in New Jersey.
Biography
Karmarkar received his B.Tech in Electrical Engineering from IIT Bombay in 1978, MS from the California Institute of Technology in 1979, and PhD in Computer Science from the University of California, Berkeley in 1983 under the supervision of Richard M. Karp.
Karmarkar was a post-doctoral research fellow at IBM research (1983), Member of Technical Staff and fellow at Mathematical Sciences Research Center, AT&T Bell Laboratories (1983–1998), professor of mathematics at M.I.T. (1991), at Institute for Advanced study, Princeton (1996), and Homi Bhabha Chair Professor at the Tata Institute of Fundamental Research in Mumbai from 1998 to 2005. He was the scientific advisor to the chairman of the TATA group (2006–2007). During this time, he was funded by Ratan Tata to scale-up the supercomputer he had designed and prototyped at TIFR. The scaled-up model ranked ahead of supercomputer in Japan at that time and achieved the best ranking India ever achieved in supercomputing. He was the founding director of Computational Research labs in Pune, where the scaling-up work was performed. He continues to work on his new architecture for supercomputing.
Work
Karmarkar's algorithm
Karmarkar's algorithm solves linear programming problems in polynomial time. These problems are represented by a number of linear constraints involving a number of variables. The previous method of solving these problems consisted of considering the problem as a high-dimensional solid with vertices, where the solution was approached by traversing from vertex to vertex. Karmarkar's novel method approaches the solution by cutting through the above solid in its traversal. Consequently, complex optimization problems are solved much faster using the Karmarkar's algorithm. A practical example of this efficiency is the solution to a complex problem in communications network optimization, where the solution time was reduced from weeks to days. His algorithm thus enables faster business and policy decisions. Karmarkar's algorithm has stimulated the development of several interior-point methods, some of which are used in current implementations of linear-program solvers.
Galois geometry
After working on the interior-point method, Karmarkar worked on a new architecture for supercomputing, based on concepts from finite geometry, especially projective geometry over finite fields.
Current investigations
Currently, he is synthesizing these concepts with some new ideas he calls sculpturing free space (a non-linear analo |
https://en.wikipedia.org/wiki/Network%20automaton | A network automaton (plural network automata) is a mathematical system consisting of a network of nodes that evolves over time according to predetermined rules. It is similar in concept to a cellular automaton, but much less studied.
Stephen Wolfram's book A New Kind of Science, which is primarily concerned with cellular automata, briefly discusses network automata, and suggests (without positive evidence) that the universe might at the very lowest level be a network automaton.
Networks
Cellular automata |
https://en.wikipedia.org/wiki/Maintenance%20mode | In the world of software development, maintenance mode refers to a point in a computer program's life when it has reached all of its goals and is generally considered to be "complete" and bug-free. The term can also refer to the point in a software product's evolution when it is no longer competitive with other products or current with regard to the technology environment it operates within. In both cases, continued development is deemed unnecessary or ill-advised, but occasional bug fixes and security patches are still issued, hence the term maintenance mode. Maintenance mode often transitions to abandonware.
Sometimes, when a popular free software project undergoes a major overhaul, the pre-overhaul version is kept active and put into maintenance mode because it will still be widely used in production for the foreseeable future. Project forks can also spawn from programs that go into maintenance mode too soon or have enough developer support for a more advanced version. A good example of this is the vi editor, which was in maintenance mode and forked into Vi IMproved. The Vim fork has many useful features that vi does not, such as syntax highlighting and the ability to have multiple open buffers.
See also
Steady state
Software maintenance |
https://en.wikipedia.org/wiki/Whitesmiths | Whitesmiths Ltd. was a software company founded in New York City by P. J. Plauger, Mark Krieger and Gabriel Pham, and last located in Westford, Massachusetts. It sold a Unix-like operating system called Idris, as well as the first commercial C compiler, Whitesmiths C.
The Whitesmiths compiler, first written for the PDP-11, was released in 1978 and compiled a version of C similar to that accepted by Version 6 Unix (Dennis Ritchie's original C compiler). It was an entirely new implementation, borrowing no code from Unix. Today, it is mainly remembered for lending its name to a particular indentation style, originally used in the code examples which accompanied it. Whitesmith's first customer for their C compiler was Fischer & Porter, a process control company then located in Warminster, Pennsylvania. Besides PDP-11, the compiler had code generators for Intel 8080/Zilog Z80, Motorola MC68000, and VAX-11, and it was commonly used as a cross compiler. Whitesmiths also developed a Pascal front-end for the compiler, that emitted C-language code for input to the C compiler.
By 1983 Whitesmiths was one of several vendors of Unix-like operating systems. That year Whitesmiths formed a technical and business alliance with France-based COSMIC Software. At that time, Whitesmiths published 16-bit compilers for machines like PDP-11 while COSMIC published 8-bit compilers for Intel and Motorola CPUs. This technology alliance improved compilers for both markets. Whitesmiths was actively involved in developing the original ANSI C standard supplying several members to the standards committee and hosting some technical sessions. They were one of the first suppliers of an ANSI C compliant compiler.
The company's president from 1978 to 1988 was P. J. Plauger. Whitesmiths merged with Intermetrics in December 1988, leading to further mergers and acquisitions.
References
External links
Whitesmiths Ltd. C Programmers' Manual
Official homepage of Cosmic Software
Defunct software companies of the United States
Unix history |
https://en.wikipedia.org/wiki/Traf-O-Data | Traf-O-Data was a business partnership between Bill Gates, Paul Allen and Paul Gilbert that existed in the 1970s. The objective was to read the raw data from roadway traffic counters and create reports for traffic engineers. The company had only modest success but the experience was instrumental in the creation of Microsoft Corporation a few years later.
Traffic counting
State and local governments frequently perform traffic surveys with a pneumatic road tube traffic counter. Rubber hoses are stretched across a road and wheels of passing vehicles create air pulses that are recorded by a roadside counter. In the 1970s the counts were mechanically recorded on a roll of paper tape. The time and number of axles were punched as a 16-bit pattern into the paper tape. (The common Teletype paper tape uses only 7 bits.) Cities would hire private companies to translate the data into reports that traffic engineers could use to adjust traffic lights or improve roads.
Bill Gates and Paul Allen were high school students at Lakeside School in Seattle. The Lakeside Programmers Group got free computer time on various computers in exchange for writing computer programs. Gates and Allen thought they could process the traffic data cheaper and faster than the local companies by building a computer that could process all the traffic tapes using the Intel 8008 processor. The goal was to sell such machines to states and local governments as a time and cost-saving tool.
Since Gates and Allen did not know how to build a computer capable of processing data on paper tapes, they recruited Paul Gilbert to help in building a prototype that can manually read the hole-patterns in the paper tape and transcribe the data onto computer cards. Gilbert became the third partner. Gates then used a computer at the University of Washington to produce the traffic flow charts. (Paul Allen's father was a librarian at UW.) This was the beginning of Traf-O-Data.
Traf-O-Data hardware
The next step was to build a device to read the traffic tapes directly and eliminate the tedious manual work. The Intel 8008 microprocessor was announced in 1972 and they realized it could read the tapes and process the data. Allen had graduated and was enrolled at Washington State University. Since neither Gates nor Allen had any hardware design experience, they were initially stumped.
Gates and Allen had a friend, Paul Wennberg, who, like them, loitered at Control Data Corporation near the University of Washington, cadging open time on the mainframe computer. Wennberg, later the founder of the Triakis Corporation, was an electrical engineering student at the University of Washington. In the course of events Gates and Allen mentioned they were looking for somebody to build them a computer for free. They needed somebody good enough to build a computer from parts and the diagrams found in a computer magazine. Wennberg talked to his friend, Wes Prichard, who suggested to Wennberg that Gates and Allen head over |
https://en.wikipedia.org/wiki/First-class%20function | In computer science, a programming language is said to have first-class functions if it treats functions as first-class citizens. This means the language supports passing functions as arguments to other functions, returning them as the values from other functions, and assigning them to variables or storing them in data structures. Some programming language theorists require support for anonymous functions (function literals) as well. In languages with first-class functions, the names of functions do not have any special status; they are treated like ordinary variables with a function type. The term was coined by Christopher Strachey in the context of "functions as first-class citizens" in the mid-1960s.
First-class functions are a necessity for the functional programming style, in which the use of higher-order functions is a standard practice. A simple example of a higher-ordered function is the map function, which takes, as its arguments, a function and a list, and returns the list formed by applying the function to each member of the list. For a language to support map, it must support passing a function as an argument.
There are certain implementation difficulties in passing functions as arguments or returning them as results, especially in the presence of non-local variables introduced in nested and anonymous functions. Historically, these were termed the funarg problems, the name coming from "function argument". In early imperative languages these problems were avoided by either not supporting functions as result types (e.g. ALGOL 60, Pascal) or omitting nested functions and thus non-local variables (e.g. C). The early functional language Lisp took the approach of dynamic scoping, where non-local variables refer to the closest definition of that variable at the point where the function is executed, instead of where it was defined. Proper support for lexically scoped first-class functions was introduced in Scheme and requires handling references to functions as closures instead of bare function pointers, which in turn makes garbage collection a necessity.
Concepts
In this section, we compare how particular programming idioms are handled in a functional language with first-class functions (Haskell) compared to an imperative language where functions are second-class citizens (C).
Higher-order functions: passing functions as arguments
In languages where functions are first-class citizens, functions can be passed as arguments to other functions in the same way as other values (a function taking another function as argument is called a higher-order function). In the language Haskell:
map :: (a -> b) -> [a] -> [b]
map f [] = []
map f (x:xs) = f x : map f xs
Languages where functions are not first-class often still allow one to write higher-order functions through the use of features such as function pointers or delegates. In the language C:
void map(int (*f)(int), int x[], size_t n) {
for (int i = 0; i < n; i++)
x[i] = f(x[ |
https://en.wikipedia.org/wiki/DC%2B%2B | DC++ is a free and open-source, peer-to-peer file-sharing client that can be used for connecting to the Direct Connect network or to the ADC protocol. It is developed primarily by Jacek Sieka, nicknamed arnetheduck.
History and background
DC++ is a free and open-source alternative to the original client, NeoModus Direct Connect (NMDC); it connects to the same file-sharing network and supports the same file-sharing protocol. One of the reasons commonly attributed to the popularity of DC++ is that it has no adware of any kind, unlike NMDC.
Many other clients exist for the Direct Connect network, and most of these are DC++ "mods": modified versions of DC++, based on DC++'s source code. A partial list of DC++ mods is given below. Some of these clients were developed for specialized communities (e.g. music-sharing communities), or in order to support specific experimental features, or perhaps features that have been rejected from inclusion in DC++ itself. An example of an experimental feature is hashing, which was initially implemented in BCDC++ and later adopted by DC++.
, DC++ had around 90% market share of the Direct Connect community.
Forks
An advantage of the free and open-source nature of DC++ is that several mods have been released which add features to the original client.
Many users send patches to DC++ which are included in future releases, but some features are rejected by the developer. Stated reasons for rejecting a patch are because they are coded poorly, or that the feature is frivolous, abusable or overly specialized, and does not belong in the main client. Examples include: upload bandwidth limiting (many users feel that upload bandwidth limiting is a form of cheating, while other users not using a full-duplex network connection can only achieve reasonable download speeds by limiting uploads), colorized chat, specialized operator functions (e.g. client/share checking).
The developers of some forks contribute features and bug fixes back upstream to DC++.
Client software comparison
General
Operating system support
Interface and programming
Features
See also
Direct Connect (protocol)
Advanced Direct Connect
References
External links
DC++ (Official website)
DC++ Webhelp
Direct Connect network
Free file sharing software
Free software programmed in C++
Windows-only free software
1999 software |
https://en.wikipedia.org/wiki/Evesham%20Technology | Evesham Technology was a computer manufacturing and retail company based in Evesham, Worcestershire, England. It began operations in 1983 and closed in 2008 following financial difficulties. It was a significant contributor to the United Kingdom's domestic computer and digital television market. Its assets grew to include a factory and warehouse complex, and a chain of 19 retail stores in towns and cities throughout the UK, with around 300 employees. The company was founded in 1983 by Richard Austin and Robert (Bob) Hitchcock as Evesham Micros, to be briefly known as Evesham.com and finally as Evesham Technology. Austin continued as chairman and controlling shareholder until the company and its much reduced, short-lived successor, Geemore Technology Ltd, went into liquidation.
Company history
Initially specialising in Amstrad computers, Evesham began trading in 1983 as Evesham Micros, and for a short while as Evesham.com. It expanded its activities to include desktop and laptop computers, software, components and peripherals, servers, storage and networking as well as gaming systems, LCD televisions, digital TV recorders, and satellite navigation. The sale of the Amstrad at competitive prices contributed to the initial success of the company. It developed and licensed a number of peripherals and upgrades for the ZX Spectrum (48K memory upgrade, Interface III cheat/copy Cartridge) and Commodore 64 (Freeze Frame cheat/copy Cartridge, Dolphin DOS disk drive accelerator, Oceanic disk drive replacement) in the second half of the 1980s.
The company continued to sell computers at discounted prices, retailing an end of line stock Olivetti PC, the UK's first PC to be priced under £300. In December 1991, it cleared remaining stocks of the Amstrad's PC 2000 range, including 286 and 386DX machines selling for well under £1,000. Evesham became the UK's largest supplier of Atari ST computers, also selling them at discounted prices, having purchased large stocks. They also sold a range of software and peripherals for Amiga and Atari ST computers. Many of the products it designed were innovative and received favourable reviews by the computer press.
The company moved premises from Bridge Street to St Richards Road in 1989, opened a manufacturing plant, and began marketing under the brand name of Zydec. In early 1992 Evesham released, under the name Vale, its first home produced PC, intended to be sold as part of the Zydec product range. The Zydec name was later revived as a range of low costing PCs sold briefly alongside the Vale range. The company expanded, and acquired a number of industrial units on the Four Pools Industrial Estate. In 1998, Evesham relocated to purpose built facilities at Vale Park. In 2002 it merged with Mertec, a company established for over 20 years in Swansea, South Wales that held long-term supply and service contracts with some of the largest Welsh institutions. In mid-2004 Evesham and FalconStor Software, Inc., a leading dev |
https://en.wikipedia.org/wiki/Zzap%2164 | Zzap!64 was a computer games magazine covering games on the Commodore International series of computers, especially the Commodore 64 (C64). It was published in the UK by Newsfield Publications Ltd and later by Europress Impact.
The magazine launched in April, with the cover date May 1985, as the sister magazine to CRASH. It focused on the C64 for much of its shelf life, but later incorporated Amiga game news and reviews. Like CRASH for the ZX Spectrum, it had a dedicated cult following amongst C64 owners and was well known for its irreverent sense of humour as well as its extensive, detailed coverage of the C64 scene. The magazine adopted an innovative review system that involved the use of the reviewers' faces, artistically rendered by in-house artists Oli Frey and Mark Kendrick, to express their reaction to the games. These eventually evolved into static cartoons as the magazine began catering for a younger market.
By 1992, the magazine had changed so dramatically in design and editorial direction that then-publisher Europress decided to relaunch the magazine. Thus, issue 91 of Zzap!64 became issue 1 of Commodore Force, a magazine that itself lasted until March 1994.
History
The first issue of Zzap!64, dated May 1985, was released on 11 April 1985. Its inaugural editorial team included editor Chris Anderson, Software Editor Bob Wade, freelance writer Steve Cooke (who joined the staff from the recently folded Personal Computer Games), and reviewers Gary Penn and Julian Rignall, who won their jobs after having placed as finalists at a video game competition. The editorial headquarters was in Yeovil, more than 120 miles from Newsfield's headquarters in Ludlow; the team was relocated to Ludlow after three months to cut costs, and Anderson and Wade left the staff after declining to make the move. Anderson would later found Future Publishing and the TED Conference.
As the Amiga gained popularity in the UK, Zzap!64 began to publish occasional reviews of Amiga games. The Amiga coverage became a fixed feature of the magazine in issue 43 (November 1988), when the title was renamed to Zzap!64 Amiga.
The magazine experienced controversy in 1989, when three out of four reviewers (Gordon Houghton, Kati Hamza and Maff Evans) were fired and replaced during production of issue 50 (June 1989). The only one remaining, Paul Rand, had been employed at Zzap!64 a mere two months. Issue 50's editorial mentioned nothing of what happened, and the issue featured content from the three fired reviewers without discussing their fates.
Issue 74 (June 1991) saw the dropping of all Amiga coverage (the word "Amiga" was dropped from the name in 1990), and the magazine became completely devoted to the C64 once more. Four months later the publisher Newsfield declared bankruptcy and publication was suspended for a month. Europress Impact (a satellite company of Europress launched by Roger Kean, Oliver Frey and Jonathan Rignall) became the new publisher of Zzap!64, beginning w |
https://en.wikipedia.org/wiki/Omia | Omia may refer to:
Omia (moth), a genus of moth
Omia District, Peru
Online Mendelian Inheritance in Animals, an online database of animal phenotypes
Omia, a minor Enochian angel |
https://en.wikipedia.org/wiki/Hex%20editor | A hex editor (or binary file editor or byte editor) is a computer program that allows for manipulation of the fundamental binary data that constitutes a computer file. The name 'hex' comes from 'hexadecimal', a standard numerical format for representing binary data. A typical computer file occupies multiple areas on the storage medium, whose contents are combined to form the file. Hex editors that are designed to parse and edit sector data from the physical segments of floppy or hard disks are sometimes called sector editors or disk editors.
Details
With a hex editor, a user can see or edit the raw and exact contents of a file, as opposed to the interpretation of the same content that other, higher level application software may associate with the file format. For example, this could be raw image data, in contrast to the way image editing software would interpret and show the same file.
Hex editors may be used to correct data corrupted by system or application program problems where it may not be worthwhile to write a special program to make the corrections. They are useful to bypass application edit checks which may prevent correction of erroneous data. They have been used to "patch" executable programs to change or add a few instructions as an alternative to recompilation. Program fixes for IBM mainframe systems are sometimes distributed as patches rather than distributing a complete copy of the affected program.
In most hex editor applications, the data of the computer file is represented as hexadecimal values grouped in 4 groups of 4 bytes (or two groups of 8 bytes), followed by one group of 16 printable ASCII characters which correspond to each pair of hex values (each byte). Non-printable ASCII characters (e.g., Bell) and characters that would take more than one character space (e.g., tab) are typically represented by a dot (".") in the following ASCII field.
Size limits
Unlike conventional text editors, Hex editors are able to efficiently handle files with indefinite sizes, as only a portion of the file is loaded while browsing it and modified when saving it, rather than the entire file at once.
Early history
Since the invention of computers and their different uses, a variety of file formats has been created. In some special circumstances it was convenient to be able to access the data as a series of raw digits. A program called SUPERZAP (AMASPZAP) was available for IBM OS/360 systems which could edit raw disk records and also understood the format of executable files. Pairs of hexadecimal digits (each pair can represent a byte) are the current standard, because the vast majority of machines and file formats in use today handle data in units or groups of 8-bit bytes. Hexadecimal and also octal are common because these digits allow one to see which bits in a byte are set. Today, decimal instead of hexadecimal representation is becoming a popular second option due to the more familiar number base and additional helper tools, such a |
https://en.wikipedia.org/wiki/DLNA | Digital Living Network Alliance (DLNA) is a set of interoperability standards for sharing home digital media among multimedia devices. It allows users to share or stream stored media files to various certified devices on the same network like PCs, smartphones, TV sets, game consoles, stereo systems, and NASs. DLNA incorporates several existing public standards, including Universal Plug and Play (UPnP) for media management and device discovery and control, wired and wireless networking standards, and widely used digital media formats.
DLNA was created by Sony and Intel and the consortium soon included various PC and consumer electronics companies, publishing its first set of guidelines in June 2004. The Digital Living Network Alliance developed and promoted it under the auspices of a certification standard, with a claimed membership of "more than 200 companies" before dissolving in 2017. By September 2014 over 25,000 device models had obtained "DLNA Certified" status, indicated by a logo on their packaging and confirming their interoperability with other devices. In many cases DLNA protocols are in use by services or software without openly stating the name: examples include Nokia's Home Network functionality, Samsung's All Share, the Play To functionality in Windows 8.1, and in applications such as VLC media player or Roku Media Player.
Specification
The DLNA Certified Device Classes are separated as follows:
Home network devices
Digital Media Server (DMS): store content and make it available to networked digital media players (DMP) and digital media renderers (DMR). Examples include PCs and network-attached storage (NAS) devices.
Digital Media Player (DMP): find content on digital media servers (DMS) and provide playback and rendering capabilities. Examples include TVs, stereos and home theaters, wireless monitors and game consoles.
Digital Media Renderer (DMR): play content as instructed by a digital media controller (DMC), which will find content from a digital media server (DMS). Examples include TVs, audio/video receivers, video displays and remote speakers for music. It is possible for a single device (e.g. TV, A/V receiver, etc.) to function both as a DMR (receives "pushed" content from DMS) and DMP ("pulls" content from DMS).
Digital Media Controller (DMC): find content on digital media servers (DMS) and instruct digital media renderers (DMR) to play the content. Content does not stream from or through the DMC. Examples include tablet computers, Wi-Fi enabled digital cameras and smartphones.
Generally, digital media players (DMP) and digital media controllers (DMC) with print capability can print to DMPr. Examples include networked photo printers and networked all-in-one printers.
Mobile handheld devices
Mobile Digital Media Server (M-DMS): store content and make it available to wired/wireless networked mobile digital media players (M-DMP), and digital media renderers. Examples include mobile phones and portable music players.
|
https://en.wikipedia.org/wiki/2004%E2%80%9305%20United%20States%20network%20television%20schedule | The 2004–05 network television schedule for the six major English-language commercial broadcast networks in the United States covers the prime time hours from September 2004 to August 2005. The schedule is followed by a list per network of returning series, new series, and series canceled after the 2003–04 television season.
Beginning this season, largely resulting from continuing declines in prime time television viewership on that night of the week, the major networks ceased producing original scripted programs for broadcast on Saturday evenings (an exception being ABC's The Wonderful World of Disney, although it often featured rebroadcast material, mainly in the form of Disney theatrical films). From this point on, Saturday prime time network schedules would instead consist of nonfiction reality-based programs, rebroadcasts of scripted prime time series (most commonly featuring dramatic series), unaired episodes of de facto cancelled series that were being "burned off" after having been pulled from their previous timeslot on a different night, theatrical or made-for-television movies, and/or sporting events (which became increasingly common in the time period beginning with the 2012–13 season).
PBS is not included, as member television stations have local flexibility over most of their schedules and broadcast times for network shows may vary. Pax TV (now Ion Television) is also not included; although the network aired a few original first-run series, Pax's schedule at the time consisted primarily of syndicated reruns and movies.
Each of the 30 highest-rated shows is listed with its rank and rating as determined by Nielsen Media Research.
Legend
Schedule
New series are highlighted in bold.
Repeat airings or same-day rebroadcasts are indicated by .
All times are U.S. Eastern and Pacific Time, except for certain live events (such as Monday Night Football) that are broadcast simultaneously in all time zones. Subtract one hour for Central, Mountain, Alaska, and Hawaii-Aleutian times.
All sporting events air live in all time zones, with local and/or late-night programming (including those normally aired by Fox affiliates during the 10:00 p.m. ET/PT hour) being shown after the game's completion.
Sunday
Monday
Note: Fox originally scheduled Athens (a drama series that was to center on the lives of a group of young adults in a fictional New England college town) as a midseason replacement in the 8:00 p.m. ET slot; however, the network cancelled the series last-minute.
Tuesday
Notes:
NBC originally intended for Average Joe to air on its Fall schedule in the 8:00 p.m. ET slot; it chose to delay the reality dating series to Summer. The network originally scheduled The Contender to premiere on March 1, 2005 in the 8:00 p.m. ET slot, but opted to delay its premiere to March 9, before switching timeslots with American Dreams, which had been airing on Sundays during that hour.
Fox originally intended to air a Fall run of legal drama The Jury |
https://en.wikipedia.org/wiki/Michael%20Heath | Michael Heath may refer to:
Mike Heath (baseball) (born 1955), baseball player
Michael Heath (cartoonist) (born 1935), British strip cartoonist and illustrator
Michael Heath (computer scientist) (born 1946), computer scientist who specializes in scientific computing
Mike Heath (swimmer) (born 1964), former American Olympic swimmer
Michael Heath (Paralympic swimmer) (born 1989), Canadian Paralympic swimmer
Michael Heath, the Recorder of Lincoln
See also
Mickey Heath (1903–1986), baseball player |
https://en.wikipedia.org/wiki/CIVT-DT | CIVT-DT (channel 32) is a television station in Vancouver, British Columbia, Canada, serving as the West Coast flagship of the CTV Television Network. It is owned and operated by network parent Bell Media alongside Victoria-based CTV 2 station CIVI-DT (channel 53). Although the two stations nominally maintain separate operations, the Victoria station's newscasts have been produced at CIVT-DT since 2023. CIVT-DT's studios are located at 969 Robson Street (alternatively known as 750 Burrard Street; the former site of the Vancouver Public Library's central branch) at the intersection of Robson Street and Burrard Street in downtown Vancouver, which also houses the British Columbia operations of the CTV network itself, including the CTV National News Vancouver bureau. The station's transmitter is located atop Mount Seymour in the district municipality of North Vancouver.
CIVT went on the air in 1997 as the first new Vancouver TV station in 21 years after the application of Baton Broadcasting for a television licence was granted from a field of five bids. Originally known as Vancouver Television (VTV), the station was a young-skewing outlet intended to reflect an increasingly multicultural Vancouver and stimulate television production in British Columbia. In addition to local news and arts programming, CIVT produced programs seen nationally, including a talk show hosted by Vicki Gabereau and Cold Squad.
Concurrently with the launch of CIVT, Baton Broadcasting acquired the CTV network. This purchase, plus an ownership change at longtime CTV affiliate CHAN-TV that saw it become owned by the Global Television Network, led to a major television realignment in 2001 under which CIVT became the new CTV station for the province and the only CTV affiliate on Canada's west coast. In switching to CTV, the station moved toward attracting an older audience. It also improved its news ratings, generally becoming the second-rated station for local news after CHAN.
History
Licensing
By the mid-1990s, nearly two decades had passed since Vancouver had last received a new television station—CKVU-TV in 1976. A 1977 CRTC study found that, under its projections, Vancouver would need seven additional TV stations by 2001, including three new English-language commercial outlets as well as a multilingual station focused on ethnic communities in the region. While population growth had largely followed the CRTC's projections from that time, the growth in the television station industry had not. The three existing major stations in Vancouver—CBC station CBUT-TV, CHAN-TV (known as BCTV), and CKVU-TV—were coming under increasing scrutiny as being not adequately reflective of an increasingly diverse community. In a July 1996 column, Robert Mason Lee of The Globe and Mail noted that BCTV had the "dangerous arrogance of a local-news gorilla", called CBUT's news product "wholesome" but noted that the local CBC station "has neither the money nor the authority to produce local televisi |
https://en.wikipedia.org/wiki/Tom%20Jennings | Thomas Daniel Jennings (born 1955) is a Los Angeles-based artist and computer programmer, known for his work that led to FidoNet (the first message and file networking bulletin board system, or BBS), and for his work at Phoenix Software on MS-DOS integration and interoperability.
Work
In 1983, Jennings created the Fido program, which spawned FidoNet, the first message and file networking bulletin board system (BBS). The FidoNet protocols were authored by Jennings in the Fido program, and they were ultimately implemented by numerous authors in other software to create the full BBS, network using a multiplicity of platforms.
Aside from creating the protocol for networking BBSes, Jennings: built Wireds first internet presence; wrote the portable BIOS that led to Phoenix Technologies BIOS, contributing to on MS-DOS integration and interoperability; ran an early regional internet service providerThe Little Garden (later incorporated as TLGnet, Inc); and maintains an informal archive of Cold War science and technology.
From 1988 until 1991, while he lived in San Francisco, Jennings was the publisher and co-editor, with Deke Nihilson, of Homocore, one of the earliest Queercore zines. The name came from the pages of J.D.s zine, and featured musicians and writers such as The Apostles, Steve Abbott, Donna Dresch, Larry Livermore, Daniel Nicoletta and G.B. Jones. The co-editors' other activities, such as organizing Homocore shows where bands such as Fugazi and Beat Happening appeared, and writing for and creating other publications, helped popularize the Queercore movement in the United states and internationally.
Popular culture
In 2002, Jennings was interviewed for the series BBS: The Documentary, released online (partial content) and to home video in DVD format (full content) in 2005.
Personal life
As of a fully unreferenced March 2005 edit,
References
External links
1955 births
Living people
Queercore
FidoNet
University of California, Irvine people
LGBT people from California
LGBT people from Massachusetts
People from Boston
People from Los Angeles
Internet pioneers |
https://en.wikipedia.org/wiki/Fitting | Fitting can refer to:
Curve fitting, the process of constructing a curve, or mathematical function, that has the best fit to a series of data points
A dress fitting
Piping and plumbing fitting, used in pipe systems to connect straight sections of pipe or tube, adapt to different sizes or shapes, and for other purposes
Compression fitting, a fitting used to join two tubes or thin-walled pipes together
Lightbulb socket or lamp fitting
Persons with the surname Fitting
Andrea Fitting, founder and CEO of Fitting Group
Édouard Fitting (1898–1945), Swiss fencer
Emma Fitting (1900–1986), Swiss fencer
Frédéric Fitting (1902–1998), Swiss fencer
Hans Fitting (1906–1938), German mathematician
Willy Fitting (1925–2017), Swiss fencer
See also
Fit (disambiguation)
Fitter (disambiguation)
Fetting, a surname
Fitling, a hamlet in the East Riding of Yorkshire, England
Overfitting, production of an analysis that corresponds too closely or exactly to a data set |
https://en.wikipedia.org/wiki/CBC%20Radio%20One%20local%20programming | Stations in Canada's CBC Radio One network each produce some local programming in addition to the network schedule.
The amount of local programming may vary from station to station. For instance, some stations in smaller markets may produce their own morning show but air an afternoon show from another station. Some stations in major markets also preempt some regular network programming in favour of an extended local schedule.
Some regional programming is also produced which is shared by all stations in a province. This most commonly applies to daily noon-hour shows, weekend morning shows and a Saturday afternoon arts and culture magazine.
Content
Local programs on CBC Radio One feature news and human interest content local to the region they serve. Each program also includes both national and local news headline segments. Some general content segments, such as business news reports, science news reports and entertainment reviews, air across the network on all local programs.
Some local segments from the various morning and afternoon programs are also aired on the national network program The Story from Here.
At the top of each hour during the morning and afternoon programs, national newscasts – World Report in the mornings and The World This Hour in the afternoons – air for the first ten minutes. A shorter local newscast typically airs at the half-hour mark.
On statutory holidays, nearly all local programming is preempted in favour of network-wide special programming. In heavily populated provinces like Ontario, the various local morning shows within often rotate broadcasting for the entire province. On Christmas Day, the entire daytime broadcasting schedule, and most of the evening is preempted for holiday music programming except for news programming such as World Report and The World at Six
Weekday programming
Local morning shows air from 5:30 am or 6 am local time, depending on the station, to 8:30 am. They are followed by a local news update, and then The Current at 8:37 am. The sole exception is Qulliq, the program from Nunavut, which begins at 6:30 am ET and airs until 9:30 am ET. As of the 2015-16 television season, the 6:00 a.m. hour of these programs outside of CBC North air on local CBC television stations.
Local afternoon shows on CBC Radio One air from 4 pm to 6 pm local time, except in Halifax, Ottawa, Toronto, Winnipeg, Calgary, Edmonton, Vancouver and Victoria, where they start at 3 pm. Rebroadcasters outside of those cities do not air the first hour of the extended afternoon shows; they stay with regional or conventional network programming and then rejoin their host station's afternoon show at 4 pm.
In addition to the standard local programming blocks, the stations in Nunavut, the Northwest Territories, and northern Quebec also preempt much of the network's afternoon schedule to produce additional local programming in aboriginal languages. See CBC North for further information. (Pre-6 am morning show start times are l |
https://en.wikipedia.org/wiki/GPAC | GPAC may refer to
Geelong Arts Centre (formerly Geelong Performing Arts Centre), an arts centre in Geelong, Victoria, Australia
General purpose analog computer, a mathematical model of analog computers
GPAC Project on Advanced Content, an open source multimedia framework for research and academic purposes
Great Plains Athletic Conference, a college athletic conference in the United States
See also
GCAP (disambiguation)
GenderPAC, a gay/lesbian/transgender political action committee based in Washington, D.C. |
https://en.wikipedia.org/wiki/Gauss%E2%80%93Newton%20algorithm | The Gauss–Newton algorithm is used to solve non-linear least squares problems, which is equivalent to minimizing a sum of squared function values. It is an extension of Newton's method for finding a minimum of a non-linear function. Since a sum of squares must be nonnegative, the algorithm can be viewed as using Newton's method to iteratively approximate zeroes of the components of the sum, and thus minimizing the sum. In this sense, the algorithm is also an effective method for solving overdetermined systems of equations. It has the advantage that second derivatives, which can be challenging to compute, are not required.
Non-linear least squares problems arise, for instance, in non-linear regression, where parameters in a model are sought such that the model is in good agreement with available observations.
The method is named after the mathematicians Carl Friedrich Gauss and Isaac Newton, and first appeared in Gauss' 1809 work Theoria motus corporum coelestium in sectionibus conicis solem ambientum.
Description
Given functions (often called residuals) of variables with the Gauss–Newton algorithm iteratively finds the value of the variables that minimize the sum of squares
Starting with an initial guess for the minimum, the method proceeds by the iterations
where, if r and β are column vectors, the entries of the Jacobian matrix are
and the symbol denotes the matrix transpose.
At each iteration, the update can be found by rearranging the previous equation in the following two steps:
With substitutions , , and , this turns into the conventional matrix equation of form , which can then be solved in a variety of methods (see Notes).
If , the iteration simplifies to
which is a direct generalization of Newton's method in one dimension.
In data fitting, where the goal is to find the parameters such that a given model function best fits some data points , the functions are the residuals:
Then, the Gauss–Newton method can be expressed in terms of the Jacobian of the function as
Note that is the left pseudoinverse of .
Notes
The assumption in the algorithm statement is necessary, as otherwise the matrix is not invertible and the normal equations cannot be solved (at least uniquely).
The Gauss–Newton algorithm can be derived by linearly approximating the vector of functions ri. Using Taylor's theorem, we can write at every iteration:
with . The task of finding minimizing the sum of squares of the right-hand side; i.e.,
is a linear least-squares problem, which can be solved explicitly, yielding the normal equations in the algorithm.
The normal equations are n simultaneous linear equations in the unknown increments . They may be solved in one step, using Cholesky decomposition, or, better, the QR factorization of . For large systems, an iterative method, such as the conjugate gradient method, may be more efficient. If there is a linear dependence between columns of Jr, the iterations will fail, as becomes singular.
|
https://en.wikipedia.org/wiki/Precision%20%28computer%20science%29 | In computer science, the precision of a numerical quantity is a measure of the detail in which the quantity is expressed. This is usually measured in bits, but sometimes in decimal digits. It is related to precision in mathematics, which describes the number of digits that are used to express a value.
Some of the standardized precision formats are
Half-precision floating-point format
Single-precision floating-point format
Double-precision floating-point format
Quadruple-precision floating-point format
Octuple-precision floating-point format
Of these, octuple-precision format is rarely used. The single- and double-precision formats are most widely used and supported on nearly all platforms. The use of half-precision format has been increasing especially in the field of machine learning since many machine learning algorithms are inherently error-tolerant.
Rounding error
Precision is often the source of rounding errors in computation. The number of bits used to store a number will often cause some loss of accuracy. An example would be to store "sin(0.1)" in IEEE single precision floating point standard. The error is then often magnified as subsequent computations are made using the data (although it can also be reduced).
See also
Arbitrary-precision arithmetic
Extended precision
Granularity
IEEE754 (IEEE floating point standard)
Integer (computer science)
Significant figures
Truncation
Approximate computing
References
Computer data
Approximations |
https://en.wikipedia.org/wiki/Windows%20Registry | The Windows Registry is a hierarchical database that stores low-level settings for the Microsoft Windows operating system and for applications that opt to use the registry. The kernel, device drivers, services, Security Accounts Manager, and user interfaces can all use the registry. The registry also allows access to counters for profiling system performance.
In other words, the registry or Windows Registry contains information, settings, options, and other values for programs and hardware installed on all versions of Microsoft Windows operating systems. For example, when a program is installed, a new subkey containing settings such as a program's location, its version, and how to start the program, are all added to the Windows Registry.
When introduced with Windows 3.1, the Windows Registry primarily stored configuration information for COM-based components. Windows 95 and Windows NT extended its use to rationalize and centralize the information in the profusion of INI files, which held the configurations for individual programs, and were stored at various locations. It is not a requirement for Windows applications to use the Windows Registry. For example, .NET Framework applications use XML files for configuration, while portable applications usually keep their configuration files with their executables.
Rationale
Prior to the Windows Registry, .INI files stored each program's settings as a text file or binary file, often located in a shared location that did not provide user-specific settings in a multi-user scenario. By contrast, the Windows Registry stores all application settings in one logical repository (but a number of discrete files) and in a standardized form. According to Microsoft, this offers several advantages over .INI files. Since file parsing is done much more efficiently with a binary format, it may be read from or written to more quickly than a text INI file. Furthermore, strongly typed data can be stored in the registry, as opposed to the text information stored in .INI files. This is a benefit when editing keys manually using regedit.exe, the built-in Windows Registry Editor. Because user-based registry settings are loaded from a user-specific path rather than from a read-only system location, the registry allows multiple users to share the same machine, and also allows programs to work for less privileged users. Backup and restoration is also simplified as the registry can be accessed over a network connection for remote management/support, including from scripts, using the standard set of APIs, as long as the Remote Registry service is running and firewall rules permit this.
Because the registry is a database, it offers improved system integrity with features such as atomic updates. If two processes attempt to update the same registry value at the same time, one process's change will precede the other's and the overall consistency of the data will be maintained. Where changes are made to .INI files, such race conditi |
https://en.wikipedia.org/wiki/Fr%C3%A9d%C3%A9ric%20Lepied | Frédéric Lepied (born 1967) is a French computer engineer, and was the CTO of Mandriva until January 2006.
Biography
Born in 1967, Frédéric Lepied took an early interest in computer science and was educated at the Bréguet school in Noisy-le-Grand, France.
In 1999, he joined the Mandrakesoft Research and Development team. He was known as the author of rpmlint, an RPM packages checker (similar to Debian's lintian program), and the maintainer of several core packages, including XFree86 and the initscripts. At that time he wrote an O'Reilly book on CVS (2000) and maintained the wacom tablet driver in XFree86 and in X.Org (2001). He then spent one year in Canada in the Mandrakesoft Montreal office, and became Mandrakesoft CTO when he came back to France in 2002.
Frédéric Lepied left Mandriva on February 3, 2006. He then joined Intel Corporation to manage Software manufacturers relationships. Late 2008, he joined Splitted Desktop Systems an innovative hardware company, as chief of strategy. In 2013, he became VP Software Engineering at eNovance before joining Red Hat in 2015.
References
Sources
1967 births
Living people
French computer scientists
Free software programmers
French computer programmers
French businesspeople
Mandriva Linux
Debian people
Intel people
Red Hat people
Red Hat employees
Emacs |
https://en.wikipedia.org/wiki/Tengen%20%28company%29 | Tengen Inc. was an American video game publisher and developer that was created by the arcade game manufacturer Atari Games for publishing computer and console games. It had a Japanese subsidiary named .
History
By 1984, Atari, Inc. had been split into two distinct companies. Atari Corporation was responsible for computer and console games and hardware and owned the rights to the Atari brand for these domains. Atari Games was formed from Atari, Inc.'s arcade division, and were able to use the Atari name on arcade releases but not on console or computer games. When Atari Games wanted to enter the console game market, it needed to create a new label that did not use the Atari name. The new subsidiary was dubbed Tengen, which in the Japanese nomenclature of the board game Go refers to the central point of the board (the word "Atari" comes from the same game).
At the time, Nintendo restricted their licensees to releasing only five games per year, mandated that Nintendo handle cartridge manufacturing, and required their games to be NES-exclusive for two years. Atari Games tried to negotiate for a less restrictive license to produce games for the Nintendo Entertainment System; Nintendo refused, so in December 1987, Atari Games agreed to Nintendo's standard licensing terms. Tengen was incorporated on December 21 of that year. In 1988, Tengen released its first and only three games licensed by Nintendo: R.B.I. Baseball, Pac-Man, and Gauntlet.
Meanwhile, Tengen secretly worked to bypass Nintendo's lock-out chip called 10NES that prevented unlicensed NES games from running. While numerous manufacturers managed to override this chip by zapping it with a voltage spike, Tengen engineers feared this could potentially damage NES consoles and expose them to unnecessary liability, and so they started development on a chip they called Rabbit. The other problem was that Nintendo made frequent modifications to the NES to prevent this technique from working. Instead, Tengen chose to reverse engineer the chip and decipher the code required to unlock it. However, the engineers were unable to do so, and the launch date for its first batch of games was rapidly approaching.
With time running short, Tengen turned to the United States Copyright Office. Its lawyers contacted the government office to request a copy of the Nintendo lock-out program, claiming that the company needed it for potential litigation against Nintendo. Once obtained, it used the program to create its own chip that would unlock the NES. Tengen announced that they were going to release their own cartridges in December 1988. When Tengen launched the unlicensed versions of its games, Nintendo immediately sued Tengen for copyright and patent infringement. This began a series of lawsuits between the companies which would not be settled until 1994.
Tengen faced another court challenge with Nintendo in 1989 in copyright controversy over the two companies' NES versions of Tetris. Tengen lost this suit as w |
https://en.wikipedia.org/wiki/Midland%20and%20Great%20Northern%20Joint%20Railway | The Midland and Great Northern Joint Railway (M&GNJR) was a railway network in England, in the area connecting southern Lincolnshire, the Isle of Ely and north Norfolk. It developed from several local independent concerns and was incorporated in 1893. It was jointly owned by the Midland Railway and the Great Northern Railway, and those companies had long sponsored and operated the predecessor companies.
The area directly served was agricultural and sparsely populated, but seaside holidays had developed and the M&GNJR ran many long-distance express trains to and from the territory of the parent companies, as well as summer local trains for holidaymakers. It had the longest mileage of any joint railway in the United Kingdom.
In the grouping of 1923, the two joint owners of the M&GNJR were absorbed into two separate companies (the Midland into the London, Midland and Scottish Railway and the Great Northern into the London and North Eastern Railway). The M&GNJR maintained a distinct identity which only formally ended with nationalisation in 1948. After 1945 the profitability of the network declined steeply, worsened by the seasonality of the business. It was duplicated by other lines and the decision was taken to close it. Most of the network closed in 1959, although some limited sections continued in use. Only a short section near Sheringham is in commercial use today, but the North Norfolk Railway is active as a heritage line.
First railways
The area eventually served by the Midland and Great Northern Joint Railway, taken as south Lincolnshire and north Norfolk, was late to be supplied with railway connections due to being sparsely-populated fenland. The Great Northern Railway (GNR), running north through Huntingdon, Peterborough and on to Grantham, so forming the western edge of the area, was not authorised until 1846 and not opened until 1848 between Peterborough and Lincoln. The Eastern Counties Railway (ECR), authorised in 1836, aspired to reach Norwich and Yarmouth, but ran out of money and stopped short.
In frustration local people obtained Parliamentary authority for the Yarmouth and Norwich Railway in 1842. Running via Reedham it opened to the public on 1 May 1844. In 1845 railway mania was underway, and a myriad of railway schemes was put before Parliament. Many of these foundered there, or were authorised but failed to generate investors' commitment.
By 1850 the ECR had recovered from its financial difficulties of 1836 and had connected practically every town of importance in East Anglia into its system. For some years the ECR had successfully resisted the promotion of independent railways in its area but this could not continue indefinitely, and some local lines began to obtain authorisation.
The East Anglian Railways company was an amalgamation of three earlier companies, the Lynn and Dereham Railway, the Lynn and Ely Railway and the Ely and Huntingdon Railway. The company became bankrupt early in 1851 and the GNR, operating the E |
https://en.wikipedia.org/wiki/Internet%20Haganah | Internet Haganah is a "global intelligence network dedicated to confronting Internet activities by Islamists and their supporters, enablers and apologists."
Internet Haganah also is an activist organization which attempts to convince businesses not to provide web-based services to such groups, and collects intelligence to store and pass on to government organizations. It was formed by Aaron Weisburd, an American computer programmer from Illinois, in 2002, and became part of a collection of private anti-terrorist web monitoring companies, including "Terrorism Research Center", "Search for International Terrorist Entities Institute", and "Northeast Intelligence Network". Weisburd is the only full-time employee of Internet Haganah, which is run primarily from his home office, with the help of many online associates.
The organization
Haganah is a Hebrew word meaning 'defense'. Haganah is also the name of the early Zionist militia originally formed to defend Jewish settlers in British Mandate Palestine, and which evolved into what is now the Israel Defense Forces.
There are two main parts to Internet Haganah:
A small, global band of researchers, consultants, analysts and translators, who "associate and collaborate with each other as necessitated by our common desire to do more than just watch Islamists as they use the Internet. We [Internet Haganah] share an understanding that a jihad, or holy war, has been declared against the West, and these jihadists need to be met on whatever field of battle they may appear."
The parent organization is The Society for Internet Research.
Operation
The organization says it has taken down more than 1,000 Jihad sites. Their success logo is a blue drawing of an AK-47.
To target websites perceived as threats, the organization relies upon its web community to find jihadists, and use a free "whois" service to determine if a US-based server hosts them. If so, as in the case of mawusat.com and its host Go Daddy, Internet Haganah operatives express concern about the nature of the site and ask the host to remove it. If this does not work and if the site concerns the US State Department's list of Foreign Terrorist Organizations, or the US Treasury's Office of Foreign Asset Control's list of Specially Designated Nationals and Blocked Persons, Internet Haganah contacts the banks and financiers of the host, who could face serious penalties for engaging in unreported transactions with the suspect website. If all else fails, the media may be contacted.
However, their targets often find countermeasures against these actions. In the case of GoDaddy.com and mawusat.com, the site was attacked, but appeared on a different server within a week. Newsweek reported:
It’s no coincidence, they argue, that in just the past year, Islamists have gotten savvier in their use of the Internet. In early 2004, Iraqi insurgent Abu Mussab al-Zarqawi and his group posted the video of the execution of Nicholas Berg, an American contractor wor |
https://en.wikipedia.org/wiki/Enterbrain | , formerly , is a Japanese publisher and division of Kadokawa Future Publishing founded on 30 January 1987 as . Magazines published by Enterbrain are generally focused on video games and computer entertainment as well as video game and strategy guides. In addition, the company publishes a small selection of anime artbooks. Enterbrain is based in Tokyo, Japan, with a paid-in capital of 410 million yen. Enterbrain's current president is Hirokazu Hamamura.
Enterbrain publications
B's LOG: Magazine focused on female gamers.
TECH Win DVD: A magazine aimed specifically to PC users. It comes with two CD-ROMs worth of goodies and information.
Tech Gian: A CD-ROM magazine focused on adult video games.
Magi-Cu: A seinen visual entertainment manga magazine based on female game characters.
Comic Beam: Comic Beam was formerly known as ASCII Comic. It is a seinen manga magazine filled with original manga.
Harta (formerly Fellows!): A periodical seinen manga magazine consisting of original manga stories.
Monthly Arcadia (月刊アーカディア): a 2000 monthly magazine focused on arcade game machines. It was started by former staff of (bi)monthly arcade game magazine Gamest (ゲーメスト) from 1986 which was published by Shinseisha, Ltd. Arcadia also has game hints and advice for the latest arcade games as well as high score reports from Japanese arcades.
Sarabure: A horse racing magazine.
Famitsu Connect!On: Magazine focused on online video games.
Logout Tabletalk RPG Series: Tabletop role-playing games.
Enterbrain software
RPG Maker: a role-playing game creation tool
Fighter Maker: a fighting games creation tool
Sim RPG Maker: a tactical RPG games creation tool
: a shoot-'em-up games creation tool
IG Maker: creates platformer, adventure, and shoot-'em-up games. Also supports creation of games for the Xbox 360 console.
Tabletop role-playing games
Alshard
Alshard GAIA
Blade of Arcana
: a Japanese superhero role-playing game set in modern Japan and includes elements of Japanese mythology such as yokais.
Night Wizard!
Star Legend
Tenra War
Terra the Gunslinger
Tokyo NOVA
Video games
Panzer Front (1999)
Tear Ring Saga (2001)
Palette (2001)
Galerians: Ash (2002)
Berwick Saga (2005)
KimiKiss (2006)
The Magician's Academy (2007)
Amagami (2009)
Earth Seeker (2011)
Photo Kano (2012)
Light novels
Enterbrain releases light novels under their Famitsu Bunko imprint, which was established in 1998 and is aimed at young adult males. They also publishes B's-LOG Bunko and B's-LOG Bunko Alice imprint focusing on girls and KCG Bunko focused on teens.
Enterbrain also publishes stand-alone series without any imprint such as Yōjo Senki or Overlord.
Anime Busou Chuugakusei: Basket Army (2012) – short anime and audio drama. Busou Chuugakusei'' is the first venture in Enterbrain's XXolution project, a multimedia initiative that will span manga, novels, anime, illustrations, scripts, music, and other fields.
See also
ASCII Media Works
Kadokawa Shoten
Ref |
https://en.wikipedia.org/wiki/Pigskin%20621%20A.D. | Pigskin 621 A.D. is an arcade game released in 1990 by Midway Manufacturing under the "Bally Midway" label. One player can battle the computer, or two players can battle head-to-head. Two teams compete to score as many touchdowns as possible in the tradition of American football, but actual play is more similar to rugby football.
A version for the Sega Genesis, retitled Pigskin Footbrawl and endorsed by coach Jerry Glanville, was released by Razor Soft on December 18, 1992.
Gameplay
The player directly controls one member of a five-man team, with the object of carrying a football over the opposing team's goal line. The playing area is littered with hazards such as pits, bushes and logs. A ball carrier who trips over any of these, or who is punched by an opponent, fumbles the ball. The field is also laden with weapons: axes, maces, nooses, scythes, spears, swords and torches. A player can pick up one of these by running over it. It will appear at the top of the screen next to the player's score as a "concealed weapon", several weapons may be carried at once and one may be carried over after a touchdown. The ball carrier can be "grappled", essentially a mass tackle into which multiple characters can jump. Having a concealed weapon as well as having more characters jump into the grapple greatly increases a team's chance of gaining or retaining possession, although weapons cannot be used if both team captains are in the grapple. A character who is injured by a concealed weapon is out of play until a touchdown is scored.
If one team gets too far behind in score in the second half of the game, a computer-controlled troll is added to the losing side to help even the odds, and behaves more aggressively than regular players. Additionally, the troll cannot be killed by weapons. Up to two trolls can be in play at a time during a standard game (one per side or two on one side). During a one player "Pro Pigskin" game, if the computer-controlled team continues to lose heavily even after a troll has been added or falls behind very quickly early on, an option for a "Troll Bowl" will appear. If selected the player will face an entire team of trolls with only human players on their own side.
Gameplay tips are given between periods and statistics are given at the end of the game. Statistics cover Goals Scored, Injuries Inflicted and Pigskin Possession Time. Before the game we can read about teams background. Both teams are renegades bands. The blue band is led by Thor Akenbak, and the red one's captain is Atilla DeSoil.
Scoring
A touchdown is worth six points, with a one-point bonus for keeping possession of the ball for longer than a minimum time. (Approximately 10 seconds)
It is possible to gain very high scores by eliminating most of the opposing team and then maintaining possession of the ball for as long as possible. Since a period can only end on a change of possession, a player can keep gaining single possession points well after the period clock has |
https://en.wikipedia.org/wiki/Codename%3A%20ICEMAN | Codename: ICEMAN (pronounced as "Iceman") is a graphical adventure game made with the SCI engine and published by the American computer game company Sierra On-Line in 1989. The lead designer was Jim Walls, who also created several Police Quest games. Mention of a "Codename: PHOENIX" in Sierra promotional material suggests that ICEMAN was meant to be the first part of a Codename series, but disappointing sales ended the would-be franchise after one game.
One of ICEMAN'''s most notable features is that a large portion of it takes place in a submarine; a portion of the game also requires the player to navigate the sub using an extremely scaled-down model.
Plot
The story takes place during a future global oil shortage, when Tunisia is suddenly discovered to possess a surplus of high-grade oil. While the Soviet and U.S. governments try to acquire as much of the oil as they can, Soviet-backed terrorists kidnap a U.S. ambassador in hopes of provoking an international incident.
Naval officer Johnny Westland is informed about the situation during his leave in Tahiti and is called back for the rescue mission. The night before returning to duty, he has a one-night stand with Stacy, a mysterious beautiful woman.
In the Pentagon, Westland is briefed and learns that Stacy is also an agent whom he must meet as soon as he reaches his goal. To reach his target, Westland travels in a nuclear-powered submarine, the USS Blackhawk. After fighting with Soviet vessels, navigating his way through an iceberg field and repairing some malfunctioning devices, he must penetrate the electronic harbor surveillance of Tunisia. A diving vehicle must be maneuvered through sensitive magnetic fields without being detected.
Finally, Westland meets Stacy on the shores of Tunisia. Working together, the agents free the ambassador; Westland is promoted and proposes to Stacy.
Gameplay and technical features
Technologically, ICEMAN is more advanced than Sierra's earlier games. Westland's movement is animated in eight directions instead of four, the character's sprite goes through several changes of appearance depending on his clothing, and character animations are generally smooth (e.g. the movements while playing dice.)
Another innovation allows the player to optionally just stand in front of an object and type , instead of trying several nouns to match the object. Also, typing causes Westland to turn towards the object in question.
On the other hand, the text parser understands only certain syntaxes. For example, while standing next to a ladder the program understands only , while similar games would also understand or just or . The feature of examining items with the right mouse button is implemented only for limited items on the screen. For the rest, the player must type .
Most puzzles in the game revolve around procedures, be they first aid, military or bureaucratic, that are usually outlined in the manual. Generally, if the player fails to follow a strict procedure (for |
https://en.wikipedia.org/wiki/CHBC-DT | CHBC-DT (channel 2) is a television station in Kelowna, British Columbia, Canada, part of the Global Television Network. It is owned and operated by network parent Corus Entertainment, and maintains studios on Leon Avenue (near Water Street) in Downtown Kelowna; its main transmitter is located near Lambly Creek Road in Central Okanagan.
Since the dismantling of the former E! television system and its switch to Global, CHBC has largely acted as a de facto semi-satellite of sister station CHAN-DT in Vancouver, airing the majority of its programming in pattern, but with evening newscasts covering the Okanagan region.
History
As a CBC affiliate
The station first signed on the air on September 21, 1957, originally operating as a CBC affiliate. Its signal covered the central Okanagan, broadcasting at 3,700 watts of power from its main studios and transmitter in Kelowna. The station was founded by three local radio stations: CKOV-AM (now CKQQ-FM) in Kelowna, CKOK (now CKOR) in Penticton and CJIB (now CKIZ-FM) in Vernon. Due to the mountainous terrain of the area, which impaired the primary signal in certain areas, the station began operating repeaters a few weeks later in Vernon (broadcasting on VHF channel 7, at 310 watts) and Penticton (broadcasting on VHF channel 13, at 300 watts). At the time of the station's sign-on, only 500 homes in the area had television receivers, but that amount rose to 10,000 the following year. The station had ordered two studio cameras, but due to the number of television stations that started up in North America during that period, the station had to make do with one camera on loan for a year until the order was filled. They also relied on 16 mm film, which was developed first by a local photo lab, and then again in-house.
All network programs were originally received on kinescope and 16 mm film, with regular programs airing on a week delay after their airing on CBC stations in other markets, with the National News airing on a day-behind basis. In 1960, the station began receiving programs from the CBC via its microwave link. Local programs and advertisements were produced live to air. Locally produced programs during the station's early days included Kids Bids, The Three R's, Romper Room, Let's Visit, Midday, Focus and Okanagan Magazine. In 1964, CHBC received its first videotape machine, which aided the production of local programming and commercials. Two years later, the station began airing programming in colour via the network, and the station gradually installed more equipment for colour production and transmission, as well as telecine and videotape.
In the late 1960s, CHBC and fellow CBC affiliate CFJC-TV in Kamloops formed BCI-TV (standing for British Columbia Interior Television), an internal company headed by CHBC for programming and sales of the combined Okanagan/Kamloops markets. The national sales were delegated to All Canada Sales, which provided advertising sales for both stations as a single unit unde |
https://en.wikipedia.org/wiki/The%20Powerpuff%20Girls%20Movie | The Powerpuff Girls Movie is a 2002 American animated superhero comedy film based on the Cartoon Network animated television series The Powerpuff Girls. It was co-written and directed by series' creator Craig McCracken (in his directorial debut), co-written by Charlie Bean, Lauren Faust, Paul Rudish, and Don Shank, and stars the regular television cast of Catherine Cavadini, Tara Strong, E. G. Daily, Roger L. Jackson, Tom Kane, Tom Kenny, Jennifer Hale, and Jennifer Martin. The film serves as a prequel to the series, and tells the origin story of how the Powerpuff Girls were created and came to be the defenders of Townsville and how Mojo Jojo became a supervillain.
Produced by Cartoon Network Studios as its first theatrical film, and the first theatrical film to be based on a Cartoon Network series, The Powerpuff Girls Movie was released in theaters on July 3, 2002, by Warner Bros. Pictures. Despite positive reviews from critics, the film was a commercial failure, earning $16 million worldwide on the budget of $11 million.
Plot
In the crime and injustice-riddled city of Townsville, Professor Utonium mixes sugar, spice and everything nice, hoping to produce the "perfect little girls" to improve Townsville. However, his laboratory assistant, the destructive chimpanzee Jojo, shoves him, causing him to accidentally break and spill a flask of Chemical X onto the concoction. The experiment succeeds, producing three little girls whom the Professor names Blossom, Bubbles, and Buttercup. He also discovers that the girls have gained superpowers from the added Chemical X. Despite the girls' recklessness with their powers, they all immediately grow to love each other as a family.
On their first day of school, the girls learn about the game of tag and begin to play it among themselves, which quickly grows destructive once they use their powers. The girls take their game downtown, where they accidentally cause damage to the city until the Professor calms them down. That night, the Professor tells the girls to not use their powers in public anymore. The next day, the citizens of Townsville treat the girls as outcasts due to their destructive behavior, and the Professor is arrested for creating the girls, which forces the girls to try to make their way home from school on foot. After a while, they become lost in an alleyway, where the Gangreen Gang attacks them. Jojo, who has become superintelligent due to the Chemical X explosion mutating his brain, rescues the trio.
Jojo gains the girls' sympathy by convincing them that he is also hated for his powers and tricks them into helping him build a laboratory and a machine powered by Chemical X, which he claims will earn them the public's affections. Afterward, Jojo rewards them with a trip to the local zoo, where he secretly implants small transportation devices on all the primates there. That night, Jojo brings the primates to his lab and uses his new machine to inject them with Chemical X, which turns them in |
https://en.wikipedia.org/wiki/Vienna%20U-Bahn | The Vienna U-Bahn (), where U-Bahn is an abbreviation of the German word Untergrundbahn (), is a rapid transit system serving Vienna, Austria. The five-line network consists of of route, serving 109 stations. It is the backbone of what the International Association of Public Transport (UITP) deemed one of the best-performing public transport systems worldwide in 2009. 459.8 million passengers rode the U-Bahn in 2019. The network is undergoing expansion and rolling stock renewal. Since 1969, 200 million euros have been invested annually in the extension of the Vienna U-Bahn.
The modern-day U-Bahn opened on 25 February 1978, after test operations that began on 8 May 1976. Parts of two of the lines, designated U4 and U6, date back to the Stadtbahn ("city railway") system, which opened in 1898. Parts of the U2 and U6 lines began as subway tunnels built to accommodate earlier tram lines. Only the U1 and U3 were built wholly as new subway lines.
Lines are designated by a number and the prefix "U" (for U-Bahn) and identified on station signage and related literature by a colour. There are five lines; U1, U2, U3, U4 and U6. Since the late 1960s there have been numerous suggestions of routings for a line U5, but all these projects had been shelved until the construction of a new U5 was announced in early 2014. Stations are often named after streets, public spaces, or districts, and in some special cases after prominent buildings at or near the station. The policy of the Wiener Linien, however, states that they prefer not to name stations after buildings.
Ticketing for the network is integrated under the (VOR) along with other means of public transport in Vienna, including trams and buses. Local tickets are valid on S-Bahn suburban rail services and other train services but those are operated by the state railway operator, ÖBB. Tickets are not valid on bus services operated by Vienna Airport Lines or the City Airport Train express train.
U-Bahn network
With the September 2017 opening of the , five-station extension of the U1 line, the five-line U-Bahn network consists of of route, serving 109 stations. Further extensions of the Vienna U-Bahn are scheduled to be completed in the 2020’s, finally creating the missing line U5. Upon completion of the U5 and U2 projects, there will then be a network that is long with 116 stations. Some plans have been proposed for the system beyond 2027, when the U2/U5 project is completed, although such plans are currently unfunded.
U-Bahn services run between 05:00 and around 01:00 at intervals between two and five minutes during the day and up to eight minutes after 20:00. Since 4 September 2010, there has been 24-hour service operating at 15-minute intervals on Friday and Saturday evenings, and on evenings prior to a public holiday. The 24-hour U-Bahn is supplemented on these nights by the Vienna NightLine bus service.
Stations
Map
History and projected expansions
Planning for an underground railway in Vienna ca |
https://en.wikipedia.org/wiki/Bob%20Truel | Bob Truel is a computer programmer. He met Rich Skrenta in ninth grade in Mt. Lebanon, Pennsylvania and has since co-founded several Internet ventures with him and others, including DMOZ with Bryn Dole, Chris Tolles, and Jeremy Wenokur in 1998, Newhoo in 1998, Topix.net with Tom and Michael Markson in 2002, and search engine blekko with Michael Markson and Bryn Dole in 2007.
References
Computer programmers
Living people
DMOZ
Year of birth missing (living people)
Place of birth missing (living people) |
https://en.wikipedia.org/wiki/The%20Bard%27s%20Tale%20III%3A%20Thief%20of%20Fate | The Bard's Tale III: Thief of Fate is a computer fantasy role-playing video game created by Interplay Productions in 1988. It is the second sequel to The Bard's Tale. It was designed by Rebecca Heineman, Bruce Schlickbernd, and Michael A. Stackpole. The game was released for the Amiga, Apple II (64k), Commodore 64, and DOS.
Story
The player characters receive a letter from a dying man who informs them that, during a celebration of your defeat of the evil wizard Mangar, his true master—the Mad God Tarjan—arrived and unleashed foul creatures that destroyed the town of Skara Brae. The box cover states it thus:
Skara Brae is in ruins. Roscoe's Energy Emporium stands vacant. The Equipment Shoppe went under so quickly Garth was crushed. Your Bard hasn't stopped whimpering since he realized all the taverns were closed.... Someone—or some thing—has sealed the city's fate with an evil so vast, so unspeakable, that a host of Paladins and an army of Archmages are out-matched. Hard times call for subtlety. Smaller is better. Sneakier is better. What the world needs now is a thief. The Thief of Fate.
The game begins in a refugee camp outside the ruined Skara Brae, which replaces the now-destroyed adventurer's guild from the previous games. Besides the city ruins, the wilderness features a temple for healing, a tavern, and a number of special locations from where the party will embark on missions to other worlds over the course of their quest.
Skara Brae was scaled down considerably. The ruins are 16x16 map tiles instead of the city's 30x30 layout from The Bard's Tale I, though its layout remains recognizable. In the ruins of the Review Board, an old man—the sole survivor—directs the party to first kill one Brilhasti ap Tarj, a servant of the mad god Tarjan, in the "Mad God" dungeon below Skara Brae, a startup quest for the characters to attain power, which can be ignored if powerful characters were carried over from previous games. Next, the old man orders the party to retrieve artifacts from several other worlds and also teaches the group the chronomancer spells to be used at certain points in the wilderness to travel to these parallel dimensions and back:
Arboria (from Twilight Copse): Pleasant elf realm including the city of Ciera Brannia. They have to bring back the hero Valarian or get Valarian's Bow and the Arrows of Life. It turns out Valarian is long since dead and buried in a sacred grove with the items. The king will only allow the party to enter the grove if they first kill the local villain Tslotha Garnath with the Nightspear that can be obtained from Valarian's Tower. In Arboria, the party meets the warrior Hawkslayer for the first time, though he recalls meeting them before (a hint at the fact that the party is travelling not only between dimensions but also across time in their quest).
Gelidia (from Cold Peak): The party is next tasked to bring Lanatir or, if they cannot convince him to come, Lanatir's Sphere and the Wand of Power back from |
https://en.wikipedia.org/wiki/Dockapps | Dockapps, or docked applications are computer programs which appear to reside inside an icon rather than a window in graphical computer systems, normally in a part of the user interface known as the dock. Their display is constantly updated just like a windowed application, but appears inside a small (64x64 pixel) icon.
This makes dockapps particularly suitable for monitoring things in the background, and some applications of dockapps are:
Displaying CPU usage
Displaying computer temperatures
Displaying network or disk-usage statistics
Displaying clocks, calendars, moon phases, or weather reports
See also
Dock (computing)
External links
dockapps.net - a central repository for many dockapps
xdock - an application that emulates Window Maker docks in any window manager
Desktop environments |
https://en.wikipedia.org/wiki/WINGs%20Display%20Manager | In computing, the WINGs Display Manager (WDM) is a display manager for the X window system, mainly used for graphically logging in, on a Unix-based system.
WINGs is a modification of XDM, XFree86's original display manager.
It uses a Window Maker-style interface to present a graphical login screen. It uses the WINGs widget toolkit.
See also
Other display managers
External links
WDM homepage
GitHub repository
X display managers |
https://en.wikipedia.org/wiki/NeuRFon | The neuRFon project (named for a combination of "neuron" and "RF") was a research program begun in 1999 at Motorola Labs to develop ad hoc wireless networking for wireless sensor network applications. The biological analogy was that, while individual neurons were not very useful, in a large network they became very powerful; the same was thought to hold true for simple, low power wireless devices. Much of the technology developed in the neuRFon program was placed in the IEEE 802.15.4 standard and in the Zigbee specification; examples are the 2.4 GHz physical layer of the IEEE 802.15.4 standard and significant portions of the Zigbee multi-hop routing protocol.
References
External links
IEEE 802.15.4
ZigBee Alliance
Wireless sensor network |
https://en.wikipedia.org/wiki/All%27s%20Fair%20in%20Oven%20War | "All's Fair in Oven War" is the second episode of the sixteenth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on November 14, 2004. In the episode, Marge gets her kitchen remodeled and the dishes she makes inside it get rave reviews. The suggestion of Ned Flanders leads her to enter a cooking contest. However, Marge realizes the competition is harder than it seems. Meanwhile, Bart finds Homer's vintage Playdude magazines and decides to adopt the lifestyle he sees within the articles.
Matt Selman wrote the episode, and Mark Kirkland served as director. Thomas Pynchon and James Caan guest starred as themselves. The episode features cultural references to songs such as "Separate Ways", "Boplicity", and "Take Five", as well as references to the film The Godfather and various fictional food mascots. The episode received positive reviews from critics.
Plot
Discovering that the house next to theirs is up for sale, Homer and Marge marvel at its extensive kitchen. Marge asks Homer to hire a contractor to upgrade their kitchen, but Homer decides to save money by doing the job himself. His ineptitude leads Marge to hire a contractor; the upgrade ultimately takes two years and costs the family $100,000. The first dish that Marge cooks in the completed kitchen earns rave reviews from many Springfieldians, as well as author Thomas Pynchon.
While shopping at the Kwik-E-Mart, Marge learns that the Ovenfresh company is sponsoring a baking contest in which the grand prize winner will become Auntie Ovenfresh, the company's spokeswoman. Encouraged by Ned Flanders, she enters her recipe for a dessert styled as hot dogs and is accepted. Angered at the other contestants' mockery and sabotage of her food, Marge secretly taints theirs with Maggie's ear medicine to ruin the taste. Lisa sees Marge cheat and confronts her, but Marge defends herself by saying that the others bullied her into it.
Marge reaches the finals, competing against Brandine Spuckler, and considers cheating again. She changes her mind after finding a note from Lisa, admits her wrongdoing, and withdraws from the contest, restoring Lisa's faith in her. Brandine becomes the new Auntie Ovenfresh and leaves her husband Cletus for James Caan. Cletus' friends ambush Caan at a tollbooth and shoot him repeatedly, reminiscent of the death of Sonny Corleone, Caan's character in the film The Godfather. He survives the shooting and angrily says that he will fly instead of drive the next time he needs to travel.
Meanwhile, Homer finds his old stash of Playdude magazines while trying to remodel the kitchen, but throws them away after Marge cuts out all the nude pictures. Bart and Milhouse find the magazines in the trash and, after reading them, decide to remodel their treehouse and adopt the lifestyle espoused in the articles. They develop an interest in luxurious living and jazz music and begin speaking in sexual innuendos without |
https://en.wikipedia.org/wiki/Metatable | A metatable is the section of a database or other data holding structure that is designated to hold data that will act as source code or metadata. In most cases, specific software has been written to read the data from the metatables and perform different actions depending on the data it finds.
See also
Magic number (programming)
Virtual method table
External links
Binding With Metatable And Closures
Metadata
Programming constructs
Software architecture |
https://en.wikipedia.org/wiki/CNN%20Center | The CNN Center in Atlanta, Georgia, is the international headquarters of the Cable News Network (CNN). The main newsrooms and studios for several of CNN's news channels are located in the building. The facility's commercial office space is occupied by various units of the former Turner Broadcasting System, now part of Warner Bros. Discovery. The CNN Center is located in downtown Atlanta adjacent to Centennial Olympic Park. The One CNN Center office building was acquired by CP Group in 2021.
History
1970s and 1980s
The building now occupied by the CNN Center opened in 1976 as the Omni Complex, a development by Cousins Properties. The Omni Coliseum, an NBA and NHL arena directly connected to the Omni Complex, had opened three years earlier, on October 14, 1972. The Omni Complex office building was largely vacant until CNN moved its headquarters there in 1987 from its Midtown Atlanta site (old home of the Progressive Club on 1050 Techwood Drive and home to Turner Broadcasting System).
Over the years, the building had provided office space to various business tenants, as well as foreign consulates. The main floor featured an indoor ice rink, as well as a small number of restaurants and a Gold Mine video arcade. Sid and Marty Krofft built an indoor amusement park called The World of Sid and Marty Krofft, inspired by the creations of these popular children's television producers. Opened in 1976, it was the first indoor theme park in the United States, but it closed within six months. The complex also featured a multi-screen movie theater. For years, the theater offered daily showings of the 1939 film Gone with the Wind, which Ted Turner called "The greatest movie ever made".
1990s
On May 11, 1997, the Omni Coliseum closed. Its replacement, Philips Arena (now State Farm Arena), broke ground on June 5, 1997. The Omni Coliseum was imploded on July 26, 1997, with the CNN Center taking on minor exterior window damage due to its close distance to the Omni Coliseum. Because of this, the CNN Center was expected to be damaged. Philips Arena opened on September 18, 1999.
2000s
On April 4, 2007, Arthur Mann, an employee at the Omni Hotel, shot and severely injured his ex-girlfriend Clara Riddles inside the CNN center. The adjacent CNN.com newsroom was evacuated shortly after the first shots were heard. Mann was confronted and shot by a Turner Security Officer, and both Riddles and Mann were taken to a nearby hospital for treatment. Riddles later died of her injuries. An autopsy showed that Riddles was shot three times by Mann. The motive of the shooting is unknown.
On March 14, 2008, an EF-2 tornado passed through downtown Atlanta, damaging the CNN Center and leaving water and dust in the upper floors. The ceiling of the atrium was also damaged, allowing water to pour in and partially flood the food court. CNN's library was damaged, although it was not immediately known how much of its archives were damaged. Numerous injuries and widespread damage were r |
https://en.wikipedia.org/wiki/Ottawa%20Citizen | The Ottawa Citizen is an English-language daily newspaper owned by Postmedia Network in Ottawa, Ontario, Canada.
History
Established as The Bytown Packet in 1845 by William Harris, it was renamed the Citizen in 1851. The newspaper's original motto, which has recently been returned to the editorial page, was Fair play and Day-Light.
The paper has been through a number of owners. In 1846, Harris sold the paper to John Bell and Henry J. Friel. Robert Bell bought the paper in 1849. In 1877, Charles Herbert Mackintosh, the editor under Robert Bell, became publisher. In 1879, it became one of several papers owned by the Southam family. It remained under Southam until the chain was purchased by Conrad Black's Hollinger Inc. In 2000, Black sold most of his Canadian holdings, including the flagship National Post to CanWest Global.
The editorial view of the Citizen has varied with its ownership, taking a reform, anti-Tory position under Harris and a conservative position under Bell. As part of Southam, it moved to the left, supporting the Liberals largely in opposition to the Progressive Conservative Party's support of free trade in the late 1980s. Under Black, it moved to the right and became a supporter of the Reform Party. In 2002, its publisher Russell Mills was dismissed following the publication of a story critical of Prime Minister Jean Chrétien and an editorial calling for Chrétien's resignation. It endorsed the Conservative Party of Canada in the 2006 federal election.
It published its last Sunday edition on July 15, 2012. The move cut 20 newsroom jobs, and was part of a series of changes made by Postmedia.
The pre-2014 logo depicted the top of the Peace Tower of the city's Parliament Buildings. In 2014, the newspaper adopted a new logo showing the paper's name over an outline of the Peace Tower roof on a green background.
Circulation
Like most Canadian daily newspapers, the Ottawa Citizen has seen a decline in circulation in recent years. Its total circulation dropped by percent to 91,796 copies daily from 2009 to 2015.
Daily average
Sections
Daily
News
World
City
Sports
Arts
Business
Weekly
Food
Driving
Technology
Homes & Condos
Notable people
Scott Keir Anderson
Robert Bell
Conrad Black
Peter Calamai (1943–2019), editorial pages editor
Randall Denley
Bob Ferguson (1931–2014), sports journalist and writer
Henry J. Friel
Terry Glavin
Charles Gordon
John Honderich
Kelvin Kirk
Eddie MacCabe (1927–1998), journalist, sports editor and writer
Roy MacGregor
Charles Herbert Mackintosh
Russell Mills
George Matheson Murray
Gerry Nott
Andrew Potter
Jane Taber
James Travers
See also
List of newspapers in Canada
References
Sources
Adam, Mohammed. (January 2, 2005). "When we began 1845: For 160 years, the Citizen has been the 'heartbeat of the community". Ottawa Citizen.
DDC 71.1. LCC PN4907.
External links
Official mobile version
Canadian Newspaper Association
The Ottawa Citizen Birth Ma |
https://en.wikipedia.org/wiki/Roll-away%20computer | A roll-away computer is an idea introduced as part of a series by Toshiba in 2000, which aimed to predict the trends in personal computing five years into the future. Since its announcement, the roll-away computer has remained a theoretical device.
A roll-away computer is a computer with a flexible polymer-based display technology, measuring 1 mm thick and weighing around 200 grams.
Flexible and rollable displays started entering the market in 2006 (see electronic paper).
The R&D department of Seiko Epson has demonstrated a flexible active-matrix LCD panel (including the pixel thin film transistors and the peripheral TFT drivers), a flexible active-matrix OLED panel, the world's first flexible 8-bit asynchronous CPU (ACT11)—which uses the world's first flexible SRAM.
University of Tokyo researchers have demonstrated flexible flash memory.
LG Corporation has demonstrated an 18-inch high-definition video display panel that can roll up into a 3 cm diameter tube.
See also
Tablet PC
Roll-up keyboard
References
External links
http://www.toshiba-europe.com/computers/tnt/visions2000/7/
"Foldable, Stretchable Circuits" by Kate Greene 2008
Classes of computers |
https://en.wikipedia.org/wiki/Locomotives%20of%20the%20Southern%20Railway | The Southern Railway took a key role in expanding the 660 V DC third rail electrified network begun by the London & South Western Railway. As a result of this, and its smaller operating area, its steam locomotive stock was the smallest of the 'Big Four' companies.
For an explanation of numbering and classification, see British Rail locomotive and multiple unit numbering and classification.
Background
Post-nationalisation
British Railways completed construction of the 'West Country' and 'Merchant Navy' locomotive designs but did not build any further orders. It abandoned the 'Leader' class experiments, and Bulleid left the UK to carry forward his unusual locomotive designs in Ireland.
Withdrawal
Withdrawal of ex-SR locomotives happened mainly towards the end of steam on the Southern Region (in 1967), the pre-Grouping designs having gone before then as electrification spread across the region.
Locomotives of SR design
With the heavy emphasis on electrification for the London suburban area and the Brighton mainline, there was little need for new steam locomotive designs. The main steam tasks were boat trains (Dover, Folkestone and Newhaven), West of England, Kent services and freight. When designing steam locomotives, the designers had some interesting constraints that dictated where the locomotive could be used. Due to the hangover from SE&CR days, most of the lines in Kent were of fairly light construction and would not take the weight of a modern express locomotive until well into the 1930s. Hence the extensive rebuilding (and new construction) of 4-4-0 designs at a time when other lines were busily building Pacifics or heavy 4-6-0s.
The ex-SER lines also had the problem of the narrow Mountfield and Wadhurst tunnels on the Hastings line, requiring locomotive and rolling stock rather narrower than permitted elsewhere. This problem persisted into British Railways days until eventually the tunnels were single tracked, giving clearance for normal stock.
Services for west of Southampton and Salisbury had a different set of problems as neither the Southern Railway nor its constituents installed water troughs, thus leading to large tenders with greater water capacity than those fitted to similar locomotives on other railways.
New designs were:
Richard E. L. Maunsell (1923–1937)
Maunsell also rebuilt, modified or continued the new construction of earlier classes
LSWR H15 class – Further production
LSWR N15 class – Further production
LSWR S15 class – Further production
LSWR M7 class – One superheated – not repeated
LSWR T9 class – Superheated
LSWR 700 class – Superheated
SECR B1 class
SECR D class as D1 class
SECR O class – rebuilt as O1 class
SECR N class – Further production
SECR N1 class – Three-cylinder derivative of N class
LB&SCR C2 class
LB&SCR L class 4-6-4T – rebuilt as 4–6–0 SR N15X class
LB&SCR E1 class 0-6-0T – rebuilt as 0-6-2T SR E1/R class
LB&SCR I1 class – rebuilt as I1X class
O.V.S. Bulleid (1937–1949)
Bullei |
https://en.wikipedia.org/wiki/WABM | WABM (channel 68) is a television station in Birmingham, Alabama, United States, affiliated with MyNetworkTV. It is owned by Sinclair Broadcast Group alongside Homewood-licensed CW affiliate WTTO (channel 21) and low-power ABC affiliate WBMA-LD (channel 58); Sinclair also operates Bessemer-licensed WDBB (channel 17), which serves as a full satellite station of WTTO, under a local marketing agreement (LMA) with Sinclair partner company Cunningham Broadcasting. However, Sinclair effectively owns WDBB as the majority of Cunningham's stock is owned by the family of deceased group founder Julian Smith.
WABM, WBMA-LD and WTTO share studios at the Riverchase office park on Concourse Parkway in Hoover (with a Birmingham mailing address); WABM's transmitter is located at the American General candelabra tower on Red Mountain (near Interstate 65) in southwestern Birmingham.
History
As an independent station
The station first signed on the air on January 31, 1986, as WCAJ, originally operating as a religious independent station. Some of the initial programs that were featured on the station consisted of Catholic programs from the Irondale-based Eternal Word Television Network (EWTN), as well as programming from the Southern Baptist Convention-owned American Christian Television System (ACTS); it initially also carried secular comedy, drama and western programming on weekday afternoons and evenings. Its original studio facilities were located on the campus of Samford University.
After the Trinity Broadcasting Network signed on WTJP-TV (channel 60) in Gadsden that July, WCAJ's viewership declined significantly and the station was never able to recover for the remainder of its tenure as a religious outlet. By early 1987, WCAJ converted to a schedule consisting entirely of Christian programming. Eventually by that fall, the station added home shopping programming and infomercials to fill part of its schedule, while retaining some religious programs, which were relegated to mornings and late evenings; in 1990, the home shopping and infomercial programming was removed from the lineup, at which time the station reverted to an entirely religious schedule.
In 1990, the station was sold to Krypton Broadcasting, which changed its call letters to WABM and reformatted it into a general entertainment independent in January 1991; the reformatted lineup featured a mix of classic movies, dramas, and westerns. However, the station struggled at first against Fox affiliate WDBB (channel 17, now a CW affiliate) and its Gadsden-based satellite WNAL-TV (channel 44, now Ion Television affiliate WPXH-TV) and the market's leading independent station, WTTO (channel 21, also now a CW affiliate).
Although the Birmingham market essentially covered three separate markets (including Tuscaloosa and Anniston–Gadsden), it was not nearly large enough population-wise at the time for what were essentially three independent stations, and there simply was not enough first-run syndicated and |
https://en.wikipedia.org/wiki/Advice%20%28programming%29 | In aspect and functional programming, advice describes a class of functions which modify other functions when the latter are run; it is a certain function, method or procedure that is to be applied at a given join point of a program.
Use
The practical use of advice functions is generally to modify or otherwise extend the behavior of functions which cannot be easily modified or extended. The Emacspeak Emacs-addon makes extensive use of advice: it must modify thousands of existing Emacs modules and functions such that it can produce audio output for the blind corresponding to the visual presentation, but it would be infeasible to copy all of them and redefine them to produce audio output in addition to their normal outputs; so, the Emacspeak programmers define advice functions which run before and after.
Another Emacs example; suppose after one corrected a misspelled word through ispell, one wanted to re-spellcheck the entire buffer. ispell-word offers no such functionality, even if the spellchecked word is used a thousand times. One could track down the definition of ispell-word, copy it into one's Emacs, and write the additional functionality, but this is tedious, prone to broken-ness (the Emacs version will get out of sync with the actual Ispell Elisp module, if it even works out of its home). What one wants is fairly simple: just to run another command after ispell-word runs. Using advice functions, it can be done as simply as this:
(defadvice ispell (after advice)
(flyspell-buffer))
(ad-activate 'ispell t)
Implementations
A form of advices were part of C with Classes in the late 1970s and early 1980s, namely functions called call and return defined in a class, which were called before (respectively, after) member functions of the class. However, these were dropped from C++.
Advices are part of the Common Lisp Object System (CLOS), as :before, :after, and :around methods, which are combined with the primary method under "standard method combination".
Common Lisp implementations provide advice functionality (in addition to the standard method combination for CLOS) as extensions. LispWorks supports advising functions, macros and CLOS methods.
EmacsLisp added advice-related code in version 19.28, 1994.
History
The following is taken from a discussion at the mailing list aosd-discuss. Pascal Costanza contributed the following:
The term "advice" goes back to the term advising as introduced by Warren Teitelman in his PhD thesis in 1966. Here is a quote from Chapter 3 of his thesis:
Advising is the basic innovation in the model, and in the PILOT system. Advising consists of inserting new procedures at any or all of the entry or exit points to a particular procedure (or class of procedures). The procedures inserted are called "advice procedures" or simply "advice".
Since each piece of advice is itself a procedure, it has its own entries and exits. In particular, this means that the execution of advice can cause the procedure that it |
https://en.wikipedia.org/wiki/Pascal%20Costanza | Pascal Costanza is a research scientist at the ExaScience Lab at Intel Belgium. He is known in the field of functional programming in LISP as well as in the aspect-oriented programming (AOP) community for contributions to this field by applying AOP through Lisp1. More recently, he has developed Context-oriented programming, with Robert Hirschfeld.
His past involvements include specification and implementation of the languages Gilgul and Lava, and the design and application of the JMangler framework for load-time transformation of Java class files. He has also implemented ContextL, the first programming language extension for Context-oriented Programming based on CLOS, and aspect-oriented extensions for CLOS. He is furthermore the initiator and lead of Closer, an open source project that provides a compatibility layer for the CLOS MOP across multiple Common Lisp implementations. He has also co-organized numerous workshops on Unanticipated Software Evolution, Aspect-Oriented Programming, Object Technology for Ambient Intelligence, Lisp, and redefinition of computing. He has a Ph.D. degree from the University of Bonn, Germany.
Notes
Dynamically Scoped Functions as the Essence of AOP OOP 2003 Workshop on Object-Oriented Language Engineering for the Post-Java Era, Darmstadt, Germany, July 22, 2003; published in ACM SIGPLAN Notices Volume 38, Issue 8 (August 2003), ACM Press
Bibliography
JMangler-A Powerful Back-End for Aspect-Oriented Programming (with Günter Kniesel and Michael Austermann), Chapter 15 of Aspect-Oriented Software Development by Robert E. Filman, Tzilla Elrad, Siobhán Clarke, and Mehmet Aksit, Addison-Wesley, 2005,
Full bibliography (DBLP, University of Trier)
External links
Home page
A Highly Opinionated Guide to Lisp
AspectL A library of Aspect-oriented programming extensions for Common Lisp.
Context-oriented Programming
Living people
German computer scientists
University of Bonn alumni
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/WBMA-LD | WBMA-LD (channel 58) is a low-power television station in Birmingham, Alabama, United States, affiliated with ABC. It is owned by Sinclair Broadcast Group alongside MyNetworkTV affiliate WABM (channel 68) and Homewood-licensed CW affiliate WTTO (channel 21); Sinclair also operates Bessemer-licensed WDBB (channel 17), which serves as a full satellite station of WTTO, under a local marketing agreement (LMA) with Sinclair partner company Cunningham Broadcasting. However, Sinclair effectively owns WDBB as the majority of Cunningham's stock is owned by the family of deceased group founder Julian Smith.
WBMA-LD, WABM and WTTO share studios at the Riverchase office park on Concourse Parkway in Hoover (with a Birmingham mailing address); WBMA-LD's transmitter is located atop Red Mountain (near the Tarpley City neighborhood) in southwestern Birmingham.
WBMA transmits a low-power signal, which even in digital effectively limits its over-the-air radius to Birmingham proper and nearby areas in Jefferson, Tuscaloosa, Walker, Bibb and Shelby counties. Because of this, the station's programming is simulcast on the digital subchannels of three other Central Alabama stations that act as full-power relays—including those of WABM and WDBB—in order to reach the entire Birmingham–Tuscaloosa–Anniston market.
The station's brand name, "ABC 33/40", is derived from the two stations that formerly operated as full-power satellites of WBMA to distribute its programming to southwestern and northeastern areas of central Alabama from the station's acquisition of the ABC affiliation in September 1996 until October 2014, WCFT-TV (channel 33) in Tuscaloosa and WJSU-TV (channel 40) in Anniston, which now respectively operate as Heroes & Icons affiliates WSES and WGWW (the latter of which simulcasts WBMA-LD on its second subchannel through a time brokerage agreement with Sinclair partner company and current owner of the two stations, Howard Stirk Holdings). The moniker remains in use largely due to its continued carriage over channel assignments originally given to its ex-satellites—and now assigned to its subchannel relays—on multichannel television providers throughout Central Alabama outside of Greater Birmingham (primarily non-cable-based services like the IPTV-based U-verse, and satellite providers DirecTV and Dish Network).
History
Early history and formation of trimulcast with WCFT-TV and WJSU-TV
On May 5, 1994, Great American Communications (which would be renamed Citicasters following the completion of its debt restructuring later that year) agreed to sell Birmingham's longtime ABC affiliate, WBRC-TV (channel 6), and three of its sister stations (fellow ABC affiliate WGHP in High Point, North Carolina, NBC affiliate WDAF-TV in Kansas City, and CBS affiliate KSAZ-TV in Phoenix) to New World Communications for $350 million in cash and $10 million in share warrants. As part of a broader deal between New World and the Fox Broadcasting Company signed on May 23 of that year |
https://en.wikipedia.org/wiki/WBRC | WBRC (channel 6) is a television station in Birmingham, Alabama, United States, affiliated with the Fox network. It is owned by Gray Television alongside low-power, Class A Telemundo affiliate WTBM-CD (channel 24). The two stations studios atop Red Mountain (between Vulcan Trail and Valley View Drive) in southeastern Birmingham, where WBRC's transmitter is also located.
History
Early history
The station first signed on the air on July 1, 1949, originally broadcasting on VHF channel 4 as WBRC-TV (standing for Bell Radio Company, after Fountain Heights physician J. C. Bell, founder of radio station WBRC (960 AM, now WERC). the "-TV" suffix was dropped from the call sign in June 1999). Although WBRC-TV was the first television station in Birmingham to be granted a license by the Federal Communications Commission (FCC), it is the second-oldest television station in Alabama, signing on just over one month after WAFM-TV (channel 13, now WVTM-TV), which debuted on May 29. It was originally owned by the Birmingham Broadcasting Company, run by Eloise D. Hanna, along with WBRC radio. Hanna's first husband, M. D. Smith, had bought WBRC radio from Bell in 1928. Her son, M. D. Smith III, who worked at the radio stations in advertising sales and was later promoted to program director and vice president, ran the television station as its operations manager. His son, M. D. Smith IV later organized Smith Broadcasting, which purchased WAFG-TV, Channel 31 in Huntsville, Alabama in 1963, with himself as operations manager. The call letters were immediately changed to WAAY-TV. M. D. Smith III is also named a remote general manager of WAAY-TV from Birmingham.
Originally broadcasting for three hours per day, it operated as a primary NBC affiliate (earning the affiliation as a result of WBRC radio's longtime affiliation with the NBC Red Network), and also carried secondary affiliations with ABC and the DuMont Television Network; during the late 1950s, the station was also briefly affiliated with the NTA Film Network. WBRC-TV originally operated from WBRC radio's facilities on 19th Street and 2nd Avenue, near downtown Birmingham, which originally only housed business and master control operations; the station originally relied mainly on network and film content for much of the programming it broadcast. The station's transmitter was originally purposed as the transmitter facilities for radio station WBRC-FM (102.5, now WBPT at 106.9 FM; original frequency now occupied by WDXB), which signed on in 1947 with the highest radiated power of any radio station worldwide, operating at 500,000 watts; after the FM station suspended operations in June 1948 due to continued revenue losses due to the lack of radios equipped with FM tuners, Hanna borrowed $150,000 to build a new studio facility and transmitter atop Red Mountain for the television station. In September 1950, WBRC established a coaxial cable link with fellow NBC-DuMont affiliate WRGB (now a CBS affiliate) in Schenect |
https://en.wikipedia.org/wiki/Markov%20blanket | In statistics and machine learning, when one wants to infer a random variable with a set of variables, usually a subset is enough, and other variables are useless. Such a subset that contains all the useful information is called a Markov blanket. If a Markov blanket is minimal, meaning that it cannot drop any variable without losing information, it is called a Markov boundary. Identifying a Markov blanket or a Markov boundary helps to extract useful features. The terms of Markov blanket and Markov boundary were coined by Judea Pearl in 1988. A Markov blanket can be constituted by a set of Markov chains.
Markov blanket
A Markov blanket of a random variable in a random variable set is any subset of , conditioned on which other variables are independent with :
It means that contains at least all the information one needs to infer , where the variables in are redundant.
In general, a given Markov blanket is not unique. Any set in that contains a Markov blanket is also a Markov blanket itself. Specifically, is a Markov blanket of in .
Markov boundary
A Markov boundary of in is a subset of , that itself is a Markov blanket of , but any proper subset of is not a Markov blanket of . In other words, a Markov boundary is a minimal Markov blanket.
The Markov boundary of a node in a Bayesian network is the set of nodes composed of 's parents, 's children, and 's children's other parents. In a Markov random field, the Markov boundary for a node is the set of its neighboring nodes. In a dependency network, the Markov boundary for a node is the set of its parents.
Uniqueness of Markov boundary
The Markov boundary always exists. Under some mild conditions, the Markov boundary is unique. However, for most practical and theoretical scenarios multiple Markov boundaries may provide alternative solutions. When there are multiple Markov boundaries, quantities measuring causal effect could fail.
See also
Andrey Markov
Free energy minimisation
Moral graph
Separation of concerns
Causality
Causal inference
Notes
Bayesian networks
Markov networks |
https://en.wikipedia.org/wiki/Causal%20Markov%20condition | The Markov condition, sometimes called the Markov assumption, is an assumption made in Bayesian probability theory, that every node in a Bayesian network is conditionally independent of its nondescendants, given its parents. Stated loosely, it is assumed that a node has no bearing on nodes which do not descend from it. In a DAG, this local Markov condition is equivalent to the global Markov condition, which states that d-separations in the graph also correspond to conditional independence relations. This also means that a node is conditionally independent of the entire network, given its Markov blanket.
The related Causal Markov (CM) condition states that, conditional on the set of all its direct causes, a node is independent of all variables which are not effects or direct causes of that node. In the event that the structure of a Bayesian network accurately depicts causality, the two conditions are equivalent. However, a network may accurately embody the Markov condition without depicting causality, in which case it should not be assumed to embody the causal Markov condition.
Motivation
Statisticians are enormously interested in the ways in which certain events and variables are connected. The precise notion of what constitutes a cause and effect is necessary to understand the connections between them. The central idea behind the philosophical study of causation is that causes raise the probabilities of their effects, all else being equal.
A deterministic interpretation of causation means that if A causes B, then A must always be followed by B. In this sense, smoking does not cause cancer because some smokers never develop cancer.
On the other hand, a probabilistic interpretation simply means that causes raise the probability of their effects. In this sense, changes in meteorological readings associated with a storm do cause that storm, since they raise its probability. (However, simply looking at a barometer does not change the probability of the storm, for a more detailed analysis, see:).
Implications
Dependence and Causation
It follows from the definition that if X and Y are in V and are probabilistically dependent, then either X causes Y, Y causes X, or X and Y are both effects of some common cause Z in V. This definition was seminally introduced by Hans Reichenbach as the Common Cause Principle (CCP)
Screening
It once again follows from the definition that the parents of X screen X from other "indirect causes" of X (parents of Parents(X)) and other effects of Parents(X) which are not also effects of X.
Examples
In a simple view, releasing one's hand from a hammer causes the hammer to fall. However, doing so in outer space does not produce the same outcome, calling into question if releasing one's fingers from a hammer always causes it to fall.
A causal graph could be created to acknowledge that both the presence of gravity and the release of the hammer contribute to its falling. However, it would be very surprising if the |
https://en.wikipedia.org/wiki/Hopfield%20network | A Hopfield network (Ising model of a neural network or Ising–Lenz–Little model or Amari-Little-Hopfield network,) is a form of recurrent artificial neural network and a type of spin glass system popularised by John Hopfield in 1982 as described by Shun'ichi Amari in 1972
and by Little in 1974 based on Ernst Ising's work with Wilhelm Lenz on the Ising model. Hopfield networks serve as content-addressable ("associative") memory systems with binary threshold nodes, or with continuous variables. Hopfield networks also provide a model for understanding human memory.
Origins
The Ising model of a recurrent neural network as a learning memory model was first proposed by Shun'ichi Amari in 1972 and then by in 1974, who was acknowledged by Hopfield in his 1982 paper. Networks with continuous dynamics were developed by Hopfield in his 1984 paper. A major advance in memory storage capacity was developed by Krotov and Hopfield in 2016 through a change in network dynamics and energy function. This idea was further extended by Demircigil and collaborators in 2017. The continuous dynamics of large memory capacity models was developed in a series of papers between 2016 and 2020. Large memory storage capacity Hopfield Networks are now called Dense Associative Memories or modern Hopfield networks.
Structure
The units in Hopfield nets are binary threshold units, i.e. the units only take on two different values for their states, and the value is determined by whether or not the unit's input exceeds its threshold . Discrete Hopfield nets describe relationships between binary (firing or not-firing) neurons . At a certain time, the state of the neural net is described by a vector , which records which neurons are firing in a binary word of bits.
The interactions between neurons have units that usually take on values of 1 or −1, and this convention will be used throughout this article. However, other literature might use units that take values of 0 and 1. These interactions are "learned" via Hebb's law of association, such that, for a certain state and distinct nodes
but .
(Note that the Hebbian learning rule takes the form when the units assume values in .)
Once the network is trained, no longer evolve. If a new state of neurons is introduced to the neural network, the net acts on neurons such that
if
if
where is the threshold value of the i'th neuron (often taken to be 0). In this way, Hopfield networks have the ability to "remember" states stored in the interaction matrix, because if a new state is subjected to the interaction matrix, each neuron will change until it matches the original state (see the Updates section below).
The connections in a Hopfield net typically have the following restrictions:
(no unit has a connection with itself)
(connections are symmetric)
The constraint that weights are symmetric guarantees that the energy function decreases monotonically while following the activation rules. A network with asymmet |
https://en.wikipedia.org/wiki/Melbourne%20tram%20route%20109 | Melbourne tram route 109 is operated by Yarra Trams on the Melbourne tram network from Box Hill to Port Melbourne. The 19.3 kilometre route is operated out of Kew depot with A and C class trams.
History
The origins of route 109 lie in separate tram lines, a cable tram from Spencer Street to the Yarra River, a horse tram from the Yarra River to Kew Cemetery, an electric line from Kew Junction to Box Hill (extended over the years), as well as the Port Melbourne railway line.
A cable line was opened by the Melbourne Tramway & Omnibus Company from Spencer Street to Brunswick Street along Collins Street, MacArthur Street, Gisborne Street and Victoria Parade on 2 October 1886, and extended to the west side of the Yarra River along Victoria Parade and Victoria Street on 22 November 1886. A connecting horse tram was built from the east side of the Yarra River to Kew Cemetery, along Barkers Road, High Street South and High Street, opening on 28 December 1887.
The Prahran & Malvern Tramways Trust (PMTT) opened a line from High Street to Burke Road along Cotham Road on 30 May 1913. On 1 November 1914 the PMTT received permission to convert the horse tram line to electric traction, and the new electric line was opened on 24 February 1915. The PMTT extended the Cotham Road line to Union Road, Mont Albert along Whitehorse Road, on 30 September 1916.
In 1929 the Melbourne & Metropolitan Tramways Board (MMTB) started converting the Collins Street cable lines to electric traction, with the last cable tram running down Collins Street on 14 September 1929, and the first electric tram on 8 December 1929. At the same time the MMTB built a new electric line down the centre of Victoria Parade to replace the cable line, which opened on 15 September 1929. For the next six decades the Melbourne to Mont Albert tram was numbered 42, celebrated by a 1982 theatrical production, Storming Mont Albert by Tram, which was performed on a specially-chartered Route 42 tram from the Mont Albert terminus to the city and return.
On 21 December 1987, route 111 commenced running from Exhibition (Carlton Gardens) at Nicholson Street to Port Melbourne along Bourke Street, Spencer Street and the former Port Melbourne railway line, following the conversion of the railway (along with the St Kilda line) to light rail. The broad gauge track was re-gauged to standard gauge and the overhead voltage was reduced from 1500 V DC to 600 V DC with light rail platforms built adjacent to or near the former stations platforms.
On 19 December 1993, routes 42 and 111 were combined as route 109. Route 42 continued to run as a peak-hour variant of route 109, and from 18 November 2002, the route deviated from route 109 and ran between Box Hill and the Collins Street West extension in Docklands.. From 28 June 2004 until 21 November 2005, the route was truncated back to Spencer Street while Spencer Street station (now Southern Cross station) was redeveloped. It was extended further along the Collins Stree |
https://en.wikipedia.org/wiki/FOCAL%20%28programming%20language%29 | FOCAL (acronym for Formulating On-line Calculations in Algebraic Language, or FOrmula CALculator) is an interactive interpreted programming language based on JOSS and mostly used on Digital Equipment Corporation (DEC) Programmed Data Processor (PDP) series machines.
JOSS was designed to be a simple interactive language to allow programs to be easily written by non-programmers. FOCAL is very similar to JOSS in the commands it supports and the general syntax of the language. It differs in that many of JOSS' advanced features like ranges and user-defined functions were removed to simplify the parser. Some of the reserved words (keywords) were renamed so that they all start with a unique first letter. This allows users to type in programs using one-character statements, further reducing memory needs. This was an important consideration on the PDP-8, which was often limited to a few kilobytes (KB).
Like JOSS, and later BASICs, FOCAL on the PDP-8 was a complete environment that included a line editor, an interpreter, and input/output routines. The package as a whole was named FOCAL-8, which also ran on the PDP-5 and PDP-12. When ported to the PDP-11, the resulting FOCAL-11 relied on the underlying operating system, RT-11, to provide file support and editing. The language definition was updated twice, to FOCAL-69 and a very slightly modified FOCAL-71. A port to the Intel 8080 was also available.
FOCAL is notable as the language in which the original versions of the early video games Hamurabi and Lunar Lander were written. Both were later ported to BASIC, where they became much better known. FOCAL was not popular outside the PDP platform and largely disappeared during the move to the VAX-11. It had a strong revival in the Soviet Union where PDP-11 clones were used as educational and home computers (BK series).
History
JOSS
JOSS was released in May 1963 on the one-off JOHNNIAC computer at RAND Corporation. In RAND, use grew rapidly, and the machine, originally built in 1953, quickly ran out of capability. JOHNNIAC was decommissioned in 1966 and JOSS was reimplemented on a newly purchased PDP-6, Digital Equipment Corporation's (DEC) first "big" machine. Use continued to grow and by 1970, the system was being used by 500 to 600 users across the country and had spawned several innovations such as mobile computer terminals that could be wheeled from room to room and plugged in for quick access.
JOSS was highly influential. It emerged just as time-sharing was being introduced. There was significant interest in man-machine interaction and computers were seeing wider use. Whereas most time-sharing operating systems of the era concentrated on user account and file management, leaving the users to do their own programming, JOSS provided file editing and a programming language in one package. RAND showed the system to a parade of people in the industry.
FOCAL
The PDP-6 was DEC's first mainframe, and JOSS took full advantage of its power and memory capacity |
https://en.wikipedia.org/wiki/Webmin | Webmin is a web-based server management control panel for Unix-like systems. Webmin allows the user to configure operating system internals, such as users, disk quotas, services and configuration files, as well as modify and control open-source apps, such as BIND, Apache HTTP Server, PHP, and MySQL.
History
Webmin, written by Jamie Cameron, was first released as version 0.1 in October 1997. Its basic concept of being a web-based administration interface has remained constant since its first release.
It was originally written during the time that Cameron administered a DNS server and needed an easy-to-use interface to allow users to make changes to the DNS records without giving them root access to the server. Over time, various themes, a dashboard that displays CPU, RAM, and disk space usage with visual gauges, and a sidebar with a search function were also added.
Financial support for the Webmin project came from the Linux distribution companies Caldera and MSC Linux, as well as many user contributions of code patches, hundreds of modules, language translations, and user suggestions.
In 2019, a backdoor was discovered which would allow a remote attacker to execute malicious commands with root privileges on the machine running Webmin. This backdoor exploit was present on versions 1.882-1.921, when a network admin would enable the password expiration policy. Developers of Webmin believed that the backdoor being introduced was the result of a malicious injection to the code via the online source code repository SourceForge.
Since its release, the Webmin user interface, its appearance, and its many features have changed dramatically using code that has been completely rewritten over the subsequent versions.This includes the overhaul brought by Webmin 2.0, which enforced strict HTTP Strict Transport Security policy for SSL, and gave options to users upgrading from older versions.
General description
Webmin is largely based on Perl, running as its own process and web server. It defaults to TCP port 10000 for communicating, and can be configured to use SSL if OpenSSL is installed with additional required Perl modules. Webmin is built around over 110 standard modules, which have an interface to the configuration files and the Webmin server, which makes it simple to add new functionality. Due to Webmin's modular design, it is possible for anyone who is interested to write plugins for desktop configuration. Webmin allows for controlling many machines through a single interface, or seamless login on other Webmin hosts on the same subnet or LAN.
Webmin is primarily coded by Australian Jamie Cameron and released under the BSD license.
If a plugin for certain tasks is not available, it is possible to open a terminal and perform various task through a command line interface (CLI). This is especially useful if using SSH (or similar) is not an option.
Inclusion in distributions
While Webmin was included in the official repositories of some Linux di |
https://en.wikipedia.org/wiki/Brassia | Brassia is a genus of orchids classified in the subtribe Oncidiinae. It is native to Mexico, Central America, the West Indies, and northern South America, with one species (B. caudata) extending into Florida.
The genus was named after William Brass, a British botanist and illustrator, who collected plants in Africa under the supervision of Sir Joseph Banks. Its abbreviation in the horticultural trade is Brs.
Description
Brassia species and its popular hybrids are common in cultivation, and are notable for the characteristic long and spreading tepals (in some clones longer than 50 cm), which lend them the common name spider orchid. The grex Eternal Wind is a recipient of the Royal Horticultural Society's Award of Garden Merit.
This epiphytic genus occurs in wet forests from sea level to altitudes under 1500 m, with the Peruvian Andes as its center of diversity. Occurrence is mostly restricted to a certain area, but Brassia caudata can be found over the whole geographic area.
They have large elliptic-oblong pseudobulbs with one or two leaves at the apex, lateral, unbranched many-flowered inflorescences with small floral bracts. The lip is not attached to the column. The pollinarium shows a narrow stipe. There are two distichous, foliaceous sheaths around the base, from which the inflorescence emerges.
Brassia has a very specific method for pollination; it uses entomophily - pollination by insects - and in this case specifically by female spider-hunter wasps of the genera Pepsis and Campsomeris. Mistaken by the mimicry of Brassia, the wasp stings the lip, while trying to grasp its prey without any success. By these movements the wasp comes into contact with the pollinarium, that then sticks to its head. By flying to another Brassia flower, this flower gets pollinated.
List of species
, Plants of the World Online accepted the following species:
Brassia allenii L.O.Williams ex C.Schweinf. – Honduras, Panama
Brassia andina (Rchb.f.) M.W.Chase – Colombia, Ecuador, Peru
Brassia andreettae (Dodson) Senghas – Ecuador
Brassia angusta Lindl. – Venezuela, Guyana, northern Brazil
Brassia angustilabia Schltr. – Panama, Brazil (Amazonas)
Brassia arachnoidea Barb.Rodr. – Rio de Janeiro
Brassia arcuigera Rchb.f. – Honduras, Costa Rica, Panama, Colombia, Venezuela, Ecuador, Peru
Brassia aurantiaca (Lindl.) M.W.Chase – Colombia, Venezuela, Ecuador
Brassia aurorae D.E.Benn. – Peru
Brassia bennettiorum (Dodson) Senghas – Peru
Brassia bidens Lindl. – Venezuela, Guyana, northern Brazil
Brassia bowmanni (Rchb.f.) M.W.Chase – Colombia
Brassia brachypus Rchb.f. – Ecuador, Peru, Bolivia
Brassia brevis (Kraenzl.) M.W.Chase – Colombia, Ecuador
Brassia brunnea Archila – Guatemala
Brassia caudata (L.) Lindl. – Mexico, Central America, Florida, Greater Antilles, Trinidad, northern South America
Brassia cauliformis C.Schweinf. – Peru
Brassia chloroleuca Barb.Rodr. – Guyana, French Guiana, Brazil
Brassia chlorops Endrés & Rchb.f. – Nicaragua, Costa Rica, Panama
Bra |
https://en.wikipedia.org/wiki/Add-on |
Software
Plug-in (computing), a piece of software which enhances another software application and usually cannot be run independently.
Browser extension, which modifies the interface and/or behavior of web browsers
Add-on (Mozilla), a piece of software that enhances and customizes Mozilla-based applications
Expansion pack, an add-on for a video game
Hardware
Peripheral, an optional computer hardware component that supplements or enhances the functionality of the original unit
Video game accessory, a piece of hardware used in conjunction with a video game console for playing video games
Other
An extension to a house
Addon, a person named in the Hebrew bible
An adjuvant therapy, an add-on therapy to existing treatment
See also
Plug-in (disambiguation) |
https://en.wikipedia.org/wiki/Canadian%20Forces%20Radio%20and%20Television | Canadian Forces Radio and Television (CFRT), Radiotélévision des Forces canadiennes (RTFC) in French, was a television and radio network system broadcast by satellite to those members of the Canadian Forces ground forces who served overseas in places such as the Middle East, Africa and Europe and, due to popular demand, the service began broadcasting to Her Majesty's Canadian Ships in April 2002. The network was not available domestically within Canada.
The network consisted of two separate feeds, one for each of Canada's official languages, English and French, sourcing programming from the CBC/Radio-Canada, and commercial networks such as CTV and TVA.
On February 5, 2014, CFRT announced it would cease operations in April 2014. The closure was due to a reduction of Canadian military personnel serving overseas and budget cuts by the Canadian government, as well as advancements in other avenues of television and radio broadcasting. The final broadcast ended April 1, 2014, at 00:00 EST.
Broadcasts to Canadian forces in Europe began in 1951. The Canadian Forces Network (CFN), or Reseau des Forces Canadiennes (RFC), made radio broadcasts from Brunssum, the Netherlands from 1978 until September 30, 2014, to Brunssum, Ramstein Air Base and Lahr (Baden-Württemberg) in Germany and Supreme Headquarters Allied Powers Europe (SHAPE) in Casteau, Belgium. CFN Europe was broadcast on the Astra 1A satellite, until its decommissioning in December 2004, and later on the Eutelsat 9A satellite.
The network kept Canadian military personnel overseas in touch with Canada and Canadian defence news. In countries where telephone service is difficult, families could send broadcast messages to soldiers abroad through an 800 number.
An earlier Canadian Forces Network was established and operated by the Canadian Broadcasting Corporation in 1945 for Canadian troops in England following the closure of the BBC Allied Expeditionary Forces Programme which had included shows for Canadian military personnel. The station, which transmitted programs to Canadian Forces stationed in Europe after World War II, was established with the cooperation of the Canadian Broadcasting Corporation and the BBC and augmented broadcasts by the CBC International Service on shortwave from Canada.
See also
American Forces Network
British Forces Broadcasting Service
Israel Army Radio
References
External links
CFN TV Lahr, Germany, Station Identification, probably late 1980s
CFN Radio Europe, Last hour before final shutdown, 30 September 2014
Defunct television networks in Canada
Defunct Canadian radio networks
Defunct broadcasting companies of Canada
1951 establishments in Canada
Radio stations established in 1951
Radio stations disestablished in 2014
Television channels and stations disestablished in 2014
Military of Canada
Military broadcasting
2014 disestablishments in Canada |
https://en.wikipedia.org/wiki/Association%20for%20Supply%20Chain%20Management | The Association for Supply Chain Management (ASCM) is a not-for-profit international educational organization offering certification programs, training tools, and networking opportunities to increase workplace performance. Formed in 1957, it was originally known as the "American Production and Inventory Control Society" or APICS. The mission of the organization is to advance end-to-end supply chain management. APICS merged with the Supply-Chain Council in 2014, and the American Society of Transportation and Logistics in 2015.
History
In 1957, 20 production control managers in various industries formed the American Production and Inventory Control Society. The organization later became an international association known as APICS. The organization offers certification programs, training tools, and networking opportunities for the purpose of increasing workplace performance in the supply chain.
The Supply-Chain Council (SCC) merged into APICS on 5 August 2014. APICS also merged with the American Society of Transportation and Logistics (AST&L) in 2015.
The historical Supply-Chain Council
The Supply-Chain Council (SCC) formed in 1996 as an independent non-profit organization by industry research firm AMR Research (AMR) and consulting firm Pitiglio, Rabin, Todd and McGrath (PRTM), with membership made up of by a variety of industries, including manufacturing, service, distribution, and retailing. The original mission was to define a common language to describe and model supply chains. SCC developed the Supply-Chain Operations Reference (SCOR)-model process for chain management. The original framework for the SCOR model was developed in a collaboration between AMR and PRTM and vetted with industry-leading companies including Intel, IBM, Rockwell Semiconductor, and Procter and Gamble. The original model was designed describe supply chains in four basic processes: Plan, Source, Make and Deliver. The Return process was added later to accommodate remanufacturing industries and eCommerce.
Certifications
APICS historically offered several professional designations: CPIM, CSCP, and CLTD. Under ASCM, additional certificate programs are being created including The Supply Chain Procurement Certificate (SCPC) and The Supply Chain Warehousing Certificate (SCWC).
CPIM
The "APICS Certified in Production and Inventory Management" or "APICS CPIM" designation is a professional certification offered by APICS. The program was founded in 1973. Since its inception, more than 100,000 people have earned the APICS CPIM designation. APICS CPIM designees learn terminology, concepts, and strategies related to demand management, procurement and supplier planning, material requirements planning, capacity requirements planning, sales and operations planning, master scheduling, performance measurements, supplier relationships, quality control, and continuous improvement.
CSCP
The APICS Certified Supply Chain Professional, or APICS CSCP, demonstrates professional knowledge an |
https://en.wikipedia.org/wiki/Vilnius%20BASIC | Vilnius BASIC, sometimes known as BK BASIC, is a dialect of the BASIC programming language running on the Elektronika BK-0010-01/BK-0011M and UKNC computers. It was developed at Vilnius University, located in Lithuania which was a republic of the Soviet Union at the time.
In contrast to most microcomputer dialects of BASIC of the era, which were interpreters, Vilnius BASIC was a compile and go language that compiled the source when the user entered the RUN command. It was otherwise similar to GW-BASIC and MSX BASIC in style and most features, although it lacked some of the multimedia commands found in MSX. One oddity was that it did not allow more than one statement on a single line, a feature normally implemented using the colon. It also lacked the ability to open more than one data file at a time.
Only the UKNC version had a full-screen editor, versions of the 0010 series machines used a line editor. Machine-dependent features, like graphics operators, parameters, and PEEK/POKE addresses were also different among the machines.
Description
Program editing
In contrast to most BASIC dialects of the era, Vilnius BASIC was a compile and go system, not an interpreter. When the user types , the compiler reads the code and produces a threaded code executable that it then ran. Nevertheless, this detail was largely invisible to the user, as the system still allowed statements to be typed in without a line number for direct (immediate) mode, or with a number for indirect mode in which case the new line was added to the program or replaced the same-numbered line if it already existed.
By the late 1970s, most microcomputer dialects offered a full-screen editor, in which the user can use the cursor keys to move around the program and type changes into any visible line of code. The Electronica systems were emulating an PDP-11, machines that had been built in the era before cursor-addressable computer terminals were widely available and thus retain the older line editor style. In these systems, a prompt is displayed that allows the user to type in one line of code, or recall a previously typed line and then edit it in-place.
Commands and statements
The list of keywords supported in Vilnius can be separated into two groups, those that can only be used in direct mode, and those that can be direct or indirect.
The former, known as commands, included the common . load and save programs to cassette tape. turned on automatic line number entry, renumbered the lines in the current program, and deleted ranges of lines using the same "to" format as LIST, for instance, would delete everything from the start of the program up to an including line 200.
Vilnius' primitives were similar to other BASICs of the era, and supported most of the elementary statements like . In contrast to most dialects, Vilnius did not allow more than one statement per line.
Numeric variables, operators and functions
As with most dialects, variable names had to start with a letter an |
https://en.wikipedia.org/wiki/Blackbaud | Blackbaud is a cloud computing provider that serves the social good community—nonprofits, foundations, corporations, education institutions, healthcare organizations, religious organizations, and individual change agents. Its products focus on fundraising, website management, CRM, analytics, financial management, ticketing, and education administration.
Blackbaud's flagship product is a fundraising SQL database software, Raiser's Edge. Revenue from the sale of Raiser's Edge and related services accounted for thirty percent of Blackbaud's total revenue in 2012. Other products and services include Blackbaud Enterprise CRM, Altru, Financial Edge, Education Edge, Blackbaud NetCommunity, , Luminate Online, Luminate CRM, Friends Asking Friends. In addition, Blackbaud offers consultancy services to nonprofit organizations.
Blackbaud was founded in 1981 by Anthony Bakker. The company is headquartered in Charleston, South Carolina. Blackbaud went to a remote-first approach for employees in 2021, closing all of its regional offices while keeping its Charleston headquarters.
Michael Gianoni is Blackbaud's CEO.
History
Blackbaud's history traces back to 1981, when Blackbaud founder Anthony Bakker developed a computerized billing system for the Nightingale-Bamford School in Manhattan, New York City. By 1982, Bakker's expanded client list allowed him to quit his day job as a banker, and he incorporated Blackbaud Microsystems. Bakker's new company was headquartered in New York City. Blackbaud's first product was Student Billing, an accounts receivable system geared toward private grade schools. The company's flagship product, The Raiser's Edge, was developed from its Student Billing product.
The company had 75 employees in 1989, when it decided to relocate from New York City due to high operational costs. Blackbaud relocated to Mount Pleasant, South Carolina, with the help of a $750,000 business loan. Of the company's original 75 employees, 30 remained in a support and training office in New York City and 15 relocated to Blackbaud's new South Carolina headquarters. In 1992, the company outgrew its Mount Pleasant headquarters and relocated to North Charleston, South Carolina.
In 1994, Blackbaud converted its software offerings from DOS to Windows 95. This decision led to a sales increase from $19 million in 1995 to $26 million in 1996. During this time Blackbaud acquired multiple DOS-based competitors, including ACOMS of Burlington, Massachusetts; Master Systems Inc. of Pinole, California; and Blackbaud's "chief challenger", Master Software of Indianapolis, Indiana. Blackbaud's acquisition of Master Software doubled its customer base.
Blackbaud began using value-added resellers in 1998, which further expanded the company's customer base. In 2000, Robert Sywolski became CEO of Blackbaud. Sywolski had previously served as CEO of North American operations for Cap Gemini, an international consulting firm.
Blackbaud successfully completed its initial public o |
https://en.wikipedia.org/wiki/List%20of%20ZX80%20and%20ZX81%20clones | The following is a list of clones of Sinclair Research's ZX80 and ZX81 home computers:
ZX80
MicroAce (1980, US)
Microdigital TK80 (1981, Brazil)
Nova Electrônica/Prológica NE-Z80 (1981, Brazil)
ZX81
Official clones
Timex Sinclair T/S 1000 (a ZX81 with the same circuit board from the same factory, but with a 2K x 8 RAM chip instead of 1K. This is typically a U.S. model, with a VHF NTSC RF modulator and slightly improved RF shielding, but are the same BASIC machine)
Timex Sinclair T/S 1500 (a ZX81 in a ZX Spectrum like case)
Lambda Electronics Lambda 8300 (a 1983 clone, also branded as PC 8300, DEF 3000, Basic 2000, Marathon 32K, Tonel PC, Unisonic Futura 8300, PC-81 Personal Computer, CAC-3, Polybrain P118, Creon Electronics Power 3000 or NF300 jiaoXueDianNao)
Brazilian clones
Microdigital TK82 (ZX80 case, 1981)
Microdigital TK82C (smaller case and 2K RAM, 1981)
Microdigital TK83 (same case as original, but golden instead of black, 1982)
Microdigital TK85 (ZX Spectrum case and 16K or 48K RAM, 1983)
Prológica CP-200 (inverted video and larger case, 1982)
Prologica CP200S
cdSE Microcomputadores Apply 300
Ritas do Brasil Ringo R470 (1983)
Nova Electrônica/Prológica NE-Z8000 (1982)
Engebrás AS-1000 (1984)
Argentinean clones
Czerweny CZ 1000 (1985)
Czerweny CZ 1500 (1985)
Czerweny CZ 1000 Plus (1986)
Czerweny CZ 1500 Plus (1986)
South Korean clones
Samsung SPC-300
GoldStar FC-30
Boeun Peek PC-1000 (Timex Sinclair 1000 compatible, 1983)
Modern clones
In recent years retrocomputing enthusiasts created various clones or recreations of the ZX80/ZX81.
ZX81+38
ZX80/ZX81 Double Clone and related ZX80/ZX81 Project
ZX97
Minstrel
Wilco/Baffa's one
TELLAB TL801, an Italian clone designed in 2002 that can emulate both the ZX80 or ZX81. Selection between machines is made via a jumper.
References
External links
Planet Sinclair: Computers: Clones and Variants
Sinclair Nostalgia Products — Sinclair Clones
ZX80 and ZX81 clones
Lists of computer hardware
Sinclair ZX80 clones
Sinclair ZX81 clones
ZX80 |
https://en.wikipedia.org/wiki/List%20of%20ZX%20Spectrum%20clones | The following is a list of clones of Sinclair Research's ZX Spectrum home computer. This list includes both official clones (from Timex Corporation) and many unofficial clones, most of which were produced in Eastern Bloc countries. The list does not include computers which require additional hardware or software to become ZX-compatible.
Many software emulators can fully or partially emulate some clones as well.
Official
The only official clones of the Spectrum were made by Timex. There were three models developed, only two of which were released:
Timex Sinclair 2068
The Timex Sinclair 2068 or T/S 2068 (also known as TC 2068 or UK 2086) was a significantly more sophisticated machine than the original Spectrum. The most notable changes were the addition of a cartridge port, an AY-3-8912 sound chip, and an improved ULA giving access to better graphics modes. The T/S 2068 was produced for consumers in the United States, while very similar machines were marketed in Portugal and Poland as the Timex Computer 2068 (TC 2068) and Unipolbrit Komputer 2086 (UK 2086) respectively. A small number of TC 2068s were also sold in Poland.
Timex Computer 2048
The Timex Computer 2048 or TC 2048 was a similar machine to the Spectrum 48K, but with the improved ULA from the TC 2068 (allowing access to the improved graphics modes), Kempston joystick port, and composite video output. Marketed only in Portugal and Poland.
Timex Sinclair 2048
The Timex Sinclair 2048 or T/S 2048 was a never-released variant of the T/S 2068 with 16 KB of RAM.
Inves Spectrum +
A clone of the ZX Spectrum+ developed by Investrónica in Spain in 1986, the Inves Spectrum + was based on the work developed by the company on the ZX Spectrum 128. Released just after Amstrad bought Sinclair Research Ltd, it looked much like a regular ZX Spectrum+, but all the internal components were redesigned. As the ROM was also modified, it has compatibility problems with some games – notably Bombjack, Commando, and Top Gun. A Kempston joystick port was fitted on the rear of the machine.
Due to Invéstronica being the distributor of Sinclair's products in Spain, and because Amstrad already had its own exclusive distributor in Spain (Indescomp, later bought by Amstrad itself), Amstrad sued Investrónica in 1987 to cease sales of the computer. The court agreed with Amstrad, but the decision was not issued until 1991, when the computer was discontinued, as the 8-bit computer market in Spain was succeeded by 16-bit computers.
Decibells dB Spectrum+
The Decibells dB Spectrum+ was an official clone of the ZX Spectrum+ for the Indian market, introduced in 1988 by Deci Bells Electronics Limited, selling over 50000 units and achieving an 80% market share.
Unofficial
British
Harlequin
A British clone of the 48K ZX Spectrum, Harlequin was designed and developed by Chris Smith, to aid the reverse engineering of the ZX Spectrum custom ULA chip, and its research documentation. Completed in 2008, it is the first |
https://en.wikipedia.org/wiki/List%20of%20Sinclair%20QL%20clones | The following is a list of clones of Sinclair Research's Sinclair QL microcomputer:
Sandy QLT / Futura (only produced in prototype form)
CST Thor series (Thor 1 / Thor 20 / Thor XVI)
Qubbesoft Aurora (a replacement QL motherboard)
Peter Graf's Qx0 series of motherboards: Q40, Q40i and Q60
The following hardware devices provided QL compatibility for other computer platforms:
Futura Datasenter QL Emulator for the Atari ST
Jochen Merz's QVME card for the Atari MEGA STE and Atari TT
Miracle Systems QXL and QXL II cards for PC compatibles
The ICL One Per Desk (also sold as the BT Merlin Tonto or the Telecom Australia Computerphone) shared some hardware components with the QL but was not intended to be software-compatible.
In addition, several software emulators of the QL exist including QPC, uQLX, QLay and Q-emuLator.
References
Computer hardware clones
Computing-related lists
Sinclair QL clones |
https://en.wikipedia.org/wiki/Computronium | Computronium is a material hypothesized by Norman Margolus and Tommaso Toffoli of MIT in 1991 to be used as "programmable matter", a substrate for computer modeling of virtually any real object.
It also refers to an arrangement of matter that is the best possible form of computing device for that amount of matter. In this context, the term can refer both to a theoretically perfect arrangement of hypothetical materials that would have been developed using nanotechnology at the molecular, atomic, or subatomic level (in which case this interpretation of computronium could be unobtainium), and to the best possible achievable form using currently available and used computational materials.
According to the Barrow scale, a modified variant of the Kardashev scale created by British physicist John D. Barrow, which is intended to categorize the development stage of extraterrestrial civilizations, it would be conceivable that advanced civilizations do not claim more and more space and resources, but optimize their already available space increasingly, for example by building a matrioshka brain consisting of several layers of computronium around their star.
In the 2010 film The Singularity Is Near: A True Story About the Future, American futurist Ray Kurzweil discusses a universe filled with computronium. He believes this could be possible as early as the late 22nd century and would be accomplished by sending intelligent nanobots through the universe faster than light, e.g. by using wormholes. According to him, such an endeavor would have the potential to prevent the natural ending of the universe.
In addition, the term computronium is used in connection with science fiction narratives.
See also
Limits of computation
Molecular scale electronics
Molecular electronics
Computon
References
Fictional computers
Fictional materials
Hypothetical technology |
https://en.wikipedia.org/wiki/P2 | P2, P02, P.2, or P-2 might refer to several subjects:
Technology
P2 (storage media), a "Professional Plug-in" solid state data storage technology employed by Panasonic
DSC-P2, a Sony Cyber-shot P series camera model
Honda P2, a 1996 Honda P series of robots, an ASIMO predecessor
Intel 80286, 2nd generation processor architecture
Pentium II, 6th generation Intel central processing unit
Samsung P2, a 2007 flash memory based Yepp portable media player
P2 audio connector, see Phone connector (audio)
Science
Bacteriophage P2, a temperate phage of the family Myoviridae that infects E. coli
P2 laboratory, biosafety-level-2 laboratory
P2 receptor, a purinergic and pyrimidinergic cell surface receptor
P2, a pulmonic valve closure sound
Nix (moon) (former designation P2), a moon of Pluto
P200 or P2, a component of brain evoked-response potential
ATC code P02 Anthelmintics, a subgroup of the Anatomical Therapeutic Chemical Classification System
Buffer P2, a lysis buffer solution
Period 2, of the periodic table
Pollution prevention in the US, an environmental management strategy emphasizing avoiding waste rather than treating it
Diphosphorus (), an inorganic chemical
SARS-CoV-2 Zeta variant, one of the variants of SARS-CoV-2, the virus that causes COVID-19
Transportation
P2 transport, a World War II passenger ship/troop ship design of the United States Maritime Commission
P2, a State 1st class road in Latvia
LNER Class P2, a class of 6 British 2-8-2 locomotives designed by Sir Nigel Gresley
Aircraft
P-2 Hawk, a variant of the 1923 P-1 Hawk biplane fighter of the United States Army Air Corps
P-2 Neptune, known as "P2V Neptune" until 1962, a United States Navy maritime patrol and antisubmarine warfare aircraft introduced in 1947
Piaggio P.2, a 1923 Italian fighter prototype
Pilatus P-2, a Swiss Air Force trainer aircraft in service from 1946 to 1981
Polikarpov P-2, a Soviet Polikarpov biplane trainer prototype
Automobiles
Alfa Romeo P2, an iconic 1920s racing automobile
Prodrive P2, an automobile built by Prodrive
Volvo P2 platform, an automobile platform
Entertainment
P2 (film), a 2007 suspense/thriller film directed by Franck Khalfoun
P2 virus, a fictional virus in the novel The Second Angel
DR P2, a Danish radio channel playing classical music and jazz, literary programming and radio dramas
NRK P2, a Norwegian radio channel playing cultural programming operated by Norsk rikskringkasting
Sveriges Radio P2, a Swedish radio channel playing classical music, jazz and world music operated by Sveriges Radio
Persona 2, 1999 and 2000 role-playing video games by Atlus
Portal 2, a 2011 puzzle-platform video game by Valve
Postal 2, a 2003 first-person shooter by Running with Scissors
"P2" (song), a 2020 song by Lil Uzi Vert from the album Eternal Atake
Other uses
P2 (panel building), a design for blocks of flats used in East Germany
Papyrus 2 (P2, ), a papyrus New Testament manuscript
Propaganda Due, an Italian Maso |
https://en.wikipedia.org/wiki/P1 | P1, P01, P-1 or P.1 may refer to:
Computing, robotics, and, telecommunications
DSC-P1, a 2000 Sony Cyber-shot P series camera model
Sony Ericsson P1, a UIQ 3 smartphone
Packet One, the first company to launch WiMAX service in Southeast Asia
Peer 1, an Internet hosting provider
Honda P1, a 1993 Honda P series of robots, an ASIMO predecessor
Media
DR P1, a Danish radio network operated by Danmarks Radio
NRK P1, a Norwegian radio network operated by the Norwegian Broadcasting Corporation
SR P1, a Swedish radio network operated by Sveriges Radio
Polonia 1, a Polish TV channel of the Polcast Television
Military
P-1 Hawk, a 1923 biplane fighter of the U.S. Army Air Corps
Kawasaki P-1, a Japanese maritime patrol aircraft (previously P-X)
P-1 (missile), a Soviet anti-ship cruise missile
Science
Biology
P1 antigen, identifies P antigen system
P1 laboratory, biosafety -level-1 laboratory
P1 phage, a bacterial virus
SARS-CoV-2 Gamma variant, a strain of COVID-19 virus SARS-CoV-2 first detected in Manaus, Brazil in 2020
ATC code P01 Antiprotozoals, a subgroup of the Anatomical Therapeutic Chemical Classification System
Pericarp color1 (p1), a gene in the phlobaphene biosynthesis pathway in maize
C1 and P1 (neuroscience), a component of the visual evoked potential
P1 nuclease, a nuclease that works on single-stranded DNA as well as RNA
Other sciences
Period 1 of the periodic table
Pollard's p − 1 algorithm for integer factorization
P-ONE - a proposed neutrino detector
Transportation
Automobiles
P1 International, a car club founded in Leatherhead, Surrey, England
Alfa Romeo P1, a 1932 Grand Prix car
Allard P1, a 1949 British five seater two door sports saloon
McLaren P1, a sports car succeeding the McLaren F1.
Porsche P1, first electric car produced by Ferdinand Porsche in 1898
P-1, development code name of the Subaru 1500 automobile
P1 race class in the Le Mans racing series
Aircraft
Abrams P-1 Explorer, an American aerial survey aircraft
Dewoitine P-1, a Dewoitine aircraft
DFW P.1, a passenger aircraft development of the 1916 DFW C.V
Paradise P-1 LSA, a Brazilian light-sport aircraft
Rail
P1 (AirTrain Newark station), a station on AirTrain Newark, NJ, USA
Alsace-Lorraine P 1, a German steam locomotives class
LNER Class P1, a class of locomotive designed by Nigel Gresley
Other uses
Front-runner, or position 1 (P.1)
Papyrus 1, also known as P1, P, or , an early papyrus copy of part of the New Testament
Walther P1, an aluminum-framed variant of the Walther P38 pistol
Pioneer One, an open source web series
P-1 (submarine), a fictional patrol craft in the animated TV series Marine Boy
See also
Pone (disambiguation)
PL (disambiguation)
PI (disambiguation)
1P (disambiguation) |
https://en.wikipedia.org/wiki/Conkeror | Conkeror is a Mozilla-based web browser designed to be navigated primarily by a computer keyboard. Its design is mainly patterned after the text editor GNU Emacs, with some influence from other programs, including vi.
It was originally written by Shawn Betts, the primary author of keyboard-driven ratpoison and Stumpwm tiling window managers. Formerly an extension for the Mozilla Firefox browser, it is now developed for XULRunner as a stand-alone application. Since Firefox 52 ESR (September 2018), when the last official Mozilla browser that supported XULRunner reached end-of-life, there is no officially-supported browser from Mozilla for Conkeror to be based on. Firefox forks like Pale Moon and Waterfox continue to bundle XULRunner and can be used to run Conkeror.
Conkeror is released under the same set of free software licenses as Mozilla: the GNU General Public License, the GNU Lesser General Public License, and the Mozilla Public License.
Browsing
Conkeror emphasizes Emacs-derived key bindings and keyboard-based browser navigation. By pressing a key (f, for "follow", by default), Conkeror brings up a small, numbered label beside every element within the current view on the page that can be clicked. The user can type the number of the link and ENTER to follow the link, or type the link name to narrow down the choices; when the part of the name already typed uniquely identifies a link, it becomes numbered one, highlighted green, and then hitting Enter will follow it.
Conkeror has a large number of standard key bindings, and more can be added. The following are some examples of default key bindings: (key bindings are case sensitive)
Like Emacs, Conkeror makes use of buffers in order to allow multiple pages to remain open at the same time (similar to tabs in traditional browsers). Users can open new buffers and navigate through them using key bindings. For example, C-u C-f opens a hyperlink in a new buffer, C-u C-g goes to a URL or search term in a new buffer, and C-u C-h i opens the start page in a new buffer. Buffers can be cycled through using M-n to go to the next buffer or M-p to go to the previous one. C-x b displays a list of the currently open buffers from which the user can choose a buffer using the up and down arrows.
Customization
The Conkeror browser can be customized in many ways using JavaScript as the scripting language, much in the way that Emacs uses Emacs Lisp. Customizations can be as simple as rebinding keys, but can also be more involved; for instance, writing new interactive commands. By default, Conkeror looks for these customizations in ~/.conkerorrc. If ~/.conkerorrc/ is a directory instead of a file, then all the contained files will be read, which is a technique to enable modularization of bigger customizations.
Conkeror also ships with a number of loadable JavaScript modules, some of which provide core functionality; others are user-loadable and provide additional functionality.
Conkeror has modes in which the |
https://en.wikipedia.org/wiki/Dream%20Job | Dream Job is an American reality television show made by ESPN, which began on February 22, 2004. It was the network's second reality show, with two editions of Beg, Borrow & Deal having previously aired. However, this was the first reality show from a network to offer its winner an on-air place on one of its shows. The show was hosted by Stuart Scott.
Summary
The premise of Dream Job was to find a new anchor for ESPN's popular sports news program, SportsCenter. The winner of Dream Job would get a one-year contract with the network, and would play a trivia quiz on SportsCenter to determine her or his annual salary. The winner would also receive a new Mazda 3. Every week, either one or two contestants would be cut from the show as the American viewing public and the show's judging panel were allowed the power of whom they wanted to be cut from the show.
Season 1
Contestants
In September 2003, the show's producers went on a nationwide talent search to find those who wanted a chance to be an ESPN anchor. Over 10,000 people attended the talent search across the United States. The field was narrowed down to 10 contestants who would compete in the televised finals, which started in the Winter of 2004. Originally, the show wanted 11 contestants, 10 from the nationwide search, and another from a contest that was being sponsored by the popular fast food chain Wendy's. A 12th contestant would be selected as an alternate.
The last 12 contestants still in the running on the premiere episode ranged in ages from 21 to 40. They were:
Maggie Haskins, the youngest contestant, a Chicago native who was a full-time student at Brown University in Providence, Rhode Island. Haskins was originally the alternate, but producers later changed their minds and she competed from the show's first episode.
Michael Quigley, the oldest contestant, an auto parts salesman from Lansdowne, Pennsylvania. Quigley quickly became known for his over-the-top anchoring style, similar to a play-by-play announcer.
Aaron Levine, 21, a senior at Stanford University
Mike Hall, 22, a senior at the University of Missouri
Casey Stern, 25, an executive recruiter from Bellmore, New York
Zachariah Selwyn, 28, an actor and a musician from Los Angeles
Nick Stevens, 29, a Brooklyn-based comedian
Chris Williams, 31, an attorney from Boston
Chet Anekwe, 38, a Nigerian-born computer programmer from Jersey City
Alvin Williams, 38, a retail manager from Montgomery, Alabama (Williams won the contest sponsored by Wendy's to become a contestant on the show)
Kelly Milligan, 38, a Dallas attorney
Lori Rubinson, 39, from New York City, now a host at WFAN
Judges
The judging panel consisted of:
Tony Kornheiser, The Washington Post columnist and author, and co-host of ESPN's talk show, Pardon the Interruption.
Kit Hoover, a former Fox News correspondent, cast member on the inaugural season of MTV's Road Rules, and co-host of the ESPN2 morning show, Cold Pizza.
LaVar Arrington, a former NFL linebac |
https://en.wikipedia.org/wiki/JavaBeans | In computing based on the Java Platform, JavaBeans is a technology developed by Sun Microsystems and released in 1996, as part of JDK 1.1.
The 'beans' of JavaBeans are classes that encapsulate one or more objects into a single standardized object (the bean). This standardization allows the beans to be handled in a more generic fashion, allowing easier code reuse and introspection. This in turn allows the beans to be treated as software components, and to be manipulated visually by editors and IDEs without needing any initial configuration, or to know any internal implementation details.
As part of the standardization, all beans must be serializable, have a zero-argument constructor, and allow access to properties using getter and setter methods.
Features
Introspection
Introspection is a process of analyzing a Bean to determine its capabilities. This is an essential feature of the Java Beans specification because it allows another application, such as a design tool, to obtain information about a component.
Properties
A property is a subset of a Bean's state. The values assigned to the properties determine the behaviour and appearance of that component. They are set through a setter method and can be obtained by a getter method.
Customization
A customizer can provide a step-by-step guide that the process must follow to use the component in a specific context.
Events
Beans may interact with the EventObject EventListener model.
Persistence
Persistence is the ability to save the current state of a Bean, including the values of a Bean's properties and instance variables, to nonvolatile storage and to retrieve them at a later time.
Methods
A Bean should use accessor methods to encapsulate the properties. A Bean can provide other methods for business logic not related to the access to the properties.
Advantages
The properties, events, and methods of a bean can be exposed to another application.
A bean may register to receive events from other objects and can generate events that are sent to those other objects.
Auxiliary software can be provided to help configure a bean.
The configuration settings of a bean can be saved to persistent storage and restored.
Disadvantages
A class with a zero-argument constructor is subject to being instantiated in an invalid state. If such a class is instantiated manually by a developer (rather than automatically by some kind of framework), the developer might not realize that the class has been improperly instantiated. The compiler cannot detect such a problem, and even if it is documented, there is no guarantee that the developer will see the documentation.
JavaBeans are inherently mutable and so lack the advantages offered by immutable objects.
Having to create getters for every property and setters for many, most, or all of them can lead to an immense quantity of boilerplate code.
JavaBeans API
The JavaBeans functionality is provided by a set of classes and interfaces in the java.beans package.
J |
https://en.wikipedia.org/wiki/Network%20access%20server | A network access server (NAS) is a group of components that provides remote users with a point of access to a network.
Overview
A NAS concentrates dial-in and dial-out user communications. An access server may have a mixture of analog and digital interfaces and support hundreds of simultaneous users. A NAS consists of a communications processor that connects asynchronous devices to a LAN or WAN through network and terminal emulation software. It performs both synchronous and asynchronous routing of supported protocols.
The NAS is meant to act as a gateway to guard access to a protected resource. This can be anything from a telephone network, to printers, to the Internet. A client connects to the NAS. The NAS then connects to another resource asking whether the client's supplied credentials are valid. Based on that answer the NAS then allows or disallows access to the protected resource.
Examples
The above translates into different implementations for different uses. Here are some examples.
An Internet service provider which provides network access via common modem or modem-like devices (be it PSTN, DSL, cable or GPRS/UMTS) can have one or more NAS (network access server) devices which accept PPP, PPPoE or PPTP connections, checking credentials and recording accounting data via back-end RADIUS servers, and allowing users access through that connection.
The captive portal mechanism used by many WiFi providers: a user wants to access the Internet and opens a browser. The NAS detects that the user is not currently authorized to have access to the Internet, so the NAS prompts the user for their username and password. The user supplies them and sends them back to the NAS. The NAS then uses the RADIUS protocol to connect to an AAA server and passes off the username and password. The RADIUS server searches through its resources and finds that the credentials are valid and notifies the NAS that it should grant the access. The NAS then grants the user access to the Internet.
Another use of a NAS would be in voice over IP (VoIP). However, instead of using a username and password, many times a phone number or IP Address are used. If the phone number is a valid customer then the call can be completed. Other uses might be to verify whether a phone number has long distance access or a telephone card has minutes left.
Associated protocols
Although not required, NASs are almost exclusively used with authentication, authorization, and accounting (AAA) servers. Of the AAA protocols available, RADIUS tends to be the most widely used. The Diameter base protocol extends RADIUS services by providing error handling and inter-domain communications. This protocol is used in networks like the IP Multimedia Subsystem (IMS).
See also
Terminal server
References
External links
, Network Access Server Requirements Next Generation (NASREQNG)
Network access
Telephony
Telecommunications infrastructure |
https://en.wikipedia.org/wiki/Henri%20Gouraud%20%28disambiguation%29 | Henri Gouraud may refer to:
Henri Gouraud (general) (1867–1946), led the French Fourth Army at the end of the First World War
Henri Gouraud (computer scientist) (born 1944), French computer scientist, inventor of Gouraud shading |
https://en.wikipedia.org/wiki/Runlevel | A runlevel is a mode of operation in the computer operating systems that implements Unix System V-style initialization. Conventionally, seven runlevels exist, numbered from zero to six. S is sometimes used as a synonym for one of the levels. Only one runlevel is executed on startup; run levels are not executed one after another (i.e. only runlevel 2, 3, or 4 is executed, not more of them sequentially or in any other order).
A runlevel defines the state of the machine after boot. Different runlevels are typically assigned (not necessarily in any particular order) to the single-user mode, multi-user mode without network services started, multi-user mode with network services started, system shutdown, and system reboot system states. The exact setup of these configurations varies between operating systems and Linux distributions. For example, runlevel 4 might be a multi-user GUI no-server configuration on one distribution, and nothing on another. Runlevels commonly follow the general patterns described in this article; however, some distributions employ certain specific configurations.
In standard practice, when a computer enters runlevel zero, it shuts off, and when it enters runlevel six, it reboots. The intermediate runlevels (1–5) differ in terms of which drives are mounted and which network services are started. Default runlevels are typically 3, 4, or 5. Lower runlevels are useful for maintenance or emergency repairs, since they usually offer no network services at all. The particular details of runlevel configuration differ widely among operating systems, and also among system administrators.
In various Linux distributions, the traditional script used in the Version 7 Unix was first replaced by runlevels and then by systemd states on most major distributions.
Standard runlevels
Linux
Although systemd is, , used by default in most major Linux distributions, runlevels can still be used through the means provided by the sysvinit project. After the Linux kernel has booted, the program reads the file to determine the behavior for each runlevel. Unless the user specifies another value as a kernel boot parameter, the system will attempt to enter (start) the default runlevel.
Linux Standard Base specification
Systems conforming to the Linux Standard Base (LSB) need not provide the exact run levels given here or give them the meanings described here, and may map any level described here to a different level which provides the equivalent functionality.
Slackware Linux
Slackware Linux uses runlevel 1 for maintenance, as on other Linux distributions; runlevels 2, 3 and 5 identically configured for a console (with all services active); and runlevel 4 adds the X Window System.
Gentoo Linux
Debian GNU/Linux
Unix
System V Releases 3 and 4
Solaris
Starting from Solaris 10, SMF (Service Management Facility) is used instead of SVR4 run levels. The latter are emulated to preserve compatibility with legacy startup scripts.
HP-UX
AIX
AIX d |
https://en.wikipedia.org/wiki/ComputerLand | ComputerLand was a widespread chain of retail computer stores during the early years of the microcomputer revolution, and was one of the outlets (along with Computer City and Sears) chosen to introduce the IBM PC in 1981. The first ComputerLand opened in 1976, and the chain eventually included about 800 stores by 1985. After this time the rapid commoditization of the PC led to the company's downfall, with most of the retail locations closing by 1990. The company officially ended in February 1999.
History
ComputerLand was founded by William H. Millard. In 1974 he launched a company, IMS Associates, Inc., to build what was claimed to be the first truly integrated personal computers, sold as kits to hobbyists and the rapidly growing numbers of retailers (through small ads in Popular Electronics). The computer, the IMSAI 8080, may not have made Millard's fortune, but his resulting experiences with the inexperienced and under‑capitalized retailers did. In 1976 (at the same time as the Byte Shop was selling its first few Apples) he asked his Sales Director, Ed Faber (an ex‑IBM Manager), to start a new franchise operation, soon to become ComputerLand.
Faber first designed a pilot store, at Hayward, California, with the then-revolutionary concept of providing a "full service" store, offering under one roof all that the customer needed to support their PCs. He then moved rapidly to set up franchising. The first franchisee was in Morristown, New Jersey, and was rapidly followed by a chain across the US.
It set a pattern that dominated PC retailing for the next decade. By the time IBM arrived on the scene, the network of branches, all run by franchisees, had grown to 190 in number. By the end of 1985, when Millard retired, there were some 800 branches (including some 200 outside the US) and he had become one of the computer billionaires.
Most ComputerLand stores succumbed to the predation of the "box-shifters" in the price wars of the latter 1980s, after the peak had passed. In 1987, Millard sold ComputerLand to E.M. Warburg, Pincus & Co. for US$200 million.
In 1993, Merisel announced it would purchase the ComputerLand name and all franchise holdings and its Datago aggregation division for $110 million. The new Merisel ComputerLand unit was operated by the then-president of Computerland's franchise and distribution business, Martin Wolf. The following year, "Vanstar" was selected as the name for the ComputerLand corporate company-owned stores stemming from the Nynex acquisition. (Pleasanton, California) after the sale of split-off franchisor to Merisel.
In 1997 Synnex Information Technologies, a national distributor of microcomputers and communication, networking, peripheral and storage products, purchased substantially all the assets of Merisel FAB Inc., including the ComputerLand franchise. Synnex created ComputerLand Corporation, a wholly owned subsidiary of Synnex, consisting of the ComputerLand and Datago businesses.
On October 9, 1998, Inacom |
https://en.wikipedia.org/wiki/LiViD | LiViD, short for Linux Video and DVD, was a collection of projects that aim to create program tools and software libraries related to DVD for Linux operating system.
The projects included:
OMS
GATOS
mpeg2dec
ac3dec
In 2002, LiViD project leader Matthew Pavlovich was sued by the DVD Copy Control Association Inc. (DVD CCA) for trade secret misappropriation because they posted DeCSS on the LiViD website.
See also
DeCSS
AACS encryption key controversy
External links
Mirrors of the LiViD homepage and the LiViD software
The LiViD website on the Internet Archives Wayback Machine
Linux DVD players |
https://en.wikipedia.org/wiki/NovaLogic | NovaLogic, Inc. was a software developer and publisher established in 1985 and based in Calabasas, California. The company was founded by CEO John A. Garcia. Garcia's background in computer software started in Southern California in the early 1980s, when he worked at Datasoft. The company was known for their Voxel Space engine, which was utilized in franchises such as the Comanche and Delta Force series. In October 2016, NovaLogic's assets were bought out by THQ Nordic and is currently an inactive label for the company.
History
Originally, NovaLogic worked on new versions of previously published games. Taito America was a major client of the company and most (if not all) of NovaLogic's earliest games were PC conversions of Taito arcade games. NovaLogic's 1992 game Comanche: Maximum Overkill was the first release that utilized the Voxel Space engine, which allowed for larger outdoor environments and more detailed terrain. The engine was conceived by electrical engineer Kyle Freeman. Freeman's engine stemmed from his earlier creations of medical technology. In addition, the cancelled Philips CD-i sequel to Super Mario World, Super Mario's Wacky Worlds, was in development by NovaLogic. Due to the failure of the Phillips CD-i platform, the project was cancelled in 1993.
Comanche: Maximum Overkill kickstarted a string of releases by NovaLogic that simulated military battles. Other games included the F-22 plane simulators, Armored Fist tank simulators, and expanding the Comanche helicopter simulators. After releasing several successful military-themed games, the company started NovaLogic Systems, Inc. (NLS) on February 13, 1996. They were initially contracted by the US Army to create training simulations for the branch. In 1997, NovaLogic launched its free online matchmaking service, NovaWorld. The service allowed for large online battles and stat tracking.
In 1998, NovaLogic continued to evolve their Voxel Space engine for the inaugural game in the Delta Force series. The game was a first-person shooter set in large outdoor environments in a realistic military setting. It also featured the online NovaWorld system, which allowed for large numbers of players in a singular server. The game was well-received and it prompted the company to continue the franchise. Delta Force 2 was released in 1999, followed by Delta Force: Land Warrior in 2000. The trilogy of Delta Force titles were successful in the United Kingdom as indicated by ELSPA's chart. Delta Force peaked at #3 in February 1999, Delta Force 2 peaked at #2 in February 2000, and Delta Force: Land Warrior peaked at #1 in March 2001.
NovaLogic also ventured into space combat with Tachyon: The Fringe, featuring Bruce Campbell in the lead voice acting role. In 2001, the company released Comanche 4, the fourth and final game in the long-running series. NovaLogic, in collaboration with artist Gerald Brom, also planned to develop a PC fantasy first-person shooter entitled Necrocide: The Dead Must Die b |
https://en.wikipedia.org/wiki/Internet%20geolocation | In computing, Internet geolocation is software capable of deducing the geographic position of a device connected to the Internet. For example, the device's IP address can be used to determine the country, city, or ZIP code, determining its geographical location. Other methods include examination of Wi-Fi hotspots,
Data sources
An IP address is assigned to each device (e.g. computer, printer) participating in a computer network that uses the Internet Protocol for communication. The protocol specifies that each IP packet must have a header which contains, among other things, the IP address of the sender.
There are a number of free and paid subscription geolocation databases, ranging from country level to state or city—including ZIP/post code level—each with varying claims of accuracy (generally higher at the country level). These databases typically contain IP address data which may be used in firewalls, ad servers, routing, mail systems, web sites, and other automated systems where a geolocation may be useful. An alternative to hosting and querying a database is to obtain the country code for a given IP address through a DNSBL-style lookup from a remote server.
Some commercial databases have augmented geolocation software with demographic data to enable demographic-type targeting using IP address data.
The primary source for IP address data is the regional Internet registries which allocate and distribute IP addresses amongst organizations located in their respective service regions:
African Network Information Centre (AfriNIC)
American Registry for Internet Numbers (ARIN)
Asia-Pacific Network Information Centre (APNIC)
Latin American and Caribbean Internet Address Registry (LACNIC)
RIPE Network Coordination Centre (RIPE NCC)
The registries allow assignees to specify country and geographical coordinates of each assigned block. Starting from 2021 RFC 9092 allows assignees to specify location of any IP subnetwork they own.
Secondary sources include:
Data mining or user-submitted geographic location data:
Website-submitted, e.g. a weather website asking visitors for a city name to find their local forecast or pairing a user's IP address with the address information in their account profile.
Wi-Fi positioning system through the examination of neighborhood Wi-Fi BSSID. E.g. Mozilla Location Service.
Examination of neighborhood Bluetooth devices.
Pairing a user's IP address with the GPS location of a device that's using such an IP address.
Data contributed by Internet service providers.
Guesstimates from adjacent Class C range and/or gleaned from network hops.
Network routing information collected to the end point of the IP address.
Analysis of linguistic data from the device, using pretrained models that show that some term is frequently mentioned in a certain location (e.g. "the T" vs "the El" vs. "the subway").
Accuracy is improved by:
Data scrubbing to filter out or identify anomalies.
Statistical analysis of user submitted |
https://en.wikipedia.org/wiki/SheerVideo | SheerVideo was a family of proprietary lossless video codecs developed by BitJazz Inc. The codecs enabled devices with inexpensive hardware (such as laptop computers and video cameras) to play, capture, edit, and archive high-quality lossless videos in real time.
As of July 2023, SheerVideo is still available as a set of QuickTime codecs on Mac and Windows and as a set of AVI codecs on Windows.
History
SheerVideo was initially developed by Andreas Wittenstein at BitJazz Inc. in July 2002.
As of September 2022, SheerVideo is no longer under active development.
References
External links
SheerVideo page at BitJazz
Video codecs
Lossless compression algorithms |
https://en.wikipedia.org/wiki/QuickTime%20Animation | QuickTime Animation format (also known as QuickTime RLE) is a video compression format and codec created by Apple Computer to enable playback of RGB video in real time without expensive hardware. It is generally found in the QuickTime container with the FourCC 'rle '. It can perform either lossless or lossy compression and is one of the few video codecs that supports an alpha channel. Supported color depths are 1-bit (monochrome), 15-bit RGB, 24-bit RGB, 32-bit ARGB, as well as palettized RGB. As a result of reverse-engineering of the format, a decoder is implemented in XAnim as well as an encoder and decoder in libavcodec.
Technical Details
QuickTime Animation uses run-length encoding and conditional replenishment for compression. When encoding, the input frame is scanned pixel-wise in raster-scan order and processed line-wise. Within a line, pixels are segmented into runs, the length of which is variable and signaled in the bitstream. For each run, one of three coding modes is used: same color, skip, or PCM. In same color mode, a run of pixels is represented by a single color in a run-length encoding fashion. If pixels with different colors are joined into a run (of a single color) by the encoder, the coding process is lossy, otherwise it is lossless. The lossless mode is used at the 100% quality level. In skip mode, the run of pixels is left unchanged from the previous frame (conditional replenishment). In PCM mode, the color of each pixel is written to the bitstream, without any compression.
Run-length encoding works well on content with large areas of constant color. Conditional replenishment works well if only small areas change from frame to frame. QuickTime Animation works well on content with both these properties, such as traditional 2-D animation and screencast content. For natural video and complex 3D rendered scenes, in which runs of constant color rarely occur, only low compression ratios can be achieved in lossless mode, and the merging of runs becomes visible as noise in lossy mode.
See also
List of lossless video codecs
Notes
References
External links
QuickTime Animation (RLE) Video Decoder - FFmpeg
Quicktime Animation (RLE) Video Encoder - FFmpeg
Animation
Video codecs |
https://en.wikipedia.org/wiki/Null%20pointer | In computing, a null pointer or null reference is a value saved for indicating that the pointer or reference does not refer to a valid object. Programs routinely use null pointers to represent conditions such as the end of a list of unknown length or the failure to perform some action; this use of null pointers can be compared to nullable types and to the Nothing value in an option type.
A null pointer should not be confused with an uninitialized pointer: a null pointer is guaranteed to compare unequal to any pointer that points to a valid object. However, depending on the language and implementation, an uninitialized pointer may not have any such guarantee. It might compare equal to other, valid pointers; or it might compare equal to null pointers. It might do both at different times; or the comparison might be undefined behaviour.
Because a null pointer does not point to a meaningful object, an attempt to access the data stored at that (invalid) memory location may cause a run-time error or immediate program crash. This is the null pointer error. It is one of the most common types of software weaknesses, and Tony Hoare, who introduced the concept, has referred to it as a "billion dollar mistake".
C
In C, two null pointers of any type are guaranteed to compare equal. The preprocessor macro NULL is defined as an implementation-defined null pointer constant in <stdlib.h>, which in C99 can be portably expressed as ((void *)0) which means that the integer value 0 converted to the type void* (pointer to void). The C standard does not say that the null pointer is the same as the pointer to memory address 0, though that may be the case in practice. Dereferencing a null pointer is undefined behavior in C, and a conforming implementation is allowed to assume that any pointer that is dereferenced is not null.
In practice, dereferencing a null pointer may result in an attempted read or write from memory that is not mapped, triggering a segmentation fault or memory access violation. This may manifest itself as a program crash, or be transformed into a software exception that can be caught by program code. There are, however, certain circumstances where this is not the case. For example, in x86 real mode, the address 0000:0000 is readable and also usually writable, and dereferencing a pointer to that address is a perfectly valid but typically unwanted action that may lead to undefined but non-crashing behavior in the application. There are occasions when dereferencing the pointer to address zero is intentional and well-defined; for example, BIOS code written in C for 16-bit real-mode x86 devices may write the interrupt descriptor table (IDT) at physical address 0 of the machine by dereferencing a null pointer for writing. It is also possible for the compiler to optimize away the null pointer dereference, avoiding a segmentation fault but causing other undesired behavior.
C++
In C++, while the NULL macro was inherited from C, the integer literal for |
https://en.wikipedia.org/wiki/Gofer%20%28disambiguation%29 | A gofer is an errand runner.
Gofer may also refer to:
Gofer (programming language), educational version of Haskell
GOFER, mnemonic device for a decision-making method
See also
Gofer wood, used to construct Noah's Ark in the Bible
Gopher (disambiguation) |
https://en.wikipedia.org/wiki/Conference%20on%20Neural%20Information%20Processing%20Systems | The Conference and Workshop on Neural Information Processing Systems (abbreviated as NeurIPS and formerly NIPS) is a machine learning and computational neuroscience conference held every December. The conference is currently a double-track meeting (single-track until 2015) that includes invited talks as well as oral and poster presentations of refereed papers, followed by parallel-track workshops that up to 2013 were held at ski resorts.
History
The NeurIPS meeting was first proposed in 1986 at the annual invitation-only Snowbird Meeting on Neural Networks for Computing organized by The California Institute of Technology and Bell Laboratories. NeurIPS was designed as a complementary open interdisciplinary meeting for researchers exploring biological and artificial Neural Networks. Reflecting this multidisciplinary approach, NeurIPS began in 1987 with information theorist Ed Posner as the conference president and learning theorist Yaser Abu-Mostafa as program chairman. Research presented in the early NeurIPS meetings included a wide range of topics from efforts to solve purely engineering problems to the use of computer models as a tool for understanding biological nervous systems. Since then, the biological and artificial systems research streams have diverged, and recent NeurIPS proceedings have been dominated by papers on machine learning, artificial intelligence and statistics.
From 1987 until 2000 NeurIPS was held in Denver, United States. Since then, the conference was held in Vancouver, Canada (2001–2010), Granada, Spain (2011), and Lake Tahoe, United States (2012–2013). In 2014 and 2015, the conference was held in Montreal, Canada, in Barcelona, Spain in 2016, in Long Beach, United States in 2017, in Montreal, Canada in 2018 and Vancouver, Canada in 2019. Reflecting its origins at Snowbird, Utah, the meeting was accompanied by workshops organized at a nearby ski resort up until 2013, when it outgrew ski resorts.
The first NeurIPS Conference was sponsored by the IEEE. The following NeurIPS Conferences have been organized by the NeurIPS Foundation, established by Ed Posner. Terrence Sejnowski has been the president of the NeurIPS Foundation since Posner's death in 1993. The board of trustees consists of previous general chairs of the NeurIPS Conference.
The first proceedings was published in book form by the American Institute of Physics in 1987, and was entitled Neural Information Processing Systems, then the proceedings from the following conferences have been published by Morgan Kaufmann (1988–1993), MIT Press (1994–2004) and Curran Associates (2005–present) under the name Advances in Neural Information Processing Systems.
The conference was originally abbreviated as "NIPS". By 2018 a few commentators were criticizing the abbreviation as encouraging sexism due to its association with the word nipples, and as being a slur against Japanese. The board changed the abbreviation to "NeurIPS" in November 2018.
Topics
Along with mac |
https://en.wikipedia.org/wiki/Munich%20U-Bahn | The Munich U-Bahn () is an electric rail rapid transit network in Munich, Germany. The system began operation in 1971, and is operated by the municipally owned Münchner Verkehrsgesellschaft (MVG; Munich Transport Company). The network is integrated into the Münchner Verkehrs- und Tarifverbund (MVV; Munich Transport and Tariff Association) and interconnected with the Munich S-Bahn. The U-Bahn currently comprises eight lines, serving 96 stations (100 stations if four interchange stations with separate levels for different lines are counted twice), and encompassing of routes.
Current routes
There are eight lines:
The network has of active route, and 100 stations. In 2014, 390 million passengers rode the U-Bahn. The trains operate at speeds up to , which is the top speed among German U-Bahns. There is no continuous operation during the night (break from 1 to 4 am, 2 to 4 am on weekends) except on special occasions such as New Year's Eve.
Currently, only the U6 line crosses the municipal border to the town of Garching.
Except for the lines U5 and U6, all lines operate completely below ground. U5 only comes above ground at the south terminus Neuperlach-Süd, U6 on the northern section from Studentenstadt (except Garching and Garching-Forschungszentrum stations and tunnels).
There are three "line families", which each consist of two lines (not counting peak hour lines) that share a common track in the city centre. The schedules of these lines are coordinated to produce regular train intervals on the common section.
Most stations have two tracks with an island platform between them. Of the single-line stations, only the stations Olympia-Einkaufszentrum (U1), Richard-Strauss-Straße (U4), Neuperlach Süd (U5), Garching-Hochbrück and Nordfriedhof (both U6) have side platforms.
At the junction stations Scheidplatz and Innsbrucker Ring, the four tracks run in parallel on the same level, with two island platforms allowing cross-platform interchange. The stations Hauptbahnhof (lower level), where U1 and U2 branch into two different lines and Münchner Freiheit (U3/U6) also have four tracks, while Implerstraße (U3/U6), Max-Weber-Platz (U4/U5) and Kolumbusplatz (U1/U2) have three: one with a side platform for outbound trains and two with a shared island platform for inbound trains.
Olympiazentrum, Fröttmaning and Kieferngarten also have four tracks each, the first due to the proximity of the Olympic Stadium, the others to support both traffic directed to the technical base and depot in Fröttmaning, and passengers attending the Allianz Arena football stadium.
At Hauptbahnhof, there is a second U-Bahn station for lines U4/5 at a higher level, giving a total of six U-Bahn tracks. Sendlinger Tor, Odeonsplatz and Olympia-Einkaufszentrum also each have two quite separate stations at different levels, connected with each other by escalators and elevators.
Frequency and scheduling
Most lines operate with trains running at intervals of every 5 minutes during p |
https://en.wikipedia.org/wiki/SCons | SCons is a computer software build tool that automatically analyzes source code file dependencies and operating system adaptation requirements from a software project description and generates final binary executables for installation on the target operating system platform. Its function is analogous to the traditional GNU build system based on the make utility and the autoconf tools.
SCons generates project configurations and build process implementations in the form of Python scripts.
History and related projects
SCons software history started with the Cons software construction utility created by Bob Sidebotham in 1999. Cons was written in the Perl language. It served as a base for the ScCons build tool, a design which won the Software Carpentry project SC Build competition in August 2000. ScCons was the foundation for SCons.
SCons inspired the creation of Waf, formerly known as SCons/BKsys, which emerged in the KDE community. For some time, there were plans to use it as the build tool for KDE 4 and beyond, but that effort was abandoned in favor of CMake.
Notable applications that use SCons include the following: The Battle for Wesnoth, Battlefield 1942, Doom 3, FCEUX, gem5, gpsd, GtkRadiant, Madagascar, Mixxx, MongoDB, Nullsoft Scriptable Install System, OpenNebula, VMware,, Wolfenstein: Enemy Territory, XORP and MCA2, openpilot and Godot.
.csig is the SCons Content Signature file format.
Major features
Major SCons features include the following:
Configuration files are Python scripts, which means that user-written builds have access to a complete general-purpose programming language.
Automatic dependency analysis built-in for C, C++ and Fortran. Dependency analysis is extensible through user-defined dependency scanners for other languages or file types. Unlike the GNU Compiler Collection's (GCC) built-in dependency analysis, it uses a regular expression scan for included source files.
Built-in support for C, C++, D, Java, Fortran, Objective-C, Yacc, Lex, Qt and SWIG, as well as TeX and LaTeX documents. SCons can also handle other languages or file types through user-defined builders.
Building from central repositories of source code and pre-built targets.
Built-in ability to use Microsoft Visual Studio, including the generation of , , and files.
Detection of file content changes using MD5 signatures; optional, configurable ability to use traditional timestamps.
Ability to do parallel builds, maintaining a specified number of jobs running simultaneously regardless of directory hierarchy.
Integrated Autoconf-like support for finding #include files, libraries, functions and typedefs.
Global view of all dependencies, so multiple build passes or reordering targets is not required.
Ability to share built files in a cache to speed up multiple builds - like ccache but for any type of target file, not just C/C++ compilation.
Designed from the ground up for cross-platform builds, and known to work on POSIX systems (including Li |
https://en.wikipedia.org/wiki/Marching%20ants | The marching ants effect is an animation technique often found in selection tools of computer graphics programs. It helps the user to distinguish the selection border from the image background by animating the border. The border is a dotted or dashed line where the dashes seem to move slowly sideways and up and down. This creates an illusion of ants marching in line as the black and white parts of the line start to move. Some prefer the term marquee selection, as the effect resembles the chaser lights of a marquee, and this term can be considered a synonym. Popular graphics programs, such as the GIMP and Adobe Photoshop, implement their selection tools using the marching ants effect. The technique was first widely used by the MacPaint program developed by Bill Atkinson.
The easiest way to achieve this animation is by drawing the selection using a pen pattern that contains diagonal lines. If the selection outline is only one pixel thick, the slices out of the pattern will then look like a dashed line, and the animation can easily be achieved by simply shifting the pattern one pixel sideways and redrawing the outline. The method has the disadvantage of not looking like marching ants with selection borders that are not parallel to the coordinate axes.
Origin
With the selection problem in mind, Bill Atkinson went to his favorite pub in Los Gatos. Something on the wall caught his attention. It was an electric Hamm's Beer sign. The beer sign consisted of an illuminated scene of a kind of animated waterfall. Water seemed to flow down the waterfall into the lake. Bill figured that this effect could solve his problem because it is easily recognizable.
He implemented the idea and showed it to Rod Perkins from the Lisa team, who told Bill the effect reminded him of "marching ants".
References
External links
Fun with marching ants describes another scheme for generating the marching ants pattern
Graphical user interface elements
History of computing |
https://en.wikipedia.org/wiki/General%20Motors%20Local%20Area%20Network | General Motors Local Area Network (GMLAN) is an application- and transport-layer protocol using controller area network for lower layer services. It was standardized as SAE J2411 for use in OBD-II vehicle networks.
Transport-layer services
Transport-layer services include the transmission of multi-CAN-frame messages based on the ISO 15765-2 multi-frame messaging scheme. It was developed and is used primarily by General Motors for in-vehicle communication and diagnostics. GM's Tech2 uses the CANdi (Controller Area Network diagnostic interface) adapter to communicate over GMLAN.
Applications
Some software applications that allow interfacing to GMLAN are Intrepid Control Systems, Inc.'s Vehicle Spy 3; Vector's CANoe; Dearborn Group's Hercules, ETAS' ES-1222, ES590, ES715, and ES580; ScanTool.net's OBDLink MX; EControls by Enovation Controls' CANCapture; and GMLAN vehicle universal remote control GMRC for Android devices
Tesla uses J2411 (single-wire CAN over the Control Pilot) for their DC Supercharger (newer units are also capable of PLC over the control pilot) and AC Destination Charging.
References
General Motors
Serial buses |
https://en.wikipedia.org/wiki/Tread%20Marks | Tread Marks is a 3D, third-person perspective, multiplayer-focused tank combat and racing computer game developed by Independent video game developer Longbow Digital Arts. The game won the 2000 Independent Games Festival grand prize, later renamed to the Seumas McNally Grand Prize in honor of the game's lead programmer Seumas McNally who died on 21 March 2000, after receiving the award. A notable feature of the game is fully deformable terrain.
Gameplay
The tanks come in two varieties: steel and liquid. The steel tanks resemble real-life tanks, while the liquid types are whimsical fantasy tanks. Weapons and power-ups are scattered around the maps, and range in destructive power from light machine guns to tactical nuclear missiles.
The game features three gameplay modes:
Race mode, in which tanks must race around an off-road course while attempting to stop other tanks from completing the course. Common techniques include using the in-game weapons to attack opponents and using physical tank contact to temporarily 'push' opponents off the course.
Battle mode (deathmatch, or DM), in which the tank or team with the most kills win as soon as the global kill or time limit is reached.
Capture the Flag mode (CTF) in which there are two or more teams of tanks that compete by trying to capture one of the other team's flags.
The race and battle modes can be played in either team or single-player mode. Tread Marks can be played over a LAN, or over the Internet and includes a program for running a dedicated game server, which lists the computer it runs from on the master server. The master server in turn is operated by Longbow Digital Arts from a location in Toronto, Ontario, Canada. Many modifications can be found online, including new maps, tanks, and weapons.
History
Development
The game was developed by Seumas McNally and uses OpenGL to render its 3D graphics and the Miles Sound System for positional sound. A notable feature is the in-game deformable terrain which doesn't harm performance. For instance, a nuclear missile explosion creates a huge black crater in the terrain, while its "opposite", the Matterbomb, creates a huge mountain on the terrain. For the in-game deformable terrain a Binary-Triangle Tree-based dynamic view dependent level of detail height field renderer was utilized.
Open Sourcing
On January 20, 2017 the game was released as freeware and the source code as open-source under the GPLv3 license on GitHub. For enhanced cross platform portability, the Miles Sound System was replaced with OpenAL, and the platform dependent Win32 API code with SFML and Qt. A port to Linux and MacOS is in progress. In September 2017 a version for the Linux-based OpenPandora was released.
Reception
At the time of release, the game received above-average reviews according to the review aggregation website GameRankings.
It won the 2000 Independent Games Festival grand prize, later renamed to the Seumas McNally Grand Prize in honor of the game's lead |
https://en.wikipedia.org/wiki/World%20Community%20Grid | World Community Grid (WCG) is an effort to create the world's largest volunteer computing platform to tackle scientific research that benefits humanity. Launched on November 16, 2004, with proprietary Grid MP client from United Devices and adding support for Berkeley Open Infrastructure for Network Computing (BOINC) in 2005, World Community Grid eventually discontinued the Grid MP client and consolidated on the BOINC platform in 2008. In September 2021, it was announced that IBM transferred ownership to the Krembil Research Institute of University Health Network in Toronto, Ontario.
World Community Grid utilizes unused processing power of consumer devices (PCs, Laptops, Android Smartphones, etc.) to analyse data created by the research groups that participate in the grid. WCG projects have analysed data related to the human genome, the human microbiome, HIV, dengue, muscular dystrophy, cancer, influenza, Ebola, Zika virus, virtual screening, rice crop yields, clean energy, water purification and COVID-19, among other research areas.
There are currently five active projects and 26 completed projects. Several of these projects have published peer-reviewed papers based on the analysis of the data generated by WCG. These include an OpenZika project paper on the discovery of a compound (FAM 3) that inhibits the NS3 Helicase protein of the Zika virus, thus reducing viral replication by up to 86%; a FightAIDS@home paper on the discovery of new vulnerabilities on the HIV-1 Capsid protein which may allow for a new drug target; a FightAIDS@home paper on new computational drug discovery techniques for more refined and accurate results.
History
In 2003, IBM and other research participants sponsored the Smallpox Research Grid Project to accelerate the discovery of a cure for smallpox. The smallpox study used a massive distributed computing grid to analyse compounds' effectiveness against smallpox. The project allowed scientists to screen 35 million potential drug molecules against several smallpox proteins to identify good candidates for developing into smallpox treatments. In the first 72 hours, 100,000 results were returned. By the end of the project, 44 strong treatment candidates had been identified. Based on the success of the Smallpox study, IBM announced the creation of World Community Grid on November 16, 2004, with the goal of creating a technical environment where other humanitarian research could be processed.
World Community Grid initially only supported Windows, using the proprietary Grid MP software from United Devices which powered the grid.org distributed computing projects. Demand for Linux support led to the addition in November 2005 of open source Berkeley Open Infrastructure for Network Computing (BOINC) software which powers projects such as SETI@home and Climateprediction. Mac OS and Linux support was added since the introduction of BOINC. In 2007, the World Community Grid migrated from Grid MP to BOINC for all of its supported platf |
https://en.wikipedia.org/wiki/Stepping | Stepping may refer to:
Walking, one of the main gaits of locomotion among legged animals
Computing
Stepping level, an aspect of microprocessor version designation
Stepping (debugging), a method of debugging
Dance
Chicago stepping, a type of dance originating in Chicago
Step dance, generic term for dance styles where the footwork is the most important part of the dance
Stepping (African-American), a percussive dance in which the participant's entire body is used as an instrument
Steppin', album by the Pointer Sisters
See also
Step (disambiguation)
Stepping stone (disambiguation)
Mast Stepping |
https://en.wikipedia.org/wiki/Rhode%20Island%20Computer%20Museum | The Rhode Island Computer Museum is a vintage computer museum located in Warwick, Rhode Island, United States. The museum's Learning Lab and display space are in the lower level of the La-Z-Boy building at 1755 Bald Hill Road, Warwick, RI 02886. The museum's warehouse is in Bldg 310 Compass Circle, Suite C, North Kingstown. With technology’s rapid transformation, the rich history of the development of computers and digital technology can easily get lost, and the museum aims to preserve this history to inspire young people with an interest in technology.
The official purpose of the museum is “procuring and preserving whatever relates to computer science and its history, disseminating knowledge, and encouraging research in computer science by means of visits, lectures, discussions, and publications.”
History
The museum began in 1996 with a core group, all of whom had been members of a British sports car club. Talking among themselves, the eventual founders of the museum decided that a former computer museum in Boston was failing to inform and inspire future generations about the origins of the computer.
The museum was formally established as a 501(c)(3) nonprofit in 1999.
In 2015, the museum also started leasing space in the Meadows Professional Office Complex to offer a more interactive experience, including classes for the community and students.
Collection
The museum occupies 5,000 square feet of warehouse space housing software and hardware spanning decades, books, computers, printers, floppy disks, hard drives, and many other electronic items. People from around the country have made donations to the collection. The museum also sometimes refurbishes computers and other hardware and donated it to people in the community who otherwise could not afford these items.
On display are a number of personal microcomputers from the United States and UK, and mainframe computers (e.g. DEC VAXes, Wang 2200-VP, DEC PDP-8, -9, -10, -11, -12, etc.). The collection also includes examples of Sequent multi-processor machines, a Data General Eclipse from the Harvard Cyclotron, one of two surviving Astronautics, and a large selection of Wang VS machines.
The museum's Learning Lab is open 10am to 5pm, only on Saturdays, and has about two dozen active volunteer members who both care for and explain the collection. The Lab and Warehouse are open at other times by appointment.
Educational outreach
Members of the RICM run programming and robotics workshops at public libraries in Rhode Island and host their own workshops in the museum. Known as the "Learning Lab", the RICM offers classes for students interested in the uses of digital and traditional media to promote creativity, critical thinking, and hands-on computer learning opportunities. Workshop offerings include computer coding with Minecraft, dissecting electronic devices, using Raspberry Pis (credit-card sized computers), and operating with Arduinos (open software program used for interactive project |
https://en.wikipedia.org/wiki/Autovivification | In the Perl programming language, autovivification is the automatic creation of new arrays and hashes as required every time an undefined value is dereferenced. Perl autovivification allows a programmer to refer to a structured variable, and arbitrary sub-elements of that structured variable, without expressly declaring the existence of the variable and its complete structure beforehand.
In contrast, other programming languages either: 1) require a programmer to expressly declare an entire variable structure before using or referring to any part of it; or 2) require a programmer to declare a part of a variable structure before referring to any part of it; or 3) create an assignment to a part of a variable before referring, assigning to or composing an expression that refers to any part of it.
Perl autovivification can be contrasted against languages such as Python, PHP, Ruby, and many of the C style languages, where dereferencing null or undefined values is not generally permitted. It can be compared to the HTML standard's "named access on the window object" which results in corresponding globally scoped variables being automatically accessible to browser-based JavaScript.
Hashes
It is important to remember that autovivification happens when an undefined value is dereferenced. An assignment is not necessary. The debugger session below illustrates autovivification of a hash just from examining it:
DB<1> x \%h
0 HASH(0x2f1a248)
empty hash
DB<2> x $h{1}{2}{3}{4}
0 undef
DB<3> x \%h
0 HASH(0x2f1a248)
1 => HASH(0x2f1a260)
2 => HASH(0x29a3c68)
3 => HASH(0x2dc3038)
empty hash
DB<4>
The debugger session below illustrates autovivification of a hash from assigning to an inner hash:
DB<1> $h{A}{B}{C}{D}=1
DB<2> x \%h
0 HASH(0x83c71ac)
'A' => HASH(0x837d50c)
'B' => HASH(0x83c71e8)
'C' => HASH(0x83c7218)
'D' => 1
DB<3>
Hashes several layers deep were created automatically without any declarations. Autovivification can prevent excessive typing. If Perl did not support autovivification, the structure above would have to be created as follows:
DB<1> %h = (A => {B => {C => {D => 1}}})
DB<2> x \%h
0 HASH(0x83caba4)
'A' => HASH(0x83cfc28)
'B' => HASH(0x83cab74)
'C' => HASH(0x83b6110)
'D' => 1
DB<3>
File and directory handles
Perl 5.6.1 and newer support autovivification of file and directory handles. Calling open() on an undefined variable will set it to a filehandle. According to perl561delta, "[t]his largely eliminates the need for typeglobs when opening filehandles that must be passed around, as in the following example:
for my $file ( qw(this.conf that.conf) ) {
my $fin = open_or_throw('<', $file);
process_conf($fin);
# no close() needed
}
use Carp;
sub open_or_throw {
my ($mode, $filename) = @_;
open my $h, $mode, $filename
or croak "Could not open '$filename': $!";
return $h;
}
Emulation in other |
https://en.wikipedia.org/wiki/DigiBarn%20Computer%20Museum | The DigiBarn Computer Museum, or simply DigiBarn, is a computer history museum in Boulder Creek, California, United States. The museum is housed in a 90-year-old barn constructed from old-growth Redwood in the Santa Cruz Mountains, which is adjacent to Silicon Valley. It was co-founded by Bruce Damer and Allan Lundell on May 7, 2001.
The primary focus of the museum's collection is on the birth and evolution of personal, interactive computing, starting with the LINC (1962), considered by some to be the first true personal computer, and leading on up through the homebrew microcomputer revolution of the 1970s, the propagation of personal computing to homes and businesses in the 1980s and the spread of networked computing in the 1990s. The Digibarn does have a few large machines on display such as a Cray-1 supercomputer. One notable point is that a large number of the Digibarn artifacts are available to visitors in a hands-on fashion, allowing them to boot up, load software and interact with the machines.
The Digibarn collection has mainly been donated by individuals and companies in nearby Silicon Valley and around the world. The Digibarn has a major focus on the legacy of Xerox and the birth of the graphical user interface with a large collection of Apple products, although other historic computer systems are featured, including the Atari 400, Osborne 1, Kaypro II and the IBM 5150 (IBM PC).
As of December 2021, most of the collection is on a long-term loan at the System Source Computer Museum.
References
External links
DigiBarn Computer Museum website
Computer museums in California
Museums in Santa Cruz County, California
Museums established in 2001
2001 establishments in California |
https://en.wikipedia.org/wiki/PANA | PANA may refer to:
The Panafrican News Agency, based in Senegal
A former name of the Islamic Republic News Agency, based in Iran
The Protocol for carrying Authentication for Network Access
PANA in telecommunications refers to a plain analog loop, also known as a dry pair or BANA (basic analog loop)
Napakiak Airport (ICAO location indicator: PANA), in Napakiak, Alaska, United States
See also
Pana (disambiguation) |
https://en.wikipedia.org/wiki/Trans-Lux | Trans-Lux is a company that specializes in designing, selling, leasing, and maintaining multi-color, real-time data and LED large-screen electronic information displays, but is primarily known as a major supplier of national stock ticker displays for stock exchanges. These indoor and outdoor displays are used worldwide in many industries, including banking, gaming, corporate, retail, healthcare, sports, transportation and in the financial industry.
Early history
The company was created by Percy Norman Furber, an Englishman, who moved to the United States in October 1918, after a time spent drilling for oil and mining quicksilver in Mexico. Furber was interested in developing a projection system that could be used in a lighted room. To help with this he enlisted the aid of a friend, Arthur Payne, a former employee of Thomas Edison. Payne had the idea of rear projection; projecting an image through a screen rather than on it. However, this concept required a finer and more translucent screen-material than what was available at that time.
Moving light
In 1920, Furber formed American Lux (Latin for "light") Products. Three years later, using a fine high-quality natural silk American Lux Products managed to create its first successful screen. With initial sales going mostly to schools and churches. It was only after a visit to the New York Stock Exchange that Furber saw a truly profitable application for rear projection screens. At that time, brokers obtained the latest stock quotes from a glass dome-topped ticker. This information was provided by Western Union's telegraph and/or wire service. The machine printed the results onto a long thin piece of paper known as a ticker tape, with the brokers closest to the printer having the advantage. Prior to this invention, any stock information was hand-written, usually on a chalk board. Although the results were less immediate, they were better displayed. Furber combined the best aspects of both methods, by enlarging the stock quotations from the running ticker tape and displaying them onto a rear projection screen. In 1923, the company installed the first "Movie ticker" ticker tape projection system at the New York Stock Exchange. Like every ticker of the time it was a mechanical format, but by using yellow dots on a black background it gave the illusion of electronically generated green letters and numbers.
It is this stock ticker that provided the company's name: "Trans-Lux" meaning "moving light".
Financing this new operation required more capital, so Furber took his company public on August 26, 1925. It was listed on the New York Curb Exchange, which later became the American Stock Exchange. Until being delisted in 2011, Trans-Lux stock was the oldest company to be listed on the American Stock Exchange. In 1925, the company had 41 installations on stock exchange floors and brokerage house boardrooms throughout the country.
Moving pictures
By 1927 the company had created a much larger, commer |
https://en.wikipedia.org/wiki/Level%20of%20detail%20%28computer%20graphics%29 | In computer graphics, level of detail (LOD) refers to the complexity of a 3D model representation. LOD can be decreased as the model moves away from the viewer or according to other metrics such as object importance, viewpoint-relative speed or position.
LOD techniques increase the efficiency of rendering by decreasing the workload on graphics pipeline stages, usually vertex transformations.
The reduced visual quality of the model is often unnoticed because of the small effect on object appearance when distant or moving fast.
Although most of the time LOD is applied to geometry detail only, the basic concept can be generalized. Recently, LOD techniques also included shader management to keep control of pixel complexity.
A form of level of detail management has been applied to texture maps for years, under the name of mipmapping, also providing higher rendering quality.
It is commonplace to say that "an object has been LOD-ed" when the object is simplified by the underlying LOD-ing algorithm as well as a 3D modeler manually creating LOD models.
Historical reference
The origin of all the LOD algorithms for 3D computer graphics can be traced back to an article by James H. Clark in the October 1976 issue of Communications of the ACM.
At the time, computers were monolithic and rare, and graphics were being driven by researchers. The hardware itself was completely different, both architecturally and performance-wise. As such, many differences could be observed with regard to today's algorithms but also many common points.
The original algorithm presented a much more generic approach to what will be discussed here. After introducing some available algorithms for geometry management, it is stated that most fruitful gains came from "...structuring the environments being rendered", allowing to exploit faster transformations and clipping operations.
The same environment structuring is now proposed as a way to control varying detail thus avoiding unnecessary computations, yet delivering adequate visual quality:
The proposed algorithm envisions a tree data structure which encodes in its arcs both transformations and transitions to more detailed objects. In this way, each node encodes an object and according to a fast heuristic, the tree is descended to the leaves which provide each object with more detail. When a leaf is reached, other methods could be used when higher detail is needed, such as Catmull's recursive subdivision.
The paper then introduces clipping (not to be confused with culling although often similar), various considerations on the graphical working set and its impact on performance, interactions between the proposed algorithm and others to improve rendering speed.
Well known approaches
Although the algorithm introduced above covers a whole range of level of detail management techniques, real world applications usually employ specialized methods tailored to the information being rendered. Depending on the requirements of the situatio |
https://en.wikipedia.org/wiki/ROAM | Real-time optimally adapting mesh (ROAM) is a continuous level of detail algorithm that optimizes terrain meshes. On modern computers, sometimes it is more effective to send a small amount of unneeded polygons to the GPU, rather than burden the CPU with LOD (Level of Detail) calculations—making algorithms like geomipmapping more effective than ROAM. This technique is used by graphics programmers
in order to produce high quality displays while being able to maintain real-time frame rates. Algorithms such as ROAM exist to provide a control over scene quality versus performance in order to provide HQ scenes while retaining real-time frame rates on hardware. ROAM largely aims toward terrain visualization, but various elements from ROAM are difficult to place within a game system.
To assist regional geological mapping, more abundant and visualized expression forms are highly needs. Thus, the 3D terrain model is adopted as the carrier for the demands in many correlative fields. Based on the regular grid DEM (Digital Elevation Model) in DRGS, ROAM algorithm is applied to create a more dynamic model, which will give consideration to the importance of different features and select correspondence level of detail.
Original Paper
The algorithm was introduced in the paper " ROAMing Terrain: Real-time Optimally Adapting Meshes" appearing in the Proceedings of IEEE Visualization 1997. The authors are
Mark Duchaineau
Murray Wolinsky
David E. Sigeti
Mark C. Miller
Charles Aldrich
Mark B. Mineev-Weinstein
See also
Geomipmapping
References
External links
ROAM:Terrain Visualization in Games
ROAM homepage
ROAM white paper (PDF)
Fast Terrain Rendering using Geometrical Mipmapping Willem H. de Boer
Computer graphics algorithms |
https://en.wikipedia.org/wiki/Mark%20Overmars | Markus Hendrik Overmars (; born 29 September 1958 in Zeist, Netherlands) is a Dutch computer scientist and teacher of game programming known for his game development application GameMaker. GameMaker lets people create computer games using a drag-and-drop interface. He is the former head of the Center for Geometry, Imaging, and Virtual Environments at Utrecht University, in the Netherlands. This research center concentrates on computational geometry and its application in areas like computer graphics, robotics, geographic information systems, imaging, multimedia, virtual environments, and games.
Overmars received his Ph.D. in 1983 from Utrecht University under the supervision of Jan van Leeuwen, and continued to be a member of the faculty of the same university until September 2013. Overmars has published over 100 journal papers, largely on computational geometry, and is the co-author of several books including a widely used computational geometry text.
Overmars has also worked in robotics. He was the first to develop the probabilistic roadmap method in 1992, which was later independently discovered by Kavraki and Latombe in 1994. Their joint paper, Probabilistic roadmaps for path planning in high-dimensional configuration spaces, is considered one of the most influential studies in motion planning, and has been widely cited (more than 2500 times as of 2014 according to Google Scholar).
In 2011, Overmars and game designer Jochem Schut developed a snake video game called Super Snake HD as a mobile app; it was published by YoYo Games.
Overmars founded and was CTO of Tingly Games from 2012 until it was acquired by CoolGames in 2016. Tingly focused on HTML5 games and e-cards / casual games, the latter of which is called "greeting games".
He founded Quarterfall in June 2020 together with Arjan Egges. Quarterfall is a teaching product that helps teachers use formative assessment to improve the learning processes their students, compared to just assessing their performance.
He is also the original author of the XForms toolkit.
Books
2nd ed., 2000; 3rd ed., 2008.
References
1958 births
Living people
Researchers in geometric algorithms
Dutch computer scientists
Dutch computer programmers
Roboticists
People from Zeist
Utrecht University alumni
Academic staff of Utrecht University
Dutch software engineers |
https://en.wikipedia.org/wiki/Friends%20of%20the%20Earth%20%28EWNI%29 | Friends of the Earth England, Wales and Northern Ireland (also known as FoE EWNI) is one of 75 national groups around the world which make up the Friends of the Earth network of environmental organisations. It is usually referred to as just 'Friends of the Earth' within its home countries.
History
Friends of the Earth in England was founded in 1971, two years after the group was first founded in San Francisco in 1969. Its first leader was Graham Searle, a former vice president of the National Union of Students. In 1975, Searle documented the New Zealand Beech Forest Controversy for Friends of the Earth during a year's sabbatical in that country. One of the early campaigns of the newly founded organisation was to dump almost 1000 glass bottles in front of the HQ of soft drinks giant Schweppes in Connaught House, London in protest at the company's policy of having non-returnable bottles. Other initial activities focused on opposing an open cast copper mine in the Snowdonia National Park (which led to an early victory when this was stopped) and on work to save endangered species. This grew into the world-wide 'Save the Whale' campaigns by FoE, Greenpeace and others.
Campaigning for safe energy was also an early issue, in which FoE EWNI were supported by US expert Amory Lovins. Opposition to nuclear power and support for renewable energy was a core campaign issue which developed into work on climate change – now in 2020 the central theme for FoE EWNI work.
Local action across the UK is a distinguishing feature of FoE EWNI, which has a network of licensed 'local groups' that enjoy a degree of autonomy over the issues on which they work. Soon after the launch in 1971 there were eight local branches and by 1976 there were 140. In 1978 groups in Scotland split off to form their own organisation, FoE Scotland. In 1980 FoE had 250 groups and 17,000 registered supporters, but the growth of the peace movement and CND from 1980–84 saw support move away and FoE downsizing to 12 staff.
In 1984 Jonathan Porritt, a former teacher and chairman of the Ecology Party (renamed the Green Party in 1985), became the director of the organisation. Porritt left in 1990, by which time membership had grown to 226,000 and staff numbers from 12 to over 100.
The next executive director was Dave Gee, followed by Charles Secrett who held the position till 2003. Between 2003 and 2008, FoE EWNI's executive director was Tony Juniper who in 2019 became Chair of Natural England. From 2006–2008 FoE played a lead role in the campaign (known as the 'Big Ask') for a UK Climate Act, which became law in 2008. From 2015–2020 Craig Bennett was Chief Executive, who left to become Director of the Wildlife Trusts. Miriam Turner and Hugh Knowles were appointed Co-CEOs in January 2021.
Structure and funding
FoE EWNI has a dual structure, comprising a trust, which is a registered charity, and a limited company, which carries out political campaigning – UK legislation limits how far a charity |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.