source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/PERQ | The PERQ, also referred to as the Three Rivers PERQ or ICL PERQ, was a pioneering workstation computer produced in the late 1970s through the early 1980s. In June 1979, the company took its very first order from the UK's Rutherford Appleton Laboratory and the computer was officially launched in August 1979 at SIGGRAPH in Chicago. It was the first commercially produced personal workstation with a Graphical User Interface. The design was heavily influenced by the original workstation computer, the Xerox Alto, which was never commercially produced. The origin of the name "PERQ" was chosen both as an acronym of "Pascal Engine that Runs Quicker," and to evoke the word perquisite commonly called perks, that is employee additional benefits.
The workstation was conceived by six former Carnegie Mellon University alumni and employees, Brian S. Rosen, James R. Teter, William H. Broadley, J. Stanley Kriz, Raj Reddy and Paul G. Newbury, who formed the startup Three Rivers Computer Corporation (3RCC) in 1974. Brian Rosen also worked at Xerox PARC on the Dolphin workstation. As a result of interest from the UK Science Research Council (later, the Science and Engineering Research Council), 3RCC entered into a relationship with the British computer company International Computers Limited (ICL) in 1981 for European distribution, and later co-development and manufacturing. The PERQ was used in a number of academic research projects in the UK during the 1980s. 3RCC was renamed PERQ System Corporation in 1984. It went out of business in 1986, largely due to competition from other workstation manufacturers such as Sun Microsystems, Apollo Computer and Silicon Graphics.
Hardware
Processor
The PERQ CPU was a microcoded discrete logic design, rather than a microprocessor. It was based around 74S181 bit-slice ALUs and an Am2910 microcode sequencer. The PERQ CPU was unusual in having 20-bit wide registers and a writable control store (WCS), allowing the microcode to be redefined. The CPU had a microinstruction cycle period of 170 ns (5.88 MHz).
PERQ 1
The original PERQ (also known as the PERQ 1), launched in 1980, was housed in a pedestal-type cabinet with a brown fascia and an 8-inch floppy disk drive mounted horizontally at the top.
The PERQ 1 CPU had a WCS comprising 4k words of 48-bit microcode memory. The later PERQ 1A CPU extended the WCS to 16k words. The PERQ 1 could be configured with 256 kB, 1MB or 2 MB of 64-bit-wide RAM (accessed via a 16-bit bus), a 12 or 24 MB, 14-inch Shugart SA-4000-series hard disk, and an 8-inch floppy disk drive. The internal layout of the PERQ 1 was dominated by the vertically mounted hard disk drive. It was largely this that determined the height and depth of the chassis.
A basic PERQ 1 system comprised a CPU board, a memory board (incorporating the framebuffer and monitor interface) and an I/O board (IOB, also called CIO). The IOB included a Zilog Z80 microprocessor, an IEEE-488 interface, an RS-232 serial port, hard and flopp |
https://en.wikipedia.org/wiki/Overlay%20network | An overlay network is a computer network that is layered on top of another network.
Structure
Nodes in the overlay network can be thought of as being connected by virtual or logical links, each of which corresponds to a path, perhaps through many physical links, in the underlying network. For example, distributed systems such as peer-to-peer networks and client–server applications are overlay networks because their nodes run on top of the Internet.
The Internet was originally built as an overlay upon the telephone network, while today (through the advent of VoIP), the telephone network is increasingly turning into an overlay network built on top of the Internet.
Uses
Enterprise networks
Enterprise private networks were first overlaid on telecommunication networks such as Frame Relay and Asynchronous Transfer Mode packet switching infrastructures but migration from these (now legacy) infrastructures to IP based MPLS networks and virtual private networks started (2001~2002).
From a physical standpoint, overlay networks are quite complex (see Figure 1) as they combine various logical layers that are operated and built by various entities (businesses, universities, government etc.) but they allow separation of concerns that over time permitted the buildup of a broad set of services that could not have been proposed by a single telecommunication operator (ranging from broadband Internet access, voice over IP or IPTV, competitive telecom operators etc.).
Internet
Telecommunication transport networks and IP networks (which combined make up the broader Internet) are all overlaid with at least an optical fiber layer, a transport layer and an IP or circuit switching layers (in the case of the PSTN).
Over the Internet
Nowadays the Internet is the basis for more overlaid networks that can be constructed in order to permit routing of messages to destinations not specified by an IP address. For example, distributed hash tables can be used to route messages to a node having a specific logical address, whose IP address is not known in advance.
Overlay networks have also been proposed as a way to improve Internet routing, such as through quality of service guarantees to achieve higher-quality streaming media. Previous proposals such as IntServ, DiffServ, and IP multicast have not seen wide acceptance, largely because they require modification of all routers in the network. On the other hand, an overlay network can be incrementally deployed on end-hosts running the overlay protocol software, without cooperation from ISPs. The overlay has no control over how packets are routed in the underlying network between two overlay nodes, but it can control, for example, the sequence of overlay nodes a message traverses before reaching its destination.
For example, Akamai Technologies manages an overlay network which provides reliable, efficient content delivery (a kind of multicast). Academic research includes End System Multicast and Overcast, which is mult |
https://en.wikipedia.org/wiki/Key-based%20routing | Key-based routing (KBR) is a lookup method used in conjunction with distributed hash tables (DHTs) and certain other overlay networks. While DHTs provide a method to find a host responsible for a certain piece of data, KBR provides a method to find the closest host for that data, according to some defined metric. This may not necessarily be defined as physical distance, but rather the number of network hops.
Key-based routing networks
Freenet
GNUnet
Kademlia
Onion routing
Garlic routing
See also
Public-key cryptography
Distributed Hash Table - Overlay Network
Anonymous P2P
References
Anonymity networks
Routing
File sharing networks
Distributed data storage
Network architecture
Cryptographic protocols
Key-based routing |
https://en.wikipedia.org/wiki/Kind | Kind or KIND may refer to:
Concepts
Kindness, the human behaviour
Kind, a basic unit of categorization
Kind (type theory), a concept in logic and computer science
Natural kind, in philosophy
Created kind, often abbreviated to kinds, a creationist category of life forms
In kind, for non-monetary transactions
Radio and television stations
KIND (AM), a radio station (1010 AM) licensed to Independence, Kansas, United States
KIND-FM, a radio station (94.9 FM) licensed to Elk City, Kansas, United States
KIND-LP, a low-power radio station (94.1 FM) licensed to serve Oxnard, California, United States
KBIK, a radio station (102.9 FM) licensed to Independence, Kansas, United States that held the call sign KIND-FM from 1980 to 2010
Other uses
Kind (company), an American snack food manufacturer
Kids in Need of Defense, a children's rights organization co-founded by actress Angelina Jolie
Kind (album), a 2019 album by Stereophonics
Kind (surname), a list of people with the surname
Kind (horse) (foaled 2001), an Irish Thoroughbred racehorse
Kind Hundred, a hundred divided between Halland, Småland and Västergötland, Sweden
Indianapolis International Airport (ICAO code:KIND), an airport Indiana, United States
See also
Kinda (disambiguation) |
https://en.wikipedia.org/wiki/Jun%27ichi%20Kanemaru | is a Japanese voice actor and singer employed by 81 Produce as of 2020. His roles include Hayato Kazami in Future GPX Cyber Formula, Ryo Akiyama in Digimon Tamers and Sonic the Hedgehog in the eponymous series since 1998. He came in eighth in the Seiyū Grand Prix in 1994.
Career
When he was studying child psychology as a college student, Kanemaru was working part-time at the Far East Network in Yokota Air Base. At the same time, he was recruited while working as a studio DJ at a department store in Shinjuku, and a few days later he participated in the dubbing session for Urusei Yatsura. After that, he took part in several of Fuji TV's Saturday evening shows such as High School! Kimengumi, Tsuide ni Tonchinkan, and Meimon! Dai San Yakyūbu. At the time, he was employed by Beniya 25-Ji and Dojinsha Production. He got his first lead role in 1991's Future GPX Cyber Formula, where he played Hayato Kazami. He found out about it the day before the recording, when he heard an answering machine on his trip, and rushed home to read the script on the day of the recording. When he appeared in Cyber Formula, he was also working as an English tutor, and one of his students' parents leaked information about him, causing a huge commotion in the adjacent shopping district as anime fans rushed to the place where he was teaching.
During the dubbing of an American television sitcom Growing Pains, a SEGA official who came to look for the role of Sonic heard Kanemaru's performance in the waiting room and cast him in the role of Sonic in Sonic Adventure. This established a new character for Sonic, who could freely switch between English and Japanese, and also led to Kanemaru's own characteristics. His performance in the Sonic series also led to offers from Disney to record children's programs. For Sonic the Hedgehog, the live-action adaptation of the Sonic series, Sonic's voice actor for the Japanese dub was changed to actor Taishi Nakagawa, and at the time of the announcement of the film's release, Kanemaru took to Twitter to express his thoughts and support for the film version of Sonic.
In an interview with Animate Times in 2016, Kanemaru recalled that Cyber Formula helped him get used to singing, as the series had monthly album releases at the time. He was the first in the voice acting industry to be allowed to cover "Ue o Muite Arukō" and recorded it with an a cappella chorus. On his 1993 album Inspired Colors, he also wrote and composed the song "12-Gatsu no Fairy Tale", as well as English covers of "Video Killed the Radio Star" and Kazumasa Oda's "Love Story wa Totsuzen ni" under the title "suddenly" (using the lyrics from Rita Coolidge's version). He has also tried his hand at standard jazz and has performed several live shows with several fellow voice actors, and his jazz numbers mixed with English and Japanese lyrics written himself are well received by all ages.
Filmography
Anime
Films
Video games
Drama CDs
Tokusatsu
Dubbing
References
External li |
https://en.wikipedia.org/wiki/Rollback%20%28data%20management%29 | In database technologies, a rollback is an operation which returns the database to some previous state. Rollbacks are important for database integrity, because they mean that the database can be restored to a clean copy even after erroneous operations are performed. They are crucial for recovering from database server crashes; by rolling back any transaction which was active at the time of the crash, the database is restored to a consistent state.
The rollback feature is usually implemented with a transaction log, but can also be implemented via multiversion concurrency control.
Cascading rollback
A cascading rollback occurs in database systems when a transaction (T1) causes a failure and a rollback must be performed. Other transactions dependent on T1's actions must also be rollbacked due to T1's failure, thus causing a cascading effect. That is, one transaction's failure causes many to fail.
Practical database recovery techniques guarantee cascadeless rollback, therefore a cascading rollback is not a desirable result. Cascading rollback is scheduled by dba.
SQL
SQL refers to Structured Query Language, a kind of language used to access, update and manipulate database.
In SQL, ROLLBACK is a command that causes all data changes since the last START TRANSACTION or BEGIN to be discarded by the relational database management systems (RDBMS), so that the state of the data is "rolled back" to the way it was before those changes were made.
A ROLLBACK statement will also release any existing savepoints that may be in use.
In most SQL dialects, ROLLBACKs are connection specific. This means that if two connections are made to the same database, a ROLLBACK made in one connection will not affect any other connections. This is vital for proper concurrency.
See also
Savepoint
Commit
Undo
Schema migration
Notes
References
"ROLLBACK Transaction", Microsoft SQL Server.
"Sql Commands", MySQL.
Database theory
Transaction processing
Reversible computing |
https://en.wikipedia.org/wiki/MML%20%28programming%20language%29 | A man–machine language (MML) is a specification language. MMLs are typically defined to standardize the interfaces for managing a telecommunications or network device from a console.
ITU-T Z.300 series recommendations define an MML, that has been extended by Telcordia Technologies (formerly Bellcore) to form Transaction Language 1.
Further reading
Specification languages
ITU-T recommendations |
https://en.wikipedia.org/wiki/Guidelines%20for%20the%20Definition%20of%20Managed%20Objects | The Guidelines for the Definition of Managed Objects (GDMO) is a specification for defining managed objects of interest to the Telecommunications Management Network for use in CMIP.
GDMO to the Structure of Management Information for defining a management information base for SNMP. For example, both represent a hierarchy of managed objects and use ASN.1 for syntax.
GDMO is defined in ISO/IEC 10165 and ITU-T X.722.
Network management
ITU-T recommendations
ITU-T G Series Recommendations |
https://en.wikipedia.org/wiki/Stop%20word | Stop words are the words in a stop list (or stoplist or negative dictionary) which are filtered out (i.e. stopped) before or after processing of natural language data (text) because they are insignificant. There is no single universal list of stop words used by all natural language processing tools, nor any agreed upon rules for identifying stop words, and indeed not all tools even use such a list. Therefore, any group of words can be chosen as the stop words for a given purpose. The "general trend in [information retrieval] systems over time has been from standard use of quite large stop lists (200–300 terms) to very small stop lists (7–12 terms) to no stop list whatsoever".
History of stop words
A predecessor concept was used in creating some concordances. For example, the first Hebrew concordance, Isaac Nathan ben Kalonymus's , contained a one-page list of unindexed words, with nonsubstantive prepositions and conjunctions which are similar to modern stop words.
Hans Peter Luhn, one of the pioneers in information retrieval, is credited with coining the phrase and using the concept when introducing his Keyword-in-Context automatic indexing process. The phrase "stop word", which is not in Luhn's 1959 presentation, and the associated terms "stop list" and "stoplist" appear in the literature shortly afterward.
Although it is commonly assumed that stoplists include only the most frequent words in a language, it was C.J. Van Rijsbergen who proposed the first standardized list which was not based on word frequency information. The "Van list" included 250 English words. Martin Porter's word stemming program developed in the 1980s built on the Van list, and the Porter list is now commonly used as a default stoplist in a variety of software applications.
In 1990, Christopher Fox proposed the first general stop list based on empirical word frequency information derived from the Brown Corpus:This paper reports an exercise in generating a stop list for general text based on the Brown corpus of 1,014,000 words drawn from a broad range of literature in English. We start with a list of tokens occurring more than 300 times in the Brown corpus. From this list of 278 words, 32 are culled on the grounds that they are too important as potential index terms. Twenty-six words are then added to the list in the belief that they may occur very frequently in certain kinds of literature. Finally, 149 words are added to the list because the finite state machine based filter in which this list is intended to be used is able to filter them at almost no cost. The final product is a list of 421 stop words that should be maximally efficient and effective in filtering the most frequently occurring and semantically neutral words in general literature in English.
In SEO terminology, stop words are the most common words that many search engines used to avoid for the purposes of saving space and time in processing of large data during crawling or indexing.
For some search en |
https://en.wikipedia.org/wiki/Hans%20Peter%20Luhn | Hans Peter Luhn (July 1, 1896 – August 19, 1964) was a German researcher in the field of computer science and Library & Information Science for IBM, and creator of the Luhn algorithm, KWIC (Key Words In Context) indexing, and Selective dissemination of information ("SDI"). His inventions have found applications in diverse areas like computer science, the textile industry, linguistics, and information science. He was awarded over 80 patents.
Life
Luhn was born in Barmen, Germany (now part of Wuppertal) on July 1, 1896. After he completed secondary school, Luhn moved to Switzerland to learn the printing trade so he could join the family business. His career in printing was halted by his service as a communications officer in the German Army during World War I. After the war, Luhn entered the textile field, which eventually led him to the United States, where he invented a thread-counting gauge (the Lunometer) still on the market. From the late 1920s to the early 1940s, during which time he obtained patents for a broad range of inventions, Luhn worked in textiles and as an independent engineering consultant. He joined IBM as a senior research engineer in 1941, and soon became manager of the information retrieval research division.
His introduction to the field of documentation/information science came in 1947 when he was asked to work on a problem brought to IBM by James Perry and Malcolm Dyson that involved searching for chemical compounds recorded in coded form. He came up with a solution for that and other problems using punched cards, but often had to overcome the limitations of the available machines by coming up with new ways of using them. By the dawn of the computer age in the 1950s, software became the means to surmount the limitations inherent in the punched card machines of the past.
Luhn spent greater and greater amounts of time on the problems of information retrieval and storage faced by libraries and documentation centers, and pioneered the use of data processing equipment in resolving these problems. "Luhn was the first, or among the first, to work out many of the basic techniques now commonplace in information science." These techniques included full-text processing; hash codes; Key Word in Context indexing (see also Herbert Marvin Ohlman); auto-indexing; automatic abstracting and the concept of selective dissemination of information (SDI).
Luhn was a pioneer in hash coding. In 1953, he suggested putting information into buckets in order to speed up search. He did not only consider handling numbers more efficiently. He was applying his concepts to text as well. Luhn’s methods were improved by computer scientists decades after his inventions. Today, hashing algorithms are essential for many applications such as textual tools, cloud services, data-intensive research and cryptography among numerous other uses. It is surprising that his name and contributions to information handling are largely forgotten.
Two of Luhn's greatest ac |
https://en.wikipedia.org/wiki/AI%20%28computer%20virus%29 | AI is a computer virus which infects executable files. The virus is loaded into memory by running an infected file and then modifies the computer's run time operation and corrupts program and overlay files. It doesn't seem to work with all executables but does reliably infect standard DOS files. AI adds useless bytes to the end of infected files
References
External links
Computer Viruses (A), by Probert Encyclopedia
AI, by Symantec
DOS file viruses |
https://en.wikipedia.org/wiki/Australian%20Network%20Information%20Centre | The Australian Network Information Centre (AUNIC) was the national Internet registry for Australia. It is now disbanded, and its responsibilities undertaken by Asia-Pacific Network Information Centre which serves the entire Asia-Pacific region.
The technical role of .au domain registry is now performed by AusRegistry, overseen by industry regulator auDA.
External links
aunic.net - official site.
Internet in Australia
National Internet registries |
https://en.wikipedia.org/wiki/EML | EML or eml may refer to:
Computing
.eml, a file extension
Ecological Metadata Language
Election Markup Language
Emotion Markup Language
Other uses
East Malling railway station, in England
East Manchester Line, a tram line of the Manchester Metrolink
Eating Media Lunch, a satirical New Zealand news show
Eicher Motors, an Indian automobile engine manufacturer
Electronic Music Laboratories, an American audio synthesizer manufacturer
EML Sidecars, a Dutch sidecarcross and quad manufacturer
Environmental Measurements Laboratory of United States Department of Homeland Security
Euro Marine Logistics, a Belgian shipping company
Militärflugplatz Emmen, a Swiss military airfield
Estonian Navy Ship (Estonian: ), a ship prefix
WHO Essential Medicines List
eml, a deprecated ISO 639-3 code for the Emilian-Romagnol language
Earth-Moon-Libration points are points of equilibrium for small-mass objects in the Earth-Moon system |
https://en.wikipedia.org/wiki/Metro%20Radio | Metro Radio is an Independent Local Radio station based in Newcastle upon Tyne, England, owned and operated by Bauer as part of the Hits Radio network. It broadcasts to County Durham, Northumberland, and Tyne and Wear.
As of September 2023, the station has a weekly audience of 308,000 listeners according to RAJAR.
History
Launch
The Newcastle-based station, broadcasting to North-East England, launched on 15 July 1974. The first breakfast show was presented by Don Dwyer, an Australian radio presenter formerly at ABC and the United Biscuits Network. The first show included messages of congratulations from Kenny Everett at the equivalent local commercial station in London, Capital Radio.
Studios
The station transmitted from a studio in Swalwell, Gateshead, which in later years would be adjacent to the Metrocentre and is now Metropolitan House—a business centre providing serviced office accommodation. Metro, and sister station Magic 1152, moved in 2005 to the former BT building previously known as Swan Housenow known as 55° Northnext to the Tyne Bridge in Newcastle upon Tyne. In April 2021, it was announced that Metro Radio were relocating their studios once more. Later in 2021 as planned, they relocated their broadcasting studios to the Grade II listed building, Gainsborough House on Newcastle's Grey Street. Before the move, the studio had undergone a purposed fit-out which included 2 additional studios and a contemporary, flexible office space.
Football commentary
Until 2005 the station broadcast live football commentary for the region's two biggest clubs; Newcastle United and Sunderland. In an attempt to boost ratings, the football commentary was stopped. However, a negative response from football fans prompted the owners to cover all Newcastle and Sunderland games on sister station Magic 1152.
TFM co-location
From 8 April 2013, all Metro Radio's programming has been shared with TFM. However, the Metro Radio branding was retained along with separate advertising and local news bulletins. The two stations were able to co-locate without consultation, for the Metro Radio licence area is located in one approved broadcast area (north-east England).
Programming
Networked programming originates from Bauer's Manchester headquarters.
Regional programming is produced and broadcast from Bauer's Newcastle studios, weekdays 6-10am (Steve & Karen's Breakfast Show) and is syndicated with sister station TFM.
The station's long-running talk show Night Owls, presented by Alan Robson since 1983, ran for over 40 years before airing its final edition in June 2019. It then aired weekly on GHR North East and GHR Teesside until 24 April 2022, after which Robson moved into making material for online distribution only.
News
Bauer's Newcastle newsroom broadcasts local news bulletins hourly from 6am-7pm on weekdays, and from 7am-1pm on Saturdays and Sundays. Headlines are broadcast on the half-hour during weekday breakfast and drivetime shows, alongside traffic bul |
https://en.wikipedia.org/wiki/Smooth%20Lake%20District | Smooth Lake District is an Independent Local Radio station for the Lakes, owned and operated by Global and part of the Smooth network.
Overview
Originally known as Lakeland Radio, the station broadcasts from transmitters at Kendal on 100.1 MHz, the western side of Lake Windermere on 100.8 MHz and Keswick Forest on 101.4 MHz.
Originally licensed to serve the South Lakes, the station's coverage area extended northwards on 23 April 2013 when it began broadcasting to Keswick and surrounding villages. Part of the service area overlaps with that of its Lancaster-based sister station The Bay (now Heart North Lancashire & Cumbria).
On 20 November 2017, CN Group announced Lakeland Radio would be sold to Global along with sister station The Bay - the sale was finalised by 1 December 2017. Global later announced Lakeland Radio would become part of the Smooth network.
The Lakeland Radio brand and programming was phased out during February 2018 and following a transition period, the station was relaunched as Smooth Lake District at 6am on Monday 5 March 2018.
In September 2019, the station closed its Kendal studios and co-located with sister station Smooth North West in Manchester.
Following OFCOM's decision to relax local content obligations from commercial radio, Smooth's local Drivetime and weekend shows were replaced by network programming from London. Local news bulletins, traffic updates and advertising were retained, alongside the station's Lake District breakfast show.
Programming
Local programming is produced and broadcast from Global's Manchester studios from 6-10am on weekdays. All networked programming originates from Global's London headquarters, including The Smooth Drive Home with Angie Greaves.
News
Global's Newsroom broadcasts hourly local news bulletins from 6am-7pm on weekdays and from 6am-12pm at weekends.
National news updates air hourly from Global's London headquarters at all other times.
See also
Heart North Lancashire & Cumbria
References
External links
Smooth Lake District
Media UK
History of local radio in Cumbria
Kendal transmitter
Windermere transmitter
Radio stations in Cumbria
Lake District
Adult contemporary radio stations in the United Kingdom |
https://en.wikipedia.org/wiki/MFR%20%28radio%20station%29 | MFR is an Independent Local Radio station based in Inverness, owned and operated by Bauer as part of the Hits Radio Network. It broadcasts to Moray, the Scottish Highlands and South West Aberdeenshire.
As of September 2023, the station has a weekly audience of 101,000 listeners according to RAJAR.
Station information
MFR operates two separate services on 97.4 FM (from the Mounteagle transmitter) and 1107 AM. The first voice heard on MFR, shortly after 6:30am on 23 February 1982, was Dave Cochrane. The longest serving presenter on MFR of 33 years was Tich McCooey, leaving on 29 May 2015.
MFR on FM largely broadcasts contemporary and chart music-led programming alongside hourly news bulletins and peak-time traffic updates. The majority of the station's output is produced and broadcast from its Inverness studios. In recent years, MFR opted out on Saturday evenings for a weekly bilingual music programme in English and Scots Gaelic, which also aired on Argyll FM, Cuillin FM, Isles FM, Nevis Radio and Two Lochs Radio.
History
The station began broadcasting on 23 February 1982. A year later, the station was making a profit.
Until August 2014, MFR 2 on AM and DAB aired specialist programming on Sunday - Friday evenings with automated music broadcast at all other times. In September 2014, the station axed its specialist output and began carrying programming from Bauer's 'Greatest Hits Network' of Scottish AM stations, switching to the Bauer City 2 network in January 2015. Since January 2019 it is part of the Greatest Hits Radio network and changed its name to the network name in April 2023.
MFR 3 launched on Monday 19 January 2015, broadcasting on DAB and online as a locally branded relay of The Hits aimed at 15-25-year-olds, with opt-outs for advertising. MFR 3 ceased broadcasting on 31 August 2017 and was replaced with a single national feed of The Hits, which was replaced ten months later with Hits Radio.
In addition to the main services, there is a local community station which opts into MFR during the daytime, broadcasting local programming produced by a non-profit community group during the evenings.
Caithness FM (Caithness), used to use 102.5 FM from MFR but now broadcasts under its own licence on 106.5 FM.
There also used to be five other community stations taking MFR:
KCR 107.7FM (Keith, Moray), formerly known as Keith Community Radio, used to use 102.8 FM from MFR during evenings but now broadcasts under its own licence 24/7 on 107.7 FM.
SpeySound Radio (Aviemore), used to use 96.6 FM from MFR during evenings but now broadcasts under its own licence 24/7 on 107.1 FM.
Kinnaird Radio (Fraserburgh), used to use 96.7 FM from MFR during evenings but has now ceased broadcasting.
Oban FM (Oban) used to use 101.2 FM from MFR during their RSL period in October 1992 where MFR was broadcast on 101.2 FM in Oban in the early morning, afternoon and overnight hours, where both MFR and Oban FM carried London-based sustaining service Supergold co |
https://en.wikipedia.org/wiki/North%20Norfolk%20Radio | North Norfolk Radio was an Independent Local Radio station in North Norfolk, England, owned and operated by Bauer Radio as part of the Greatest Hits Radio network. It was closed on 1 September 2020 and merged with Greatest Hits Radio Norfolk & North Suffolk.
History
North Norfolk Radio was established following campaigns by several groups for a dedicated radio service for the area. Some of these groups ran restricted service licence (RSL) trial stations, including 106.9 FTR-FM (Fakenham – August 1997), Fakenham Community Radio (April/May 1999), Wensum FM (East Dereham – 3 trials between October 1999 & June 2001), Central Norfolk Radio (Fakenham – 5 trials between April 1999 and May 2001), Escape FM (Sheringham – July/August 2000) and Tindles own 87.7 The Beach (North Walsham – Christmas 2000 & Holt, Norfolk – June 2001).
On 14 November 2002, the Radio Authority formally advertised a new local commercial radio licence for the coastal area of North Norfolk, covering Wells-next-the-Sea and Cromer, and inland to include Fakenham. Potential applicants had around 16 weeks to submit their proposals to the Radio Authority. Two applicants submitted bids by the closing date of 4 March 2003: North Norfolk Radio (Tindle Radio) and Go-FM (Absolute Radio).
On 8 May 2003, the Radio Authority announced that Tindle, trading as North Norfolk Radio, had won the eight-year licence for a local commercial radio service. Tindle were the majority shareholders in the company (79%), with local directors taking the rest, including Angela Bond, a former producer for Kenny Everett. The chairman of the new station was Ian McNicol, owner of the Stody Estate.
The original team at NNR were Sharron Tuck (Station Manager), John Bultitude (Head of News) and presenters included former 1960s offshore radio broadcasters Andy Archer and Mike Ahern.
North Norfolk Radio originally broadcast from Breck Farm, Stody, Norfolk, from a converted milking parlour. The first test transmission were broadcast on 21 October 2003, when the main transmitter at Stody was switched on, transmitting on a frequency of 96.2 MHz VHF/FM, at a power of 2580 watts. After a few more weeks, relay transmitters at Aylmerton and Bunkers Hill were switched on and relayed the test transmissions from Stody. Both of these relay transmitters were tuned to 103.2 MHz VHF/FM at a power of 250 watts.
The station officially began broadcasting at 6am on Monday, 10 November 2003, with Mike Ahern as the first presenter on the station, although the first voice heard was that McNicol. The song that launched the station was "I Get The Sweetest Feeling" by Jackie Wilson.
Due to problems with reception in Fakenham, a 10-watt relay transmitter was built on the Holt Road water tower in the town. This began operating on 11 October 2005, transmitting on 96.2 MHz VHF/FM.
Unlike many other stations, North Norfolk Radio did not use radio links or rented landlines to get their studio output to their main transmitter, but used a 10 |
https://en.wikipedia.org/wiki/Cayley%E2%80%93Purser%20algorithm | The Cayley–Purser algorithm was a public-key cryptography algorithm published in early 1999 by 16-year-old Irishwoman Sarah Flannery, based on an unpublished work by Michael Purser, founder of Baltimore Technologies, a Dublin data security company. Flannery named it for mathematician Arthur Cayley. It has since been found to be flawed as a public-key algorithm, but was the subject of considerable media attention.
History
During a work-experience placement with Baltimore Technologies, Flannery was shown an unpublished paper by Michael Purser which outlined a new public-key cryptographic scheme using non-commutative multiplication. She was asked to write an implementation of this scheme in Mathematica.
Before this placement, Flannery had attended the 1998 ESAT Young Scientist and Technology Exhibition with a project describing already existing cryptographic techniques from the Caesar cipher to RSA. This had won her the Intel Student Award which included the opportunity to compete in the 1998 Intel International Science and Engineering Fair in the United States. Feeling that she needed some original work to add to her exhibition project, Flannery asked Michael Purser for permission to include work based on his cryptographic scheme.
On advice from her mathematician father, Flannery decided to use matrices to implement Purser's scheme as matrix multiplication has the necessary property of being non-commutative. As the resulting algorithm would depend on multiplication it would be a great deal faster than the RSA algorithm which uses an exponential step. For her Intel Science Fair project Flannery prepared a demonstration where the same plaintext was enciphered using both RSA and her new Cayley–Purser algorithm and it did indeed show a significant time improvement.
Returning to the ESAT Young Scientist and Technology Exhibition in 1999, Flannery formalised Cayley-Purser's runtime and analyzed a variety of known attacks, none of which were determined to be effective.
Flannery did not make any claims that the Cayley–Purser algorithm would replace RSA, knowing that any new cryptographic system would need to stand the test of time before it could be acknowledged as a secure system. The media were not so circumspect however and when she received first prize at the ESAT exhibition, newspapers around the world reported the story that a young girl genius had revolutionised cryptography.
In fact an attack on the algorithm was discovered shortly afterwards but she analyzed it and included it as an appendix in later competitions, including a Europe-wide competition in which she won a major award.
Overview
Notation used in this discussion is as in Flannery's original paper.
Key generation
Like RSA, Cayley-Purser begins by generating two large primes p and q and their product n, a semiprime. Next, consider GL(2,n), the general linear group of 2×2 matrices with integer elements and modular arithmetic mod n. For example, if n=5, we could write:
This gr |
https://en.wikipedia.org/wiki/Paul%20Baran | Paul Baran (born Pesach Baran ; April 29, 1926 – March 26, 2011) was a Polish-American engineer who was a pioneer in the development of computer networks. He was one of the two independent inventors of packet switching, which is today the dominant basis for data communications in computer networks worldwide, and went on to start several companies and develop other technologies that are an essential part of modern digital communication.
Early life
He was born in Grodno (then in the Second Polish Republic, and since 1945 part of Belarus) on April 29, 1926. He was the youngest of three children in his Lithuanian Jewish family, with the Yiddish given name "Pesach". His family moved to the United States on May 11, 1928, settling in Boston and later in Philadelphia, where his father, Morris "Moshe" Baran (1884–1979), opened a grocery store. He graduated from Drexel University (then called Drexel Institute of Technology) in 1949, with a degree in electrical engineering. He then joined the Eckert-Mauchly Computer Company, where he did technical work on UNIVAC models, the first brand of commercial computers in the United States. In 1955 he married Evelyn Murphy, moved to Los Angeles, and worked for Hughes Aircraft on radar data processing systems. He obtained his master's degree in engineering from UCLA in 1959, with advisor Gerald Estrin while he took night classes. His thesis was on character recognition. While Baran initially stayed on at UCLA to pursue his doctorate, a heavy travel and work schedule forced him to abandon his doctoral work.
Packet switched network design
After joining the RAND Corporation in 1959, Baran took on the task of designing a "survivable" communications system that could maintain communication between end points in the face of damage from nuclear weapons during the Cold War. Then, most American military communications used high-frequency connections, which could be put out of action for many hours by a nuclear attack. Baran decided to automate RAND Director Franklin R. Collbohm's previous work with emergency communication over conventional AM radio networks and showed that a distributed relay node architecture could be survivable. The Rome Air Development Center soon showed that the idea was practicable.
Using the minicomputer technology of the day, Baran and his team developed a simulation suite to test basic connectivity of an array of nodes with varying degrees of linking. That is, a network of n-ary degree of connectivity would have n links per node. The simulation randomly "killed" nodes and subsequently tested the percentage of nodes that remained connected. The result of the simulation revealed that networks in which n ≥ 3 had a significant increase in resilience against even as much as 50% node loss. Baran's insight gained from the simulation was that redundancy was the key. His first work was published as a RAND report in 1960, with more papers generalizing the techniques in the next two years.
After proving surv |
https://en.wikipedia.org/wiki/Heart%20Yorkshire | Heart Yorkshire (previously Real Radio Yorkshire) is a regional radio station owned by Communicorp UK and operated by Global as part of the Heart network. It broadcasts to South and West Yorkshire from studios in Leeds.
Overview
Real Radio
Real Radio Yorkshire launched on 25 March 2002. The station transmitted from Emley Moor on 106.2 MHz FM, which covers the majority of South Yorkshire and West Yorkshire, including York, Selby, Harrogate, Doncaster, Huddersfield, Leeds, Rotherham and Wakefield. It also broadcast from Idle on 107.6 MHz FM to Bradford and Halifax, and on 107.7 MHz FM from Tapton Hill to Sheffield. Real Radio Yorkshire also broadcast across the whole of Yorkshire on DAB using the Regional MXR multiplex.
Heart
On 25 June 2012 it was announced Global (the owner of stations such as Capital and Heart) had bought GMG Radio. The former GMG stations, including Real Radio, continued to operate separately as 'Real and Smooth Limited' until 1 April 2014.
On 6 February 2014, Global announced it would be rebranding all Real Radio stations as Heart. On 1 May 2014, local programming moved from Tingley, Wakefield to share facilities with sister station Capital Yorkshire in Hanover Walk, Leeds.
The full relaunch as Heart Yorkshire took place on Tuesday 6 May 2014. The station's audience share increased from 5.5% to over 7% following the relaunch. In June 2015 the Yorkshire MXR multiplex closed. Heart Yorkshire moved their services to local multiplexes in Leeds, Bradford and Sheffield, however they chose not to take up options in Hull and York.
In February 2019, following OFCOM's decision to relax local content obligations from commercial radio, Global announced it would replace Heart Yorkshire's local breakfast and weekend shows with networked programming from London.
As of 3 June 2019, the station's local output consists of a three-hour Drivetime show on weekdays, alongside local news bulletins, traffic updates and advertising.
Programming
All networked programming originates from Global's London headquarters, including Heart Breakfast, presented each weekday by Jamie Theakston and Amanda Holden.
Regional programming is produced and broadcast from Global's Leeds studios from 4-7pm on weekdays, presented by David Dixon and Emma Lenney.
News
Global's Leeds newsroom broadcasts hourly regional news bulletins from 6am-7pm on weekdays and 6am-12pm at weekends with headlines on the half hour during weekday breakfast and drivetime shows.
National news updates air hourly from Global's London headquarters at all other times. The Leeds newsroom also produces bulletins for Capital Yorkshire.
Former notable presenters
Wes Butters
Rich Clarke
Gary Davies
Daryl Denham
Martin Kelner
Debbie Lindley
Ryan Seacrest
Graeme Smith
Chris Tarrant
Kate Thornton
References
External links
Heart Yorkshire
Adult contemporary radio stations in the United Kingdom
Communicorp
Yorkshire
Mass media in Leeds
Radio stations established in 2002
Radio stations |
https://en.wikipedia.org/wiki/Ad%20hoc%20On-Demand%20Distance%20Vector%20Routing | Ad hoc On-Demand Distance Vector (AODV) Routing is a routing protocol for mobile ad hoc networks (MANETs) and other wireless ad hoc networks. It was jointly developed by Charles Perkins (Sun Microsystems) and Elizabeth Royer (now Elizabeth Belding) (University of California, Santa Barbara) and was first published in the ACM 2nd IEEE Workshop on Mobile Computing Systems and Applications in February 1999.
AODV is the routing protocol used in Zigbee – a low power, low data rate wireless ad hoc network. There are various implementations of AODV such as MAD-HOC, Kernel-AODV, AODV-UU, AODV-UCSB and AODV-UIUC.
The original publication of AODV won the SIGMOBILE Test of Time Award in 2018. According to Google Scholar, this publication reached 30,000 citations at the end of 2022. AODV was published in the Internet Engineering Task Force (IETF) as Experimental RFC 3561 in 2003.
See also
Wireless ad hoc networks
Backpressure routing
Mesh networking
Wireless mesh network § Routing protocols
List of ad hoc routing protocols
References
Ad hoc routing protocols |
https://en.wikipedia.org/wiki/Red%20hatter | A red hatter could be :
A member of the Red Hat Society
A proponent of the Red Hat distribution of the Linux Operating System
Someone who wears a red hat |
https://en.wikipedia.org/wiki/Husby%20%28estate%29 | Husby is the name of many present-day Swedish (and other Scandinavian) farms and villages.
Originally, they formed a network of royal estates, called Uppsala öd, that were the property of the Swedish king. There were about 70 husbys and they are most common in eastern Svealand, of which 25 are found in Uppland. There were a few outside this area, such as Husaby in Västergötland.
A Husby consisted of a big and centrally located farm, and they may have originally been the property of local strongmen who were defeated by the Swedish kings. During the 13th century a more efficient administration rendered them obsolete.
References
Husby — from Contemporary terms for central places in prehistoric and medieval Scandinavia
Medieval Sweden |
https://en.wikipedia.org/wiki/Backspace | Backspace () is the keyboard key that originally pushed the typewriter carriage one position backwards and in modern computer systems moves the display cursor one position backwards, removes the character at that position, and shifts back the cursor back by one position.
Typewriter
In some typewriters, a typist would, for example, type a lowercase letter A with acute accent (á) by typing a lowercase letter A, backspace, and then the acute accent key. This technique (also known as overstrike) is the basis for such spacing modifiers in computer character sets such as the ASCII caret (^, for the circumflex accent). Backspace composition no longer works with typical modern digital displays or typesetting systems. It has to some degree been replaced with the combining diacritical marks mechanism of Unicode, though such characters do not work well with many fonts, and precomposed characters continue to be used. Some software like TeX or Microsoft Windows use the opposite method for diacritical marks, namely positioning the accent first, and then the base letter on its position.
Computers
Although the term "backspace" is the traditional name of the key which deletes the character to the left of the cursor, the actual key may be labeled in a variety of ways, for example delete, Erase (for example in One Laptop Per Child), or with a left pointing arrow. A dedicated symbol for "backspace" exists as U+232B ⌫ but its use as a keyboard label is not universal.
The backspace is distinct from the delete key, which in paper media for computers would punch out all the holes to strike out a character, and in modern computers deletes text following it. Also, the delete key often works as a generic command to remove an object (such as an image inside a document, or a file in a file manager), while backspace usually does not.
Common use
In modern systems, the backspace key is often mapped to the delete character (0x7f in ASCII or Unicode), although the backspace key's function of deleting the character before the cursor remains.
The backspace key is commonly used to go back a page or up one level in graphical web or file browsers.
^H
Pressing the backspace key on a computer terminal would generate the ASCII code 08, BS or Backspace, a control code which would delete the preceding character. That control code could also be accessed by pressing Control-H, as H is the eighth letter of the Latin alphabet. Terminals which did not have the backspace code mapped to the function of moving the cursor backwards and deleting the preceding character would display the symbols ^H (caret, H) when the backspace key was pressed. Even if a terminal did interpret backspace by deleting the preceding character, the system receiving the text might not. Then, the sender's screen would show a message without the supposedly deleted text, while that text, and the deletion codes, would be visible to the recipient. This sequence is still used humorously for epanorthosis by computer litera |
https://en.wikipedia.org/wiki/Datagram%20Congestion%20Control%20Protocol | In computer networking, the Datagram Congestion Control Protocol (DCCP) is a message-oriented transport layer protocol. DCCP implements reliable connection setup, teardown, Explicit Congestion Notification (ECN), congestion control, and feature negotiation. The IETF published DCCP as , a proposed standard, in March 2006. provides an introduction.
Operation
DCCP provides a way to gain access to congestion-control mechanisms without having to implement them at the application layer. It allows for flow-based semantics like in Transmission Control Protocol (TCP), but does not provide reliable in-order delivery. Sequenced delivery within multiple streams as in the Stream Control Transmission Protocol (SCTP) is not available in DCCP. A DCCP connection contains acknowledgment traffic as well as data traffic. Acknowledgments inform a sender whether its packets have arrived, and whether they were marked by Explicit Congestion Notification (ECN). Acknowledgements are transmitted as reliably as the congestion control mechanism in use requires, possibly completely reliably.
DCCP has the option for very long (48-bit) sequence numbers corresponding to a packet ID, rather than a byte ID as in TCP. The long length of the sequence numbers aims to guard against "some blind attacks, such as the injection of DCCP-Resets into the connection".
Applications
DCCP is useful for applications with timing constraints on the delivery of data. Such applications include streaming media, multiplayer online games and Internet telephony. In such applications, old messages quickly become useless, so that getting new messages is preferred to resending lost messages. such applications have often either settled for TCP or used User Datagram Protocol (UDP) and implemented their own congestion-control mechanisms, or have no congestion control at all. While being useful for these applications, DCCP can also serve as a general congestion-control mechanism for UDP-based applications, by adding, as needed, mechanisms for reliable or in-order delivery on top of UDP/DCCP. In this context, DCCP allows the use of different, but generally TCP-friendly congestion-control mechanisms.
Implementations
The following operating systems implement DCCP:
FreeBSD, version 5.1 as patch
Linux since version 2.6.14 , but marked deprecated since version 6.4 due to lack of maintenance and scheduled for removal in 2025.
Userspace library:
DCCP-TP implementation is optimized for portability, but has had no changes since June 2008.
GoDCCP purpose of this implementation is to provide a standardized, portable NAT-friendly framework for peer-to-peer communications with flexible congestion control, depending on application.
Packet Structure
The DCCP generic header takes different forms depending on the value of X, the Extended Sequence Numbers bit. If X is one, the Sequence Number field is 48 bits long, and the generic header takes 16 bytes, as follows.
If X is zero, only the low 24 bits of the |
https://en.wikipedia.org/wiki/Strachey%20method%20for%20magic%20squares | The Strachey method for magic squares is an algorithm for generating magic squares of singly even order 4k + 2. An example of magic square of order 6 constructed with the Strachey method:
Strachey's method of construction of singly even magic square of order n = 4k + 2.
1. Divide the grid into 4 quarters each having n2/4 cells and name them crosswise thus
2. Using the Siamese method (De la Loubère method) complete the individual magic squares of odd order 2k + 1 in subsquares A, B, C, D, first filling up the sub-square A with the numbers 1 to n2/4, then the sub-square B with the numbers n2/4 + 1 to 2n2/4,then the sub-square C with the numbers 2n2/4 + 1 to 3n2/4, then the sub-square D with the numbers 3n2/4 + 1 to n2. As a running example, we consider a 10×10 magic square, where we have divided the square into four quarters. The quarter A contains a magic square of numbers from 1 to 25, B a magic square of numbers from 26 to 50, C a magic square of numbers from 51 to 75, and D a magic square of numbers from 76 to 100.
3. Exchange the leftmost k columns in sub-square A with the corresponding columns of sub-square D.
4. Exchange the rightmost k - 1 columns in sub-square C with the corresponding columns of sub-square B.
5. Exchange the middle cell of the leftmost column of sub-square A with the corresponding cell of sub-square D. Exchange the central cell in sub-square A with the corresponding cell of sub-square D.
The result is a magic square of order n=4k + 2.
References
See also
Conway's LUX method for magic squares
Siamese method
Magic squares |
https://en.wikipedia.org/wiki/Treehouse%20of%20Horror%20%28The%20Simpsons%20episode%29 | "Treehouse of Horror" is the third episode of the second season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 25, 1990. The episode was inspired by 1950s horror comics, and begins with a disclaimer that it may be too scary for children. It is the first Treehouse of Horror episode. These episodes do not obey the show's rule of realism and are not treated as canon. The opening disclaimer and a panning shot through a cemetery with humorous tombstones were features that were used sporadically in the Treehouse of Horror series and eventually dropped. This is also the first episode to have the music composed by Alf Clausen.
The plot revolves around three scary stories told by the Simpson children in the family's treehouse. The first segment involves a haunted house that is based on various haunted house films, primarily The Amityville Horror (1979) and Poltergeist (1982). In the second segment, Kang and Kodos are introduced when the Simpsons are abducted by aliens. The third segment is an adaptation of Edgar Allan Poe's 1845 poem "The Raven". James Earl Jones guest starred in all three segments. The episode was received positively, being included on several critics' "best of" lists. Critics singled out The Raven for praise, although Simpsons creator Matt Groening was concerned that it would be seen as pretentious.
Plot
On Halloween, Bart and Lisa sit in the treehouse and tell scary stories. Homer, who had just come home from trick or treating, eavesdrops on them.
In "Bad Dream House", Bart tells a story where the Simpsons move into an eighteen bedroom house they got a good deal on. The walls of the cursed house begin to bleed and objects begin to fly through the air, Lisa senses an evil presence in the house (judging by the ghostly, echoing voice that tells the family to get out). There is also a portal to another dimension, a vortex, in the kitchen: Homer tests it out by throwing an orange in it. A piece of paper is thrown back at him as a response (on it is written "Quit throwing your garbage into our dimension"). Marge expresses the desire to leave, but Homer asks her to sleep on it. That night, the house possesses Homer and the children, manipulating their minds and making them chase each other with axes and knives. Unlike the others however, Marge is using her knife to spread mayonnaise on a sandwich and intervenes, breaking the trance. Afterwards, Lisa discovers the source of the haunting—a Native American burial ground hidden in the basement. After the house threatens them again, Marge confronts the house, demanding that it treat them with respect during their stay. The house thinks it over and opts to destroy itself rather than live with the Simpsons.
In "Hungry Are the Damned", Bart tells a story where the Simpsons are abducted from their backyard by two aliens named Kang and Kodos. The aliens take the Simpsons to their home planet Rigel IV for a feast. En ro |
https://en.wikipedia.org/wiki/Transfer%20Pak | The Transfer Pak is a removable accessory for the Nintendo 64 controller that fits into its expansion port. When connected, it allows for the transfer of data between supported Nintendo 64 (N64) games and Game Boy or Game Boy Color (GBC) games. By using the Transfer Pak, players can unlock additional content in compatible games; the Pokémon Stadium games, with which the Transfer Pak was initially bundled for sale, also feature the ability to emulate specific Game Boy Pokémon titles for play on the N64.
The Transfer Pak was supported by roughly 20 N64 games worldwide, only six of which supported it outside of Japan. Several games which initially planned to utilize the accessory were either cancelled or had the functionality removed. As a result, while recognized as one of the first examples of connectivity between Nintendo's home consoles and handhelds, the Transfer Pak has come to be retrospectively regarded as largely unnecessary by members of the gaming press.
History
The Transfer Pak was first revealed at Nintendo's Space World 1997 trade show. It was released in Japan in August 1998 as a pack-in with the game Pocket Monsters' Stadium, which required the Transfer Pak for many of its features. In North America and Europe, the Transfer Pak was similarly bundled with Pokémon Stadium, which released in February and April 2000 respectively.
Unlike the Super Game Boy peripheral, which allowed Game Boy games to be played on the Super Nintendo Entertainment System, the Transfer Pak's primary use was not to play Game Boy games on the Nintendo 64. Nintendo and Intelligent Systems developed a separate accessory to serve this function, the Wide-Boy64, but it did not receive a wide release and was instead only available to game developers and members of the gaming press. However, the Pokémon Stadium games included a built-in Game Boy emulator, allowing users to play compatible Pokémon games on the N64 by inserting them into the Transfer Pak. In 2019, an independent software developer created a ROM hack of Pokémon Stadium 2 that expanded the emulator’s compatibility to include other Game Boy games.
Some games with planned Transfer Pak support went unreleased. One of these was Cabbage, a Nintendo 64DD breeding simulator game, which would have featured the Transfer Pak as a major gameplay component. The game was planned to allow players to transfer their pet to the Game Boy and continue to nurture it throughout the day. It was also suggested that special inexpensive Game Boy cartridges would contain new content, such as additional events and items, that could be transferred into Cabbage.
Other games were intended to include Transfer Pak features during development, only to remove them prior to release. WWF No Mercy was meant to use the Transfer Pak to import points earned in its Game Boy Color counterpart, which could be spent on rewards in the Nintendo 64 game's "SmackDown Mall". However, this feature was removed following the cancellation of the GBC v |
https://en.wikipedia.org/wiki/She%20of%20Little%20Faith | "She of Little Faith" is the sixth episode of the thirteenth season of the American animated television series The Simpsons. It first aired in the United States on the Fox network on December 16, 2001. In the episode, Bart Simpson and his father Homer accidentally launch a model rocket into the Springfield church, causing the church council to accept funding plans from Mr. Burns for reparation.
Discontent with how commercialized the rebuilt church has become, Lisa abandons Christianity and seeks out to follow a new religion.
The episode was directed by Steven Dean Moore and written by Bill Freiberger, whom executive producer and show runner Al Jean had met while working on the television series Teen Angel. The plot idea for the episode was pitched by Jean, who wanted to expand on Lisa's personality, even though some of the Simpsons writers were concerned over the episode's originality. Lisa has remained a Buddhist since this episode. The episode features actor Richard Gere, who agreed to star as long as Buddhism was portrayed accurately, and as long as Lisa would say "Free Tibet".
The episode was nominated for the Primetime Emmy Award for Outstanding Animated Program (For Programming less than One Hour) in 2002, which it ultimately lost to the Futurama episode, "Roswell That Ends Well".
Following the thirteenth season's release on DVD and Blu-ray, the episode received mostly positive reviews from critics.
Plot
While watching a 1950s science fiction movie, Bart and Lisa see a commercial for a model rocket kit and Bart orders it by using Homer's credit card number. Homer helps Bart and Milhouse build it, but it blows up before launching. Jealous that Ned Flanders built a superior rocket, Homer enlists the help of his former nerdy college roommates, Gary, Doug, and Benjamin, to build a rocket piloted by the hamster Nibbles. The rocket lifts off successfully, but it develops complications and Nibbles bails out. Homer attempts to shoot down the rocket with a 12 gauge shotgun, but the rocket crashes into the church. The church council meets up to decide how to come up with money to fund the repairs to the church. With no other aid available, they accept help from Mr. Burns and Lindsay Naegle, who wish to run the church as a business. The two rebuild the church as a commercial monstrosity, complete with advertising signs, a currency exchanger, a Lard Lad statue, a photo booth for the churchgoers to put their faces in a cut-out of Jesus from The Last Supper, and a Jumbotron known as "Godcam". Lisa is appalled at this and after Lovejoy welcomes The Noid to hold a sermon "on the sanctity of deliciousness," she abandons the church, feeling her religion has lost its soul.
That night, Lisa prays to God and assures him she has not turned her back on Him, but plans to seek a new path to “Him” (or “Her,” she says). While on a walk around town, passing many sacrilegious signs, she finds Springfield's Buddhist temple. Inside she sees Lenny and Carl meditatin |
https://en.wikipedia.org/wiki/Vib-Ribbon | (stylized vib-ribbon) is a 1999 rhythm video game developed by NanaOn-Sha and published by Sony Computer Entertainment. It was released for the PlayStation in Japan on December 9, 1999, and in Europe on September 1, 2000. Although the original PlayStation version was never released in North America, the game was re-released on PlayStation Network in North America in 2014.
The game was initially commissioned as an advertisement for the Mercedes-Benz A-Class car. After design issues surfaced with the car and the ad plan was dropped, development continued as a stand-alone game. Masaya Matsuura, the producer of PaRappa the Rapper and Um Jammer Lammy, returned to lead Vib-Ribbon. The game's software loads into RAM, letting the player use any music CD to play custom levels; the game can generate a unique level from any track on the CD. The graphics for Vib-Ribbon are simple, consisting of straight, white vector lines forming crude, angular drawings of the level and the player character, named Vibri.
Vib-Ribbon has received generally positive reviews from critics, praising its minimalist visuals and innovative concept, and has garnered a cult following; though the game has also received negative reviews criticizing its simplistic gameplay and design. It spawned two Japan-only follow-ups: Mojib-Ribbon (2003) and Vib-Ripple (2004).
Gameplay
Vib-Ribbon is a rhythm game in which players guide Vibri the rabbit across a line filled with obstacles tied in correspondence to the beat of the song, in a dimension called Music World. Stages contain four basic obstacles; block, loop, wave, and pit, which require players to press the L1, R1, X, or Down buttons respectively at the right time to navigate. Sometimes two obstacles will be merged, requiring the player to press two buttons at the same time (for example, a block and pit combination will require players to press L1 and Down together). Not pushing a button at the right time turns Vibri into a scribbled version of herself temporarily. Getting hit by obstacles too many times will degenerate Vibri from a rabbit into a frog, followed by a worm. Getting hit too many times while in worm form will end the game. Successful actions will help Vibri recover back to her higher forms, and clear enough obstacles in succession while in the rabbit form will evolve Vibri into Super Vibri, increasing the player's score until Vibri is hit.
The player's score is tallied via symbols during the gameplay and converted into points at the end of the run. Earning a high score will cause Vibri to sing a congratulatory song based on their position. The base game features six songs divided into bronze, silver, and gold courses containing two songs each.
Once the game is loaded onto the PlayStation, players can remove the disc and insert their own music CDs to play stages generated from its tracks. Players have the option of selecting a single track from the CD or playing all tracks consecutively. Difficulty varying depending on the |
https://en.wikipedia.org/wiki/TI-74 | The Texas Instruments TI-74 Basicalc is a type of programmable calculator, which was released in 1985 to replace the Compact Computer 40.
The TI-74's architecture is descended from the never-released TI CC-40 Plus. TI utilized the CC-40 Plus ROM to create the TI-74's BIOS; it removed the CC-40's internal debugger to gain enough space to add calculator mode to the TI-74. The CC-40 Plus' cassette routines were reused in the TI-74, and the CC-40's Hexbus port underwent a physical footprint change and was renamed to Dockbus. The Hexbus protocol is 100% compatible between the CC-40 and TI-74 with an adapter.
One variant, the TI-74S, has a blank faceplate instead of secondary functions to allow for customization (otherwise it is the same as the 74). Both models accepted customized ROM-modules. The TI-95, released at the same time, was a keystroke programmable descendant of the TI-59 and TI-66, with the same general form factor, but a two-line display (the second line was for function key definitions).
Technical specifications
TMS70C46 CPU (C70009, another chip from TMS 7000 family also reported)
31 5×7 character LCD
32+4 KB ROM
8 KB RAM
RAM/ROM memory expansion port
Hexbus port
80 characters per line (31 visible)
powered by 4 AAA-size batteries
References
External links
TI-74 on MyCalcDB (database about 1970s and 1980s pocket calculators)
Texas Instruments programmable calculators
Pocket computers |
https://en.wikipedia.org/wiki/GML | GML may refer to:
Computing
Game Maker Language, the scripting language of Game Maker
Generalized Markup Language, a set of macros for the IBM text formatter, SCRIPT
Generative Modelling Language, an extension of PostScript used for the concise description of complex 3D shapes
Geography Markup Language, an XML grammar to express geographical features
Graffiti Markup Language, an XML-based file format that stores graffiti motion data
Graph Modelling Language, a hierarchical ASCII-based file format for describing graphs
Other uses
Canadian Gold Maple Leaf, a gold bullion coin
Gilmala Halt railway station (station code), in Pakistan
GML Heritage, an Australian heritage consultancy firm
Hostomel Airport (IATA code), in Ukraine
Gradient multilayer nanofilm, a nanomaterial
Grand Medal of Lotus Flower, an honour of Macau
Guardian Media Limited, a Trinidadian media company
Middle Low German (ISO 639-3 code), a formerly used European language
Glycerol monolaurate, a naturally occurring antimicrobial agent |
https://en.wikipedia.org/wiki/PWS | PWS may refer to:
Technology
Personal weather station
Personal web server, hardware and software used to run a web server on a desktop computer
Microsoft Personal Web Server, software for Windows operating systems
Present weather sensor, a device that detects and measures precipitation
Pressure wave supercharger, a type of super-charger
Progressive Web Site, a web authoring framework incorporating HTML5, CSS, and JavaScript
Public Warning System, used for alerting the public to events such as disasters
Other uses
Performance work statement, summarizing the work element of a contract
Podlaska Wytwórnia Samolotów, a Polish aircraft manufacturer
Prader–Willi syndrome, a genetic disorder
Purwosari railway station in Indonesia (station code PWS)
Winston Smith Project (Italian:Progetto Winston Smith), a human rights project |
https://en.wikipedia.org/wiki/WFS | WFS may stand for:
Wave field synthesis
Web Feature Service, a standard protocol for serving georeferenced map data over the Internet
Well-founded semantics
Wells Fargo Securities
William French Smith
Wilmington Friends School
Windows Fax and Scan
Women for Sobriety
World Flute Society
World Food Summit
World Fuel Services
World Future Society |
https://en.wikipedia.org/wiki/Darik%27s%20Boot%20and%20Nuke | Darik's Boot and Nuke, also known as DBAN , is a free and open-source project hosted on SourceForge. The program is designed to securely erase a hard disk until its data is permanently removed and no longer recoverable, which is achieved by overwriting the data with pseudorandom numbers generated by Mersenne Twister or ISAAC. The Gutmann method, Quick Erase, DoD Short (3 passes), and DOD 5220.22-M (7 passes) are also included as options to handle data remanence.
DBAN can be booted from a CD, DVD, USB flash drive or diskless using a Preboot Execution Environment. It is based on Linux and supports PATA (IDE), SCSI and SATA hard drives. DBAN can be configured to automatically wipe every hard disk that it sees on a system or entire network of systems, making it very useful for unattended data destruction scenarios. DBAN exists for x86 systems.
DBAN, like other methods of data erasure, is suitable for use prior to computer recycling for personal or commercial situations, such as donating or selling a computer, as well as disposing of hard drives.
Current status
In September 2012, Blancco of Finland announced its acquisition of DBAN.
The most recent version of DBAN, 2.3.0, was released on 4 June 2015. Since that time, DBAN development has ended and the DBAN official website is now used by Blancco to market their Blancco Drive Eraser instead.
nwipe
The dwipe program that DBAN uses has been forked and is available as a standalone command line program called nwipe, which is maintained by Martijn van Brummelen and released under the GNU General Public License 2.0 licence.
References
External links
SourceForge DBAN downloads
Data erasure software
Operating system distributions bootable from read-only media
Software using the GPL license
Year of introduction missing |
https://en.wikipedia.org/wiki/Universit%C3%A9%20du%20Qu%C3%A9bec%20en%20Abitibi-T%C3%A9miscamingue | The (UQAT) is a public university within the network, with campuses in Val-d'Or and Rouyn-Noranda. It takes its name from the region it primarily serves.
Programs
The offers 95 programs in administration, accounting, teaching, engineering, multimedia, psychology, nursing, social work, interactive multimedia, youth communications, and art therapy. Students can choose to specialize in the disciplines of Electromechanical Engineering and Mechanical Engineering.
History
The Université was founded in 1970 as "Services universitaires dans le Nord-Ouest québécois". The university was subsequently renamed "Direction des études universitaires dans l’Ouest québécois" (1972), "Centre d’études universitaires dans l’Ouest québécois" (1976), and "Centre d’études universitaires en Abitibi-Témiscamingue" (1981). The university has been known as since 1983, when it split away from the administration of the .
Residences
On-campus residences are now available in Rouyn-Noranda and Val-d'Or. Rental accommodations are also available in these communities.
Campuses
The is based in Rouyn-Noranda, Quebec. Additional satellite campuses are located in Val-d'Or (Centre d'Etude Supérieures Lucien-Cliche), which includes a pavilion for First Nations studies, and in Amos (Pavilion des Rapides), which specializes in forestry with a research centre focusing on ligniculture and silviculture, and in hydrogeology with a laboratory for groundwater research.
UQAT also has smaller learning centres in Notre-Dame-du-Nord, La Sarre, Matagami, and Duparquet.
Notable alumni
Notable people who have attended the university include:
Christine Moore – NDP politician
Further reading
Ferretti, Lucia. L'Université en réseau: les 25 ans de l'Université du Québec. Sainte-Foy: Presses de l'Université du Québec, 1994.
References
External links
Official site in French
Official site in English
Abitibi
Education in Abitibi-Témiscamingue
Rouyn-Noranda
Val-d'Or
Buildings and structures in Abitibi-Témiscamingue
Universities in Quebec |
https://en.wikipedia.org/wiki/Universit%C3%A9%20du%20Qu%C3%A9bec%20%C3%A0%20Chicoutimi | The (UQAC) is a branch of the network founded in 1969 and based in the Chicoutimi borough of Saguenay, Quebec, Canada. UQAC has secondary study centres in La Malbaie, Saint-Félicien, Alma, and Sept-Îles. In 2017, 7500 students were registered and 209 professors worked for the university, making it the fourth largest of the ten branches, after (UQAM), (UQTR), and (ETS).
Academics
It offers over forty undergraduate and graduate programs. The university is especially well known for its researchers in aluminium (with two research centres), forestry, icing (in French, givrage), geology and historical population studies.
In 2005, UQAC opened programs for students from foreign countries in partnership with universities from Morocco, Lebanon, China, Senegal, Colombia, and Brazil.
In 2006, Université de Sherbrooke opened a building of its medical school on UQAC's campus, allowing its students to register at UQAC for other courses, such as biology.
Engineering students can choose to specialize in the following disciplines: Computer Engineering, Geological Engineering and Génie unifié
UQAC also offers a number of French as a Second Language programs through its École de langue française et de culture québécoise (School of French language and Quebec culture)
In 2008, the School of Digital Arts, Animation and Design (commonly referred to as NAD) located in Montreal was merged with UQAC.
Notable faculty
Sarah-Jane Barnes
Gérard Bouchard
André Francoeur
:fr:Claude Villeneuve
Honoris Causa
UQAC has granted 23 honoris causa doctorates during its existence.
Mgr Victor Tremblay (1977)
Mgr Félix-Antoine Savard (1979)
Paul-Gaston Tremblay (1980)
Jacques Gagnon (posthumous, 1980)
Father Pierre-Paul Asselin (1981)
Jean-Paul Desbiens (1983)
François Brassard (posthumus, 1984)
Sister Imelda Dallaire (1984)
Father Georges-Henri Lévesque (1985)
Bernard Lamarre (1987)
Dr. Albert Jacquard (1987)
François Sénécal-Tremblay (1989)
Judge Pierre Bergeron (1992)
Jean-Marie Couët (1992)
Gérard Arguin (1994)
Carroll L'Italien (2001)
Michel Dumont (2001)
Gaston L. Tremblay (2004)
André Imbeau (2005)
Lucien Bouchard (2007)
Boutros Boutros-Ghali (2007)
Pierre Lavoie (2010)
Félix Blackburn (2013)
References
Further reading
Ferretti, Lucia. L'Université en réseau: les 25 ans de l'Université du Québec. Sainte-Foy: Presses de l'Université du Québec, 1994.
External links
UQAC Website
Université du Québec
Education in Saguenay, Quebec
Universities and colleges established in 1959
1959 establishments in Quebec
Universities in Quebec |
https://en.wikipedia.org/wiki/Paul%20Crouch | Paul Franklin Crouch /kraʊtʃ/ (March 30, 1934 – November 30, 2013) was an American television evangelist. Crouch and his wife, Jan, founded the Trinity Broadcasting Network (TBN) in 1973; the company has been described as "the world’s largest religious television network."
Biography
Crouch was born in St. Joseph, Missouri, the third son of oft-traveling Assemblies of God missionaries, Andrew F. Crouch (January 7, 1889 – June 1, 1941) and wife, the former Sara Swingle (September 26, 1891 – September 29, 1976). Crouch had two older brothers, the Rev. Philip Crouch (1918–2005), and John Mark Crouch (1923–1991). Crouch, whose father died when he was seven years old, was mainly raised by his mother with the help of his grandparents. He soon became interested in amateur radio and announced he would use such technology to send the Gospel around the world. He graduated from the Central Bible College (Assemblies of God) in Springfield, Missouri in 1955 with a degree in theology.
Crouch also received three honorary doctorates: a Doctor of Litterarum (D.Litt.) on May 29, 1981, from the California Graduate School of Theology, Glendale, California; a Doctor of Divinity on May 29, 1983, from the American Christian Theological Seminary, Anaheim, California; and a Doctor of Laws degree on May 5, 1985, from Oral Roberts University, Tulsa, Oklahoma.
Crouch and Janice Bethany met in 1957 and were married in Missouri. They have two sons, Paul Crouch, Jr. and Matthew Crouch.
Early broadcasting career
Crouch began his career in broadcasting by helping to build an educational AM station (KCBI) on campus while a student at Central Bible Institute and Seminary. In 1957 he became a radio announcer at KRSD in Rapid City, South Dakota, and progressed rapidly to program director. Shortly thereafter he was promoted to manager of sister station KRSD-TV, the NBC affiliate in Rapid City.
In 1961, he was appointed by the general council of the Assemblies of God to organize and operate their newly formed Department of Television and Film Production in Burbank, California, a position he held for four years. Crouch was responsible for the ongoing production of films focusing largely on foreign missions and foreign missionary works, as well as the Assemblies of God's large inventory of audiovisual materials and children's teaching aids.
From 1965 to 1970 Crouch was general manager of KREL radio in Corona, California. In 1966, he purchased a minority stock interest in KREL. During his time at KREL, he successfully completed the station's application for an increase in power to 5,000 watts.
After leaving KREL in 1970, Crouch was invited to serve as general manager for KHOF-FM and KHOF-TV in San Bernardino, California.
Trinity Broadcasting Network (TBN) history
Crouch left KHOF in 1973 and with his wife, Jan, founded the Trinity Broadcasting Network (TBN) along with Jim and Tammy Faye Bakker (the Bakkers left in 1975). In 1974, TBN purchased its first TV station, KLXA-TV (now K |
https://en.wikipedia.org/wiki/Jan%20Crouch | Janice Wendell Crouch () (née Bethany; May 14, 1938 – May 31, 2016) was an American religious broadcaster. Crouch and her husband, Paul, founded the Trinity Broadcasting Network (TBN) in 1973.
Early life and ministry
Crouch was the daughter of Reverend and Mrs. Edgar W. Bethany, and grew up in Columbus, Georgia. Her father served as an Assemblies of God pastor, and was the founding president of Southeastern University (Florida). While attending Evangel College in Springfield, Missouri, Crouch met Paul F. Crouch. They married in 1957, and have two sons, Paul Jr. and Matthew, both of whom are high-ranking officials and program hosts on TBN. Jan Crouch also loved children and was well known in the early days of TBN for a child's puppet (a little pink girl in a dress) she called Babushka.
TBN
Founding
In 1973, Paul and Jan Crouch co-founded Trinity Broadcasting Network (TBN) along with Jim and Tammy Faye Bakker (the Bakkers left in 1975). In 1974, TBN purchased its first TV station, KLXA-TV (channel 40, now KTBN-TV) in Southern California, and began distribution through cable systems in 1978. Under the Crouch family, TBN grew to become the United States' largest Christian television network, offering 24-hour commercial-free programming, and TBN is currently the third-largest over-the-air station group in the United States (measured as percentage of homes reached), with CBS, Fox, and NBC holding the 4th, 5th and 6th place, according to TV News Check's annual listing of the Top 30 station groups.
Growth of TBN
Since its founding, Crouch served as TBN's vice president and director of network programming, as well as the director of programming for TBN's affiliated networks, such as the Smile of a Child children's channel, the JUCE TV youth network, The Church Channel, the TBN Enlace USA Spanish language network, and others. She was also the President and manager of The Holy Land Experience theme park in Orlando, Florida. Jan Crouch and her husband Paul Crouch, senior also signed off on Matt Crouch (TBN) and his wife Laurie—now in charge at TBN, i.e. PTL (Praise the Lord) their signature & original show, as now becoming rather the primary hosts, as well as Behind the Scenes— to have produced over 4 plus major motion pictures, along with other associated and film entertainment groups to make namely Faith-based movies like 'End Times' films The Omega Code (1999) and its sequel Megiddo: The Omega Code 2 (2001).
Lawsuits
In March 2012, Crouch was accused by her granddaughter, a former employee and chief finance director of the network (a registered charity), of misappropriating network funds to spend on a lavish lifestyle. Expenditures included expensive homes, private jets, massive custom wigs, numerous face lifts and breast augmentations and a $100,000 air conditioned mobile home solely for her dogs. The New York Times wrote that Crouch, for nearly two years, rented adjoining rooms for herself and her two Maltese dogs at the deluxe Loews Portofino B |
https://en.wikipedia.org/wiki/CAAT | CAAT may refer to:
Civil Aviation Authority of Thailand, an independent agency of the Thai government.
Computer Assisted Auditing Techniques Techniques and computer programs that are developed to audit electronic data
Centro de Apoyo Académico y Tutorías Academic Student Support Services & Tutoring Center
Center for Alternatives to Animal Testing, a US research center
Campaign Against Arms Trade, a British campaigning organisation
The CAAT box in molecular genetics
The Children's Air Ambulance Trust, a fundraising organisation for the Children's Air Ambulance
Cornwall Air Ambulance Trust, a charity that maintains and runs the Cornwall air ambulance
Combined Anti-Armor Team - Highly mobile Anti-Armor teams used by the United States Marine Corps
Captive Air Amphibious Transporter, a DARPA tracked amphibious vehicle carrying containers from ship to shore
A Community Awareness Action Team based in Westminster, Colorado
Colleges of Applied Arts and Technology in the Canadian province of Ontario |
https://en.wikipedia.org/wiki/The%20Metadata%20Company | Metadata is the name of a US corporation and a registered trademark in the United States.
Though the term "metadata" has a common generic use in information technology, claims of trademark have since brought about legal threats against its use in the generic sense.
History
The word Metadata was registered in 1986 as a trademark (U.S. Trademark Registration No. 1,409,206) belonging to The Metadata Company.. It was acknowledged that the term was first used in 1981 and the first commercial use tracked to 1982. The trademark was granted incontestable status in 1991. Metadata is a proprietary mark which stands for The Metadata Company.
The Metadata Company has since attempted to threaten people legally into not using the word "metadata" in the generic sense. Many people believe that due to the widespread use of the word "metadata" in the generic sense as "data about data", it is likely that the "Metadata" trademark has entered the public domain by becoming a general term. This was the legal opinion expressed by the Office of the Solicitor of the United States Department of the Interior to the Federal Geographic Data Committee when the latter was threatened by Metadata's lawyers for its use of the word "metadata" in a generic sense. However, no judge has as yet ruled the trademark invalid.
References
External links
Official website
Companies based in Tennessee |
https://en.wikipedia.org/wiki/Cuthill%E2%80%93McKee%20algorithm | In numerical linear algebra, the Cuthill–McKee algorithm (CM), named after Elizabeth Cuthill and James McKee, is an algorithm to permute a sparse matrix that has a symmetric sparsity pattern into a band matrix form with a small bandwidth. The reverse Cuthill–McKee algorithm (RCM) due to Alan George and Joseph Liu is the same algorithm but with the resulting index numbers reversed. In practice this generally results in less fill-in than the CM ordering when Gaussian elimination is applied.
The Cuthill McKee algorithm is a variant of the standard breadth-first search
algorithm used in graph algorithms. It starts with a peripheral node and then
generates levels for until all nodes
are exhausted. The set is created from set
by listing all vertices adjacent to all nodes in . These
nodes are ordered according to predecessors and degree.
Algorithm
Given a symmetric matrix we visualize the matrix as the adjacency matrix of a graph. The Cuthill–McKee algorithm is then a relabeling of the vertices of the graph to reduce the bandwidth of the adjacency matrix.
The algorithm produces an ordered n-tuple of vertices which is the new order of the vertices.
First we choose a peripheral vertex (the vertex with the lowest degree) and set .
Then for we iterate the following steps while
Construct the adjacency set of (with the i-th component of ) and exclude the vertices we already have in
Sort ascending by minimum predecessor (the already-visited neighbor with the earliest position in R), and as a tiebreak ascending by vertex degree.
Append to the Result set .
In other words, number the vertices according to a particular level structure (computed by breadth-first search) where the vertices in each level are visited in order of their predecessor's numbering from lowest to highest. Where the predecessors are the same, vertices are distinguished by degree (again ordered from lowest to highest).
See also
Graph bandwidth
Sparse matrix
References
Cuthill–McKee documentation for the Boost C++ Libraries.
A detailed description of the Cuthill–McKee algorithm.
symrcm MATLAB's implementation of RCM.
reverse_cuthill_mckee RCM routine from SciPy written in Cython.
Matrix theory
Graph algorithms
Sparse matrices |
https://en.wikipedia.org/wiki/Aelle | Aelle, also seen as Ælle, Aella, or Ælla may refer to:
Aella, a data scientist that conducts research on topics of sex workers' rights issues
Ælle of Sussex, king of Sussex (r. 477–514)
Ælla of Deira (died 588), king of Deira
Ælla of Northumbria (died 867), king of Northumbria (r. 860s)
Aella (Amazon), an Amazon in Greek mythology |
https://en.wikipedia.org/wiki/Donald%20Bitzer | Donald L. Bitzer (born January 1, 1934) is an American electrical engineer and computer scientist. He was the co-inventor of the plasma display, is largely regarded as the "father of PLATO", and has made a career of improving classroom productivity by using computer and telecommunications technologies.
Education and career
He received three degrees in electrical engineering (B.S., 1955; M.S., 1956; Ph.D., 1960) from the University of Illinois at Urbana–Champaign.
Bitzer holds several patents in numerous areas, while the creation of the PLATO computer system, the first system to combine graphics and touch-sensitive screens, is the hallmark of his efforts.
Bitzer co-invented the flat plasma display panel in 1964. Originally invented as an educational aid to help students working in front of computers for long periods of time, plasma screens do not flicker and are a significant advance in television technology. The display was also a way of overcoming the limited memory of the computer systems being used.
In 1974, Bitzer was elected as a member into the National Academy of Engineering for his leadership in the utilization and development of technology for improving the effectiveness of education.
, Bitzer is a Distinguished University Research Professor of Computer Science at North Carolina State University.
Awards
In 1973 the National Academy of Engineering presented Bitzer with the Vladimir K. Zworykin Award, which honors the inventor of the iconoscope. The invention won the Industrial Research 100 Award in 1966.
Bitzer is a designated National Associate, an honor which was granted to him by the National Academies in 2002. He is also a member of the American Society for Engineering Education.
Member of the National Academy of Engineering (1974)
Computer Society Fellow of the Institute of Electrical and Electronics Engineers (1982)
Slottow Creativity Award (1989)
Emmy Award (2002)
Inducted into National Inventors Hall of Fame (2013)
Fellow of the National Academy of Inventors (2018).
Holladay Medal (2019).
References
External links
NCSU Faculty Page
Oral history interview with Donald L. Bitzer, Charles Babbage Institute, University of Minnesota. Bitzer discusses his relationship with Control Data Corporation (CDC) during the development of PLATO, a computer-assisted instruction system. He describes the interest in PLATO of Harold Brooks, a CDC salesman and his help in procuring a 1604 computer for Bitzer's use. Bitzer recalls the commercialization of PLATO by CDC and his disagreements with CDC over marketing strategy and the creation of courseware for PLATO.
Oral history interview with Thomas Muir Gallie, Charles Babbage Institute, University of Minnesota. Gallie, a program officer at the National Science Foundation (NSF), describes the impact of Don Bitzer and the PLATO system.
University of Illinois Computer-based Education Research Laboratory PLATO Reports, PLATO Documents, and CERL Progress Reports, Charles Babbage Institute, Univers |
https://en.wikipedia.org/wiki/.es | .es (españa) is the country code top-level domain (ccTLD) for Spain. It is administered by the Network Information Centre of Spain.
Registrations are permitted at the second level or at the third level beneath various generic second level categories. Some qualifications and restrictions apply to third-level registrations depending on which second-level domain they are within. Second-level registrations have had some limitations including requiring registrants to have a connection with Spain, but these restrictions were lifted in a multi-stage process completed by the end of 2005, at which point registrations at the second level of .es were open to anybody worldwide.
The .es domain does not have a conventional WHOIS server operating on port 43, but WHOIS queries can be made using a page on ESNIC's website.
Second-level domains
There also exist a number of second-level domains:
.com.es - open to all applicants (intended for commercial entities)
.nom.es - open to all applicants (intended for personal names)
.org.es - open to all applicants (intended for noncommercial organizations)
.gob.es - for governmental entities
.edu.es - for educational institutions
Alternatives
Until the liberalization in November 2005, registering in .es was expensive and encumbered compared to other ccTLDs. The second-level word had to be either a trade mark valid in Spain, the exact name of the registering business or association, or the first name and at least the first surname of the registering individual. Common words and placenames were unregisterable. There was also a requirement of a minimum of three characters in the name, though some exceptions like hp.es (Hewlett-Packard Spain) and pp.es (People's Party) were allowed. As an alternative many Spanish organizations registered under .com, .org or .net.
Usage
Although very popular in Spain for its intended use, .es has been used for domain hacks such as geociti.es, a website mirroring Geocities; adspac.es, a mobile-based advertising firm; thelettervsixtim.es, for the game VVVVVV; and iTun.es for iTunes Ping URL shortening.
References
External links
IANA .es whois information
ESNIC website
Country code top-level domains
Internet in Spain
Council of European National Top Level Domain Registries members
Computer-related introductions in 1988 |
https://en.wikipedia.org/wiki/Kam%20Fong%20Chun | Kam Fong Chun (born Kam Tong Chun; May 27, 1918 – October 18, 2002) was an American police officer and actor, best known for his role as Chin Ho Kelly, a police detective on the CBS television network series Hawaii Five-O.
Life
Kam Fong Chun was born in the Kalihi neighborhood of Honolulu, Hawaii. A 1938 graduate of President William McKinley High School, he worked at Pearl Harbor shipyard in his 20s as a boiler maker and was a witness to the attack by the Japanese on December 7, 1941. After the death of his first wife and two eldest children in 1944, he applied for a job as a police officer at the Honolulu Police Department. He served there for 16 years. After his retirement from the police force, he worked as a disc jockey and sold real estate in addition to doing community theater.
Chun's life was filled with tragedies. His father had an affair, which led to his parents' divorce and the splitting of the family. The two eldest children went with their father and the younger five, including seven-year-old Chun, lived with their mother. The affair also led to Chun's father being forced out of the family business by his paternal grandfather, which left the family in poverty. Chun watched a brother burn to death as he was painting the family home and someone lit a match. On June 8, 1944, Chun lost his family in a freak air disaster that devastated their home in Honolulu. Two B-25 bombers collided over the Chun residence, killing wife Esther, four-year-old daughter Marilyn and two-year-old son Donald.
Chun later married Gladys Lindo in 1949. They had two sons, Dennis and Dickson, and daughters, Brenda and Valerie.
Stage name
Chun's stage name came from a misunderstanding of his first name by his first teacher, who taught him to write Kam Fong Chun instead of his birth name, Kam Tong Chun. Due to confusion as he got older, he later legalized his name to the former. CBS asked him to shorten his name to Kam Fong when he was hired for Hawaii Five-O.
Proposed 1997 Five-O revival
Talk had centered around a remake or a feature film version of the show for years. In 1997, CBS and Stephen J. Cannell (The Rockford Files, Baretta, The Commish) collaborated on a pilot for a possible new Five-O series. The pilot would introduce some of the new cast and feature former regulars from the original series, including Fong. According to Five-O fan and author of a book on the show, Karen Rhodes, Fong was asked to reprise his role and appear in the pilot. Neither Fong nor any of the other regulars told Cannell that Chin Ho had been killed off at the end of the tenth season. This was only discovered after all of Fong's scenes had been shot, and to excise him from the project would have caused delays and overruns in cost. Hoping that CBS executives would not remember the one episode out of hundreds, Cannell screened the pilot.
His son Dennis Chun had a recurring role in the 2010 reboot as HPD Sgt. Duke Lukela. Beginning with the 8th season he was promoted to a series |
https://en.wikipedia.org/wiki/RBS | RBS may refer to:
Arts and media
Grupo RBS, Brazilian media group
RBS TV
RBS TV, now GMA Network, owned by GMA Network Inc., Philippines
Red Band Society, a Fox TV show that aired from 2014-15
Real Bout Fatal Fury Special, a fighting game
Rolling ball sculpture
Banking
The Royal Bank of Scotland, a retail arm of NatWest Group
RBS International, the offshore arm of NatWest Group
Education
Regent's Business School
Rotterdam Business School
Rutgers Business School
Riga Business School
Management
Resource breakdown structure
Risk breakdown structure
Places
Ramat Beit Shemesh, a city in Israel
Orbost Airport, Victoria, Australia (IATA:RBS)
Science and technology
Biology and medicine
Reduction breast surgery, commonly known as breast reduction
Ribosomal Binding Site, in biology
Roberts syndrome
Computing
Reference Broadcast Time Synchronization
Remote backup service
Robbed-bit signaling
Role-based security
Rule-based system
Other uses in science and technology
Radio Base Station, in wireless communications
Roussin's black salt, a chemical compound
Rutherford backscattering spectrometry, an analytical technique
Transport
Radar Brake Support, Suzuki's Advanced Emergency Braking System
Redundant Braking System, a type of parachute system
Regionalverkehr Bern Solothurn, Swiss company
Reusable Booster System, a United States Air Force research program circa 2010 to 2012
Revised British Standard, a bullhead rail profile
Rugby–Birmingham–Stafford Line, a railway line in England
Orbost Airport, Victoria, Australia (IATA:RBS)
See also
RB (disambiguation)
RBS-15, a long-range missile
RBS 70, an anti-aircraft weapon |
https://en.wikipedia.org/wiki/The%20Computer%20Wore%20Menace%20Shoes | “The Computer Wore Menace Shoes" is the sixth episode of the twelfth season of the American animated television series The Simpsons. It first aired on the Fox network in the United States on December 3, 2000. In the episode, Homer buys a computer and creates his own website to spread gossip and fake news. However, when Homer starts writing conspiracy theories about flu shots, he is sent to an island where people who know too much are imprisoned.
"The Computer Wore Menace Shoes" was written by John Swartzwelder and directed by Mark Kirkland. The title of the episode is a reference to the 1969 Disney comedy film The Computer Wore Tennis Shoes, but the episode isn't related to the film in any other way. The episode's third act features many references to the 1967 science fiction series The Prisoner.
The episode features Patrick McGoohan as Number Six, the main character from The Prisoner. In its original broadcast, the episode was seen by approximately 9.1 million viewers, finishing in 28th place in the ratings the week it aired. Following its broadcast, the episode received mixed reviews from critics; commentators were divided over the episode's third act.
Plot
After finding out that all of the nuclear power plant's staff members had been informed of the plant's closure for maintenance via e-mail, Homer decides to buy a computer. After Lisa sets up the computer for him, Homer starts his own webpage, which contains copyrighted material from other pages. To avoid getting sued, Homer calls himself "Mr. X". Late at night, unable to sleep until someone visits his page, Homer hears a rumor from Bart started by either Nelson Muntz or Jimbo Jones that Mayor Quimby spent the street repair fund on a secret swimming pool. He posts this rumor on his page, which is seen by several of Springfield's citizens, and reporters find a luxurious pool along with many scantily dressed women in Quimby's office building.
Homer keeps anonymously investigating and posting more scandals, including Mr. Burns selling uranium to terrorists, resulting in Burns getting arrested by the FBI. Eventually, Mr. X wins the Pulitzer Prize for his journalistic achievements, despite no-one knowing who he is. When he hears that the prize money will be given to starving children, Homer reveals himself as Mr. X. However, this ends up alienating Homer from the rest of the town, as no-one feels comfortable confessing their secrets now that they know he is Mr. X, and his fame soon plummets. To boost his popularity, Homer begins posting outrageous stories on his webpage. Regaining his fame, Homer celebrates by going to a Kwik-E-Mart which turns out to be fake, and he ends up being kidnapped.
Homer wakes up on the "Island", a place where the inhabitants are people who have been exiled from society for harboring dangerous secrets. Homer learns from the organization's leader, Number Two, that a story he wrote about flu vaccinations containing a mind-control serum is true; the mind control drug |
https://en.wikipedia.org/wiki/Chaotropic%20agent | A chaotropic agent is a molecule in water solution that can disrupt the hydrogen bonding network between water molecules (i.e. exerts chaotropic activity). This has an effect on the stability of the native state of other molecules in the solution, mainly macromolecules (proteins, nucleic acids) by weakening the hydrophobic effect. For example, a chaotropic agent reduces the amount of order in the structure of a protein formed by water molecules, both in the bulk and the hydration shells around hydrophobic amino acids, and may cause its denaturation.
Conversely, an antichaotropic agent (kosmotropic) is a molecule in an aqueous solution that will increase the hydrophobic effects within the solution. Antichaotropic salts such as ammonium sulphate can be used to precipitate substances from the impure mixture. This is used in protein purification processes, to remove undesired proteins from solution.
Overview
A chaotropic agent is a substance which disrupts the structure of, and denatures, macromolecules such as proteins and nucleic acids (e.g. DNA and RNA). Chaotropic solutes increase the entropy of the system by interfering with intermolecular interactions mediated by non-covalent forces such as hydrogen bonds, van der Waals forces, and hydrophobic effects. Macromolecular structure and function is dependent on the net effect of these forces (see protein folding), therefore it follows that an increase in chaotropic solutes in a biological system will denature macromolecules, reduce enzymatic activity and induce stress on a cell (i.e., a cell will have to synthesize stress protectants). Tertiary protein folding is dependent on hydrophobic forces from amino acids throughout the sequence of the protein. Chaotropic solutes decrease the net hydrophobic effect of hydrophobic regions because of a disordering of water molecules adjacent to the protein. This solubilises the hydrophobic region in the solution, thereby denaturing the protein. This is also directly applicable to the hydrophobic region in lipid bilayers; if a critical concentration of a chaotropic solute is reached (in the hydrophobic region of the bilayer) then membrane integrity will be compromised, and the cell will lyse.
Chaotropic salts that dissociate in solution exert chaotropic effects via different mechanisms. Whereas chaotropic compounds such as ethanol interfere with non-covalent intramolecular forces as outlined above, salts can have chaotropic properties by shielding charges and preventing the stabilization of salt bridges. Hydrogen bonding is stronger in non-polar media, so salts, which increase the chemical polarity of the solvent, can also destabilize hydrogen bonding. Mechanistically this is because there are insufficient water molecules to effectively solvate the ions. This can result in ion-dipole interactions between the salts and hydrogen bonding species which are more favorable than normal hydrogen bonds.
Common chaotropic agents include n-butanol, ethanol, guanidinium |
https://en.wikipedia.org/wiki/DNS%20zone%20transfer | DNS zone transfer, also sometimes known by the inducing DNS query type AXFR, is a type of DNS transaction. It is one of the many mechanisms available for administrators to replicate DNS databases across a set of DNS servers.
A zone transfer uses the Transmission Control Protocol (TCP) for transport, and takes the form of a client–server transaction. The client requesting a zone transfer may be a secondary server requesting data from a primary server. The portion of the database that is replicated is a zone.
Operation
Zone transfer consists of a preamble, followed by the actual data transfer. The preamble comprises a lookup of the Start of Authority (SOA) resource record for the "zone apex", the node of the DNS namespace that is at the top of the "zone". The fields of this SOA resource record, in particular the "serial number", determine whether the actual data transfer need to occur at all. The client compares the serial number of the SOA resource record with the serial number in the last copy of that resource record that it has. If the serial number of the record being transferred is greater, the data in the zone are deemed to have "changed" (in some fashion) and the secondary proceeds to request the actual zone data transfer. If the serial numbers are identical, the data in the zone are deemed not to have "changed", and the client may continue to use the copy of the database that it already has, if it has one.
The actual data transfer process begins by the client sending a query (opcode 0) with the special query type AXFR (value 252) over the TCP connection to the server. Although DNS technically supports AXFR over User Datagram Protocol (UDP), it is considered not acceptable due to the risk of lost, or spoofed packets. The server responds with a series of response messages, comprising all of the resource records for every domain name in the "zone". The first response comprises the SOA resource record for the zone apex. The other data follows in no specified order. The end of the data is signaled by the server repeating the response containing the SOA resource record for the zone apex.
Some zone transfer clients perform the SOA lookup of the preamble using their system's normal DNS query resolution mechanism. These clients do not open a TCP connection to the server until they have determined that they need to perform the actual data transfer. However, since TCP can be used for normal DNS transactions, as well as for zone transfer, other zone transfer clients perform the SOA lookup preamble over the same TCP connection as they then (may) perform the actual data transfer. These clients open the TCP connection to the server before they even perform the preamble.
The preceding describes full zone transfer. Incremental zone transfer differs from full zone transfer in the following respects:
The client uses the special QTYPE IXFR (value 251) instead of the AXFR QTYPE.
The client sends the SOA resource record for the zone apex that it currentl |
https://en.wikipedia.org/wiki/Silicon%20Knights | Silicon Knights was a Canadian video game developer. Founded in 1992 by Denis Dyack, the company was headquartered in St. Catharines, Ontario. They started developing for computers such as the Atari ST and IBM PC compatibles. After 1996, they moved to console titles.
Dyack left Silicon Knights to form a new game studio, Precursor Games, after the loss of a court case against Epic Games over the game engine Unreal Engine 3. Epic Games won the case and a counter-suit for $4.45 million on grounds of copyright infringement, misappropriation of trade secrets, and breach of contract. Following the case, Silicon Knights filed for bankruptcy on May 16, 2014.
Games
Released
Silicon Knights' first games were real-time strategy/action hybrids for computers. Silicon Knights' last PC game, Blood Omen: Legacy of Kain was published in 1996. Since that time, Silicon Knights moved from creating PC games to console titles. In 2000, Silicon Knights was signed by Nintendo to create games exclusively for its consoles, during which time it produced Eternal Darkness: Sanity's Requiem. Together with Nintendo, Silicon Knights worked with Konami to create Metal Gear Solid: The Twin Snakes. In 2004, the company ended exclusivity with Nintendo. In 2005, it partnered with publisher Microsoft Game Studios for Too Human, though Nintendo still owned stock in the company. In 2008, the company released Too Human, which was published by Microsoft for the Xbox 360. The final game developed by the company, X-Men: Destiny, was released on September 2011 for multiple console platforms.
Canceled
Canceled games included Silent Hill: The Box (later known as just The Box and The Ritualyst), Too Human 2 (Too Human: Rise of the Giants), Too Human 3, Eternal Darkness 2, and the little-known projects Siren in the Maelstrom, The Sandman and King's Quest (not to be confused with the Sierra series).
Founding of Eight
Silicon Knights was a strong proponent of collaboration with academia and was a key player in the formation of Eight. Eight: The Hamilton Institute for Interactive Digital Media is a collaboration between Silicon Knights, McMaster University, the Art Gallery of Hamilton (AGH) and Mohawk College to create a novel academic and research model around interactive digital media and will help pioneer and shape cutting-edge advances in the interactive entertainment arena.
Lawsuit with Epic Games
On July 19, 2007, Silicon Knights sued Epic Games for failure to "provide a working game engine", causing the Ontario-based game developer to "experience considerable losses." The suit alleged that Epic Games was "sabotaging" Unreal Engine 3 licensees. Epic's licensing document stated that a working version of the engine would be available within six months of the Xbox 360 developer kits being released. Silicon Knights claimed that Epic not only missed this deadline, but that when a working version of the engine was eventually released, the documentation was insufficient. The game studio also |
https://en.wikipedia.org/wiki/Tokyo%20Game%20Show | , commonly known as TGS, is a video game trade fair and convention held annually in September in the Makuhari Messe, in Chiba, Japan. It is presented by the Computer Entertainment Supplier's Association (CESA) and Nikkei Business Publications, Inc. The main focus of the show is on Japanese games, but some international video game developers use it to showcase upcoming releases/related hardware. The duration of the event is four days. The first two days of Tokyo Game Show are open only to industry attendees (business) and the general public can attend during the final two days.
History
The first Tokyo Game Show was held in 1996. From 1996 to 2002, the show was held twice a year: once in the Spring and once in Autumn (in the Tokyo Big Sight). Since 2002, the show has been held once a year. It attracts more visitors every year. 2011’s show hosted over 200,000 attendees and the 2012 show bringing in 223,753. The busiest TGS was in 2016 with 271,224 people in attendance and 614 companies had exhibits. The event has been held annually since 1996 and was never canceled, however the 2020 and 2021 editions were online only as a result of the COVID-19 pandemic. The 2022 edition returned to in-person exhibits. The 20th anniversary of TGS was celebrated in 2016.
The 2016 attendance record was topped by 2018's attendance of 298,690 people.
Layout
The TGS layout varies per year. Such as in 2015, Tokyo Game Show showcased 11 exhibition areas consisting of business, general public, education and other areas to buy merchandise.
General Exhibition
The General Exhibition Area is the heart of the show, taking up the largest amount of space, and is held where digital gaming entertainment or any related products or services are showcased. Many well-known companies such as Namco Bandai, Capcom, Sony Computer Entertainment and Square Enix have demo areas here, in addition to emerging companies.
Game Device
This area covers gaming devices such as headphones, controllers, furniture and other devices associated with home-use gaming consoles and portable gaming devices.
Asia New Stars
An exhibition introduced at the 2012 Tokyo Game Show is geared towards introducing emerging game developers from Asia.
Merchandise Sales
This area is designated for merchandising of game-related goods. Vendors include Konami and Square-Enix.
Smartphone and social games
This area focuses on games for smart devices (smartphones and tablets) and social games. Despite record numbers during TGS 2012, many large companies had a smaller presence. For example, Microsoft, which previously had one of the largest booths, was absent in 2012. Social and mobile gaming surged, filling the gap. Microsoft returned to the show in 2013 with the release of the Xbox One.
Personal computing
The PC area houses major Japanese computing companies, showcasing products such as Japanese desktop and notebook computers.
Children
This area showcases new games that are aimed at a younger audience. Compani |
https://en.wikipedia.org/wiki/The%20Ultimate%20Computer | "The Ultimate Computer" is the twenty-fourth episode of the second season of the American science fiction television series Star Trek. Written by D.C. Fontana (based on a story by Laurence N. Wolfe) and directed by John Meredyth Lucas, it was first broadcast on March 8, 1968.
In the episode, the crew of the Enterprise race to disable a rogue computer in total control of the ship.
Plot
The Federation starship Enterprise is summoned to a space station without explanation. Commodore Wesley (Barry Russo) explains that the Enterprise will be a test vessel for the M-5 Multitronic System, a revolutionary tactical and control computer designed by Dr. Richard Daystrom (William Marshall). The M-5 is to handle all ship functions without human assistance. While Science Officer Spock is impressed with M-5, Captain Kirk and Chief Medical Officer Dr. McCoy have doubts.
The M-5 succeeds at its first tasks, performing ship functions more quickly and efficiently than a living crew. However, M-5 also exhibits unexpected behavior, such as turning off power and life support to unoccupied parts of the ship, and drawing increased power for unknown reasons; Daystrom maintains M-5 is working properly.
In its first tactical drill, M-5 defends the Enterprise against mock attacks from Starships Excalibur and Lexington. The Enterprise is declared the victor, and Wesley jokingly refers to Kirk as "Captain Dunsel", employing a Starfleet Academy slang term for a part serving no useful purpose. Kirk is troubled by this.
Some time later, M-5 detects the Woden, an unmanned freighter, and attacks with live torpedoes, destroying it. Kirk orders M-5 taken offline, but on attempting to do so, finds it protected by a powerful force field. Chief Engineer Scott orders Ensign Harper to disconnect its power source, but the M-5 creates a direct connection to the ship's warp engines, vaporizing Harper in the process. Spock and Scott attempt a manual override, but discover that the M-5 has rerouted all controls. Spock questions Daystrom on his computer design, and Daystrom reveals that he has imprinted human engrams onto M-5's circuits, creating what amounts to a human mind operating at the speed of a computer.
Meanwhile, four of Enterprise'''s sister ships, Lexington, Potemkin, Excalibur, and Hood, approach to begin a new tactical drill. Since M-5 has disabled communications, Kirk is unable to warn M-5's targets. M-5 detects the ships, and attacks them with full-strength weapons. The crew watches helplessly as the Enterprise fires on the Lexington, killing 53, and then turns to the Excalibur, killing all aboard and leaving her adrift. Commodore Wesley assumes that Kirk himself is responsible for the attacks, and requests permission from Starfleet Command to destroy the Enterprise.
Daystrom, having indicated that the engrams he used were his own, believes he can reason with the M-5, but his conversation with the unit quickly degenerates into a self-pitying lament over his own career d |
https://en.wikipedia.org/wiki/Apache%20Longbow | Apache Longbow may refer to:
Apache Longbow (video game), computer game released by Digital Integration
The AH-64D variant of the AH-64 Apache, a twin-engine attack helicopter
See also
Longbow |
https://en.wikipedia.org/wiki/Mel%20Bampton | Melissa "Mel" Bampton is an Australian radio announcer, best known for her work on the Triple J network.
She began at the station in 2000 as producer of the Drive show - with Costa Zouliou, Myf Warhurst, Nicole Fossati and Charlie Pickering at various times. In mid-2002, Fossati left the station, and Bampton took her place as co-host.
Career
In 2004 the station's programming underwent major changes, and Bampton started hosting her own music show Mel in the Mornings. The show replaced the previous Morning Show, which was heavily current affairs and talkback, with a more music oriented show, including interviews and live performances. Mel was the creator of the Like a Version segment of bands playing cover songs, which has spawned nine CDs and continues on the triple j breakfast program to this day.
On 26 January 2007, Mel finished her role as a triple j presenter. In late 2007 Mel presented and produced the 2nd Producer Series for triple j, which featured: Steve Albini (Nirvana, PJ Harvey, Joanna Newsom), Michael Beinhorn (Hole, Marlilyn Manson, The Bronx), Trina Shoemaker (Queens Of The Stoneage, Something For Kate), Jim Abbiss (Arctic Monkeys, Kasabian), Tony Cohen (Nick Cave, Beasts of Bourbon), Squeak E Clean (Yeah Yeah Yeahs, Ben Lee), Ewan Pearson (The Rapture), Dave Catching (Rancho De La Luna - The Desert Sessions) Tim Whitten (Architecture In Helsinki, The Panics) and John Agnello (Dinosaur Jr, Sonic Youth, The Living End).
In 2008, Bampton produced and presented The Album Series for triple j which took a look at four outstanding Australian Albums, by artists: Sarah Blasko, The Living End, Hoodoo Gurus and Regurgitator. The Album Series featured on triple j in late 2008.
Bampton produced and presented the third season of The Producer Series, which aired on Triple J in 2009. The third series featured Alan Moulder (Nine Inch Nails, The Killers, Wolfmother), Scott Horscroft (The Panics, Sleepy Jackson), Dave Fridmann (Flaming Lips, Mercury Rev, Sleater Kinney), Harry Vanda (AC/DC, British India, The Angels), Philippe Zdar (Cassius, Phoenix, Cut Copy) and Diplo (MIA, Santigold, Major Lazer). A print version of The Producer Series is set for release through Harper Collins in 2015.
Bampton was the Music & Books Editor for 'alternative mainstream' women's magazine yen between 2008 and 2012, and is also the Director of a Byron Bay-based media company that works with Soundwave Festival, and musical artists Ash Grunwald and Dune Rats.
Personal life
Bampton is married, and has three children - Jazzy, Tiger and Obi - the youngest being born in 2012.
Bampton is also a full-time Yoga Therapist and teacher, studying and instructing under her married name 'Lissie Turner' at The Yoga Shack. She was trained by Dr Natesan Chanderasekaran MD and Lance Schuler. Bampton has been practicing yoga since 1995.
References
External links
The Producer Series 2009
The Album Series 2008
Mel in the Morning at the Triple J site
The Producer Series 2007
T |
https://en.wikipedia.org/wiki/F.%20W.%20S.%20Craig | Frederick Walter Scott Craig (10 December 1929 – 23 March 1989) was a Scottish psephologist and compiler of the standard reference books covering United Kingdom Parliamentary election results. He originally worked in public relations, compiling election results in his spare time which were published by the Scottish Unionist Party. In the late 1960s he launched his own business as a publisher of reference books, and also compiled various other statistics concerning British politics.
Craig also had a political career of his own, initially as an election agent and then as a candidate. Efforts to get elected in his native Glasgow being unsuccessful, after he moved to Chichester in 1970 he was first elected to the District Council and later to West Sussex County Council. However he fell out with a faction in the local Conservative Party and launched a rebel group which led to his expulsion. Late in his life he suffered severe depression and he committed suicide at the age of 59.
Early life
Craig was a native of Glasgow. He became interested in election statistics while still at school. He was active in the Scottish Unionist Party Association, and in 1954 began to contribute the 'Scottish Parliamentary Election Manual' of election results to the Yearbook for Scotland, which the party published. Craig was unhappy with existing sources for election statistics and undertook research himself to correct the vote figures and discover the source of independent candidates, and his election manual became highly respected.
Political activity
As a paid agent for the Unionist Party, Craig was the election agent for James Hutchison in Glasgow Scotstoun in the 1955 general election and for the Unionist parliamentary candidate in Rutherglen in 1964. He twice fought for election to the Glasgow City Corporation in the mid-1960s. His first attempt was in May 1966 when he came forward as an Independent Conservative candidate against the 'Progressive Party', a local alliance between Conservatives and Liberals which controlled the council, in Kelvinside ward. Craig offered to withdraw if the Progressive councillor would repudiate that party's policy on council house rents, and to sit as a Conservative if the party split up; the offer was rejected.
In September 1967 Craig was selected as official Conservative candidate for Gorbals ward in a byelection; he was one of seven candidates and attempted to stand out by distributing on the eve of poll 5,000 'wage packets' containing an appeal to vote for him. However Craig came third in the poll.
Reference books
His research into elections continued and widened from Scotland to the whole of the United Kingdom, and he compiled a card index to all elections from 1918 onwards. In 1966 he had completed a manuscript of a reference book on statistics about elections since 1918, which was intended to be published in two volumes of 700 pages each to be part-funded by the Institute of Electoral Research; the calling of a general ele |
https://en.wikipedia.org/wiki/Olivetti%20Research%20Laboratory | The Olivetti Research Laboratory (ORL) was a research institute in the field of computing and telecommunications founded in 1986 by Hermann Hauser and Andy Hopper.
History
When Olivetti acquired Acorn Computers in 1985, Hauser, who was Acorn's co-founder, became vice-president for research at Olivetti where he was in charge of laboratories in the US and Europe. In 1986, Hauser co-founded the Olivetti Research Laboratory (ORL) in Cambridge, England, along with Professor Andy Hopper. Hopper became the laboratory's Director.
In 1988, Hauser left Olivetti. In 1997 the lab became the Olivetti & Oracle Research Lab. In January 1999 it was acquired by AT&T Corporation and became AT&T Laboratories Cambridge.
AT&T Laboratories Cambridge was for three years Europe's leading communications engineering research laboratory. The laboratory was internationally recognised as a centre of excellence, undertaking advanced research into communications, multimedia and mobile technologies.
As a result of heavy losses, AT&T restructured its worldwide research efforts and the Cambridge labs closed on 24 April 2002.
Notable achievements
Original development of the RFB (remote framebuffer) protocol and VNC, the desktop sharing technology
Development and maintenance of the free CORBA implementation for C++ and Python, omniORB
The Active Badge System for the tracking of people and objects
External links
Wrangling money men shut down the future, The Observer, 21 April 2002.
An archive of many of the lab's technical reports
XORL - an 'alumni' site formed at the lab's closure, with information about people and projects.
Defunct technological companies of the United Kingdom
Companies based in Cambridge
Research institutes established in 1986
Research institutes in Cambridge
Companies disestablished in 2002 |
https://en.wikipedia.org/wiki/Andy%20Hopper | Sir Andrew Hopper (born 1953) is a British-Polish computer technologist and entrepreneur. He is treasurer and vice-president of the Royal Society, Professor of Computer Technology, former Head of the University of Cambridge Department of Computer Science and Technology, an Honorary Fellow of Trinity Hall, Cambridge and Corpus Christi College, Cambridge.
Education
Hopper was educated at Quintin Kynaston School in London after which he went to study for a Bachelor of Science degree at Swansea University before going to the University of Cambridge Computer Laboratory and Trinity Hall, Cambridge in 1974 for postgraduate work. Hopper was awarded his PhD in 1978 for research into local area computer communications networks supervised by David Wheeler.
Research and career
Hopper's PhD, completed in 1977 was in the field of communications networks, and he worked with Maurice Wilkes on the creation of the Cambridge Ring and its successors.
Hopper's research interests include computer networks, multimedia systems, Virtual Network Computing and sentient computing. His most cited paper describes the indoor location system called the Active Badge. He has contributed to a discussion of the privacy challenges relating to surveillance.
After more than 20 years at Cambridge University Computer Laboratory, Hopper was elected Chair of Communications Engineering at Cambridge University Engineering Department in 1997. He returned to the Computer Laboratory as Professor of Computer Technology and Head of Department in 2004. He is currently the head of the Computer Laboratory's Digital Technology Group
Hopper's research under the title Computing for the Future of the Planet examines the uses of computers for assuring the sustainability of the planet.
Hopper has supervised approximately fifty PhD students.
Commercial activities
In 1978, Hopper co-founded Orbis Ltd to develop networking technologies. He worked with Hermann Hauser and Chris Curry, founders of Acorn Computers Ltd. Orbis became a division of Acorn in 1979 and continued to work with the Cambridge Ring. While at Acorn, Hopper contributed to design some of the chips for the BBC Micro and helped conceive the project which led to the design of the ARM microprocessor. When Acorn was acquired by Olivetti in 1985, Hauser became vice-president for research at Olivetti, in which role he co-founded the Olivetti Research Laboratory in 1986 with Hopper; Hopper became its managing director.
In 1985, after leaving Acorn, Hopper co-founded Qudos, a company producing CAD software and doing chip prototyping. He remained a director until 1989.
In 1993, Hopper set up Advanced Telecommunication Modules Ltd with Hermann Hauser. This company went public on the NASDAQ as Virata in 1999. The company was acquired by Conexant Systems on 1 March 2004.
In 1995, Hopper co-founded Telemedia Systems, now called IPV, and was its chairman until 2003.
In 1997, Hopper co-founded Adaptive Broadband Ltd (ABL) to further develop th |
https://en.wikipedia.org/wiki/Kevin%20Robert%20Elz | Kevin Robert Elz, often referred to in computing circles as Robert Elz, or simply kre, is a computer programmer and a pioneer in connecting Australia to the Internet, and more recently, in connecting Thailand.
Career
Some of his achievements include developing a number of important Internet RFC documents, helping connect Australia to the world-wide Internet, developing the internet-based research network within Australia, and operating the .au domain registry from 1986 through to the late 1990s. He also managed the Usenet hierarchy from its inception in the 1980s until the mid-1990s. In 1979 he co-founded the Australian Computer Science network (ACSnet) and in 1989 with Torben Nielsen of the University of Hawaiʻi he completed the connection work that brought the internet to Australia, which enabled AARNet to develop soon after.
He is an Honorary Fellow at the University of Melbourne, where for some years he worked in the Computer Science department.
An ardent cricket fan, Elz is also credited for pioneering online text commentary for cricket matches.
Having previously lived and worked in Melbourne for many years, he currently lives in Hat Yai, Songkhla, Thailand, where he is an honorary lecturer in the Computer Engineering Department of the Prince of Songkla University.
Operation of .com.au
As the architect of the early domain-name eligibility criteria for ".com.au", Elz was largely responsible for Australia's not experiencing a domain name gold rush in the mid-1990s. The eligibility policy required a direct connection between a company's official name and its domain name, in contrast to the strictly first-come-first-served policy of the .com registry.
Elz was, however, criticised during his tenure, as domain name applications often took many months to be examined, despite the commercialisation of the Internet and customer demands for quick turnaround times. In 1990, Elz delegated responsibility for the ".gov.au" and ".edu.au" domains to Geoff Huston at the Australian National University. Elz handed the operation of ".com.au" to Melbourne IT in 1996. Responsibility for other domains was transferred to auDA in 2001.
References
Australian engineers
Australian expatriates in Thailand
Scientists from Melbourne
Living people
Year of birth missing (living people)
University of Melbourne alumni
Academic staff of the University of Melbourne
Australian computer scientists |
https://en.wikipedia.org/wiki/Symbolic%20Cholesky%20decomposition | In the mathematical subfield of numerical analysis the symbolic Cholesky decomposition is an algorithm used to determine the non-zero pattern for the factors of a symmetric sparse matrix when applying the Cholesky decomposition or variants.
Algorithm
Let
be a sparse symmetric positive definite matrix with elements from a field , which we wish to factorize as .
In order to implement an efficient sparse factorization it has been found to be necessary to determine the non zero structure of the factors before doing any numerical work. To write the algorithm down we use the following notation:
Let and be sets representing the non-zero patterns of columns and (below the diagonal only, and including diagonal elements) of matrices and respectively.
Take to mean the smallest element of .
Use a parent function to define the elimination tree within the matrix.
The following algorithm gives an efficient
symbolic factorization of :
Articles with example pseudocode
Matrix decompositions |
https://en.wikipedia.org/wiki/Fill-in | Fill-in can refer to:
A puzzle, see Fill-In (puzzle)
In numerical analysis, the entries of a matrix which change from zero to a non-zero value in the execution of an algorithm; see Sparse matrix#Reducing fill-in
An issue of a comic book produced by a different creative team than the one regularly assigned to the series, published either to avoid missing a deadline or to give one or more of the series's regular creators a break
See also
Fill (disambiguation)
Filling-in |
https://en.wikipedia.org/wiki/Cisco%20Discovery%20Protocol | Cisco Discovery Protocol (CDP) is a proprietary data link layer protocol developed by Cisco Systems in 1994 by Keith McCloghrie and Dino Farinacci. It is used to share information about other directly connected Cisco equipment, such as the operating system version and IP address. CDP can also be used for On-Demand Routing, which is a method of including routing information in CDP announcements so that dynamic routing protocols do not need to be used in simple networks.
Operation
Cisco devices send CDP announcements to the destination MAC address , out each connected network interface. These multicast frames may be received by Cisco switches and other networking devices that support CDP into their connected network interface. This multicast destination is also used in other Cisco protocols such as Virtual Local Area Network (VLAN) Trunking Protocol (VTP). By default, CDP announcements are sent every 60 seconds on interfaces that support Subnetwork Access Protocol (SNAP) headers, including Ethernet, Frame Relay and Asynchronous Transfer Mode (ATM). Each Cisco device that supports CDP stores the information received from other devices in a table that can be viewed using the show cdp neighbors command. This table is also accessible via Simple Network Management Protocol (SNMP). The CDP table information is refreshed each time an announcement is received, and the holdtime for that entry is reinitialized. The holdtime specifies the lifetime of an entry in the table - if no announcements are received from a device for a period in excess of the holdtime, the device information is discarded (default 180 seconds).
The information contained in CDP announcements varies by the type of device and the version of the operating system running on it. This information may include the operating system version, hostname, every address (i.e. IP address) from all protocol(s) configured on the port where CDP frame is sent, the port identifier from which the announcement was sent, device type and model, duplex setting, VTP domain, native VLAN, power draw (for Power over Ethernet devices), and other device specific information. The details contained in these announcements is easily extended due to the use of the type–length–value (TLV) frame format. See external links for a technical definition.
Support
Hewlett-Packard removed support for transmitting CDP from HP Procurve products shipped after February 2006 and all future software upgrades. Receiving and processing CDP information is still supported. CDP support was replaced with IEEE 802.1AB Link Layer Discovery Protocol (LLDP), an IEEE standard that is implemented by multiple vendors and is functionally similar to CDP.
Several other manufacturers, including Dell and Netgear have used the brand-neutral name Industry Standard Discovery Protocol (ISDP) to refer to their implementations of a CDP-compatible protocol.
CDP was the abbreviation used by Cabletron who wrote the RFC 2641 for the discovery protocol.
See a |
https://en.wikipedia.org/wiki/RFD | RFD may refer to:
Arts and entertainment
RFD (magazine), a magazine for rural gay men
RFD-TV, an American television network
Organizations
RFD, a safety equipment company founded by Reginald Foster Dagnall
Rally of Democratic Forces, (Regroupement des forces démocratiques) a political party in Mauritania
Richmond Fire Department, an emergency services provider in California
RedFlagDeals.com, a Canadian bargain hunting, coupon, and forums website.
Science and technology
Rear flank downdraft, an area of quickly descending air associated with rotating thunderstorms
Reduced-function devices, in the low-rate wireless personal area networks standard IEEE 802.15.4
Reference dose, the US EPA's maximum acceptable oral dose of a toxic substance
Request for Discussion, similar to Request for Comments; For example, see Usenet newsgroup
Other uses
Chicago Rockford International Airport (IATA code), US
Request for Deviation, related to a request for waiver
Request for Documentation, related to a business request for tender
Reserve Force Decoration, an Australian military award
Rural Free Delivery, the postal service to rural areas of the US
See also
Mayberry R.F.D., a CBS television sitcom (1968–1971) |
https://en.wikipedia.org/wiki/Common%20warehouse%20metamodel | The common warehouse metamodel (CWM) defines a specification for modeling metadata for relational, non-relational, multi-dimensional, and most other objects found in a data warehousing environment. The specification is released and owned by the Object Management Group, which also claims a trademark in the use of "CWM".
Overview
The CWM specifies interfaces that can be used to enable interchange of warehouse and business intelligence metadata between warehouse tools, warehouse platforms and warehouse metadata repositories in distributed heterogeneous environments. CWM is based on three standards:
UML – Unified Modeling Language, an OMG modeling standard
MOF – Meta Object Facility, an OMG metamodeling and metadata repository standard
XMI – XML Metadata Interchange, an OMG metadata interchange standard
CWM models enable users to trace the lineage of data – CWM provides objects that describe where the data came from and when and how the data was created. Instances of the metamodel are exchanged via XML Metadata Interchange (XMI) documents.
Initially, CWM contained a local definition for a data translation facility. It is not clear how the QVT final adopted specification will affect CWM.
Support for the CWM
Submitters of CWM specification
While the Object Management Group owns the standard for CWM, some companies are considered co-submitters of the CWM specification. The following companies were listed as co-submitters to the v1.1 specification:
International Business Machines Corporation
Unisys Corporation
NCR Corporation
Hyperion Solutions Corporation
Oracle Corporation
UBS AG
Genesis Development Corporation
Dimension EDI
Compliance with the CWM specification
Software vendors claiming CWM support differ in the degree to which they comply with CWM. Some were co-submitters of the specification, and are actively using the OMG trademark in marketing literature. Other vendors have expressed support for CWM or claim they have products that are "CWM-compliant."
Questions about compliance are addressed within the specification itself. Chapter 18 in both the 1.0 and 1.1 specification list required and optional compliance points.
The Object Management Group has a list of CWM implementations, but it is unclear how this list is maintained.
Interoperability of CWM tools
Compliance with the CWM specification does not guarantee tools from different vendors will integrate well, even when they are "CWM-compliant". The OMG addressed some of these issues by releasing patterns and best practices to correct these problems in a supplementary specification, CWM Metadata Interchange Patterns
Vendors supporting CWM
CWM implementations identified by OMG
These vendors have been identified as having a CWM implementation or have active projects to support CWM.
IBM
Informatica produces Intelligence Data Platform with PowerCenter, a data integration tool with a metadata extension Enterprise Data Catalog (EDC) (metadata manager formerly known as Supe |
https://en.wikipedia.org/wiki/Strong%20key | Strong Key is a naming convention used in computer programming. There can be more than one component (e.g.: DLL) with the same naming, but with different versions. This can lead to many conflicts.
A Strong Key (also called SN Key or Strong Name) is used in the Microsoft .NET Framework to uniquely identify a component. This is done partly with Public-key cryptography.
Strong keys or names provide security of reference from one component to another or from a root key to a component. This is not the same as tamper resistance of the file containing any given component. Strong names also are a countermeasure against dll hell.
This key is produced by another computer program as a pair.
References
External links
CodeProject: Strong Names Explained
MSDN: Strong-Named Assemblies
Programming constructs
.NET terminology |
https://en.wikipedia.org/wiki/Corel%20Photo-Paint | Corel Photo-Paint is a raster graphics editor developed and marketed by Corel since 1992. Corel markets the software for Windows and Mac OS operating systems, previously having marketed versions for Linux (Version 9, requiring Wine). Its primary market competitor is Adobe Photoshop.
In 2006, Corel released version 13 as Photo-Paint X3, employing this naming convention for subsequent releases as well as for CorelDraw, included with Photo-Paint in CorelDraw Graphics Suite. The current version is Photo-Paint 2020. Corel has marketed a limited edition of Photo-Paint called Corel Photo-Paint SELECT with HP scanning hardware, e.g., the HP ScanJet 5p scanners.
Features
Photo-Paint's native format is .CPT (Corel Photo-Paint Image), which stores image data as well as information within an image, including objects (layers in some raster editors), colour profiles, text, transparency, effect filters.
The program can open and convert vector formats from CorelDraw and Adobe Illustrator and can open other formats, including PNG, JPG and GIF files — as well as competing photo editor formats from Photoshop, GIMP and Paint Shop Pro (the latter also a Corel product). The program also supports plug-in functionality including those developed for Adobe Photoshop and Paint Shop Pro. Other extensions such as brushes are also compatible with Photo-Paint.
Corel Photo-Paint X6–X7 supports OpenType font features. With X7 Update 4 the Font List new additional features in X7 Update 4 allows for filtering type fonts by weight, width, supported scripts, font Technology, Character Range, Style.
As other raster graphics editors, Corel Photo-Paint allows an image to be edited in multiple layers, called objects here. A gradient line going from opaque to transparent, for instance, can be used to have a darker foreground color fade into a lighter background color. The UI is highly customizable, and the user can freely move dialogs or adjust button sizes and such. Effects can be applied to a picture including Smart Blur—a type of Gaussian blur effect which however retains sharpness around sharper edges—Mesh Warp, Camera Lens Flare, Trace Contour and others. There is limited support for vector paths to be integrated. Depending on personal preferences and work style, users may prefer Corel Photo-Paint over Adobe Photoshop or the other way round, though in terms of market share, Photoshop is clearly more represented.
As a component of the CorelDraw Graphics Suite, Photo-Paint can exchange data with other programs in the suite, including Corel Connect (Version X5 - X7), which enables users to share files between different computer software and drives on the user's computer. CorelDraw and Photo-Paint are also copy-paste compatible, with format and effects retention — and without file conversion.
Just like in CorelDraw, Photo Paint tasks can be automatized by scripts and macros, using both COREL Script and Microsoft's VBA (Visual Basic for Applications) and VSTA (Visual Studio Tools |
https://en.wikipedia.org/wiki/Christopher%20Curry%20%28businessman%29 | Christopher Curry (born 28 January 1946 in Cambridge) is the co-founder of Acorn Computers, with Hermann Hauser and Andy Hopper. He became a millionaire as a result of Acorn's success.
In his early career days, he worked at Pye, Royal Radar Establishment and W.R. Grace Laboratories. Then, in April 1966 he joined Sinclair Radionics where he worked for 13 years. He was involved with their hifi products and their Sinclair C5 electric vehicle. In 1972, he helped Sinclair Radionics to launch its first electronic calculator, the Sinclair Executive. He set up Cambridge Processor Unit Ltd. (CPU) in December 1978. Their first product was the Acorn Microcomputer (later called the System 1).
In 1983, he co-founded Redwood Publishing with Michael Potter and Christopher Ward and they bought the Acorn User title. In 1985, he founded General Information Systems Ltd (GIS) and remains the director. In 2012, he announced his latest project for GIS, Care with Canary.
Early life
Curry went to school initially in St Neots in Cambridgeshire, then later went to the independent Kimbolton School, also in Cambridgeshire. He gained two A levels, in Maths and Physics. He thought about going to university at the University of Southampton, but was keener to be earning some money whilst learning.
Early career
He joined Pye in Cambridge in 1964. He stayed for a few months, then left for the Royal Radar Establishment in Worcestershire. He worked on the radar for the proposed BAC TSR-2. The RRE had been the site of many technological advances such as the integrated circuit in 1952. He stayed for nine months. He moved to the W.R. Grace Laboratories, run by ITT, and stayed for six months.
Sinclair Radionics
In April 1966, Curry joined Sinclair Radionics, a company founded by Clive Sinclair in 1961. Curry was to play an important role in getting Sinclair interested in both calculators and computers in his thirteen years with the company.
Curry was at first involved with Sinclair's hifi products, which included amplifiers and speakers, and he also worked on Sinclair's electric vehicle, a project that would turn into the C5 some years later.
In 1972, Sinclair Radionics launched its first electronic calculator, the Executive, which was considerably smaller than its competitors since it used hearing-aid-sized batteries. Curry and Jim Westwood had discovered that it was possible to exploit persistence in the diode displays and memory and introduced a timer that removed the power from these components for most of the time. This discovery dramatically improved the lasting-power of the batteries.
Until 1976 Sinclair Radionics had enjoyed 15 years of strong turnover and profit growth. However, the company sustained losses related to difficulties with chip supplies for the Black Watch. As a result, there were insufficient internal funds available for the final stages of the pocket TV project Sinclair had been working on for some 10 years. In August 1976 the National Enterprise B |
https://en.wikipedia.org/wiki/Olive%2C%20the%20Other%20Reindeer | Olive, the Other Reindeer is a 1999 American 3D computer-animated Christmas comedy musical film written by Steve Young, based on the 1997 children's book by Vivian Walsh and J. Otto Seibold, and directed by Academy Award-nominated animator Steve Moore (credited as "Oscar Moore"). The feature was produced by Matt Groening's The Curiosity Company and animated by DNA Productions. Drew Barrymore voices the title character, and she is credited as an executive producer on the special.
The special first aired on December 17, 1999, alongside Futurama on Fox, ten years after the premiere date of Groening's television series The Simpsons. It was produced by Fox Television Studios and Flower Films. During its initial broadcast, the special brought in 6.06 million viewers, and an additional 5.22 million the following year. After airing again the following year, the special made its first cable television premiere on Nickelodeon on December 15, 2001; It would then premiere the following year on Cartoon Network on December 14, 2002, and aired during each holiday season until it was last seen on December 24, 2012. The special would also air on other local syndicated networks, such as MyNetworkTV, The CW and WGN-TV.
The story is based on the 1997 children's book by Vivian Walsh and J. Otto Seibold and illustrated by J. Otto Seibold. In the song, Rudolph the Red-Nosed Reindeer, the lyric "All of the other reindeer" can be misheard in dialects with the cot–caught merger as the mondegreen "Olive, the other reindeer". The special was nominated for the Emmy Award for Outstanding Animated Program.
Plot
The story follows an anthropomorphic Jack Russell Terrier named Olive. While in town, she meets Martini, a con artist penguin from whom she buys a counterfeit Rolex watch. When she returns home she finds her owner, Tim, sad that there "won't be any Christmas". Olive discovers that Blitzen, one of Santa's reindeer, is injured and unable to fly. Santa expresses in a radio interview that Christmas isn't cancelled if his sleigh can be pulled by "all of the other reindeer". Olive's pet flea, Fido, mishears this as "Olive the other reindeer", and Olive becomes convinced that it is she Santa is referring to, prompting her to travel to the North Pole to help pull the sleigh.
On the way to the bus station, Olive runs into a disgruntled Postman who is frustrated by having to deliver mail during the Christmas period, and expresses that he is glad Christmas might be cancelled. He learns Olive is trying to save Santa's flight, and is determined to stop Olive from saving Christmas. Olive goes to the bus station to buy a ticket to Arctic Junction. Martini shows up and Olive buys him a bus ticket, but before they can leave the station, Olive is captured by the Postman, who abducts her, claiming she is wanted for mail fraud. After she pleads for Martini's help, Martini trips the Postman, allowing Martini and Olive to catch the bus.
On the bus, Olive and Martini talk to an Inuit cou |
https://en.wikipedia.org/wiki/Swift | Swift or SWIFT most commonly refers to:
SWIFT, an international organization facilitating transactions between banks
SWIFT code
Swift (programming language)
Swift (bird), a family of birds
It may also refer to:
Organizations
SWIFT, an international organization facilitating transactions between banks
Swift Engineering, an American engineering firm
Swift & Company, a meat processing company
Swifts (aerobatic team), a Russian aerobatic team
Transportation companies
Swift Cooper, a British racing car manufacturer
Swift Leisure, a British manufacturer of caravans
Swift Motor Company, of Coventry, England
Swift Transportation, a US trucking company
Places
River Swift, a river in England
Swift, Illinois, an unincorporated community in northeastern Illinois
Swift County, Minnesota, a county in west-central Minnesota
Swift, Minnesota, an unincorporated community in northern Minnesota
Swift, Missouri, a ghost town in southeastern Missouri
Astronomy
Swift (lunar crater), a crater on the Moon
Swift (Deimian crater), a crater on Deimos
5035 Swift (1991 UX), a Main-belt Asteroid
Swift Gamma-Ray Burst Explorer, a NASA spacecraft in low-Earth orbit
Biology
Swift (bird), a family of birds
Swift butterflies, several genera in the skipper butterfly tribe Gegenini
Swift lizards, iguanian lizards typically of the genus Sceloporus
Snow swift lizards, of the iguanian genus Liolaemus
Swift moth, of the family Hepialidae
Swift fox, a species of North American fox
Computing and telecommunication
Swift (distributed storage), OpenStack's distributed storage component
Swift (programming language), a programming language developed by Apple Inc.
Swift (parallel scripting language), a programming language for parallel computing developed at the University of Chicago and Argonne National Laboratory
Swift (SoC) platform by Philips
Swift, the ARM architecture CPU core in the Apple A6 and Apple A6X
Swift, an XMPP client for Windows, Mac and Linux
SWIFT – System for wireless infotainment forwarding and teledistribution: former abbreviation for Data Radio Channel (DARC) subcarrier messaging standard
Transportation
Aircraft
Aériane Swift, a Belgian sail plane design
Comper Swift, a British 1930s single-seat sporting aircraft
Globe GC-1 Swift, an American two-seat light airplane produced from 1946 to 1951
Swift S-1, a Polish sailplane
Supermarine Swift, a British jet fighter built after World War II
Land
Leyland Swift, a British mid-sized bus
Suzuki Swift, a car
Skokie Swift, now known as the CTA Yellow Line, between Chicago and Skokie, IL, US
Swift Bus Rapid Transit, in Snohomish County, Washington, US
Swift card, a public transport smartcard-based ticketing scheme operated by Transport for West Midlands
Water
Swift Boat (disambiguation)
Military
HSV-2 Swift, a non-commissioned catamaran leased by the United States Navy
Swift Boats, used by the US Navy in the Vietnam War
Swift-class coastal patrol craft, patrol vessels buil |
https://en.wikipedia.org/wiki/Ben%20Mezrich | Ben Mezrich ( ; born February 7, 1969) is an American author.
He has written well-known non-fiction books, including The Accidental Billionaires and The Antisocial Network, which have been turned into the films The Social Network and Dumb Money, respectively.
Early life and education
Mezrich was born in Princeton, New Jersey, the son of Molli Newman, a lawyer, and Reuben Mezrich, a chairman of radiology at the University of Maryland School of Medicine. He has two brothers, including Josh Mezrich. He was raised in a Conservative Jewish household, and attended Princeton Day School, in Princeton, New Jersey. He graduated magna cum laude with a degree in Social Studies from Harvard University in 1991.
Personal life
Mezrich has been married to Tonya M. Chen since 2006 with whom he co-authors the Charlie Numbers series.
Some of his books have been written under the pen-name Holden Scott. Mezrich is known for his non-fiction books. He lives in Boston.
Written work
Mezrich is best known for his first non-fiction work, Bringing Down the House: The Inside Story of Six MIT Students Who Took Vegas for Millions. This book tells the story of a group of students from MIT who bet on blackjack games using a sophisticated card counting system, earning millions of dollars at casinos in Las Vegas and other gambling centers in the United States and the Caribbean. The story was made into the movie 21, released in 2008. Despite being categorized as non-fiction many of the characters in Bringing Down the House are composite characters and some of the events described have been contested by the people the characters are based on.
In 2004, Mezrich published a new book called Ugly Americans: The True Story of the Ivy League Cowboys Who Raided the Asian Markets for Millions. Also a nonfiction work, this book recounts the exploits of an American named John Malcolm, who was an assistant securities trader.
In 2005 Mezrich published Busting Vegas: The MIT Whiz Kid Who Brought the Casinos to Their Knees a semi-sequel to Bringing Down the House. The book tells the story of another student involved in a similar Blackjack team, but one that used more advanced techniques than the ones discussed in the first book. As with Bringing Down the House many of the events depicted in Busting Vegas were later contested by main character Semyon Dukach who described the book as "only about half true".
In 2007, Mezrich published Rigged which recounts the formation of what would eventually become the Dubai Mercantile Exchange by two young visionaries, one in the New York Mercantile Exchange and the other in the Dubai Ministry of Finance.
Mezrich published a new book in July 2009 about Mark Zuckerberg, the founder of Facebook, titled The Accidental Billionaires: The Founding of Facebook, A Tale of Sex, Money, Genius, and Betrayal. It debuted at No. 4 on The New York Times Nonfiction Bestseller List, and No. 1 on The Boston Globe Nonfiction Bestseller List." Aaron Sorkin adapted the boo |
https://en.wikipedia.org/wiki/WDDX | WDDX (Web Distributed Data eXchange) is a programming language-, platform- and transport-neutral data interchange mechanism designed to pass data between different environments and different computers.
History
WDDX was created by Simeon Simeonov of Allaire Corporation in 1998, initially for the ColdFusion server environment.
WDDX was open-sourced later that year.
Usage
WDDX is functionally comparable to XML-RPC and WIDL. The specification supports simple data types such as number, string, boolean, etc., and complex aggregates of these in forms such as structures, arrays and recordsets (row/column data, typically coming from database queries).
The data is encoded into XML using an XML 1.0 DTD, producing a platform-independent but relatively bulky representation. The XML-encoded data can then be sent to another computer using HTTP, FTP, or other transmission mechanism. The receiving computer must have WDDX-aware software to translate the encoded data into the receiver's native data representation. WDDX can also be used to serialize data structures to storage (file system or database). Many applications use WDDX to pass complex data to browsers where it can be manipulated with JavaScript, as an alternative to JSON.
Example from php.net:
<wddxPacket version='1.0'>
<header comment='PHP'/>
<data>
<struct>
<var name='pi'>
<number>3.1415926</number>
</var>
<var name='cities'>
<array length='3'>
<string>Austin</string>
<string>Novato</string>
<string>Seattle</string>
</array>
</var>
</struct>
</data>
</wddxPacket>
Adoption
WDDX is mainly used by ColdFusion and, as February 2022, still supported by Adobe.
Outside ColdFusion, libraries exist to read or write this format, Ruby, Python, PHP, Java, C++, .NET, Actionscript, lisp, Haskell, Perl.
PHP used to offer a comprehensive support for WDDX, which could be used as a format to store session information until the version 7.4. It has been removed since from the base language, but still available through PECL. The rationale was a lack of standardization of the format, and new formats like JSON more mainstream. A vulnerability was fixed in 2007.
Notes
External links
GCA98 WDDX Presentation
Using WDDX with Flash
XML-based standards
Markup languages
Data serialization formats |
https://en.wikipedia.org/wiki/ASCI%20Red | ASCI Red (also known as ASCI Option Red or TFLOPS) was the first computer built under the Accelerated Strategic Computing Initiative (ASCI), the supercomputing initiative of the United States government created to help the maintenance of the United States nuclear arsenal after the 1992 moratorium on nuclear testing.
ASCI Red was built by Intel and installed at Sandia National Laboratories in late 1996. The design was based on the Intel Paragon computer. The original goals to deliver a true teraflop machine by the end of 1996 that would be capable of running an ASCI application using all memory and nodes by September 1997 were met.
It was used by the US government from the years of 1997 to 2005 and was the world's fastest supercomputer until late 2000. It was the first ASCI machine that the Department of Energy acquired, and also the first supercomputer to score above one teraflops on the LINPACK benchmark, a test that measures a computer's calculation speed. Later upgrades to ASCI Red allowed it to perform above two teraflops.
ASCI Red earned a reputation for reliability that some veterans say has never been beaten. Sandia director Bill Camp said that ASCI Red had the best reliability of any supercomputer ever built, and “was supercomputing’s high-water mark in longevity, price, and performance.”
ASCI Red was decommissioned in 2006.
System structure
The ASCI Red supercomputer was a distributed memory MIMD (Multiple Instruction, Multiple Data) message-passing computer. The design provided high degrees of scalability for I/O, memory, compute nodes, storage capacity, and communications; standard parallel interfaces also made it possible to port parallel applications to the machine. The machine was structured into four partitions: Compute, Service, I/O, and System. Parallel applications executed in the Compute Partition which contained nodes optimized for floating point performance. The compute nodes had only the features required for efficient computation – they were not purposed for general interactive services. The Service Partition provided an integrated, scalable host that supported interactive users (log-in sessions), application development, and system administration. The I/O Partition supported disk I/O, a scalable parallel file system and network services. The System Partition supported initial booting and system Reliability, Availability, and Serviceability (RAS) capabilities.
The Service partition helps integrate all of the different parts of ASCI Red together. It provides a scalable host for users, and it is used for general system administration. The I/O Partition provides a file system and network services, and the Service partition is made up of the log-in screens, tools for application development, and utilities for network connections. The Compute partition contains nodes that are designed for floating point performance. This is where the actual computing takes place. Every one of the compute nodes accommodated two 200 |
https://en.wikipedia.org/wiki/Homebuilt%20machines | Homebuilt machines are machines built outside of specialised workshops or factories. This can include different things such as kit cars or homebuilt computers, but normally it pertains to homebuilt aircraft, also known as amateur-built aircraft or kit planes. Homebuilt aircraft or kit cars are constructed by amateurs. Homebuilt computers have been built at home for a long time, starting with the Victorian era pioneer Charles Babbage in the 1820s. A century later, Konrad Zuse built his own machine when electromechanical relay technology was widely available. The hobby took off with the early development of microprocessors and, since then, many enthusiasts have constructed their own computers.
A homebuilt vehicle is a wider concept than a kit car. A homebuilt vehicle is a motor vehicle (car, truck or motorcycle) built by an individual instead of a manufacturer.
These machines may be constructed "from scratch", from plans, or from assembly kits. Outside of the United States (for example in Russia) people wishing to build such complex machinery often have no professional networks to rely on for spare parts, plans, or advice in the matter and therefore have to rely on their ingenuity and intuition in order to build a machine that works.
Examples of home-built machinery
Amateur radio homebrew – Homebrew is an amateur radio slang term for home-built, noncommercial radio equipment.
Amateur telescope making – The field of amateur telescope making is considered an offshoot of the amateur astronomy community. Amateur telescope makers (sometimes called ATMs), as their name implies, are not paid professionals. They build their telescopes for the enjoyment of the hobby, or so they can make a personal contribution to the field of astronomy.
Dune buggy - popular method of building a dune buggy involves construction of a vehicle frame from steel tubing formed and welded together. The advantage of this method is that the fabricator can change fundamental parts of the vehicle (usually the suspension and addition of a built-in roll cage). Buggies of this type are called sandrails because of the rail frame. Sandrails, as with the VW Bug, often have the engine located behind the driver. Sizes can vary from a small engined one seat size to 4 seat, 8+ cylinder vehicles. Sandrails can have panels or custom shaped body coverings over the rails and tubing that comprise the vehicle, though many are left bare.
Amateur rocketry sometimes known as amateur experimental rocketry or experimental rocketry is a hobby in which participants experiment with fuels and make their own rocket motors, launching a wide variety of types and sizes of rockets. Amateur rocketeers have been responsible for significant research into hybrid rocket motors, and have built and flown a variety of solid, liquid, and hybrid propellant motors. On May 17, 2004 Civilian Space eXploration Team (CSXT) successfully launched the first amateur high-power rocket into space, achieving an altitude of 72 mile |
https://en.wikipedia.org/wiki/Grundy%20NewBrain | The Grundy NewBrain was a microcomputer sold in the early 1980s by Grundy Business Systems Ltd of Teddington and Cambridge, England. A contemporary of the ZX80 and BBC Micro, the NewBrain was mostly used in business settings. It is notable for its chicklet keyboard and models that featured a one-line display in addition to television output. Another unique feature of the system was NewBrain BASIC, a BASIC programming language that featured an on-the-fly compiler.
Originally designed at Sinclair Radionics, government ownership of that company led to Clive Sinclair leaving the company and starting a new low-cost design, the ZX80. It was considered for the BBC Micro project, but development was not complete and that was won by Acorn Computers instead. The design was then sold off by the government to recently-formed Grundy. Grundy produced the system between 1982 and 1983, with approximately 50,000 units sold during this period. The design was then sold to Dutch firm Tradecom to fill a contract for computers in training centres. These units came from existing stocks, and plans to open a factory in India never materialized.
History
Beginnings
Through the mid-1970s, Clive Sinclair's firm Sinclair Radionics entered a period of financial difficulties. This led to investment from the National Enterprise Board (NEB) in 1976 to ensure the company did not foreclose. The NEB had formed the previous year to nationalize technology companies considered critical to the UK.
Seeing his management of the company would suffer, Sinclair dusted off a company he had purchased and left unused, a shelf company, and formed Sinclair Instrument. He asked Radionics employee Christopher Curry to start it up, and in July 1977, Sinclair Instrument was renamed Science of Cambridge Ltd. Around the same time, Curry was introduced to a new small computer designed by Ian Williamson that combined a National Semiconductor SC/MP central processing unit (CPU) with parts from one of Sinclair's calculator designs. Curry put this on the market as the MK14 in June 1978, for the very low price of £40.
Curry wanted to start the development of a larger machine similar to the Apple II, but the company simply didn't have the funds to develop it. In 1978, the NEB agreed to fund the development of such a machine at Radionics. This prompted Curry to leave Science of Cambridge, and partner with Hermann Hauser to form Acorn Computers. At Radionics, development began with Mike Wakefield as the designer and Basil Smith as the software engineer.
In early 1979, the NEB sold off Radionics' calculator product lines. In July, Sinclair had enough of the NEB and quit, moving to Science of Cambridge. In return, the NEB renamed Radionics to Sinclair Electronics in September and the company was dedicated to bringing the new machine to market. Meanwhile, at Science of Cambridge, Sinclair began the development of a much simpler machine with the goal of hitting a sub-£100 price point. This would emerge in e |
https://en.wikipedia.org/wiki/Reflection%20attack | In computer security, a reflection attack is a method of attacking a challenge–response authentication system that uses the same protocol in both directions. That is, the same challenge–response protocol is used by each side to authenticate the other side. The essential idea of the attack is to trick the target into providing the answer to its own challenge.
Attack
The general attack outline is as follows:
The attacker initiates a connection to a target.
The target attempts to authenticate the attacker by sending it a challenge.
The attacker opens another connection to the target, and sends the target this challenge as its own.
The target responds to the challenge.
The attacker sends that response back to the target on the original connection.
If the authentication protocol is not carefully designed, the target will accept that response as valid, thereby leaving the attacker with one fully authenticated channel connection (the other one is simply abandoned).
In simple terms, in this type of attack, the attacker spoofs the IP address of its target, sends a query to the server exploiting the vulnerability that arises from the open nature of the misconfigured server, and the server has no way of distinguishing the spoofed IP address from the real one, and thus believes it to be an authentic request, and in turn provides a response to the query.
Solution
Some of the most common solutions to this attack are described below:
The responder sends its identifier within the response so, if it receives a response that has its identifier in it, it can reject it.
Alice initiates a connection to Bob.
Bob challenges Alice by sending a nonce N.
Alice responds by sending back the MAC calculated on her identifier and the nonce using the shared key Kab.
Bob checks the message and verifies the MAC, making sure it is from Alice and not a message he had sent in the past by making sure that it verifies with A and not B, and on the nonce which is the same as the one he sent in his challenge, then he accepts the message.
Require the initiating party to first respond to challenges before the target party responds to its challenges.
Require the key or protocol to be different between the two directions.
See also
Replay attack
Man-in-the-middle attack
Pass the hash
References
Computer security exploits
Computer access control protocols |
https://en.wikipedia.org/wiki/RDG | RDG, or Rdg, may refer to:
Rail Delivery Group, a body in the privatised British railway system
RDG Red Data Girl, fantasy novel series by Noriko Ogiwara
RDG, the AAR reporting mark for the Reading Company, a defunct US railroad
RDG, the IATA code for Reading Regional Airport in the state of Pennsylvania, US
RDG, the National Rail code for Reading railway station in the county of Berkshire, UK
Reading, in the field of temperature measurement
Rechtsdienstleistungsgesetz, the German Legal Services Act
Revolutionary Democratic Group, socialist organisation in the United Kingdom
Royal Dragoon Guards, the Royal Dragoon Guards is an armoured regiment of the British Army
Rwanda Development Gateway, a project to set up a national Rwandan portal for information sharing
See also |
https://en.wikipedia.org/wiki/Judy%20Woodruff | Judy Carline Woodruff (born November 20, 1946) is an American broadcast journalist who has worked in network, cable, and public television news since 1976. She was the anchor and managing editor of the PBS NewsHour through the end of 2022. Woodruff has covered every presidential election and convention since 1976. She has interviewed several heads of state and moderated U.S. presidential debates.
After graduating from Duke University in 1968, Woodruff entered local television news in Atlanta. She was named White House correspondent for NBC News in 1976, a position she held for six years. She joined PBS in 1982, where she continued White House reports for the PBS NewsHour, formerly The MacNeil/Lehrer NewsHour, in addition to presenting another program. She moved to CNN in 1993 to host Inside Politics and CNN WorldView together with Bernard Shaw, until he left CNN. Woodruff left CNN in 2005, and returned to PBS and the NewsHour in 2006. In 2013, she and Gwen Ifill were its named official anchors, succeeding founding presenter Jim Lehrer. Woodruff and Ifill shared managing newsgathering duties until Ifill's death in 2016. Woodruff succeeded Ifill as the program's sole main presenter. In May 2022, Woodruff announced that she would step down as the NewsHour anchor at year's end, and her final day as anchor was on December 30, 2022.
Early life and education
Woodruff was born on November 20, 1946, in Tulsa, Oklahoma, to William H. Woodruff, a chief warrant officer in the Army, and Anna Lee (née Payne) Woodruff. She has one sister, Anita. She grew up as an army brat, and because of that moved multiple times during her childhood, attending seven schools between kindergarten and seventh grade. Woodruff moved from Oklahoma to Germany when she was five years old. She then moved to army bases in Missouri and New Jersey, returned to Oklahoma, lived in Taiwan for a few years, and subsequently went to North Carolina, before settling in the Augusta, Georgia, area, when her father was stationed at Fort Gordon. Woodruff went to the Academy of Richmond County, a high school in Augusta. In 1963, she won the beauty pageant Young Miss Augusta.
Woodruff attended Meredith College in Raleigh, North Carolina, starting in 1964, initially pursuing a degree in mathematics. In an interview, she said that her political science teacher at Meredith got her interested in politics. After two years at Meredith, Woodruff transferred to Duke University in 1966. She was active in the student government of Duke, and was a member of the sorority Alpha Delta Pi.
While studying, Woodruff worked for Georgia Representative Robert Grier Stephens Jr. as an intern during two summers, but was discouraged from working in Washington, D.C., because of how women were treated there. Woodruff decided to enter journalism in her senior year. She graduated from Duke with a bachelor's degree in political science in 1968. She served on Duke's board of trustees between 1985 and 1997. Woodruff received a |
https://en.wikipedia.org/wiki/D-Link | D-Link Systems, Inc. (formerly Datex Systems, Inc.) is a Taiwanese multinational networking equipment corporation founded in 1986 and headquartered in Taipei, Taiwan.
History
Datex Systems was founded in 1986 in Taipei, Taiwan.
In 1992 the company changed its name into D-Link.
D-Link went public and became the first networking company on the Taiwan Stock Exchange in 1994. It is now publicly traded on the TSEC and NSE stock exchanges.
In 1988, D-Link released the industry's first peer-to-peer LANSmart Network Operating System, able to run concurrently with early networking systems such as Novell's NetWare and TCP/IP, which most small network operating systems could not do at the time.
In 2007, it was the leading networking company in the small to medium business (SMB) segment worldwide with a 21.9% market share. In March 2008, it became the market leader in Wi-Fi product shipments worldwide, with 33% of the total market. In 2007, the company was featured in the "Info Tech 100", a listing of the world's best IT companies. It was also ranked as the 9th best IT company in the world for shareholder returns by BusinessWeek. In the same year, D-Link released one of the first WiFiCertified802.11n draft 2.0 Wi-Fi routers (DIR-655), which subsequently became one of the most successful draft 802.11n routers.
In May 2013, D-Link released its flagship draft 802.11ac Wireless AC1750 Dual-Band Router (DIR-868L), which at that point had attained the fastest-ever wireless throughput as tested by blogger Tim Higgins.
In April 2019, D-Link was named "Gartner Peer Insights Customers’ Choice for Wired and Wireless LAN Access Infrastructure".
In June 2020, D-Link joined the Taiwan Steel Group (TSG).
In 2021, D-Link announced to become the agent for the international information security brand, Cyberbit in Taiwan, and launched the new EAGLE PRO AI series transforming home Wi-Fi experiences.
In 2022, D-Link obtained the TRUSTe Privacy seal, certification of ISO/IEC 27001:2013 and BS 10012. It also obtained the GHG Part 1 certification of ISO 14064-1 2018. Moreover, D-Link established the "D-Link Group Scholarship" with National Taiwan University of Science and Technology to encourage foreign students to study in Taiwan.
Examples of D-Link products
Controversies
In January 2010, it was reported that HNAP vulnerabilities had been found on some D-Link routers. D-Link was also criticized for their response which was deemed confusing as to which models were affected and downplayed the seriousness of the risk. However the company issued fixes for these router vulnerabilities soon after.
In January 2013, version v1.13 for the DIR-100 revA was reported to include a backdoor in the firmware. By passing a specific user agent in an HTTP request to the router, normal authentication is bypassed. It was reported that this backdoor had been present for some time. This backdoor however was closed soon after with a security patch issued by the company.
Computerworld rep |
https://en.wikipedia.org/wiki/Organic%20computing | Organic computing is computing that behaves and interacts with humans in an organic manner. The term "organic" is used to describe the system's behavior, and does not imply that they are constructed from organic materials. It is based on the insight that we will soon be surrounded by large collections of autonomous systems, which are equipped with sensors and actuators, aware of their environment, communicate freely, and organize themselves in order to perform the actions and services that seem to be required.
The goal is to construct such systems as robust, safe, flexible, and trustworthy as possible. In particular, a strong orientation towards human needs as opposed to a pure implementation of the technologically possible seems absolutely central. In order to achieve these goals, our technical systems will have to act more independently, flexibly, and autonomously, i.e. they will have to exhibit lifelike properties. We call such systems "organic". Hence, an "Organic Computing System" is a technical system which adapts dynamically to exogenous and endogenous change. It is characterized by the properties of self-organization, self-configuration, self-optimization, self-healing, self-protection, self-explaining, and context awareness. It can be seen as an extension of the Autonomic computing vision of IBM.
In a variety of research projects the priority research program SPP 1183 of the German Research Foundation (DFG) addresses fundamental challenges in the design of Organic Computing systems; its objective is a deeper understanding of emergent global behavior in self-organizing systems and the design of specific concepts and tools to support the construction of Organic Computing systems for technical applications.
See also
Biologically inspired computing
Autonomic computing
References
Müller-Schloer, Christian; v.d. Malsburg, Christoph and Würtz, Rolf P. Organic Computing. Aktuelles Schlagwort in Informatik Spektrum (2004) pp. 332–336.
Müller-Schloer, Christian. Organic Computing – On the Feasibility of Controlled Emergence. CODES + ISSS 2004 Proceedings (2004) pp 2–5, ACM Press, .
Rochner, Fabian and Müller-Schloer, Christian. Emergence in Technical Systems. it Special Issue on Organic Computing (2005) pp. 188–200, Oldenbourg Verlag, Jahrgang 47, ISSN 1611-2776.
Schmeck, Hartmut. Organic Computing – A New Vision for Distributed Embedded Systems. Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing (ISORC’05) (2005) pp. 201–203, IEEE, IEEE Computer Society 2005.
Würtz, Rolf P. (Editor): Organic Computing (Understanding Complex Systems). Springer, 2008. .
External links
DFG SPP 1183 Organic Computing
Position Paper Organic Computing (German)
Self-Organising Systems (SOS) FAQ
The Organic Computing Page
The PUPS/P3 Organic Computing Environment for Linux (Free Software)
SeSAm Multiagent simulator and graphical modelling environment. (Free Software)
Programming paradigms |
https://en.wikipedia.org/wiki/Government%20Open%20Systems%20Interconnection%20Profile | The Government Open Systems Interconnection Profile (GOSIP) was a specification that profiled open networking products for procurement by governments in the late 1980s and early 1990s.
Timeline
1988 - GOSIP: Government Open Systems Interconnection Profile published by CCTA, an agency of UK government
1988 - UK's CCTA commences work with France and West Germany on European Procurement Handbook (EPHOS)
1990 - The US specification requiring Open Systems Interconnection (OSI) protocols was first published as Federal Information Processing Standards document FIPS 146-1. The requirement for US Government vendors to demonstrate their support for this profile led them to join the formal interoperability and conformance testing for networking products, which had been done by industry professionals at the annual InterOp show since 1980.
1990 - Publication of European Procurement Handbook (EPHOS), intended to be a European GOSIP
1991 - 4th and final version of UK GOSIP released
1993 - Australia and New Zealand GOSIP Version 3 - 1993 Government Open Systems Interconnection Profile
1995 - FIPS 146-2 allowed "...other specifications based on open, voluntary standards such as those cited in paragraph 3 ("...such as those developed by the Internet Engineering Task Force (IETF)... and the International Telecommunications Union, Telecommunication Standardization Sector (ITU–T))"
In practice, from 1995 interest in OSI implementations declined, and worldwide the deployment of standards-based networking services since have been predominantly based on the Internet protocol suite. However, the Defense Messaging System continued to be based on the OSI protocols X.400 and X.500, due to their integrated security capabilities.
See also
OSI model
ISO Development Environment (ISODE)
Protocol Wars
References
Computer standards |
https://en.wikipedia.org/wiki/Automatic%20Digital%20Network | The Automatic Digital Network System, known as AUTODIN, is a legacy data communications service in the United States Department of Defense. AUTODIN originally consisted of numerous AUTODIN Switching Centers (ASCs) located in the United States and in countries such as England and Japan.
Background
The design of the system, originally named "ComLogNet", began in 1958 by a team of Western Union, RCA and IBM. The customer was the U.S. Air Force and the system's purpose was to improve the speed and reliability of logistics traffic (spare parts for missiles) between five logistics centers and roughly 350 bases and contractor locations. An implementation contract was awarded in the fall of 1959 to Western Union as prime contractor and system integrator, RCA to build the 5 switching center computers and IBM for the compound terminals which provided for both IBM punched card and Teletype data entry. The first site became operational in 1962. During the implementation the government realized the broader value of the system and transferred it to the Defense Communications Agency (DCA) which renamed it "AUTODIN". In 1962 the government solicited competitive bids for a 9 center expansion which was won by Philco-Ford.
Deployment started in 1966. On March 22, 1968, Autodin multimedia terminal in Europe became operational at Ramstein Air base in Germany. This system linked more than 300 Air Forces bases, material areas, depots and other authorized agencies into a single communications network. In the ASCs; operational until the late 1980s the Philco-Ford OL9 computers were still in use with periodic technological updates. In the 1988 to 1990 timeframe an initiative by the Department of Defense for "off the shelf" hardware initiated a replacement of the Philco-Ford processors by DEC VAX 11/780 series systems.
In 1982, a follow-on project, AUTODIN II, was terminated in favor of using ARPANET technology for the Defense Data Network (including a military subnet known as MILNET).
AUTODIN Switching Centers have been replaced by various hardware/software combinations. The following are some examples:
A program called NOVA to operate circuits and route messages. The system is designed to run at 2400 baud, however speeds up to 9600 baud are possible. The system is able to run down to 15 baud if communications systems require it.
A series of hardware/software systems called DABS (DoDIIS Autodin Bypass System) which allows the transmission of messages over Serial connections at up to 9600 Baud as well as TCP/IP connections that allow the transmission of messages across Ethernet connects at speeds limited only by the network bandwidth.
In 1996, DoD decided to phase out AUTODIN by December 31, 1999. Early in the 21st century, all but one of the AUTODIN Switching Centers had been shut down. The intention is to transition secure messaging traffic to the Defense Message System.
See also
Defense Switched Network
Defense Message System
Western Union
AUTOVON con |
https://en.wikipedia.org/wiki/Sly%20Cooper%20and%20the%20Thievius%20Raccoonus | Sly Cooper and the Thievius Raccoonus, known as Sly Raccoon in PAL territories, is a 2002 stealth platform video game developed by Sucker Punch Productions and published by Sony Computer Entertainment for the PlayStation 2. The game follows master thief Sly Cooper and his gang, Bentley the Turtle and Murray the Hippo, as they seek out criminals known as the Fiendish Five to recover the pages of the "Thievius Raccoonus", the book of the accumulation of all of Sly's ancestors' thieving moves.
Sly Cooper and the Thievius Raccoonus was praised for using a variation on cel-shading rendering, which is used to create a film noir feel, while still rendered as a hand-drawn animated film, though criticized for being too short. The game was followed by three sequels: Sly 2: Band of Thieves (2004), Sly 3: Honor Among Thieves (2005), and Sly Cooper: Thieves in Time (2013), becoming the first installment of the series. It was remastered alongside its initial two sequels and compiled as the The Sly Collection for the PlayStation 3 and PlayStation Vita.
Gameplay
Sly Cooper is a third person platforming video game which incorporates stealth elements; as noted by an Official U.S. PlayStation Magazine retrospective, the game "tries to mix one-hit-kill arcade action with Splinter Cell sneaking". The player controls Sly Cooper, the title character, as he moves between each uniquely themed lair of the Fiendish Five and the sub-sections of those lairs, avoiding security systems and the watchful eyes of enemies. While Sly is equipped with a cane to attack his foes, he can be defeated with a single hit, so the player is urged to use stealth maneuvers and the environment to evade or silently neutralize potential threats.
To assist in these stealth moves, the environment contains special areas colored with blue sparkles of light, identified in the game as Sly's thief senses. The player can trigger context-sensitive actions in these areas, such as shimmying along a narrow ledge or wall, landing on a pointed object such as an antenna or streetlight, climbing along the length of a narrow pole or pipe, or using the cane to grapple onto something. The player must avoid detection by security systems and enemies, otherwise, an alarm will sound and the player will either have to destroy the alarm, avoid or defeat foes alerted by the alarm or hide for several seconds until the alarm resets. The game uses a dynamic music system that changes depending on the state of alarm in the area: the music will increase in volume and pacing when Sly attacks or is detected, and then will quiet down as the disturbance goes away.
Each sub-section of a lair contains a number of clue bottles that, when collected, allow Sly to access a safe in the level that contains a page from the Thievius Raccoonus. These pages grant Sly new moves to aid in movement, stealth, or combat, such as creating a decoy or dropping an explosive hat. Defeating each of the bosses also gives Sly moves, and these abilitie |
https://en.wikipedia.org/wiki/Colossal%20Adventure | Colossal Adventure is a text based adventure game published by Level 9 Computing in 1982. It was originally released for the Nascom.
Gameplay
Colossal Adventure is an expanded version of the original Adventure by Will Crowther and Don Woods. Over 70 additional locations were added.
Development and release
Colossal Adventure was the first commercial game from Level 9.
It was later released as the first game in the Jewels of Darkness trilogy.
Reception
Allan J. Palmer for Page 6 said "Great Scott (Adams?)! Level 9 Computing have a winner here in this excellent rendition of the original Crowther/Woods mainframe Adventure game."
Steve Cooke for Personal Computer Games said "Although by contrast with some programs available on other machines this program looks a little dated, it shines out like a star in an empty sky as far as Lynx owners are concerned."
John Conquest for Big K said "Even by Level 9's present standards, Colossal Adventure is not the best game available, nor the most engrossing, the most difficult, the most fun, or indeed the most anything."
Stuart Menges for Acorn User said "Colossal Adventure is one of the best in its class. I would recommend it to any adventurer." Philip Garritt for Acorn User said "The program [...] is good value and will give many hours of entertainment."
What MSX? said "Level 9 is the number one software house for adventures, and this is the number one title. MSX owners start here."
Micro Adventurer referred to the game as a "first-class version" of the original Adventure, while Amstrad Action said "it's still the best and lengthiest version of this text-only classic available for a micro".
Crash considered the game "Recommended."
A retrospective review in The Spectrum Show said "If you want the granddaddy of all adventures, this is the one to get, closely followed by the Abersoft one that was bought by Melbourne House and released as Classic Adventure."
Reviews
Your Computer - September 1983
Home Computing Weekly - Jun 11, 1985
Home Computing Weekly - Aug 30, 1983
Happy Computer - Feb, 1984
References
External links
Game manual
1980s interactive fiction
1983 video games
Adventure games
BBC Micro and Acorn Electron games
BBC Micro and Acorn Electron-only games
Level 9 Computing games
Video games developed in the United Kingdom |
https://en.wikipedia.org/wiki/Mega%20Man%20Network%20Transmission | is a 2003 action-platform video game developed by Arika and published by Capcom for the GameCube video game console. The game was first released in Japan on March 6, 2003, and in North America and PAL regions the following June. Network Transmission is part of the Mega Man Battle Network series, which originated on the Game Boy Advance (GBA) handheld and takes place in an alternate timeline to the main Mega Man series.
Taking place one month after the events of the first Mega Man Battle Network game, the plot follows the protagonist Lan Hikari and his online avatar MegaMan.EXE in their fight against the "WWW (World Three)" organization and its attempt to unleash and spread the infectious "Zero Virus" into cyberspace. The player controls MegaMan through a set of levels that require actions such as jumping, sliding, and shooting, as well as the use of special "Battle Chips" that grant the player various combat and movement abilities. Network Transmission combines action and platforming gameplay elements from older Mega Man games with the strategy and role-playing elements as defined by the Battle Network series.
The development team's intent was to meld these attributes into a home console title that would appeal to the young gamer audience that they found with the GBA series. Critical reception for Network Transmission has been mostly average reviews. Although it received some positive remarks for its Battle Chip gameplay, many critics have complained that the game features a high or unbalanced difficulty level. The game's sound and its combination of 2D and 3D cel-shaded graphics have been met with varied opinions.
Plot
The storyline of Mega Man Network Transmission takes place during the first decade of the 21st century ("200X"), one month after the original Mega Man Battle Network. Following the defeat of the "Life Virus", the ultimate weapon of Dr. Wily and the "WWW (World Three)" organization, Lan Hikari and his network navigator (NetNavi) MegaMan.EXE return to a life of ease. However, no sooner does Lan begin to relax when he hears of a mysterious and destructive computer virus called the "Zero Virus" that infects Navis and causes mayhem via his personal information terminal (PET) e-mail. Lan has other qualms to deal with however, receiving an e-mail detailing fellow NetNavi Roll.EXE being trapped in the internet. MegaMan goes to save her, finding an infected FireMan.EXE as the cause of trouble. Defeating him, the duo talk to FireMan's operator, Mr. Match, and learn of the vaccine being distributed to amend the Zero Virus is actually doing just the opposite, having caused FireMan to go berserk.
Confirming this with Lan's father, Dr. Yuichiro Hikari, the two set out to search for the cure of the problem, finding many situations of pragmatic Navis infected and causing mayhem. Stopping all of them and returning them to their respective operators, the two eventually discover more clues leading to the remnants of the WWW. It is revealed that |
https://en.wikipedia.org/wiki/Type-in%20program | A type-in program or type-in listing was computer source code printed in a home computer magazine or book. It was meant to be entered via the keyboard by the reader and then saved to cassette tape or floppy disk. The result was a usable game, utility, or application program.
Type-in programs were common in the home computer era from the late 1970s through the early 1990s, when the RAM of 8-bit systems was measured in kilobytes and most computer owners did not have access to networks such as bulletin board systems.
Magazines such as Softalk, Compute!, ANALOG Computing, and Ahoy! dedicated much of each issue to type-in programs. The magazines could contain multiple games or other programs for a fraction of the cost of purchasing commercial software on removable media, but the user had to spend up to several hours typing each one in. Most listings were either in a system-specific BASIC dialect or machine code. Machine code programs were long lists of decimal or hexadecimal numbers, often in the form of DATA statements in BASIC. Most magazines had error checking software to make sure a program was typed correctly.
Type-in programs did not carry over to 16-bit computers such as the Amiga and Atari ST in a significant way, as both programs and data (such as graphics) became much larger. It became common to include a covermount 3 -inch floppy disk or CD-ROM with each issue of a magazine.
Description
A reader would take a printed copy of the program listing, such as from a magazine or book, sit down at a computer, and manually enter the lines of code. Computers of this era automatically booted into a programming environment – even the commands to load and run a prepackaged program were really programming commands executed in direct mode. After typing the program in, the user would be able to run it and also to save it to disk or a cassette for future use. Users were often cautioned to save the program before running it, as errors could result in a crash requiring a reboot, which would render the program irretrievable unless it had been saved. While some type-in programs were short, simple utility or demonstration programs, many type-ins were fully functional games or application software, sometimes rivaling commercial packages.
Type-ins were usually written in BASIC or a combination of a BASIC loader and machine code. In the latter case, the opcodes and operands of the machine code part were often simply given as DATA statements within the BASIC program, and were loaded using a POKE loop, since few users had access to an assembler. In some cases, a special program for entering machine code numerically was provided. Programs with a machine code component sometimes included assembly language listings for users who had assemblers and who were interested in the internal workings of the program.
The downside of type-ins was labor. The work required to enter a medium-sized type-in was on the order of hours. If the resulting program turned out not to b |
https://en.wikipedia.org/wiki/Minimum%20degree%20algorithm | In numerical analysis, the minimum degree algorithm is an algorithm used to permute the rows and columns of a symmetric sparse matrix before applying the Cholesky decomposition, to reduce the number of non-zeros in the Cholesky factor.
This results in reduced storage requirements and means that the Cholesky factor can be applied with fewer arithmetic operations. (Sometimes it may also pertain to an incomplete Cholesky factor used as a preconditioner—for example, in the preconditioned conjugate gradient algorithm.)
Minimum degree algorithms are often used in the finite element method where the reordering of nodes can be carried out depending only on the topology of the mesh, rather than on the coefficients in the partial differential equation, resulting in efficiency savings when the same mesh is used for a variety of coefficient values.
Given a linear system
where A is an real symmetric sparse square matrix. The Cholesky factor L will typically suffer 'fill in', that is have more non-zeros than the upper triangle of A. We seek a permutation matrix P, so that the matrix
, which is also symmetric, has the least possible fill in its Cholesky factor. We solve the reordered system
The problem of finding the best ordering is an NP-complete problem and is thus intractable, so heuristic methods are used instead. The minimum degree algorithm is derived from a method first proposed by Markowitz in 1959 for non-symmetric linear programming problems, which is loosely described as follows. At each step in Gaussian elimination row and column permutations are performed so as to minimize the number of off diagonal non-zeros in the pivot row and column. A symmetric version
of Markowitz method was described by Tinney and Walker in 1967 and Rose later derived a graph theoretic version of the algorithm where the factorization is only simulated, and this was named the minimum degree algorithm. The graph referred to is the graph with n vertices, with vertices i and j connected by an edge when , and the degree is the degree of the vertices. A crucial aspect of such algorithms is a tie breaking strategy when there is a choice of renumbering resulting in the same degree.
A version of the minimum degree algorithm was implemented in the MATLAB function symmmd (where MMD stands for multiple minimum degree), but has now been superseded by a symmetric approximate multiple minimum degree function symamd, which is faster. This is confirmed by theoretical analysis, which shows that for graphs with n vertices and m edges, MMD has a tight upper bound of on its running time, whereas for AMD a tight bound of holds. Cummings, Fahrbach, and Fatehpuria designed an exact minimum degree algorithm with running time, and showed that no such algorithm can exist that runs in time , for any , assuming the strong exponential time hypothesis.
References
Numerical linear algebra
Matrix theory |
https://en.wikipedia.org/wiki/Logical%20schema | A logical data model or logical schema is a data model of a specific problem domain expressed independently of a particular database management product or storage technology (physical data model) but in terms of data structures such as relational tables and columns, object-oriented classes, or XML tags. This is as opposed to a conceptual data model, which describes the semantics of an organization without reference to technology.
Overview
Logical data models represent the abstract structure of a domain of information. They are often diagrammatic in nature and are most typically used in business processes that seek to capture things of importance to an organization and how they relate to one another. Once validated and approved, the logical data model can become the basis of a physical data model and form the design of a database.
Logical data models should be based on the structures identified in a preceding conceptual data model, since this describes the semantics of the information context, which the logical model should also reflect. Even so, since the logical data model anticipates implementation on a specific computing system, the content of the logical data model is adjusted to achieve certain efficiencies.
The term 'Logical Data Model' is sometimes used as a synonym of 'domain model' or as an alternative to the domain model. While the two concepts are closely related, and have overlapping goals, a domain model is more focused on capturing the concepts in the problem domain rather than the structure of the data associated with that domain.
History
When ANSI first laid out the idea of a logical schema in 1975, the choices were hierarchical and network. The relational model – where data is described in terms of tables and columns – had just been recognized as a data organization theory but no software existed to support that approach. Since that time, an object-oriented approach to data modelling – where data is described in terms of classes, attributes, and associations – has also been introduced.
Logical data model topics
Reasons for building a logical data structure
Helps common understanding of business data elements and requirement
Provides foundation for designing a database
Facilitates avoidance of data redundancy and thus prevent data and business transaction inconsistency
Facilitates data re-use and sharing
Decreases development and maintenance time and cost
Confirms a logical process model and helps impact analysis.
Conceptual, logical and physical data model
A logical data model is sometimes incorrectly called a physical data model, which is not what the ANSI people had in mind. The physical design of a database involves deep use of particular database management technology. For example, a table/column design could be implemented on a collection of computers, located in different parts of the world. That is the domain of the physical model.
Conceptual, logical and physical data models are very different in t |
https://en.wikipedia.org/wiki/Virtual%20Air%20Traffic%20Simulation%20Network | Virtual Air Traffic Simulation Network (VATSIM) is a nonprofit organization that operates an online flight-simulation network noted for its active membership and realism. Users are able to fly aircraft as a pilot, or direct traffic as an air traffic controller in what has been described as a close approximation of real-life aviation procedures.
Overview
Communications between pilots and controllers are carried out using integrated VoIP or in-game text messages. Users are required to use custom software, designated as approved clients, in order to connect to the simulation.
The main organs of the network consist of the Board of Governors, three of whom are responsible for one of the three geographic regions—namely, the Europe, the Middle East and Africa region, the Asia-Pacific region, and the Americas region, referred to as VATEMEA, VATAPAC and VATAMAS respectively. These regions are further subdivided into divisions, some of which further divide into virtual area control centers, and virtual air route traffic control centers. Operating procedures within each area reflect local standards.
The network also has a volunteer team of supervisors that help those who may need assistance in flying on the network and also help resolve reports of other fellow users breaking the VATSIM Code of Conduct. Upon registering for the VATSIM network, new users have to undertake an entry-level test about basic piloting skills and about the rules of the network. This was introduced on September 1, 2020, alongside a further restructuring of the pilot rating system to teach VATSIM users how to properly use the network and reduce the number of cases of pilots connecting without knowing what to do in busy airspace, causing disruption and frustration for some controllers.
Because the simulation adheres as closely as possible to real-life aviation procedures and radio phraseology, VATSIM can function as a training aid for student pilots lacking experience and private and commercial pilots looking to enhance their skills in radio communications. Events in the simulation are not hard coded on the network but rather emerge through human interaction and error. Consequently, the network has been described as bringing immersion to what was historically a solitary exercise and credited with playing a key role in the commodification of flight-simulation software.
History
Formation of VATSIM
Spearheaded by Harvey Stein, the founding of VATSIM was announced on July 12, 2001, following the dissolution of the Simulated Air Traffic Controllers Organization (SATCO). This occurred after the founding of another network, IVAO, which was more European-oriented, unlike SATCO, which was more American-oriented. The board drew up terms of agreement with Randy Whistler, the then President of SATCO, declaring VATSIM the official successor of SATCO.
In 2020, VATSIM announced it had achieved 100,000 active users for the first time, an increase of 20,000 users in two years.
SquawkBox and Pr |
https://en.wikipedia.org/wiki/IEEE%20802.10 | IEEE 802.10 is a former standard for security functions that could be used in both local area networks and metropolitan area networks based on IEEE 802 protocols.
802.10 specifies security association management and key management, as well as access control, data confidentiality and data integrity.
The IEEE 802.10 standards were withdrawn in January 2004 and this working group of the IEEE 802 is not currently active. Security for wireless networks was standardized in 802.11i.
The Cisco Inter-Switch Link (ISL) protocol for supporting VLANs on Ethernet and similar LAN technologies was based on IEEE 802.10; in this application 802.10 has largely been replaced by IEEE 802.1Q.
The standard being developed has 8 parts:
a. Model, including security management
b. Secure Data Exchange (SDE) protocol
c. Key Management
d. - has now been incorporated in 'a' -
e. SDE Over Ethernet 2.0
f. SDE Sublayer Management
g. SDE Security Labels
h. SDE PICS Conformance.
Parts b, e, f, g, and h are incorporated in IEEE Standard 802.10-1998.
External links
IEEE Std 802.10-1998
IEEE 802
Computer security standards |
https://en.wikipedia.org/wiki/ABC%20Radio%20Sydney | ABC Radio Sydney (official call sign: 2BL, formerly 2SB) is an ABC radio station in Sydney, Australia. It is the flagship station in the ABC Local Radio network and broadcasts on 702 kHz on the AM dial. The station transmits with a power (CMF) of 3,110V, which is equivalent to 50 kW (the maximum permissible in Australia) from a site west of the Sydney CBD.
History
ABC Radio Sydney is the first public radio station in Australia opened in Sydney at 8:00pm on 23 November 1923. Its first callsign was 2SB where 2 denotes the State of New South Wales and SB stood for Sydney Broadcasters Limited. However, the callsign was soon altered to 2BL for Sydney Broadcasters Limited. The change was due to the audio similarity of the sounds FC and SB.
In May 1928 the Sydney Broadcasting Company was formed to take over stations 2BL and 2FC.
A year later a consortium of entertainment companies founded the Australian Broadcasting Company Limited (ABC) to supply programme material to 2BL, 2FC and similar "A-class" stations in other capital cities.
2BL became one of the inaugural stations, along with sister station 2FC, in the government-owned Australian Broadcasting Commission (also ABC) network when it was founded in 1932. In 1946, it became the flagship of the National Programme, forerunner of Radio National. It also began carrying parliamentary broadcasts. In 1963, it swapped formats with 2FC and assumed that station's old role as flagship of the Interstate Programme, which eventually evolved into Local Radio. However, it continued to air parliament until 1988. 2BL was re-branded as 702 ABC Sydney in 2000 and then ABC Radio Sydney in 2017.
In the second radio ratings survey of 2012, Nielsen Media Research recorded 702's share of the Sydney radio market as the second largest at 10.3%, behind commercial talk station 2GB.
Most Local Radio stations in New South Wales simulcast 702's programming when not airing local shows for their areas. The exception is 999 ABC Broken Hill, which relays 891 ABC Adelaide due to Broken Hill being on Central Time.
Programs
Daily scheduling
Breakfast, with James Valentine – 5:30am to 8:00am
AM, with Sabra Lane – 8:00am to 8:30am
Mornings, with Sarah Macdonald – 8:30am to 11:00am
Conversations, with Richard Fidler and Sarah Kanowski (Radio National) – 11:00am to 12:00pm
The World Today, with Sally Sara – 12:00pm to 12:30pm
Afternoons, with Josh Szeps – 12:30pm to 3:30pm
Drive, with Richard Glover – 3:30pm to 6:30pm
PM, with David Lipson – 6:30pm to 7:00pm
Evenings, with Indira Naidoo – 7:00pm to 10:00pm
Nightlife, with Philip Clark (Monday to Thursday) and Suzanne Hill (Friday to Sunday) – 10:00pm to 2:00am
Overnights, with Trevor Chappell (Monday to Thursday from Melbourne) and Rod Quinn (Friday to Sunday from Sydney) – 2:00am to 6:00am
Other programs
Thank God it's Friday is broadcast every Friday on Richard Glover's Drive show and features a roundup of the week's events, featuring various Australian comedians. TG |
https://en.wikipedia.org/wiki/Head%20of%20the%20Class | Head of the Class is an American sitcom television series that ran from 1986 to 1991 on the ABC television network.
The series follows a group of gifted students in the Individualized Honors Program (IHP) at the fictional Millard Fillmore High School in Manhattan, and their history teacher Charlie Moore (Howard Hesseman). The program was ostensibly a vehicle for Hesseman, best known for his role as radio DJ Dr. Johnny Fever on the sitcom WKRP in Cincinnati (1978–1982). Hesseman left Head of the Class in 1990 and was replaced by Scottish comedian Billy Connolly (in his first major American production) as teacher Billy MacGregor for the final season. After the series ended, Connolly appeared in a short-lived spin-off titled Billy.
The series was created and executive produced by Richard Eustis and Michael Elias. Elias had previously worked as a substitute teacher in New York City while hoping to become an actor.
A revival of the series was ordered and co-produced by Bill Lawrence's Doozer and Warner Horizon Scripted Television. It was released on HBO Max.
Synopsis
Head of the Class is mainly set in the classroom of academically gifted high school students in the Individualized Honors Program at Millard Fillmore High School in New York City. The IHP students comprised a diverse range of personalities, ethnicities and academic specialties.
For the first three years of the show, the IHP class had ten students. Arvid Engen (Dan Frischman) was a skinny, bespectacled nerd, mathematics expert, and budding scientist. Arvid's best friend was the overweight, wisecracking cynic Dennis Blunden (Dan Schneider), a computer whiz whose fields were chemistry and physics and who had a knack for getting the socially inept Arvid involved in various schemes. Both characters wanted to go to M.I.T. Alan Pinkard (Tony O'Dell) was an ultra-conservative preppy and egotist; his area of expertise was political science and he was a devout fan of Ronald Reagan. Alan competed for the highest grades in the class with Darlene Merriman (Robin Givens), a spoiled rich girl who was probably even more self-centered than Alan and whose specialties were speech and debate. Both Alan and Darlene held the ambition of being named class valedictorian. Sarah Nevins (Kimberly Russell) did not have any particular area of expertise; she was the most down-to-earth of the IHP class and was once cited as having the lowest G.P.A. Maria Borges (Leslie Bega) was very passionate about getting A's (going as far as grounding herself in the pilot episode for getting a 'B'), and Jawaharlal Choudhury (Jory Husain aka Joher Coleman) was an exchange student from India whose expertise was natural science. Eleven-year-old Janice Lazarotto (Tannis Vallely), despite her young age, was in high school and the IHP class because of her advanced intellect. Arts student Simone Foster (Khrystyne Haje) was a quiet, sensitive redhead with a particular fondness for poetry. A notable development in the show was the rela |
https://en.wikipedia.org/wiki/Pay-per-click | Pay-per-click (PPC) is an internet advertising model used to drive traffic to websites, in which an advertiser pays a publisher (typically a search engine, website owner, or a network of websites) when the ad is clicked.
Pay-per-click is usually associated with first-tier search engines (such as Google Ads, Amazon Advertising, and Microsoft Advertising formerly Bing Ads). With search engines, advertisers typically bid on keyword phrases relevant to their target market and pay when ads (text-based search ads or shopping ads that are a combination of images and text) are clicked. In contrast, content sites commonly charge a fixed price per click rather than use a bidding system. PPC display advertisements, also known as banner ads, are shown on websites with related content that have agreed to show ads and are typically not pay-per-click advertising, but instead, usually charge on a cost per thousand impressions (CPM). Social networks such as Facebook, Instagram, LinkedIn, Reddit, Pinterest, TikTok, and Twitter have also adopted pay-per-click as one of their advertising models. The amount advertisers pay depends on the publisher and is usually driven by two major factors: the quality of the ad, and the maximum bid the advertiser is willing to pay per click measured against its competitors' bids. In general, the higher the quality of the ad, the lower the cost per click is charged, and vice versa.
However, websites can offer PPC ads. Websites that utilize PPC ads will display an advertisement when a query (keyword or phrase) matches an advertiser's keyword list that has been added in different ad groups, or when a content site displays relevant content. Such advertisements are called sponsored links or sponsored ads, and appear adjacent to, above, or beneath organic results on search engine results pages (SERP), or anywhere a web developer chooses on a content site.
The PPC advertising model is open to abuse through click fraud, although Google and others have implemented automated systems to guard against abusive clicks by competitors or corrupt web developers.
Purpose
Pay-per-click, along with cost per impression (CPM) and cost per order, is used to assess the cost-effectiveness and profitability of internet marketing and drive the cost of running an advertisement campaign as low as possible while retaining set goals. In Cost Per Thousand Impressions (CPM), the advertiser only pays for every 1000 impressions of the ad. Pay-per-click (PPC) has an advantage over cost-per-impression in that it conveys information about how effective the advertising was. Clicks are a way to measure attention and interest. If the main purpose of an ad is to generate a click, or more specifically drive traffic to a destination, then pay-per-click is the preferred metric. The quality and placement of the advertisement will affect click through rates and the resulting total pay-per-click cost.
Construction
Cost-per-click (CPC) is calculated by dividing the advertisi |
https://en.wikipedia.org/wiki/Windows%20Glyph%20List%204 | Windows Glyph List 4, or more commonly WGL4 for short, also known as the Pan-European character set, is a character repertoire on Microsoft operating systems comprising 657 Unicode characters, two of them private use. Its purpose is to provide an implementation guideline for producers of fonts for the representation of European natural languages; fonts that provide glyphs for the entire set of characters can claim WGL4 compliance and thus can expect to be compatible with a wide range of software.
, WGL4 characters were the only ones guaranteed to display correctly on Microsoft Windows. More recent versions of Windows display far more glyphs.
Because many fonts are designed to fulfill the WGL4 set, this set of characters is likely to work (display as other than replacement glyphs) on many computer systems. For example, all the non-private-use characters in the table below are likely to display properly, compared to the many missing characters that may be seen in other articles about Unicode.
Repertoire
The repertoire, defined by Microsoft, encompasses all the characters found in Microsoft's code pages 1252 (Windows Western), 1250 (Windows Central European), 1251 (Windows Cyrillic), 1253 (Windows Greek), 1254 (Windows Turkish), and 1257 (Windows Baltic), as well as characters from DOS code page 437.
It does not cover the combining diacritics used by Vietnamese-related code page 1258, the Thai letters used in code page 874, Hebrew and Arabic letters covered by code pages 1255 and 1256, or the ideographic characters used by code pages 932, 936, 949 and 950.
It also does not cover the Romanian letters Ș, ș, Ț, and ț (U+0218–B), which were added to several of Microsoft's fonts for Windows Vista (long after the WGL4 repertoire was originally defined).
In version 1.5 of the OpenType Specification (May 2008) four Cyrillic characters were added to the WGL4 character set: Ѐ (U+0400), Ѝ (U+040D), ѐ (U+0450) and ѝ (U+045D).
Character table
Legend
See also
Adobe Glyph List
World Glyph Set (W1G)
Multilingual European Subsets MES-1 and MES-2
DIN 91379 Unicode subset for Europe
References
External links
WGL4.0 Character Set on Microsoft Typography
https://www.ibm.com/docs/en/zos/2.3.0?topic=collection-worldtype-fonts
Digital typography
Microsoft Windows multimedia technology
Character encoding
Glyphs
Articles with unsupported PUA characters |
https://en.wikipedia.org/wiki/ASCI%20Blue%20Pacific | ASCI Blue Pacific was a supercomputer installed at the Lawrence Livermore National Laboratory (LLNL) in Livermore, CA at the end of 1998. It was a collaboration between IBM and LLNL.
It was an IBM RS/6000 SP massively parallel processing system. It contained 5,856 PowerPC 604e microprocessors. Its theoretical top performance was 3.9 teraflops.
It was built as a stage of the Accelerated Strategic Computing Initiative (ASCI) started by the U.S. Department of Energy and the National Nuclear Security Administration to build a simulator to replace live nuclear weapon testing following the moratorium on testing started by President George H. W. Bush in 1992 and extended by Bill Clinton in 1993.
External links
One-of-a-kind computers
Lawrence Livermore National Laboratory
IBM supercomputers |
https://en.wikipedia.org/wiki/ASCI%20Blue%20Mountain | ASCI Blue Mountain is a supercomputer installed at the Los Alamos National Laboratory in Los Alamos, New Mexico. It was designed to run simulations for the United States National Nuclear Security Administration's Advanced Simulation and Computing program. The computer was a collaboration between Silicon Graphics Corporation and Los Alamos National Laboratory. It was installed in 1998.
It is a cluster of ccNUMA SGI Origin 2000 systems. It contains 6,144 MIPS R10000 microprocessors in 48,128 processor systems connected by HIPPI in 438 racks. Its theoretical top performance is 3.072 teraflops.
It was built as a stage of the Accelerated Strategic Computing Initiative (ASCI) started by the U.S. Department of Energy and the National Nuclear Security Administration to build a simulator to replace live nuclear weapons testing following the moratorium on testing started by President George H. W. Bush in 1992 and extended by Bill Clinton in 1993. It was unveiled (commissioned) in 1998. In June 1999 it was the world's second fastest computer, and remained among the world's ten fastest computers until November 2001. According to the Los Alamos National Laboratory website, the supercomputer set a world record in May 2000, with the equivalent of 17.8 years of normal computer processing within 72 hours, including 15,000 engineering simulations requiring 10 hours each.
First commissioned in November 1998, the Blue Mountain was decommissioned on Monday, November 8, 2004 at 8 am, and was replaced by the ASCI Q, Lightning, and QSC supercomputers.
References
External links
https://web.archive.org/web/20120925185846/http://www.lanl.gov/orgs/pa/photos/computing.html
http://library.lanl.gov/cgi-bin/getfile?00418752.pdf
MIPS architecture
One-of-a-kind computers
SGI supercomputers |
https://en.wikipedia.org/wiki/Prison%20abolition%20movement | The prison abolition movement is a network of groups and activists that seek to reduce or eliminate prisons and the prison system, and replace them with systems of rehabilitation and education that do not place a focus on punishment and government institutionalization. The prison abolitionist movement is distinct from conventional prison reform, which is the attempt to improve conditions inside prisons.
Some supporters of decarceration and prison abolition also work to end solitary confinement, the death penalty, and the construction of new prisons through non-reformist reform. Others support books-to-prisoner projects and defend the rights of prisoners to have access to information and library services. Some organizations, such as the Anarchist Black Cross, seek total abolishment of the prison system, without any intention to replace it with other government-controlled systems. Many anarchist organizations believe that the best form of justice arises naturally out of social contracts, restorative justice, or transformative justice.
Definition
Scholar Dorothy Roberts takes the prison abolition movement in the United States to endorse three basic theses:
"[T]oday’s carceral punishment system can be traced back to slavery and the racial capitalist regime it relied on and sustained."
"[T]he expanding criminal punishment system functions to oppress black people and other politically marginalized groups in order to maintain a racial capitalist regime."
"[W]e can imagine and build a more humane and democratic society that no longer relies on caging people to meet human needs and solve social problems."
Thus, Roberts situates the theory of prison abolition within an intellectual tradition including scholars such as Cedric Robinson, who developed the concept of racial capitalism, and characterizes the movement as a response to a long history of oppressive treatment of black people in the United States. In Canada, many abolitionists have called Canada's prisons the "new residential schools", which were designed as a cultural genocide of Indigenous people.
Legal scholar Allegra McLeod notes that prison abolition is not merely a negative project of "opening … prison doors", but rather "may be understood instead as a gradual project of decarceration, in which radically different legal and institutional regulatory forms supplant criminal law enforcement." Prison abolition, in McLeod's view, involves a positive agenda that reimagines how societies might deal with social problems in the absence of prisons, using techniques such as decriminalization and improved welfare provision.
Like Roberts, McLeod sees the contemporary theory of prison abolition as linked to theories regarding the abolition of slavery. McLeod notes that W. E. B. Du Bois—particularly in his Black Reconstruction in America—saw abolitionism not only as a movement to end the legal institution of property in human beings, but also as a means of bringing about a "different future" wherei |
https://en.wikipedia.org/wiki/G-code | G-code (also RS-274) is the most widely used computer numerical control (CNC) and 3D printing programming language. It is used mainly in computer-aided manufacturing to control automated machine tools, as well as for 3D-printer slicer applications. The G stands for geometry. G-code has many variants.
G-code instructions are provided to a machine controller (industrial computer) that tells the motors where to move, how fast to move, and what path to follow. The two most common situations are that, within a machine tool such as a lathe or mill, a cutting tool is moved according to these instructions through a toolpath cutting away material to leave only the finished workpiece and/or an unfinished workpiece is precisely positioned in any of up to nine axes around the three dimensions relative to a toolpath and, either or both can move relative to each other. The same concept also extends to noncutting tools such as forming or burnishing tools, photoplotting, additive methods such as 3D printing, and measuring instruments.
History
The first implementation of a numerical control programming language was developed at the MIT Servomechanisms Laboratory in the 1950s. In the decades that followed, many implementations were developed by numerous organizations, both commercial and noncommercial. Elements of G-code had often been used in these implementations. The first standardized version of G-code used in the United States, RS-274, was published in 1963 by the Electronic Industries Alliance (EIA; then known as Electronic Industries Association). In 1974, EIA approved RS-274-C, which merged RS-273 (variable block for positioning and straight cut) and RS-274-B (variable block for contouring and contouring/positioning). A final revision of RS-274 was approved in 1979, as RS-274-D. In other countries, the standard ISO 6983 (finalized in 1982) is often used, but many European countries use other standards. For example, DIN 66025 is used in Germany, and PN-73M-55256 and PN-93/M-55251 were formerly used in Poland.
During the 1970s through 1990s, many CNC machine tool builders attempted to overcome compatibility difficulties by standardizing on machine tool controllers built by Fanuc. Siemens was another market dominator in CNC controls, especially in Europe. In the 2010s, controller differences and incompatibility are not as troublesome because machining operations are usually developed with CAD/CAM applications that can output the appropriate G-code for a specific machine through a software tool called a post-processor (sometimes shortened to just a "post").
Syntax
G-code began as a limited language that lacked constructs such as loops, conditional operators, and programmer-declared variables with natural-word-including names (or the expressions in which to use them). It was unable to encode logic but was just a way to "connect the dots" where the programmer figured out many of the dots' locations longhand. The latest implementations of G-code include |
https://en.wikipedia.org/wiki/Ejabberd | ejabberd is an Extensible Messaging and Presence Protocol (XMPP) application server and an MQ Telemetry Transport (MQTT) broker, written mainly in the Erlang programming language. It can run under several Unix-like operating systems such as macOS, Linux, FreeBSD, NetBSD, OpenBSD and OpenSolaris. Additionally, ejabberd can run under Microsoft Windows. The name ejabberd stands for Erlang Jabber Daemon (Jabber being a former name for XMPP) and is written in lowercase only, as is common for daemon software.
ejabberd is free software, distributed under the terms of the GNU GPL-2.0-or-later. , it is one of the most popular open source applications written in Erlang. XMPP: The Definitive Guide (O'Reilly Media, 2009) praised ejabberd for its scalability and clustering feature, at the same time pointing out that being written in Erlang is a potential acceptance issue for users and contributors. The software's creator, Alexey Shchepin was awarded the Erlang User of the Year award at the 2006 Erlang user conference.
ejabberd has a number of notable deployments, IETF Groupchat Service, BBC Radio LiveText, Nokia's Ovi, KDE Talk and one in development at Facebook. ejabberd is the most popular server among smaller XMPP-powered sites that register on xmpp.org.
With the next major release after version 2 (previously called ejabberd 3), the versioning scheme was changed to reflect release dates as "Year.Month-Revision" (starting with 13.04-beta1). It was also announced that further development will be split into an "ejabberd Community Server" and an "ejabberd Commercial Edition [which] targets carriers, websites, service providers, large corporations, universities, game companies, that need high level of commitment from ProcessOne, stability and performance and a unique set of features to run their business successfully."
Project history
Alexey Shchepin started ejabberd in November 2002 for three main reasons: success with Tkabber (his previous project, an XMPP client), a rather unstable first alpha release of jabberd2, and his wish to play with Erlang features. Shchepin has stated that he would have not started ejabberd without Erlang. Ejabberd hit version 1.0 in December 2005.
Features
ejabberd has a high level of compliance with XMPP. It provides a web interface which can be translated into other languages. ejabberd supports distributed computing by clustering, supports live upgrades, shared roster groups and provides support for virtual hosts. Database management systems supported include PostgreSQL and MySQL, and ODBC is supported for connectivity to other systems. LDAP authentication is supported, as is login via SSL/TLS, SASL and STARTTLS.
ejabberd is extensible via modules, which can provide support for additional capabilities such as saving offline messages, connecting with IRC channels, or a user database which makes use of user's vCards (saving vCards in LDAP or an ODBC compatible database is possible with other modules). In addition, modules |
https://en.wikipedia.org/wiki/OCP | OCP may refer to:
Computer-related
Open/closed principle
Open Compute Project, open-source hardware design for scale-out data centers
Open Container Project, application containers for ease of portability
Open Core Protocol
OpenShift Container Platform, an on-premises version of OpenShift from Red Hat
Oracle Certified Professional, a designation of the Oracle Certification Program
Order code processor, the central processing unit in ICL 2900 and other computers
Overcurrent Protection
Oxford Concordance Program
Fiction
Omni Consumer Products, fictional megacorporation in the RoboCop media franchise
Outside Context Problem, a concept in Iain M. Banks's The Culture novels
Organizations
Office Chérifien des Phosphates, national Moroccan phosphates company
Omni Consumer Products (company), manufacturer of products based on fictional movie items
Onchocerciasis Control Programme, a global effort to control the disease Onchocerciasis
Opera Company of Philadelphia
Oregon Catholic Press, the largest English-language publisher of contemporary Catholic liturgical music
Portuguese Chamber Orchestra
Politics and policy
Official Community Plan, in Canada, a comprehensive municipal plan
One-child policy, in the People's Republic of China
Science and technology
Obligatory Contour Principle, a principle of phonological theory
Octacalcium phosphate, a biomineral precursor
Ocular cicatricial pemphigoid or mucous membrane pemphigoid
Open circuit potential, in electrochemistry, an electric potential measured at zero net current
Optimal Control Problem
Oral contraceptive pill, in birth control
Orange Carotenoid Protein, involved in photoprotection against light stress in diverse cyanobacteria
Overall coagulation potential, a parameter of the overall hemostasis potential test
Overcurrent protection in power supply
Other
OCP (film), a performance video project by Mitch Stratten
Ocean Park station, an MTR station in Hong Kong
Ochre Coloured Pottery culture, a Bronze Age culture in the Yamuna-Ganga region of India
Operational Camouflage Pattern, a camouflage pattern used by the U.S. military
Oatmeal Creme Pie, a snack cake produced by Little Debbie consisting of two soft oatmeal cookies with a cream filling
See also
Open Core Protocol International Partnership Association |
https://en.wikipedia.org/wiki/Code%20page%20437 | Code page 437 (CCSID 437) is the character set of the original IBM PC (personal computer). It is also known as CP437, OEM-US, OEM 437, PC-8, or DOS Latin US. The set includes all printable ASCII characters as well as some accented letters (diacritics), Greek letters, icons, and line-drawing symbols. It is sometimes referred to as the "OEM font" or "high ASCII", or as "extended ASCII" (one of many mutually incompatible ASCII extensions).
This character set remains the primary set in the core of any EGA and VGA-compatible graphics card. As such, text shown when a PC reboots, before fonts can be loaded and rendered, is typically rendered using this character set. Many file formats developed at the time of the IBM PC are based on code page 437 as well.
Display adapters
The original IBM PC contained this font as a 9×14 pixels-per-character font stored in the ROM of the IBM Monochrome Display Adapter (MDA) and an 8×8 pixels-per-character font of the Color Graphics Adapter (CGA) cards. The IBM Enhanced Graphics Adapter (EGA) contained an 8×14 pixels-per-character version, and the VGA contained a 9×16 version.
All these display adapters have text modes in which each character cell contains an 8-bit character code point (see details), giving 256 possible values for graphic characters. All 256 codes were assigned a graphical character in ROM, including the codes from 0 to 31 that were reserved in ASCII for non-graphical control characters.
Various Eastern European PCs used different character sets, sometimes user-selectable via jumpers or CMOS setup. These sets were designed to match 437 as much as possible, for instance sharing the code points for many of the line-drawing characters, while still allowing text in a local language to be displayed.
Alt codes
A legacy of code page 437 is the number combinations used in Windows Alt codes. A DOS user could enter a character by holding down the Alt key and entering the character code on the numpad and many users memorized the numbers needed for CP437 (or for the similar CP850). Although Microsoft Windows used different character sets such as CP1252, the original numbers were emulated so users could continue to use them; Microsoft added the ability to type a code from the Windows character set by typing 0 before the digits.
Character set
The following tables show code page 437. Each character is shown with its equivalent Unicode code point (when it is not equal to the character's code). A tooltip, generally available only when one points to the immediate left of the character, shows the Unicode code point name and the decimal Alt code. See also the notes below, as there are multiple equivalent Unicode characters for some code points.
Although the ROM provides a graphic for all 256 different possible 8-bit codes, some APIs will not print some code points, in particular the range 0-31 and the code at 127. Instead, they will interpret them as control characters. For instance, many methods of outputting text |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.