source stringlengths 32 199 | text stringlengths 26 3k |
|---|---|
https://en.wikipedia.org/wiki/List%20of%20cyberpunk%20works | This is a list of works classified as cyberpunk, a subgenre of science fiction. Cyberpunk is characterized by a focus on "high tech and low life" in a near-future setting.
Print media
Novels and novellas
Do Androids Dream of Electric Sheep? (1968) by Philip K. Dick
The Girl Who Was Plugged In (1973) by James Tiptree Jr
True Names (1981) by Vernor Vinge
Ware Tetralogy (1982–2000) by Rudy Rucker
The Sprawl trilogy (Neuromancer (1984), Count Zero (1986), and Mona Lisa Overdrive (1988)) by William Gibson – popularized the concept of cyberspace, exemplifies the genre.
Dr. Adder (1984) by K. W. Jeter
Schismatrix (1985) by Bruce Sterling
Eclipse Trilogy (also known as A Song Called Youth Trilogy) (1985–90) by John Shirley – includes Eclipse (1985), Eclipse Penumbra (1988), and Eclipse Corona (1990)
Hardwired (1986) by Walter Jon Williams
Mindplayers (1987) by Pat Cadigan
The Glass Hammer (1987) by K. W. Jeter
Voice of the Whirlwind (1987) by Walter Jon Williams
When Gravity Fails (1987) by George Alec Effinger – part of the Effinger's Marîd Audran series
Islands in the Net (1988) by Bruce Sterling
A Fire in the Sun (1989) by George Alec Effinger – part of the Effinger's Marîd Audran series
"Solip:System" (1989 novelette released as a standalone book) by Walter Jon Williams
My Cousin, My Gastroenterologist (1990) by Mark Leyner
The Exile Kiss (1991) by George Alec Effinger – part of the Effinger's Marîd Audran series
Synners (1991) by Pat Cadigan
Snow Crash (1992) by Neal Stephenson
The Bridge trilogy (1993–1999) by William Gibson
Heavy Weather (1994) by Bruce Sterling
Trouble and Her Friends (1994) by Melissa Scott
Blade Runner 2: The Edge of Human, Blade Runner 3: Replicant Night, and Blade Runner 4: Eye and Talon (1995–2000) by K. W. Jeter
The Diamond Age (1996) by Neal Stephenson
Holy Fire (1996) by Bruce Sterling
Night Sky Mine (1997) by Melissa Scott
Noir (1998) by K. W. Jeter
Tea from an Empty Cup (1998) by Pat Cadigan
One of Us (1998) by Michael Marshall Smith
Altered Carbon (2002) by Richard Morgan
River of Gods (2004) by Ian McDonald
Accelerando (2005) by Charles Stross
Glasshouse (2006)
Daemon (2006–2010) by Daniel Suarez
Little Brother (2008) by Cory Doctorow
The Mirrored Heavens (2008) by David J. Williams
Ready Player One (2011) by Ernest Cline
Bleeding Edge (2013) by Thomas Pynchon
Blackstar (2013–2015) by Josh Viola
Cash Crash Jubilee (2015) by Eli K.P. William
The Naked World (2017)
Short stories, anthologies, and single-author collections
"Cyberpunk" (1983) by Bruce Bethke
Burning Chrome (1986) by William Gibson
Mirrorshades: The Cyberpunk Anthology (1986) edited by Bruce Sterling
Patterns (1989) by Pat Cadigan
Crystal Express (1989) by Bruce Sterling
Storming the Reality Studio: A Casebook of Cyberpunk & Postmodern Science Fiction (1992) edited by Larry McCaffery (contains both fiction and nonfiction)
Hackers (1996) by Jack Dann & Gardner Dozois
Dragonfire: A Cyberpunk Short Story C |
https://en.wikipedia.org/wiki/Operational%20data%20store | An operational data store (ODS) is used for operational reporting and as a source of data for the enterprise data warehouse (EDW). It is a complementary element to an EDW in a decision support environment, and is used for operational reporting, controls, and decision making, as opposed to the EDW, which is used for tactical and strategic decision support.
An ODS is a database designed to integrate data from multiple sources for additional operations on the data, for reporting, controls and operational decision support. Unlike a production master data store, the data is not passed back to operational systems. It may be passed for further operations and to the data warehouse for reporting.
An ODS should not be confused with an enterprise data hub (EDH). An operational data store will take transactional data from one or more production systems and loosely integrate it, in some respects it is still subject oriented, integrated and time variant, but without the volatility constraints. This integration is mainly achieved through the use of EDW structures and content.
An ODS is not an intrinsic part of an EDH solution, although an EDH may be used to subsume some of the processing performed by an ODS and the EDW. An EDH is a broker of data. An ODS is certainly not.
Because the data originates from multiple sources, the integration often involves cleaning, resolving redundancy and checking against business rules for integrity. An ODS is usually designed to contain low-level or atomic (indivisible) data (such as transactions and prices) with limited history that is captured "real time" or "near real time" as opposed to the much greater volumes of data stored in the data warehouse generally on a less-frequent basis.
General use
The general purpose of an ODS is to integrate data from disparate source systems in a single structure, using data integration technologies like data virtualization, data federation, or extract, transform, and load (ETL). This will allow operational access to the data for operational reporting, master data or reference data management.
An ODS is not a replacement or substitute for a data warehouse or for a data hub but in turn could become a source.
See also
Some examples of ODS architecture patterns can be found in the article Architecture patterns.
Enterprise architecture
Third normal form (3NF)
Further reading
External links
Bill Inmon Information Management article on the five classes of ODS
Data management
Data warehousing
Management cybernetics |
https://en.wikipedia.org/wiki/Oscar%20W.%20Greenberg | Oscar Wallace Greenberg (born February 18, 1932) is an American physicist and professor at University of Maryland College of Computer, Mathematical, and Natural Sciences. In 1964, he posited the existence of quarks that obeyed parastatistics as the fundamental constituents of hadronic particles.
,
Educational background
He received his bachelor's degree from Rutgers University in 1952.
He received his master's degree in 1954 and his doctorate degree in 1957, both from Princeton University.
Professional History
1956 Instructor at Brandeis University.
1957 Air Force Cambridge Research Center, 1st Lieutenant, USAF.
1959 NSF postdoctoral fellow at MIT.
1961 Assistant professor, University of Maryland.
1963 Associate professor, University of Maryland.
Fall, 1964, Member, Institute for Advanced Study.
1964 Proposed the existence of color charge.
1965-66 Visiting Associate professor, Rockefeller University.
1967- Professor, University of Maryland.
1968 Guggenheim Fellowship
1968-69 Visiting Professor, Weizmann Institute of Science and Tel-Aviv University.
2013- Member of Adjunct Faculty, Rockefeller University.
References
External links
Greenberg, Oscar - UMD Physics
21st-century American physicists
United States Air Force officers
University of Maryland, College Park faculty
Living people
1932 births |
https://en.wikipedia.org/wiki/System%20Management%20BIOS | In computing, the System Management BIOS (SMBIOS) specification defines data structures (and access methods) that can be used to read management information produced by the BIOS of a computer. This eliminates the need for the operating system to probe hardware directly to discover what devices are present in the computer. The SMBIOS specification is produced by the Distributed Management Task Force (DMTF), a non-profit standards development organization. The DMTF estimates that two billion client and server systems implement SMBIOS.
The DMTF released the version 3.6.0 of the specification on June 20, 2022.
SMBIOS was originally known as Desktop Management BIOS (DMIBIOS), since it interacted with the Desktop Management Interface (DMI).
History
Version 1 of the Desktop Management BIOS (DMIBIOS) specification was produced by Phoenix Technologies in or before 1996.
Version 2.0 of the Desktop Management BIOS specification was released on March 6, 1996 by American Megatrends (AMI), Award Software, Dell, Intel, Phoenix Technologies, and SystemSoft Corporation. It introduced 16-bit plug-and-play functions used to access the structures from Windows 95.
The last version to be published directly by vendors was 2.3 on August 12, 1998. The authors were American Megatrends, Award Software, Compaq, Dell, Hewlett-Packard, Intel, International Business Machines (IBM), Phoenix Technologies, and SystemSoft Corporation.
Circa 1999, the Distributed Management Task Force (DMTF) took ownership of the specification. The first version published by the DMTF was 2.3.1 on March 16, 1999. At approximately the same time Microsoft started to require that OEMs and BIOS vendors support the interface/data-set in order to have Microsoft certification.
Version 3.0.0, introduced in February 2015, added a 64-bit entry point, which can coexist with the previously defined 32-bit entry point.
Version 3.4.0 was released in August 2020.
Version 3.5.0 was released in September 2021.
Version 3.6.0 was released in June 2022.
Contents
The SMBIOS table consists of an entry point (two types are defined, 32-bit and 64-bit), and a variable number of structures that describe platform components and features. These structures are occasionally referred to as "tables" or "records" in third-party documentation.
Structure types
As of version 3.3.0, the SMBIOS specification defines the following structure types:
Accessing SMBIOS data
The EFI configuration table (EFI_CONFIGURATION_TABLE) contains entries pointing to the SMBIOS 2 and/or SMBIOS 3 tables. There are several ways to access the data, depending on the platform and operating system.
From UEFI
In the UEFI Shell, the command can retrieve and display the SMBIOS data. One can often enter the UEFI shell by entering the system firmware settings, and then selecting the shell as a boot option (as opposed to a DVD drive or hard drive).
From Unix
For Linux, FreeBSD, etc., the dmidecode utility can be used.
From Windows
Microsoft specifi |
https://en.wikipedia.org/wiki/Vaksala%20Runestone | The Vaksala Runestone, designated as U 961 under the Rundata catalog, is a Viking Age memorial runestone that is located close to Vaksala Church, near Uppsala, Sweden.
Description
The Vaksala Runestone is one of the approximately forty runestones made by the successful runemaster Öpir, who signed this inscription and was active in the late eleventh and early twelfth century in Uppland. The inscription is classified as being in runestone style Pr4, which is also known as the Urnes style. This runestone style is characterized by slim and stylized animals that are interwoven into tight patterns. The animal heads are typically seen in profile with slender almond-shaped eyes and upwardly curled appendages on the noses and the necks. The runic inscription states that Ígulfastr arranged and Öpir carved the runestone on the behest of the widow and the daughter of the deceased. Ígulfastr is otherwise known from his signature on inscription U Fv1953;263 in Helenelund. Öpir was known for using loop patterns in his inscriptions, and used a three loop pattern for U 961. Other signed inscriptions where Öpir used a three loop pattern include U 142 in Fällbro, U 210 in Åsta, U 279 in Skälby, U 287 in Vik, U 566 in Vällingsö, U 687 in Sjusta, U 893 in Högby, U 898 in Norby, and U 1106 in Äskelunda.
The Vaksala Runestone was used as building material for the construction of a wall in the churchyard. Many runestones were used in the construction of buildings, roads, and bridges before their historical importance was understood. It has been removed from the wall and placed in its present location in the churchyard.
Of the personal names listed in the runic inscription, Ketilbjǫrn means "Kettle Bear" and Rúnfríðr combines Rún, a word which means "Secret" or "Mystery" and which is related in Old Norse to "rune" and "writing," and Fríðr, which means "Peace." The runic text is missing a possessive pronoun, the word "her" before "husbandman." Öpir is known to have left off pronouns in some of his other inscricriptions, such as U Fv1976;107 at the Uppsala Cathedral, U 984 in Ekeby, and U 993 in Brunnby.
Inscription
A transcription of the runic inscription into roman letters is:
h(u)(l)-a + lit + raisa stain + þina at kitilbiarn ' faþur ' sin + auk runfriþ ' at ' bonta ' auk ihulfastr ' riþ ' in ' ubiʀ
See also
List of runestones
Runic alphabet
References
Runestones in Uppland |
https://en.wikipedia.org/wiki/Oxygen%20%28disambiguation%29 | Oxygen is a chemical element with symbol O and atomic number 8.
Oxygen may also refer to:
Computing
Oxygen XML Editor
Oxygen Games, a defunct video game developer
Oxygen Project, a theme set for KDE Plasma Workspaces
OxygenOS, an Android-based OS for OnePlus smartphones
Film and television
Oxygen (1999 film), an American crime thriller by Richard Shepard
Oxygen: Custom Concert, a 2004 concert film by Ashanti
Oxygen (2009 film), a Russian drama film
Oxygen (2010 film), a Belgian-Dutch film
Oxygen (2017 film), an Indian Telugu action film
Oxygen (2020 film), a Bangladeshi short film
Oxygen (2021 film), a French-language science fiction film
Oxygen (TV channel), an American television network
"Oxygen" (Doctor Who), a television episode
Literature
Oxygen (Miller novel), a 2001 novel by Andrew Miller
Oxygen (Olson and Ingermanson novel), a 2001 novel by John B. Olson and Randall S. Ingermanson
Oxygen (play), a 2001 play by Carl Djerassi and Roald Hoffmann
Oxygen (magazine), a women's magazine published by Outside Inc.
Music
Oxygen Music Works, an Anglo-American record label
Albums
Oxygen (Avalon album), 2001
Oxygen (Baptiste Giabiconi album) or the title song, 2012
Oxygen (Lincoln Brewster album) or the title song, 2014
Oxygen (Varga album), 1996
Oxygen (Wild Orchid album), 1998
Oxygen: Inhale, by Thousand Foot Krutch, or the title song, 2014
Oxygen (Swans EP) or the title song, 2014
Oxygen, an EP by Austin Mahone, 2018
Songs
"Oxygen" (Hadouken! song), 2010
"Oxygen" (Marie Serneholt song), 2006
"Oxygen" (Winona Oak and Robin Schulz song), 2020
"Oxygen", by Bryan Adams from 11, 2008
"Oxygen", by Catfish and the Bottlemen from The Ride, 2016
"Oxygen", by Colbie Caillat from Coco, 2007
"Oxygen", by Crown the Empire from Retrograde, 2016
"Oxygen", by Dirty Heads from Dirty Heads, 2016
"Oxygen", by Elaine Paige from Love Can Do That, 1991
"Oxygen", by Feeder from Echo Park, 2001
"Oxygen", by Hoku from Hoku, 2000
"Oxygen", by Jesse McCartney from Departure, 2008
"Oxygen", by JJ72 from JJ72, 2000
"Oxygen", by Maia Mitchell from the Teen Beach Movie soundtrack, 2013
"Oxygen", by New Found Glory from Coming Home, 2006
"Oxygen", by Oh, Sleeper from Bloodied / Unbowed, 2019
"Oxygen", by Opshop from You Are Here, 2004
"Oxygen", by Soul Asylum from The Silver Lining, 2006
"Oxygen", by Spice Girls from Forever, 2000
"Oxygen", by Steffany Gretzinger from Blackout, 2018
"Oxygen", by Swans from To Be Kind, 2014
"Oxygen", by Twelve Foot Ninja from Outlier, 2016
"Oxygen", by Twice from More & More, 2020
"Oxygen", by Willy Mason from Where the Humans Eat, 2004
"Oxygen", by Zion I from Break a Dawn, 2006
Other uses
Bottled oxygen (climbing), oxygen use in mountaineering
Dioxygen (), an allotrope of oxygen
Oxygen (horse) (1828–1854/1855), a British Thoroughbred racehorse
Oxygen Park, a public park in Education City, Doha, Qatar
Oxygen SpA, an Italian electric scooter company
Oxygen Square, urban square in Chittagong, Banglades |
https://en.wikipedia.org/wiki/SCIgen | SCIgen is a paper generator that uses context-free grammar to randomly generate nonsense in the form of computer science research papers. Its original data source was a collection of computer science papers downloaded from CiteSeer. All elements of the papers are formed, including graphs, diagrams, and citations. Created by scientists at the Massachusetts Institute of Technology, its stated aim is "to maximize amusement, rather than coherence." Originally created in 2005 to expose the lack of scrutiny of submissions to conferences, the generator subsequently became used, primarily by Chinese academics, to create large numbers of fraudulent conference submissions, leading to the retraction of 122 SCIgen generated papers and the creation of detection software to combat its use.
Sample output
Opening abstract of Rooter: A Methodology for the Typical Unification of Access Points and Redundancy:
Prominent results
In 2005, a paper generated by SCIgen, Rooter: A Methodology for the Typical Unification of Access Points and Redundancy, was accepted as a non-reviewed paper to the 2005 World Multiconference on Systemics, Cybernetics and Informatics (WMSCI) and the authors were invited to speak. The authors of SCIgen described their hoax on their website, and it soon received great publicity when picked up by Slashdot. WMSCI withdrew their invitation, but the SCIgen team went anyway, renting space in the hotel separately from the conference and delivering a series of randomly generated talks on their own "track". The organizer of these WMSCI conferences is Professor Nagib Callaos. From 2000 until 2005, the WMSCI was also sponsored by the Institute of Electrical and Electronics Engineers. The IEEE stopped granting sponsorship to Callaos from 2006 to 2008.
Submitting the paper was a deliberate attempt to embarrass WMSCI, which the authors claim accepts low-quality papers and sends unsolicited requests for submissions in bulk to academics. As the SCIgen website states:
Computing writer Stan Kelly-Bootle noted in ACM Queue that many sentences in the "Rooter" paper were individually plausible, which he regarded as posing a problem for automated detection of hoax articles. He suggested that even human readers might be taken in by the effective use of jargon ("The pun on root/router is par for MIT-graduate humor, and at least one occurrence of methodology is mandatory") and attribute the paper's apparent incoherence to their own limited knowledge. His conclusion was that "a reliable gibberish filter requires a careful holistic review by several peer domain experts".
Schlangemann
The pseudonym "Herbert Schlangemann" was used to publish fake scientific articles in international conferences that claimed to practice peer review. The name is taken from the Swedish short film Der Schlangemann.
In 2008, in response to a series of Call-for-Paper e-mails, SCIgen was used to generate a false scientific paper titled Towards the Simulation of E-Commerce, using "Herbert |
https://en.wikipedia.org/wiki/LED%20%28disambiguation%29 | A LED is a light-emitting diode. (light source)
LED or Led may also refer to:
LED (editor), a programmers' editor by Norsk Data
Led (river), a river in northern Russia
L.E.D., former stage name of Skydiver Elley Duhé
Ledbury railway station's National Rail station code
Local economic development, an approach to development, particularly in the Third World
Pulkovo Airport's IATA airport code in St. Petersburg (former Leningrad), Russia
Leading edge devices on aircraft
Forbes Magazine article about the war in the Middle East
See also
L. Ed., an unofficial reporter of Supreme Court of the US opinions
Lead, a chemical element
LED lamp or LED light bulb
Led Zeppelin, an English rock band |
https://en.wikipedia.org/wiki/Chris%20Lamprecht | Chris Lamprecht (known as MinorThreat or mthreat) is an American software developer based in Texas. Lamprecht was the original author of ToneLoc, a wardialing program written in the C programming language for the DOS operating system. He was the first employee and lead software architect for indeed.com, a metasearch engine for job listings.
Lamprecht is regarded as the first person to be banned from accessing the Internet, in 1995. After being sentenced to 70 months in prison for money laundering, Lamprecht was also given a punishment of no access to the Internet until 2004.
Christopher Matthew Lamprecht had the Federal Bureau of Prisons ID# 61153-080 and was released on March 3, 2000.
Under the order of Judge Sam Sparks of the US District Court in 1995, Lamprecht was ordered to 70 months in the Federal Correctional Institution, Bastrop. Though a known computer hacker, the 24-year-old was never tried, nor pleaded guilty for computer related crimes, making it the more unusual that he was not allowed to access the Internet. In 1997 Lamprecht co-authored an article in Phrack Magazine issue #52 while incarcerated in a federal penitentiary, and the issue was published in 1998 with portions appearing in 2600 Magazine; and "prophiled" in Phrack issue #46 (1994).
In 2002 Judge Sam Sparks released Lamprecht from his term of supervised release, effectively lifting his Internet ban as well.
Lamprecht authored the computer wardialer program ToneLoc in the 1990s. After losing the original source code, it was re-written with the assistance of Mucho Maas. Lamprecht presented a talk detailing ToneLoc in 1993 at the SummerCon conference.
Lamprecht founded and worked for Searchify, a startup company offering an Internet hosting service for searches, marketed with a software as a service, which is based upon the open source software IndexTank. IndexTank was acquired by LinkedIn and open sourced in 2011.
References
Further reading
Twice Removed: Locked Up and Barred from Net
Banned from the Internet (Swing Magazine, March 1997)
The Crime of Punishment Brian Martin – (attrition.org)
The Government's Catch: Minor Threat (1998) via Wayback Machine)
Drag.net Carol Flake (Texas Monthly January 1996)
The Last Days of the Wild, Wired West, Jeff Koyen. New York Press (1996)
Computer Underground Digest, Issue 87, Jim Thomas, Gordon Meyer. 10 Dec. 1996 ()
External links
Chris Lamprecht's personal home page
Interview with Lamprecht, ToneLoc's author, part of BBS: The Documentary
American white-collar criminals
American computer criminals
Living people
American money launderers
Place of birth missing (living people)
Year of birth missing (living people) |
https://en.wikipedia.org/wiki/Cult%20of%20the%20Dead%20Cow | Cult of the Dead Cow, also known as cDc or cDc Communications, is a computer hacker and DIY media organization founded in 1984 in Lubbock, Texas. The group maintains a weblog on its site, also titled "Cult of the Dead Cow". New media are released first through the blog, which also features thoughts and opinions of the group's members.
Timeline
The group was formed in June 1984 at the Farm Pac slaughterhouse by Grandmaster Ratte' (aka Swamp Ratte'), Franken Gibe, Sid Vicious, and three BBS SysOps.
In the 1980s the Cult of the Dead Cow organized and maintained a loose collective of affiliated BBSs across the US and Canada. It was during this time that the cDc is credited with coining the term "31337" as an alternative spelling of "Eleet" or "Elite", an expression denoting skill or greatness in a person, place, or thing.
In December 1990, cDc member Drunkfux – the pseudonym of Jesse Dryden, the son of Jefferson Airplane drummer Spencer Dryden and grand nephew of Charlie Chaplin – gave birth to the modern hacker con. HoHoCon, usually held in Houston, Texas, was the first hacker conference which invited the participation of both journalists and law enforcement. In all, dFx hosted five annual HoHoCons.
In 1991, cDc was named "Sassiest Underground Computer Group" by Sassy magazine. Also in 1991, the group began distributing music in the form of cassette tape albums sold through its post office box. Many of these albums are now available online in their entirety.
October 1994 saw the creation of the cDc's Usenet newsgroup, alt.fan.cult-dead-cow. It was thus the first hacking group to have its own Usenet newsgroup. In November of that year, the group claimed responsibility for giving Ronald Reagan Alzheimer's disease, claiming to have done so in 1986 with a blowgun.
The cDc declared war on the Church of Scientology in 1995 during the alt.religion.scientology controversy, stating
In 1997, the cDc began distributing original MP3-format music on its website.
In August 1998, they presented their popular Back Orifice tool at DEF CON 6.
In February 2000, the cDc was the subject of an 11-minute documentary short titled "Disinformation". Also in February 2000, cDc member Mudge briefed President Bill Clinton on Internet security.
cDc communications
cDc communications is the parent organisation of Cult of the Dead Cow, one of three groups that fall under cDc communications. The other two are the Ninja Strike Force and Hacktivismo.
Ninja Strike Force
In 1996, the cDc announced the birth of its Ninja Strike Force, a group of "ninja" dedicated to achieving the goals of the cDc, an intervention task force both online and offline. The cDc opened the NSF Dojo in 2004. An "NSF Dojo" Member also operates a streaming radio station, which features recordings of hacker con presentations and other educational programming in addition to a wide range of musical styles and artists.
Membership in the NSF is granted by the cDc to those individuals who stand out in |
https://en.wikipedia.org/wiki/Dungeon%20%28video%20game%29 | Dungeon was one of the earliest role-playing video games, running on PDP-10 mainframe computers manufactured by Digital Equipment Corporation.
History
Dungeon was written in either 1975 or 1976 by Don Daglow, then a student at Claremont University Center (since renamed Claremont Graduate University). The game was an unlicensed implementation of the new tabletop role-playing game Dungeons & Dragons (D&D) and described the movements of a multi-player party through a monster-inhabited dungeon. Players chose what actions to take in combat and where to move each character in the party, which made the game very slow to play by today's standards. Characters earned experience points and gained skills as their "level" grew, as in D&D, and most of the basic tenets of D&D were reflected.
Daglow wrote in 1988, "In the mid-seventies I had a fully functioning fantasy role-playing game on the PDP-10, with both ranged and melee combat, lines of sight, auto-mapping and NPC's with discrete AI." Although the game was nominally played entirely in text, it was also the first game to employ line of sight graphics displays. Its use of computer graphics consisted of top-down dungeon maps that showed the portions of the playfield the party had seen, allowing for light or darkness, the different "infravision" abilities of elves, dwarves, etc.
This advancement was possible because many university computer terminals had switched by the mid-1970s to CRT screens, which could be refreshed with text in a few seconds instead of a minute or more. Earlier games printed game status for the player on Teletype machines or a line printer, at speeds ranging from 10 to 30 characters per second.
While Dungeon was widely available via DECUS, it was picked up by fewer universities and systems in the mid-1970s than Daglow's earlier Star Trek video game had been in 1971, primarily because it took a then-significant 36K of system RAM versus 32K for Star Trek. Many schools viewed games as gimmicks to interest students in computers, but wanted only small, fast-play examples to minimize games' actual use to reserve time for math and science research and student use. As a result, the early-1970s' maximum size of 32K that many schools set as a limit on games had been downgraded on some campuses to as little as 16K.
Years later (ca. 1980) DECUS distributed another game named Dungeon, that was in fact a version of Zork, a text adventure game that would later become the model for early MUDs.
A third game called Dungeon was released on PLATO in 1975, by John Daleske, Gary Fritz, Jan Good, Bill Gammel, and Mark Nakada.
References
External links
The History of Computer Role-Playing Games Part 1: The Early Years (1980-1983)
1975 video games
Cooperative video games
Dungeons & Dragons video games
Mainframe games
Role-playing video games
Video games developed in the United States
Video games with textual graphics |
https://en.wikipedia.org/wiki/Acid2 | Acid2 is a webpage that test web browsers' functionality in displaying aspects of HTML markup, CSS 2.1 styling, PNG images, and data URIs. The test page was released on 13 April 2005 by the Web Standards Project. The Acid2 test page will be displayed correctly in any application that follows the World Wide Web Consortium and Internet Engineering Task Force specifications for these technologies. These specifications are known as web standards because they describe how technologies used on the web are expected to function.
The Acid2 tests rendering flaws in web browsers and other applications that render HTML. Named after the acid test for gold, it was developed in the spirit of Acid1, a relatively narrow test of compliance with the Cascading Style Sheets 1.0 (CSS1) standard. As with Acid1, an application passes the test if the way it displays the test page matches a reference image.
Acid2 was designed with Microsoft Internet Explorer particularly in mind. The creators of Acid2 were dismayed that Internet Explorer did not follow web standards. It was prone to display web pages differently from other browsers, causing web developers to spend time tweaking their web pages. Acid2 challenged Microsoft to make Internet Explorer comply with web standards. On 31 October 2005, Safari 2.0.2 became the first browser to pass Acid2. Opera, Konqueror, Firefox, and others followed. With the release of Internet Explorer 8 on 19 March 2009, the latest versions of all major desktop web browsers now pass the test. Acid2 was followed by Acid3.
History
Acid2 was first proposed by Håkon Wium Lie, chief technical officer of Opera Software and creator of the widely used Cascading Style Sheets web standard. In a 16 March 2005 article on CNET, Lie expressed dismay that Microsoft Internet Explorer did not properly support web standards and hence was not completely interoperable with other browsers. He announced that Acid2 would be a challenge to Microsoft to design Internet Explorer 7, then in development, to achieve a greater degree of standards compliance than previous versions of Internet Explorer. The original Acid1 test had forced browser makers to fix their applications or face embarrassment; Lie hoped that Acid2 would do the same.
Lie and a colleague, Ian Hickson, created the first draft of the test in February 2005. Ian Hickson coded the final test in collaboration with the Web Standards Project and the larger web community. It was officially released on 13 April 2005 and at that time, every web browser failed it spectacularly.
On 23 April 2005, Acid2 was updated to fix a bug that made the mouth appear too close to the nose. After several complaints, the test was again updated in January 2006 to remove a test for unpopular SGML-style comments that were never widely implemented. In browsers that do not implement SGML-style comments, the original test displayed the word "ERROR" on the bottom part of the face.
In March 2008, Ian Hickson released Acid3 as a follo |
https://en.wikipedia.org/wiki/Degree%20of%20parallelism | The degree of parallelism (DOP) is a metric which indicates how many operations can be or are being simultaneously executed by a computer. It is used as an indicator of the complexity of algorithms, and is especially useful for describing the performance of parallel programs and multi-processor systems.
A program running on a parallel computer may utilize different numbers of processors at different times. For each time period, the number of processors used to execute a program is defined as the degree of parallelism. The plot of the DOP as a function of time for a given program is called the parallelism profile.
See also
Optical Multi-Tree with Shuffle Exchange
References
Instruction processing
Parallel computing |
https://en.wikipedia.org/wiki/Skeleton%20%28disambiguation%29 | A skeleton is a biological system providing support in a living organism.
Skeleton or skeletons may also refer to:
Science and computers
Human skeleton, human anatomy
Skeletonization (forensics), refers to the complete decomposition of the non-bony tissues of a corpse, leading to a bare skeleton
n-skeleton, the subcomplex of a simplicial complex or CW complex consisting of all faces of or below a certain dimension
Skeleton (category theory), in mathematics, every category has a skeleton in which no two distinct objects are isomorphic
Skeleton (computer programming), a style of computer programming
Algorithmic skeleton, a style of parallel programming based on simple high-level patterns
Skeletal animation, a computer technique used to animate 3D characters
Topological skeleton, a digital image processing technique used to detect objects and regions within images
Morphological skeleton in digital image processing
Class skeleton, an outline of a class used in software engineering
Skeletal formula, in chemistry, the skeletal structure or skeleton of a molecule
Straight skeleton, in geometry, is a method of representing a polygon
Skeletonizer (disambiguation), a common name for several species of moth
Music
Skeletons (band), an American indie rock group
Albums
Skeleton (Abe Vigoda album) or the title song, 2008
Skeleton (Figurines album), 2005
Skeletons (Danzig album), 2015
Skeletons (Hawthorne Heights album), 2010
Skeletons (Nothingface album), 2003
Skeletons (Sirens and Sailors album) or the title song, 2013
Skeletons (Wednesday 13 album) or the title song, 2008
Skeletons, by Brothers Osborne, 2020
Skeletons, by Seven Story Drop, 2008
Skeletons, by Pop Evil, 2023
Songs
"Skeleton" (song), by Donghae & Eunhyuk, 2014
"Skeletons" (Dihaj song), representing Azerbaijan at Eurovision 2017
"Skeletons" (Stevie Wonder song), 1987
"Skeletons" (Yeah Yeah Yeahs song), 2010
"Skeleton", by Bloc Party from Little Thoughts, 2004
"The Skeleton", by Quasi from Field Studies, 1999
"Skeletons", by James Arthur from Back from the Edge, 2016
"Skeletons", by Travis Scott from Astroworld, 2018
"Skeletons", by Tulisa from The Female Boss, 2012
Televisions and films
"Skeletons" (CSI: Miami), an episode from season 4 of the American crime drama CSI: Miami
"Skeletons", an episode of the fourth season of NCIS
"The Skeleton", a 1979 episode of the TV sitcom The Ropers
Skeletons (film), a 2010 film by Nick Whitfield
Skeletons (1997 film), a television film by David DeCoteau
The Skeleton, a fictional character from the novel Something Wicked This Way Comes
Games
Skeleton (sport) (or tobogganing), a fast winter sliding sport
Skeleton (Guitar Hero), a playable character in the Xbox 360 version of the video game Guitar Hero: World Tour
Skeleton (Dungeons & Dragons), an undead creature from the Dungeons & Dragons fantasy roleplaying game
Skeleton+, an Atari 2600 video game in Activision Anthology
Other
Skeleton (undead), in fantasy, an |
https://en.wikipedia.org/wiki/Computerized%20adaptive%20testing | Computerized adaptive testing (CAT) is a form of computer-based test that adapts to the examinee's ability level. For this reason, it has also been called tailored testing. In other words, it is a form of computer-administered test in which the next item or set of items selected to be administered depends on the correctness of the test taker's responses to the most recent items administered.
How it works
CAT successively selects questions for the purpose of maximizing the precision of the exam based on what is known about the examinee from previous questions. From the examinee's perspective, the difficulty of the exam seems to tailor itself to their level of ability. For example, if an examinee performs well on an item of intermediate difficulty, they will then be presented with a more difficult question. Or, if they performed poorly, they would be presented with a simpler question. Compared to static tests that nearly everyone has experienced, with a fixed set of items administered to all examinees, computer-adaptive tests require fewer test items to arrive at equally accurate scores.
The basic computer-adaptive testing method is an iterative algorithm with the following steps:
The pool of available items is searched for the optimal item, based on the current estimate of the examinee's ability
The chosen item is presented to the examinee, who then answers it correctly or incorrectly
The ability estimate is updated, based on all prior answers
Steps 1–3 are repeated until a termination criterion is met
Nothing is known about the examinee prior to the administration of the first item, so the algorithm is generally started by selecting an item of medium, or medium-easy, difficulty as the first item.
As a result of adaptive administration, different examinees receive quite different tests. Although examinees are typically administered different tests, their ability scores are comparable to one another (i.e., as if they had received the same test, as is common in tests designed using classical test theory). The psychometric technology that allows equitable scores to be computed across different sets of items is item response theory (IRT). IRT is also the preferred methodology for selecting optimal items which are typically selected on the basis of information rather than difficulty, per se.
A related methodology called multistage testing (MST) or CAST is used in the Uniform Certified Public Accountant Examination. MST avoids or reduces some of the disadvantages of CAT as described below. See the 2006 special issue of Applied Measurement in Education or Computerized Multistage Testing for more information on MST.
Examples
CAT has existed since the 1970s, and there are now many assessments that utilize it.
Graduate Management Admission Test
MAP test from NWEA
The SAT has announced that it will become multistage-adaptive in 2023
National Council Licensure Examination
Armed Services Vocational Aptitude Battery
Additionally, a list of activ |
https://en.wikipedia.org/wiki/Trustworthy%20computing | The term Trustworthy Computing (TwC) has been applied to computing systems that are inherently secure, available, and reliable. It is particularly associated with the Microsoft initiative of the same name, launched in 2002.
History
Until 1995, there were restrictions on commercial traffic over the Internet.
On, May 26, 1995, Bill Gates sent the "Internet Tidal Wave" memorandum to Microsoft executives assigning "...the Internet this highest level of importance..." but Microsoft's Windows 95 was released without a web browser as Microsoft had not yet developed one. The success of the web had caught them by surprise but by mid 1995, they were testing their own web server, and on August 24, 1995, launched a major online service, MSN.
The National Research Council recognized that the rise of the Internet simultaneously increased societal reliance on computer systems while increasing the vulnerability of such systems to failure and produced an important report in 1999, "Trust in Cyberspace". This report reviews the cost of un-trustworthy systems and identifies actions required for improvement.
Microsoft and Trustworthy Computing
Bill Gates launched Microsoft's "Trustworthy Computing" initiative with a January 15, 2002 memo, referencing an internal whitepaper by Microsoft CTO and Senior Vice President Craig Mundie. The move was reportedly prompted by the fact that they "...had been under fire from some of its larger customers–government agencies, financial companies and others–about the security problems in Windows, issues that were being brought front and center by a series of self-replicating worms and embarrassing attacks." such as Code Red, Nimda, Klez and Slammer.
Four areas were identified as the initiative's key areas: Security, Privacy, Reliability, and Business Integrity, and despite some initial scepticism, at its 10-year anniversary it was generally accepted as having "...made a positive impact on the industry...".
The Trustworthy Computing campaign was the main reason why Easter eggs disappeared from Windows, Office and other Microsoft products.
See also
Security Development Lifecycle
References
External links
Trusted Computing Group
Wave Systems Corp. Managing Trusted Computing Platforms (TPM)
The Age of Corporate Open Source Enlightenment, Paul Ferris, ACM Press
The Controversy over Trusted Computing, Catherine Flick, University of Sydney
Email from Bill Gates to Microsoft Employees, Wired News, January, 2002
Trust in Cyberspace, Committee on Information Systems Trustworthiness
Trustworthy Computing, Microsoft
Trustworthy Computing, Craig Mundie, Microsoft
Computer security
Information technology management
Microsoft initiatives |
https://en.wikipedia.org/wiki/Automatic%20variable |
In computer programming, an automatic variable is a local variable which is allocated and deallocated automatically when program flow enters and leaves the variable's scope. The scope is the lexical context, particularly the function or block in which a variable is defined. Local data is typically (in most languages) invisible outside the function or lexical context where it is defined. Local data is also invisible and inaccessible to a called function, but is not deallocated, coming back in scope as the execution thread returns to the caller.
Automatic local variables primarily applies to recursive lexically-scoped languages. Automatic local variables are normally allocated in the stack frame of the procedure in which they are declared. This was originally done to achieve re-entrancy and allowing recursion, a consideration that still applies today. The concept of automatic variables in recursive (and nested) functions in a lexically scoped language was introduced to the wider audience with ALGOL in the late 1950s, and further popularized by its many descendants.
The term local variable is usually synonymous with automatic variable, since these are the same thing in many programming languages, but local is more general – most local variables are automatic local variables, but static local variables also exist, notably in C. For a static local variable, the allocation is static (the lifetime is the entire program execution), not automatic, but it is only in scope during the execution of the function.
In specific programming languages
C, C++
(Called automatic variables.)
All variables declared within a block of code are automatic by default. An uninitialized automatic variable has an undefined value until it is assigned a valid value of its type. The storage-class specifier auto can be added to these variable declarations as well, but as they are all automatic by default this is entirely redundant and rarely done.
In C, using the storage class register is a hint to the compiler to cache the variable in a processor register. Other than not allowing the address-of operator (&) to be used on the variable or any of its subcomponents, the compiler is free to ignore the hint.
In C++, the constructor of automatic variables is called when the execution reaches the place of declaration. The destructor is called when it reaches the end of the given program block (program blocks are surrounded by curly brackets). This feature is often used to manage resource allocation and deallocation, like opening and then automatically closing files or freeing up memory. See Resource Acquisition Is Initialization (RAII).
Since C++11, C++ allows variables to be declared with the auto type specifier, but this means that the variable's type is inferred, and does not refer to the scope of the variable.
Java
(Called local variables.)
Similar to C and C++, but there is no auto or register keyword. However, the Java compiler will not allow the usage of a not-expli |
https://en.wikipedia.org/wiki/Shmuel%20Winograd |
Shmuel Winograd (; January 4, 1936 – March 25, 2019) was an Israeli-American computer scientist, noted for his contributions to computational complexity. He has proved several major results regarding the computational aspects of arithmetic; his contributions include the Coppersmith–Winograd algorithm and an algorithm for the fast Fourier transform which transforms it into a problem of computing convolutions which can be solved with another Winograd's algorithm.
Winograd studied Electrical Engineering at the Massachusetts Institute of Technology, receiving his B.S. and M.S. degrees in 1959. He received his Ph.D. from the Courant Institute of Mathematical Sciences at New York University in 1968. He joined the research staff at IBM in 1961, eventually becoming director of the Mathematical Sciences Department there from 1970 to 1974 and 1980 to 1994.
Honors
IBM Fellow (1972)
Fellow of the Institute of Electrical and Electronics Engineers (1974)
W. Wallace McDowell Award (1974)
Member, National Academy of Sciences (1978)
Member, American Academy of Arts and Sciences (1983)
Member, American Philosophical Society (1989)
Fellow of the Association for Computing Machinery (1994)
Books
References
1936 births
2019 deaths
Theoretical computer scientists
Fellows of the Association for Computing Machinery
Fellow Members of the IEEE
Fellows of the Society for Industrial and Applied Mathematics
Members of the United States National Academy of Sciences
IBM Research computer scientists
IBM employees
IBM Fellows
Courant Institute of Mathematical Sciences alumni
MIT School of Engineering alumni
Members of the American Philosophical Society |
https://en.wikipedia.org/wiki/Hegira%20%28novel%29 | Hegira is a 1979 science fiction novel by American writer Greg Bear. It deals with themes including cyclic time, artificial intelligence, artificial life, and artificial structures of planetary scale.
Plot summary
In the novel, "young" humans (recreations of the medieval originals) are transported through the Big Collapse, at the end of time, to seed the next cycle of the universe. They are transported to Hegira, an artificial environment of the scale of the planet Jupiter, which has habitats for several species on its surface. The habitats are protected and uncoupled from the universe's entropy by means of force fields projected by giant obelisks. In the human realm, these are inscribed with the recorded history of humankind, sorted chronologically from the bottom up, including the science that went with it. People try to understand and copy what they can read on the obelisks, using balloons in some places to reach higher points on the obelisks.
A legend tells the protagonist that his beloved (frozen in stasis) will awaken if he goes on quest to the rim walls of the habitat, and he does so. On the way, he lands on an island with a good view of an obelisk (at least high) which is just tumbling down in the distance. Its fall causes a tsunami and devastates a continent. After the devastation, the inscriptions at the top of the fallen obelisk about human history are revealed. The hero's quest to the rim succeeds. He makes contact with an artificial intelligence guardian of Hegira, who tells him the story and advises him to go and populate the new universe since he has become part of the last one.
Reviews
Review by Scott Edelman (1979) in Science Fiction & Fantasy Book Review, July 1979
Review by Richard E. Geis (1979) in Science Fiction Review, August 1979
Review by Michael Bishop (1980) in The Magazine of Fantasy & Science Fiction, January 1980
Review by David Langford [as by Dave Langford] (1980) in Foundation, #18 January 1980
Review by Orson Scott Card (1980) in Destinies, February-March 1980
Review [German] by uncredited (1982) in Reclams Science Fiction Führer
Review [German] by Michael Nagula [as by Maik] (1983) in Perry Rhodan, #291: Brücke zwischen den Sternen?
Review by David Wingrove (1987) in Vector 139
Review by Paul Kincaid (1988) in Paperback Inferno, #72
Review by uncredited (2000) in Vector 210
References
External links
1979 American novels
1979 science fiction novels
Novels by Greg Bear
Artificial life in fiction
Novels about artificial intelligence
Novels about the end of the universe |
https://en.wikipedia.org/wiki/Mega%20%28Chilean%20TV%20channel%29 | Mega is a Chilean television network owned by Mega Media, a Bethia holding company. It began its transmissions on 23 October 1990 as the first private television network in the country on channel 9 in Santiago, replacing Señal 2 of Televisión Nacional de Chile. The station is a member of the Asociación Nacional de Televisión and Organización de Telecomunicaciónes de Iberoamérica, and is part of the Alianza Informativa Latinoamericana
History
Early years (1990–1992)
The channel began a kind of white march on the night of 23 October 1990, first broadcasting a preview of its programming and then the movie Oliver. Meanwhile, in the courtyards of the channel, the new studios were inaugurated located in the old Cristalerías Chile factory, on Av. Vicuña Mackenna with the presence of President Patricio Aylwin and the owner of the channel, Ricardo Claro.
Its official broadcasts began with coverage only for the Metropolitan Region and Valparaíso at 1:00 p.m. the following day, with the First Edition of Meganoticias hosted by a journalist Susana Horno from the newsroom.
After its premiere, the channel had an initial period of low audiences. The panorama began to change due to a radical programmatic change thanks to the premiere of telenovelas produced by Televisa, which it broadcast constantly until 2016. Likewise, it acquired the broadcast rights of the Chilean National Tournament, the Copa Libertadores de América and the Copa América.
During the first half of the decade, Megavisión expanded its coverage. In the first half of 1991, the signal was extended to Talca, Chillán, Concepción, Temuco and Punta Arenas; at the end of the year, it reached a reception of more than 85% of the Chilean territory.
The mid-90s (1993–1999)
In 1991, Televisa kept 49% of the channel. With this, the development of co-productions was announced, such as the program Siempre en Domingo with Raúl Velasco from Santiago de Chile, as well as La Movida by Verónica Castro; however, Televisa's participation dropped to 33% in 1997, and in 1999 ownership of the channel would return entirely to Grupo Claro.
In March 1992, the programs Happening with ja, Good Afternoon, Eli with Eliana de Caso, and Accompáñeme with Julio Videla were integrated into the programming. Also, the Peruvian program Nubeluz is successfully released in the mornings. Initially, the episodes broadcast by Nubeluz were recorded, but over time they began to be broadcast live from Peru.
In 1993, Megavisión together with Televisa obtained the concession to produce and broadcast the Viña del Mar International Song Festival, work that until then was carried out by Televisión Nacional de Chile; its animator, Antonio Vodanovic, emigrated to the channel to assume its conduction. That year, Mega also broadcast the Copa América played in Ecuador.
The version of the Viña Festival in 1994 was the first under the alliance with Televisa: the Mexican network acted as co-producer and intermediary to get figures such as th |
https://en.wikipedia.org/wiki/Generic%20Mapping%20Tools | Generic Mapping Tools (GMT) are an open-source collection of computer software tools for processing and displaying xy and xyz datasets, including rasterization, filtering and other image processing operations, and various kinds of map projections. The software stores 2-D grids as COARDS-compliant netCDF files and comes with a comprehensive collection of free GIS data, such as coast lines, rivers, political borders and coordinates of other geographic objects. Users convert further data (like satellite imagery and digital elevation models) from other sources and import them. GMT stores the resulting maps and diagrams in PostScript (PS) or Encapsulated PostScript (EPS) format.
Users operate the system from the command line: this enables scripting and the automation of routine tasks. More or less comprehensive graphic user interfaces are available from third parties, as well as web applications, bringing the system's functionality online.
Paul Wessel and Walter H. F. Smith created GMT in 1988 at Lamont–Doherty Earth Observatory, officially releasing it on October 7, 1991 under the GNU General Public License. The letters GMT originally stood for Gravity, Magnetism and Topography, the three basic types of geophysical data. Besides its strong support for the visualization of geographic data sets, the software includes tools for processing and manipulating multi-dimensional datasets. GMT is most widely used by Earth and Ocean scientists.
References
External links
Interactive online map generation using GMT.
Some examples.
iGMT is a graphical front-end for GMT.
Information on how to use OpenStreetMap data within GMT.
Database-related software for Linux
Earth sciences graphics software
Free GIS software
Graphics-related software for Linux
Plotting software
1991 software
GIS software |
https://en.wikipedia.org/wiki/SONIC%20%28Ethernet%20controller%29 | SONIC (System-Oriented Network Interface Controller) DP83932 is a National Semiconductor 10 Mbit/s Ethernet controller. In the early 1990s, integrated ethernet subsystems based on the SONIC controller were used in computer workstations such as the MIPS Magnum family and the Olivetti M700, inter alia.
External links
SONIC documentation
Networking hardware |
https://en.wikipedia.org/wiki/Project64 | Project64 is a free and open-source Nintendo 64 emulator written in the programming languages C and C++ for Microsoft Windows. This software uses a plug-in system allowing third-party groups to use their own plug-ins to implement specific components. Project64 can play Nintendo 64 games on a computer reading ROM images, either dumped from the read-only memory of a Nintendo 64 ROM cartridge or created directly on the computer as homebrew.
Project64 is considered one of the top performing emulators used today and the most popular Nintendo 64 emulator. The program is licensed under the GNU General Public License version 2.
Compatibility and features
Project64 is considered a highly compatible emulator which does not require the use of a Basic Input/Output System (BIOS). The emulator has basic features, supports multiplayer, and allows alternating the aspect ratio without cropping or quality drop.
Development history
Development of Project64 began in March 1998 with a small team consisting of Zilmar and others. In September 1999, Zilmar was introduced to Jabo, who was developing an N64 Emulator of his own. In December 1999, Jabo was invited to join Zilmar on a collaborative effort for Project64. Jabo initially did not intend on being the RDP/Graphics developer, having a greater interest in assembly language and the central processing unit (CPU) but found himself often working on the graphics aspects.
The authors have released certain parts of the source code for the now unsupported version 1.4. Project64k is a modified version of Project64 1.4 which provides multiplayer netplay abilities via integrating the Kaillera networking client. Players are able to join servers where multiple games may be hosted with other features remaining consistent with Project64 1.4. In July 2011, Jabo decided to stop developing Project64 and released a modified version of 1.6 with some improvements. He also stated that no more releases of the source code were going to happen. However, in April 2013, Zilmar released both Project64 2.0 and an official repository of its source code that was made available on the Project64 website making the software fully open-source and accessible to everyone. It was mentioned that a major part of the code was rewritten in this version. Then about a month later, Project64 2.1 was released. In April 2015, Project64 2.2 was released along with its source code in a GitHub repository. From May 2015 onwards Project64 2.2 was able to play 64DD disk roms. On August 1, 2016, Project64 version 2.3 was released, eventually being updated to version 2.3.2 in January 2017. On May 27, 2021, Project64 version 3.0.0 was released to celebrate its 20th anniversary.
Reception
In 2014, PC World praised the emulator for offering more "advanced settings" than Nintendo's official Nintendo 64 emulation available through the Virtual Console, such as the ability to change the game's aspect ratio, but criticized the emulation for being imperfect, describing it |
https://en.wikipedia.org/wiki/Computer%20Misuse%20Act%201990 | The Computer Misuse Act 1990 is an Act of the Parliament of the United Kingdom, introduced partly in response to the decision in R v Gold & Schifreen (1988) 1 AC 1063. Critics of the bill complained that it was introduced hastily, was poorly thought out, and that intention was often difficult to prove, with the bill inadequately differentiating "joyriding" hackers like Gold and Schifreen from serious computer criminals. The Act has nonetheless become a model from which several other countries, including Canada and the Republic of Ireland, have drawn inspiration when subsequently drafting their own information security laws, as it is seen "as a robust and flexible piece of legislation in terms of dealing with cybercrime”. Several amendments have been passed to keep the Act up to date.
R v Gold & Schifreen
Robert Schifreen and Stephen Gold, using conventional home computers and modems in late 1984 and early 1985, gained unauthorised access to British Telecom's Prestel interactive viewdata service. While at a trade show, Schifreen, by doing what latterly became known as shoulder surfing, had observed the password of a Prestel engineer. The engineer's username was 22222222 and the password used was 1234. This later gave rise to accusations that British Telecom (BT) had not taken security seriously. Armed with this information, the pair explored the system, even gaining access to the personal message box of Prince Philip.
Prestel installed monitors on the suspect accounts and passed information thus obtained to the police. The pair were charged under section 1 of the Forgery and Counterfeiting Act 1981 with defrauding BT by manufacturing a "false instrument", namely the internal condition of BT's equipment after it had processed Gold's eavesdropped password. Tried at Southwark Crown Court, they were convicted on specimen charges (five against Schifreen, four against Gold) and fined, respectively, £750 and £600.
Although the fines imposed were modest, they elected to appeal to the Criminal Division of the Court of Appeal. Their counsel cited the lack of evidence showing the two had attempted to obtain material gain from their exploits, and claimed that the Forgery and Counterfeiting Act had been misapplied to their conduct. They were acquitted by the Lord Justice Lane, but the prosecution appealed to the House of Lords. In 1988, the Lords upheld the acquittal. Lord Justice Brandon said:
The Law Lords' ruling led many legal scholars to believe that hacking was not unlawful as the law then stood. The English Law Commission and its counterpart in Scotland both considered the matter. The Scottish Law Commission concluded that intrusion was adequately covered in Scotland under the common law related to deception, but the English Law Commission believed a new law was necessary.
Since the case, both defendants have written extensively about IT matters. Gold, who detailed the entire case at some length in The Hacker's Handbook, has presented at conference |
https://en.wikipedia.org/wiki/Radio-paging%20code%20No.%201 | Radio-paging code No. 1 (usually and hereafter called POCSAG) is an asynchronous protocol used to transmit data to pagers. Its usual designation is an acronym of the Post Office Code Standardisation Advisory Group, the name of the group that developed the code under the chairmanship of the British Post Office that used to operate most telecommunications in Britain before privatization.
Before the development and adoption of the POCSAG code, pagers used one of several codes such as GOLAY.
In the 1990s new paging codes were developed that offered higher data transmission rates and other advanced features such as European and Network roaming.
The POCSAG code is generally transmitted at one of three data rates; 512, 1200 or 2400 bits per second.
With Super-POCSAG, 1200 bits per second or 2400 bits per second transmission rates are possible. Super-POCSAG has mostly displaced the POCSAG in the developed world but the transition is still in progress.
The History of POCSAG
In 1976 an international group of engineers began to meet to explore the possibility of developing a new code for wide area paging; paging networks covering regions of entire countries. These meetings were successful and in February 1981 the CCIR (Comité consultatif international pour la radio) the forerunner of the ITU-R accepted the code as Radiopaging Code No.1 (RPC No.1),(Rec, 584). The meetings were chaired by R.H.Tridgell and were attended by representatives of British, European, and Japanese pager manufacturers
How it works
The modulation used is FSK with a ±4.5 kHz shift on the carrier. The high frequency represents a 0 and the low frequency a 1.
The ±4.5 kHz frequency shift is used along with a 25 kHz channel spacing, known as "wideband". Some jurisdictions require that all systems move to a "narrowband" configuration, using 12.5 kHz channels and ±2.5 kHz frequency shifts (for example, the U.S. Federal Communications Commission (FCC) has mandated this transition be completed prior to 2013.)
Often single transmission channels contain blocks of data at more than one of the rates.
Transmission uses 32-bit blocks called codewords. Each codeword carries 21 bits of information (bits 31 through 11), 10 bits of error-correcting code (bits 10 through 1), and an even parity bit (bit 0). Bits 31 through 1 are a binary BCH code (31, 21). The error-correcting code has a 6-bit Hamming distance: each 31-bit codeword differs from every other codeword in at least 6 bits. Consequently, the code can detect and correct up to 2 errors in a codeword.
The generating polynomial for the BCH (31, 21) code is:
The codewords are either address or data, which is indicated by the first bit transmitted, bit 31. An address codeword contains 18 bits of address (bit 30 through to 13), and 2 function bits (12 & 11). Each data codeword carries 20 bits of data (bits 30 through to 11).
Codewords are transmitted in batches that consist of a sync codeword, defined in the standard as 0x7CD215D8, f |
https://en.wikipedia.org/wiki/KVOS-TV | KVOS-TV (channel 12) is a television station in Bellingham, Washington, United States, broadcasting the digital multicast network Heroes & Icons. It is owned and operated by Weigel Broadcasting alongside Seattle-licensed MeTV station KFFV, channel 44 (which KVOS simulcasts on its third digital subchannel). While KVOS-TV is nominally part of the Seattle–Tacoma market, it can be characterized as a border blaster, as it primarily serves an audience in southwestern British Columbia, Canada, including Vancouver and Victoria.
KVOS-TV's transmitter is situated atop Mount Constitution on Orcas Island in the San Juan Islands, at an altitude of above the adjacent terrain. The station's signal is very well received throughout the British Columbia Lower Mainland, southern Vancouver Island, and much of northwest Washington. KVOS-TV original studios were located on Ellis Street in Bellingham. However, with the sale of KVOS-TV to OTA Broadcasting in 2010, the Bellingham facility was closed and the station currently shares studios with KFFV on Third Avenue South in Seattle. KVOS-TV previously maintained offices in Burnaby, British Columbia; before that, its Vancouver offices were located on West 7th Avenue; it now has no physical presence in the Vancouver area.
As KVOS serves both sides of the border, at one time the station decided to use both Canadian and American TV ratings at the start of each program, after they were established during the late 1990s— it was the only station on either side of the border to do so. Since early 2007, only U.S. ratings have been shown.
History
Early years
KVOS signed on June 3, 1953; owned by Bellingham businessman Rogan Jones along with KVOS radio (AM 790, now KGMI). Jones had owned the radio station since 1928, and was best known for being the focus of a case that established broadcasters' right to the same news reports as newspapers. Its first broadcast was a kinescope of Queen Elizabeth II's coronation. Since Canada had no television stations operating west of Ontario at that point (it wasn't until that December that Vancouver would get a locally-operated TV station of their own in CBC outlet CBUT), the British government flew film of the BBC's coverage to Vancouver, where the Mounties escorted it to the border. The Washington State Patrol then drove the film to Bellingham. The station's original slogan was "Your Peace Arch Station, serving Northwest Washington and British Columbia."
KVOS initially experienced financial trouble, despite Jones thinking that he could successfully support a television station in a city the size of Bellingham. He built a powerful transmitter on Orcas Island in hopes of reaching Seattle, but even with increased power, it didn't cover enough of the Seattle area to solve the problem. For a time, the revenues from his radio station were all that kept channel 12 afloat. In 1955, Jones, realizing that most of his audience was across the border, incorporated KVOS in Canada, establishing a subsid |
https://en.wikipedia.org/wiki/PBS%20North%20Carolina | The University of North Carolina Center for Public Media, branded on-air as PBS North Carolina or commonly PBS NC, is a public television network serving the state of North Carolina. It is operated by the University of North Carolina system, which holds the licenses for all but one of the thirteen PBS member television stations licensed in the state—WTVI (channel 42) in Charlotte is owned by Central Piedmont Community College. The broadcast signals of the twelve television stations cover almost all of the state, as well as parts of Georgia, South Carolina, Tennessee, and Virginia. The network's operations are located at the UNC Center for Public Television at Research Triangle Park between Raleigh and Durham.
History
WUNC-TV in Chapel Hill, the state network's flagship station, first signed on the air on January 8, 1955, as the second non-commercial educational television station located south of Washington, D.C.—one day after Cheaha, Alabama–licensed WCIQ-TV. Over the next twelve years, four more satellite stations signed on. WUND-TV in Edenton (originally WUNB-TV, licensed to Columbia) was the first of these satellites to debut on September 10, 1965, followed by the launches of WUNE-TV in Linville, WUNF-TV in Asheville, and WUNG-TV in Concord—all on September 11, 1967, and WUNJ-TV in Wilmington on June 4, 1971. This was supplemented with a network of translator stations in the Appalachian Mountains that also allowed the network's programming to reach across the entire state.
Five additional satellites debuted afterward: WUNK-TV in Greenville in May 1972, WUNL-TV in Winston-Salem in February 1973, WUNM-TV in Jacksonville in November 1982, WUNP-TV in Roanoke Rapids in October 1986, and WUNU-TV in Lumberton in September 1996. The state network's youngest station, WUNW in Canton, signed on in July 2010 to replace a translator that had served the area since the 1980s. The state network was branded on-air as North Carolina Public Television from 1979 to the mid-1990s, when it rebranded itself as University of North Carolina Television. It simplified the brand name to UNC-TV later in the 1990s; it had previously used that brand for most of the 1970s. On January 12, 2021, in recognition of PBS' growing online content delivery, the state network rebranded itself as "PBS North Carolina," while continuing to acknowledge its ties to the university system as being "Powered by the UNC System".
Programming
The state network produces many programs of local interest, including the weeknightly public affairs program North Carolina Now, Our State, Carolina Outdoor Journal, Exploring North Carolina, North Carolina Bookwatch with D. G. Martin, and special programs about the state's history and culture. It also produces The Woodwright's Shop, Growing a Greener World, The Zula Patrol, and Song of the Mountains for national distribution. In addition to PBS and American Public Television programs and local productions, the station also runs programming from the Uni |
https://en.wikipedia.org/wiki/Multigrid%20method | In numerical analysis, a multigrid method (MG method) is an algorithm for solving differential equations using a hierarchy of discretizations. They are an example of a class of techniques called multiresolution methods, very useful in problems exhibiting multiple scales of behavior. For example, many basic relaxation methods exhibit different rates of convergence for short- and long-wavelength components, suggesting these different scales be treated differently, as in a Fourier analysis approach to multigrid. MG methods can be used as solvers as well as preconditioners.
The main idea of multigrid is to accelerate the convergence of a basic iterative method (known as relaxation, which generally reduces short-wavelength error) by a global correction of the fine grid solution approximation from time to time, accomplished by solving a coarse problem. The coarse problem, while cheaper to solve, is similar to the fine grid problem in that it also has short- and long-wavelength errors. It can also be solved by a combination of relaxation and appeal to still coarser grids. This recursive process is repeated until a grid is reached where the cost of direct solution there is negligible compared to the cost of one relaxation sweep on the fine grid. This multigrid cycle typically reduces all error components by a fixed amount bounded well below one, independent of the fine grid mesh size. The typical application for multigrid is in the numerical solution of elliptic partial differential equations in two or more dimensions.
Multigrid methods can be applied in combination with any of the common discretization techniques. For example, the finite element method may be recast as a multigrid method. In these cases, multigrid methods are among the fastest solution techniques known today. In contrast to other methods, multigrid methods are general in that they can treat arbitrary regions and boundary conditions. They do not depend on the separability of the equations or other special properties of the equation. They have also been widely used for more-complicated non-symmetric and nonlinear systems of equations, like the Lamé equations of elasticity or the Navier-Stokes equations.
Algorithm
There are many variations of multigrid algorithms, but the common features are that a hierarchy of discretizations (grids) is considered. The important steps are:
Smoothing – reducing high frequency errors, for example using a few iterations of the Gauss–Seidel method.
Residual Computation – computing residual error after the smoothing operation(s).
Restriction – downsampling the residual error to a coarser grid.
Interpolation or prolongation – interpolating a correction computed on a coarser grid into a finer grid.
Correction – Adding prolongated coarser grid solution onto the finer grid.
There are many choices of multigrid methods with varying trade-offs between speed of solving a single iteration and the rate of convergence with said iteration. The 3 main types ar |
https://en.wikipedia.org/wiki/OEC | OEC may refer to:
Finance
The Observatory of Economic Complexity, a data visualization site
Ordre des Experts-Comptables, French association of chartered accountants
Transportation
Orion Expedition Cruises, Australian based luxury expedition cruise line
Otis Elevator Company, an American company that manufactures vertical transportation systems
Osborn Engineering Company, known as OEC, an historic British former manufacturer of motorcycles
Other
Odd Eye Circle, a South Korean girl group
Offshore Energy Center, sponsor of the Ocean Star Offshore Drilling Rig & Museum in Galveston, Texas, United States
Old Earth creationism, a term for several types of creationism
Olfactory ensheathing cells, a type of glial cell found in the nervous system
Oregon Environmental Council, an American environmental organization
Orissa Engineering College, a technical institution in Bhubaneswar, Orissa, India
Outdoor Emergency Care, a course for certification of first aid in non-urban situations
Oxford English Corpus, an English text corpus
Oxygen evolving complex, a water oxidizing enzyme
.OEC, the file format for OE-Cake!, a fluid physics software application |
https://en.wikipedia.org/wiki/Stephen%20Thomas%20Erlewine | Stephen Thomas Erlewine (; born June 18, 1973) is an American music critic and senior editor for the online music database AllMusic. He is the author of many artist biographies and record reviews for AllMusic, as well as a freelance writer, occasionally contributing liner notes.
Erlewine was born in Ann Arbor, Michigan, and is a nephew of the former musician and AllMusic founder Michael Erlewine. He studied at the University of Michigan, where he majored in English, and was a music editor (1993–94) and then arts editor (1994–1995) of the school's paper The Michigan Daily, and DJ'd at the campus radio station, WCBN. He has contributed to many books, including All Music Guide to Rock: The Definitive Guide to Rock, Pop, and Soul and All Music Guide to Hip-Hop: The Definitive Guide to Rap & Hip-Hop.
References
External links
Erlewine's page at Pitchfork.com
Contributions to Rolling Stone
Writings for Billboard
Articles for Spin
1973 births
Living people
AllMusic
American music critics
American music journalists
Journalists from Ann Arbor, Michigan
University of Michigan College of Literature, Science, and the Arts alumni
People from Austin, Texas
The Michigan Daily alumni
Music editors |
https://en.wikipedia.org/wiki/NDI | NDI may refer to:
Organisations
National Dance Institute, a not for profit organization
National Democratic Institute for International Affairs
National Datacast Incorporated, the PBS datacasting subsidiary
Science and technology
Nephrogenic diabetes insipidus, a form of diabetes insipidus due primarily to pathology of the kidney
Network Device Interface, an IP Video and Audio Protocol developed by NewTek
Naphthalene diimides, dyes used in chemistry; See Naphthalene tetracarboxylic dianhydride
New Dietary Ingredient, defined by the Dietary Supplement Health and Education Act of 1994 to be a dietary ingredient not marketed in the United States before October 15, 1994
Other uses
Non-Destructive Inspection, in nondestructive testing
Non-developmental item, in the Federal Acquisition Regulation
Net disposable income |
https://en.wikipedia.org/wiki/OsiriX | OsiriX is an image processing application for the Apple MacOS operating system dedicated to DICOM images (".dcm" / ".DCM" extension) produced by equipment (MRI, CT, PET, PET-CT, ...). OsiriX is complementary to existing viewers, in particular to nuclear medicine viewers. It can also read many other file formats: TIFF (8,16, 32 bits), JPEG, PDF, AVI, MPEG and QuickTime. It is fully compliant with the DICOM standard for image communication and image file formats. OsiriX is able to receive images transferred by DICOM communication protocol from any PACS or medical imaging modality (STORE SCP - Service Class Provider, STORE SCU - Service Class User, and Query/Retrieve).
Since 2010, a commercial version of OsiriX, named "OsiriX MD", is available. Its original source code is still available on GitHub. A demo version, "OsiriX Lite", still remains available free of charge with some limitations.
History
The OsiriX project started in 2004 at UCLA with Dr Antoine Rosset and Prof. Osman Ratib. OsiriX has been developed by Rosset, working in LaTour Hospital (Geneva, Switzerland) and Joris Heuberger, a computer scientist from Geneva.
In 2010, a version of OsiriX for iPhone and iPod touch was released.
Major milestones in OsiriX versions
OsiriX 6.5 - 3D ROIs are introduced
OsiriX 7.0 - Several reporting plugins are included: PI-RADS, BI-RADS, Coronary Angiography, TAVI and Liver report plugins
OsiriX 7.5 - Dark Mode and vessel tracking (centreline)
OsiriX 8.5 - DICOMweb protocol support
OsiriX 9.0 - Smart Display (adjust image scaling to image content)
OsiriX 9.5 - Javascript web viewer for the built-in Web Portal functionality
OsiriX 12.0 - Compiled for Apple Silicon processors (M1, M2, …)
OsiriX 13.0 - DICOM fields editing directly in the database window
Features
OsiriX has been specifically designed for navigation and visualization of multimodality and multidimensional images: 2D Viewer, 3D Viewer, 4D Viewer (3D series with temporal dimension, for example: Cardiac-CT) and 5D Viewer (3D series with temporal and functional dimensions, for example: Cardiac-PET-CT). The 3D Viewer offers all modern rendering modes: Multiplanar reconstruction (MPR), Surface Rendering, Volume Rendering and Maximum intensity projection (MIP). All these modes support 4D data and are able to produce image fusion between two different series (for example: PET-CT).
OsiriX is simultaneously a DICOM PACS workstation for imaging and an image processing software package for research (radiology and nuclear imaging), functional imaging, 3D imaging, confocal microscopy and molecular imaging.
OsiriX supports a complete plug-in architecture that allows one to expand the capabilities of OsiriX for personal needs. OsiriX is released under a proprietary license and runs under macOS.
OsiriX source code makes heavy use of Apple idioms such as Cocoa. The source is almost entirely in Objective-C.
Pixmeo company
In 2010, the OsiriX Team created the company Pixmeo to promote a |
https://en.wikipedia.org/wiki/Eurowings | Eurowings GmbH is a German low-cost carrier headquartered in Düsseldorf and a wholly owned subsidiary of the Lufthansa Group. Founded in 1996, it serves a network of domestic and European destinations and formerly also operated some long-haul routes and maintains bases at several airports throughout Germany and Austria as well as in Palma de Mallorca and Pristina.
Eurowings has gone through a major transformation in recent years. It was part of Lufthansa Regional until October 2014. At that time it began operating on behalf of Germanwings within their network. Since spring 2015, Eurowings has been redeveloped into a low-cost airline for short- and long-haul flights. By October 2015, it had also started to incorporate Germanwings' route network as part of the merger of the two brands.
History
Early years
The airline was formed on 1 February 1990, following a merger of Nürnberger Flugdienst (NFD) and Reise- und Industrieflug (RFG), two commuter airlines based in Nürnberg and Dortmund, respectively. Flight operations using an initial fleet of ATR 42 and 72 aircraft inherited from Eurowings' predecessors were launched on 1 January 1994. Subsequently, BAe 146 aircraft were added to the fleet, which were later followed by larger Airbus A320 family aircraft and even an Airbus A310. Lufthansa took an initial 24,9% stake in Eurowings in 2001, increasing it to 49% in 2004. It has exercised full control of the airline since 2005 and assume complete ownership since 2011.
Development as part of Lufthansa
As of 31 December 2006, Lufthansa had a 49% shareholding in Eurowings with a call option for 50.91% of the remaining stakes, bringing the company into the Lufthansa Group fold. At that time, Eurowings was the owner of Germanwings, thus creating a low-cost branch within the Lufthansa trust. Plans to merge these two airlines with TUIfly (controlled by TUI Travel) into a joint and independent holding company, were brought forth during 2008, but did not materialize. Instead, Lufthansa announced in December 2008 to acquire Germanwings from Eurowings.
In September 2010 Eurowings closed its headquarters and technical infrastructure in Dortmund, Germany, and moved both to Düsseldorf, where Eurowings operated most of its flights since the airline was part of Lufthansa Regional. In March 2011, the maintenance division at Nürnberg Airport was also closed.
In late 2013, Eurowings' short-haul flights that are not operated from Frankfurt or Munich were transferred from Lufthansa to Germanwings. All Eurowings flights operated on behalf of Lufthansa Regional ceased by autumn 2014 and were rebranded to Germanwings, the last ones to and from Düsseldorf.
Redevelopment into a low-cost carrier
In July 2014, the Lufthansa Group announced that Eurowings would replace its 23 Bombardier CRJ900 aircraft with 23 Airbus A320s. Ten of the A320s would be new orders, and 13 would be transferred from Lufthansa Group orders between February 2015 and March 2017. Lufthansa also announ |
https://en.wikipedia.org/wiki/PDP-9 | The PDP-9, the fourth of the five 18-bit minicomputers produced by Digital Equipment Corporation, was introduced in 1966. A total of 445 PDP-9 systems were produced, of which 40 were the compact, low-cost PDP-9/L units.
History
The 18-bit PDP systems preceding the PDP-9 were the PDP-1, PDP-4 and PDP-7. Its successor was the PDP-15.
Hardware
The PDP-9, which is "two metres wide and about 75cm deep," is approximately twice the speed of the PDP-7. It was built using discrete transistors, and has an optional integrated vector graphics terminal. The PDP-9 has a memory cycle time of 1 microsecond, and weighs about . The PDP-9/L has a memory cycle time of 1.5 microseconds, and weighs about .
It was DEC's first microprogrammed machine.
A typical configuration included:
300 cps Paper Tape Reader
50 cps Paper Tape Punch
10 cps Console Teleprinter, Model 33 KSR
Among the improvements of the PDP-9 over its PDP-7 predecessor were:
the addition of Status flags for reader and punch errors, thus providing added flexibility and for error detection
an entirely new design for multi-level interrupts, called the Automatic Priority Interrupt (API) option
a more advanced form of memory management
User/university-based research projects for extending the PDP-9 included:
a hardware capability for floating-point arithmetic, at a time when machines in this price range used software
a PDP-9 controlled parallel computer
Software
The system came with a single-user keyboard monitor. DECsys provided an interactive, single-user, program development environment for Fortran and assembly language programs.
Both FORTRAN II and FORTRAN IV were implemented for the PDP-9.
MUMPS was originally developed on the PDP-7, and ran on several PDP-9s at the Massachusetts General Hospital.
Sales
The PDP-7, of which 120 were sold, was described as "highly successful". The PDP-9 sold 445 units. Both have submodels, the PDP-7A and the PDP-9/L, neither of which accounted for a substantial percentage of sales.
See also
Programmed Data Processor
PDP-15 - successor to the PDP-9
Notes
References
DEC minicomputers
18-bit computers
Transistorized computers
Computer-related introductions in 1966 |
https://en.wikipedia.org/wiki/Empresa%20Nacional%20de%20Ferrocarriles%20del%20Per%C3%BA | The Empresa Nacional de Ferrocarriles del Perú (Enafer) is a public company which ensures the management and the commercial use of the railway network of Peru.
Created by decree on September 19, 1972, it was formed by the nationalization of several foreign-owned companies which had serviced mostly two separate networks: the central railroad serving Lima, and the southern railroad offering a second connection to the Pacific Ocean. It has once again been privatised,.
The rail network of Peru includes in total of lines, mainly with single track that is . On this track is found the highest-altitude railway station in the world, Galera, at above sea level. The new Qingzang railway now beats this altitude record.
See also
Ferrocarril Central Andino
Railroad Development Corporation
PeruRail
References
External links
F.C. CENTRAL ANDINA S.A.,
FERROCARRIL CENTRAL ANDINO S.A.,
Map, Callao - Huancayo
Map, Huancayo - Huancavelica (narrow gauge, gauge)
RUTA AREQUIPA - LAGO TITICACA, Cusco - Puno
RUTA CUSCO - LAGO TITICACA (Standard gauge)
RUTA CUSCO - MACHU PICCHU (36 in or 914 mm gauge)
Railway companies of Peru
Peruvian brands |
https://en.wikipedia.org/wiki/PDP-5 | The PDP-5 was Digital Equipment Corporation's first 12-bit computer, introduced in 1963.
History
An earlier 12-bit computer, named LINC has been described as the first minicomputer and also "the first modern personal computer." It had 2,048 12-bit words, and the first LINC was built in 1962.
DEC's founder, Ken Olsen, had worked with both it and a still earlier computer, the 18-bit 64,000-word TX-0, at MIT's Lincoln Laboratory.
Neither of these machines was mass-produced.
Applicability
Although the LINC computer was intended primarily for laboratory use, the PDP-5's 12-bit system had a far wider range of use. An example of DEC's "The success of the PDP-5 ... proved that a market for minicomputers did exist"
is:
"Data-processing computers have accomplished for mathematicians what the wheel did for transportation"
"Very reliable data was obtained with ..."
"A PDP-5 computer was used very successfully aboard Evergreen for ..."
all of which described the same PDP-5 used by the United States Coast Guard.
The architecture of the PDP-5 was specified by Alan Kotok and Gordon Bell; the principal logic designer was the young engineer Edson de Castro who went on later to found Data General.
Hardware
By contrast with the 4-cabinet PDP-1, the minimum configuration of the PDP-5 was a single 19-inch cabinet with "150 printed circuit board modules holding over 900 transistors." Additional cabinets were required to house many peripheral devices.
The minimum configuration weighed about .
The machine was offered with from 1,024 to 32,768 12-bit words of core memory. Addressing more than 4,096 words of memory required the addition of a Type 154 Memory Extension Control unit (in modern terms, a memory management unit); this allowed adding additional Type 155 4,096 word core memory modules.
Instruction set
Of the 12 bits in each word, exactly 3 were used for instruction op-codes.
The PDP-5's instruction set was later expanded in its successor, the PDP-8. The biggest change was that, in the PDP-5, the program counter was stored in memory location zero, while on PDP-8 computers, it was a register inside the CPU. Another significant change was that microcoded instructions on the PDP-5 could not combine incrementing and clearing the accumulator, while these could be combined on the PDP-8. This allowed loading of many small constants in a single instruction on the PDP-8. The PDP-5 was one of the first computer series with more than 1,000 built.
Software
DEC provided an editor, an assembler, a FORTRAN II Compiler and
DDT (a debugger).
Marketplace
With a base price of $27,000 and designed for those not in need of the 18-bit PDP-4, yet having "applications needing solutions too complicated to be solved efficiently by modules systems" the PDP-5, when introduced in 1963, came at a time when the minicomputer market was gaining a foothold.
Photos
PDP-5 computer, including Teletype Model 33 ASR
PDP-5 from Ed Thelen's collection
Front panel of a PDP-5
|
https://en.wikipedia.org/wiki/PDP-14 | The PDP-14 was a specialized computer from Digital Equipment Corporation’s Industrial Products Group designed to replace industrial level relay controls for machinery and machine tools that performed repetitive tasks. It was specifically designed to function in the harsh electrical environment encountered in facilities where electric motors, solenoids and arc welders were present, a significant adversity for normal computer electronics. The PDP-14 was specifically designed to be the first level of factory automation, functioning as a programmable logic controller (PLC), through its ability to communicate with a standard DEC PDP-8 minicomputer.
U.S patent, #3,753,243 was issued on August 14, 1973 to Alan Ricketts, Allan Devault, Russel Doane, John Dumser, John Holzer and assigned to Digital Equipment Corp.
The PDP-14 was designed to process Boolean equations, usually expressed as “ladder diagrams” and as such had a programmable read-only program (PROM) memory. Programs were developed using a PDP-8 then tested using a direct connection to the PDP-14. The PDP-14 was put into a check out mode where instructions were provided by the PDP-8. Following checkout, the PDP-8 provided the instructions to be put into the PROM.
Later versions (for example, the PDP-14/30, whose instruction set was not binary compatible) are based on PDP-8 physical packaging technology. There also was a PDP-14/35 and a lower cost/reduced I/O capability PDP-14/L.
Hardware
The 12-bit PDP-14 could hold a maximum of 4K words for instructions. The system's configuration included a control unit and a number of external boxes:
I-boxes (BX14) were for discrete inputs from the controlled system. Up to 256 input sources could be addressed.
O-boxes (BY14) could control up to 255 actuators in the controlled system.
A-boxes could be filled with timer modules for controlling time-driven events or retentive storage modules which were not cleared with power loss. A-boxes occupied the output address space along with the O-boxes.
S-boxes were essentially the same as the O-boxes, but there was no real output device. This enabled storing intermediate results. S-boxes also used the shared output address space.
Hence the combined usable output address space of the O-boxes, A-boxes and S-boxes was 255 or fewer.
Registers
The PDP-14 has seven 12-bit registers:
IR
PC1 & PC2
MB
SPARE
INPUT and OUTPUT.
Instructions
Among the PDP-14 instructions were:
TRR to move data between some (but not all) of the registers TRansfer Register (contents).
PC1 and SPARE have increment and decrement capabilities, permitting TRR to modify the value loaded into the register.
JMS JuMp to Subroutine at the address specified in the following 12-bit word.
JMR JuMp to RETURN from a subroutine, to ADDRESS+1 of the most recent JMS.
effectively, in modern terminology, JMS pushed the current instruction address onto a "stack"
and JMR popped the return address.
In effect, JMR is actually a specific TRR in w |
https://en.wikipedia.org/wiki/PDP-15 | The PDP-15 was the fifth and last of the 18-bit minicomputers produced by Digital Equipment Corporation. The PDP-1 was first delivered in December 1959 and the first PDP-15 was delivered in February 1970. More than 400 of these successors to the PDP-9 (and 9/L) were ordered within the first eight months.
In addition to operating systems, the PDP-15 has compilers for Fortran and ALGOL.
History
The 18-bit PDP systems preceding the PDP-15 were named PDP-1, PDP-4, PDP-7 and PDP-9.
The last PDP-15 was produced in 1979.
Hardware
The PDP-15 was DEC's only 18-bit machine constructed from TTL integrated circuits rather than discrete transistors, and, like every DEC 18-bit system could be equipped with:
an optional X-Y (point-plot or vector graphics) display.
a hardware floating-point option, with a 10x speedup, was offered.
up to 128Kwords of core main memory
Models
The PDP-15 models offered by DEC were:
PDP-15/10: a 4K-word paper-tape based system
PDP-15/20: 8K, added DECtape
PDP-15/30: 16K word, added memory protection and a foreground/background Monitor
PDP-15/35: Added a 524K-word fixed-head disk drive
PDP-15/40: 24K memory
PDP-15/50:
PDP-15/76
PDP-15/76: 15/40 plus PDP-11 frontend. The PDP-15/76 was a dual-processor system that shared memory with an attached PDP-11/05. The PDP-11 served as a peripheral processor and enabled use of Unibus peripherals.
Software
DECsys, RSX-15, and XVM/RSX were the operating systems supplied by DEC for the PDP-15. A batch processing monitor (BOSS-15: Batch Operating Software System) was also available.
DECsys
The first DEC-supplied mass-storage operating system available for the PDP-15 was DECsys, an interactive single-user system. This software was provided on a DECtape reel, of which copies were made for each user. This copied DECtape was then added to by the user, and thus was storage
for personal programs and data. A second DECtape was used as a scratch tape by the assembler and the Fortran compiler.
RSX-15
RSX-15 was released by DEC in 1971. The main architect for RSX-15 (later renamed XVM/RSX) was Dennis "Dan" Brevik.
Once XVM/RSX was released, DEC facilitated that "a PDP-15 can be field-upgraded to XVM" but it required "the addition of the XM15 memory processor."
The RSX-11 operating system began as a port of RSX-15 to the PDP-11, although it later diverged significantly in terms of design and functionality.
Origin of the RSX-15 name
Commenting on the RSX acronym, Brevik says:
XVM/RSX
Later versions of the PDP-15 could run a real-time multi-user OS called XVM/RSX, an outgrowth of RSX-15. The XVM upgrade to RSX was multi-user, and enabled up to six concurrent teletype-based users. XVM Support for the PDP-15/76 included using an RK05 disk drive.
non-DEC
The MUMPS operating system, which was originally developed in 1966, was developed on the PDP-7 outside DEC. It is also available for the PDP-15.
Application software
DEC provided mathematical, scientific and commercial software applicat |
https://en.wikipedia.org/wiki/Double-chance%20function | In software engineering, a double-chance function is a software design pattern with a strong application in cross-platform and scalable development.
Examples
Computer graphics
Consider a graphics API with functions to DrawPoint, DrawLine, and DrawSquare. It is easy to see that DrawLine can be implemented solely in terms of DrawPoint, and DrawSquare can in turn be implemented through four calls to DrawLine. If you were porting this API to a new architecture you would have a choice: implement three different functions natively (taking more time to implement, but likely resulting in faster code), or write DrawPoint natively, and implement the others as described above using common, cross-platform, code. An important example of this approach is the X11 graphics system, which can be ported to new graphics hardware by providing a very small number of device-dependent primitives, leaving higher level functions to a hardware-independent layer.
The double-chance function is an optimal method of creating such an implementation, whereby the first draft of the port can use the "fast to market, slow to run" version with a common DrawPoint function, while later versions can be modified as "slow to market, fast to run". Where the double-chance pattern scores high is that the base API includes the self-supporting implementation given here as part of the null driver, and all other implementations are extensions of this. Consequently, the first port is, in fact, the first usable implementation.
One typical implementation in C++ could be:
class CBaseGfxAPI {
virtual void DrawPoint(int x, int y) = 0; /* Abstract concept for the null driver */
virtual void DrawLine(int x1, int y1, int x2, int y2) { /* DrawPoint() repeated */}
virtual void DrawSquare(int x1, int y1, int x2, int y2) { /* DrawLine() repeated */}
};
class COriginalGfxAPI : public CBaseGfxAPI {
virtual void DrawPoint(int x, int y) { /* The only necessary native calls */ }
virtual void DrawLine(int x1, int y1, int x2, int y2) { /* If this function exists a native DrawLine
routine will be used. Otherwise the base
implementation is run. */}
};
class CNewGfxAPI : public CBaseGfxAPI {
virtual void DrawPoint(int x, int y) { /* The only necessary for native calls */ }
};
Note that the CBaseGfxAPI::DrawPoint function is never used, per se, as any graphics call goes through one of its derived classes. So a call to CNewGfxAPI::DrawSquare would have its first chance to render a square by the CNewGfxAPI class. If no native implementation exists, then the base class is called, at which point the virtualization takes over and means that CNewGfxAPI::DrawLine is called. This gives the CNewGfxAPI class a “second chance” to use native code, if any is available.
With this method it is, theoretically, possible to build an entire 3D engine (applying softwa |
https://en.wikipedia.org/wiki/Autism%20Network%20International | Autism Network International (ANI) is an advocacy organization run by and for autistic people. ANI's principles involve the anti-cure perspective, the perspective that there should not be a goal to "cure" people of autism.
History
ANI was started by Jim Sinclair, Kathy Grant, and Donna Williams in 1992. The advocacy group is organized by autistic people for autistic people. ANI started out as a pen pal group, but when they first met in person, "they felt a sense of belonging, of being understood, of having the same concepts and sharing a language, of being normal." Sinclair and the other founders created an online community where participants could discuss issues in the online forum. ANI began publishing a newsletter, called Our Voice, which was distributed through the ANI website.
ANI is responsible for coining the phrase "neurologically typical". Sinclair used ANI to help focus on the positive benefits of being Autistic, rather than the negatives. ANI has helped autistic individuals learn "the important lesson of delighting in a shared autistic culture."
Autreat
Autreat was a United States retreat and conference hosted by Autism Network International for autistic people. The first Autreat was in 1996, and was held at Camp Bristol Hills in New York. In 1999, there were 80 attendees, with one woman traveling from as far as Japan. There was an Autreat every year between 1999 and 2013, except 2001. The last Autreat was held in 2013.
Autreat was a conference for autistic people "designed by autistic people. It was a contrast to other autism conferences, which ANI believes are typically about autistic people but are intended for parents and professionals. Although parents, professionals, and others were welcome, Autreat was specifically designed for autistics, and offers an "autism friendly" environment, free of sensory bombardment. Common autistic mannerisms, like exceedingly literal conversation and hand-flapping, are to be expected. Common sources of autistic irritation, like casual hugs and fluorescent lighting, are not allowed.
Guests were under no pressure to interact socially. A simple visual code in the form of a colored badge was used to indicate members who wish to interact with anyone and everyone, those who wish not to be approached by strangers, and those who wish not to be approached at all. Autreat helped allow autistic individuals a "place to pursue and enjoy a nonconforming subculture."
Autreat inspired similar programs in other countries, such as Autscape in England and Projekt Empowerment in Sweden.
See also
List of disability rights organizations
References
External links
Autreat official site for Autreat
Autism rights movement
Disability rights organizations
Autism-related organizations in the United States
Health and disability rights organizations in the United States
Organizations established in 1992
Mental health organizations in New York (state)
1992 establishments in the United States |
https://en.wikipedia.org/wiki/Play%20UK | Play UK was a television channel broadcasting in the United Kingdom as part of the UKTV network of channels. Play UK broadcast all day on the digital platforms, but on the Sky Analogue platform on the Astra 19.2°E satellite system it broadcast between 1am and 7am when UK Horizons was not broadcasting.
History
The channel had originally been planned as a television version of BBC Radio 1 but launched without the Radio 1 tie-up as UK Play on 10 October 1998, changing its name to Play UK in November 2000. Like 4Music and Viacom's old Freeview channel Viva, the channel had music programming through the day, while broadcasting comedy during its primetime and evening hours. Most of the comedy programming on Play UK had already been broadcast on the BBC's terrestrial channels, with Play UK adding a few original UKTV-produced comedy programmes as well as a number of American comedy and animation shows towards the end of its broadcast life.
Closure
On 30 June 2002, it was announced that Play UK would shut down at the end of the year, with the closure of ITV Digital being the reason for its demise. The channel closed on 30 September 2002 at 12am, with its EPG space later being used to launch UK History the following month as part of the launch of Freeview.
Some of the channel's comedy programming like The Office, The Fast Show and Shooting Stars were moved to UK Gold following the closure. Other programs were later added to UKG2 upon its launch the following year in November 2003.
Programmes
Music programming
The majority of the music programmes broadcast (quizzes, interviews and compilations) on Play UK were produced by UKTV. Play UK also used to air repeats of TOTP2, which were originally broadcast on BBC Two.
Joe's Pop Shop
Mark and Lard's Pop Upstairs Downstairs
Mental! - The Music Quiz (with Iain Lee)
Pop Will Shoot Itself
Rock Profile (This comedy-music show, lasting from 1999-2002, featured Matt Lucas and David Walliams spoofing various pop bands)
The Joy of Decks
The Phone Zone (music request programme using The O Zone branding)
The Sound of Disco
The Sound of Play
The UK Top 20
TOTP@Play
Original UKTV produced showsThe Alphabet ShowCherry PopThe Chris Moyles ShowEither/Or (1999-2002)futurTVHonky SausagesThe Mitchell and Webb Situation (7 April 2001-2002; 2004)RE:BrandSwivel on the TipTerrorville (2000-2001)UnnovationsVic Reeves Examines American programmes/other imports Duckman (1999-2001)The Larry Sanders Show (2000-2002) Repeated shows from the BBC archives500 Bus StopsAttention Scum! (2001–2002)Bottom (1998–2001)Bang Bang, It's Reeves and Mortimer (2001)Big Train (1998–2002)Coogan's Run (1999–2001)The Day Today (1999–2002)Dr. Terrible's House of Horrible (2001)The Fast Show (1998–2002)Game On (2000–2002)Goodness Gracious Me (1998–2002)Harry Enfield and Chums (2001–2002)Hippies (2000–2002)Human Remains (2001–2002)I'm Alan Partridge (1999–2002)Introducing Tony Ferrino - Who? And Why? - A Quest (1999–2002)Knowing Me Knowing You wi |
https://en.wikipedia.org/wiki/Managed%20code | Managed code is computer program code that requires and will execute only under the management of a Common Language Infrastructure (CLI); Virtual Execution System (VES); virtual machine, e.g. .NET, CoreFX, or .NET Framework; Common Language Runtime (CLR); or Mono. The term was coined by Microsoft.
Managed code is the compiler output of source code written in one of over twenty high-level programming languages, including C#, J# and Visual Basic .NET.
Terminology
The distinction between managed and unmanaged code is prevalent and only relevant when developing applications that interact with CLR implementations. Since many older programming languages have been ported to the CLR, the differentiation is needed to identify managed code, especially in a mixed setup. In this context, code that does not rely on the CLR is termed "unmanaged".
A source of confusion was created when Microsoft started connecting the .NET Framework with C++, and the choice of how to name the Managed Extensions for C++. It was first named Managed C++ and then renamed to C++/CLI. The creator of the C++ programming language and member of the C++ standards committee, Bjarne Stroustrup, even commented on this issue, "On the difficult and controversial question of what the CLI binding/extensions to C++ is to be called, I prefer C++/CLI as a shorthand for "The CLI extensions to ISO C++". Keeping C++ as part of the name reminds people what is the base language and will help keep C++ a proper subset of C++ with the C++/CLI extensions."
Uses
The Microsoft Visual C++ compiler can produce both managed code, running under CLR, or unmanaged binaries, running directly on Windows.
Benefits of using managed code include programmer convenience (by increasing the level of abstraction, creating smaller models) and enhanced security guarantees, depending on the platform (including the VM implementation). There are many historical examples of code running on virtual machines, such as the language UCSD Pascal using p-code, and the operating system Inferno from Bell Labs using the Dis virtual machine. Java popularized this approach with its bytecode executed by the Java virtual machine.
Google also mention that Java and Kotlin are managed code in their Android NDK JNI documents
References
External links
Microsoft Research OS written in managed C# code, Channel 9
.NET terminology |
https://en.wikipedia.org/wiki/The%20Comedy%20Company | The Comedy Company was an Australian sketch comedy television series that first aired from 16 February 1988 until 11 November 1990 on Network Ten. It was created and directed by cast member Ian McFadyen, and co-directed and produced by Jo Lane.
The show largely consisted of sketch comedy in short segments, much in the tradition of earlier sketch comedy shows such as The Mavis Bramston Show, The Naked Vicar Show and The D-Generation. The majority of the filming took place in Melbourne.
The show and characters had a significant effect on Australian pop culture, and had a cult following particularly with Australian youth.
History
In 1987, the Media Arts company was asked by Network Ten Australia to produce a one-hour-a-week comedy program. The Comedy Company premiered in February 1988 and within a few months, The Comedy Company became the most successful comedy program of the decade. It often rated as the highest rated weekly television program, which was particularly of note since it ran on Sunday evenings against the Nine Network's popular current affairs show 60 Minutes. Much of its success was due to it being the only family entertainment on television on a Sunday night. The Comedy Company remained the consistently highest rating weekly television program for two years.
The third and final series was titled The New Comedy Company and featured a mostly new cast, though some of the original cast also returned. This version (and by extension, the show) was cancelled within a year.
In 2002, an hour of clips from The Comedy Company was edited into a special called The Comedy Company: So Excellent, with the subtitle referencing a famed line by the Kylie Mole character.
Characters
The series launched several popular characters including Con the Fruiterer, Kylie Mole and Col'n Carpenter, who later featured in his own spin-off sitcom series.
Mark Mitchell would continue to play Con the Fruiterer, a Greek Australian greengrocer, for many years on and off television, including in an advertising campaign urging Australians to eat more fruit in 2010.
The word "bogan" was popularised by Mary-Anne Fahey's Kylie Mole character, a scowling schoolgirl who also interviewed various celebrities. Kylie Mole would also feature in the second series of the ABC series Kittson Fahey in 1993.
Glenn Robbins often did public appearances as his The Comedy Company character Uncle Arthur, and on The Panel he often referenced The Comedy Company by periodically slipping in and out of the character. He appeared in full costume as Arthur for The Panel Christmas Special in 2005.
Cast and characters
Mark Mitchell as Con the Fruiterer, Marika, Glenn Gelding
Mary-Anne Fahey as Kylie Mole, Jophesine, Sharon Maclaren
Ian McFadyen as David Rabbitborough
Glenn Robbins as Uncle Arthur/Gary Dare, Darren Maclaren
Kym Gyngell as Col'n Carpenter
Russell Gilbert as Russ the Postie
Tim Smith, various characters
Celebrity guests
Many well-known national and international sta |
https://en.wikipedia.org/wiki/Moonmist | Moonmist is an interactive fiction computer game written by Stu Galley and Jim Lawrence and published by Infocom in 1986. The game was released simultaneously for the Amiga, Amstrad CPC, Apple II, Atari 8-bit family, Atari ST, Commodore 64, MS-DOS, TRS-80, TI-99/4A, and Macintosh. It is Infocom's twenty-second game. Moonmist was re-released in Infocom's 1995 compilation The Mystery Collection, as well as the 1996 compilation Classic Text Adventure Masterpieces.
Jim Lawrence, one of the co-authors of Moonmist, ghostwrote books in the Nancy Drew and Hardy Boys series. Galley and Lawrence previously co-wrote Seastalker for Infocom.
Moonmist is the first known English language video game to feature a gay character.
Plot
The player's character is a young detective, asked by friend Tamara Lynd to investigate her new home of Tresyllian Castle in Cornwall, England. Tamara has recently become engaged to the castle's lord, Jack Tresyllian. She was very happy until she began seeing what appeared to be The White Lady, a ghost who has allegedly haunted the castle for centuries. As if seeing a ghost wasn't nerve-racking enough, she's also begun to fear for her life. Is Tamara's imagination just overly excited from living in a large old castle, or is someone really trying to kill her? And if her life is in danger, is it from a ghost or someone using it as a disguise?
Gameplay
The actual game is divided into several quests depending on the player's answer to the question "what is your favorite color?" As such, the game contains green (the easiest), blue, red, and yellow (the most difficult) quests, each with a separate criminal and treasure to locate. Interaction is made through the standard text commands typical of the genre.
The game must be completed by 6:59 am the following day or the game ends without a resolution. It is also possible to die in a few rare instances, though the focus of the game remains on exploration and deduction.
Release
The Moonmist package includes the following physical items:
A book, The Legendary Ghosts of Cornwall written by Lady Lisbeth Norris, which includes a page dedicated to "The White Lady of Tresyllian Castle." The book has a stamp indicating it was checked out from the Festeron Town Library, the town where Wishbringer was set.
Two letters from Tamara Lynd to the player: one explaining Tamara's engagement to Lord Jack Tresyllian and her moving to the castle, and one begging the player to investigate the "White Lady".
An iron-on logo of the game's title.
A Visitor's Guide to Tresyllian Castle, a tourist-type brochure providing a history and rough maps.
The official hint book for Moonmist, which was purchasable by mail order and not included with the game, is printed in invisible ink.
Reception
COMPUTE! wrote that Moonmist was a good introduction to Infocom adventures for newcomers, and an example for veterans of how their storytelling had improved from older games. However, Atari User expressed disappointment in the ga |
https://en.wikipedia.org/wiki/Homer%20Goes%20to%20College | "Homer Goes to College" is the third episode of the fifth season of the American animated television series The Simpsons. It originally aired on the Fox network in the United States on October 14, 1993. In the episode, Homer causes a nuclear meltdown during a plant inspection and is required to study nuclear physics at college. When Homer neglects his studies, the college dean has three nerds tutor him. Homer enlists the nerds' help in playing a prank on a rival college, leading to their expulsion. Homer invites them to live with the Simpsons, who soon grow tired of their new housemates.
The episode was written by Conan O'Brien and directed by Jim Reardon. It was the third and final episode of the show that O'Brien received sole writing credit, having previously written the episodes "New Kid on the Block" and "Marge vs. The Monorail", both from season 4. O'Brien would leave the series halfway through the production of the season to host his own show, Late Night with Conan O'Brien. He had been working on this episode when he was informed that he had received the job and was forced to walk out on his contract.
The episode contains several references to the film Animal House as well as Monty Python and the Holy Grail, Star Trek and the song "Louie Louie" by The Kingsmen, which plays during the end credits. Since airing, the episode has received mostly positive reviews from television critics. It acquired a Nielsen rating of 11.3, and it was tied with Beverly Hills, 90210 as the highest-rated show on the Fox network the week it aired.
Executives at Fox wanted "Homer Goes to College" to be the season premiere, but the writing staff felt that "Homer's Barbershop Quartet" was a better choice because of George Harrison's guest appearance in that episode.
Plot
During an inspection of the Springfield Nuclear Power Plant by the Nuclear Regulatory Commission, Homer is placed in a test module van that simulates a power surge. He has no idea what to do, so he pushes buttons at random and causes a nuclear meltdown, even though the van contains no nuclear material. Despite Mr. Burns' offer of a bribe, the NRC officials tell him that Homer's job requires college training in nuclear physics. After Homer is rejected by every school he applies to, Mr. Burns helps him enroll at Springfield University, since he chairs the admissions board there. Homer neglects his studies, instead living his fantasies of college life gleaned from adolescent movies and TV shows. Thinking college life is full of pranks, partying and rigid deans, Homer insults Dean Peterson, thinking he is a crusty, old administrator — when in fact the young dean relates well to the students and is a former bass guitarist for The Pretenders.
Homer is asked to demonstrate how a proton accelerator works and causes a nuclear meltdown in class. Dean Peterson recommends Homer receive tutoring. When his tutors — three nerds named Benjamin, Doug, and Gary — try to help Homer understand physics, he refuses |
https://en.wikipedia.org/wiki/Digital | Digital usually refers to something using discrete digits, often binary digits.
Technology and computing
Hardware
Digital electronics, electronic circuits which operate using digital signals
Digital camera, which captures and stores digital images
Digital versus film photography
Digital computer, a computer that handles information represented by discrete values
Digital recording, information recorded using a digital signal
Socioeconomic phenomena
Digital culture, the anthropological dimension of the digital social changes
Digital divide, a form of economic and social inequality in access to or use of information and communication technologies
Digital economy, an economy based on computing and telecommunications resources
Other uses in technology and computing
Digital data, discrete data, usually represented using binary numbers
Digital marketing, search engine & social media presence booster, usually represented using online visibility.
Digital media, media stored as digital data
Digital radio, which uses digital technology to transmit or receive
Digital television, television systems which broadcast using digital signals
Digital signal (electronics), signals formed from a discrete set of waveforms, rather than continuous ranges
Digital signal (signal processing), sampled analog signals represented as a sequence of digital values
Art, entertainment, and media
Digital: A Love Story (2010), an indie video game by Christine Love
Digital (album), an album by KRS-One
"Digital" (Goldie song) (1998)
"Digital" (Joy Division song) (1978)
"Digital (Did You Tell)", a song by Stone Sour (2010)
"Digital", a song by Alexandra Stan from Unlocked
"Digital", a song by Soulja Boy from The DeAndre Way
"Digital", a song by T-Pain from Three Ringz
Digital painting, a method of creating visual art using computers
Brands and enterprises
Digital Equipment Corporation (DEC) or Digital, a computer company
Digital Research (DR or DRI), a software company
Other uses
Relating to the fingers
Digital exam, in proctology
Digital bank or Neobank
Digital Party, a political party in Uruguay
Digital rights, human and legal rights to access, use, create, and publish digital media or to access and use computers, other electronic devices, and telecommunications networks.
Vitalis Takawira or Digital, professional football player
See also
Digit (disambiguation)
Digital download (disambiguation)
Digital fingerprint (disambiguation)
Binary code
Boolean algebra
:Category:Digital media |
https://en.wikipedia.org/wiki/.tv%20%28TV%20channel%29 | .tv (formerly The Computer Channel, pronounced as Dot TV and referred to on-screen as .tv - the technology channel) was a British television channel dedicated to technology. .tv was owned and operated by British Sky Broadcasting. The channel first broadcast on 1 September 1996 and broadcast between 18:00 and 20:00, timesharing with Granada Good Life when it launched a month later. The broadcasting hours were increased to midday-midnight when the channel started broadcasting on British Sky Broadcasting's digital satellite platform, Sky Digital in 1998. In 1999 the channel interviewed then Microsoft CEO Bill Gates.
Towards the end of its run, .tv implemented several new shows heavily sponsored by online technology store dabs.com, promoting products which were available at that site. .tv was closed on 2 September 2001 because of low audience ratings. Most of the programmes were produced by Hewland International.
Programming
Buyers Guide - 20 minute weekday show that reviewed gadgets (such as PDAs and printers), computers and software (such as video games, operating systems and photo manipulation). Presented by Will Hanrahan. Guests included: Lydia Jones, Chris Long, and Ashley Jones.
Chips with Everything - 20-minute weekday show presented by Kate Russell with guests trying to answer computer-related questions that were sent in by viewers. Guests included: Roger Gann, James Morris, Simon Smart, Nigel Whitfield, Guy Clapperton, and Charles Bocock.
Ex Machina - 30-minute weekly show that went behind the scenes of digitally produced entertainment (video games, films and television programmes).
Game Over (originally Games World) - variable-format video game magazine show. The show was presented by Andy Collins and co-presented by Matt Berry, Richard Pitt, Helen Hartley & Kellie Priestley. In November 2000, Matt Cuttle took over as the sole presenter.
Games Republic - A question-based video game quiz show, presented by Trevor and Simon.
404 Not Found - An offbeat news and reviews show with regular viewer letters and emails, written and hosted by Dave Green and Danny O’Brien, with additional script-writing by James Wallis.
Global Village - 30-minute weekly show that looked at how technology was revolutionising our homes from an international perspective. Presented by Will Hanrahan
Masterclass - 20-minute weekday show that gave tutorials on how to use features from programs like Microsoft Word, Adobe Photoshop and Nero Burning ROM. For the majority of the run, the show was presented by Richard Topping, affectionately known as "Toppers." He left the show to pursue a successful career in writing. His replacement was comedian Marc Haynes, who fronted the show until the channel closed.
Nexus - A puzzle game show hosted by Brian Blessed
Buyers Guide, Masterclass and Chips with Everything were repeated as omnibus editions (the weekday editions broadcast as one programme) on weekends.
See also
XLEAGUE.TV
Game Network
TechTV
G4
References
Ext |
https://en.wikipedia.org/wiki/Jargon%20Software | Jargon Software Inc. is a computer software development company that specializes in development and deployment tools and business applications for mobile handheld devices such as Pocket PC and Symbol PDA devices.
The company is based in Minneapolis, Minnesota, United States, and is a privately held Minnesota corporation. It markets its products both directly and through selected resellers to corporate, governmental and other organizations around the world.
History
Jargon Software was formed in 1997 to create an Internet application architecture that would overcome the inherent limitations of traditional web-enabling technologies, not require long and complicated download and installation procedures, insulate the application from the turbulent times that lie ahead, and offer an upgrade path to emerging technologies. The company was originally named Viking Software Corp. The name was changed to Jargon Software in late 1998 in light-hearted recognition of the many buzzwords pertaining to the technology that underlies the company's products. The founders and principals of Jargon Software are Richard D. Rubenstein, Timothy J. Bloch, and Thomas L. Dietsche.
Products
Jargon Software products are used by developers to develop and deploy smart-client mobile software applications that can run both online and offline. Jargon Software designs mobile products that integrate sales-order processing, inventory, field service, and inspections for small and large companies in any industry anywhere in the world. The open Jargon design makes it possible to manage business on any PDA.
Industries where Jargon mobile software works especially well include motor vehicles & parts, furniture & home furnishings, building & construction materials, electronic equipment, appliances, garden equipment & supplies, foods & beverages, health & personal care, clothing & clothing accessories, sporting goods, real estate management, florists, office supplies, hardware, farm implements, jewelry, petroleum products, pets & pet supplies.
ForceField Mobile SFA
ForceField Mobile SFA (salesforce automation) is an extensible application that works like a remote control. It puts the power of the office into the hands of salespeople, letting them be with their customers rather than in the office.
All data is stored on the mobile PDA while also being able to operate real-time when a connection is present.
The development tool creates XML files that define the client-side user interface (UI), with embedded JavaScript for client-side logic. Developers create applications that directly manipulate individual client components via a server's responses to HTTP requests or via embedded JavaScript functions that are linked to UI events.
The deployment engine runs on various mobile devices, including handhelds, tablets, and laptop PCs. It interprets and executes XML applications that are downloaded from a host server (similar to reading web pages).
Since these XML pages are hosted, deployme |
https://en.wikipedia.org/wiki/Human%20ecosystem | Human ecosystems are human-dominated ecosystems of the anthropocene era that are viewed as complex cybernetic systems by conceptual models that are increasingly used by ecological anthropologists and other scholars to examine the ecological aspects of human communities in a way that integrates multiple factors as economics, sociopolitical organization, psychological factors, and physical factors related to the environment.
A human ecosystem has three central organizing concepts: human environed unit (an individual or group of individuals), environment, interactions and transactions between and within the components. The total environment includes three conceptually distinct, but interrelated environments: the natural, human constructed, and human behavioral. These environments furnish the resources and conditions necessary for life and constitute a life-support system.
Further reading
Basso, Keith 1996 “Wisdom Sits in Places: Landscape and Language among the Western Apache.” Albuquerque: University of New Mexico Press.
Douglas, Mary 1999 “Implicit Meanings: Selected Essays in Anthropology.” London and New York: Routledge, Taylor & Francis Group.
Nadasdy, Paul 2003 “Hunters and Bureaucrats: Power, Knowledge, and Aboriginal-State Relations in the Southwest Yukon.” Vancouver and Toronto: UBC Press.
References
See also
Media ecosystem
Urban ecosystem
Total human ecosystem
Anthropology
Ecosystems
Environmental sociology
Social systems concepts
Systems biology |
https://en.wikipedia.org/wiki/Return%20to%20Eden | Return to Eden is an Australian television drama series starring Rebecca Gilling, James Reyne, Wendy Hughes and James Smillie. It began as a three-part, six-hour mini-series shown on Network Ten on September 27–29, 1983. Gilling and Smillie reprised their roles, with Peta Toppano replacing Hughes, for a 22-part weekly series that began airing on 10 February 1986.
Return to Eden was created by Michael Laurence; it was an international success, particularly in Russia and France, where it has been shown 13 times.
Mini-series (1983)
Synopsis
Stephanie Harper (Gilling) is a dull, frumpy 40-year-old heiress. Rich but insecure, and with two teenage children and two failed marriages behind her, she marries a handsome but unscrupulous younger man, tennis pro Greg Marsden (Reyne). Stephanie believes that she has found true love, but after the wedding, Greg promptly begins an affair with Stephanie's best friend Jilly Stewart (Hughes). Greg then plots to get rid of Stephanie and lay claim to her fortune. Whilst on their honeymoon, Greg pushes Stephanie into a crocodile-infested swamp, and he and Jilly watch as she is apparently mauled to death.
However, Stephanie miraculously survives and is later found washed up on a river bank by hermit Dave Welles (Bill Kerr). Dave nurses Stephanie back to health, but her face and body are horrifically scarred from the encounter with the crocodile. Dave gives her precious gems that he mined locally, so that she can use them to try to move on with her life. Stephanie sells the gems and goes to an island clinic where she meets Dr. Dan Marshall (Smillie), a brilliant plastic surgeon who uses his talents to repair her face and body. After months of operations and physical exercise, Stephanie has been transformed into a very beautiful woman. Using the new alias of Tara Welles, given to her by Dave, Stephanie returns to Sydney and becomes a glamorous supermodel who later appears on the cover of Vogue. Using her new identity and fortune, she plots her revenge on both Greg and Jilly and aims to take back what is rightfully hers, particularly her beloved family home Eden, a vast mansion estate in the Northern Territory.
Production
The mini-series was shot in Sydney, the Darling Downs, the Barrier Reef and Arnhem Land and had a budget of AUS$2.5 million. The Eden property itself was shot on location at Jimbour Homestead. American director Karen Arthur directed the mini-series.
Reception
The mini-series was a huge ratings success in Australia, earning a share of 42%.
Weekly series (1986)
Such was the enormous success of the mini-series that Return to Eden returned as a regular weekly series. Produced in 1985 and screened on TV in 1986, the weekly series had a budget of AUS$8 million.
The events of the series take place seven years after the end of the original mini-series, with Stephanie now married to Dr. Dan Marshall and living at New Eden, a mansion in Sydney. Stephanie's children, Sarah and Dennis, both teenagers in the |
https://en.wikipedia.org/wiki/Late%20night%20television%20in%20the%20United%20States | In the United States, late night television is the block of television programming intended for broadcast after 11:00 p.m. and usually through 2:00 a.m. Eastern and Pacific Time (ET/PT), leading out of prime time; informally, the daypart can include the designated overnight graveyard slot (encompassing programs airing as late as 5:00 a.m. local time). Most notably, the type of programming that has been traditionally showcased in the daypart—most commonly shown after, if not in competition with, local late-evening newscasts—encompasses a particular genre of programming that falls somewhere between a variety show and a talk show.
This article focuses on television programs and programming concepts commonly shown in late night on national broadcast and cable networks and in syndication.
Talk shows
Popular shows within the late night talk show genre include The Tonight Show Starring Jimmy Fallon, The Late Show with Stephen Colbert, Late Night with Seth Meyers and Jimmy Kimmel Live!. Famous former hosts include Johnny Carson of The Tonight Show Starring Johnny Carson; David Letterman of Late Night with David Letterman and Late Show with David Letterman (as well as the short-lived daytime David Letterman Show); Conan O'Brien of Late Night with Conan O'Brien, The Tonight Show with Conan O'Brien, and Conan; Jay Leno of The Tonight Show with Jay Leno (who has taped more episodes than any other late night host); James Corden of The Late Late Show with James Corden; Craig Ferguson of The Late Late Show with Craig Ferguson; Arsenio Hall of The Arsenio Hall Show; Tom Snyder of Tomorrow, and The Late Late Show; Steve Allen, the father of the late night talk show and founder of Tonight (now known as The Tonight Show); Merv Griffin and Dick Cavett, early competitors with Carson; and Jack Paar, the man who followed Steve Allen as host of The Tonight Show and who is responsible for setting the standards for the genre.
Television networks typically produce two late night shows: one taped in New York City and one in Los Angeles. Most are taped late in the afternoon; exceptions include Jimmy Kimmel Live!, which finishes taping about an hour before it is broadcast, and The Late Show with Stephen Colbert, which airs live after events of major importance. The fact that this limits accurate coverage of the latest 24-hour news cycle is sometimes the source of irony humor or notable delays (for instance, The Death of Michael Jackson, a frequent butt of late night jokes, on the afternoon of June 25, 2009 came after all but Kimmel had taped their shows, and as such, Kimmel was the only one to mention it that night).
Scheduling
Until September 2009 and again since spring 2010, the "Big Three television networks" (NBC, ABC and CBS) have all begun their late night programming at 11:35 p.m. Eastern Time each night; Fox, the fourth major U.S. network, aired only one day of late night programming (Saturday) starting at 11:00 p.m. This is a half-hour to one hour after the end |
https://en.wikipedia.org/wiki/Kents%20Bank%20railway%20station | Kents Bank is a railway station on the Furness Line, which runs between and . The station, situated north-west of Lancaster, serves the village of Kents Bank in Cumbria. It is owned by Network Rail and managed by Northern Trains.
History
The station building was designed in 1865 by the Lancaster-based architects, Paley and Austin, for the Furness Railway. Though it remains, it is in private residential use.
Facilities
The station is unstaffed but now has ticket machines available, allowing passenger to buy before boarding. Shelters are located on each platform, along with digital information screens and a PA system. Access to the northbound platform is via a user-worked barrier level crossing, so whilst it has step-free access disabled travellers should exercise caution when crossing the line.
Services
Kents Bank is served by Northern Trains, who operate a basic hourly service with some two-hour gaps between and . Certain northbound trains are extended to and , and several southbound trains are extended to and . A (mostly) hourly service runs each way on Sundays.
References
External links
Railway stations in Cumbria
DfT Category F2 stations
Former Ulverston and Lancaster Railway stations
Railway stations in Great Britain opened in 1857
Railway stations in Great Britain closed in 1858
Railway stations in Great Britain opened in 1859
Northern franchise railway stations
1857 establishments in England
Grange-over-Sands |
https://en.wikipedia.org/wiki/MO5 | MO5 may refer to:
Memories Off 5 The Unfinished Film, a Japanese visual novel
Thomson MO5, a home computer
Former name used by MI5 |
https://en.wikipedia.org/wiki/Robert%20Haralick | Robert M. Haralick (born 1943) is Distinguished Professor in Computer Science at Graduate Center of the City University of New York (CUNY). Haralick is one of the leading figures in computer vision, pattern recognition, and image analysis. He is a Fellow of the Institute of Electrical and Electronics Engineers (IEEE) and a Fellow and past president of the International Association for Pattern Recognition.
Prof. Haralick is the King-Sun Fu Prize winner of 2016, "for contributions in image analysis, including remote sensing, texture analysis, mathematical morphology, consistent labeling, and system performance evaluation".
Biography
Haralick received a B.A. degree in mathematics from the University of Kansas in 1964, a B.S. degree in electrical engineering in 1966, and a M.S. degree in electrical engineering in 1967. In 1969, after completing his Ph.D. at the University of Kansas, he joined the faculty of the electrical engineering department, serving as professor from 1975 to 1978. In 1979 Haralick joined the electrical engineering department at Virginia Polytechnic Institute and State University, where he was a professor and director of the spatial data analysis laboratory.
From 1984 to 1986 Haralick served as vice president of research at Machine Vision International, Ann Arbor, MI. Haralick occupied the Boeing Clairmont Egtvedt Professorship in the department of electrical engineering at the University of Washington from 1986 through 2000. At UW, Haralick was an adjunct professor in the computer science department and the bioengineering department.
In 2000 Haralick accepted a Distinguished Professorship position at the computer science department of the Graduate Center, City University of New York.
Contributions
Haralick began his work as one of the principal investigators of the NASA ERTS satellite data doing remote sensing image analysis.
Haralick has made a series of contributions in the field of computer vision. In the high-level vision area, he has worked on inferring 3D geometry from one or more perspective projection views. He has also identified a variety of vision problems which are special cases of the consistent labeling problem. His papers on consistent labeling, arrangements, relation homomorphism, matching, and tree search translate some specific computer vision problems to the more general combinatorial consistent labeling problem and then discuss the theory of the look-ahead operators that speed up the tree search. The most basic of these is called Forward Checking. This gives a framework for the control structure required in high-level vision problems. He has also extended the forward-checking tree search technique to propositional logic.
In the low-and mid-level areas, Haralick has worked in image texture analysis using spatial gray tone co-occurrence texture features. These features have been used with success on biological cell images, x-ray images, satellite images, aerial images and many other kinds of images tak |
https://en.wikipedia.org/wiki/Web%20accelerator | A web accelerator is a proxy server that reduces website access time. They can be a self-contained hardware appliance or installable software.
Web accelerators may be installed on the client computer or mobile device, on ISP servers, on the server computer/network, or a combination. Accelerating delivery through compression requires some type of host-based server to collect, compress and then deliver content to a client computer.
Techniques
Web accelerators may use several techniques to achieve this reduction in access time:
They may:
cache recently or frequently accessed documents so they may be sent to the client with less latency or at a faster transfer rate than the remote server could.
freshen objects in the cache ensuring that frequently accessed content is readily available for display.
preemptively resolve hostnames present in a document (HTML or JavaScript) in order to reduce latency.
prefetch documents that are likely to be accessed in the near future.
compress documents to a smaller size, for example by reducing the quality of images or by sending only what's changed since the document was last requested.
optimize the code from certain documents (such as HTML or JavaScript).
filter out ads and other undesirable objects so they are not sent to the client at all.
maintain persistent TCP connections between the client and the proxy server.
improve the performance via protocol level accelerations, such as TCP acceleration.
These techniques align with best practices which are typically recommended to improve the performance of web applications.
Web client accelerator
Introduced in 2001-2002 , these applications generally serve to improve dial-up, broadband and other connections from which users may not be getting the best speed. Many Dialup ISPs offer web accelerators as a part of their services. The pre-compression operates much more efficiently than the on-the-fly compression of V.44 modems. Typically, website text is compacted to 5%, thus increasing effective dialup throughput to approximately 1000 kbit/s, and JPEG/GIF/PNG images are lossy-compressed to 15–20%, increasing effective throughput to 300 kbit/s.
The drawback of this approach is a loss in quality, where the graphics acquire compression artifacts taking on a blurry or colorless appearance. However, the transfer speed is dramatically improved. If desired, the user may choose to view uncompressed images instead, but at a much slower load rate.
Web accelerators are typically designed for web browsing and, sometimes, for e-mailing and can not improve speeds of streaming, gaming, P2P downloads or many other Internet applications. However, there is substantial work being done on client-side Web Accelerators for Application Delivery Networks by several companies including Cisco Systems and F5 Networks as the demand for SaaS and PaaS look set to grow among small and medium enterprises.
List
America Online
Netscape ISP
Google Web Accelerator (discontinued)
Heigh Speed (disc |
https://en.wikipedia.org/wiki/Current-mode%20logic | Current mode logic (CML), or source-coupled logic (SCL), is a digital design style used both for logic gates and for board-level digital signaling of digital data.
The basic principle of CML is that current from a constant current generator is steered between two alternate paths depending on whether a logic zero or logic one is being represented. Typically, the generator is connected to the two sources of a pair of differential FETs, with the two paths being their two drains. The bipolar equivalent emitter-coupled logic (ECL) operates similarly, with the output being taken from the collectors of the BJT transistors.
As a differential PCB-level interconnect, it is intended to transmit data at speeds between 312.5 Mbit/s and 3.125 Gbit/s across standard printed circuit boards.
The transmission is point-to-point, unidirectional, and is usually terminated at the destination with 50 Ω resistors to Vcc on both differential lines. CML is frequently used in interfaces to fiber optic components. The principle difference between CML and ECL as a link technology is the output impedance of the driver stage: the emitter follower of ECL has a low resistance of around 5 Ω whereas CML connects to the drains of the driving transistors, that have a high impedance, and so the impedance of the pull up/down network (typically 50 Ω resistive) is the effective output impedance. Matching this drive impedance close to the driven transmission line's characteristic impedance greatly reduces undesirable ringing.
CML signals have also been found useful for connections between modules. CML is the physical layer used in DVI, HDMI and FPD-Link III video links, the interfaces between a display controller and a monitor.
In addition, CML has been widely used in high-speed integrated systems, such as for serial data transceivers and frequency synthesizers in telecommunication systems.
Operation
The fast operation of CML circuits is mainly due to their lower output voltage swing compared to the static CMOS circuits, as well as the very fast current switching taking place at the input differential pair transistors. One of the primary requirements of a current-mode logic circuit is that the current bias transistor must remain in the saturation region to maintain a constant current.
Ultra low power
Recently, CML has been used in ultra-low power applications. Studies show that while the leakage current in conventional static CMOS circuits is becoming a major challenge in lowering the energy dissipation, good control of CML current consumption makes them a very good candidate for extremely low power use. Called subthreshold CML or subthreshold source coupled logic (STSCL), the current consumption of each gate can be reduced down to a few tens of picoamps.
See also
Low-voltage differential signaling (LVDS) A differential standard used primarily for signals between modules.
Positive-referenced emitter-coupled logic, a differential signaling standard for high speed inter-module c |
https://en.wikipedia.org/wiki/European%20route%20E24 | The European route E24 is part of the United Nations international E-road network. It runs for from Birmingham to Ipswich.
Route
The route of the E24 begins at the E5 near Birmingham, where the M6 Toll merges with the M6 and the E5 switches from the M6 Toll to the M42. The E24 heads east on the M6 to its end at the M1 (E13), and continues past the junction onto the A14. The E24 crosses the E15 (A1) at Huntingdon, and continues east along the A14 past Cambridge to the A12 at Ipswich, where the E24 route ends.
The E30, which follows the A12 from London to Ipswich, and then the A14 from Ipswich to the port of Felixstowe, forms a continuation of the route to the North Sea.
Lack of signage
Lying completely within the United Kingdom (like the E13 and E32), no part of the E24 is signed as such, the UK authorities never having implemented the provisions for the indication of European route numbers contained in annex 3 of the 1950 Declaration on the Construction of Main International Traffic Arteries signed in Geneva by Belgium, France, Luxembourg, the Netherlands, and the United Kingdom (later joined by 18 other countries) on 16 September 1950.
References
External links
UN Economic Commission for Europe: Overall Map of E-road Network (2007)
24
Roads in the West Midlands (county)
Roads in Suffolk
Roads in Cambridgeshire
Roads in Warwickshire
Transport in Northampton
24 |
https://en.wikipedia.org/wiki/Computer%20Entertainment%20Rating%20Organization | The (CERO) is a Japanese entertainment rating organization based in Tokyo that rates video game content in console games with levels of ratings that informs the customer(s) of the nature of the product and what age group it is suitable for. It was established in June 2002 as a branch of Computer Entertainment Supplier's Association, and became an officially recognized nonprofit organization under Japanese law in December 2003.
CERO rating marks
On March 1, 2006, CERO implemented the latest revision of its rating system. The symbols that CERO uses are stylized Latin letters, named after academic grading, except "F" is replaced with "Z". Each is meant to convey a game's suitability for minors. "CERO rating marks" are grouped broadly into "age classification marks" and "other marks". Age classification marks include the following five marks. One of the marks is indicated on the left bottom of the game box front, and a corresponding color bar is also shown on the box spine. (Bar colors: black for "A"; green for "B"; blue for "C"; orange for "D"; red for "Z")
Content icons
In April 2004, CERO defined the following "content icons". Content icons represent that the age classification decision has been made based on the expressions belonging to one (or more) of the content icons. They are grouped into nine categories. These icons are displayed on the back of all game boxes except on those rated "A" or "Educational/Database".
Rating process
According to Kazuya Watanabe, CERO's senior director, the group of assessors is composed of five regular people unaffiliated with the game industry. They are trained by rating past games. The rating process is determined by 30 different expressions, each with an upper limit. The expressions that exceed the upper limit are designated as "banned expressions". In addition, six expressions are not allowed and are also considered to be banned expressions. The expressions are categorized into four different types: "Sex-related expression type" (Love, Sexual Content), "Violence expression type" (Violence, Horror), "Antisocial act expression type" (Drinking/Smoking, Gambling, Crime, Drugs), and "Language and ideology-related expression type" (Language). Each expression is rated using the A to Z scale that the rating marks use. After the group evaluates the game, the results are sent to CERO's main office where the final rating attempts to use the majority of the evaluators' ratings.
Scandals, controversies, and criticisms
One month after the initial release of Atelier Meruru: The Apprentice of Arland, shipments of it were halted due to it having been mis-rated. It was re-released a few days later with a B rating from CERO. Its A (All Ages) rating was revoked and it was given a B (Ages 12+) rating instead, due to some suggestive themes featured in the game. The game was originally rated for all ages due to Gust allegedly not providing them with the complete content of the game for them to review.
CERO has been criti |
https://en.wikipedia.org/wiki/Arbitrary%20code%20execution | In computer security, arbitrary code execution (ACE) is an attacker's ability to run any commands or code of the attacker's choice on a target machine or in a target process. An arbitrary code execution vulnerability is a security flaw in software or hardware allowing arbitrary code execution. A program that is designed to exploit such a vulnerability is called an arbitrary code execution exploit. The ability to trigger arbitrary code execution over a network (especially via a wide-area network such as the Internet) is often referred to as remote code execution (RCE).
Vulnerability types
There are a number of classes of vulnerability that can lead to an attacker's ability to execute arbitrary commands or code. For example:
Memory safety vulnerabilities such as buffer overflows or over-reads.
Deserialization vulnerabilities
Type confusion vulnerabilities
GNU LDD arbitrary code execution
Methods
Arbitrary code execution is commonly achieved through control over the instruction pointer (such as a jump or a branch) of a running process. The instruction pointer points to the next instruction in the process that will be executed. Control over the value of the instruction pointer therefore gives control over which instruction is executed next. In order to execute arbitrary code, many exploits inject code into the process (for example by sending input to it which gets stored in an input buffer in RAM) and use a vulnerability to change the instruction pointer to have it point to the injected code. The injected code will then automatically get executed. This type of attack exploits the fact that most computers (which use a Von Neumann architecture) do not make a general distinction between code and data, so that malicious code can be camouflaged as harmless input data. Many newer CPUs have mechanisms to make this harder, such as a no-execute bit.
Combining with privilege escalation
On its own, an arbitrary code execution exploit will give the attacker the same privileges as the target process that is vulnerable. For example, if exploiting a flaw in a web browser, an attacker could act as the user, performing actions such as modifying personal computer files or accessing banking information, but would not be able to perform system-level actions (unless the user in question also had that access).
To work around this, once an attacker can execute arbitrary code on a target, there is often an attempt at a privilege escalation exploit in order to gain additional control. This may involve the kernel itself or an account such as Administrator, SYSTEM, or root. With or without this enhanced control, exploits have the potential to do severe damage or turn the computer into a zombie—but privilege escalation helps with hiding the attack from the legitimate administrator of the system.
Examples
Retrogaming hobbyists have managed to find vulnerabilities in classic video games that allow them to execute arbitrary code, usually using a precise sequence of b |
https://en.wikipedia.org/wiki/Kanmon%20Bridge | The (Asian Highway Network ) is a suspension bridge crossing the Kanmon Straits, a stretch of water separating two of Japan's four main islands. On the Honshū side of the bridge is Shimonoseki (, which contributed Kan to the name of the strait) and on the Kyūshū side is Kitakyushu, whose former city and present ward, Moji (), gave the strait its mon.
The Kanmon Bridge was opened to vehicles on November 14, 1973 and connected to the Kyūshū Expressway on March 27, 1984. It is among the 50 largest suspension bridges in the world with a central length of .
See also
Kanmon Tunnel
External links
Suspension bridges in Japan
Bridges completed in 1973
AH1
Road transport in Japan |
https://en.wikipedia.org/wiki/Specular%20highlight | A specular highlight is the bright spot of light that appears on shiny objects when illuminated (for example, see image on right). Specular highlights are important in 3D computer graphics, as they provide a strong visual cue for the shape of an object and its location with respect to light sources in the scene.
Microfacets
The term specular means that light is perfectly reflected in a mirror-like way from the light source to the viewer. Specular reflection is visible only where the surface normal is oriented precisely halfway between the direction of incoming light and the direction of the viewer; this is called the half-angle direction because it bisects (divides into halves) the angle between the incoming light and the viewer. Thus, a specularly reflecting surface would show a specular highlight as the perfectly sharp reflected image of a light source. However, many shiny objects show blurred specular highlights.
This can be explained by the existence of microfacets. We assume that surfaces that are not perfectly smooth are composed of many very tiny facets, each of which is a perfect specular reflector. These microfacets have normals that are distributed about the normal of the approximating smooth surface. The degree to which microfacet normals differ from the smooth surface normal is determined by the roughness of the surface. At points on the object where the smooth normal is close to the half-angle direction, many of the microfacets point in the half-angle direction and so the specular highlight is bright. As one moves away from the center of the highlight, the smooth normal and the half-angle direction get farther apart; the number of microfacets oriented in the half-angle direction falls, and so the intensity of the highlight falls off to zero.
The specular highlight often reflects the color of the light source, not the color of the reflecting object. This is because many materials have a thin layer of clear material above the surface of the pigmented material. For example, plastic is made up of tiny beads of color suspended in a clear polymer and human skin often has a thin layer of oil or sweat above the pigmented cells. Such materials will show specular highlights in which all parts of the color spectrum are reflected equally. On metallic materials such as gold the color of the specular highlight will reflect the color of the material.
Models
A number of different models exist to predict the distribution of microfacets. Most assume that the microfacet normals are distributed evenly around the normal; these models are called isotropic. If microfacets are distributed with a preference for a certain direction along the surface, the distribution is anisotropic.
NOTE: In most equations, when it says it means
Phong distribution
In the Phong reflection model, the intensity of the specular highlight is calculated as:
Where R is the mirror reflection of the light vector off the surface, and V is the viewpoint vector.
In the Bli |
https://en.wikipedia.org/wiki/ABC%20Australia%20%28Southeast%20Asian%20TV%20channel%29 | ABC Australia, formerly Australia Television International (or just Australia Television), ABC Asia Pacific, Australia Network and Australia Plus, is an Australian pay television channel, launched in 1993 and operated by the Australian Broadcasting Corporation as part of the ABC television network of services. The channel broadcasts a mix of programming, including lifestyle, drama, sports, English-language learning programs, children's programming and news and current affairs to viewers across East Asia, Central Asia, South Asia, Southeast Asia and Pacific Islands.
It is partially funded by Australia's Department of Foreign Affairs & Trade, as well as some advertising (unlike the ABC's domestic television services).
History
Origins
Radio Australia had been operating as part of the ABC since 1939 while the passing of the Australian Broadcasting Corporation Act 1983 allowed the corporation to operate an additional international television service. The channel was originally proposed by directors Mark Armstrong and David Hill, who felt that a television channel would further heighten Australia's presence in the Asia-Pacific region and demonstrate the ABC's technical abilities.
Prime Minister Paul Keating launched Australia Television International on 17 February 1993, televised live to 50 countries in the south-east Asian region, from the ABC's television studios in Gore Hill, Sydney. The actual broadcast was from the Darwin uplink where Dominic Stone, the service's Program Director and David Hill, managing director of the ABC commissioned the first transmission. The establishment of the new channel was funded by a special government grant of . It was originally a part of the so-called "Gang of Five", which was a consortium that was set up to compete against Star TV in the region. (The others in the group were CNN International, HBO, ESPN International [with its Asian operations] and TVB [with TVB Superchannel]) The consortium's channels were initially transmitted via Palapa satellite, but were later also added to Apstar satellite.
The operation of the new channel was funded by a combination of government subsidies and commercial sponsorship. The presence of commercials, not previously seen or heard on the ABC, resulted in the creation of an updated edition of the ABC Editorial and Programme Practices, stipulating that the "Australia Television service will retain editorial control and independence in all programming".
Funding cuts made in the 1997–1998 federal budget, and recommendations made in the Mansfield Report, meant that control of Australia Television was handed over to the Seven Network in 1998. Under Seven's direction the channel continued to receive federal funding, and carry some ABC News.
2002–2006: ABC Asia Pacific
Despite efforts made by Seven to expand into Asia using the service, it continued to lose money. In 2001, the government announced a five-year, tender for the service – at the time watched primarily by Australian |
https://en.wikipedia.org/wiki/Nagle%27s%20algorithm | Nagle's algorithm is a means of improving the efficiency of TCP/IP networks by reducing the number of packets that need to be sent over the network. It was defined by John Nagle while working for Ford Aerospace. It was published in 1984 as a Request for Comments (RFC) with title Congestion Control in IP/TCP Internetworks in .
The RFC describes what Nagle calls the "small-packet problem", where an application repeatedly emits data in small chunks, frequently only 1 byte in size. Since TCP packets have a 40-byte header (20 bytes for TCP, 20 bytes for IPv4), this results in a 41-byte packet for 1 byte of useful information, a huge overhead. This situation often occurs in Telnet sessions, where most keypresses generate a single byte of data that is transmitted immediately. Worse, over slow links, many such packets can be in transit at the same time, potentially leading to congestion collapse.
Nagle's algorithm works by combining a number of small outgoing messages and sending them all at once. Specifically, as long as there is a sent packet for which the sender has received no acknowledgment, the sender should keep buffering its output until it has a full packet's worth of output, thus allowing output to be sent all at once.
Algorithm
The RFC defines the algorithm as
inhibit the sending of new TCP segments when new outgoing data arrives from the user if any previously transmitted data on the connection remains unacknowledged.
Where MSS is the maximum segment size, the largest segment that can be sent on this connection, and the window size is the currently acceptable window of unacknowledged data, this can be written in pseudocode as
if there is new data to send then
if the window size ≥ MSS and available data is ≥ MSS then
send complete MSS segment now
else
if there is unconfirmed data still in the pipe then
enqueue data in the buffer until an acknowledge is received
else
send data immediately
end if
end if
end if
Interaction with delayed ACK
This algorithm interacts badly with TCP delayed acknowledgments (delayed ACK), a feature introduced into TCP at roughly the same time in the early 1980s, but by a different group. With both algorithms enabled, applications that do two successive writes to a TCP connection, followed by a read that will not be fulfilled until after the data from the second write has reached the destination, experience a constant delay of up to 500 milliseconds, the "ACK delay". It is recommended to disable either, although traditionally it's easier to disable Nagle, since such a switch already exists for real-time applications.
A solution recommended by Nagle is to avoid the algorithm sending premature packets by buffering up application writes and then flushing the buffer:
The user-level solution is to avoid write–write–read sequences on sockets. Write–read–write–read is fine. Write–write–write is fine. But write–write–read is a killer. So, i |
https://en.wikipedia.org/wiki/Constraint%20Handling%20Rules | Constraint Handling Rules (CHR) is a declarative, rule-based programming language, introduced in 1991 by Thom Frühwirth at the time with European Computer-Industry Research Centre (ECRC) in Munich, Germany. Originally intended for constraint programming, CHR finds applications in grammar induction, type systems, abductive reasoning, multi-agent systems, natural language processing, compilation, scheduling, spatial-temporal reasoning, testing, and verification.
A CHR program, sometimes called a constraint handler, is a set of rules that maintain a constraint store, a multi-set of logical formulas. Execution of rules may add or remove formulas from the store, thus changing the state of the program. The order in which rules "fire" on a given constraint store is non-deterministic, according to its abstract semantics and deterministic (top-down rule application), according to its refined semantics.
Although CHR is Turing complete, it is not commonly used as a programming language in its own right. Rather, it is used to extend a host language with constraints. Prolog is by far the most popular host language and CHR is included in several Prolog implementations, including SICStus and SWI-Prolog, although CHR implementations also exist for Haskell, Java, C, SQL, and JavaScript. In contrast to Prolog, CHR rules are multi-headed and are executed in a committed-choice manner using a forward chaining algorithm.
Language overview
The concrete syntax of CHR programs depends on the host language, and in fact programs embed statements in the host language that are executed to handle some rules. The host language supplies a data structure for representing terms, including logical variables. Terms represent constraints, which can be thought of as "facts" about the program's problem domain. Traditionally, Prolog is used as the host language, so its data structures and variables are used. The rest of this section uses a neutral, mathematical notation that is common in the CHR literature.
A CHR program, then, consists of rules that manipulate a multi-set of these terms, called the constraint store. Rules come in three types:
Simplification rules have the form . When they match the heads and the guards hold, simplification rules may rewrite the heads into the body .
Propagation rules have the form . These rules add the constraints in the body to the store, without removing the heads.
Simpagation rules combine simplification and propagation. They are written . For a simpagation rule to fire, the constraint store must match all the rules in the head and the guards must hold true. The constraints before the are kept, as a in a propagation rule; the remaining constraints are removed.
Since simpagation rules subsume simplification and propagation, all CHR rules follow the format
where each of is a conjunction of constraints: and contain CHR constraints, while the guards are built-in. Only one of needs to be non-empty.
The host language must also defin |
https://en.wikipedia.org/wiki/Rubberhose%20%28file%20system%29 | In computing, rubberhose (also known by its development codename Marutukku) is a deniable encryption archive containing multiple file systems whose existence can only be verified using the appropriate cryptographic key.
Name and history
The project was originally named Rubberhose, as it was designed to be resistant to attacks by people willing to use torture on those who knew the encryption keys. This is a reference to the rubber-hose cryptanalysis euphemism.
It was written in 1997–2000 by Julian Assange, Suelette Dreyfus, and Ralf Weinmann.
Technical
The following paragraphs are extracts from the project's documentation:
Status
Rubberhose is not actively maintained, although it is available for Linux kernel 2.2, NetBSD and FreeBSD. The latest version available, still in alpha stage, is v0.8.3.
See also
Rubber-hose cryptanalysis
Key disclosure law
StegFS
VeraCrypt hidden volumes
References
External links
Marutukku.org documentation and downloads
Cryptographic software
Works by Julian Assange
Steganography |
https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore%E2%80%93Horspool%20algorithm | In computer science, the Boyer–Moore–Horspool algorithm or Horspool's algorithm is an algorithm for finding substrings in strings. It was published by Nigel Horspool in 1980 as SBM.
It is a simplification of the Boyer–Moore string-search algorithm which is related to the Knuth–Morris–Pratt algorithm. The algorithm trades space for time in order to obtain an average-case complexity of O(n) on random text, although it has O(nm) in the worst case, where the length of the pattern is m and the length of the search string is n.
Description
Like Boyer–Moore, Boyer–Moore–Horspool preprocesses the pattern to produce a table containing, for each symbol in the alphabet, the number of characters that can safely be skipped. The preprocessing phase, in pseudocode, is as follows (for an alphabet of 256 symbols, i.e., bytes):
Unlike the original, we use zero-based indices here.
function preprocess(pattern)
T ← new table of 256 integers
for i from 0 to 256 exclusive
T[i] ← length(pattern)
for i from 0 to length(pattern) - 1 exclusive
T[pattern[i]] ← length(pattern) - 1 - i
return T
Pattern search proceeds as follows. The procedure reports the index of the first occurrence of in .
function same(str1, str2, len) Compares two strings, up to the first len characters.
i ← len - 1
while str1[i] = str2[i] Note: this is equivalent to !memcmp(str1, str2, len).
if i = 0 The original algorithm tries to play smart here: it checks for the
return true last character, and then starts from the first to the second-last.
i ← i - 1
return false
function search(needle, haystack)
T ← preprocess(needle)
skip ← 0
while length(haystack) - skip ≥ length(needle)
haystack[skip:] -- substring starting with "skip". &haystack[skip] in C.
if same(haystack[skip:], needle, length(needle))
return skip
skip ← skip + T[haystack[skip + length(needle) - 1]]
return not-found
Performance
The algorithm performs best with long needle strings, when it consistently hits a non-matching character at or near the final byte of the current position in the haystack and the final byte of the needle does not occur elsewhere within the needle. For instance a 32 byte needle ending in "z" searching through a 255 byte haystack which does not have a 'z' byte in it would take up to 224 byte comparisons.
The best case is the same as for the Boyer–Moore string-search algorithm in big O notation, although the constant overhead of initialization and for each loop is less.
The worst case behavior happens when the bad character skip is consistently low (with the lower limit of 1 byte movement) and a large portion of the needle matches the haystack. The bad character skip is only low, on a partial match, when the final character of the needle also occurs elsewhere within the needle, with 1 by |
https://en.wikipedia.org/wiki/Sound%20Recorder%20%28Windows%29 | Sound Recorder (known as Voice Recorder in Windows 10) is an audio recording program included in most versions of the Microsoft Windows family of operating systems. Its user interface has been replaced twice in the past.
History
Sound Recorder has been in most versions and editions of Windows since Windows 3.0, including Windows 9x, Windows Server and the client versions of Windows NT. Even Windows Mobile came with one. Its user interface and feature set saw very little change until Windows Vista, when features that lacked practicality were discontinued and Sound Recorder was simplified. This version of Sound Recorder was included in Windows 7, Windows 8 and Windows 8.1, but did not make it to Windows 10.
A second, different Sound Recorder was introduced in Windows 8.1, thus Windows 8.1 has two distinct apps called Sound Recorder. This second app was a Windows Store app and adhered to the design tenets of the Metro design language. Leaked images of a preview version Windows 10 Mobile showed this app too. When Windows 10 released, however, it was renamed Voice Recorder. The original Sound Recorder was removed from Windows 10.
With the release of Windows 11, Voice Recorder was renamed back to Sound Recorder and included new features, such as changing the playback speed and the input source within the app.
Features
Sound Recorder can record audio from a microphone or headset. In addition, many modern sound cards allow their output channels to be recorded through a loopback channel, typically called "Wave-Out Mix" or "Stereo Mix".
Before Windows Vista, Sound Recorder was capable of:
Playing the audio files that it has recorded
Converting the bit rate, bit depth and sampling rate of the audio file
Inserting other audio files at the beginning, end or the desired location of the current audio
Splitting out parts of the current audio clip
Increasing or decreasing volume in 25% increments
Increase or decrease playback speed in 100% increments
Adding an echo (without reverberation)
Reversing the current audio clip
These features, however, were either removed in Windows Vista or taken over by other applications. The playback and trimming features reappeared in Voice Recorder, although Voice Recorder can only play its own recordings.
Sound Recorder accepts command-line parameters. This was removed in Windows 8, as Windows Store apps cannot be run with a parameter from the command-line.
File format
Before Windows 7, Sound Recorder could save the recorded audio in waveform audio (.wav) container files. Sound Recorder could also open and play existing .wav files. To successfully open compressed .wav files in Sound Recorder, the audio codec used by the file must be installed in the Audio Compression Manager (ACM); Windows installations dating back to at least Windows 95 came with a selection of standard codecs that included Truespeech, GSM 6.10, G.723.1, IMA ADPCM and CCITT A-law and u-law, with additional codecs being added in later editions.
|
https://en.wikipedia.org/wiki/Jinxter | Jinxter is an interactive fiction video game developed by Magnetic Scrolls and published by Rainbird in 1987 for 8-bit and 16-bit home computers of the time. Jinxter tells the story of a man on a mission to save the fictional land of Aquitania from the looming threat of evil witches. The game was well received by critics upon its release.
Gameplay
Jinxter is a text-based adventure, where the player controls the protagonist character by typing in command sentences. Most versions use graphics for illustrations, with the exception of the text-only Spectrum +3 and Apple II versions. It was famous for its quirky, eccentric humour, as many of the textual descriptions are very long and have a humorous aspect. Each of the five charms provides a magic spell, and the words to trigger these spells are common placeholder names. Unlike many other text adventures, in Jinxter the player character almost never dies during the course of gameplay (the only exception to this rule is at the game's final confrontation). However, the player can lose some luck and be unable to complete the game later on.
Plot
The game is a science fantasy comedy set in the fictional country of Aquitania, which bears a strong resemblance to early-to-middle 20th century Britain. The central characters in the story are the Guardians, immortal guardian angel-like beings who look after and help people. The Guardians - members of ARSE, the Association of Registered Stochastic Executives - are described as liking to wear herringbone overcoats and eat cheese sandwiches. Centuries ago the country was threatened by the rising dark power of the wicked Green Witches until the good magician Turani created a magical object, called the Bracelet, which holds luck and distributes it throughout Aquitania to limit and keep in check the witches' magic, banning the dangerous parts of the witchcraft and rendering them relatively harmless. However, the new high witch Jannedor has enough of the restraints. She has obtained and disassembled the Bracelet, stripped it of its five magical charms and hid them in various places (the bracelet itself is worn by Jannedor), waiting for its powers to be weakened enough it could be destroyed so she would fulfill her schemes of jinx and conquest. If the charms of Turani are not reunited soon with the legendary Bracelet of Turani then luck could completely run out and the witches will regain all of their old magic and the country will again fall under their influence.
The player character is, pretty much accidentally, recruited by the Guardians to rescue his friend Xam, who was kidnapped by the witches, retrieve the charms, fix the Bracelet, and then use its powers against Jannedor to kill her and destroy her castle, thus defeating the witches and restoring luck to Aquitania. Once Jannedor's evil ambitions are put to an end, however, the player's character is put back just where he was before he began his adventure—in front of a speeding bus—and killed.
Development
J |
https://en.wikipedia.org/wiki/Maddington%20railway%20station | Maddington railway station is on the Transperth network. It is located on the Armadale Line, 17.7 kilometres from Perth Station serving the suburb of Maddington.
History
From 26 December 1895 until February 1952, Maddington was the junction for a 700-metre branch line to Canning Racecourse.
In 2013, a major upgrade was completed to the station.
Services
Maddington station is served by Transperth Armadale Line services.
The station saw 334,839 passengers in the 2013-14 financial year.
Platforms
Bus routes
References
Armadale and Thornlie lines
Transperth railway stations |
https://en.wikipedia.org/wiki/Kenwick%20railway%20station | Kenwick railway station is located on the Transperth network. It is located on the Armadale Line, 15.8 kilometres from Perth Station serving the suburb of Kenwick.
History
Kenwick station opened in 1914. In 1982–83, the platforms were extended. The station closed on 31 March 2014 for a six-month upgrade. It reopened on 27 October 2014.
Opposite the station lies a connection to the Kwinana freight line.
Services
Kenwick station is served by Transperth Armadale Line services.
The station saw 148,340 passengers in the 2013-14 financial year.
Platforms
References
External links
Armadale and Thornlie lines
Transperth railway stations
Railway stations in Australia opened in 1914
Kenwick, Western Australia |
https://en.wikipedia.org/wiki/Beckenham%20railway%20station | Beckenham railway station is on the Transperth commuter rail network in Western Australia. It is located on the Armadale line, from Perth Station serving the suburb of Beckenham.
History
The station opened in 1954 as Higham. The additional station, with two others on the Armadale line, marked the introduction of diesel-mechanical railcars on Perth's metropolitan passenger railways. Higham was renamed Beckenham in 1969. The platforms are staggered across William Street to minimise the time the level crossing is closed to road traffic.
In March 2014 an $8.1 million upgrade to the station and adjacent car parks was completed.
Future
Beckenham Station will potentially be rebuilt for the removal of the William Street level crossing. This is currently being considered as part of a Metronet project for the removal of level crossings on the Armadale line. The final decision on the William Street level crossing and Beckenham station will be made when the contract is awarded.
Services
Beckenham Station is served by Transperth Armadale line services. Services to and from the Thornlie spur line run non-stop through the station.
The station saw 191,969 passengers in the 2013-14 financial year.
References
Armadale and Thornlie lines
Rail junctions in Western Australia
Transperth railway stations
Railway stations in Australia opened in 1954 |
https://en.wikipedia.org/wiki/Queens%20Park%20railway%20station%2C%20Perth | Queens Park Station is a railway station on the Transperth network. It is located on the Armadale and Thornlie lines, 11.4 kilometres from Perth Station serving the suburb of Queens Park, Western Australia.
History
Queens Park Station opened in 1899 as Woodlupine, being renamed Queens Park on 16 April 1912.
In 2012, the station was refurbished.
Future
As part of a Metronet project for several level crossing removals on the Armadale line, Queens Park Station will be rebuilt as an elevated station and the Hamilton Street and Wharf Street level crossings will be replaced with elevated rail. The planned design has Queens Park Station about closer to Hamilton Street, and the passenger car park underneath the elevated railway. The new station will initially be accessed via stairs and lifts, and its design will allow escalators and fare gates to be added in the future. The new station platforms will be side platforms, as opposed to the current island platforms. This is to reduce the impact of the bridge structure on the surrounding area. The platforms will also be built to the length of a six-car train, as opposed to the current station which only has a length of a four-car train.
Services
Queens Park Station is served by Transperth Armadale and Thornlie line services.
The station saw 238,960 passengers in the 2013-14 financial year.
This station is also served by the twice daily B pattern which is meant as a school special
Platforms
References
External links
Gallery History of Western Australian Railways & Stations
Armadale and Thornlie lines
Transperth railway stations
Railway stations in Australia opened in 1899 |
https://en.wikipedia.org/wiki/Remote%20backup%20service | A remote, online, or managed backup service, sometimes marketed as cloud backup or backup-as-a-service, is a service that provides users with a system for the backup, storage, and recovery of computer files. Online backup providers are companies that provide this type of service to end users (or clients). Such backup services are considered a form of cloud computing.
Online backup systems are typically built for a client software program that runs on a given schedule. Some systems run once a day, usually at night while computers aren't in use. Other newer cloud backup services run continuously to capture changes to user systems nearly in real-time. The online backup system typically collects, compresses, encrypts, and transfers the data to the remote backup service provider's servers or off-site hardware.
There are many products on the market – all offering different feature sets, service levels, and types of encryption. Providers of this type of service frequently target specific market segments. High-end LAN-based backup systems may offer services such as Active Directory, client remote control, or open file backups. Consumer online backup companies frequently have beta software offerings and/or free-trial backup services with fewer live support options.
History
In the mid-1980s, the computer industry was in a great state of change with modems at speeds of 1200 to 2400 baud, making transfers of large amounts of data slow (1 MB in 72 minutes). While faster modems and more secure network protocols were in development, tape backup systems gained in popularity. During that same period the need for an affordable, reliable online backup system was becoming clear, especially for businesses with critical data.
More online/remote backup services came into existence during the heyday of the dot-com boom in the late 1990s. The initial years of these large industry service providers were about capturing market share and understanding the importance and the role that these online backup providers were playing in the web services arena. Today, most service providers of online backup services position their services using the SaaS (software as a service) and PaaS (Platform as a service) strategy and its relevance is predicted to increase exponentially in the years to come as personal and enterprise data storage needs rise. The last few years have also witnessed a healthy rise in the number of independent online backup providers.
Characteristics
Service-based
The assurance, guarantee, or validation that what was backed up is recoverable whenever it is required is critical. Data stored in the service provider's cloud must undergo regular integrity validation to ensure its recoverability.
Cloud BUR (BackUp & Restore) services need to provide a variety of granularity when it comes to RTO's (Recovery Time Objective). One size does not fit all either for the customers or the applications within a customer's environment.
The customer should never have to mana |
https://en.wikipedia.org/wiki/List%20of%20Slovenian%20computer%20scientists | This is a list of the best-known Slovenian computer scientists.
B
Vladimir Batagelj (1948–)
Ivan Bratko (1946–)
J
Primož Jakopin
L
Ivo Lah (1896–1979)
Jure Leskovec
M
Andrej Mrvar
P
Marko Petkovšek (1955–)
Tomaž Pisanski (1949–)
Bogdan Pogorelc
T
Denis Trček (1965–)
V
Jurij Vega (1754–1802)
Z
Egon Zakrajšek (1941–2002)
Aleš Žiberna
See also
List of Slovenians
References
Computer scientists
Slovenian |
https://en.wikipedia.org/wiki/Slackpkg | slackpkg is a software tool for installing or upgrading packages automatically through a network or over the Internet for Slackware. slackpkg was included in the main tree in Slackware 12.2 in 2008 - previously it had been included in since Slackware 9.1, which was released in 2003. It is licensed under the GNU General Public License (GPL).
slackpkg is an automated package management tool written for Slackware as a shell script, like Swaret. It was designed to make a Slackware system administrator's job easier by allowing routine package management tasks to be accomplished in a single command. slackpkg does not replace the Slackware package management tools such as installpkg and upgradepkg; rather it uses them.
Some of the features of slackpkg include automated package installation, upgrading and searching. Many of these features, such as package deinstallation, can be performed more directly by using the Slackware package tools themselves, though their incorporation in slackpkg provides a more consistent user interface.
Slackpkg does not resolve dependencies between packages, like rpm from Fedora and openSUSE. Only third-party applications, such as slapt-get, have an automated package relation management.
See also
pkgtool
slapt-get
References
External links
Free package management systems
Linux package management-related software
Linux-only free software
Slackware |
https://en.wikipedia.org/wiki/Silverdale%20railway%20station | Silverdale is a railway station on the Furness Line, which runs between and . The station, situated north-west of Lancaster, serves the village of Silverdale in Lancashire. It is owned by Network Rail and managed by Northern Trains.
Facilities
There is no footbridge or underpass; passengers cross the line at track level via a barrow crossing (so disabled travellers are not recommended to use the southbound platform without assistance). The station buildings have been converted for residential use, but there are shelters on each side. There is a small car park. A ticket machine is available, so travellers can purchase tickets (or a permit to travel if not in possession of a credit or debit card) here prior to boarding. Train running information is provided via digital information displays and timetable posters.
The station is about from the centre of the village by road, somewhat less by footpaths across the golf course and fields.
The station is conveniently situated for visitors to Leighton Moss RSPB reserve, a few minutes' walk away, and Silverdale Golf Club, just across the road from the station. In June 2018, volunteers helped to set up a community-provided broadband link using the wifi from the nearby golf club and equipment supplied by Broadband for the Rural North (B4RN).
Services
Silverdale is generally served by the hourly Furness Line services from to operated by Northern who also manage the station. Several longer-distance trains to (via Millom) and via Preston and Manchester Piccadilly call at the station throughout the day.
Friends of Silverdale Station
In 2015, the Friends of Silverdale Station (FOSS) was founded, with the intention of improving and enhancing the station. The group has held working parties to tidy the platforms and plant flowerbeds, and hopes to restore the 1850s Furness Railway waiting room for community use.
References
External links
Railway stations in Lancaster
DfT Category F2 stations
Former Ulverston and Lancaster Railway stations
Railway stations in Great Britain opened in 1857
Northern franchise railway stations
1857 establishments in England
railway station |
https://en.wikipedia.org/wiki/Binder | Binder may refer to:
Businesses
Binder FBM, a former German jewelry manufactory
Binder Dijker Otte & Co., the expansion of "BDO" in BDO International
Computing
Binder Project, package and share interactive, reproducible environments
File binder, software that binds files into one executable
Microsoft Binder, a discontinued Microsoft Office application
OpenBinder, a system for inter-process communication
Geography
Binder, Khentii, a district of Khentii Province in eastern Mongolia
Binder, an abandoned village in Germany at the site of Hunnesrück
Stationery
Binder (rubber band)
Binder clip, a small device for holding together sheets of paper
Ring binder, a device to hold together multiple sheets of paper with punched-in holes
Other uses
Binder (material), any material or substance that holds or draws other materials together
Binder (surname), a surname
Binder Twine Festival, an annual festival in Kleinburg, Ontario
Phosphate binder, a medication used to reduce the absorption of phosphate
Reaper-binder, a type of farm equipment
A garment or bandage used for breast binding
A base class in the role-playing game Dungeons & Dragons
Insurance Binder, a contract of a temporary insurance policy
The film-forming component of paint
See also
Binding (disambiguation)
Bind (disambiguation) |
https://en.wikipedia.org/wiki/Arnside%20railway%20station | Arnside is a railway station on the Furness Line, which runs between and . The station, situated north-west of Lancaster, serves the village of Arnside in Cumbria. It is owned by Network Rail and managed by Northern Trains.
A short distance west of the station, the railway crosses the River Kent on an impressive 50-span viaduct that is some long. The historic structure underwent major repairs and refurbishment, including the complete replacement of the rail deck in 2011. Similar work was carried out on the nearby Leven Estuary viaduct in the spring of 2006.
History
Opened on 1 August 1858 by the Ulverstone and Lancaster Railway (a company backed by, and later taken over by the Furness Railway) (FR), the station became part of the London, Midland and Scottish Railway during the Grouping of 1923. The station then passed on to the London Midland Region of British Railways on nationalisation in 1948.
When Sectorisation was introduced in the 1980s, the station was served by Regional Railways until the privatisation of British Rail.
A short branch line to Sandside and Hincaster Junction on the West Coast Main Line once diverged from the main line here, which carried a to Kendal local service from its opening in 1876 until 1942. In July 1922, this FR service ran five times per day in each direction on weekdays. The branch was also used by mineral trains from County Durham to the Barrow-in-Furness area, allowing them to avoid having to reverse direction at the busy junction at Carnforth. Local freight traffic continued as far as Sandside until final closure of the line in 1972. The disused platform face and trackbed is still visible behind the southbound platform.
Facilities
Whilst one building remains at the station, it is not in railway use. Shelters are provided for passengers on both platforms, but the only link between them is via a footbridge with stairs (no step-free access). Digital information screens, customer help points, timetable posters and automated announcements provide train running details. As the station is unstaffed, tickets can only be bought from the ticket machine or on the train.
Services
It is served by stopping trains between and Barrow, with some continuing to Sellafield or Carlisle via the Cumbrian Coast Line in the northbound direction and by some through services southbound to and . There is one train per hour in each direction on weekdays, although the varying nature of the stopping patterns of each service means the timetable is irregular. On Sundays there is a train every hour each way (up from a two-hourly frequency since May 2018).
References
Sources
Station on navigable Ordnance Survey map
External links
Railway stations in Cumbria
DfT Category F2 stations
Former Ulverston and Lancaster Railway stations
Railway stations in Great Britain opened in 1858
Northern franchise railway stations
Arnside |
https://en.wikipedia.org/wiki/Reflection%20mapping | In computer graphics, environment mapping, or reflection mapping, is an efficient image-based lighting technique for approximating the appearance of a reflective surface by means of a precomputed texture. The texture is used to store the image of the distant environment surrounding the rendered object.
Several ways of storing the surrounding environment have been employed. The first technique was sphere mapping, in which a single texture contains the image of the surroundings as reflected on a spherical mirror. It has been almost entirely surpassed by cube mapping, in which the environment is projected onto the six faces of a cube and stored as six square textures or unfolded into six square regions of a single texture. Other projections that have some superior mathematical or computational properties include the paraboloid mapping, the pyramid mapping, the octahedron mapping, and the HEALPix mapping.
Reflection mapping is one of several approaches to reflection rendering, alongside e.g. screen space reflections or ray tracing which computes the exact reflection by tracing a ray of light and following its optical path. The reflection color used in the shading computation at a pixel is determined by calculating the reflection vector at the point on the object and mapping it to the texel in the environment map. This technique often produces results that are superficially similar to those generated by raytracing, but is less computationally expensive since the radiance value of the reflection comes from calculating the angles of incidence and reflection, followed by a texture lookup, rather than followed by tracing a ray against the scene geometry and computing the radiance of the ray, simplifying the GPU workload.
However, in most circumstances a mapped reflection is only an approximation of the real reflection. Environment mapping relies on two assumptions that are seldom satisfied:
All radiance incident upon the object being shaded comes from an infinite distance. When this is not the case the reflection of nearby geometry appears in the wrong place on the reflected object. When this is the case, no parallax is seen in the reflection.
The object being shaded is convex, such that it contains no self-interreflections. When this is not the case the object does not appear in the reflection; only the environment does.
Environment mapping is generally the fastest method of rendering a reflective surface. To further increase the speed of rendering, the renderer may calculate the position of the reflected ray at each vertex. Then, the position is interpolated across polygons to which the vertex is attached. This eliminates the need for recalculating every pixel's reflection direction.
If normal mapping is used, each polygon has many face normals (the direction a given point on a polygon is facing), which can be used in tandem with an environment map to produce a more realistic reflection. In this case, the angle of reflection at a given point on a |
https://en.wikipedia.org/wiki/Edmonton%20Journal | The Edmonton Journal is a daily newspaper in Edmonton, Alberta, Canada. It is part of the Postmedia Network.
History
The Journal was founded in 1903 by three local businessmen — John Macpherson, Arthur Moore and J.W. Cunningham — as a rival to Alberta's first newspaper, the 23-year-old Edmonton Bulletin. Within a week, the Journal took over another newspaper, The Edmonton Post, and established an editorial policy supporting the Conservative Party against the Bulletins stance for the Liberal Party. In 1912, the Journal was sold to the Southam family. It remained under Southam ownership until 1996, when it was acquired by Hollinger International. The Journal was subsequently sold to Canwest in 2000, and finally came under its current ownership, Postmedia Network Inc., in 2010.
In 1905, The Journal began operating from a building on the corner of a lot on 102nd Avenue and 101st Street. Its present location at 101st Street and 100th Avenue was established in 1921, and Alberta's first radio station, CJCA, began broadcasting from the building a year later.
In 1937, the Journal came into conflict with Alberta Premier William Aberhart's attempt to pass the Accurate News and Information Act requiring newspapers to print government rebuttals to stories the provincial cabinet deemed "inaccurate." After successfully fighting the law, the Journal became the first non-American newspaper to be honoured by the Pulitzer Prize committee, receiving a special bronze plaque in 1938 for defending the freedom of the press.
After the Bulletin folded in 1951, the Journal was left as Edmonton's oldest and only remaining daily newspaper. The monopoly continued until the Edmonton Sun began publishing in 1978.
In 1982, government officials under the Combines Investigation Act entered and searched the paper's offices under the suspicion that Southam Newspapers was violating federal legislation by engaging in unfair trading and anti-competitive business practices. The Alberta Court of Appeal ruled the search to be inconsistent with the Charter of Rights and Freedoms, a decision the Supreme Court of Canada upheld in Hunter v Southam Inc.
Present day
Today, the Journal publishes six days a week, with regular sections including News (city, Canada, and world), Sports, Opinion, A&E, Life, and Business. The newspaper participated in the Critics and Awards Program for High School Students (Cappies),, now called the Alberta Youth Theatre Collective, and has partnerships with a number of arts organizations in Edmonton, including the Edmonton Symphony Orchestra and the Alberta Ballet Company. It also supports community events such as the Canspell National Spelling Bee.
The Journal has also begun operating under a new commitment to digital media in addition to traditional print.
Circulation
The Edmonton Journal has seen like most Canadian daily newspapers a decline in circulation. Its total circulation dropped by percent to 92,542 copies daily from 2009 to 2015.Daily averag |
https://en.wikipedia.org/wiki/EDonkey%20network | The eDonkey Network (also known as the eDonkey2000 network or eD2k) is a decentralized, mostly server-based, peer-to-peer file sharing network created in 2000 by US developers Jed McCaleb and Sam Yagan that is best suited to share big files among users, and to provide long term availability of files. Like most sharing networks, it is decentralized, as there is no central hub for the network; also, files are not stored on a central server but are exchanged directly between users based on the peer-to-peer principle.
The server part of the network is proprietary freeware. There are two families of server software for the eD2k network: the original one from MetaMachine, written in C++, closed-source and proprietary, and no longer maintained; and eserver, written in C, also closed-source and proprietary, although available free of charge and for several operating systems and computer architectures. The eserver family is currently in active development and support, and almost all eD2k servers as of 2008 run this server software.
There are many programs that act as the client part of the network. Most notably, eDonkey2000, the original client by MetaMachine, closed-source but freeware, and no longer maintained but very popular in its day; and eMule, a free program for Windows written in Visual C++ and licensed under the GNU GPL.
The original eD2k protocol has been extended by subsequent releases of both eserver and eMule programs, generally working together to decide what new features the eD2k protocol should support. However, the eD2k protocol is not formally documented (especially in its current extended state), and it can be said that in practice the eD2k protocol is what eMule and eserver do together when running, and also how eMule clients communicate among themselves. As eMule is open source, its code is freely available for peer-review of the workings of the protocol. Examples of eD2k protocol extensions are "peer exchange among clients", "protocol obfuscation" and support for files larger than 4 gigabytes, etc. The other eD2k client programs, given time, generally follow suit adopting these protocol extensions.
eDonkey client programs connect to the network to share files. eDonkey servers act as communication hubs for the clients, allowing users to locate files within the network. Clients and servers are available for Windows, Mac OS X, Linux, and other Unix-like operating systems. By running an eDonkey server program on a machine connected to the Internet, any user can add a server to the network. As the number of servers and their addresses change frequently, client programs update their server lists regularly.
Features
Hash identification
Files on the eDonkey network are uniquely identified using MD4 root hash of an MD4 hash list of the file. This treats files with identical content but different names as the same, and files with different contents but same name as different.
Files are divided in full chunks of 9,728,000 bytes ( |
https://en.wikipedia.org/wiki/KYAZ | KYAZ (channel 51) is a television station licensed to Katy, Texas, United States, serving as the Houston area outlet for the classic television network MeTV. Owned and operated by Weigel Broadcasting, the station maintains studios at One Arena Place on Bissonnet Street on Houston's southwest side, and its transmitter is located near Missouri City, Texas.
History
Early history
The station first signed on the air on November 3, 1993 as KNWS-TV, a 24-hour all-news station that was owned by Johnson Broadcasting. The all-news format featured special segments, and pre-recorded newscasts that were looped, then updated, throughout the day. During 1995, KNWS simulcast live coverage of the O. J. Simpson murder trial from KTLA in Los Angeles.
KNWS began cutting back on its news programming in November 1996; following a canceled sale to home shopping operator Global Broadcasting Systems in 1997, the station abandoned its all-news format entirely on January 1, 1998, and became a traditional independent station, broadcasting syndicated classic television series and movies, as well as Houston Astros baseball games (many of the games were also simulcast on sister station KLDT in Lake Dallas, Texas). It also maintained local news updates, using the remains of the station's old newsroom. During this time, the station adopted the slogan "TV 51 Has The Shows You Know". By 2000, however, some of the programming had been dropped in favor of infomercials, a trend that would continue over the next decade. The Astros remained on KNWS until 2008, when the team's game telecasts moved to KTXH (channel 20).
Some NBC shows that KPRC-TV (channel 2) declined to air also aired on KNWS. Two such NBC programs were the daytime talk show Leeza, which briefly aired on KNWS in 1998, and the soap opera Passions, which also briefly aired on the station in 2001. In 1996, KNWS carried NBC Sports coverage of Notre Dame football home games as well as the Breeders' Cup. In 2000, KNWS carried Game 6 of the American League Championship Series (coincidentally, the last MLB game aired by NBC to date).
During the non-stop coverage of 2005's Hurricane Rita on Houston's news-producing stations, KNWS carried CBS network programs, on behalf of its local affiliate, KHOU (channel 11), which preempted them in order to run special coverage of the storm. KNWS repeated this pattern during Hurricane Ike.
Prior to the Una Vez Más sale, KNWS had made plans to add the Retro Television Network on a digital subchannel, but due to the bankruptcy filing, that plan was scrapped. Instead, reflecting the pending sale to Una Vez Más, an Azteca América subchannel was added to the station's digital signal as channel 51.2 on April 25, 2010. RTV ended up on KUVM-CD, a Mako Communications station, and the previous affiliate of Azteca América in Houston.
Sale to Una Vez Más
Johnson Broadcasting filed for bankruptcy protection in October 2008. One year later, impatient creditors asked the bankruptcy court to allow the |
https://en.wikipedia.org/wiki/WUDT-LD | WUDT-LD (channel 23) is a low-power television station in Detroit, Michigan, United States, owned and operated by the Daystar Television Network. The station's transmitter is located at 8 Mile and Meyers Road in suburban Oak Park.
History
The station took to the air on January 4, 1989, as low-power W05BN on channel 5. It then became WBXD-LP on September 1, 1995, reflecting its affiliation with, and ownership by, The Box, which was acquired by Viacom in 1999 and merged into its MTV2 in 2001. The sale to Viacom put WBXD under the same ownership as UPN station WKBD (channel 50) and, after Viacom's merger with CBS, WWJ-TV (channel 62).
On January 30, 2001, the station moved to channel 35 and then to channel 23 on July 12, 2001. Then on June 27, 2002, the station began operating at class A status, giving it the call sign WBXD-CA.
Viacom sold WBXD-CA to Equity Broadcasting in November 2004. The new owners renamed the station WUDT-CA, and made the station an affiliate of Univision. In 2007, Equity Broadcasting was renamed Equity Media Holdings Corporation. WUDT-CA was the first Spanish-language television station to take to the air in the state of Michigan since W66BV, Detroit's prior Univision affiliate, became a TBN translator in the early-1990s.
During its time with Univision, WUDT was also one of only three stations affiliated with the network (along with KUNS-TV in Seattle and Univision O&O WQHS-TV in Cleveland) in markets bordering Canada. Univision's over-the-air presence in Detroit made Detroit/Windsor the only market in the United States or Canada with terrestrial stations in English, Spanish and French—the French station was Radio-Canada owned-and-operated station CBEFT on channel 35, a former originating station which rebroadcast Toronto's CBLFT-DT before going dark in 2012.
WUDT's master control was remotely originated via satellite from Equity's headquarters in Little Rock, Arkansas. Equity maintained a local news and advertising sales office at 5600 King Street in Troy. The station had limited backup signal transmission arrangements; during several instances of bad weather, WUDT-CA often broadcast either a black screen or a "NO SIGNAL" message.
On March 28, 2007, Comcast added WUDT to its Detroit lineup on channel 65, replacing the network's national East Coast feed, which had been carried since the 1980s when Comcast in the Detroit area was split up between several companies (for example, it was known as Barden Cablevision in Detroit proper and Inkster; Cablevision Industries in Dearborn; Continental Cablevision in Southfield, Dearborn Heights, Madison Heights and Hazel Park; Harron Cable in Port Huron; Omnicom in far western Wayne County (including Canton Charter Township) and Hamtramck; Maclean Hunter in many Downriver communities; and TCI in several Oakland County suburbs and the Downriver communities of Lincoln Park, Riverview, Woodhaven, Trenton and Gibraltar), and when Univision was known as the Spanish International Network ( |
https://en.wikipedia.org/wiki/Eventual%20consistency | Eventual consistency is a consistency model used in distributed computing to achieve high availability that informally guarantees that, if no new updates are made to a given data item, eventually all accesses to that item will return the last updated value. Eventual consistency, also called optimistic replication, is widely deployed in distributed systems and has origins in early mobile computing projects. A system that has achieved eventual consistency is often said to have converged, or achieved replica convergence. Eventual consistency is a weak guarantee – most stronger models, like linearizability, are trivially eventually consistent.
Eventually-consistent services are often classified as providing BASE semantics (basically-available, soft-state, eventual consistency), in contrast to traditional ACID (atomicity, consistency, isolation, durability). In chemistry, a base is the opposite of an acid, which helps in remembering the acronym. According to the same resource, these are the rough definitions of each term in BASE:
Basically available: reading and writing operations are available as much as possible (using all nodes of a database cluster), but might not be consistent (the write might not persist after conflicts are reconciled, and the read might not get the latest write)
Soft-state: without consistency guarantees, after some amount of time, we only have some probability of knowing the state, since it might not yet have converged
Eventually consistent: If we execute some writes and then the system functions long enough, we can know the state of the data; any further reads of that data item will return the same value
Eventual consistency is sometimes criticized as increasing the complexity of distributed software applications. This is partly because eventual consistency is purely a liveness guarantee (reads eventually return the same value) and does not guarantee safety: an eventually consistent system can return any value before it converges.
Conflict resolution
In order to ensure replica convergence, a system must reconcile differences between multiple copies of distributed data. This consists of two parts:
exchanging versions or updates of data between servers (often known as anti-entropy); and
choosing an appropriate final state when concurrent updates have occurred, called reconciliation.
The most appropriate approach to reconciliation depends on the application. A widespread approach is "last writer wins". Another is to invoke a user-specified conflict handler. Timestamps and vector clocks are often used to detect concurrency between updates. Some people use "first writer wins" in situations where "last writer wins" is unacceptable.
Reconciliation of concurrent writes must occur sometime before the next read, and can be scheduled at different instants:
Read repair: The correction is done when a read finds an inconsistency. This slows down the read operation.
Write repair: The correction takes place during a write opera |
https://en.wikipedia.org/wiki/Cromford%20railway%20station | Cromford railway station is a Grade II listed railway station owned by Network Rail and managed by East Midlands Railway. It is located in the village of Cromford in Derbyshire, England. The station is on the Derwent Valley Line north of Derby towards Matlock.
History
Originally known as Cromford Bridge, it was opened by the Manchester, Buxton, Matlock and Midland Junction Railway in 1849. This is one of the few stations on the line that has been preserved and is a Grade 2 listed building. It is said to have been designed by G. H. Stokes, son-in-law of Joseph Paxton. It is believed that Stokes designed Station House (built in 1855), the extremely ornate former station master's residence opposite the station on the side of the hill as well as the ornate villa style waiting room, on what was the 'up' platform. According to English Heritage, this is the original station building. The present station building on the opposite (down) platform was added by the Midland Railway at a later date
Willersley Tunnel, which is long, is situated immediately north of the station.
The disused southbound platform was used for cover of the 1995 Oasis single "Some Might Say".
Following many years of neglect and decline, a long lease on the main station building was purchased by the Arkwright Society; the building has been restored and improved, re-opening as office space in May 2009. Station House, of which the old waiting room is a part, is now self-contained holiday accommodation.
In the year from 1 April 2009 to 31 March 2010, journeys from the station had increased by 16.88%.
On 17 September 2009, taxi driver Stuart Ludlam was murdered at the station by gun fanatic Colin Cheetham.
Station masters
On 18 January 1853, the station master William Lees was summoned by Joseph Wain, a clark employed by the railway at Matlock Bath, for having beaten him. It transpired that bad feeling had previously existed between the plaintiff and defendant; on 15 January 1853, they had met on the causeway between Matlock Bath and Cromford, close to the Glenorchy chapel. Both of them were on the pavement and a dispute arose between them as to the etiquette of taking the wall. Wain accused Lees of beating hum repeatedly but Lees denied it. The following year William Lees left Cromford. The Derbyshire Courier of 25 November 1854 reported that
William Lees 1849 - 1854
Edwin Furniss ca 1859 - 1881
R. J. Oram 1881 - 1888 (afterwards station master at Chorlton-cum-Hardy)
Lewis Wright 1888 - 1894 (afterwards station master at Edale)
Harry l’Anson 1894 - 1898 (afterwards station master at Chinley)
H. V. Weston 1898 - 1902 (afterwards station master at Cheadle Heath)
J. G. Goss 1902 - 1907 (afterwards station master at Bamford)
Thomas Cooper 1907 - 1913 (formerly station master at Hazel Grove, afterwards station master at Belle Vue, Manchester)
William Brown 1913 - 1921
Walter Best from 1921
Harry Huntington ca. 1948 until 1957 (afterwards station master at Wennington)
A. C. Philli |
https://en.wikipedia.org/wiki/Whatstandwell%20railway%20station | Whatstandwell railway station is a railway station owned by Network Rail and managed by East Midlands Railway. It serves the villages of Whatstandwell and Crich Carr in Derbyshire, England. The station is located on the Derwent Valley Line from Derby to Matlock.
There is a ticketing machine on the single platform; a full range of tickets for travel for any destination in the country can be also purchased from the guard on the train at no extra cost.
History
It was opened by the Manchester, Buxton, Matlock and Midland Junction Railway as 'Whatstandwell Bridge' on 4 June 1849, though it was not listed in the timetable until 1853. It was north of the Whatstandwell Tunnel, behind the Derwent Hotel.
On 4 October 1853 a luggage train was on its way from Rowsley to Ambergate and at Whatstandwell was put into a siding to collect some empty wagons. It derailed and a breakdown crew was sent for from Derby. With this assistance, the train was re-railed and set off for Ambergate. The break down train which had come from Derby was standing on the wrong line for returning to Derby. Instead of continuing for 1/2 a mile to cross onto the correct line they determined to return to Derby on the wrong line, calculating that they would get back before anything started out from Derby. They ignored the rules of the company which required a fireman walking 800 yards in advance of the train and proceeding at a walking pace. Instead they travelled at full speed. They collided with another engine and Michael Barker, a fireman, was killed. Samuel Kent, George Cawood and John Smeeton were indicted for his manslaughter. They were found guilty at the Midland Assizes on 18 March 1854. Kent was sentenced by Lord Chief Justice Jervis to 18 months’ imprisonment and hard labour and the others got 12 months each.
The station was moved to its present location in 1894 when the name became 'Whatstandwell'. The platform at the original station still exists. The area was used as a goods yard after the present station was built. The contractor for the new station was W.C. Hardy of Derby. The new station opened on 11 November 1894.
A little way north was High Peak Junction at the base of the former rope-worked incline of the Cromford and High Peak Railway.
Stationmasters
Thomas Stevenson ca. 1853 ca. 1854
Robert Turner ca. 1857 - 1860
Luke Fox 1860 - 1864 (afterwards station master at Cudworth)
S. Greenhough from 1864
William Webster ca. 1871 - 1873 (afterwards station master at Chapel-en-le-Frith)
Brierly Ayton 1873 (formerly station master at Beauchief, appointed to Whatstandwell but died 27 February 1873)
William T. Stowell 1873 - 1876 (formerly station master at Wixford, afterwards station master at Crosby Garrett)
Edwin Hoe 1876 - 1879 (afterwards station master at Finedon)
George Simmons 1879 - 1883
Fred Watkin 1883 - 1887 (formerly station master at Stirchley Street, afterwards station master at Shefford)
Charles Whitmore 1887 - 1896 (formerly station master at Ratby)
H.T |
https://en.wikipedia.org/wiki/Marc%20LeBlanc | Marc "Mahk" LeBlanc is an educator and designer of video games.
LeBlanc attended MIT where he received a B.S. and M.S. in Computer Science.
Through his work with Looking Glass Studios, LeBlanc contributed to a number of important video game titles including Ultima Underworld II, System Shock, Flight Unlimited, Terra Nova, and Thief.
After Looking Glass, LeBlanc went to work for Sega, developing artificial intelligence for the Visual Concepts line of sports games. In 2003, LeBlanc went to work for Mind Control Software, where, with Andrew Leker, he co-developed Oasis, which won an Independent Games Festival award. In addition, LeBlanc has participated in a number of Indie Game Jams.
LeBlanc has led a number of Game Design Tuning Workshops at the Game Developers Conference, where he explores his theories on game design, specifically the Mechanics/Dynamics/Aesthetics (MDA) framework. MDA is based in part on the Formal Abstract Design Tools for games discussion initiated by Doug Church. LeBlanc runs a site, 8kindsoffun.com, including the MDA work and his breakdown of "fun" for game design.
8 Kinds of Fun
In his work on 8 kinds of fun, LeBlanc explains that when describing fun we should steer away from vague words such as "gameplay" and "fun". Instead he suggests that a more direct vocabulary should be used. This includes but is not limited to the taxonomy listed below:
Sensation: Game as sense-pleasure. Games that evoke emotion in the player, be it through sound, visuals, controller rumble or physical effort. Examples: Dead Space, Dance Dance Revolution, Candy Crush Saga
Fantasy: Game as make-believe. Game as a means to take the player to another world. Some call it escapism. Examples: Final Fantasy, Nier: Automata, The Legend of Zelda
Narrative: Game as drama. Game as a means to tell a story or narrative to the player. Examples: The Walking Dead, Persona 3, Dear Esther
Challenge: Game as obstacle course. Games that provide the player(s) with highly competitive value or with increasingly difficult challenges. Examples: Dark Souls, Tetris, X-COM
Fellowship: Game as social framework. Games that have social interactions as its core or as a big feature. Examples: Mario Kart, Destiny, World of Warcraft
Discovery: Game as uncharted territory. Games in which the player explores a world. Examples: Uncharted, Tomb Raider, Assassin's Creed
Expression: Game as self-discovery. Games that allow for self-expression from the player through gameplay. Examples: Minecraft, Garry's Mod, Roblox
Submission: Game as pastime. Games that have "farming" or "grinding" as a core element. Examples: FarmVille, Hyperdimension Neptunia, Disgaea
A game does not need to have only one of the above, nor all of them. Just because these are different kinds of fun does not mean that everyone finds all eight of these things fun at all. Not only do different games provide different combinations and relative quantities of the various kinds of fun, but different players find d |
https://en.wikipedia.org/wiki/U.S.%20Cellular | United States Cellular Corporation (doing business as UScellular and formerly known as U.S. Cellular) is an American mobile network operator. It is a subsidiary of Telephone and Data Systems Inc. (which owns an 84% stake). The company was formed in 1983 and is headquartered in Chicago, Illinois. UScellular is the fifth-largest wireless carrier in the United States, with 4,656,000 subscribers in 426 markets in 21 states as of the 2nd quarter of 2023. The organization was previously known as United States Cellular Corporation and U.S. Cellular.
History
1980s & 1990s
United States Cellular was founded as a subsidiary of Telephone and Data Systems Inc. (TDS) and incorporated on December 23, 1983. began operations in Knoxville, Tennessee (June), and Tulsa, Oklahoma (August). The company went public in 1988 where United States Cellular adopted USM as its ticker symbol on the American Stock Exchange. In 1999, United States Cellular relaunched under the “U.S. Cellular” brand name and image across all markets nationwide.
2000s
The company purchased PrimeCo Wireless Communications in 2002 and launched in the Chicago area on November 22. It built on this growth by signing Chicagoan Joan Cusack as national spokesperson. In January 2003, U.S. Cellular acquired naming rights to the baseball stadium used by the Chicago White Sox. Formerly known as Comiskey Park, the stadium was officially renamed U.S. Cellular Field (it was renamed Guaranteed Rate Field in 2016). That same year, U.S. Cellular and Cingular (now owned by AT&T Mobility) exchanged wireless assets and U.S. Cellular received new spectrum in markets of 13 states. In 2005, U.S. Cellular entered the St. Louis market, making it the second largest market U.S. Cellular served, after Chicago. In October 2008, U.S. Cellular launched Mobile Broadband, a service enabling customers to access data on its cell phones 10 times faster than before. It brought DSL-like service and capabilities to customers through EVDO (Evolution-Data Optimized) technology, commonly referred to as 3G. As of Q2 2008, U.S. Cellular was preparing to roll out 3G/EVDO revision A to select markets.
2010s
In May 2011, U.S. Cellular announced that it will offer 4G LTE. In a surprising move, U.S. Cellular announced the sale of several markets to Sprint Corporation including Chicago. June 2016, Google announced that it partnered with U.S. Cellular as part of its Google Fi service. U.S. Cellular contributed its network and LTE service to the "network of networks" along with T-Mobile US and Sprint Corporation.
2020s
In March 2020, U.S. Cellular debuted launch of 5G in Wisconsin and Iowa U.S. Cellular rebranded as UScellular and upgraded its logo in the fall of that year.
In February 2023, U.S. Cellular discontinued its partnership with Google Fi in a statement saying "We will no longer be an official network partner of Google Fi," US Cellular senior manager of media relations Katie Frey told CNET over email. "We value our relationship |
https://en.wikipedia.org/wiki/Kad%20network | The Kad network is a peer-to-peer (P2P) network which implements the Kademlia P2P overlay protocol. The majority of users on the Kad Network are also connected to servers on the eDonkey network, and Kad Network clients typically query known nodes on the eDonkey network in order to find an initial node on the Kad network.
Usage
The Kad network uses a UDP-based protocol to:
Find sources for eD2k hashes.
Search for eD2k hashes based on keywords in the file name.
Find comments and ratings for files (hashes).
Provide buddy services for firewalled (Low ID) nodes.
Store locations, comments and (keywords out of) filenames.
Note that the Kad network is not used to actually transfer files across the P2P network. Instead, when a file transfer is initiated, clients connect directly to each other (using the standard public IP network). This traffic is susceptible to blocking/shaping/tracking by an ISP or any other opportunistic middle-man.
As with all decentralized networks, the Kad network requires no official or common servers. As such, it cannot be disabled by shutting down a given subset of key nodes. While the decentralization of the network prevents a simple shut-down, traffic analysis and deep packet inspection will more readily identify the traffic as P2P due to the high variable-destination packet throughput. The large packet volume typically causes a reduction in available CPU and/or network resources usually associated with P2P traffic.
Clients
Client search
The Kad network supports searching of files by name and a number of secondary characteristics such as size, extension, bit-rate, and more. Features vary based on client used.
Major clients
Only a few major clients currently support the Kad network implementation. However, they comprise over 80% of the user base and are probably closer to 95% of ed2k installations.
eMule: An open source Windows client which is the most popular, with 80% of network users. It also runs on Linux using the Wine libraries.
There are a number of minor variants, or forks, of eMule which support the same basic features as eMule itself. They include: aMule (A Linux client similar to eMule) and eMule Mods (not eMule Plus), possibly others.
aMule: An open source client popular among Linux Operating Systems. Currently aMule (officially) supports a wide variety of platforms and operating systems.
MLDonkey: An open source, cross-platform client that runs on many platforms and supports numerous other file-sharing protocols as well.
iMule: An anonymous, open source, cross-platform client. Supports only the Kad network and I2P network. eDonkey network has been dropped.
Lphant: Supports also eDonkey network and BitTorrent protocol. To use Kad network make sure you have 3.51 version.
Malware/virus
TDL-4: A botnet virus that is reported to use this network as a backup for updates and new instructions if its Command and Control servers are taken down.
See also
Distributed hash table
Kademlia
References
E |
https://en.wikipedia.org/wiki/Computer%20literacy | Computer literacy is defined as the knowledge and ability to use computers and related technology efficiently, with skill levels ranging from elementary use to computer programming and advanced problem solving. Computer literacy can also refer to the comfort level someone has with using computer programs and applications. Another valuable component is understanding how computers work and operate. Computer literacy may be distinguished from computer programming, which primarily focuses on the design and coding of computer programs rather than the familiarity and skill in their use. Various countries, including the United Kingdom and the United States, have created initiatives to improve national computer literacy rates.
Background
Computer literacy differs from digital literacy, which is the ability to communicate or find information on digital platforms. Comparatively, computer literacy measures the ability to use computers and to maintain a basic understanding of how they operate.
A person's computer literacy is commonly measured through questionnaires, which test their ability to write and modify text, trouble-shoot minor computer operating issues, and organize and analyze information on a computer.
To increase their computer literacy, computer users should distinguish which computer skills they want to improve, and learn to be more purposeful and accurate in their use of these skills. By learning more about computer literacy, users can discover more computer functions that are worth using.
Arguments for the use of computers in classroom settings, and thus for the promotion of computer literacy, are primarily vocational or practical. Computers are essential in the modern-day workplace. The instruction of computer literacy in education is intended to provide students with employable skills.
Rapid changes in technology make it difficult to predict the next five years of computer literacy. Computer literacy projects have support in many countries because they conform to general political and economic principles of those countries' public and private organizations. The Internet offers great potential for the effective and widespread dissemination of knowledge and for the integration of technological advances. Improvements in computer literacy facilitate this.
History
The term "computer literacy" is usually attributed to Arthur Luehrmann, a physicist at Dartmouth College who was a colleague of Kemeny and Kurtz who introduced the BASIC programming language in 1964. Luehrmann became a tireless advocate of computers in teaching. At an April 1972 American Federation of Information Processing Societies (AFIPS) conference, Luehrmann gave a talk titled "Should the computer teach the student, or vice-versa?" The paper is available online. In it he notes:
In 1978, Andrew Molnar was director of the Office of Computing Activities at the National Science Foundation in the United States. Shortly after its formation, computer literacy was discussed in se |
https://en.wikipedia.org/wiki/Free%20Spirit%20Alliance | The Free Spirit Alliance (FSA) is a non-profit spiritual networking organization serving the Pagan and pantheist communities. Founded on May 21, 1986 and based in the Mid-Atlantic area of the United States, FSA's focus has been presenting regional and local events where people from diverse backgrounds can learn and share ideas. Its promotional literature and website state that the organization has striven to develop a national reputation for being willing to work with often sensitive and personal issues in a friendly and safe environment.
FSA’s main event is the Free Spirit Gathering, held in June. The gathering is held at a private campground near Darlington, Maryland.
The Free Spirit Gathering is a program-driven outdoor festival which focuses upon magical and spiritual opportunities for the greater Pagan and magical communities. FSG places a strong emphasis on education, training, networking, celebration and fellowship. It attracts people from as far away as Washington, California, Hawaii, Texas, Minnesota and Canada. It is one of the oldest Pagan festivals in the country, celebrating its 35th year in 2020, and in peak years has had an attendance of over 800 people.
See also
Neopaganism in the United States
References
External links
Free Spirit Alliance official site
Free Spirit Gathering official site
1986 establishments in Maryland
Bel Air, Harford County, Maryland
Darlington, Maryland
Modern pagan festivals
Modern pagan organizations based in the United States
Pantheism
Religion in Maryland
Religious organizations established in 1986
Modern pagan organizations established in the 1980s |
https://en.wikipedia.org/wiki/QuickPar | QuickPar is a computer program that creates parchives used as verification and recovery information for a file or group of files, and uses the recovery information, if available, to attempt to reconstruct the originals from the damaged files and the PAR volumes.
Designed for the Microsoft Windows operating system, in the past it was often used to recover damaged or missing files that have been downloaded through Usenet. QuickPar may also be used under Linux via Wine.
There are two main versions of PAR files: PAR and PAR2. The PAR2 file format lifts many of its previous restrictions. QuickPar is freeware but not open-source. It uses the Reed-Solomon error correction algorithm internally to create the error correcting information.
Replacement
Since QuickPar hasn't been updated in years, it is considered abandonware.
Currently, MultiPar is accepted as the software that replaces QuickPar. MultiPar is actively being developed by Yutaka Sawada.
64-bit versions
At present the command line version of QuickPar for Linux command line is available as a 64-bit version. None of the GUI versions available presently offer a 64-bit version.
References
External links
QuickPar tutorial referencing Usenet downloads
Data management |
https://en.wikipedia.org/wiki/Curtis%20Roads | Curtis Roads (born May 9, 1951) is an American composer, author and computer programmer. He composes electronic and electroacoustic music, specializing in granular and pulsar synthesis.
Career and music
Born in Cleveland, Ohio, Roads studied composition at the California Institute of the Arts and the University of California San Diego. He is former chair and current vice chair of the Media Arts and Technology Program at the University of California, Santa Barbara. He has previously taught at the University of Naples "Federico II", Harvard University, Oberlin Conservatory, Les Ateliers UPIC (now CCMIX, Center for the Composition of Music Iannis Xenakis), and the University of Paris VIII.
He co-founded the International Computer Music Association in 1980 and edited the Computer Music Journal from 1978–2000. He has created software including PulsarGenerator and the Creatovox, both with Alberto de Campo.
Since 2004, he has been researching a new method of sound analysis called atomic decompositions, sponsored by the National Science Foundation (NSF).
The first movement of his composition Clang-Tint, "Purity", uses intervals from the Bohlen–Pierce scale.
Publications
Roads, Curtis (2015). Composing Electronic Music. Oxford University Press.
Roads, Curtis (2001). Microsound. Cambridge: MIT Press.
Roads, Curtis (1996). The Computer Music Tutorial. MIT Press.
Roads, Curtis, Pope, Stephen Travis, Piccialli, Aldo and De Poli, Giovanni, eds (1997). Musical Signal Processing. Routledge.
Roads, Curtis and Strawn, John, eds (1987). Foundations of Computer Music. MIT Press.
Compositions
POINT LINE CLOUD (2005) @Asphodel (Excerpt @ youtube)
Half-life (1998–1999)
Clang-Tint (1991–1994)
nscor (1980)
References
External links
Artist page
Wired.com article by Eliot Van Buskirk Hear Curtis Roads’ Subatomic Pop Symphonies (May 5 2008), accessed 16 February 2010
moderecords.com profile
Asphodel artist page
20th-century classical composers
American male classical composers
American classical composers
21st-century classical composers
Living people
University of California, San Diego alumni
Harvard University faculty
University of California, Santa Barbara faculty
Oberlin College faculty
21st-century American composers
1951 births
20th-century American composers
20th-century American male musicians
21st-century American male musicians |
https://en.wikipedia.org/wiki/AMC%20computerized%20engine%20control | The Computerized Engine Control or Computerized Emission Control (CEC) system is an engine management system designed and used by American Motors Corporation (AMC) and Jeep on 4- and 6-cylinder engines of its own manufacture from 1980 to 1990. It is one of the three major components for proper engine operation: the computer, electrically controlled carburetor, and the oxygen sensor in the exhaust system.
Starting with the 1986 model year, the AMC straight-4 engines used a throttle body injection (TBI) or single-point, fuel injection system with a new fully computerized engine control. In addition to cycling the fuel injector (pulse-width time, on–off), the engine control computer also determined the ignition timing, idle speed, exhaust gas recirculation, etc.
Operation
The AMC Computerized Engine Control is an electronic fuel feedback system is similar to those used by other automakers at the time by controlling the amount of gasoline to be atomized by the carburetor by precise electronic calculations. The AMC CEC was unique in that almost all of its sensors and actuators were digital; instead of the usual analog throttle position, coolant temperature, intake temperature, and manifold pressure sensors, it used a set of fixed pressure- and temperature-controlled switches (as well as a wide-open throttle switch on the carburetor) to control fuel mixture and ignition timing. The only analog sensor in the system was the oxygen sensor. In other respects, it was a typical "feedback" carburetor system of the early-1980s, using a stepper motor to control fuel mixture and a two-stage "Sole-Vac" (which used a solenoid for one stage, and a vacuum motor for the other) to control idle speed. The CEC also controlled ignition timing using information from the fuel-control section and an engine knock sensor on the intake manifold.
The CEC module itself (the most common version of which is the "AMC MCU Super-D") was manufactured for AMC by Ford Motor Company, and worked with a Duraspark ignition system. Although built by Ford, the CEC module is not related to the Ford EEC systems internally.
The AMC CEC went through at least four revisions.
The first included a "Check Engine" light.
The second included new process cycles with electric timing retard and the added "Pulse-Air" injection system for emissions control.
The third version was updated in 1983 to a new style called the C4 system which used a new microcontroller. The 1983 model year, the I6 engine featured the MCU-Super D electronics, "Pulse-Air", and an increased compression ratio, from 8.6:1 to 9.2:1.
The fourth version followed shortly.
Maintenance
The system uses a maze of emissions vacuum hoses. Because of the many vacuum-driven components and electrical connections in the system, CEC-equipped engines have developed a reputation of being hard to tune. American Motors issued a Technical Service Bulletin to diagnose low or inconsistent engine idle speeds on 1980 through 1988 AMC Eagle automobi |
https://en.wikipedia.org/wiki/Greek%20Research%20and%20Technology%20Network | The Greek Research and Technology Network or GRNET () is the national research and education network of Greece. GRNET S.A. gives internet connectivity, e-infrastructure and other services to the Greek Educational, Academic and Research community. Additionally, GRNET makes digital applications. It also provides services to the following sectors: Education, Research, Health, Culture. GRNET supports all Universities, Technological Education Institutes, Research Centers and over 9,500 schools.
The GRNET head office is located in Athens, Greece.
E-Infrastructures and Innovative Services
The GRNET backbone interconnects more than 100 institutions including all universities and technological institutions, research centers, public hospitals, museums and libraries, as well as the Greek School Network.
GRNET is present in global networking for research and education, representing Greece in GÉANT.
Large Scale Computing Services for Researchers (Cloud Computing)
GRNET offers Cloud Computing services that are available via the Infrastructure as a Service model, under the brand name “Okeanos” to promote academic, educational and research aims. These services are hosted on GRNET's own infrastructure and fall into the category of Infrastructure as a Service (IaaS). More specifically, the following cloud services are provided:
~Okeanos: Cloud Service with end users in the academic and research community powered by Synnefo, an IaaS cloud computing project.
ViMa: Virtual Private Server (VPS) Service provided to GRNET peers for hosting of services.
“~Okeanos” service provides academic users the ability to create a multi-layer virtual infrastructure and instantiate virtual computing machines, local networks, and a storage space inside the virtual machine. The Cloud Computing infrastructure and services of GRNET have been made available to the pan-European R&E community via the “okeanos-global” service.
Hellenic High Performance Computing Infrastructure
The GRNET “ARIS” is a national high-performance computing infrastructure providing scientists with additional computational power, storage space and software (pre-installed compilers, scientific libraries and popular scientific application suites) to assist the development and execution of scientific applications.
The system went into pilot operational phase in June 2015, and it is available for research-related use to researchers and scientists across Greek universities, technological institutions and research centers.
GR-IX
GRNET operates the Greek Internet Exchange (GR-IX). GR-IX interconnects Internet Service Providers, content providers and other entities and facilitates the exchange of IP traffic among them.
International activities
GRNET participates in international projects funded by the European Union. It also participates in regional and European projects which aim to bridge the digital divide between countries of South-East Europe and the rest of Europe, such as the SEEREN and SEEFIRE projec |
https://en.wikipedia.org/wiki/Extension%20%28Mac%20OS%29 | On the classic Mac OS (the original Apple Macintosh operating system), extensions were small pieces of code that extended the system's functionality. They were run initially at start-up time, and operated by a variety of mechanisms, including trap patching and other code modifying techniques. Initially an Apple developer hack, extensions became the standard way to provide a modular operating system. Large amounts of important system services such as the TCP/IP network stacks (MacTCP and Open Transport) and USB and FireWire support were optional components implemented as extensions. The phrase "system extension" later came to encompass faceless background applications as well.
Extensions generally filled the same role as DOS's terminate and stay resident programs, or Unix's daemons, although by patching the underlying OS code, they had the capability to modify existing OS behaviour, the other two did not.
The INIT mechanism
The concept of extensions was not present in the original Macintosh system software, but the system nevertheless had a private patching mechanism that developers soon learned to take advantage of - the INIT loader. This code would search for system resources of type 'INIT', and load and run them at boot time. The code resources had to be stored directly in the Mac System suitcase's resource fork, meaning it was only really available to "power users" who would be comfortable using ResEdit or other resource editor.
Since taking advantage of this mechanism was an unsupported hack, and only 32 INITs could be loaded in this manner, Apple responded by providing a more managed solution. Initially this itself was in the form of an 'INIT' resource with ID 31 placed in the System file that would search for further files of type 'INIT' in the System Folder, and load and run INIT resources inside them. (This is why some veteran Mac programmers still refer to the extensions loading mechanism as the "INIT 31 trick". INITs could now be installed simply by placing a file in the System Folder, well within the abilities of the average user. Starting with System 7, extensions were relocated to the Extensions folder within the System Folder for convenience, and an auto-routing mechanism was implemented so that placing an extension into the System Folder through drag and drop would actually place the file in the appropriate subfolder.
Extensions retained the resource type of 'INIT' throughout their lifetime, and the loader was gradually enhanced to search for these resources in numerous places, including in the resource forks of control panels in a variety of formats and the Chooser.
Extensions
INITs evolved into system extensions, gaining additional ad hoc protocols along the way, such as supplying an icon to be displayed at boot time (the origin of this was 'ShowINIT'). The 'parade of puzzle pieces and icons' across the screen as each extension loaded became familiar to all Mac users. Apple themselves eventually released major (but optiona |
https://en.wikipedia.org/wiki/Glyph%20Bitmap%20Distribution%20Format | The Glyph Bitmap Distribution Format (BDF) by Adobe is a file format for storing bitmap fonts. The content takes the form of a text file intended to be human- and computer-readable. BDF is typically used in Unix X Window environments. It has largely been replaced by the PCF font format which is somewhat more efficient, and by scalable fonts such as OpenType and TrueType fonts.
Overview
In 1988, the X Consortium adopted BDF 2.1 as a standard for X Window screen fonts, but X Windows has largely moved to other font standards such as PCF, Opentype, and Truetype.
Version 2.2 added support for non-Western writing. For example, glyphs in a BDF 2.2 font definition can specify rendering from top-to-bottom rather than simply left-to-right.
A BDF font file contains three sections:
a global section that applies to all glyphs in a font;
a section with a separate entry for each glyph; and
the statement.
Example
This is an example font containing one glyph, for ASCII capital “A”. This glyph is taken from the GNU Unifont.
STARTFONT 2.1
FONT -gnu-unifont-medium-r-normal--16-160-75-75-c-80-iso10646-1
SIZE 16 75 75
FONTBOUNDINGBOX 16 16 0 -2
STARTPROPERTIES 2
FONT_ASCENT 14
FONT_DESCENT 2
ENDPROPERTIES
CHARS 1
STARTCHAR U+0041
ENCODING 65
SWIDTH 500 0
DWIDTH 8 0
BBX 8 16 0 -2
BITMAP
00
00
00
00
18
24
24
42
42
7E
42
42
42
42
00
00
ENDCHAR
ENDFONT
In the above example, the global declarations begin with the line and end with the line.
defines the version of this BDF file as version 2.1.
defines the font family and face names as an X logical font description.
defines this to be a 16 point font, with an X-axis resolution of 75 dots per inch (dpi) and a Y-axis resolution of 75 dpi. This is the norm under X Window.
defines a bounding box for the font of 16 pixels wide by 16 pixels high, with the lower left-hand corner starting at and . Note that although the bounding box is defined to be a 16 by 16 cell, this can be overridden for individual glyphs. The “A” glyph, for example, is only 8 pixels wide.
declares that two special properties will follow. is optional in the BDF specification. X Window allows the properties and to show the height above and below the baseline, respectively, for all glyphs. declares that 14 of the 16 pixels in height are above the baseline. declares that 2 of the 16 pixels in height are below the baseline. appears at the end of the section.
declares that one character will follow. Although Adobe now refers to this file format as the Glyph BDF, they have retained the keyword in the final version of the specification.
Lines beginning with the word can be inserted within a BDF file. Anything following the keyword on a line is ignored.
Following the above global declarations, the following entries may repeat for each glyph.
specifies the start of a character in version 2.1 and earlier, or of a glyph in version 2.2. The string name of this particular character is , expressing in the Unicode convention the code poin |
https://en.wikipedia.org/wiki/Tony%20Sampson | Tony Sampson is a Canadian musician, oiler and retired actor. From 1999 to 2009, he voiced Eddy in the Cartoon Network animated series Ed, Edd n Eddy.
Biography
Tony Sampson was born on in Vancouver, British Columbia, Canada. He has played the role of Flash in the Canadian television drama The Odyssey and Eddy from Ed, Edd, n Eddy. Sampson has also worked for Vancouver's Ocean Productions and Voicebox Productions, primarily in anime.
After Ed, Edd n Eddy ended in 2009, he retired from acting to work in the oil sands industry in Fort McMurray, operating heavy equipment. Sampson later revealed this was because the production company he was working under threatened to blacklist him from the acting industry after requesting a modest raise.
Since 2013, he has been a musical artist with songs on Spotify and iTunes. Sampson once made a guest appearance at the March Toronto Anime Con in 2006.
Filmography
Animated films
Alien Racers as Kreff
Captain Zed and the Zee Zone as Nasty Norman, Additional Voices
Cardcaptors as Tori Avalon
Cardcaptors: The Movie as Tori Avalon
Dokkoida?! as Additional Voices
Dragon Ball Z (Ocean Dub) as Pigero (ep. 10)
Ed, Edd n Eddy as Eddy
Ed, Edd n Eddy's Big Picture Show as Eddy
Elemental Gelade as Rig (ep. 5), Additional Voices
Exosquad as Pirate
Fat Dog Mendoza as Additional Voices
Fatal Fury: Legend of the Hungry Wolf as Young Andy Bogard
Fatal Fury 2: The New Battle as Tony
Galaxy Angel as Darling (ep. 10), Max (ep. 20)
The Grim Adventures of the KND as Eddy
Hikaru no Go as Aoki
Human Crossing as Driver (ep. 5), Young Ichiro (ep. 6), Bully (ep. 11), Gang Member C (ep. 12)
Infinite Ryvius as Marco, Ryu Gil
Inuyasha as Seikai's Disciple (ep. 22)
Master Keaton as Phil (ep. 34)
Mega Man as Gemini Man
MegaMan NT Warrior as Dex Oyama
MegaMan NT Warrior Axess as Dex Oyama
Mobile Suit Gundam SEED as Miguel Aiman, Recap Narrator (ep. 26)
My Little Pony Tales as Teddy
Please Save My Earth as Jinpachi Ogura/Gyokuran
Project ARMS as Lt. Karl Higgins (eps. 21-23), Additional Voices
Ranma ½ as Genji Heita (ep. 74)
Starship Operators as Hide Chiba (eps. 3, 10 & 13)
Tokyo Underground as Additional Voices
Transformers: Armada as Fred
What About Mimi? as Brock Wickersham
X-Men: Evolution as Berzerker/Ray Crisp
Video games
Tonka Town as Chris the Crane, Tooey Timingbelt
Live-action
Annie O (1995 TV Film) as Heckler #1
Are You Afraid of the Dark? as Shawn Mackenzie ("The Tale of the Water Demons")
Da Vinci's Inquest as David Crayling ("The Most Dangerous Time")
Dead Like Me as College Boy ("Sunday Mornings")
Dirty Little Secret (1998 TV Film) as Clerk
Man of the House as Big Kid at School #1
Millennium as Anthony ("The Mikado")
Poltergeist: The Legacy as George ("The Substitute")
The Angel of Pennsylvania Avenue as Newsboy
The Commish as Derek ("The Sharp Pinch")
The Odyssey as Keith/Flash Haldane
The X-Files as Brad ("Red Museum"), Harley (Brother #1) ("Kill Switch")
Discography
Bla |
https://en.wikipedia.org/wiki/Semantics%20encoding | A semantics encoding is a translation between formal languages. For programmers, the most familiar form of encoding is the compilation of a programming language into machine code or byte-code. Conversion between document formats are also forms of encoding. Compilation of TeX or LaTeX documents to PostScript are also commonly encountered encoding processes. Some high-level preprocessors such as OCaml's Camlp4 also involve encoding of a programming language into another.
Formally, an encoding of a language A into language B is a mapping of all terms of A into B. If there is a satisfactory encoding of A into B, B is considered at least as powerful (or at least as expressive) as A.
Properties
An informal notion of translation is not sufficient to help determine expressivity of languages, as it permits trivial encodings such as mapping all elements of A to the same element of B. Therefore, it is necessary to determine the definition of a "good enough" encoding. This notion varies with the application.
Commonly, an encoding is expected to preserve a number of properties.
Preservation of compositions
soundness For every n-ary operator of A, there exists an n-ary operator of B such that
completeness For every n-ary operator of A, there exists an n-ary operator of B such that
(Note: as far as the author is aware of, this criterion of completeness is never used.)
Preservation of compositions is useful insofar as it guarantees that components can be examined either separately or together without "breaking" any interesting property. In particular, in the case of compilations, this soundness guarantees the possibility of proceeding with separate compilation of components, while completeness guarantees the possibility of de-compilation.
Preservation of reductions
This assumes the existence of a notion of reduction on both language A and language B. Typically, in the case of a programming language, reduction is the relation which models the execution of a program.
We write for one step of reduction and for any number of steps of reduction.
soundness For every terms of language A, if then .
completeness For every term of language A and every terms of language B, if then there exists some such that .
This preservation guarantees that both languages behave the same way. Soundness guarantees that all possible behaviours are preserved while completeness guarantees that no behaviour is added by the encoding. In particular, in the case of compilation of a programming language, soundness and completeness together mean that the compiled program behaves accordingly to the high-level semantics of the programming language.
Preservation of termination
This also assumes the existence of a notion of reduction on both language A and language B.
soundness for any term , if all reductions of converge, then all reductions of converge.
completeness for any term , if all reductions of converge, then all reductions of converge.
In |
https://en.wikipedia.org/wiki/WIEGO | Women in Informal Employment: Globalizing and Organizing (WIEGO) is a Manchester-based global research - policy network focused on improving conditions for workers in the informal economy. WIEGO's members include membership-based organizations of workers in the informal economy, researchers and development professionals.
The WIEGO network was founded in 1997 by a group of ten activists, researchers, and development practitioners, following a specialist's meeting on the informal economy in Bellagio, Italy. Among the founders was Professor Martha Chen, a Harvard Lecturer in Public Policy and currently a senior advisor with the network. The founding steering committee chair was Indian civil rights leader Dr. Ela Bhatt.
In July 2007, WIEGO was registered as a not-for-profit company limited by guarantee in the UK (WIEGO Ltd.) with a formal Constitution and Articles of Association. In 2011, WIEGO was granted charity status by the Charity Commission for England and Wales (Registered Charity No. 1143510).
Mission and Goals
WIEGO's stated mission: "WIEGO believes all workers should have equal economic opportunities and rights and be able to determine the conditions of their work and lives. WIEGO works to improve the status of the working poor, especially women, in the informal economy through increased organization and representation; improved statistics and research; more inclusive policy processes; and more equitable trade, labour, urban, and social protection policies."
WIEGO's objectives, as detailed in the Register of Charities, are "to relieve poverty in particular the poverty of the working poor in the informal economy caused by low earnings, high risks, and adverse working environments and conditions associated with the informal economy worldwide (including non-standard or unprotected employment for formal firms)".
Programmes and Activities
WIEGO supports working poor women by aiming to ensure they have adequate information, knowledge and tools and can mobilize around their rights, enhancing their safety and their earnings.
WIEGO does not set an agenda but rather supports domestic workers, street vendors, waste pickers, garment workers, smallholder farmers and others in articulating their own demands and participating directly in policy and planning processes.
Specific Research and Action
WIEGO commissions research that focuses on improving statistics on, and analyzing policies relating to, the working poor who make their living in the informal economy. Membership-based organizations (MBOs) of informal workers are always involved in the identification, prioritization and design of WIEGO activities.
Impact of Global Recession: In 2009 and again in 2010, WIEGO coordinated Global Economic Crisis studies to determine how informal workers were being affected by the global economic downturn. The study was executed by organizations involved in the global Inclusive Cities project, which is funded by the Bill & Melinda Gates Foundation. Two round |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.